PrepFlow
Jobs
ATS Checker
Companies
DSA Sheets
Compiler
PrepFlow
Sign in
Login Required!
You need to log in to access your saved progress.
Companies
Amazon
Dynamic Programming
Dynamic Programming
0/118 solved
Maximum Subarray
MEDIUM
Trapping Rain Water
HARD
Best Time to Buy and Sell Stock
EASY
Longest Palindromic Substring
MEDIUM
Climbing Stairs
EASY
House Robber
MEDIUM
Generate Parentheses
MEDIUM
Longest Increasing Subsequence
MEDIUM
Jump Game
MEDIUM
Coin Change
MEDIUM
Maximum Product Subarray
MEDIUM
Word Break
MEDIUM
Binary Tree Maximum Path Sum
HARD
Unique Paths
MEDIUM
Edit Distance
MEDIUM
Jump Game II
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
Decode Ways
MEDIUM
Min Cost Climbing Stairs
EASY
Perfect Squares
MEDIUM
Counting Bits
EASY
Target Sum
MEDIUM
Maximal Rectangle
HARD
Unique Binary Search Trees
MEDIUM
Maximal Square
MEDIUM
Cheapest Flights Within K Stops
MEDIUM
Split Array Largest Sum
HARD
Best Time to Buy and Sell Stock III
HARD
01 Matrix
MEDIUM
Triangle
MEDIUM
Longest Palindromic Subsequence
MEDIUM
Best Time to Buy and Sell Stock with Cooldown
MEDIUM
Burst Balloons
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
Interleaving String
MEDIUM
Unique Binary Search Trees II
MEDIUM
Best Time to Buy and Sell Stock IV
HARD
Word Break II
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
Ugly Number II
MEDIUM
Minimum Falling Path Sum
MEDIUM
Valid Parenthesis String
MEDIUM
Russian Doll Envelopes
HARD
Largest Divisible Subset
MEDIUM
Predict the Winner
MEDIUM
Frog Jump
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
Super Egg Drop
HARD
Minimum Difficulty of a Job Schedule
HARD
Scramble String
HARD
Count Number of Teams
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
Remove Boxes
HARD
Divisor Game
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