The Augmented Dev · Archive
Dynamics 365, Power Platform, AI, system design, and web development — filter by theme or search across every post.
Newsletter
One email per post. No spam, no tracking pixels, unsubscribe anytime.
11 of 325 articles tagged fast-slow-pointers
Cycle detection with direction rules and path invalidation. Python solution and complexity analysis for the fast and slow pointers interview pattern.
One-pass middle deletion — track the node before the midpoint. Python solution and complexity analysis for the fast and slow pointers interview pattern.
No mutation, O(1) space — the array is secretly a cyclic list. Python solution and complexity analysis for the fast and slow pointers interview pattern.
Floyd's algorithm on an implicit sequence — no nodes required. Python solution and complexity analysis for the fast and slow pointers interview pattern.
Find where two lists merge by switching heads at the ends. Python solution and complexity analysis for the fast and slow pointers interview pattern.
Detect a cycle in O(1) space and argue why the pointers must meet. Python solution and complexity analysis for the fast and slow pointers interview pattern.
Return the node where the cycle starts — and prove the reset trick. Python solution and complexity analysis for the fast and slow pointers interview pattern.
Find the midpoint without counting — the half-speed invariant. Python solution and complexity analysis for the fast and slow pointers interview pattern.
Palindrome check via midpoint split and half reversal. Python solution and complexity analysis for the fast and slow pointers interview pattern.
Delete the n-th from the end in one pass with a dummy head. Python solution and complexity analysis for the fast and slow pointers interview pattern.
L0-Ln-L1-Ln-1 interleaving via split, reverse, and merge. Python solution and complexity analysis for the fast and slow pointers interview pattern.
