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?
Milestone 2) Will ask to optimize by reducing the number of unfulfilled orders. The apis will be confusing and you will have two interviews during the coding session.
In a given sorted array of integers remove all the duplicates.
Consider a stack of N number of cards which are piled up and in facing down. Each card has a unique number from the range 1 to N. The card is stacked in such a way that it exhibits the following behavior: Take the first card and put it under the stack without revealing. Now the next card on the top will have the number 1 on it. Next take 2 cards one after the other and put is under the stack without revealing. Yes you guessed it right - the next card on the top will reveal a value of 2. This goes on. Eg. for such a series : 9,1,8,5,2,4,7,6,3,10 [for N=10] Write a program to generate such a series for a given N number of cards so that this behavior can be exercised.
Which is the superclass of all classes?
What was the last thing you googled?
Sell me pen.
1 million card applications. $1 per application cost to do employment verification. 96% pass verification and get a card. 4% fail and do not get cards. Given average profits on cardholders in good standing, and average losses on accounts that default, find the % of denied cardholders that would have to default in order to justify the $1 per application verification cost .
Given a binary tree with the usual left and right pointers on each node, and additionally a parent pointer, make an algorithm to discover the closest ancestor to 2 nodes on the tree.
Why Siemens? Tell me about yourself
Viewing 51 - 60 interview questions