1153. String Transforms Into Another String

Author: Partho Biswas

README.md

@@ -426,6 +426,7 @@ BFS, DFS, Dijkstra, Union Find, Kruskal, Prim's, Minimum Spanning Tree, Topologi
 |17| **[785. Is Graph Bipartite?](https://tinyurl.com/wvwqw2j)** | [Python](https://tinyurl.com/wu6rdaw/785_Is_Graph_Bipartite.py)|  **[codinginterviewclass.com](https://tinyurl.com/s4qseoz)**, **[Official](https://tinyurl.com/rynbqly)** | Medium | **Important, Learned new things. Undirected Graph** |
 |18| **[133. Clone Graph](https://tinyurl.com/y42nwqz8)** | [Python](https://tinyurl.com/wu6rdaw/133_Clone_Graph.py)|  **[codinginterviewclass.com](https://tinyurl.com/tnca94n)**, **[Official](https://tinyurl.com/usxjk49)** | Medium | **Important, Learned new things. Undirected Graph** |
 |19| **[332. Reconstruct Itinerary](https://tinyurl.com/gn2mv3k)** | [Python](https://tinyurl.com/wu6rdaw/332_Reconstruct_Itinerary.py)|  [Vid 1](https://tinyurl.com/w47evd9), [Vid 2](https://tinyurl.com/uvop34p), [Art 1](https://tinyurl.com/tsy24pl), [Art 2](https://tinyurl.com/srazxo3), [Art 3](https://tinyurl.com/wluob5j), **[Art 4](https://tinyurl.com/y4s9crf6)** | Medium | **Important, Learned new things. Directed Graph. Eulerian path and top Sort** |
+|20| **[1153. String Transforms Into Another String](https://tinyurl.com/sv9hpo8)** | [Python](https://tinyurl.com/wu6rdaw/1153_String_Transforms_Into_Another_String.py)|  **[Vid 1](https://tinyurl.com/ty2ga7d)**, [Vid 2](https://tinyurl.com/vxr9zxp), [Art 1](https://tinyurl.com/rklzgkk), [Art 2](https://tinyurl.com/seb6vqq), [Art 3](https://tinyurl.com/vfjwn5h), [Art 4](https://tinyurl.com/w62hpq2), [Art 5](https://tinyurl.com/tteucry), [Art 6](https://tinyurl.com/uvctnvz) | Extremely Hard | **TODO: Check again. Very Important and tricky, Learned new things. Digraph.** |
 
 
 </p>

leetcode.com/python/1153_String_Transforms_Into_Another_String.py

@@ -0,0 +1,18 @@
+# Source: https://tinyurl.com/tvppgc4
+
+class Solution(object):
+    def canConvert(self, str1, str2):
+        """
+        :type str1: str
+        :type str2: str
+        :rtype: bool
+        """
+        if str1 == str2:
+            return True
+        m = {}
+        for i in range(len(str1)):
+            if str1[i] not in m:
+                m[str1[i]] = str2[i]
+            elif m[str1[i]] != str2[i]:
+                return False
+        return len(set(str2)) < 26