Squarepoint Capital Dynamic Programming Questions
12 dynamic programming problems asked at Squarepoint Capital interviews
Easy (2)Medium (7)Hard (3)
Questions
| Title | Difficulty |
|---|---|
| Best Time to Buy and Sell Stock | Easy |
| Maximum Subarray | Medium |
| Trapping Rain Water | Hard |
| Minimum Sideway Jumps | Medium |
| Longest Increasing Subsequence | Medium |
| Frog Jump | Hard |
| Longest Non-decreasing Subarray From Two Arrays | Medium |
| Count Ways To Build Good Strings | Medium |
| Minimum Number of Taps to Open to Water a Garden | Hard |
| Minimum Path Sum | Medium |
| Coin Change | Medium |
| Min Cost Climbing Stairs | Easy |
Showing 12 questions