Anuta Networks 2022 OA | Coding Questions with Detailed Solutions | 2022 | Maximum Index

Problem Statement: Maximum Index The Objective: You are given an infinite array of integers starting from 0. A pointer starts at index 0. You are given a number of steps and a badIndex that must be avoided. The Rules: In each step j (where j starts at 1 and increments by 1 each step), you have two choices: Move: Move j units forward from your current index i to i+j. Stay: Remain at your current index i. Constraint: You can ...