TomoLink
CompaniesZeptoData Structures & AlgorithmsSatisfiability of Equality Equations
DSA
MediumArray

Satisfiability of Equality Equations

arraystringunion-find

Problem Statement

You are given an array of strings equations that represent relationships between variables where each string equations[i] is of length 4 and takes one of two different forms: "x _i ==y _i " or "x _i !=y _i " .Here, x _i and y _i 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 .

Examples

Example 1
Input: equations = ["a==b","b!=a"]
Output: false
If we assign say, a = 1 and b = 1, then the first equation is satisfied, but not the second. There is no way to assign the variables to satisfy both equations.
Example 2
Input: equations = ["b==a","a==b"]
Output: true
We could assign a = 1 and b = 1 to satisfy 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.
🤔
Medium
Difficulty
Topic Info
ModuleDSA
CategoryArray
Sub-topicString
Tags
arraystringunion-findgraph theory
Navigation
Satisfiability of Equality Equations [Medium] | Zepto Dsa | TomoLink