Solve snake game, peak search, and task scheduling

Q: Solve snake game, peak search, and task scheduling

This is a Coding & Algorithms interview question from IXL Learning for Software Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Design a grid-based snake simulation that supports move(direction) operations on a W×H board. The snake grows when it consumes food at predetermined coordinates; return the score after each move or -1 if the snake hits a wall or itself. Specify the data structures to achieve O(
average time per move and explain how you detect collisions and advance the food pointer.
Given an integer array, find any index i such that nums[i] is strictly greater than its immediate neighbors (a local peak) in O(log n) time and O(
space. Describe the algorithm, prove correctness, and discuss adaptations when duplicates are allowed.
You are given tasks identified by characters and a non-negative cooldown n. Compute the minimum number of time slots to finish all tasks if each slot can execute one task or be idle, and outline how to construct one valid schedule. Extend your approach to handle distinct cooldowns per task.

Solve snake game, peak search, and task scheduling

Comments (0)