Consider two arrays of integers, v1 and v2, with allocate memory of (n+m)*sizeof(int) and m*sizeof(int), respectively; In array v1, you have the first n positions filled with integers, sorted in ascendent order. In array v2, you have all m positions filled with integers, also sorted in ascendent order. Write/implement a function that return a vector of size (n+m)*sizeof(int) that have all the elements of v1 and v2, sorted in an ascendent order
Write a program in java that determines whether a string is a palindrome.
Given an int array and an int X, find out if two elements sum up to X
Display the first 3 character of a word(string)
Generate all permutations of a string and determine if each is in the dictionary. Find an efficient data structure for the dictionary.
How would you test a vending machines? Write some test cases.
Implement strstr in the language of your choice.
Write a function that finds all the times a clocks hours and minutes hand are at 90 degrees.
convert strings into int types;
in final 10 min he give me problem to find median of two shorted arrays
Viewing 251 - 260 interview questions