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
Find a convergence point if any in given two linked lists.
Generate all permutations of a string and determine if each is in the dictionary. Find an efficient data structure for the dictionary.
Data structures and algorithms, with a bit of design and some soft questions about your goals and background.
If a sorted array is rotated, how to find how many times it has been rotated.
How would you test a vending machines? Write some test cases.
Implement strstr in the language of your choice.
what is method overloading and overriding? Difference? Give examples.
Write a function that finds all the times a clocks hours and minutes hand are at 90 degrees.
convert strings into int types;
Viewing 581 - 590 interview questions