TCS Dynamic Programming Questions

33 dynamic programming problems asked at TCS interviews

Easy (6)Medium (17)Hard (10)

Questions

TitleDifficulty
Longest Palindromic SubstringMedium
Maximum SubarrayMedium
Best Time to Buy and Sell StockEasy
Jump GameMedium
Maximum Product SubarrayMedium
Palindrome Partitioning IVHard
Trapping Rain WaterHard
Bitwise ORs of SubarraysMedium
Climbing StairsEasy
Fibonacci NumberEasy
Burst BalloonsHard
Unique PathsMedium
Smallest Sufficient TeamHard
House RobberMedium
Pascal's TriangleEasy
Generate ParenthesesMedium
Split Array With Same AverageHard
Longest Palindromic SubsequenceMedium
Partition Equal Subset SumMedium
Tallest BillboardHard
Longest Increasing SubsequenceMedium
Jump Game IIMedium
Binary Tree Maximum Path SumHard
Longest Subarray of 1's After Deleting One ElementMedium
Maximal RectangleHard
Best Time to Buy and Sell Stock IIMedium
Non-overlapping IntervalsMedium
Unique Paths IIMedium
Divisor GameEasy
Maximum Number of Events That Can Be Attended IIHard
Regular Expression MatchingHard
Longest Common SubsequenceMedium
Min Cost Climbing StairsEasy

Showing 33 questions