Squarepoint Capital Dynamic Programming Questions

12 dynamic programming problems asked at Squarepoint Capital interviews

Easy (2)Medium (7)Hard (3)

Questions

TitleDifficulty
Best Time to Buy and Sell StockEasy
Maximum SubarrayMedium
Trapping Rain WaterHard
Minimum Sideway JumpsMedium
Longest Increasing SubsequenceMedium
Frog JumpHard
Longest Non-decreasing Subarray From Two ArraysMedium
Count Ways To Build Good StringsMedium
Minimum Number of Taps to Open to Water a GardenHard
Minimum Path SumMedium
Coin ChangeMedium
Min Cost Climbing StairsEasy

Showing 12 questions