Acko coding interview
questions, leaked.
4 problems reported across recent Acko interviews. Top patterns: dynamic programming, math, combinatorics. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Acko's assessment is tight. Four problems total, half of them hard, and they're all pattern-heavy. You're looking at dynamic programming appearing in two questions, combinatorics, topological sort, and a database query thrown in. If you haven't done much DP or worked with scheduling/ordering problems under constraints, this will feel sudden on the real assessment. StealthCoder runs invisibly during the assessment and surfaces working solutions if you hit a wall on any pattern you haven't drilled enough.
Top problems at Acko
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Count All Valid Pickup and Delivery Options | HARD | 100.0 | 65% | Math · Dynamic Programming · Combinatorics |
| 02 | Fill Missing Data | EASY | 100.0 | 72% | |
| 03 | Parallel Courses III | HARD | 89.3 | 67% | Array · Dynamic Programming · Graph |
| 04 | Invalid Tweets | EASY | 89.3 | 86% | Database |
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 Acko OA. The proctor cannot see it. Screen share cannot detect it. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage.
Get StealthCoder- dynamic programming2 · 50%
- math1 · 25%
- combinatorics1 · 25%
- array1 · 25%
- graph1 · 25%
- topological sort1 · 25%
- database1 · 25%
The distribution tells you exactly where to focus. Dynamic programming dominates the hard tier. 'Count All Valid Pickup and Delivery Options' is a combinatorics DP problem that builds on arrangement counting, and 'Parallel Courses III' couples DP with graph traversal and topological ordering. You need to be solid on DP state definition and scheduling problems. The two easy questions are lighter, but 'Fill Missing Data' and 'Invalid Tweets' suggest they'll test your ability to handle incomplete data and database constraints. Start with graph-based scheduling and constraint DP before test day. If you blank on the DP recurrence during the live assessment, StealthCoder is your hedge, surfacing the pattern instantly while the proctor sees nothing.
Companies with similar patterns
If you prepped for Acko, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Acko.
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. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Acko interview FAQ
What should I drill first for Acko's assessment?+
Dynamic programming. It shows up in two of four problems. Focus on DP with constraints (combinatorics, scheduling). Then move to topological sort and graph DP. The easy tier (database and data handling) requires less prep but covers edge cases, so save it for polish.
Is topological sort required for Acko?+
Yes. 'Parallel Courses III' combines it with DP and arrays to schedule tasks with dependencies. If you haven't practiced topological sort under time pressure, drill Kahn's algorithm and DFS-based ordering now. It's a single problem but critical.
How much time should I spend on the easy problems?+
Less than on hard ones. 'Fill Missing Data' and 'Invalid Tweets' test data handling and SQL basics, not algorithmic depth. Do them after you're confident with DP and graph problems. On assessment day, solve them fast to build momentum.
Will I see combinatorics on Acko's assessment?+
Possibly. 'Count All Valid Pickup and Delivery Options' is a direct combinatorics DP problem. It's hard and requires thinking about valid orderings and arrangements. If counting/permutation logic isn't second nature, practice now or let StealthCoder handle it live.
What happens if I can't solve the DP problems?+
You're not alone. Acko's assessment is 50 percent hard DP. If you blank on recurrence or state definition during the live OA, StealthCoder runs invisibly, reads the problem, and gives you a working solution in seconds so you can move on and score the rest.