Remove all characters of a string from another string. The algorithm should be less than O(m*n) where m & n are lengths of strings and the space used should be less than O(m+n).
Senior Sdet Interview Questions
4,403 senior sdet interview questions shared by candidates
reverse a linked-list
Write a program to find out in a sorted array the sum of any two numbers present in the array is closest to the a number given. if you have an array 4, 6, 8,24,36 and the given number is 31 then output should be 24 + 6 = 30
you have 100 doors in a row that are all initially closed. you make 100 passes by the doors starting with the first door every time. the first time through you visit every door and toggle the door (if the door is closed, you open it, if its open, you close it). the second time you only visit every 2nd door (door #2, #4, #6). the third time, every 3rd door (door #3, #6, #9), etc, until you only visit the 100th door.
How to test a clock
Q: By share screen, please create code to reverse each words in a sentence.
Algorithms, coding and about project.
Longest palindrome in a string.
Generate all permutations of a string and determine if each is in the dictionary. Find an efficient data structure for the dictionary.
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
Viewing 41 - 50 interview questions