Coding Challenges
For this week I did 2 more coding problems. The first one I did was more challenging and its called isIsomorphic. Lets say we have 2 strings and a holds the value of the first string and b holds the value of the second string. Two strings are isomorphic only if you can replace all the characters in a with all the characters in b. That means that all the occurrences of a character in a string a must map directly back to another character in the string b. They must back and forth together in order for it to be isomorphic. For example the string abb is isomorphic with the string cdd. That is because for every a character you can replace it with the character c. Also every b character you can replace it with the letter d. In our problem we can also assume that both strings that are given will always be of equal length. When I first started the problem right away I thought to create a dictionary. We could loop through the strings and map every character in string a with string b.