One question I parrticularly remember was to calculate EV of 2 games with a box in each. One game has a box with 100 notes that give +1 and a note that gives -100. The other game has a box with 100 notes that give -100 and a note that gives +100. You have to calculate EV of each game and choose which one to play and why

Problem Analysis: A k-star consists of a center node and up to k arms (edges to other nodes) We need to find the k-star with maximum sum of all its nodes For each potential center, we choose the best neighbors (up to k) to maximize sum Algorithm: Build an adjacency list from the edges For each node as a potential center: Get all its neighbors Sort neighbors by their values (descending) Select up to k best neighbors Calculate sum: center + selected neighbors Return the maximum sum found

flip a coin the expected number to get two H