Quant & Finance
Hudson River Trading interview questions
Grouped by topic, sorted Easy → Medium → Hard, then by LeetCode ID. Click a problem to open it on LeetCode; the chapter column links to the handbook chapter that covers it.
- Problems
- 9
- Easy
- 4
- Medium
- 2
- Hard
- 3
- Mapped to chapter
- 0
Array
4 problemsEasy 1
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 1566 | Detect Pattern of Length M Repeated K or More Times | Easy | — |
Medium 1
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 722 | Remove Commentsalso at:Microsoft | Medium | — |
Hard 2
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 2246 | Longest Path With Different Adjacent Charactersalso at:Target | Hard | — | |
| 3225 | Maximum Score From Grid Operationsalso at:AmazonGoogle | Hard | — |
Math
3 problemsEasy 3
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 1317 | Convert Integer to the Sum of Two No-Zero Integers | Easy | — | |
| 1323 | Maximum 69 Number | Easy | — | |
| 1342 | Number of Steps to Reduce a Number to Zeroalso at:Amazon | Easy | — |
Misc
2 problemsMedium 1
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 2285 | Maximum Total Importance of Roads | Medium | — |
Hard 1
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 2508 | Add Edges to Make Degrees of All Nodes Even | Hard | — |
No problems match those filters
Toggle a difficulty back on or clear the search.