EY coding interview
questions, leaked.
3 problems reported across recent EY interviews. Top patterns: array, hash table, math. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
EY's coding assessment is light on volume but heavy on pattern recognition. Three problems doesn't sound like much until you realize two are easy wins and one medium curveball tests whether you can combine greedy logic with heap operations under pressure. Two Sum and Fibonacci Number are your confidence builders. Longest Happy String is where most candidates stall. If you blank mid-assessment, StealthCoder runs invisibly during screen share and surfaces a working solution in seconds, keeping your rhythm intact.
Top problems at EY
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Two Sum | EASY | 100.0 | 56% | Array · Hash Table |
| 02 | Fibonacci Number | EASY | 100.0 | 73% | Math · Dynamic Programming · Recursion |
| 03 | Longest Happy String | MEDIUM | 100.0 | 65% | String · Greedy · Heap (Priority Queue) |
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 EY 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- array1 · 33%
- hash table1 · 33%
- math1 · 33%
- dynamic programming1 · 33%
- recursion1 · 33%
- memoization1 · 33%
- string1 · 33%
- greedy1 · 33%
- heap priority queue1 · 33%
The distribution here is deceptive. Hash tables and arrays dominate the easy tier, so nailing Two Sum in under five minutes should feel automatic. Fibonacci Number tests whether you've internalized memoization and recursion as synonyms for the same optimization problem. The real test is Longest Happy String. It combines string manipulation, greedy selection, and heap ordering. This is where candidates who crammed hash tables but skipped heap problems crater. Priority queues aren't intuitive; if you haven't built one from scratch, you'll second-guess the heap operations live. StealthCoder is your hedge here. Even if heap syntax slips your mind mid-OA, it solves the pattern in real time while the proctor sees nothing.
Companies with similar patterns
If you prepped for EY, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass EY.
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.
EY interview FAQ
Should I spend more time on hash tables or heaps for EY?+
Hash tables appear in Two Sum and are foundational, but Longest Happy String (the medium) demands heap fluency. Both matter, but heap is the differentiator. Two Sum is the gimme. Don't let easy problems make you skip the harder pattern.
Is dynamic programming worth drilling heavily for EY?+
Fibonacci Number directly tests it, so yes. It's one of three total problems. But the DP angle here isn't complex optimization. It's memoization versus naive recursion. Know the difference and you're 70% there.
How much time should I budget for the medium problem?+
Longest Happy String requires greedy logic and heap ordering working together. Budget 15 to 20 minutes if you know heaps, 25+ if you're rusty. It's where the bar separates confident from anxious.
Will I see recursion problems other than Fibonacci?+
Recursion shows up as a tag on Fibonacci Number, not as a separate problem category in the data. Master the memoization angle on that one problem and you're covered for what EY's asking.
What's the fastest way to prep three problems in a week?+
Solve Two Sum cold in 3 minutes to build momentum. Implement Fibonacci both recursively and with memoization to feel the optimization click. Spend the rest of your time on Longest Happy String. Understand the greedy choice and heap state transitions. Skip the rest.