An optimal algorithm to check whether a hand of cards was a full house (in Poker) or not.
Software Interview Questions
550,042 software interview questions shared by candidates
Just one question: shift an array to the right by n positions such that the right most indexes are become the first ones and the first ones move ahead. like: 1 2 3 4 5 --> shift by 2 --> 4 5 1 2 3
Only they need money no interview questions
There is an NxM grid containing a robot at (1, 1) and a destination at (N, M). Robot can move only up or right. Some locations can have obstacles. Find the number of unique paths from (1, 1) to (N, M). What is the time complexity of your algorithm?
There are 20 floors in a building. If you're on an elevator and you're trying to get to the 20th floor, what is the probability that 4 people ahead of you click the 20th floor before you do? Assuming you click last.
How to determine if an Array of integers contains 3 numbers that sum to 0
25 racehorses, no stopwatch. 5 tracks. Figure out the top three fastest horses in the fewest number of races.
How would you implement division without +, - or multiplication
This was not unexpected but a bit difficult. How would you represent the ordering of a deck of card if you only have 32bytes to work with. So, he explained that you have 52 objects, there are 52! possible ordering of them. how to encode one of those ordering within 32 bytes?
Viewing 231 - 240 interview questions
See Interview Questions for Similar Jobs
Major Account ExecutiveTest AnalystErp Implementation ConsultantAccount Executive Mid MarketSenior SalesProgrammer AnalystQa ManagerManual TesterTechnical Support AssociateChannel Sales ManagerConfiguration ManagerFull Stack EngineerEntry Level Digital Signal Processing EngineerJava DeveloperEntry EngineerEngineer DeveloperIos DeveloperEntry DeveloperIt Head