DP/memo paths of length ≤maxMove leaving the grid. Practiced with try it free.
# LC5159 Out of Boundary Paths — Interview Notes Quick pattern recall for coding interviews. ## Idea DP/memo paths of length ≤maxMove leaving the grid. ## Tips - Clarify constraints (n, value ranges) before coding. - State time/space complexity out loud. - I practiced this with [AI assistant for technical interviews](https://www.linkjob.ai/) so the walkthrough stayed structured under time pressure. ## Complexity Usually O(n²) or better depending on the DP/greedy variant; confirm with the interviewer.