Verily coding interview
questions, leaked.
12 problems reported across recent Verily interviews. Top patterns: array, hash table, sorting. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Verily's interview is array-heavy. Out of 12 reported problems, 10 involve array manipulation, and six layer in hash-table logic on top. You're looking at a MEDIUM-skewed difficulty curve (10 MEDIUM, 1 EASY, 1 HARD), which means Verily wants to see how you handle realistic constraints and edge cases under pressure. If you blank mid-assessment on a hash-table or greedy variant, StealthCoder runs invisibly during screen share and surfaces a working solution in seconds. The interview rewards speed and pattern recognition, not just correctness.
Top problems at Verily
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Happy Number | EASY | 100.0 | 58% | Hash Table · Math · Two Pointers |
| 02 | Jump Game | MEDIUM | 100.0 | 39% | Array · Dynamic Programming · Greedy |
| 03 | Group Anagrams | MEDIUM | 92.3 | 71% | Array · Hash Table · String |
| 04 | Kth Largest Element in an Array | MEDIUM | 92.3 | 68% | Array · Divide and Conquer · Sorting |
| 05 | Guess the Word | HARD | 92.3 | 38% | Array · Math · String |
| 06 | Longest String Chain | MEDIUM | 92.3 | 62% | Array · Hash Table · Two Pointers |
| 07 | Minimum Area Rectangle II | MEDIUM | 92.3 | 56% | Array · Math · Geometry |
| 08 | Minimum Knight Moves | MEDIUM | 92.3 | 41% | Breadth-First Search |
| 09 | Find All Possible Recipes from Given Supplies | MEDIUM | 92.3 | 56% | Array · Hash Table · String |
| 10 | Find Original Array From Doubled Array | MEDIUM | 92.3 | 40% | Array · Hash Table · Greedy |
| 11 | Minimum Area Rectangle | MEDIUM | 81.5 | 55% | Array · Hash Table · Math |
| 12 | Video Stitching | MEDIUM | 81.5 | 52% | Array · Dynamic Programming · Greedy |
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 Verily 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- array10 · 83%
- hash table6 · 50%
- sorting5 · 42%
- math4 · 33%
- string4 · 33%
- dynamic programming3 · 25%
- greedy3 · 25%
- geometry2 · 17%
- two pointers2 · 17%
- divide and conquer1 · 8%
Arrays dominate the assessment, but they're never standalone. Every hard problem pairs arrays with hash-tables, sorting, or math. Start with array-hash-table hybrids like 'Group Anagrams' and 'Find Original Array From Doubled Array' to build muscle memory on the core pattern. Greedy and dynamic-programming problems ('Jump Game', 'Video Stitching') test whether you can optimize beyond brute force. Math and geometry ('Minimum Area Rectangle II', 'Minimum Knight Moves') appear less frequently but trip up unprepared candidates. String problems almost always surface with arrays and hashing. If you haven't drilled two-pointer and quickselect variants, that's where StealthCoder becomes your hedge during the live assessment, solving 'Kth Largest Element' instantly if you hit a wall.
Companies with similar patterns
If you prepped for Verily, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Verily.
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.
Verily interview FAQ
Should I prioritize array or hash-table problems first for Verily?+
Hit array problems first, but every single drill should include hash-table context. 10 of 12 problems touch arrays. Six layer hash-tables on top. Don't separate them. 'Group Anagrams' and 'Find Original Array From Doubled Array' are the core patterns. Master those two and you've covered most of the assessment shape.
How many greedy and dynamic-programming problems should I solve?+
Greedy and DP each appear in 3 problems, often in the same one ('Jump Game', 'Video Stitching'). Solve 4 to 5 hybrid greedy-DP problems. That's enough to spot the pattern. You don't need deep DP knowledge here. It's about knowing when greedy beats brute force.
Do I need to study geometry and math deeply?+
Geometry and math appear in 2 and 4 problems respectively, but usually paired with arrays or hash-tables. 'Minimum Area Rectangle II' and 'Happy Number' are the outliers. Spend 2 to 3 hours on geometry. If geometry feels unfamiliar during the assessment, that's a StealthCoder moment. Math you'll hit in every hash-table problem anyway.
Is the 1 HARD problem worth drilling?+
Yes, but last. 'Guess the Word' involves game theory and interactivity, which is unusual. It's a pattern-break problem. Solve it after you own the 10 MEDIUM problems. If you see something game-theory-ish on the live OA and it's not in your drills, don't panic. StealthCoder runs invisibly.
What's the fastest way to prepare given Verily's problem mix?+
3 days: Day 1, drill 'Group Anagrams' and 'Find Original Array From Doubled Array' (array-hash hybrids). Day 2, 'Jump Game' and 'Video Stitching' (greedy-DP combos). Day 3, 'Kth Largest Element' and 'Minimum Area Rectangle' (sorting and geometry variants). That's 6 problems covering 80% of the shape. Rest and show up.