How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Acko interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Problem database last updated: June 20, 2025
4 problems · 2 Easy, 0 Medium, 2 Hard · Ranked #288 of 458
2 Easy
50% · avg 23%
0 Medium
0% · avg 59%
2 Hard
50% · avg 18%
Based on 4 reported problems, Acko interviews are significantly harder than average - 50% Hard vs 18% across all companies.
Compared to the industry average, Acko puts unusual emphasis on dynamic-programming (50% of problems, 2.5x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are dynamic-programming (50%), math (25%), combinatorics (25%), array (25%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Fill Missing Data DataFrame products +-------------+--------+ | Column Name | Type | +-------------+--------+ | name | object | | quantity | int | | price | int | +-------------+... | Easy | Very Likely | Solve | |
Count All Valid Pickup and Delivery Options Given n orders, each order consists of a pickup and a delivery service. | Hard | Very Likely | mathdynamic-programmingcombinatorics | Solve |
Parallel Courses III You are given an integer n, which indicates that there are n courses labeled from 1 to n. You are also given a 2D integer array relations where relations[j] = [... | Hard | Very Likely | arraydynamic-programminggraph | Solve |
Invalid Tweets Table: Tweets | Easy | Very Likely | database | Solve |
Fill Missing Data
SolveDataFrame products +-------------+--------+ | Column Name | Type | +-------------+--------+ | name | object | | quantity | int | | price | int | +-------------+...
Count All Valid Pickup and Delivery Options
SolveGiven n orders, each order consists of a pickup and a delivery service.
Parallel Courses III
SolveYou are given an integer n, which indicates that there are n courses labeled from 1 to n. You are also given a 2D integer array relations where relations[j] = [...
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Acko interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Acko interviews focus heavily on dynamic-programming, math, combinatorics problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Acko interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Acko has been reported to ask 4 distinct coding problems. The most common topics are dynamic-programming, math, combinatorics. 2 are Easy difficulty, 0 are Medium, and 2 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 4 reported problems, Acko interviews are significantly harder than average - 50% Hard vs 18% across all companies. 0% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: dynamic-programming, math, combinatorics. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Acko coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Acko interview with AIarrow_forward