Decagon · Phone screen
RejectedDecagon Experienced SWE Phone Screen: 1 Experience
A late-2026 Decagon phone screen for an experienced engineer: tic-tac-toe by DFS, an order-of-magnitude estimate, memoization, then a fast rejection.
At a glance
- Process: an online application, then one technical phone screen, where the report describes a single coding task; a rejection followed almost right away (report 01)
- Asked recently: tic-tac-toe solved with depth-first search, with follow-ups on the order of magnitude and on memoization (report 01)
- Difficulty: the candidate rated the screen average, finished the code quickly and was told the approach was right
- Practise first: Count Complete Tic-Tac-Toe Games
Coverage: One experienced software engineer changing jobs, with a Master's degree, who applied online. The report covers one technical phone screen in late 2026 and went up on November 21, 2026. The candidate was rejected.
What came up
The report describes one game-search coding task and its follow-ups.
| Topic | Reports | Last seen |
|---|---|---|
| Coding: game search with memoization | 1 of 1 | Nov 2026 (report date) |
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Count Complete Tic-Tac-Toe Games | 1 | Nov 2026 (report date) |
1 detailed candidate timeline, loops, and screens
01: Experienced SWE, technical phone screen
Interview period: 2026 Q4 · Report date: November 21, 2026 · Role: Software engineer · Degree listed: Master's · Channel: Online application · Candidate's rating: Neutral experience, average · Result: Rejected
Coding: tic-tac-toe
- The task was tic-tac-toe, and the candidate solved it with depth-first search (DFS), which explores each sequence of moves to the end before backing up.
- Once the DFS was written, the interviewer asked for an order-of-magnitude estimate and whether the solution could be improved. The improvement the report names is adding memoization: storing results for positions already seen so they are not searched again.
- The candidate wrote the code quickly, and the interviewer said it was the right approach.
- FastPrep's practice version is Count Complete Tic-Tac-Toe Games. Given a legal, partly filled 3 x 3 or 4 x 4 board, it counts every legal way the game can still play out until someone wins or the board is full. The report names only the game and the method, so the exact question may have differed.
Result
- A rejection arrived almost immediately after the screen, and the candidate did not know why.
Common questions
What coding question does Decagon ask in the phone screen?
Report 01 got a tic-tac-toe task solved with depth-first search.
What follow-ups come after the Decagon tic-tac-toe question?
In report 01 the interviewer asked for an order-of-magnitude estimate and how to improve the solution, and memoization was the improvement.
What to practise
- Count Complete Tic-Tac-Toe Games. The coding task in report 01, November 2026 (report date), with its DFS, order-of-magnitude and memoization follow-ups.
Keep practicing
- Practice question: Count Complete Tic-Tac-Toe Games (report 01).
- More Decagon coding questions: the Decagon coding question bank. It needs sign-in.
- Interview overview: the Decagon interview questions page.
- Hiring insights: the Decagon hiring insights page.
- More firsthand reports: the Experience feed.
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.