Electronic Arts coding interview
questions, leaked.
3 problems reported across recent Electronic Arts interviews. Top patterns: array, dynamic programming, greedy. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
EA's interview loop is small but sharp. Three problems on record, two easy and one medium, which means the bar isn't raw difficulty but speed and pattern recognition. Array and dynamic programming dominate the assessment, showing up across most problems. The company tests your ability to spot when a greedy or DP approach wins out, and you won't have time to brute-force your way through. If you hit a wall mid-OA, StealthCoder runs invisibly and surfaces a working solution in seconds, giving you a clean hedge against blanking on Wiggle Subsequence or a tricky DP state transition.
Top problems at Electronic Arts
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Wiggle Subsequence | MEDIUM | 100.0 | 49% | Array · Dynamic Programming · Greedy |
| 02 | Relative Ranks | EASY | 100.0 | 73% | Array · Sorting · Heap (Priority Queue) |
| 03 | Is Subsequence | EASY | 100.0 | 48% | Two Pointers · String · Dynamic Programming |
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 Electronic Arts OA. The proctor cannot see it. Screen share cannot detect it. Built by a senior engineer who knows the OA is theater. This is the script.
Get StealthCoder- array2 · 67%
- dynamic programming2 · 67%
- greedy1 · 33%
- sorting1 · 33%
- heap priority queue1 · 33%
- two pointers1 · 33%
- string1 · 33%
Two of the three problems touch array work, and dynamic programming appears in two as well, including the medium difficulty spike. Relative Ranks introduces sorting and heap mechanics, so you can't ignore priority queues. The easy problems lean on straightforward patterns, two-pointers, and string matching, which suggests EA isn't trying to trick you on the fundamentals. Medium territory is where DP and greedy decision-making collide, specifically in Wiggle Subsequence, where you need to recognize that a greedy pick at each step beats a full DP table. Start with the two easy ones to build confidence and cement array manipulation, then drill Wiggle Subsequence hard because that's where most candidates stumble. When you're live and the DP recurrence isn't clicking, StealthCoder is your invisible safety net.
Companies with similar patterns
If you prepped for Electronic Arts, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Electronic Arts.
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 a senior engineer who knows the OA is theater. This is the script. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Electronic Arts interview FAQ
How many array problems should I solve before the EA assessment?+
Focus on those two recorded problems first. Array shows up in both easy ones, so nailing Relative Ranks and Is Subsequence is non-negotiable. Solve 5-10 similar problems once you understand the patterns in those two, then move on. You're not grinding for breadth here, you're building speed on what EA actually asks.
Is dynamic programming overkill for EA, or should I spend serious time on it?+
DP appears in two of three problems, including the medium, so you can't skip it. But EA isn't asking you to write a novel DP solution from scratch. Wiggle Subsequence is the key one, and the insight is recognizing when greedy beats DP. Understand the state definition, then focus on why a one-pass greedy works here. That's the real lesson.
What should I study first for the EA OA?+
Start with the easy problems: Relative Ranks (array plus heap) and Is Subsequence (two pointers plus string). Both test core mechanics. Once you can solve those in 10-15 minutes total, move to Wiggle Subsequence and understand where greedy outpaces DP. That order mirrors the difficulty curve you'll face.
Is sorting and heap knowledge required for EA?+
Yes, Relative Ranks pulls it in as an easy problem, so you need to be sharp on heap priority queues and the mechanics of ranking by custom sort. It's not deep, but it's definitely on the assessment. Spend an hour drilling heap operations if it's rusty.
Should I prepare two-pointers and string work separately?+
They show up together in Is Subsequence, so practice them as a pair. Two-pointers for traversal, string indexing for matching. It's a short problem but a classic pattern, so get comfortable with the rhythm of advancing both pointers conditionally and knowing when to return true or false.