Refactor directory names in the repo

Author: darpan-jain

Backtracking/combination_sum.py renamed to backtracking/combination_sum.py

@@ -5,11 +5,11 @@
 class Solution:
     def findMin(self, nums: List[int]) -> int:
         '''
-        Use the Binary Search, while looking for the minimum.
+        Use the binary_search, while looking for the minimum.
         Time Complexity: O(log n)
         '''
 
-        # Init two pointers to perform Binary Search
+        # Init two pointers to perform binary_search
         start, end = 0, len(nums) - 1
 
         # Init result to +infinity (since we are looking for minimum)

Backtracking/word_search.py renamed to backtracking/word_search.py

@@ -19,7 +19,7 @@ def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:
         # The reverse LL is being stored in the 'prev' pointer
         prev, curr = None, head
 
-        # Iterate until we reach the end of the Linked List
+        # Iterate until we reach the end of the linked_lists
         while curr:
             ''' We move prev -> curr (the reversal step) and move curr -> curr.next '''
 

Binary Search/min_in_rotated_array.py renamed to binary_search/min_in_rotated_array.py

@@ -36,7 +36,7 @@ def isSubtree(self, root: Optional[TreeNode], subRoot: Optional[TreeNode]) -> bo
 
 
     # Helper function to check if `p` and `q` are the same trees.
-    # Refer to https://leetcode.com/problems/same-tree/ and `Trees/same_tree.py`
+    # Refer to https://leetcode.com/problems/same-tree/ and `trees/same_tree.py`
     def isSameTree(self, p, q):
 
         if not p and not q:

Bit Manipulation/counting_bits.py renamed to bit_manipulation/counting_bits.py

@@ -9,7 +9,7 @@ class Solution:
     def twoSum(self, numbers: List[int], target: int) -> List[int]:
         '''
         Use two pointers and take advantage of the array being sorted. 
-        i.e. perform a Binary Search on the array.
+        i.e. perform a binary_search on the array.
 
         Time Complexity: O(n)
         '''