Round 1
Questions:
- Linear DP
- Climbing Stairs
- Best Time to Buy and Sell Stock
- Min Cost Climbing Stairs
- Divisor Game
- Decode Ways
- Unique Binary Search Trees
- House Robber
- Perfect Squares
- Best Time to Buy and Sell Stock with Cooldown
- Coin Change
- Counting Bits
- Integer Break
- Count Numbers with Unique Digits
- Wiggle Subsequence
- Partition Equal Subset Sum
- Maximum Length of Pair Chain
- Best Time to Buy and Sell Stock with Transaction Fee
- Delete and Earn
- Domino and Tromino Tiling
- Knight Dialer
- Minimum Cost for Tickets
- Partition Array for Maximum Sum
- Filling Bookcase Shelves
- Longest Arithmetic Subsequence of Given Difference
- Greatest Sum Divisible by Three
- Best Time to Buy and Sell Stock III
- Student Attendance Record II
- Decode Ways II
- Triples with Bitwise AND Equal to Zero
- Maximum Profit in Job Scheduling
- Minimum Number of Taps to Open to Water a Garden
- Count All Valid Pickup and Delivery Options
- Stone Game III
- Restore the Array
- Form Largest Integer with Digits that Add Up to Target
- Stone Game IV
- Coin Change 2
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions: 2. Knapsack
- House Robber II
- Ones and Zeroes
- Target Sum
- Shopping Offers
- 2 Keys Keyboard
- Minimum Swaps to Make Sequences Increasing
- Best Team with No Conflicts
- Profitable Schemes
- Tallest Billboard
- Pizza with 3n Slices
- Reducing Dishes
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3
Questions: 3. Multi Dimensions DP
- Triangle
- Combination Sum IV
- Out of Boundary Paths
- Knight Probability in Chessboard
- Champagne Tower
- Largest Sum of Averages
- Minimum Falling Path Sum
- Video Stitching
- Longest Arithmetic Subsequence
- Stone Game II
- Number of Dice Rolls with Target Sum
- Dice Roll Simulation
- Number of Sets of K Non-Overlapping Line Segments
- Best Time to Buy and Sell Stock IV
- Create Maximum Number
- Frog Jump
- Split Array Largest Sum
- Freedom Trail
- Minimum Number of Refueling Stops
- Number of Music Playlists
- Count Vowels Permutation
- Minimum Falling Path Sum II
- Minimum Distance to Type a Word Using Two Fingers
- Minimum Difficulty of a Job Schedule
- Number of Ways to Paint N 3-Grid
- Build Array Where You Can Find the Maximum Exactly K Comparisons
- Number of Ways of Cutting a Pizza
- Paint House III
- Count All Possible Routes
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 4
Questions: 4. Interval DP
- Guess Number Higher or Lower II
- Arithmetic Slices
- Predict the Winner
- Palindromic Substrings
- Stone Game
- Minimum Score Triangulation of Polygon
- Last Stone Weight II
- Minimum Cost Tree from Leaf Values
- Stone Game VII
- Burst Balloons
- Remove Boxes
- Strange Printer
- Valid Permutations for DI Sequence
- Minimum Cost to Merge Stones
- Allocate Mailboxes
- Minimum Cost to Cut a Stick
- Stone Game V
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 5
Questions: 5. Bit DP
- Can I Win
- Partition to K Equal Sum Subsets
- Stickers to Spell Word
- Shortest Path Visiting All Nodes
- Smallest Sufficient Team
- Maximum Students Taking Exam
- Number of Ways to Wear Different Hats to Each Other
- Minimum Cost to Connect Two Groups of Points
- Maximum Number of Achievable Transfer Requests
- Distribute Repeating Integers
- Maximize Grid Happiness
- Find Minimum Time to Finish All Jobs
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 6
Questions: 6. Digit DP
- Non-Negative Integers Without Consecutive Ones
- Numbers at Most N Given Digit Set
- Numbers with Repeated Digits
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 7
Questions: 7. DP on Trees
- Unique Binary Search Trees II
- House Robber III
- Maximum Product of Splitted Binary Tree
- Linked List in Binary Tree
- Longest Zigzag Path in a Binary Tree
- Binary Tree Cameras
- Maximum Sum BST in Binary Tree
- Number of Ways to Reorder Array to Get Same BST
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 8
Questions: 8. String DP
- Is Subsequence
- Palindrome Partitioning
- Palindrome Partitioning II
- Word Break
- Unique Substrings in Wraparound String
- Minimum ASCII Delete Sum for Two Strings
- Longest String Chain
- Longest Happy String
- Longest Valid Parentheses
- Distinct Subsequences
- Word Break II
- Count the Repetitions
- Concatenated Words
- Count Different Palindromic Subsequences
- Distinct Subsequences II
- Longest Chunked Palindrome Decomposition
- Palindrome Partitioning III
- Find All Good Strings
- String Compression II
- Number of Ways to Form a Target String Given a Dictionary
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 9
Questions: 9. Probability DP
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 10
Questions: 10. Classic DPs
- A. Kadane's Algorithm
- B. LCS
- Longest Palindromic Substring
- Longest Palindromic Subsequence
- Maximum Length of Repeated Subarray
- Longest Common Subsequence
- Regular Expression Matching
- Wildcard Matching
- Edit Distance
- Interleaving String
- Shortest Common Supersequence
- Minimum Insertion Steps to Make a String Palindrome
- Max Dot Product of Two Subsequences
- C. LIS
- D. 2D Grid Traversal
- E. Cumulative Sum
- Range Sum Query Immutable
- Maximal Square
- Range Sum Query 2D Immutable
- Largest Plus Sign
- Push Dominoes
- Largest 1-Bordered Square
- Count Square Submatrices with All Ones
- Matrix Block Sum
- Maximum Points You Can Obtain from Cards
- Count Submatrices with All Ones
- Ways to Make a Fair Array
- Maximal Rectangle
- Max Sum of Rectangle No Larger Than K
- Super Washing Machines
- Maximum Sum of 3 Non-Overlapping Subarrays
- Number of Submatrices that Sum to Target
- Get the Maximum Score
- F. Hashmap (SubArray)
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 11
Questions: 11. DP + Alpha (Tricks/DS)
- Arithmetic Slices II Subsequence
- Odd Even Jump
- Constrained Subsequence Sum
- Delivering Boxes from Storage to Ports
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 12
Questions: 12. Insertion DP
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 13
Questions: 13. Graph DP
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 14
Questions: 14. Memoization
- Minimum Jumps to Reach Home
- Scramble String
- Tiling a Rectangle with the Fewest Squares
- Number of Ways to Stay in the Same Place After Some Steps
- Jump Game V
- Minimum Number of Days to Eat N Oranges
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 15
Questions: 15. Binary Lifting
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 16
Questions: 16. Math
- Ugly Number II
- Count Sorted Vowel Strings
- Race Car
- Super Egg Drop
- Least Operators to Express Number
- Largest Multiple of Three
- Minimum One Bit Operations to Make Integers Zero
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.