Amazon Dynamic Programming Problems | PrepFlow | PrepFlow

PrepFlow

Jobs
ATS Checker
Companies
DSA Sheets
Compiler

PrepFlow

Streamline your DSA prep with structured sheets and company-wise problems.

Quick Links

Jobs
ATS Checker
Companies
DSA Sheets
Compiler

Developed and Maintained By

Rayudu Bharani

Cygnuxxs

© 2026 PrepFlow. All rights reserved.

Privacy Policy | Terms of Service

Login Required!

You need to log in to access your saved progress.

Companies
Amazon
Dynamic Programming

Dynamic Programming

Overall Progress0/117(0%)

Easy

0/8

Medium

0/70

Hard

0/39

Maximum Subarray

Medium

Trapping Rain Water

Hard

Best Time to Buy and Sell Stock

Easy

Longest Palindromic Substring

Medium

Climbing Stairs

Easy

Medium

Generate Parentheses

Medium

Longest Increasing Subsequence

Medium

Medium

Medium

Maximum Product Subarray

Medium

Medium

Binary Tree Maximum Path Sum

Hard

Medium

Medium

Medium

Best Time to Buy and Sell Stock II

Medium

Longest Common Subsequence

Medium

Pascal's Triangle

Easy

Palindrome Partitioning

Medium

Minimum Path Sum

Medium

Partition Equal Subset Sum

Medium

Longest Valid Parentheses

Hard

Regular Expression Matching

Hard

Medium

Min Cost Climbing Stairs

Easy

Perfect Squares

Medium

Easy

Medium

Maximal Rectangle

Hard

Medium

Cheapest Flights Within K Stops

Medium

House Robber II

Medium

Split Array Largest Sum

Hard

Best Time to Buy and Sell Stock III

Hard

Medium

Medium

Longest Palindromic Subsequence

Medium

Best Time to Buy and Sell Stock with Cooldown

Medium

Hard

Longest Increasing Path in a Matrix

Hard

Unique Paths II

Medium

House Robber III

Medium

Wildcard Matching

Hard

Fibonacci Number

Easy

Non-overlapping Intervals

Medium

Unique Binary Search Trees II

Medium

Best Time to Buy and Sell Stock IV

Hard

Hard

Best Time to Buy and Sell Stock with Transaction Fee

Medium

Partition to K Equal Sum Subsets

Medium

Maximum Profit in Job Scheduling

Hard

Number of Longest Increasing Subsequence

Medium

Maximum Length of Repeated Subarray

Medium

Distinct Subsequences

Hard

Maximum Sum Circular Subarray

Medium

Medium

Minimum Falling Path Sum

Medium

Valid Parenthesis String

Medium

Russian Doll Envelopes

Hard

Largest Divisible Subset

Medium

Predict the Winner

Medium

Hard

Palindrome Partitioning II

Hard

Arithmetic Slices

Medium

Count Square Submatrices with All Ones

Medium

Minimum Insertion Steps to Make a String Palindrome

Hard

Number of Dice Rolls With Target Sum

Medium

All Possible Full Binary Trees

Medium

Shortest Common Supersequence

Hard

Pascal's Triangle II

Easy

Partition Array for Maximum Sum

Medium

Maximum Length of Pair Chain

Medium

Flip String to Monotone Increasing

Medium

Minimum Cost Tree From Leaf Values

Medium

2 Keys Keyboard

Medium

Concatenated Words

Hard

Out of Boundary Paths

Medium

Knight Probability in Chessboard

Medium

Matchsticks to Square

Medium

Count Sorted Vowel Strings

Medium

Uncrossed Lines

Medium

Hard

Minimum Difficulty of a Job Schedule

Hard

Count Number of Teams

Medium

Number of Ways to Arrive at Destination

Medium

Longest Mountain in Array

Medium

Maximum Sum BST in Binary Tree

Hard

Maximum Sum of Two Non-Overlapping Subarrays

Medium

Filling Bookcase Shelves

Medium

Maximum Score from Performing Multiplication Operations

Hard

Minimum Cost to Merge Stones

Hard

Hard

Easy

Super Ugly Number

Medium

Largest Sum of Averages

Medium

Maximum Number of Events That Can Be Attended II

Hard

Length of Longest Fibonacci Subsequence

Medium

Longest Turbulent Subarray

Medium

Video Stitching

Medium

Maximize Score After N Operations

Hard

Number of Digit One

Hard

Bitwise ORs of Subarrays

Medium

Minimum Window Subsequence

Hard

Find the Shortest Superstring

Hard

Numbers At Most N Given Digit Set

Hard

Find Minimum Time to Finish All Jobs

Hard

Largest 1-Bordered Square

Medium

Encode String with Shortest Length

Hard

Largest Multiple of Three

Hard

Number of Sets of K Non-Overlapping Line Segments

Medium

Count The Repetitions

Hard

Optimal Division

Medium

Count Ways to Make Array With Product

Hard

Handshakes That Don't Cross

Hard

Find the Derangement of An Array

Medium

Digit Count in Range

Hard

Visitors4

Compiler Status