Saravana Sai saravanasai.hashnode.dev·Nov 22, 2024LeetCode Minimum Path Sum Explained: A Dynamic Programming ApproachIntroduction The "Minimum Path Sum" problem is a classic dynamic programming challenge commonly found on platforms like LeetCode. In this blog post, we will walk through the solution to the "Minimum Path Sum" problem step by step, using a dynamic pro...leetcode-solution
Siddhesh Dhavalesiddheshdhavale.hashnode.dev·Oct 6, 2024Leetcode ExplanationEfficiently Solving Leetcode 240: Search A 2D Matrix II Introduction: In this article, I'll walk you through the thought process and solution for Leetcode problem 240: "Search a 2D Matrix II". This problem tests our ability to search in a 2D matrix w...87 readsleetcode
Shiv Aroraleetcodedaily.hashnode.dev·Aug 16, 2024Leetcode: 16/08/2024Maximum Distance in Arrays(From Intuition to the Optimized Code: Intuition: Intuition behind this problem is to first find all the pairs such that we got maximum absolute difference, But in question it is mentioned that m arrayLists are sorted, So ca...arrays
Tanusha Rainatechshetalks.hashnode.dev·Aug 6, 2024Kicking Off My DSA Journey: LeetCode Like a Lady, Cracking Coding Interviews in HeelsHello, world! I’m excited to announce the launch of my new blog series on Hashnode, titled "LeetCode Like a Lady: Cracking Coding Interviews in Heels". I’ll be documenting my journey through Data Structures and Algorithms (DSA). I've completed the ar...10 likesLeetCode Like a Lady: Cracking the Coding Interview in HeelsDSA
Sean Coughlinblog.seancoughlin.me·Jun 28, 2024Mastering LeetCode: Solving the "Product of Array Except Self" ProblemIntroduction Solving algorithmic problems is a critical skill for any aspiring software engineer, and LeetCode offers a treasure trove of challenges to hone this skill. One such problem is the "Product of Array Except Self," a classic problem that te...42 readsSWE Interview Preparationleetcode
Sean Coughlinblog.seancoughlin.me·Jun 27, 2024Mastering LeetCode's Coin Change Problem: A Comprehensive GuideIntroduction The "Coin Change" problem is a classic algorithmic challenge that often appears in coding interviews and competitive programming. Solving this problem efficiently is crucial for aspiring software engineers as it tests one's understanding...249 readsSWE Interview Preparationleetcode
Sean Coughlinblog.seancoughlin.me·Apr 19, 2024Getting Started with Studying for Software Engineering Interviews Using LeetCodeSoftware engineering interviews can be daunting, especially when they involve algorithmic questions which are a staple at many top tech companies. This blog post will guide you through getting started with your interview preparation using LeetCode, a...240 readsSWE Interview Preparationleetcode
Evelyn Liuevelynsjourney.hashnode.dev·Apr 1, 2024Day 49 of LeetCodeDocumenting LeetCode solving. Q126 10. Regular Expression Matching Hard. DP class Solution: def isMatch(self, s: str, p: str) -> bool: dp = {} def dfs(i, j): if (i, j) in dp: return dp[(i, j)] ...30+20 days of LeetCode leetcode
Evelyn Liuevelynsjourney.hashnode.dev·Mar 29, 2024Day 48 of LeetCodeDocumenting LeetCode solving. Q125 312. Burst Balloons Hard. DP Reverse thinking. class Solution: def maxCoins(self, nums: List[int]) -> int: nums = [1] + nums + [1] dp = {} def dfs(l, r): if l > r: ...30+20 days of LeetCode leetcode
Evelyn Liuevelynsjourney.hashnode.dev·Mar 26, 2024Day 47 of LeetCodeDocumenting LeetCode solving. Q123 115. Distinct Subsequences Hard. DP class Solution: def numDistinct(self, s: str, t: str) -> int: dp = {} def dfs(i, j): if j == len(t): return 1 if i == ...30+20 days of LeetCode leetcode
