Hudson River Trading LeetCode Questions
9 questions all-time · 4 easy · 2 medium · 3 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Detect Pattern of Length M Repeated K or More Times Array, Enumeration | Easy | 100 | 43.5% |
| 2 | Add Edges to Make Degrees of All Nodes Even Hash Table, Graph | Hard | 98 | 33.5% |
| 3 | Longest Path With Different Adjacent Characters Array, String, Tree, Depth-First Search, Graph, Topological Sort | Hard | 98 | 53.9% |
| 4 | Maximum Total Importance of Roads Greedy, Graph, Sorting, Heap (Priority Queue) | Medium | 98 | 69.2% |
| 5 | Convert Integer to the Sum of Two No-Zero Integers Math | Easy | 98 | 54.2% |
| 6 | Number of Steps to Reduce a Number to Zero Math, Bit Manipulation | Easy | 98 | 85.6% |
| 7 | Maximum 69 Number Math, Greedy | Easy | 98 | 81.8% |
| 8 | Maximum Score From Grid Operations Array, Dynamic Programming, Matrix, Prefix Sum | Hard | 98 | 24.2% |
| 9 | Remove Comments Array, String | Medium | 61 | 39.4% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.