### Stone Game (7)

Alice and Bob take turns removing stones from either end of a row. Each player gains points equal to the sum of the remaining stones after their turn. Bob aims to minimize the score difference, while Alice aims to maximize it. The task is to determine the maximum difference between Alice and Bob ### Stone Game (9)

Alice and Bob take turns removing stones from a row, aiming to avoid making the sum of the removed stones divisible by 3. If a player removes a stone that results in a sum divisible by 3, they lose. The task is to determine whether Alice wins or Bob wins. ### Interleaving String

The problem involves determining if a string can be formed by interleaving 2 smaller strings ### Maximum Strictly Increasing Cells in a Matrix

The problem revolves around navigating an integer matrix from a starting cell following a set of rules. The task is to determine the maximum number of cells that can be visited. ### Number of Pairs Satisfying Inequality

The problem involves two arrays, and an integer diff. The task is to count the number of pairs (i, j) satisfying an inequality.