Day 3 - LeetCode Learning Log
🚀 Building Blocks I Practiced Today
Slow Fast Pointer - Finding middle of LL
Also called as Hare & Tortoise Algorithm.
Used for detecting cycle, finding middle, happy number, etc.
O(n) time, O(1) space
// Finding middle of a Linked List
...
ayush-30-days-of-leetcode.hashnode.dev2 min read