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 problems

Easy 1

#TitleDifficultyAlso atChapter
1566Detect Pattern of Length M Repeated K or More TimesEasy—

Medium 1

#TitleDifficultyAlso atChapter
722Remove Commentsalso at:Microsoft Medium—

Hard 2

#TitleDifficultyAlso atChapter
2246Longest Path With Different Adjacent Charactersalso at:Target Hard—
3225Maximum Score From Grid Operationsalso at:AmazonGoogle Hard—

Math

3 problems

Easy 3

#TitleDifficultyAlso atChapter
1317Convert Integer to the Sum of Two No-Zero IntegersEasy—
1323Maximum 69 NumberEasy—
1342Number of Steps to Reduce a Number to Zeroalso at:Amazon Easy—

Misc

2 problems

Medium 1

#TitleDifficultyAlso atChapter
2285Maximum Total Importance of RoadsMedium—

Hard 1

#TitleDifficultyAlso atChapter
2508Add Edges to Make Degrees of All Nodes EvenHard—