You are given a list of strings (e.g. ["cat", "dog", "hat", "apple", "c"] ). Write a program that would take as input a string containing a wild card character, like "*at", "**t" (could be "cat", "hat", "bat"), "ca*", etc. and return true if there is a corresponding string in the list, and false otherwise.
Reverse the words in a sentence. For example, "Have a nice day" becomes "day nice a Have"
You have two linked lists that merge at some node. The lists could be billions of nodes long. Find the node where the lists merge in the most optimal time while using a low amount of memory.
You have 8 balls. All are identical except one is slightly heavier. You have a balance. What is the minimum number of weighings required to find the heavier ball?
How many unique paths are there from B-L point to the T-R point of a chess table? What would be your approach to calculate this?
string compression: aaabbbbcc ->a3b4c2
Describe a function (in C) that does the following Input : an integer. Output: if that integer is 4, the function returns 7. if that integer is 7, the function returns 4. constraints: the input is SURE to be either 4 or 7. no need to validate. you are not allowed to use any condition/flow commands (if, switch, while, for, trinary operator...) you are not allowed to use any external library or import anything (like math..) you are not allowed to use %(modulu), * (multiplication)
reverse bits of an integer that is a power of 2 , keeping complexity in mind.
Given an integer array, write a program that returns an array with elements = product of the integers in input array except the one in its position. Ex: Given input: [2, 3, 10, 4, 5], output: [600, 400, 120, 300, 240] What is the complexity of your program? When will your program not work? Below is what I presented (O(n)), but it did not qualify me for the next round.
If a batsman given super powers so that he can hit any run[6,4 ,etc] and he wants to score highest run for himself , how he'll do that in 50 over game?
Viewing 711 - 720 interview questions