--- title: "#tabulation articles | Hashnode" description: "Explore 5 articles tagged #tabulation on Hashnode. Tutorials, guides, and how-tos from the community." url: "https://hashnode.com/tag/tabulation" --- Tag # #tabulation 5 posts · 0 followers [Chetan Datta](https://hashnode.com/@chetan77) · [Dec 14, 2025](https://hashnode.com/posts/edit-distance/693e9ba7ad1645dc6996c271) ### [Edit Distance](https://chetan77.hashnode.dev/edit-distance?utm_source=hashnode&utm_medium=feed) 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 ... 4 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/edit-distance?utm_source=hashnode&utm_medium=feed) [Chetan Datta](https://hashnode.com/@chetan77) · [Oct 20, 2025](https://hashnode.com/posts/dynamic-programming/68f6388ec87dc608fd6c8478) ### [Dynamic Programming](https://chetan77.hashnode.dev/dynamic-programming?utm_source=hashnode&utm_medium=feed) 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... 1 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/dynamic-programming?utm_source=hashnode&utm_medium=feed) [kasumbi phil](https://hashnode.com/@kasumbi) · [Jun 15, 2025](https://hashnode.com/posts/memoization-vs-tabulation-in-dynamic-programming-explained-with-climbing-stairs/684e7f0b220cad500d5150e1) ### [Memoization vs Tabulation in Dynamic Programming – Explained with Climbing Stairs](https://kasumbidatastructures.hashnode.dev/memoization-vs-tabulation-in-dynamic-programming-explained-with-climbing-stairs?utm_source=hashnode&utm_medium=feed) 📖 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... 3 min read · [kasumbidatastructures.hashnode.dev](https://kasumbidatastructures.hashnode.dev/memoization-vs-tabulation-in-dynamic-programming-explained-with-climbing-stairs?utm_source=hashnode&utm_medium=feed) [Arka Infotech](https://hashnode.com/@arkainfotech) · [Jan 10, 2025](https://hashnode.com/posts/dynamic-programming-solving-problems-with-optimal-substructure/678109b475418dcaadd6903b) ### [Dynamic Programming: Solving Problems with Optimal Substructure](https://blogs.arkainfotech.in/dynamic-programming-solving-problems-with-optimal-substructure?utm_source=hashnode&utm_medium=feed) Master dynamic programming fundamentals, key concepts, and complex problems with code examples. Explore applications across various fields 6 min read · [blogs.arkainfotech.in](https://blogs.arkainfotech.in/dynamic-programming-solving-problems-with-optimal-substructure?utm_source=hashnode&utm_medium=feed) [Rohit Gawande](https://hashnode.com/@rohit253) · [Nov 9, 2024](https://hashnode.com/posts/chapter-46-dynamic-programming-part-6-dsa-series/672f51eea5ff63afab0f13a2) ### [Chapter 46: Dynamic Programming (Part 6) - DSA Series](https://rohitgawande.dev/chapter-46-dynamic-programming-part-6-dsa-series?utm_source=hashnode&utm_medium=feed) 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... 6 min read · [rohitgawande.dev](https://rohitgawande.dev/chapter-46-dynamic-programming-part-6-dsa-series?utm_source=hashnode&utm_medium=feed)