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
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
Q: By share screen, please create code to reverse each words in a sentence.
Longest palindrome in a string.
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?
Program to check if a "ransom note", has been taken from a particular news paper article. Which meant you were given two arrays of strings, and you had to check if the first array, could have been constructed from the second set
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