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

A divide-and-conquer algorithm recursively splits a problem into two or more subproblems of similar or related types, until…

June 24, 2022

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

June 24, 2022

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

June 15, 2022

Problem Statement Given a string s, partition s such that every partition of s is a palindrome. Find…

November 9, 2021

Problem Statement We are given an array of coins having different denominations and an integer sum representing the…

June 15, 2022

Minimum Jumps To Reach End of an Array Given an array of non-negative integers, A, of length N.…

June 15, 2022

Problem Statement Given a staircase of N steps and you can either climb 1 or 2 steps at…

June 15, 2022

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

October 21, 2021

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

October 13, 2021

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

June 15, 2022