Dynamic Programming

1.5k+ posts

Last Updated: 23 April 2024

Greedy approach and Dynamic programming are two different algorithmic approaches that can be used to solve optimization problems. Here are t ...read more

Dynamic Programming

Greedy

knapsack

Difference Between

DSA

Steps to solve a Dynamic Programming Problem

Last Updated: 23 December 2024

Steps to solve a Dynamic programming problem:Identify if it is a Dynamic programming problem.Decide a state expression with the Least parame ...read more

Dynamic Programming

DSA

Palindrome Substrings Count

Last Updated: 08 March 2025

Given a string s, the task is to count all palindromic substrings of length more than one.Examples:Input: s = "abaab"Output: 3Explanation: P...read more

Similar Topics

DSA

22.3k+ articles

Mathematical

7.7k+ articles

Arrays

6.4k+ articles

Strings

3.2k+ articles

Competitive Programming

2.3k+ articles

Algorithms

1.9k+ articles

Matrix

1.2k+ articles

Recursion

1k+ articles

Combinatorial

690+ articles

subsequence

420+ articles

Wildcard Pattern Matching

Last Updated: 20 November 2024

Given a text txt and a wildcard pattern pat, implement a wildcard pattern matching algorithm that finds if the wildcard pattern is matched w ...read more

Stock Buy and Sell – Max 2 Transactions Allowed

Last Updated: 19 March 2025

In the stock market, a person buys a stock and sells it on some future date. Given the stock prices ofndays in an arrayprices[ ]. Find out t...read more

Last Updated: 26 March 2025

Given a string s and y a dictionary ofnwordsdictionary, check if s can be segmented into a sequence of valid words from the dictionary, sepa...read more

Optimal Strategy for a Game

Last Updated: 03 December 2024

Given an arrayarr[]of sizen which represents a row of n coins of values V1 . . . Vn, where n is even. We play a game against an opponent by ...read more

Maximum Subarray Sum using Divide and Conquer algorithm

Last Updated: 24 December 2024

Given an arrayarr[],the task is to find the subarray that has the maximum sum and return its sum.Examples:Input: arr[] = [2, 3, -8, 7, -1, 2 ...read more

Optimal Binary Search Tree

Last Updated: 26 December 2024

Given a sorted array key [0.. n-1] of search keys and an array freq[0.. n-1] of frequency counts, where freq[i] is the number of searches fo...read more

Dynamic Programming

Binary Search Tree

DSA

Palindrome Partitioning

Last Updated: 26 March 2025

Given a string s, the task is to find the minimum number of cuts needed for palindrome partitioning of the given string. A partitioning of t...read more

Last Updated: 17 February 2025

Given an integer values n and k, the task is to find the value of Binomial Coefficient C(n, k).A binomial coefficient C(n, k) can be defined...read more

Last Updated: 22 April 2025

You are given a 2D matrix cost[][] of dimensions m × n, where each cell represents the cost of traversing through that position. Your goal ...read more

Optimal Substructure Property in Dynamic Programming | DP-2

Last Updated: 01 December 2024

The following are the two main properties of a problem that suggest that the given problem can be solved using Dynamic programming:1) Overla...read more

Dynamic Programming

DSA

Maximum size square sub-matrix with all 1s

Last Updated: 07 November 2024

Given a binary matrixmatof sizen*m, the task is to find out the maximum length of a side of asquaresub-matrix with all 1s.Example:Input: mat...read more

Last Updated: 20 March 2025

Stickler the thief wants to loot money from a societyhavingnhouses in a single line. He is a weird person and follows a certainrulewhen loot...read more

1 2 3 4 5 6 7 8 >>

1 2 3 4 5 6 >>

1 2 3 4 >>