Updated codebase and added day23 solution

Author: avidLearnerInProgress

01matrix.py

@@ -1,27 +1,27 @@
-class Solution:
-     def updateMatrix(self, A: List[List[int]]) -> List[List[int]]:
-        def validNeighbours(i, j, d):
-            for dx, dy in (1, 0), (-1, 0), (0, 1), (0, -1):
-                ni, nj, dn = i + dx, j + dy, d + 1
-                if 0 <= ni < len(A) and 0 <= nj < len(A[0]):
-                    yield ni, nj, dn
-               
-        def bfs(i, j):
-            dist = collections.defaultdict(lambda: float('inf'))
-            queue = collections.deque([(i, j, 0)])
-            while queue:
-                i, j, d = queue.popleft()
-                if A[i][j] == 0:
-                    return d
-                for ni, nj, dn in validNeighbours(i, j, d):
-                    if dn < dist[(ni, nj)]:
-                        dist[(ni, nj)] = dn
-                        queue.append((ni, nj, dn))
-            return A[i][j]
-           
-       
-        for i in range(len(A)):
-            for j in range(len(A[0])):
-                if A[i][j] == 1:
-                    A[i][j] = bfs(i, j)    
+class Solution:
+     def updateMatrix(self, A: List[List[int]]) -> List[List[int]]:
+        def validNeighbours(i, j, d):
+            for dx, dy in (1, 0), (-1, 0), (0, 1), (0, -1):
+                ni, nj, dn = i + dx, j + dy, d + 1
+                if 0 <= ni < len(A) and 0 <= nj < len(A[0]):
+                    yield ni, nj, dn
+               
+        def bfs(i, j):
+            dist = collections.defaultdict(lambda: float('inf'))
+            queue = collections.deque([(i, j, 0)])
+            while queue:
+                i, j, d = queue.popleft()
+                if A[i][j] == 0:
+                    return d
+                for ni, nj, dn in validNeighbours(i, j, d):
+                    if dn < dist[(ni, nj)]:
+                        dist[(ni, nj)] = dn
+                        queue.append((ni, nj, dn))
+            return A[i][j]
+           
+       
+        for i in range(len(A)):
+            for j in range(len(A[0])):
+                if A[i][j] == 1:
+                    A[i][j] = bfs(i, j)    
         return A

23.intervalList.cpp

@@ -10,4 +10,4 @@ class Solution {
         }
         return res;
     }
-};
+};x

30-days-of-code-may/01.firstBadVersion.cpp

@@ -1,22 +1,22 @@
-// The API isBadVersion is defined for you.
-// bool isBadVersion(int version);
-
-class Solution {
-public:
-    int firstBadVersion(int n) {
-       
-        int start = 1, end = n, mid;
-        
-        while(start < end){
-            
-            mid = start + (end - start)/2;
-            if(isBadVersion(mid)){
-                end = mid;
-            }
-            else{
-                start = mid + 1;
-            }
-        }
-        return start;
-    }
+// The API isBadVersion is defined for you.
+// bool isBadVersion(int version);
+
+class Solution {
+public:
+    int firstBadVersion(int n) {
+       
+        int start = 1, end = n, mid;
+        
+        while(start < end){
+            
+            mid = start + (end - start)/2;
+            if(isBadVersion(mid)){
+                end = mid;
+            }
+            else{
+                start = mid + 1;
+            }
+        }
+        return start;
+    }
 };

30-days-of-code-may/02.jewelAndStones.cpp

@@ -1,22 +1,22 @@
-class Solution {
-public:
-    int numJewelsInStones(string J, string S) {
-        if(J.size() == 0 or S.size() == 0) return 0;
-        
-        map<char, int> stones;
-        
-        for(int i=0; i<S.size();i++){
-            if(stones.find(S[i]) == stones.end())
-                stones[S[i]] = 1;
-            else
-                stones[S[i]]++;
-        }
-        int c = 0;
-        for(char j:J){
-            if(stones.find(j) != stones.end()){
-                c+=stones[j];
-            }
-        }
-        return c;
-    }
+class Solution {
+public:
+    int numJewelsInStones(string J, string S) {
+        if(J.size() == 0 or S.size() == 0) return 0;
+        
+        map<char, int> stones;
+        
+        for(int i=0; i<S.size();i++){
+            if(stones.find(S[i]) == stones.end())
+                stones[S[i]] = 1;
+            else
+                stones[S[i]]++;
+        }
+        int c = 0;
+        for(char j:J){
+            if(stones.find(j) != stones.end()){
+                c+=stones[j];
+            }
+        }
+        return c;
+    }
 };

30-days-of-code-may/03.ransomNote.cpp

@@ -1,18 +1,18 @@
-
-class Solution {
-public:
-    bool canConstruct(string ransomNote, string magazine) {
-        
-        map<int,int> mp;
-        
-        for(char m : magazine)
-            mp[m-'a']++;
-        
-        for(char r : ransomNote){
-            if(--mp[r-'a'] < 0)
-                return false;
-            
-        }
-        return true;
-    }
+
+class Solution {
+public:
+    bool canConstruct(string ransomNote, string magazine) {
+        
+        map<int,int> mp;
+        
+        for(char m : magazine)
+            mp[m-'a']++;
+        
+        for(char r : ransomNote){
+            if(--mp[r-'a'] < 0)
+                return false;
+            
+        }
+        return true;
+    }
 };

30-days-of-code-may/04.numberComplement.cpp

@@ -1,42 +1,42 @@
-class Solution {
-public:
-    int findComplement(int num) {
-      
-        
-        if(num == 0) return 0;
-        vector<int> bits;
-        
-        while(num != 0){
-            bits.push_back(num % 2);    
-            num /= 2;
-        }
-        //for(auto i : bits)cout<<i<<" ";
-        //cout<<"\n";
-        
-        reverse(bits.begin(), bits.end());
-        
-        //for(auto i : bits)cout<<i<<" ";
-        vector<int> complement;
-        for(auto i : bits){
-            if(i == 0)
-                complement.push_back(1);
-            else
-                complement.push_back(0);
-        }
-        
-        //cout<<"\n";
-        //for(auto i : complement)cout<<i<<" ";
-        
-        int sz = complement.size()- 1;
-        unsigned int complement_no = 0;
-        for(int i=sz; i>=0; i--){
-            //cout<<"sz-i: "<<sz-i<<"\t";
-            int expr = (complement[i] * pow(2, (sz- i)));
-            //cout<<expr<<"\t\n";
-            complement_no += expr;
-        }
-        
-        //cout<<complement_no<<"\n";
-        return complement_no;
-    }
+class Solution {
+public:
+    int findComplement(int num) {
+      
+        
+        if(num == 0) return 0;
+        vector<int> bits;
+        
+        while(num != 0){
+            bits.push_back(num % 2);    
+            num /= 2;
+        }
+        //for(auto i : bits)cout<<i<<" ";
+        //cout<<"\n";
+        
+        reverse(bits.begin(), bits.end());
+        
+        //for(auto i : bits)cout<<i<<" ";
+        vector<int> complement;
+        for(auto i : bits){
+            if(i == 0)
+                complement.push_back(1);
+            else
+                complement.push_back(0);
+        }
+        
+        //cout<<"\n";
+        //for(auto i : complement)cout<<i<<" ";
+        
+        int sz = complement.size()- 1;
+        unsigned int complement_no = 0;
+        for(int i=sz; i>=0; i--){
+            //cout<<"sz-i: "<<sz-i<<"\t";
+            int expr = (complement[i] * pow(2, (sz- i)));
+            //cout<<expr<<"\t\n";
+            complement_no += expr;
+        }
+        
+        //cout<<complement_no<<"\n";
+        return complement_no;
+    }
 };

30-days-of-code-may/05.firstUniqueCharString.cpp

@@ -1,18 +1,18 @@
-class Solution {
-public:
-    int firstUniqChar(string s) {
-        
-        if(s.size() == 0) return -1;
-        
-        map<char, int> mp;
-        for(auto ch : s)
-            mp[ch]++;
-        
-        for(int i=0; i<s.size(); i++){
-                if(mp[s[i]] == 1){
-                    return i;
-                }
-        }
-        return -1;
-    }
+class Solution {
+public:
+    int firstUniqChar(string s) {
+        
+        if(s.size() == 0) return -1;
+        
+        map<char, int> mp;
+        for(auto ch : s)
+            mp[ch]++;
+        
+        for(int i=0; i<s.size(); i++){
+                if(mp[s[i]] == 1){
+                    return i;
+                }
+        }
+        return -1;
+    }
 };

30-days-of-code-may/06.majorityElement.cpp

@@ -1,18 +1,18 @@
-class Solution {
-public:
-    int majorityElement(vector<int>& nums) {
-        if(nums.size() == 0) return 0;
-
-        map<int, int> hash;
-        for(auto num : nums)
-            hash[num]++;
-        int sz = nums.size();
-        
-        for(auto const& p : hash){
-            if(p.second > sz/2){
-                return p.first;
-            }
-        }
-        return -1;
-    }
+class Solution {
+public:
+    int majorityElement(vector<int>& nums) {
+        if(nums.size() == 0) return 0;
+
+        map<int, int> hash;
+        for(auto num : nums)
+            hash[num]++;
+        int sz = nums.size();
+        
+        for(auto const& p : hash){
+            if(p.second > sz/2){
+                return p.first;
+            }
+        }
+        return -1;
+    }
 };