Braze coding interview
questions, leaked.
3 problems reported across recent Braze interviews. Top patterns: array, string, stack. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Braze's coding assessment is small but deceptive. Three problems total, two of them easy, but the medium one pulls from four different pattern families at once. You'll see array manipulation, two-pointers, matrix logic, and simulation all in a single problem. The easy ones are real gatekeeping questions: Valid Parentheses and Two Sum. Miss the stack or hash-table detail and you're done. If you blank mid-assessment, StealthCoder solves it invisibly while you stay on screen share.
Top problems at Braze
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Valid Parentheses | EASY | 100.0 | 42% | String · Stack |
| 02 | Two Sum | EASY | 90.3 | 56% | Array · Hash Table |
| 03 | Candy Crush | MEDIUM | 90.3 | 77% | Array · Two Pointers · Matrix |
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 Braze OA. The proctor cannot see it. Screen share cannot detect it. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround.
Get StealthCoder- array2 · 67%
- string1 · 33%
- stack1 · 33%
- hash table1 · 33%
- two pointers1 · 33%
- matrix1 · 33%
- simulation1 · 33%
The dataset is weighted toward breadth over depth. Two easy problems cover string-stack and array-hash-table fundamentals, so don't skip those basics just because they're easy. The Candy Crush problem is where most candidates stumble because it forces you to synthesize multiple techniques: array iteration, pointer movement, matrix navigation, and state-change logic all in one go. That's the real test. Stack and two-pointers appear once each but in high-leverage positions. If you've drilled Valid Parentheses and Two Sum cold, you'll clear the easy tier fast. Spend the bulk of your time on simulation and matrix patterns. When you hit the Candy Crush variant during the live OA and feel lost, StealthCoder is your safety net to pull a working approach in seconds.
Companies with similar patterns
If you prepped for Braze, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Braze.
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 because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Braze interview FAQ
Should I spend equal time on all three problems?+
No. The two easy problems are fast wins. Valid Parentheses and Two Sum should take you maybe 15-20 minutes combined if you know your stack and hash-table syntax cold. Spend the real prep time on Candy Crush, which combines array, two-pointers, matrix, and simulation. That's where the interview lives.
Is hash-table really a blocker for Braze?+
Yes. Two Sum appears in the easy tier, and you need O(1) lookup to pass. If you're not comfortable building a hash-table on the fly and checking membership, you'll either TLE or write an O(n^2) brute force. That fails. Master it first.
What topic should I drill first for Braze?+
Stack. Valid Parentheses is blocking. It's easy but it tests whether you understand stack discipline: push on open, pop and match on close, reject on mismatch. Get that muscle memory locked, then move to Two Sum, then tackle Candy Crush.
Is two-pointers enough practice for the Candy Crush problem?+
No. Two-pointers is only one layer. Candy Crush also requires you to iterate through a matrix, track state changes across multiple passes, and handle the cascading logic. Practice the pattern with matrix problems that involve repeated passes and state updates, not just two-pointer classics.
How do I prepare for a problem I've never seen before?+
You don't fully prepare. That's why the hard ones exist. You can drill the component patterns: array iteration, two-pointer logic, stack operations, hash-table lookup. But Candy Crush combines them in a way you can't predict. Recognize the sub-patterns, build incrementally, and if you stall on the live OA, you have StealthCoder running invisibly to unblock you.