PRACTICE

DSA Question Tracker & Breakdowns

7 problems from Goldman Sachs tagged Dynamic Programming with full breakdowns.

433problems
32companies
39topics
3languages each
121.Best Time to Buy and Sell Stock
ArrayDynamic Programming
Easy+10▶ Mock
5.Longest Palindromic Substring
StringDynamic Programming
Medium+8▶ Mock
42.Trapping Rain Water
ArrayTwo PointersStack
Hard+6▶ Mock
124.Binary Tree Maximum Path Sum
Dynamic ProgrammingTreeDepth-First Search
516.Longest Palindromic Subsequence
StringDynamic Programming
Medium▶ Mock
64.Minimum Path Sum
ArrayDynamic ProgrammingMatrix
Medium▶ Mock
790.Domino and Tromino Tiling
Dynamic Programming
Medium▶ Mock

Practice with a Mock Interview

Solve these problems under real interview pressure with our AI interviewer.

Start Mock Interview →