Satisfiability of Equality Equations

You are given an array of strings equations that represent relationships between variables. Each string equations[i] has length 4 and takes one of two forms: "xi==yi" or "xi!=yi".

Here, xi and yi are lowercase letters, not necessarily different, that represent one-letter variable names.

Return true if it is possible to assign integers to variable names so as to satisfy all the given equations, or false otherwise.

Example 1
Inputequations = ["a==b","b!=a"]
Outputfalse
If a = 1 and b = 1, the first equation is satisfied but the second is not, and there is no assignment that satisfies both equations.
Example 2
Inputequations = ["b==a","a==b"]
Outputtrue
Assigning a = 1 and b = 1 satisfies both equations.

Constraints

  • 1 <= equations.length <= 500
  • equations[i].length == 4
  • equations[i][0] is a lowercase letter.
  • equations[i][1] is either '=' or '!'.
  • equations[i][2] is '='.
  • equations[i][3] is a lowercase letter.

Asked at 6 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate