Available question text
Simulate a Snake game on an m×n grid supporting move(direction): the snake advances, grows when it eats sequentially placed food (increasing score), and the game ends on collision with walls or the snake's own body. Candidates should track the snake body and occupied cells efficiently for frequent moves (e.g., deque + hash set) and handle food lookup and collision checks.
Related questions
Continue with questions that share topics or the same question type.
- Snake Game Implementation
Coding
- 2048 Game Backend
Coding
- 24 Game
Coding
- Alice and Bob Playing Flower Game
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 5 records
Apple
Leetcode 353. Design Snake Game
Reported Sep 13, 2024 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View sourceAtlassian
Leetcode 353. Design Snake Game
Reported Apr 23, 2026 · 5 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View sourceBloomberg
Leetcode 353. Design Snake Game
Reported Jul 15, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View sourceMeta
Leetcode 353. Design Snake Game
Reported Nov 1, 2026 · 2 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View source