Dec 14, 2025 · 4 min read · Problem Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2. (link) You have the following three operations permitted on a word: Insert a character Delete a character Replace a character ...
Join discussionOct 20, 2025 · 1 min read · Brief DP - Those who cannot remember the past are condemned to repeat it. Approaches Dynamic programming we solve using the following 2 approaches. For any problem we go from the memoization to tabulation and followedby optimization of space. Memoiza...
Join discussionJun 15, 2025 · 3 min read · 📖 Introduction Dynamic Programming (DP) is a fundamental technique in solving problems with overlapping subproblems and optimal substructure. Two core strategies used in DP are: Memoization (Top-Down) Tabulation (Bottom-Up) In this blog, we’ll b...
Join discussionJan 10, 2025 · 6 min read · Introduction Dynamic programming (DP) is a powerful algorithmic technique used to solve complex problems by breaking them down into simpler subproblems. It is particularly useful when a problem exhibits optimal substructure, meaning the solution to t...
Join discussion
Nov 9, 2024 · 6 min read · Welcome to Chapter 46 of my Data Structures and Algorithms (DSA) Series! In this chapter, we dive into essential dynamic programming concepts focused on matrix operations and complex problem-solving techniques. Dynamic programming is all about breaki...
Join discussion