add 1153

Author: luliyucoordinate

README.md

@@ -472,4 +472,5 @@ LeetCode
 |1147|[Longest Chunked Palindrome Decomposition](https://leetcode.com/problems/longest-chunked-palindrome-decomposition/) | c | [c++](./src/1147-Longest-Chunked-Palindrome-Decomposition/1147.cpp) |[python](./src/1147-Longest-Chunked-Palindrome-Decomposition/1147.py)|[go](./src/1147-Longest-Chunked-Palindrome-Decomposition/1147.go)|[js](./src/1147-Longest-Chunked-Palindrome-Decomposition/1147.js)|Hard|
 |1150|[Check If a Number Is Majority Element in a Sorted Array](https://leetcode.com/contest/biweekly-contest-6/problems/is-a-a-majority-element/) | c | [c++](./src/1150-Check-If-a-Number-Is-Majority-Element-in-a-Sorted-Array/1150.cpp) |[python](./src/1150-Check-If-a-Number-Is-Majority-Element-in-a-Sorted-Array/1150.py)|[go](./src/1150-Check-If-a-Number-Is-Majority-Element-in-a-Sorted-Array/1150.go)|[js](./src/1150-Check-If-a-Number-Is-Majority-Element-in-a-Sorted-Array/1150.js)|Easy|
 |1151|[Minimum Swaps to Group All 1's Together](https://leetcode.com/contest/biweekly-contest-6/problems/minimum-swaps-to-group-all-1s-together/) | c | [c++](./src/1151-Minimum-Swaps-to-Group-All-1's-Together/1151.cpp) |[python](./src/1151-Minimum-Swaps-to-Group-All-1's-Together/1151.py)|[go](./src/1151-Minimum-Swaps-to-Group-All-1's-Together/1151.go)|[js](./src/1151-Minimum-Swaps-to-Group-All-1's-Together/1151.js)|Medium|
-|1152|[Analyze User Website Visit Pattern](https://leetcode.com/contest/biweekly-contest-6/problems/analyse-user-website-visit-pattern/) | c | [c++](./src/1152-Analyze-User-Website-Visit-Pattern/1152.cpp) |[python](./src/1152-Analyze-User-Website-Visit-Pattern/1152.py)|[go](./src/1152-Analyze-User-Website-Visit-Pattern/1152.go)|[js](./src/1152-Analyze-User-Website-Visit-Pattern/1152.js)|Medium|
+|1152|[Analyze User Website Visit Pattern](https://leetcode.com/contest/biweekly-contest-6/problems/analyse-user-website-visit-pattern/) | c | [c++](./src/1152-Analyze-User-Website-Visit-Pattern/1152.cpp) |[python](./src/1152-Analyze-User-Website-Visit-Pattern/1152.py)|[go](./src/1152-Analyze-User-Website-Visit-Pattern/1152.go)|[js](./src/1152-Analyze-User-Website-Visit-Pattern/1152.js)|Medium|
+|1153|[String Transforms Into Another String](https://leetcode.com/contest/biweekly-contest-6/problems/string-transforms-into-another-string/) | c | [c++](./src/1153-String-Transforms-Into-Another-String/1153.cpp) |[python](./src/1153-String-Transforms-Into-Another-String/1153.py)|[go](./src/1153-String-Transforms-Into-Another-String/1153.go)|[js](./src/1153-String-Transforms-Into-Another-String/1153.js)|Hard|

src/1153-String-Transforms-Into-Another-String/1153.cpp

@@ -0,0 +1,20 @@
+class Solution 
+{
+public:
+    bool canConvert(string str1, string str2) 
+    {
+        unordered_set<char> s2(str2.begin(), str2.end());
+        if (s2.size() == 26) return str1 == str2;
+        
+        unordered_map<char, char> d;
+        for (int i = 0; i < str1.size(); ++i)
+        {
+            if (d.count(str1[i])) 
+            {
+                if (d[str1[i]] != str2[i]) return false;
+            }
+            else d[str1[i]] = str2[i];
+        }   
+        return true;
+    }
+};

src/1153-String-Transforms-Into-Another-String/1153.go

@@ -0,0 +1,21 @@
+func canConvert(str1 string, str2 string) bool {
+    s2 := make(map[rune]int)
+    for _, v := range str2 {
+        s2[v]++
+    }
+    if len(s2) == 26 {
+        return str1 == str2
+    }
+    
+    d := make(map[byte]byte) 
+    for i := 0; i < len(str1); i++ {
+        if _, ok := d[str1[i]]; ok {
+            if d[str1[i]] != str2[i] {
+                return false
+            }
+        } else {
+            d[str1[i]] = str2[i]
+        }
+    }
+    return true
+}

src/1153-String-Transforms-Into-Another-String/1153.js

@@ -0,0 +1,11 @@
+var canConvert = function(str1, str2) {
+    var s2 = new Set(str2);
+    if (s2.size == 26) return str1 == str2;
+    var d = new Map();
+    for (var i = 0; i < str1.length; ++i) {
+        if (d.has(str1[i])) {
+            if (d.get(str1[i]) != str2[i]) return false;
+        } else d.set(str1[i], str2[i]);
+    }
+    return true;
+};

src/1153-String-Transforms-Into-Another-String/1153.py

@@ -0,0 +1,14 @@
+class Solution:
+    def canConvert(self, str1: str, str2: str) -> bool:
+        n, m = len(str1), len(set(str2))
+        if m == 26:
+            return str1 == str2
+        
+        d = {}
+        for i, c in enumerate(str1):
+            if c in d:
+                if d[c] != str2[i]:
+                    return False
+            else:
+                d[c] = str2[i]
+        return True