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
Write a program in java that determines whether a string is a palindrome.
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.
Solve a Ransom Note
Name some software design patterns?
What is the maximum bench period you can endure. What if u get a better compensation in your notice period
2. What are page objects.
Is it okey to reschedule the interview to yet another date?
All about resume, why SCFDMA in uplink, PHFICH channel frequencies, what happens in MRC, LTE call procedure.
Viewing 261 - 270 interview questions