https://github.com/pantelwar/daily-practice-color-theorem
Solve for number of possible combinations for color theorem
https://github.com/pantelwar/daily-practice-color-theorem
algorithm-challenges algorithms color-theorem
Last synced: 12 months ago
JSON representation
Solve for number of possible combinations for color theorem
- Host: GitHub
- URL: https://github.com/pantelwar/daily-practice-color-theorem
- Owner: Pantelwar
- Created: 2019-10-23T17:37:07.000Z (almost 7 years ago)
- Default Branch: master
- Last Pushed: 2019-10-24T07:22:01.000Z (almost 7 years ago)
- Last Synced: 2025-03-30T21:32:32.505Z (over 1 year ago)
- Topics: algorithm-challenges, algorithms, color-theorem
- Language: Python
- Size: 2.93 KB
- Stars: 1
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# daily-practice-color-theorem
Color Theorem
Problem:
To fill the area with the colors in such a way that the adjacent areas should
not have the same color using color theorem.
Inputs:
Areas = ["A1", "A2", "A3", "A4", "A5", "A6", "A7", "A8", "A9"] // a total of 9 Areas
AdjancentPairs = [
["A4", "A1"], ["A4", "A2"], ["A4", "A7"], ["A4", "A5"],
["A4", "A3"], ["A4", "A6"],
["A1", "A2"], ["A1", "A6"],
["A5", "A6"], ["A5", "A3"],
["A3", "A7"], ["A3", "A2"],
["A2", "A7"], ["A2", "A6"],
["A8", "A2"], ["A8", "A3"],
["A9", "A5"], ["A9", "A6"], ["A9", "A2"], ["A9", "A8"]
]
ColorsUsed = ["G", "Y", "B", "O"] //Green, Yellow, Blue, Orange
Programming languages:
Python, JS, Golang, Java