Algorithms added

Author: ramanaditya

README.md

@@ -27,7 +27,7 @@ Follow the link [https://interview-docs.readthedocs.io](https://interview-docs.r
 ### Gitter Community
 All the discussions related to the **Interview** and **Data Structures and Algorithms** are discussed on the Gitter Community Channel.
 
-Follow the link [https://gitter.im/data-structure-and-algorithms/community](https://gitter.im/data-structure-and-algorithms/community) or click the Gitter Logo below to join the community
+Follow the link [https://gitter.im/data-structure-and-algorithms/community](https://gitter.im/data-structure-and-algorithms/community) or click the Gitter Logo on the left to join the community
 
 <br>
 <hr>
@@ -116,9 +116,11 @@ Follow the link [https://gitter.im/data-structure-and-algorithms/community](http
 
 ## Issues
 [![GitHub issues](https://img.shields.io/github/issues/ramanaditya/data-structure-and-algorithms?logo=github)](https://github.com/ramanaditya/data-structure-and-algorithms/issues)
-[![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg?style=flat&logo=git&logoColor=white)](https://github.com/ramanaditya/data-structure-and-algorithms/pulls)
 [![GitHub last commit](https://img.shields.io/github/last-commit/ramanaditya/data-structure-and-algorithms?logo=github)](https://github.com/ramanaditya/data-structure-and-algorithms/)
 
+[![GitHub pull requests](https://img.shields.io/github/issues-pr-raw/ramanaditya/data-structure-and-algorithms?logo=git&logoColor=white)](https://github.com/ramanaditya/data-structure-and-algorithms/compare)
+[![GitHub pull requests](https://img.shields.io/github/issues-pr-closed-raw/ramanaditya/data-structure-and-algorithms?logo=git&logoColor=white)](https://github.com/ramanaditya/data-structure-and-algorithms/pulls?q=is%3Apr+is%3Aclosed)
+
 > 1. Graph Algorithm
 > 2. Solutions of CLRS
 > 3. String Algorithms
@@ -130,10 +132,7 @@ Follow the link [https://gitter.im/data-structure-and-algorithms/community](http
 [![GitHub code size in bytes](https://img.shields.io/github/languages/code-size/ramanaditya/data-structure-and-algorithms?logo=github)](https://github.com/ramanaditya/data-structure-and-algorithms/) 
 [![GitHub commit activity](https://img.shields.io/github/commit-activity/m/ramanaditya/data-structure-and-algorithms?color=blue&logo=github)](https://github.com/ramanaditya/data-structure-and-algorithms/commits/) 
 [![GitHub repo size](https://img.shields.io/github/repo-size/ramanaditya/data-structure-and-algorithms?logo=github)](https://github.com/ramanaditya/data-structure-and-algorithms/)
-
-[![GitHub pull requests](https://img.shields.io/github/issues-pr-raw/ramanaditya/data-structure-and-algorithms?logo=git&logoColor=white)](https://github.com/ramanaditya/data-structure-and-algorithms/compare)
-[![GitHub pull requests](https://img.shields.io/github/issues-pr-closed-raw/ramanaditya/data-structure-and-algorithms?logo=git&logoColor=white)](https://github.com/ramanaditya/data-structure-and-algorithms/pulls?q=is%3Apr+is%3Aclosed)
-[![GitHub contributors](https://img.shields.io/github/contributors/ramanaditya/data-structure-and-algorithms?logo=github)](https://github.com/ramanaditya/data-structure-and-algorithms/graphs/contributors)
+[![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg?style=flat&logo=git&logoColor=white)](https://github.com/ramanaditya/data-structure-and-algorithms/pulls)
 
 - Write clear meaningful git commit messages (Do read [this](http://chris.beams.io/posts/git-commit/)).
 
@@ -152,6 +151,8 @@ Follow the link [https://gitter.im/data-structure-and-algorithms/community](http
 - Refer [this](https://github.com/ramanaditya/data-structure-and-algorithms/blob/master/CONTRIBUTING.md) for more.
 
 ## Contributor
+[![GitHub contributors](https://img.shields.io/github/contributors/ramanaditya/data-structure-and-algorithms?logo=github)](https://github.com/ramanaditya/data-structure-and-algorithms/graphs/contributors)
+
 [![](https://sourcerer.io/fame/ramanaditya/ramanaditya/data-structure-and-algorithms/images/0)](https://sourcerer.io/fame/ramanaditya/ramanaditya/data-structure-and-algorithms/links/0)
 [![](https://sourcerer.io/fame/ramanaditya/ramanaditya/data-structure-and-algorithms/images/1)](https://sourcerer.io/fame/ramanaditya/ramanaditya/data-structure-and-algorithms/links/1)
 [![](https://sourcerer.io/fame/ramanaditya/ramanaditya/data-structure-and-algorithms/images/2)](https://sourcerer.io/fame/ramanaditya/ramanaditya/data-structure-and-algorithms/links/2)

docs/build/doctrees/algorithms/array.doctree

@@ -0,0 +1,67 @@
+Array
+======
+
+Boyer–Moore majority vote algorithm
+------------------------------------
+
+Reference : `wiki <https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_majority_vote_algorithm>`__
+
+Description
+````````````
+
+To find the majority element from the sequence, majority means the element should be present more than n/2
+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.
+
+.. code-block:: text
+
+    Linear TIme
+    Constant Space
+
+Python
+````````
+.. code-block:: python
+
+    def boyer_moore_voting_algorithm(arr: list) -> int:
+        """
+        :param arr: list
+        :return: int
+        """
+        res = arr[0]  # Initialization
+        counter = 0  # Counter
+
+        for i in range(len(arr)):
+            if counter == 0:
+                res = arr[i]
+                counter = 1
+            elif res == arr[i]:
+                counter += 1
+            else:
+                counter -= 1
+
+        return res
+
+Implementation
+````````````````
+.. role:: green
+.. role:: orange
+.. role:: red
+
+
+.. list-table:: LeetCode
+   :header-rows: 1
+   :widths: 5, 5, 15, 15, 10
+
+   * - Sl No
+     - Level
+     - Questions
+     - Solutions
+     - Tags
+
+   * - 169
+     - :green:`Easy`
+     - `Majority Element <https://leetcode.com/problems/majority-element/>`__
+     - `Python <https://github.com/ramanaditya/data-structure-and-algorithms/blob/master/leetcode/array/majority-element.py>`__
+     -

docs/build/doctrees/environment.pickle

@@ -13,6 +13,12 @@ Welcome to Interview Documentation!
    data-structures/list
    data-structures/linked-list
 
+.. toctree::
+   :maxdepth: 2
+   :caption: Algorithms
+
+   algorithms/array
+
 .. toctree::
    :maxdepth: 2
    :caption: Resources