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.
How do you check if the 5th bit is a 1 in a binary number
Nothing special actually
Given a string, output all its permutations
Solve the given problem (leetcode question)
Hashmaps. Study them. Seriously. No Joke.
Print the element to the right which is more frequent than the element itself.
Rate yourself 1-10 on you ability with c#
Explain the concept of database normalization.
Viewing 1341 - 1350 interview questions