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
wat is the wait command for element to be loaded on the page
Solve a Ransom Note
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.
nth highest salary SQL
General questions on based on your experience. Coding challenge about sorting, string processing.
Q.Write a program to rotate a string with index number? i/p:-Goibibo index:-4 o/p:-iboGoib
Viewing 311 - 320 interview questions