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…
Browsing Tag
Dynamic Programming
14 posts
Difference Between Greedy and Dynamic Programming
In the world of programming, there are two main approaches to solving problems; greedy and dynamic programming. Greedy…
Climbing Stairs Problem
Problem Statement Given a staircase of N steps you can either climb 1 or 2 steps at a…
Longest Common Subsequence
Problem Statement Given two strings, the task is to find the longest common subsequence present in the given…
Palindrome Partitioning Problem
Problem Statement Given a string s, partition s such that every partition of s is a palindrome. Find…
Sliding Window Maximum
Problem Statement Given an array of integers A. There is a sliding window of size K which is…
Longest Palindromic Subsequence (With Solution)
Problem Statement Given a string S, find the common palindromic sequence ( A sequence that does not need…
Edit Distance Problem
Problem Statement Given two strings A and B, find the minimum number of steps required to convert A…
Trapping Rain Water
Problem Statement Given an integer array A[] consisting of N non-negative integers representing an elevation map, where the…
Longest Common Substring
Problem Statement Given two strings, the task is to find the longest common substring present in the given…