Add some problems

Author: arshad115

17-distribute-candies-to-people.py

@@ -0,0 +1,28 @@
+# -------------------------------------------------------
+# Distribute Candies to People - https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/551/week-3-august-15th-august-21st/3427/
+# -------------------------------------------------------
+# Author: Arshad Mehmood
+# Github: https://github.com/arshad115
+# Blog: https://arshadmehmood.com
+# LinkedIn: https://www.linkedin.com/in/arshadmehmood115
+# Date : 2020-08-17
+# Project: leetcode-august-2020
+# -------------------------------------------------------
+from typing import List
+
+
+class Solution:
+    def distributeCandies(self, candies: int, num_people: int) -> List[int]:
+        people = [0]*num_people
+        i = 0
+        while candies>0:
+            people[i % num_people] += min(i + 1,candies)
+            i += 1
+            candies -= i
+        return people
+
+
+
+solution = Solution()
+result = solution.distributeCandies(10, 3)
+print(result)

18-numbers-with-same-consecutive-differences.py

@@ -0,0 +1,36 @@
+# -------------------------------------------------------
+# Numbers With Same Consecutive Differences - https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/551/week-3-august-15th-august-21st/3428/
+# -------------------------------------------------------
+# Author: Arshad Mehmood
+# Github: https://github.com/arshad115
+# Blog: https://arshadmehmood.com
+# LinkedIn: https://www.linkedin.com/in/arshadmehmood115
+# Date : 2020-08-18
+# Project: leetcode-august-2020
+# -------------------------------------------------------
+from typing import List
+
+class Solution:
+    def numsSameConsecDiff(self, N: int, K: int) -> List[int]:
+        numbers = list(range(10))
+        if N == 1:
+            return numbers
+
+        for i in range(1,N):
+            numset = set()
+            for n in numbers:
+                num = n % 10
+                minusK = num - K
+                plusK = num + K
+
+                if n>0 and plusK < 10:
+                    numset.add(n*10 + plusK)
+                if n > 0 and minusK >= 0:
+                    numset.add(n * 10 + minusK)
+
+            numbers = numset
+        return list(numbers)
+
+solution = Solution()
+result = solution.numsSameConsecDiff(2, 1)
+print(result)

8-path-sum-iii.py

@@ -0,0 +1,49 @@
+# -------------------------------------------------------
+# Path Sum III - https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/549/week-1-august-1st-august-7th/3415/
+# -------------------------------------------------------
+# Author: Arshad Mehmood
+# Github: https://github.com/arshad115
+# Blog: https://arshadmehmood.com
+# LinkedIn: https://www.linkedin.com/in/arshadmehmood115
+# Date : 2020-08-8
+# Project: leetcode-august-2020
+# -------------------------------------------------------
+# Definition for a binary tree node.
+import collections
+
+
+class TreeNode:
+    def __init__(self, val=0, left=None, right=None):
+        self.val = val
+        self.left = left
+        self.right = right
+
+class Solution(object):
+    def pathSum(self, root, sum):
+        def dfs(sumHash, prefixSum, node):
+            if not node:
+                return 0
+
+            # Sum of current path
+            prefixSum += node.val
+
+            # number of paths that ends at current node
+            path = sumHash[prefixSum - sum]
+
+            # add currentSum to prefixSum Hash
+            sumHash[prefixSum] += 1
+
+            # traverse left and right of tree
+            path += dfs(sumHash, prefixSum, node.left) + dfs(sumHash, prefixSum, node.right)
+
+            # remove currentSum from prefixSum Hash
+            sumHash[prefixSum] -= 1
+
+            return path
+
+        # depth first search, initialize sumHash with prefix sum of 0, occurring once
+        return dfs(collections.defaultdict(int, {0: 1}), 0, root)
+
+solution = Solution()
+result = solution.pathSum([10,5,-3,3,2,None,11,3,-2,None,1],8)
+print(result)

README.md

@@ -12,3 +12,6 @@ My leetcode profile can be viewed [here](https://leetcode.com/arshad115/)
 | 4    | [Power of Four](./codes/4-valid-palindrome.py) |
 | 5    | [Add and Search Word - Data structure design](./codes/5-add-and-search-word-data-structure-design.py) |
 | 6    | [Find All Duplicates in an Array](./codes/6-find-all-duplicates-in-an-array.py) |
+| 8    | [Path Sum III](./codes/8-path-sum-iii.py) |
+| 17    | [Distribute Candies to People](./codes/17-distribute-candies-to-people.py) |
+| 18    | [Numbers With Same Consecutive Differences](./codes/18-numbers-with-same-consecutive-differences.py) |