Algorithm · Snapchat · Hard
Examples Example 1 Example 2 Requirements Build a solver for escaping across a grid. The task may be presented in either of these connected versions: Given a layout containing people, exits, and obstacles, determine whether every person can get out or calculate the minimum escape duration, meaning the smallest number of minutes from departure until arrival at an exit. Given a starting cell and destination, potentially add obstacles, then introduce fire origins and determine…
Checking your access…