1. Random Walk Card Game: consider the following game. Beginning with a deck of even size = N cards that are half red and half green (N/2 each), you begin drawing cards. For each red card, you win $1 and for each green card you lose $1. You may stop at any time. What is the value of this game to you assuming you play optimally? Write a program that computes this value. Hints: consider recursion 2. Worst Trade Reporter You are tasked with building a tool to analyze trades. For the purpose of this problem, every trade - id, company, buy/sell, price, and volume. You receive a stream of N instructions. Each instruction can be an update or a query. Updates are: trades - indicates that a trade has happened price - indicates that the true value of an instrument has been updated query: output the tradeID of the worst trade for an instrument.

Lots of stats questions, so brush up on statistics