DE Shaw | OA | September 2024 (How to solve Q2?)

Round 1

Questions:

1. Count the Number of Incremovable Subarrays II
2. Given a 2D grid, with S as start, E as end, * as valid position and # as blockers. Find the minimum number of jumps required to reach from start to end. We can make jumps of any length in 4 directions. If we make a jump of more than 1 length in some direction, the next jump should be in the same direction.