Affirm

I was asked Implement the card game war. Rules are: 1. Deal out deck of 52 cards between two users. 2. Each player plays a card. Higher card wins. Winner takes both cards. 3. If players tie, then each player puts down three cards, and the third card competes. If a player has less than 3 cards, then they put down all of their cards and their final card competes against the other player's third card. Continue doing this until tie is broken. Winner takes all cards. 4. Game is over when a player doesn't have any cards. The player with cards remaining is the winner. and a variation with a few constraints..

I was asked to build json parser.

I did a project for them. Assigning loans to funding sources. Looks like they've had this same exercise for a while now.

Any update?

I was asked a non lc question, question takes about 15-20 min to understand and a bunch of edge cases

I was asked to implement a custom data structure that can return a random value in O(1). And then modify this data structure to eliminate duplicate values before returning the random value.