Quant & Finance
Jane Street 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
- 14
- Easy
- 7
- Medium
- 4
- Hard
- 3
- Mapped to chapter
- 6
Array
8 problemsEasy 4
Medium 2
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 874 | Walking Robot Simulationalso at:AmazonGooglePhonePe | Medium | — | |
| 1801 | Number of Orders in the Backlogalso at:GoogleRobinhood | Medium | — |
Hard 2
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 1032 | Stream of Characters★ also at:Meta | Hard | Chapter | |
| 2809 | Minimum Time to Make Array Sum At Most x | Hard | — |
Misc
6 problemsEasy 3
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 20 | Valid Parentheses★ also at:BloombergAdobeAirbnb Also at 36 moreAmazonAutodeskCiscoCoinDCXCrowdStrikeDelleBayEpic SystemsFlipkartFreshworksGoogleGrowwIntelIntuitJioLinkedInLyftMetaMicrosoftNetflixNVIDIAPayPalPaytmPhonePeQualcommRobloxSAPSplunkSpotifySwiggyTargetTeslaToastTwilioVMwareX (Twitter) | Easy | Chapter | |
| 415 | Add Stringsalso at:BloombergAdobeAirbnb Also at 6 moreAmazonByteDanceGoogleMetaVisaWayfair | Easy | — | |
| 2235 | Add Two Integersalso at:AmazonAtlassianGoogle Also at 1 moreMicrosoft | Easy | — |
Medium 2
No problems match those filters
Toggle a difficulty back on or clear the search.