Leetcode Problem 990. Satisfiability of Equality Equations

990. Satisfiability of Equality Equations

Leetcode Solutions

Build an undirected graph where each node represents a variable and each edge represents an == relationship.
Initialize all variables as uncolored.
Perform DFS on each uncolored node, coloring all reachable nodes with a unique color for each connected component.
After all nodes are colored, iterate through the != equations.
If any != equation has both variables with the same color, return false as they are in the same connected component.
If no contradictions are found, return true.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen