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
what is method overloading and overriding? Difference? Give examples.
I was asked two questions. One was given an array of integers find triplets such that a^2 + b^2 = c^2.
[Round 1] Find loop in a linked list
Longest palindrome in a string.
How to save resources' IDs used by an activity and access them in O(1), assuming there could be an infinite number of resources?
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?
nth highest salary SQL
General questions on based on your experience. Coding challenge about sorting, string processing.
Viewing 571 - 580 interview questions