Leetcode Grinding #4 | Isomorphic Strings. C# solution explained

Lets grind LeetCode together, until no problems are left unsolved.

Isomorphic Strings - an interesting problem to solve, which is part of LeetCode 75 study plan.

[andreicristofalgorithms]

Apologies, in the video I forgot to mention the computational complexity. We have:

Time Complexity: O(n), because we need to iterate once through each character in both strings, to determine if they are isomorphic.
Space Complexity: O(1) or constant time, because the amount of memory we use is constant, and is not influenced by the size of the input data (the strings).
Hope it helps.