Browsing Tag

# Dynamic Programming

14 posts

## 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…

## Difference Between Greedy and Dynamic Programming

In the world of programming, there are two main approaches to solving problems; greedy and dynamic programming. Greedy…

## Edit Distance Problem

Problem Statement Given two strings A and B, find the minimum number of steps required to convert A…

## 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…

## Longest Palindromic Subsequence (With Solution)

Problem Statement Given a string S, find the common palindromic sequence ( A sequence that does not need…

## Sliding Window Maximum

Problem Statement Given an array of integers A.  There is a sliding window of size K which is…

## Longest Common Substring

Problem Statement Given two strings, the task is to find the longest common substring present in the given…