Directi coding interview
questions, leaked.
9 problems reported across recent Directi interviews. Top patterns: array, dynamic programming, tree. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Directi's coding assessment pulls from a tight, brutal set of nine problems. Five are medium, four are hard, zero gimmes. Arrays dominate the test (six problems), followed by dynamic programming, trees, and graph traversals. You're looking at patterns like tree DP, connected-component logic, and substring optimization under constraints. Most candidates freeze on the hard problems mid-assessment. If you hit a wall on something like Maximum XOR of Two Non-Overlapping Subtrees, StealthCoder runs invisibly during your screen share and surfaces a working solution in seconds, so you don't blow the timer.
Top problems at Directi
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Difference Between Maximum and Minimum Price Sum | HARD | 100.0 | 32% | Array · Dynamic Programming · Tree |
| 02 | Find Longest Awesome Substring | HARD | 100.0 | 45% | Hash Table · String · Bit Manipulation |
| 03 | Min Cost to Connect All Points | MEDIUM | 100.0 | 69% | Array · Union Find · Graph |
| 04 | Maximum XOR of Two Non-Overlapping Subtrees | HARD | 100.0 | 50% | Tree · Depth-First Search · Graph |
| 05 | Minimum Cost to Buy Apples | MEDIUM | 100.0 | 67% | Array · Graph · Heap (Priority Queue) |
| 06 | Largest Submatrix With Rearrangements | MEDIUM | 100.0 | 75% | Array · Greedy · Sorting |
| 07 | Find the Winner of an Array Game | MEDIUM | 100.0 | 57% | Array · Simulation |
| 08 | Number of Sub-arrays With Odd Sum | MEDIUM | 100.0 | 56% | Array · Math · Dynamic Programming |
| 09 | Binary Tree Maximum Path Sum | HARD | 62.4 | 41% | Dynamic Programming · Tree · Depth-First Search |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Directi OA. The proctor cannot see it. Screen share cannot detect it. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE.
Get StealthCoder- array6 · 67%
- dynamic programming3 · 33%
- tree3 · 33%
- depth first search3 · 33%
- graph3 · 33%
- binary tree1 · 11%
- hash table1 · 11%
- string1 · 11%
- bit manipulation1 · 11%
- union find1 · 11%
The assessment is top-heavy on arrays but weaponized with DP and tree/graph overlays. Six of nine problems touch arrays, but not basic array manipulation. You're solving array problems that require heap logic, union-find, or prefix-sum tricks. Three problems demand DFS or graph traversal. Three hit dynamic programming. The hard tier (Difference Between Maximum and Minimum Price Sum, Find Longest Awesome Substring, Maximum XOR of Two Non-Overlapping Subtrees, Binary Tree Maximum Path Sum) tests whether you can combine multiple patterns at once. Drill tree DP and connected-component union-find first. If you blank on a bitwise or trie-based hard problem live, StealthCoder is your hedge. The median candidate gets stuck on the fourth or fifth problem. You won't.
Companies with similar patterns
If you prepped for Directi, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Directi.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Directi interview FAQ
How many array problems should I solve to be ready for Directi?+
Six of nine problems touch arrays. Solve at least 12 to 15 array problems focusing on heap, prefix sum, and greedy variants, not just basic sorting or traversal. Directi's array problems aren't straightforward.
Is dynamic programming critical for this assessment?+
Yes. Three problems are tagged DP, and two hard problems (Difference Between Maximum and Minimum Price Sum, Binary Tree Maximum Path Sum) require DP on trees. Spend at least a week drilling DP recurrence on non-linear structures.
Should I study union-find and MST before the assessment?+
Union-find appears once (Min Cost to Connect All Points) but it's a medium. If graph is weak, drill union-find and Kruskal's algorithm. It's a high-ROI pattern for Directi.
What's the hardest topic combination I'll face?+
Maximum XOR of Two Non-Overlapping Subtrees combines tree traversal, XOR bit logic, and trie structure. This is the spike. If you've never mixed trie with DFS on trees, run through three similar problems before your assessment.
How much time should I spend on tree DP vs general arrays?+
60-40 split favoring arrays initially, then pivot to tree DP in your final week. Four of nine problems require tree or DFS logic. Tree DP is where most candidates drop points.