0% found this document useful (0 votes)
169 views10 pages

9 AssignmentDynamicProgramming

The document lists over 50 dynamic programming problems from various online judges and coding platforms like InterviewBit, CodeChef, Codeforces, AtCoder, and SPOJ. The problems cover a wide range of dynamic programming topics including longest increasing subsequence, matrix problems, stock trading, strings, trees, graphs, and more. Many problems have links provided to the problem statement pages for more details.

Uploaded by

DIVYANSHU
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
169 views10 pages

9 AssignmentDynamicProgramming

The document lists over 50 dynamic programming problems from various online judges and coding platforms like InterviewBit, CodeChef, Codeforces, AtCoder, and SPOJ. The problems cover a wide range of dynamic programming topics including longest increasing subsequence, matrix problems, stock trading, strings, trees, graphs, and more. Many problems have links provided to the problem statement pages for more details.

Uploaded by

DIVYANSHU
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

##Dynamic

Programming
Longest Increasing Subsequence - InterviewBit

[Link]
([Link]

Max Rectangle in Binary Matrix - InterviewBit

[Link]
([Link]

Distinct Subsequences - InterviewBit

[Link]
([Link]

Unique Paths in a Grid - InterviewBit

[Link]
([Link]

Max Product Subarray - InterviewBit

[Link]
([Link]

Best Time to Buy and Sell Stocks II - InterviewBit

[Link]
([Link]

Best Time to Buy and Sell Stocks III - InterviewBit


[Link]
([Link]

Scramble String - InterviewBit

[Link]
([Link]

Best Time to Buy and Sell Stocks I - InterviewBit

[Link]
([Link]

Max Sum Path in Binary Tree - InterviewBit

[Link]
([Link]

Regular Expression Match - InterviewBit

[Link]
([Link]

Dungeon Princess - InterviewBit

[Link]
([Link]

Palindrome Partitioning II - InterviewBit

[Link]
([Link]

Min Sum Path in Matrix - InterviewBit

[Link]
([Link]

Edit Distance - InterviewBit

[Link]
([Link]
Unique Binary Search Trees II - InterviewBit

[Link]
([Link]

Word Break - InterviewBit

[Link]
([Link]

Regular Expression II - InterviewBit

[Link]
([Link]

Min Sum Path in Triangle - InterviewBit

[Link]
([Link]

Jump Game Array - InterviewBit

[Link]
([Link]

Interleaving Strings - InterviewBit

[Link]
([Link]

Word Break II - InterviewBit

[Link]
([Link]

Longest valid Parentheses - InterviewBit

[Link]
([Link]

Stairs - InterviewBit

[Link] ([Link]
Max Sum Without Adjacent Elements - InterviewBit

[Link]
([Link]

Repeating Sub-Sequence - InterviewBit

[Link]
([Link]

Evaluate Expression To True - InterviewBit

[Link]
([Link]

Coins in a Line - InterviewBit

[Link]
([Link]

Arrange II - InterviewBit

[Link]
([Link]

Equal Average Partition - InterviewBit

[Link]
([Link]

Coin Sum Infinite - InterviewBit

[Link]
([Link]

Rod Cutting - InterviewBit

[Link]
([Link]

Intersecting Chords in a Circle - InterviewBit


[Link]
([Link]

Count Permutations of BST - InterviewBit

[Link]
([Link]

Queen Attack - InterviewBit

[Link]
([Link]

Longest Arithmetic Progression - InterviewBit

[Link]
([Link]

Sub Matrices with sum Zero - InterviewBit

[Link]
([Link]

N digit numbers with digit sum S - InterviewBit

[Link]
([Link]

Length of Longest Subsequence - InterviewBit

[Link]
([Link]

Ways to color a 3xN Board - InterviewBit

[Link]
([Link]

Tushar Birthday Bombs - InterviewBit

[Link]
([Link]
Tushar Birthday Party - InterviewBit

[Link]
([Link]

Kth Manhattan Distance Neighbourhood - InterviewBit

[Link]
([Link]

Largest area of rectangle with permutations - InterviewBit

[Link]
([Link]

Kingdom War - InterviewBit

[Link]
([Link]

[Link]
([Link]

[Link]
([Link]

[Link]
([Link]

[Link]
([Link]

[Link] ([Link]

[Link] ([Link]

[Link]
([Link]

[Link]
([Link]
[Link] ([Link]

[Link] ([Link]

[Link]
([Link]

[Link]
([Link]

[Link]
([Link]

[Link]
([Link]

[Link] ([Link]

[Link]
([Link]

[Link]
([Link]

[Link] ([Link]

[Link] ([Link]

[Link] ([Link]

[Link]
([Link]

[Link]
([Link]
[Link]
([Link]

[Link] ([Link]

[Link]
([Link]

[Link]
([Link]

Longest Palindromic Substring - LeetCode

[Link]
([Link]

Best Time to Buy and Sell Stock - LeetCode

[Link]
([Link]

Burst Balloons - LeetCode

[Link] ([Link]

Maximum Product Subarray - LeetCode

[Link]
([Link]

Minimum Path Sum - LeetCode

[Link] ([Link]
path-sum/)

Best Time to Buy and Sell Stock with Cooldown - LeetCode

[Link]
([Link]

Arithmetic Slices - LeetCode


[Link] ([Link]
slices/)

Word Break II - LeetCode

[Link] ([Link]

Stone Game II - LeetCode

[Link] ([Link]

Ugly Number II - LeetCode

[Link] ([Link]

Interleaving String - LeetCode

[Link] ([Link]
string/)

Min Cost Climbing Stairs - LeetCode

[Link] ([Link]
cost-climbing-stairs/)

Partition to K Equal Sum Subsets - LeetCode

[Link]
([Link]

Largest Divisible Subset - LeetCode

[Link] ([Link]
divisible-subset/)

Combination Sum IV - LeetCode

[Link]
([Link]

House Robber II - LeetCode

[Link] ([Link]
ii/)

Bomb Enemy - LeetCode

[Link] ([Link]

Push Dominoes - LeetCode

[Link] ([Link]
dominoes/)

Length of Longest Fibonacci Subsequence - LeetCode

[Link]
([Link]

Continuous Subarray Sum - LeetCode

[Link]
([Link]

Palindrome Partitioning III - LeetCode

[Link]
([Link]

Smallest Sufficient Team - LeetCode

[Link]
([Link]

Count Square Submatrices with All Ones - LeetCode

[Link]
([Link]

You might also like