Create codespell.yml (#1698)

* fixup! Format Python code with psf/black push

* Create codespell.yml

* fixup! Format Python code with psf/black push

dynamic_programming/bitmask.py

@@ -42,7 +42,7 @@ class AssignmentUsingBitmask:
         if self.dp[mask][taskno] != -1:
             return self.dp[mask][taskno]
 
-        # Number of ways when we dont this task in the arrangement
+        # Number of ways when we don't this task in the arrangement
         total_ways_util = self.CountWaysUtil(mask, taskno + 1)
 
         # now assign the tasks one by one to all possible persons and recursively assign for the remaining tasks.

dynamic_programming/knapsack.py

@@ -49,9 +49,9 @@ def knapsack_with_example_solution(W: int, wt: list, val: list):
 
     W: int, the total maximum weight for the given knapsack problem.
     wt: list, the vector of weights for all items where wt[i] is the weight
-    of the ith item.
+    of the i-th item.
     val: list, the vector of values for all items where val[i] is the value
-    of te ith item
+    of the i-th item
 
     Returns
     -------

dynamic_programming/longest_sub_array.py

@@ -1,5 +1,5 @@
 """
-Auther  : Yvonne
+Author  : Yvonne
 
 This is a pure Python implementation of Dynamic Programming solution to the longest_sub_array problem.
 

dynamic_programming/subset_generation.py

@@ -1,10 +1,10 @@
-# python program to print all subset combination of n element in given set of r element .
+# Python program to print all subset combinations of n element in given set of r element.
 # arr[]  ---> Input Array
 # data[] ---> Temporary array to store current combination
 # start & end ---> Staring and Ending indexes in arr[]
 # index  ---> Current index in data[]
 # r ---> Size of a combination to be printed
-def combinationUtil(arr, n, r, index, data, i):
+def combination_util(arr, n, r, index, data, i):
     # Current combination is ready to be printed,
     # print it
     if index == r:
@@ -15,29 +15,26 @@ def combinationUtil(arr, n, r, index, data, i):
     #  When no more elements are there to put in data[]
     if i >= n:
         return
-    # current is included, put next at next
-    # location
+    # current is included, put next at next location
     data[index] = arr[i]
-    combinationUtil(arr, n, r, index + 1, data, i + 1)
+    combination_util(arr, n, r, index + 1, data, i + 1)
     # current is excluded, replace it with
     # next (Note that i+1 is passed, but
     # index is not changed)
-    combinationUtil(arr, n, r, index, data, i + 1)
+    combination_util(arr, n, r, index, data, i + 1)
     # The main function that prints all combinations
     # of size r in arr[] of size n. This function
     # mainly uses combinationUtil()
 
 
-def printcombination(arr, n, r):
-    # A temporary array to store all combination
-    # one by one
+def print_combination(arr, n, r):
+    # A temporary array to store all combination one by one
     data = [0] * r
-    # Print all combination using temprary
-    # array 'data[]'
-    combinationUtil(arr, n, r, 0, data, 0)
+    # Print all combination using temporary array 'data[]'
+    combination_util(arr, n, r, 0, data, 0)
 
 
 # Driver function to check for above function
 arr = [10, 20, 30, 40, 50]
-printcombination(arr, len(arr), 3)
+print_combination(arr, len(arr), 3)
 # This code is contributed by Ambuj sahu