Meta Coding Puzzles
💻 🚀🚀 Solve the puzzles in your favorite programming language and improve your coding skills 🚀🚀
🧩🧩🧩🧩
A simple puzzle to get you started, involving calculating the total available seating at a cafeteria.
This puzzle involves calculating the conditional array sequencing, based on several input parameters.
In this puzzle, you need to implement a system for managing orders at a sushi restaurant with a rotating conveyor belt. Plates serving the sushi are placed on a rotating conveyor belt that winds through the restaurant and moves past every table, counter, and seat. The final bill is based on the number and type of plates of the consumed sushi. Some restaurants use a variation of the concept, such as miniature wooden "sushi boats" that travel through small canals or miniature locomotive cars that travel on a track.
The "Tunnel Time" puzzle is the most challenging puzzle in this set. The puzzle involves finding the shortest path through a network of tunnels, each with a different travel time.
The train track is circular, with positions numbered from 0 to C-1 (where C is the circumference of the track). The train travels clockwise at a speed of 1 meter per second and starts at position 0. The goal is to determine the total number of seconds before the train's tunnel time becomes X.
There are N tunnels covering sections of the track, with no tunnel touching position 0 or intersecting with any other tunnels. The tunnels are specified by their starting and ending positions along the track, and their lengths range from 1 to C-1 meters.
To solve this puzzle, you will need to implement an algorithm that finds the shortest path through the tunnels and calculates the total time the train spends in the tunnels. The puzzle is rated as (++++0), indicating its high level of difficulty.
To use these puzzles, simply clone the repository and start working on the puzzles in your preferred programming language. Each puzzle has its own directory with a README file containing the problem description and input/output examples.