TLThync Labsinthynclabs.hashnode.dev·3d ago · 7 min readWhy You Can Solve LeetCode but Still Fail the Coding InterviewYou've solved 300 problems. Maybe 500. You recognize a sliding-window question on sight, you know your DP patterns cold, and your submission streak is a wall of green. Then you walk into the real inte00
TVThrishali Vittalinmycodingchallenge.hashnode.dev·5d ago · 5 min readDay 7 – Solving Longest Common Prefix in PythonOne of the common string problems asked in coding interviews is Longest Common Prefix. At first glance, the problem seems straightforward, but it teaches us how to compare multiple strings efficiently00
TVThrishali Vittalinmycodingchallenge.hashnode.dev·6d ago · 6 min readLeetCode Day 6: Valid Parentheses – Python Solution The Valid Parentheses problem is one of the most popular beginner-friendly stack problems on LeetCode. It teaches you how to process nested structures efficiently and introduces the concept of Last In00
TVThrishali Vittalinmycodingchallenge.hashnode.dev·Jul 24 · 5 min readLeetcode Day 5 – Solving Valid Parentheses Using a Stack in PythonWhen I first looked at the Valid Parentheses problem, it seemed simple because it only involved brackets. But after trying a few test cases, I realized that the challenge is keeping track of the order00
RKRohit Kumharintech-rohit.hashnode.dev·Jul 23 · 38 min readMaster the Two Pointers Pattern in Python (Part 1): Two Sum, Squares of Sorted Array & Remove DuplicatesIntroduction If you've spent time solving coding interview problems, you've probably noticed a common pattern: many array problems seem to invite a nested loop solution. While that approach works, it 10
TVThrishali Vittalinmycodingchallenge.hashnode.dev·Jul 23 · 4 min readLeetCode Day 4: Two Sum (Brute Force) | Python In this article, we'll break down the brute-force solution step by step. Problem Statement Given an array of integers nums and an integer target, return the indices of the two numbers such that they 00
EOEnoch Olutunmidainthatsametechguy.com·Jul 21 · 6 min readLeetCode 3499: Maximise Active Section with TradeYou're given a binary string where 1 represents an active section and 0 represents an inactive one. You get exactly one trade: Erase a block of 1s that has 0s on both sides. Fill a block of 0s that 00
TVThrishali Vittalinmycodingchallenge.hashnode.dev·Jul 22 · 4 min readLeetCode Day 3 – Palindrome Number (Python) A palindrome number is a number that reads the same forward and backward. Examples Example 1 Input: x = 121 Output: True Because reading 121 from left to right and right to left gives the same number00
AAnnetinhtml-portfolio.hashnode.dev·Jul 22 · 7 min readMastering Searching Algorithms in Python: From Linear Search to Binary Search 🔍After learning Arrays, the next topic I explored was Searching Algorithms. At first, searching seemed straightforward. But as I started learning Binary Search, I discovered that it's much more than ju00
TVThrishali Vittalinmycodingchallenge.hashnode.dev·Jul 21 · 3 min readLeetCode Day 2: Merge Two Sorted Lists (Easy) | Python Solution ExplainedIn this blog, we'll solve the problem step by step, explain why we use a dummy node, and analyze the time and space complexity. Problem Statement You are given the heads of two sorted linked lists. Me00
