GitBook: [master] 2 pages modified

Author: just4once

README.md

@@ -1,10 +1,26 @@
 # README
 
-* To clone with username
-  * git clone [https://username@github.com/username/repository.git](https://username@github.com/username/repository.git)
-* To clone with username and password
-  * git clone [https://username:password@github.com/username/repository.git](https://username:password@github.com/username/repository.git)
-* To clone my repo
-  * git clone [https://github.com/just4once/leetcode.git](https://github.com/just4once/leetcode.git)
-* Next
+## Getting Super Powers
+
+To clone the repo
+
+```
+git clone https://github.com/just4once/leetcode.git
+```
+
+{% hint style="success" %}
+Success.
+{% endhint %}
+
+To clone the repo with username
+
+```
+git clone https://username@github.com/username/repository.git
+```
+
+To clone the repo with username and password
+
+```
+git clone https://username:password@github.com/username/repository.git
+```
 

leetcode/divide-and-conquer/169-majority-element.md

@@ -4,7 +4,23 @@
 
 [https://leetcode.com/problems/majority-element/description/](https://leetcode.com/problems/majority-element/description/)
 
-asd
+Given an array of size n, find the majority element. The majority element is the element that appears **more than** `⌊ n/2 ⌋` times.
+
+You may assume that the array is non-empty and the majority element always exist in the array.
+
+**Example 1:**
+
+```text
+Input: [3,2,3]
+Output: 3
+```
+
+**Example 2:**
+
+```text
+Input: [2,2,1,1,1,2,2]
+Output: 2
+```
 
 ## Thought Process {#thought-process}