Here are some of the questions I received during my onsite.

1. Given a deck of cards as a string input and an integer K denoted as number of moves. During first(even) move we discard the top card (left character). During the second(odd)move, we put bottom card (right character on the btm of deck) on the top. This procedure repeat until the k move. After k moves, what is card on the top of the deck?

2. Given a string mainString, two substring strA and strB. Find the shorest substring in mainString that contain strA and strB in order. i.e: strAxxxstrB that has the shortest length
   Followup: how to do that when we are given K substring instead?

3. Given a list of x,y coordinates that forms up a polygon and an integer K. Divide the polygon into K equal segments and return the list of coordinates for each segment. (equal size & draw new polygon)

4. One more on probability and graph, can't really remember clearly