Fix white space problems

Author: raul-sauco

algoexpert/merge-sorted-arrays.py

@@ -58,8 +58,8 @@ def test():
             ],
             # fmt: off
             [
-                -92, -78, -76, -74, -68, -66, -62, -49, -46, -40, -26, -23, 
-                -16, -8, 12, 20, 21, 28, 33, 33, 36, 38, 42, 43, 46, 46, 48, 
+                -92, -78, -76, -74, -68, -66, -62, -49, -46, -40, -26, -23,
+                -16, -8, 12, 20, 21, 28, 33, 33, 36, 38, 42, 43, 46, 46, 48,
                 50, 55, 79, 79, 81, 94
             ],
             # fmt: on
@@ -77,9 +77,9 @@ def test():
                 [-57, -43, -41, -18, -5, 74],
             ],
             # fmt: off
-            [ 
-                -100, -93, -83, -83, -82, -57, -51, -43, -43, -41, -33, -33, 
-                -32, -32, -29, -18, -16, -15, -14, -11, -5, 0, 12, 23, 29, 
+            [
+                -100, -93, -83, -83, -82, -57, -51, -43, -43, -41, -33, -33,
+                -32, -32, -29, -18, -16, -15, -14, -11, -5, 0, 12, 23, 29,
                 29, 40, 43, 50, 60, 70, 74, 76, 78, 80, 80,
             ],
             # fmt: on

hackerrank/Java-priority-queue.java

@@ -6,8 +6,8 @@
 import java.util.ArrayList;
 import java.util.List;
 import java.util.Scanner;
-// import Priority Queue Collection Framework 
-import java.util.*; 
+// import Priority Queue Collection Framework
+import java.util.*;
 /*
  * Create the Student and Priorities classes here.
  */
@@ -76,18 +76,18 @@ public ArrayList<Student> getStudents(List<String> events)
 public class Solution {
     private final static Scanner scan = new Scanner(System.in);
     private final static Priorities priorities = new Priorities();
-    
+
     public static void main(String[] args) {
-        int totalEvents = Integer.parseInt(scan.nextLine());    
+        int totalEvents = Integer.parseInt(scan.nextLine());
         List<String> events = new ArrayList<>();
-        
+
         while (totalEvents-- != 0) {
             String event = scan.nextLine();
             events.add(event);
         }
-        
+
         List<Student> students = priorities.getStudents(events);
-        
+
         if (students.isEmpty()) {
             System.out.println("EMPTY");
         } else {

hackerrank/find-runner-up-score.py

@@ -6,14 +6,14 @@
 # Tags: Array
 
 n = int(input())
-i=0
-#takes input, splits it and then convert it into integer
-arr = list(map(int, input().split()))  
+i = 0
+# takes input, splits it and then convert it into integer
+arr = list(map(int, input().split()))
 zes = max(arr)
 
-while(i<n):
+while i < n:
     if zes == max(arr):
         arr.remove(max(arr))
-    i+=1
+    i += 1
 
 print(max(arr))

hackerrank/merge-tools.py

@@ -3,21 +3,22 @@
 # https://www.hackerrank.com/challenges/merge-the-tools/problem?isFullScreen=true
 # tags : String
 
+
 def merge_the_tools(string, k):
     l = []
     out = []
-    for i in range (0, len(string), k):
+    for i in range(0, len(string), k):
         c = ""
         for j in range(k):
             c += string[i + j]
         l.append(c)
-    
+
     for elm in l:
-        c= ""
+        c = ""
         for j in range(k):
             if elm[j] not in c:
                 c += elm[j]
         out.append(c)
-        
+
     for res in out:
         print(res)

hackerrank/phone-book.java

@@ -25,7 +25,7 @@ public static void main(String[] args) {
 			HashMap<String, Integer> phoneBook = new HashMap<String, Integer>();
 			BufferedReader b = new BufferedReader(new InputStreamReader(
 					System.in));
-			no_of_entries = Integer.parseInt(b.readLine());			
+			no_of_entries = Integer.parseInt(b.readLine());
 			while (i < no_of_entries) {
 				name = b.readLine();
 				number = Integer.parseInt(b.readLine());
@@ -39,7 +39,7 @@ public static void main(String[] args) {
 					System.out.println("Not found");
 			}
 		} catch (Exception e) {
-			
+
 		}
     }
 }

leetcode/classes-more-than-5-students.sql

@@ -5,7 +5,7 @@
  * https://leetcode.com/problems/classes-more-than-5-students/
  *
  * Tags: Database
- * 
+ *
  * Group the students' records by class, return the class names for classes
  * that have 5 students or more.
  */

leetcode/data-stream-as-disjoint-intervals.rs

@@ -12,22 +12,22 @@ struct SummaryRanges {
 }
 
 
-/** 
+/**
  * `&self` means the method takes an immutable reference.
  * If you need a mutable reference, change it to `&mut self` instead.
  */
 impl SummaryRanges {
 
     fn new() -> Self {
-        
+
     }
-    
+
     fn add_num(&self, value: i32) {
-        
+
     }
-    
+
     fn get_intervals(&self) -> Vec<Vec<i32>> {
-        
+
     }
 }
 
@@ -36,4 +36,4 @@ impl SummaryRanges {
  * let obj = SummaryRanges::new();
  * obj.add_num(value);
  * let ret_2: Vec<Vec<i32>> = obj.get_intervals();
- */
+ */

leetcode/divide-two-integers.py

@@ -1,81 +1,81 @@
+# 29. Divide Two Integers
+# 🟠 Medium
+#
 # https://leetcode.com/problems/divide-two-integers/
+#
+# Tags: Math - Bit Manipulation
 
-min_allowed = -2147483648
-max_allowed = 2147483647
+import timeit
 
-def to_binary_list(int_base_10):
-    #convert an int base 10 to a list of 0's and 1's
-    return [int(x) for x in bin(int_base_10)[2:]]
 
+# This solution is based on the fact that the quotient of a division is
+# equal to the number of times the divisor goes into the dividend.
+# We can use bitwise operations to get the quotient.
+#
+# Time complexity: O(log2(n)) - In each iteration we divide the initial
+# dividend by 2.
+# Space complexity: O(1) - We only store integer values.
+#
+# Runtime 50 ms Beats 9.81%
+# Memory 16.4 MB Beats 11.94%
 class Solution:
-    # This solution is based on the fact that the quotient of a division is equal to the number
-    # of times the divisor goes into the dividend. 
-    # We can use bitwise operations to get the quotient.
     def divide(self, dividend: int, divisor: int) -> int:
-        param_dividend = dividend
-        param_divisor = divisor
-
         # Determine if the result will be negative
-        negative = (dividend > 0 and divisor < 0) or (dividend < 0 and divisor > 0)
-        
+        negative = (dividend > 0 and divisor < 0) or (
+            dividend < 0 and divisor > 0
+        )
         # The problem has a constraint of -2147483648 to 2147483647
-        upper_bound = 1 << 31 if negative else (1 << 31) -1
-        
+        upper_bound = 1 << 31 if negative else (1 << 31) - 1
         # Equivalent to using abs()
         dividend = 0 - dividend if dividend < 0 else dividend
         divisor = 0 - divisor if divisor < 0 else divisor
-        
         # Convert the dividend to a binary list
         dividend = [int(x) for x in bin(dividend)[2:]]
-        
         current_dividend = 0
         result = 0
-
-        print(f'\n» Dividing {param_dividend} by {param_divisor}\n')
         for next_digit in dividend:
             current_dividend = (current_dividend << 1) + next_digit
-
-            if(divisor <= current_dividend):
+            if divisor <= current_dividend:
                 current_dividend -= divisor
                 new_digit = 1
             else:
                 new_digit = 0
-            
             result = (result << 1) + new_digit
-            print(f'current dividend: {current_dividend}; result: {result}; new digit: {new_digit}')
-        
         result = min(result, upper_bound)
-        if(negative):
+        if negative:
             result = 0 - result
-
-        print(f'\n» The result of {param_dividend} / {param_divisor} is {result}\n')
-        
         return result
 
-        
-    def divide_slow(self, dividend: int, divisor: int) -> int:
-        sign = -1 if ((dividend < 0) ^ (divisor < 0)) else 1
-        dividend = abs(dividend)
-        divisor = abs(divisor)
-        quotient = 0
-        while dividend >= divisor:
-            dividend -= divisor
-            quotient += 1
-        return quotient * sign
 
-def test(): 
-    sol = Solution()
-    assert sol.divide(10, 3) == 3
-    assert sol.divide(7, -3) == -2
-    assert sol.divide(1, 1) == 1
-    assert sol.divide(0, 1) == 0
-    assert sol.divide(min_allowed, -1) == max_allowed
-    assert sol.divide(1 << 31, 1) == max_allowed
-    assert sol.divide(1 << 31, -17) == -126322567
-    print('All tests passed!')
+def test():
+    MIN_ALLOWED = -2147483648
+    MAX_ALLOWED = 2147483647
+    executors = [Solution]
+    tests = [
+        [1, 1, 1],
+        [0, 1, 0],
+        [10, 3, 3],
+        [7, -3, -2],
+        [1 << 31, 1, MAX_ALLOWED],
+        [1 << 31, -17, -126322567],
+        [MIN_ALLOWED, -1, MAX_ALLOWED],
+    ]
+    for executor in executors:
+        start = timeit.default_timer()
+        for _ in range(1):
+            for col, t in enumerate(tests):
+                sol = executor()
+                result = sol.divide(t[0], t[1])
+                exp = t[2]
+                assert result == exp, (
+                    f"\033[93m» {result} <> {exp}\033[91m for"
+                    + f" test {col} using \033[1m{executor.__name__}"
+                )
+        stop = timeit.default_timer()
+        used = str(round(stop - start, 5))
+        cols = "{0:20}{1:10}{2:10}"
+        res = cols.format(executor.__name__, used, "seconds")
+        print(f"\033[92m» {res}\033[0m")
 
-test()
 
-# Uncomment the following lines to see print statements
-# sol=Solution()
-# sol.divide(1 << 31, 17)
+test()

leetcode/lists/.gitignore

@@ -1,2 +1,2 @@
 # Ignore temporary files
-tmp*
+tmp*