Fix flake8 errors

Author: Iqrar99

project_euler/problem_49/sol1.py

@@ -1,3 +1,6 @@
+from itertools import permutations
+from math import floor, sqrt
+
 """
 Prime permutations
 
@@ -26,9 +29,6 @@
 3 nested loops since we know the answer will be 12 digits.
 """
 
-from itertools import permutations
-from math import floor, sqrt
-
 
 def is_prime(number: int) -> bool:
     """
@@ -60,15 +60,15 @@ def search(target: int, prime_list: list) -> bool:
     False
     """
 
-    l, r = 0, len(prime_list) - 1
-    while l <= r:
-        m = (l + r) // 2
+    left, right = 0, len(prime_list) - 1
+    while left <= right:
+        m = (left + right) // 2
         if prime_list[m] == target:
             return True
         elif prime_list[m] < target:
-            l = m + 1
+            left = m + 1
         else:
-            r = m - 1
+            right = m - 1
 
     return False
 

project_euler/problem_50/sol1.py

@@ -1,3 +1,5 @@
+from math import floor, sqrt
+
 """
 Consecutive prime sum
 
@@ -25,8 +27,6 @@
 Then, use sliding window to get the answer.
 """
 
-from math import floor, sqrt
-
 
 def is_prime(number: int) -> bool:
     """