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
given binary tree inorder & preorder traversal, return postorder traversal
Find a convergence point if any in given two linked lists.
Discuss 5 critical points for the usage and functionality of a ceiling fan.
Write a program in java that determines whether a string is a palindrome.
Walk me through your resume. Tell me about a time you had to overcome an obstacle. How would you check if two strings are anagrams.
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.
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.
Viewing 591 - 600 interview questions