Variant of https://leetcode.com/problems/isomorphic-strings\n\nGiven two strings, you have to return `true` if they are rhyming else `false`. Strings are [rhyming](https://leetcode.com/discuss/interview-question/277149) if say,\n```\nlying A\ndying A\n\nshower B \nflower B\n```\n\n**Example 1:**\n```\nInput: s1 = "AABB", s2 = "XXYY"\nOutput: true\n```\n\n**Example 2:**\n```\nInput: s1 = "AABB", s2 = "XYZZ"\nOutput: false\n```\n\n<details> \n  <summary>My Solution</summary>\n\nI did it in O(n) time and O(n) space by using map with key and value as character. Basically I checked if every character from string 1 is having same value in string 2 and vice versa (both dimension) so I called the function checkRhyming(string1, string2) twice in main function. I did it pretty fast (maybe under 10-12 min) so we later jumped into optimization.\n\nBy optimization he meant to optimize the code. The follow up was basically, how to optimize for bigger constraint, to which I agreed upon using two map instead of one and doing this by calling function only one time. The space use would increase of course, but that is the tradeoff we could do.\n</details>\n\nTBH I was expecting one more question because I did it pretty fast, and we have many more minutes left.

Variant of https://leetcode.com/problems/isomorphic-strings\n\nGiven two strings, you have to return true if they are rhyming else false. Strings are rhyming if