Convert the camelCase to snake_case

Author: mingrammer

map/longest_common_subsequence.py

@@ -1,28 +1,28 @@
 """
 Given string a and b, with b containing all distinct characters,
-find the longest common subsequence's 
+find the longest common subsequence's
 
 length. Expected complexity O(nlogn).
 """
 
 
-def maxCommonSubString(S1,S2):
-    ##Assuming S2 has all unique chars
-    S2Dic = {S2[i]:i for i in xrange(len(S2))}
-    maxR = 0
-    subS = ''
+def max_common_sub_string(s1, s2):
+    # Assuming s2 has all unique chars
+    s2dic = {s2[i]: i for i in xrange(len(s2))}
+    maxr = 0
+    subs = ''
     i = 0
-    while i < len(S1):
-        if S1[i] in S2Dic:
-            j = S2Dic[S1[i]]
+    while i < len(s1):
+        if s1[i] in s2dic:
+            j = s2dic[s1[i]]
             k = i
-            while j < len(S2) and k < len(S1) and S1[k] == S2[j]:
+            while j < len(s2) and k < len(s1) and s1[k] == s2[j]:
                 k += 1
                 j += 1
-            if k - i > maxR:
-               maxR = k-i
-               subS = S1[i:k]
+            if k - i > maxr:
+                maxr = k-i
+                subs = s1[i:k]
             i = k
         else:
             i += 1
-    return subS
+    return subs

map/valid_sudoku.py

@@ -5,7 +5,7 @@
 the character '.'.
 """
 
-def isValidSudoku(self, board):
+def is_valid_sudoku(self, board):
     seen = []
     for i, row in enumerate(board):
         for j, c in enumerate(row):