Day 80 of 300 Days of DSA Series | LeetCode 1051 : Height Checker

Rakesh Kumar on Instagram: "💧 Container With Most Water – LeetCode 11 (Two Pointer Technique) LeetCode 11 is a classic Two Pointer interview problem that looks brute-force at first but is solved optimally using smart pointer movement. 📌 Key idea: Use two pointers from both ends Area = min(height[left], height[right]) × distance Move the pointer with smaller height Greedy logic reduces time complexity ⏱️ Time Complexity: O(n) 💾 Space Complexity: O(1) If you understand why the smaller height po