Merge branch 'master' of https://github.com/syhwawa/Coding_Daily_Practice

Author: syhwawa

HankerRank Practise/Interview_questions/Grid Game.md

@@ -0,0 +1,34 @@
+```Python
+class Solution:
+    def gridGame(self, grid, k, rules):
+        if not grid or grid == []: return grid
+        if len(grid) == 0 or len(grid[0]) == 0: return grid
+        rules = set(rules)
+        
+        for i in range(k):
+            grid = self.updateGrid(grid, rules)
+        
+        return grid
+    
+    def updateGrid(self, grid, rules):
+        m, n = len(grid), len(grid[0])
+        new_grid = [[0 for _ in range(n)] for _ in range(m)]
+        directions = [(1,0),(0,1),(-1,0),(0,-1),(-1,-1),(-1,1),(1,-1),(1,1)]
+        
+        for i in range(m):
+            for j in range(n):
+                count = 0
+                for di, dj in directions:
+                    if 0 <= i + di < m and 0 <= j + dj < n and grid[i+di][j+dj] == 1:
+                        count += 1
+                if count in rules: new_grid[i][j] = 1
+        
+        return new_grid
+
+s = Solution()
+grid = [[0,1,1,0], [1,1,0,0]]
+k = 2
+rules = [3,5]
+
+print(s.gridGame(grid, k, rules))
+```

HankerRank Practise/Interview_questions/String Compression.md

@@ -0,0 +1,36 @@
+Compression String
+Given an input string of a certain length, design an algorithm that compresses the string. 
+
+The string should be compressed such that consecutive duplicates of characters are replaced with the character and followed by the number of consecutive duplicates.
+
+For example, if the input string is “wwwwaaadexxxxxx”, then the function should return “w4a3dex6”.
+
+```Python
+
+def compress(string):
+
+    res = ""
+
+    count = 1
+
+    #Add in first character
+    res += string[0]
+
+    #Iterate through loop, skipping last one
+    for i in range(len(string)-1):
+        if(string[i] == string[i+1]):
+            count+=1
+        else:
+            if(count > 1):
+                #Ignore if no repeats
+                res += str(count)
+            res += string[i+1]
+            count = 1
+    #print last one
+    if(count > 1):
+        res += str(count)
+    return res
+
+compress('abaasass')
+```
+