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
Graph Coloring problem: given a connected graph, color each node in the graph such that no two adjacent nodes have the same color.
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.
implement atoi
Write a function that checks if a number's divisors sum up to that number, i.e. whether it's a perfect number or not.
find duplicates in an array with space efficiency
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.
Hardest question was how to sort a linked list using recursion only. I knew the iterative solution but couldn't come up with recursion. Very difficult.
Viewing 871 - 880 interview questions