array compaction

Master Remove Duplicates from Sorted Array (LeetCode 26): In-Place O(1) Solution | Day 4 of 180

by
Master Remove Duplicates from Sorted Array (LeetCode 26): In-Place O(1) Solution | Day 4 of 180

2. Pattern Recognition: The Slow-Fast Pointer Why does the two-pointer technique fit this challenge so well? The two pointers take on distinct duties: 3. Algorithmic Approaches Approach 1: Extra Set / Buffer (Invalid) Approach 2: Optimal Slow-Fast Scan (MNC Standard) Plaintext 4. Production-Ready Code Implementations Java Solution Java Python 3 Solution Python C++ Solution C++ … Read more

Master Move Zeroes (LeetCode 283) in a Single Pass: In-Place Two-Pointer Trick | Day 3 of 180

by
Master Move Zeroes (LeetCode 283) in a Single Pass: In-Place Two-Pointer Trick | Day 3 of 180

Plaintext 2. Pattern Recognition: The Reader-Writer Pattern In Days 1 and 2, we used opposite-direction two pointers (inward scan). Day 3 introduces the same-direction two-pointer pattern (often called Fast & Slow or Reader & Writer). Spot this pattern whenever: The strategy assigns two distinct roles: 3. Algorithmic Approaches Approach 1: Extra Array Buffer (Suboptimal) Approach … Read more