You have learned array greedy problems:
Track extremes: : Jump Game tracks furthest reachable position.
Reset on failure: : Gas Station and Kadane reset when conditions fail.
Two-pointer: : Boats pairs from both ends.
Multi-pass: : Candy handles bidirectional constraints with two passes. Good job on finishing this section. These patterns appear in many interview questions. The key is recognizing when greedy choices lead to optimal solutions.