Tile-Stack Merge Game
Asked at Google · Coding Questions · Difficulty: Medium · Last asked Dec 29, 2025
Two players play a stacking game on a table of coloured tiles. A position is a collection of stacks; on each turn the player to move merges two stacks into one, and the player who has no legal merge loses. Implement the game rules and a solver that decides who wins from a given position.
Loading the problem…
More Google interview questions
- LLM conceptual questions
- Implement a Nested Tic-Tac-Toe Game Engine
- ML Fundamentals Deep Dive (AI/ML & MLE Roles)
- ML System Design: Recsys, Chatbot, Image Classifier
- ML Coding: Implement a Simple Attention / Layer Forward Pass
- Longest-Match Greedy Tokenization with Dictionary ID Replacement