Yext coding interview
questions, leaked.
4 problems reported across recent Yext interviews. Top patterns: array, matrix, math. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Yext's coding assessment is lean but sharp: four problems across easy, medium, and hard tiers. You're looking at array and matrix manipulation bundled with math and string work, plus one design problem that catches candidates off guard. The good news is the surface area is small. The catch is depth. A single hard problem like Integer to English Words can derail you if you haven't practiced the recursive breakdown. StealthCoder sits invisibly behind you during the live assessment, ready to unblock you on patterns you didn't have time to drill.
Top problems at Yext
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Design Tic-Tac-Toe | MEDIUM | 100.0 | 59% | Array · Hash Table · Design |
| 02 | Excel Sheet Column Title | EASY | 90.1 | 44% | Math · String |
| 03 | Integer to English Words | HARD | 90.1 | 34% | Math · String · Recursion |
| 04 | Minesweeper | MEDIUM | 90.1 | 68% | Array · Depth-First Search · Breadth-First Search |
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 Yext OA. The proctor cannot see it. Screen share cannot detect it. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage.
Get StealthCoder- array2 · 50%
- matrix2 · 50%
- math2 · 50%
- string2 · 50%
- hash table1 · 25%
- design1 · 25%
- simulation1 · 25%
- recursion1 · 25%
- depth first search1 · 25%
- breadth first search1 · 25%
Array, matrix, math, and string problems appear twice each in the reported pool, making them the core of what Yext tests. Design and simulation show up once, but Design Tic-Tac-Toe is a medium that requires clean state management, not just algorithm fluency. The hard tier (Integer to English Words) combines recursion with string building under cognitive load. DFS and BFS appear once each, tied to the Minesweeper problem. Your prep order: nail array and matrix operations first, then move to the math-string hybrid problems. If you hit a wall on the recursive case breakdown or the design state machine mid-assessment, StealthCoder runs invisibly and surfaces a working solution while the proctor sees nothing.
Companies with similar patterns
If you prepped for Yext, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Yext.
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 engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Yext interview FAQ
Should I practice array and matrix problems first for Yext?+
Yes. Both topics appear twice in reported problems and form the foundation for Minesweeper and Tic-Tac-Toe. Start there, then layer in math-string work. You'll build confidence fast on familiar ground before tackling the hard recursion problem.
How much time should I spend on the design problem?+
Design Tic-Tac-Toe is medium difficulty and tests state management and game logic, not exotic design patterns. Spend time understanding how to track board state and validate moves cleanly. It's solvable but requires clear thinking under time pressure.
Is Integer to English Words really that hard?+
It's the only hard problem in the pool and it combines recursion with string building. The tricky part is breaking down place values (ones, tens, thousands) without off-by-one errors. Practice the recursive pattern beforehand; it's a common gotcha.
Do I need to know DFS and BFS for this assessment?+
They appear once, in Minesweeper. If you understand how to explore a grid and mark visited cells, you're fine. It's not a deep-dive graph theory round. Minesweeper is a straightforward application of flood-fill logic.
What's the one thing I'll regret not practicing?+
Math-string hybrids like Excel Sheet Column Title and Integer to English Words. They look simple but require precision with base conversion and place-value logic. One off-by-one error and you fail test cases silently.