algorithm001
diff --git a/‎Week_02/id_57/leetcode_242_057.cpp‎
Lines changed: 32 additions & 0 deletions b/‎Week_02/id_57/leetcode_242_057.cpp‎
Lines changed: 32 additions & 0 deletions
diff --git a/‎Week_02/id_57/leetcode_671_057.cpp‎
Lines changed: 11 additions & 0 deletions b/‎Week_02/id_57/leetcode_671_057.cpp‎
Lines changed: 11 additions & 0 deletions
@@ -0,0 +1,32 @@
+class Solution {
+public:
+    bool isAnagram(string s, string t) {
+        int A[26] = {0};
+        int B[26] = {0};
+        int i = 0;
+        int j = 0;
+        
+        while(s[i] != '\0')
+        {
+            j = s[i] - 'a';
+            A[j]++;
+            i++;
+        }
+        
+        i = 0;
+        while(t[i] != '\0')
+        {
+            j = t[i] - 'a';
+            B[j]++;
+            i++;
+        }
+        
+        for(i = 0; i < 26; i++)
+        {
+            if(A[i]!=B[i])
+                return false;
+        }
+        return true;
+        
+    }
+};
@@ -0,0 +1,11 @@
+class Solution {
+public:
+    
+    int findSecondMinimumValue(TreeNode* root) {
+        if(!root->left) return -1;
+        int left = (root->left->val == root->val) ? findSecondMinimumValue(root->left) : root->left->val;
+        int right = (root->right->val == root->val) ? findSecondMinimumValue(root->right) : root->right->val;
+        return ((left == -1 ) || (right == -1)) ? max(left,right) : min(left,right);
+
+    }
+};