Play a game that always starts from you. Each time you can only pick up 1 or 3 or 4 coins from the table. Who leaves the enemy with no coins to pick up wins the game. Assume that your enemy is super intelligent that if there is a way he/ she can win, he/ she wins. Question: Write a function to return if you will win or lose the game say given n coins on the table.
How would you find the second largest integer in an unsorted array? Write the code.
Given a text file, perform a pre-processing step to create a DS; so later when queried for a word, the lookup is very fast.
How do you check if the 5th bit is a 1 in a binary number
Nothing special actually
All questions were pretty easy.
Serialize a binary tree
Write a function to get the most repeated word in a string.
Given a string, output all its permutations
In the third round, I got asked a lot of data structures and algorithms questions.
Viewing 2021 - 2030 interview questions