day 8

Author: sachuverma

Leetcode Daily Challenge/January-2021/08. Check If Two String Arrays are Equivalent.cpp

@@ -0,0 +1,52 @@
+/*
+Check If Two String Arrays are Equivalent
+===========================================
+
+Given two string arrays word1 and word2, return true if the two arrays represent the same string, and false otherwise.
+
+A string is represented by an array if the array elements concatenated in order forms the string.
+
+Example 1:
+Input: word1 = ["ab", "c"], word2 = ["a", "bc"]
+Output: true
+Explanation:
+word1 represents string "ab" + "c" -> "abc"
+word2 represents string "a" + "bc" -> "abc"
+The strings are the same, so return true.
+
+Example 2:
+Input: word1 = ["a", "cb"], word2 = ["ab", "c"]
+Output: false
+
+Example 3:
+Input: word1  = ["abc", "d", "defg"], word2 = ["abcddefg"]
+Output: true
+ 
+Constraints:
+1 <= word1.length, word2.length <= 103
+1 <= word1[i].length, word2[i].length <= 103
+1 <= sum(word1[i].length), sum(word2[i].length) <= 103
+word1[i] and word2[i] consist of lowercase letters.
+
+Hint #1  
+Concatenate all strings in the first array into a single string in the given order, the same for the second array.
+
+Hint #2  
+Both arrays represent the same string if and only if the generated strings are the same.
+*/
+
+class Solution
+{
+public:
+  bool arrayStringsAreEqual(vector<string> &word1, vector<string> &word2)
+  {
+    string a, b;
+
+    for (auto &i : word1)
+      a += i;
+    for (auto &i : word2)
+      b += i;
+
+    return a == b;
+  }
+};

Leetcode Daily Challenge/January-2021/README.md

@@ -9,5 +9,7 @@
 | 5.  | [Remove Duplicates from Sorted List II](https://leetcode.com/explore/challenge/card/january-leetcoding-challenge-2021/579/week-1-january-1st-january-7th/3593/) | [cpp](./05.%20Remove%20Duplicates%20from%20Sorted%20List%20II.cpp) |
 | 6.  | [Kth Missing Positive Number](https://leetcode.com/explore/challenge/card/january-leetcoding-challenge-2021/579/week-1-january-1st-january-7th/3594/) | [cpp](./06.%20Kth%20Missing%20Positive%20Number.cpp) |
 | 7.  | [Longest Substring Without Repeating Characters](https://leetcode.com/explore/challenge/card/january-leetcoding-challenge-2021/579/week-1-january-1st-january-7th/3595/) | [cpp](./07.%20Longest%20Substring%20Without%20Repeating%20Characters.cpp) |
+| .8  | [Check If Two String Arrays are Equivalent](https://leetcode.com/explore/challenge/card/january-leetcoding-challenge-2021/580/week-2-january-8th-january-14th/3597/) | [cpp](./08.%20Check%20If%20Two%20String%20Arrays%20are%20Equivalent.cpp) |
+| .  | []() | [cpp](./.%20.cpp) |
 | .  | []() | [cpp](./.%20.cpp) |
 | .  | []() | [cpp](./.%20.cpp) |