You have teams. Each team has a home uniform color and an away uniform color. Teams play each other once. Count how many games have a conflict: the host's home color matches the guest's away color.
I'll show you how structs organize paired data. Instead of managing two separate arrays for home and away colors, you'll bundle them into team objects. This makes comparisons natural and prevents index mismatches.
Before reading on, think: how many games happen total? If team A hosts team B, what colors do they wear? Understanding the problem structure guides your solution.