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
- written round - technical round - personal round - one more personal round with Head
Longest palindrome in a string.
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.
You are given two buckets. One holds 3 gallons and the other holds 5 gallons. Have do you make 4 gallons of water?
Algorithms and data structures in Java.
What is one thing you've learned from school that can be applied to your job?
Solve a Ransom Note
Different software models and methodologies
Differentiate b/w speed-velocity and pressure/stress.
Viewing 281 - 290 interview questions