Modified

Author: ramanaditya

algorithms/array/boyer-moore-majority-vote-algorithm.md

@@ -3,7 +3,7 @@
 
 ## Description 
 To find the majority element from the sequence, majority means the element should be present more than n/2
-times the total length of the sequence.
+times the total length, n,  of the sequence.
 
 If the no such element occurs, then algorithm can return any arbitrary element, that is not guaranteed that this element
 will be the mode or occurred maximum number of times.

codechef/README.md

@@ -34,5 +34,4 @@
     | :---: | :--- | :--- |
     | 1. | [Counting Pretty Numbers](https://www.codechef.com/problems/NUM239) | [Python](https://github.com/ramanaditya/data-structure-and-algorithms/blob/master/codechef/easy/counting-pretty-numbers.py) |
     | 2. | [Processing a string](https://www.codechef.com/problems/KOL15A) | [Python](https://github.com/ramanaditya/data-structure-and-algorithms/blob/master/codechef/easy/processing-a-string.py/) |
-    
-![](../images/comp.jpeg)
+    

interview/networking.md

@@ -19,6 +19,10 @@ Networking is interacting with others to exchange information and develop profes
         - Be appreciative
         - Note next steps
     - Medium Connections
+    - Low Connections
+    - Targeting Specific Employers: Reach out to the employees of your target companies.
+    - How to Contact: Don't spam out for messages just for networking favour.
+    - Following Up: Thank them for even their smallest help. Thank them when you get a job.
 
 
 

leetcode/array/available-captures-for-rook.py

@@ -1,4 +1,4 @@
-'''
+"""
 ## Question
 ### 999. [Available Captures for Rook](https://leetcode.com/problems/available-captures-for-rook/)
 On an 8 x 8 chessboard, there is one white rook.  There also may be empty squares, white bishops, and black pawns.  These are given as characters 'R', '.', 'B', and 'p' respectively. Uppercase characters represent white pieces, and lowercase characters represent black pieces.
@@ -29,10 +29,11 @@
 - board.length == board[i].length == 8
 - board[i][j] is either 'R', '.', 'B', or 'p'
 - There is exactly one cell with board[i][j] == 'R'
-'''
+"""
 
 ## Solutions
 
+
 class Solution:
     def numRookCaptures(self, board: List[List[str]]) -> int:
         if not board:
@@ -48,38 +49,39 @@ def numRookCaptures(self, board: List[List[str]]) -> int:
         count = 0
         i -= 1
         while i >= 0:
-            if board[i][n] == 'p':
+            if board[i][n] == "p":
                 count += 1
                 break
-            elif board[i][n] == 'B':
+            elif board[i][n] == "B":
                 break
             i -= 1
-        i = m+1
+        i = m + 1
         while i < len(board[0]):
-            if board[i][n] == 'p':
+            if board[i][n] == "p":
                 count += 1
                 break
-            elif board[i][n] == 'B':
+            elif board[i][n] == "B":
                 break
             i += 1
         j -= 1
         while j >= 0:
-            if board[m][j] == 'p':
+            if board[m][j] == "p":
                 count += 1
                 break
-            elif board[m][j] == 'B':
+            elif board[m][j] == "B":
                 break
             j -= 1
         j = n + 1
         while j < len(board):
-            if board[m][j] == 'p':
+            if board[m][j] == "p":
                 count += 1
                 break
-            elif board[m][j] == 'B':
+            elif board[m][j] == "B":
                 break
             j += 1
-            
+
         return count
 
+
 # Runtime: 36 ms
 # Memory Usage: 13.9 MB