Edit Distance Problem
Problem Statement Given two strings A and B, find the minimum number of steps required to convert A…
Browsing Tag
Dynamic Programming
14 posts
Trapping Rain Water
Problem Statement Given an integer array A[] consisting of N non-negative integers representing an elevation map, where the…
Difference Between Greedy and Dynamic Programming
In the world of programming, there are two main approaches to solving problems; greedy and dynamic programming. Greedy…
Longest Common Substring
Problem Statement Given two strings, the task is to find the longest common substring present in the given…
Longest Common Subsequence
Problem Statement Given two strings, the task is to find the longest common subsequence present in the given…
Difference Between Divide and Conquer and Dynamic Programming
A divide-and-conquer algorithm recursively splits a problem into two or more subproblems of similar or related types, until…
Palindrome Partitioning Problem
Problem Statement Given a string s, partition s such that every partition of s is a palindrome. Find…
Coin Change Problem
Problem Statement We are given an array of coins having different denominations and an integer sum representing the…
Minimum Number of Jumps
Minimum Jumps To Reach End of an Array Given an array of non-negative integers, A, of length N.…
Climbing Stairs Problem
Problem Statement Given a staircase of N steps and you can either climb 1 or 2 steps at…