AKAnkit kumar Singhinankitsingh2003.hashnode.dev·6d ago · 7 min read🚀 Mastering LeetCode 611: Valid Triangle Number | From Brute Force to Two Pointers (Complete Beginner Guide) Introduction When I first solved this problem, my first thought was: "Let's check every possible triplet." That solution works, but it has a time complexity of O(n³). Then I looked at the optimized 00
AKAnkit kumar Singhinankitsingh2003.hashnode.dev·6d ago · 4 min readMastering LeetCode 167: Two Sum II – Input Array Is SortedWhen I first looked at Two Sum II, my initial thought was to use the same brute-force approach as the classic Two Sum problem—check every possible pair. It works, but as expected, it isn't efficient f00
AKAnkit kumar Singhinankitsingh2003.hashnode.dev·Jul 9 · 7 min read🌊 Container With Most Water (LeetCode #11) – From Brute Force to Two Pointers | Complete Beginner GuideProblem Statement You are given an array height where each element represents the height of a vertical line. Your task is to choose any two lines such that together they form a container capable of 00
AKAnkit kumar Singhinankitsingh2003.hashnode.dev·Jul 7 · 6 min read🚀 Mastering LeetCode 15: 3SumIf you've spent any time on LeetCode, you've likely encountered the infamous 3Sum problem. It’s a classic interview question asked by top tech companies like Google, Amazon, and Meta. While it builds 00
AKAnkit kumar Singhinankitsingh2003.hashnode.dev·Jul 4 · 5 min readWhat I Learned While Solving LeetCode 125: Valid Palindrome 🚀When I first saw LeetCode 125: Valid Palindrome, I thought it would be a straightforward palindrome problem. My initial idea was simple: compare the first and last characters, then move inward. Proble00
