Meta Hacker Cup 2024 — Round 2: Splitting Hares

1. 1Read the original problem statement to understand the problem constraints
2. 2Implement a graph coloring algorithm to assign colors to the hares
3. 3Use constraint satisfaction techniques to ensure that the coloring is valid
4. 4Apply backtracking to handle cases where the initial coloring is not valid
5. 5Test the solution with sample inputs to verify its correctness

This problem is suitable for experienced software engineers and algorithm designers who want to improve their skills in graph theory and constraint satisfaction. It can be beneficial for teams working on complex optimization problems.

💡 Graph coloring and constraint satisfaction can be used to solve complex optimization problems

Solve the Splitting Hares problem from Meta Hacker Cup 2024 using graph coloring & backtracking!