Sethuram.S.VTrieHave you ever wondered how auto-complete, spell checkers/auto-correct, browser history and etc., work? How are they so effective in…6 min read·Oct 5, 2022----
Sethuram.S.VDP — Optimization Problem using TabulationIn the previous blogs, we have seen how to solve the decision and combinatorics problems using DP — tabulation. This time, we’ll see about…4 min read·Sep 11, 2022----
Sethuram.S.VSalvationSo, to my usual readers, this isn’t my usual Data structures and Algorithms blog which I used to write. Rather this is going to be a blog…5 min read·Jul 9, 2022----
Sethuram.S.VDP — Combinatorics Problem using TabulationWhat is a combinatorics problem?6 min read·Jul 6, 2022----
Sethuram.S.VDP — Decision Problem using TabulationThe three most common types of problems in dynamic programming are - 1. decision problem, 2. combinatorics problem, and 3. optimization…6 min read·Jan 9, 2022----
Sethuram.S.VDP — Optimization Problem using MemoizationIn the previous blogs, we have seen how to solve the decision and combinatorics problem using DP. This time around, we’re going to see…5 min read·Nov 1, 2021----
Sethuram.S.VDP — Combinatorics Problem using MemoizationAs discussed in the previous blog, the three most common types of DP problems are - 1. decision problem, 2. combinatorics problem, and 3…5 min read·Oct 15, 2021----
Sethuram.S.VDP — Decision Problem using MemoizationThe three most common types of DP problems are - 1. decision problem, 2. combinatorics problem, and 3. optimization problem. We’ll cover…4 min read·Aug 30, 2021----
Sethuram.S.VDP — Introduction to Dynamic Programming: Part 2“Those who do not remember the past are condemned to repeat it.”5 min read·Aug 3, 2021----
Sethuram.S.VDP — Introduction to Dynamic Programming: Part 1Dynamic programming is an algorithmic approach for solving an optimization problem by breaking it down into simpler subproblems and…5 min read·Jul 12, 2021----