ATLASSIAN SWE OA (2024) | Reachability Analysis and Pattern-Based String Classification Problems | Off -Campus

Q1. Maximum Reach Navigation Problem Problem Statement You are given an integer array nums where: nums[i] represents the maximum number of positions you can move forward from index i. Starting from index 0, determine whether it is possible to reach the last index of the array. Return: true if the last index is reachable, otherwise return: false   Example 1 Input nums = [2,3,1,1,4] Output true   Explanation One possible path: 0 → 1 → 4 Successfully reaches the final ...