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.
2. What are page objects.
Is it okey to reschedule the interview to yet another date?
How do you check whether String contains any duplicate characters?
Algorithms, coding and about project.
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 121 - 130 interview questions