- Generate a graph with stolen tiles (1's) as nodes and other connected (Up, Down, Left, Right) tiles as edges.
- The graph will always be bipartite.
- Find Maximum Bipartite Matching by Ford Fulkerson
- 2 checks:
- Return 0 if odd number of 1's (since new tiles are 2x1)
- Return 0 if left set and right set of bipartite graph not equal
-
Notifications
You must be signed in to change notification settings - Fork 0
rhythm-patel/tiles
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published