Problem Statement: You are given n balloons, indexed from 0 to n – 1. Each balloon is painted with a
Continue readingCategory: dynamic programming
Evaluate Boolean Expression to True | Partition DP: DP 52
Problem Statement: Given an expression, A, with operands and operators (OR, AND, XOR), in how many ways can you evaluate
Continue readingPalindrome Partitioning – II | Front Partition : DP 53
Problem Statement: Given a string s, partition s such that every substring of the partition is a palindrome. Return the
Continue readingPartition Array for Maximum Sum | Front Partition : DP 54
Problem Statement: Given an integer array arr, partition the array into (contiguous) subarrays of length at most k. After partitioning,
Continue readingMaximum Rectangle Area with all 1’s | DP on Rectangles: DP 55
Problem Statement: Given a row X cols binary matrix filled with 0’s and 1’s, find the largest rectangle containing only
Continue readingCount Square Submatrices with All 1s | DP on Rectangles : DP 56
Problem Statement: Given an n * m matrix of ones and zeros, return how many square submatrices have all ones.
Continue readingMinimum cost to cut the stick| (DP-50)
Problem Description: We are given a stick of length N and a CUTS array of size C. The stick has
Continue readingMatrix Chain Multiplication | Tabulation Method | (DP-49)
In the previous article, we learned the solution for the problem of “Matrix chain multiplication”. We had discussed the recursive
Continue readingMatrix Chain Multiplication | (DP-48)
Problem Statement: Matrix Chain Multiplication | Partition DP Starts In the coming articles, we will discuss problems related to a
Continue readingNumber of Longest Increasing Subsequences | (DP-47)
Problem Statement: Number of Longest Increasing Subsequences Prerequisite: Longest increasing subsequence, Printing Longest Increasing subsequence Problem Link: Given an array,
Continue reading