Chime Backend Engineer interview questions

4 Backend Engineers have shared notes from their Chime interviews, with the questions they were asked in each round. That is 14% of the 28 Chime interview notes on Screna AI.

4 Backend Engineer interview notes

Chime·Backend Engineer·Technical Phone Screen

May 2026
Chime backend interview with a string parsing problem that had two parts, the second of which got pretty gnarly. The core idea was simple but the follow-up with shuffled input forced a real algorithmic solution and I wasn't fully prepared for how much the complexity jumped.
  • Given an integer n and a string formed by concatenating n-1 numbers from the range 1 to n in sorted order, find the missing number.
  • Now the numbers were shuffled before concatenation. The string is the same length but the order of numbers is arbitrary. Find the missing number.

“Part one felt manageable.”

View Post

Chime·Backend Engineer·Technical Phone Screen

May 2026
Chime backend interview that threw a full game simulation problem at me. Not your typical CRUD or algorithm warm-up, this one required thinking through data modeling and game state logic at the same time, which I wasn't really prepared for.
  • Implement a function that takes a board size and a list of moves for a two-player board game, then returns the current board state or winner. The game involves placing pieces, toppling stacks in cardinal directions, and capturing opponent pieces. You need to define your own data model for the board, stacks, and ownership.

“I spent probably the first five minutes just trying to nail down the data model before writing any logic, which I think was the right call but I second-guessed myself the whole time.”

View Post

Chime·Backend Engineer·Technical Phone Screen

May 2026
Chime backend round, one meaty coding problem that took up the whole session. The T9 word combination thing sounds straightforward until you're actually in it trying to explain pruning strategies under pressure.
  • Given a string of T9 digits and a dictionary of valid words, return all combinations of dictionary words whose concatenated T9 encodings exactly match the input digit string. Follow-up: how would you optimize with trie or prefix-based pruning, and what are the tradeoffs between a recursive and a DP approach?

“I started with the naive recursive approach, enumerate all words that match the current digit prefix, recurse on the remainder.”

View Post

Chime·Backend Engineer·Technical Phone Screen

May 2026
Chime backend interview that started with a classic LC problem and then kept stacking on follow-ups until I was basically designing a mini browser engine. The progression felt deliberate and a little exhausting.
  • Implement a BrowserHistory class that supports visiting a URL, going back a given number of steps, and going forward a given number of steps.
  • Add a haveVisited(url) method that returns whether a given URL has ever been visited across the entire history.
  • Extend the design to support multiple browser tabs, where each tab has its own independent back/forward history but haveVisited checks across all tabs globally. Walk through your data structures and complexity.

“Pretty standard stuff if you've seen it before.”

View Post