Aon coding interview
questions, leaked.
4 problems reported across recent Aon interviews. Top patterns: array, bit manipulation, database. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Aon's assessment is small but dense. Four problems total, split evenly across difficulty tiers, with array and bit manipulation dominating the question set. You're looking at a gauntlet of bitwise operations layered on top of array manipulation, which means the real skill being tested is pattern recognition under constraint. If you can't spot the bit trick in the first two minutes, you'll waste the whole problem. StealthCoder sits invisible during the live assessment and solves it in seconds if you hit a wall, but you still need to know the landscape going in.
Top problems at Aon
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Construct the Minimum Bitwise Array II | MEDIUM | 100.0 | 35% | Array · Bit Manipulation |
| 02 | Construct the Minimum Bitwise Array I | EASY | 100.0 | 74% | Array · Bit Manipulation |
| 03 | Classifying Triangles by Lengths | EASY | 88.5 | 51% | Database |
| 04 | Minimize OR of Remaining Elements Using Operations | HARD | 88.5 | 29% | Array · Greedy · Bit Manipulation |
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 Aon OA. The proctor cannot see it. Screen share cannot detect it. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know.
Get StealthCoder- array3 · 75%
- bit manipulation3 · 75%
- database1 · 25%
- greedy1 · 25%
Array and bit manipulation appear in three of the four problems, so those are your survival topics. The easy problems warm you up with foundational bitwise thinking on arrays. The medium and hard problems compound the difficulty by adding greedy logic and operation optimization on top. What's telling is the absence of classic string, hash-table, or tree problems. Aon is testing your ability to reason about low-level operations and constraints, not breadth. Start with the two easy problems to lock in the bit-manipulation patterns, then move to the medium. The hard problem is your hedge case, where StealthCoder becomes your real-time backup if the greedy insight doesn't click.
Companies with similar patterns
If you prepped for Aon, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Aon.
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 FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Aon interview FAQ
Should I focus on bit manipulation or array problems first?+
Hit array first. Three of Aon's four problems involve arrays, and two are rated easy. You'll build confidence and see how bit operations layer on top of array mechanics. Bit manipulation is the accelerant, not the foundation. Master the pattern on the easy problems, then apply it under pressure on the medium and hard.
How much greedy algorithm prep do I need for Aon?+
One problem uses greedy logic, and it's the hardest one on the assessment. Skip deep greedy study. Instead, understand that the hard problem likely combines array iteration with a greedy choice at each step. The bit-manipulation and array foundation you build on the first three problems will guide the greedy insight.
Is one HARD problem enough to tank my assessment?+
Not necessarily. You have two easy and one medium to bank points. If the hard problem stalls you, move on. Aon's assessment is short enough that nailing the three easier problems and attempting the hard one gives you a reasonable score. Don't lose time on it if you hit a wall early.
What bitwise operations should I drill before this assessment?+
Focus on AND, OR, and XOR with arrays. Both 'Construct the Minimum Bitwise Array' problems test your ability to manipulate bits across array elements. Know how to toggle, clear, and compare bits. Skip advanced topics like bit DP. The problems here are about tactical bit operations, not theory.
Should I practice the exact problems or study the patterns?+
Study the patterns. Aon has only four reported problems, so exact repetition is unlikely. Instead, drill any array problem that involves bit operations, greedy selection, or optimization under constraints. The goal is fluency with bitwise thinking so you can spot the pattern and code it fast during the live assessment.