Dynamic ProgrammingI will create a detailed markdown document covering all major Dynamic Programming (DP) patterns. Each pattern will include: A brief summary explaining its significance and when to use it. Common techniques and tricks to solve problems under this pa...84 min read·lietnode.hashnode.devMar 20, 2025
Climbing Stairs1. Introduction to Dynamic Programming Dynamic Programming (DP) is a problem-solving technique that involves breaking a complex problem into simpler overlapping subproblems and solving each subproblem only once. In other words, DP trades redundant co...84 min read·lietcode.hashnode.devMar 20, 2025
Evaluate Division - BFSYou are given an array of variable pairs equations and an array of real numbers values, where equations[i] = [A<sub>i</sub>, B<sub>i</sub>] and values[i] represent the equation A<sub>i</sub> / B<sub>i</sub> = values[i]. Each A<sub>i</sub> or B<sub>i<...4 min read·lietcode.hashnode.devJun 30, 2024
Word Ladder II - BFSA transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s<sub>1</sub> -> s<sub>2</sub> -> ... -> s<sub>k</sub> such that: Every adjacent pair of words differs by a single letter. ...4 min read·lietcode.hashnode.devJun 30, 2024