Alternating Direction Height Jump

Asked at Verkada · Coding & Leetcode-style Questions · Difficulty: Medium

Given an integer array `nums` of length `n`, a starting index `start`, and an initial search direction `dir` where `L` means left and `R` means right.

Loading the problem…