<p>Solve a given equation and return the value of <code>&#39;x&#39;</code> in the form of a string <code>&quot;x=#value&quot;</code>. The equation contains only <code>&#39;+&#39;</code>, <code>&#39;-&#39;</code> operation, the variable <code>&#39;x&#39;</code> and its coefficient. You should return <code>&quot;No solution&quot;</code> if there is no solution for the equation, or <code>&quot;Infinite solutions&quot;</code> if there are infinite solutions for the equation.</p>

<p>If there is exactly one solution for the equation, we ensure that the value of <code>&#39;x&#39;</code> is an integer.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> equation = &quot;x+5-3+x=6+x-2&quot;
<strong>Output:</strong> &quot;x=2&quot;
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> equation = &quot;x=x&quot;
<strong>Output:</strong> &quot;Infinite solutions&quot;
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> equation = &quot;2x=x&quot;
<strong>Output:</strong> &quot;x=0&quot;
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>3 &lt;= equation.length &lt;= 1000</code></li>
	<li><code>equation</code> has exactly one <code>&#39;=&#39;</code>.</li>
	<li><code>equation</code> consists of integers with an absolute value in the range <code>[0, 100]</code> without any leading zeros, and the variable <code>&#39;x&#39;</code>.</li>
	<li>The input is generated that if there is a single solution, it will be an integer.</li>
</ul>

class Solution:
    def solveEquation(self, equation: str) -> str:
        def get_coeff(equation: str) -> tuple[int, int]:
            a = b = digit = 0
            sign, sign_pos = 1, -1
    
            for i, el in enumerate(equation):
                if not el.isdigit():
                    digit *= sign
                    if el == 'x':
                        digit = sign if i == sign_pos + 1 else digit
                        a += digit
                    else:
                        b += digit
                        sign = 1 if el == "+" else -1
                        sign_pos = i
                    digit = 0
                else:
                    digit = digit * 10 + (ord(el) - 48)

            b += sign * digit
            return a, b

        left, right = equation.split('=')
        al, bl = get_coeff(left)
        ar, br = get_coeff(right)

        a = al - ar
        b = br - bl

        if a == 0:
            if b != 0:
                return "No solution"
            return "Infinite solutions"
        return f"x={b // a}"

16300