Hashedin Coding Interview Questions
We track 30 coding questions asked at Hashedin, tagged with the algorithms and concepts they test. The most common: Array, String, Dynamic Programming, Hash Table, Greedy.
Browse all 30 Hashedin questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array24.3%
- String12.9%
- Dynamic Programming11.9%
- Hash Table7.9%
- Two Pointers6.2%
- Greedy5.7%
- Binary Search4.7%
- Stack2.9%
- Math2.6%
- Sorting2.2%
- Other (19)18.9%
How many questions involve each concept
Share of all 30 tracked Hashedin questions that touch each concept. Questions usually involve several, so these overlap.
- Array73.3%
- String36.7%
- Dynamic Programming33.3%
- Hash Table23.3%
- Greedy20.0%
- Two Pointers16.7%
- Binary Search13.3%
- Math10.0%
- Sorting10.0%
- Stack10.0%
- Bit Manipulation6.7%
- Monotonic Stack6.7%
Where Hashedin differs from the average company
Concept weight at Hashedin relative to the average across all companies we track. Green means Hashedin leans on it harder than most.
- Monotonic Stack2.6×
- Dynamic Programming1.9×
- Greedy1.9×
- Two Pointers1.7×
- Bit Manipulation0.81×
- Sorting0.56×
- Math0.46×
Hashedin specialties
Concepts that show up at Hashedin but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 30 tracked Hashedin questions.
- Junior13% (4)
- Mid/Senior63% (19)
- Staff23% (7)
Every concept in Hashedin interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 22 | 73.3% | 24.3% |
| String | 11 | 36.7% | 12.9% |
| Dynamic Programming | 10 | 33.3% | 11.9% |
| Hash Table | 7 | 23.3% | 7.9% |
| Greedy | 6 | 20.0% | 5.7% |
| Two Pointers | 5 | 16.7% | 6.2% |
| Binary Search | 4 | 13.3% | 4.7% |
| Math | 3 | 10.0% | 2.6% |
| Sorting | 3 | 10.0% | 2.2% |
| Stack | 3 | 10.0% | 2.9% |
| Bit Manipulation | 2 | 6.7% | 1.3% |
| Monotonic Stack | 2 | 6.7% | 1.8% |
| Prefix Sum | 2 | 6.7% | 1.8% |
| Sliding Window | 2 | 6.7% | 1.9% |
| Backtracking | 1 | 3.3% | 0.7% |
| Binary Indexed Tree | 1 | 3.3% | 0.8% |
| Bitmask | 1 | 3.3% | 0.7% |
| Brainteaser | 1 | 3.3% | 0.7% |
| Breadth-First Search | 1 | 3.3% | 0.7% |
| Counting | 1 | 3.3% | 0.8% |
| Depth-First Search | 1 | 3.3% | 0.7% |
| Divide and Conquer | 1 | 3.3% | 1.1% |
| Game Theory | 1 | 3.3% | 0.7% |
| Matrix | 1 | 3.3% | 0.7% |
| Number Theory | 1 | 3.3% | 0.8% |
| Recursion | 1 | 3.3% | 1.1% |
| Segment Tree | 1 | 3.3% | 0.8% |
| Trie | 1 | 3.3% | 1.1% |
| Union-Find | 1 | 3.3% | 0.7% |
Practice a Hashedin interview
Take a realistic AI-led mock interview with questions Hashedin actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required