Given two strings s and t, return true if they produce the same result when typed into an empty text editor, where '#' represents a backspace character. Applying a backspace on an empty editor leaves it unchanged.

Note: Can you solve it in $O(n)$ time and $O(1)$ space?

Constraints:

• $1 \leq$ s.length, t.length $\leq 200$

• s and t contain only lowercase English ...