Skip to content

Solve for number of possible combinations for color theorem

Notifications You must be signed in to change notification settings

Pantelwar/daily-practice-color-theorem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 

Repository files navigation

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

About

Solve for number of possible combinations for color theorem

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published