Geico coding interview
questions, leaked.
20 problems reported across recent Geico interviews. Top patterns: array, string, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Geico's coding interview is medium-heavy. Out of 20 reported problems, 16 are medium difficulty, and arrays and strings dominate the mix, appearing in half the problems you'll face. You need speed and pattern recognition on problems like Largest Palindromic Number and Maximum Number of Potholes That Can Be Fixed. Hash tables, greedy algorithms, and dynamic programming round out the core. If you blank mid-assessment, StealthCoder runs invisibly during your screen share and surfaces working code in seconds. That's your safety net.
Top problems at Geico
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Largest Palindromic Number | MEDIUM | 100.0 | 36% | Hash Table · String · Greedy |
| 02 | Maximum Number of Potholes That Can Be Fixed | MEDIUM | 100.0 | 53% | String · Greedy · Sorting |
| 03 | Integer to Roman | MEDIUM | 89.4 | 69% | Hash Table · Math · String |
| 04 | Number of Steps to Reduce a Number in Binary Representation to One | MEDIUM | 89.4 | 61% | String · Bit Manipulation · Simulation |
| 05 | Coin Change | MEDIUM | 81.5 | 46% | Array · Dynamic Programming · Breadth-First Search |
| 06 | Best Time to Buy and Sell Stock with Cooldown | MEDIUM | 81.5 | 60% | Array · Dynamic Programming |
| 07 | Valid Sudoku | MEDIUM | 81.5 | 62% | Array · Hash Table · Matrix |
| 08 | First Missing Positive | HARD | 76.2 | 41% | Array · Hash Table |
| 09 | Number of Spaces Cleaning Robot Cleaned | MEDIUM | 76.2 | 62% | Array · Matrix · Simulation |
| 10 | Path with Maximum Gold | MEDIUM | 69.5 | 68% | Array · Backtracking · Matrix |
| 11 | Boundary of Binary Tree | MEDIUM | 69.5 | 47% | Tree · Depth-First Search · Binary Tree |
| 12 | Longest Happy String | MEDIUM | 69.5 | 65% | String · Greedy · Heap (Priority Queue) |
| 13 | Minimum Number of Food Buckets to Feed the Hamsters | MEDIUM | 69.5 | 47% | String · Dynamic Programming · Greedy |
| 14 | Cinema Seat Allocation | MEDIUM | 60.0 | 43% | Array · Hash Table · Greedy |
| 15 | Minimum Moves to Spread Stones Over Grid | MEDIUM | 60.0 | 44% | Array · Dynamic Programming · Breadth-First Search |
| 16 | Best Time to Buy and Sell Stock II | MEDIUM | 60.0 | 70% | Array · Dynamic Programming · Greedy |
| 17 | Decode String | MEDIUM | 60.0 | 61% | String · Stack · Recursion |
| 18 | Roman to Integer | EASY | 60.0 | 65% | Hash Table · Math · String |
| 19 | Count of Smaller Numbers After Self | HARD | 60.0 | 43% | Array · Binary Search · Divide and Conquer |
| 20 | Remove All Adjacent Duplicates In String | EASY | 60.0 | 72% | String · Stack |
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 Geico OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who realized the OA tests how well you memorized 200 problems, not how well you code.
Get StealthCoder- array10 · 50%
- string9 · 45%
- hash table6 · 30%
- greedy6 · 30%
- dynamic programming5 · 25%
- matrix4 · 20%
- breadth first search2 · 10%
- math2 · 10%
- bit manipulation2 · 10%
- simulation2 · 10%
The dataset skews medium. 80 percent of problems sit at medium difficulty, with only 2 hard outliers. Arrays and strings account for 19 of 20 problems combined, so your drilling should start there. Greedy and hash-table problems appear frequently and often interlock (Largest Palindromic Number hits all four). Dynamic programming is less common but critical for Coin Change and Best Time to Buy and Sell Stock with Cooldown. Matrix problems (Valid Sudoku, Path with Maximum Gold) require both array fluency and spatial reasoning. If you haven't practiced greedy string manipulation or hash-table counting patterns recently, StealthCoder is the hedge for whatever patterns you don't nail in the first ten minutes.
Companies with similar patterns
If you prepped for Geico, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Geico.
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 Amazon engineer who realized the OA tests how well you memorized 200 problems, not how well you code. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Geico interview FAQ
Should I focus on arrays first for Geico?+
Yes. Arrays appear in 10 of 20 reported problems. Start with First Missing Positive and Valid Sudoku to build confidence, then move to matrix variants like Path with Maximum Gold. You'll recognize array patterns fast once you drill these.
How important is greedy for Geico?+
Very. Greedy strategies show up in 6 problems, often paired with strings or hash tables. Largest Palindromic Number and Maximum Number of Potholes That Can Be Fixed are great practice. Greedy intuition is harder to fake, so drill early.
Do I need to be strong at dynamic programming for this interview?+
Moderately. DP appears in 5 problems but pairs with arrays or breadth-first search. Coin Change and Best Time to Buy and Sell Stock with Cooldown are the core. If DP isn't your strength, focus on the recurrence relation structure first.
What's the hardest problem type on this list?+
First Missing Positive is the only hard array-hash-table problem. It requires in-place manipulation and hash logic under pressure. Every other problem is medium, so mastering First Missing Positive gives you a confidence boost and signals interview readiness.
How much time should I spend on matrix problems before the interview?+
Matrix problems appear in 4 of 20 reports, often paired with backtracking or simulation. Valid Sudoku and Path with Maximum Gold are your targets. Get comfortable with 2D traversal, then pivot to string and array work, which have higher frequency.