Given a string of Rs and Gs, design an algorithm to produce a string with Rs in the front and Gs after that. The number of flips from Rs to Gs or otherwise should be minimum. The number of Rs and Gs in the end need not be same as that in the beginning, however the length of the entire string should be the same.
First question was to find all numbers that occurred an odd-number of times in an array and second question was implement a stack that could return the largest number in the stack at anytime.
You have a machine that can create anything. You just have to specify the details, and voila, it will give you the output. Design test cases for such a machine
Write the pseudocode to reverse a string
Why did you apply? How your experience matches the position?
Define Finance as it relates to a Bank
Given two lists of sorted integers, develop an algorithm to sort these numbers into a single list efficiently.
Use 12V supply to provide 2V supply
If I spin a roulette, roll a dice, and pick a card out of a 52-card deck, what are the chances that all three are the same number? How confident are you in your answer?
Now, you have an option to reflip all the coins if you want. What's your strategy? And how what's the expected value?
Viewing 201 - 210 interview questions