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.
Given a head node to a linked list, find out the Nth to the last node in the list. Give test cases to the program.
Coding, logical thinking, testing strategies, problem solving
wat is the wait command for element to be loaded on the page
give example of different combination of severity & priority defects eg.high severity & low priority
Solve a Ransom Note
Given a 7 digit phone number, find out all the words that can be formed using this number based on the T9 keypad.
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.
Viewing 291 - 300 interview questions