Kristian-Roopnarine
diff --git a/‎algorithms/dynamic_programming/bit_masking1.py‎
Lines changed: 6 additions & 6 deletions b/‎algorithms/dynamic_programming/bit_masking1.py‎
Lines changed: 6 additions & 6 deletions
diff --git a/‎algorithms/dynamic_programming/k_palindrome1.py‎
Lines changed: 6 additions & 6 deletions b/‎algorithms/dynamic_programming/k_palindrome1.py‎
Lines changed: 6 additions & 6 deletions
@@ -25,7 +25,7 @@ def __init__(self):
         self.caps = defaultdict(list)
 
     #  Mask is the set of persons, i is the current cap number.
-    def countWaysUtil(self, dp, mask, cap_no):
+    def count_ways_util(self, dp, mask, cap_no):
 
         # If all persons are wearing a cap so we
         # are done and this is one way so return 1
@@ -43,7 +43,7 @@ def countWaysUtil(self, dp, mask, cap_no):
 
         # Ways, when we don't include this cap in our arrangement
         # or solution set
-        ways = self.countWaysUtil(dp, mask, cap_no + 1)
+        ways = self.count_ways_util(dp, mask, cap_no + 1)
 
         # assign ith cap one by one  to all the possible persons
         # and recur for remaining caps.
@@ -57,7 +57,7 @@ def countWaysUtil(self, dp, mask, cap_no):
 
                 # Else assign him this cap and recur for remaining caps with
                 # new updated mask vector
-                ways += self.countWaysUtil(dp, mask | (1 << ppl), cap_no + 1)
+                ways += self.count_ways_util(dp, mask | (1 << ppl), cap_no + 1)
 
                 ways = ways % (10**9 + 7)
 
@@ -66,7 +66,7 @@ def countWaysUtil(self, dp, mask, cap_no):
 
         return dp[mask][cap_no]
 
-    def countWays(self, N):
+    def count_ways(self, N):
 
         # Reads n lines from standard input for current test case
         # create dictionary for cap. cap[i] = list of person having
@@ -88,12 +88,12 @@ def countWays(self, N):
 
         # Call recursive function countWaysUtil
         # result will be in dp[0][1]
-        print(self.countWaysUtil(dp, 0, 1,))
+        print(self.count_ways_util(dp, 0, 1,))
 
 # Driver Program
 
 
 def main():
     No_of_people = int(input())  # number of persons in every test case
 
-    AssignCap().countWays(No_of_people)
+    AssignCap().count_ways(No_of_people)
@@ -19,7 +19,7 @@
 # is K-Palindrome or not
 
 
-def isKPalRec(str1, str2, m, n):
+def is_kpalrec(str1, str2, m, n):
 
     # If first string is empty,
     # the only option is to remove
@@ -43,23 +43,23 @@ def isKPalRec(str1, str2, m, n):
     # 1. Remove last char from str1 and recur for m-1 and n
     # 2. Remove last char from str2 and recur for m and n-1
     # Take minimum of above two operations
-    res = 1 + min(isKPalRec(str1, str2, m - 1, n),  # Remove from str1
-                  (isKPalRec(str1, str2, m, n - 1)))  # Remove from str2
+    res = 1 + min(is_kpalrec(str1, str2, m - 1, n),  # Remove from str1
+                  (is_kpalrec(str1, str2, m, n - 1)))  # Remove from str2
 
     return res
 
 # Returns true if str is k palindrome.
 
 
-def isKPal(string, k):
+def is_kPal(string, k):
     revStr = string[::-1]
     l = len(string)
 
-    return (isKPalRec(string, revStr, l, l) <= k * 2)
+    return (is_kpalrec(string, revStr, l, l) <= k * 2)
 
 
 # Driver program
 string = "acdcb"
 k = 2
 
-print("Yes" if isKPal(string, k) else "No")
+print("Yes" if is_kPal(string, k) else "No")