Add README

December/Multiply Strings/README.md

@@ -0,0 +1 @@
+[**Python Solution**](https://github.com/Pratul1997/LeetCode/tree/master/Source%20Code/43.%20Multiply%20Strings)

December/Palindrome Number/README.md

@@ -0,0 +1,3 @@
+[**C++ Solution**](https://github.com/moulikcipherX/LeetCode/tree/master/9.%20Palindrome%20Number)
+
+[**Python Solution**](https://github.com/Pratul1997/LeetCode/tree/master/Source%20Code/9.%20Palindrome%20Number)

December/Perfect Number/README.md

@@ -0,0 +1 @@
+

December/Reach A Number/README.md

@@ -0,0 +1,2 @@
+[**C++ Solution**](https://github.com/moulikcipherX/LeetCode/tree/master/754.%20Reach%20a%20Number)
+

December/Remove Element/README.md

@@ -0,0 +1 @@
+[**Python Solution**](https://github.com/Pratul1997/LeetCode/tree/master/Source%20Code/27.%20Remove%20Element)

December/Search Insert Position/README.md

@@ -0,0 +1 @@
+[**Python Solution**](https://github.com/Pratul1997/LeetCode/tree/master/Source%20Code/35.%20Search%20Insert%20Position)

December/Self Dividing Number/README.md

@@ -0,0 +1 @@
+[**C++ Solution**](https://github.com/moulikcipherX/LeetCode/tree/master/728.%20Self%20Dividing%20Numbers)

January/Contains Duplicate II/README.md

@@ -0,0 +1 @@
+[**Python Solution**](https://github.com/Pratul1997/LeetCode/tree/master/Source%20Code/219.%20Contains%20Duplicate%20II)

January/Contains Duplicate/README.md

@@ -0,0 +1,3 @@
+[**C++ Solution**](https://github.com/moulikcipherX/LeetCode/tree/master/217.%20Contains%20Duplicate)
+
+[**Python Solution**](https://github.com/Pratul1997/LeetCode/tree/master/Source%20Code/217.%20Contains%20Duplicate)

README.md

@@ -1 +1,33 @@
-# PyJaipur-Competitive-Division
+# PyJaipur-Competitive-Division
+
+<details>
+  <summary>December</summary>
+
+|     Date     |          Title                                                   | Solutions   |  Time     | Space   |
+|    :---:     |          :---                                                    |  :---:      |  :---:    | :---:   |
+||||||||
+|  26-12-2018     | [Palindrome Number](https://leetcode.com/problems/palindrome-number)             | [Solution](https://github.com/PyJaipur/PyJaipur-Competitive-Division/tree/master/December/Palindrome%20Number) | **O(1)** | **O(1)**
+||||||||
+|  26-12-2018     | [Multiply Strings](https://leetcode.com/problems/multiply-strings)  | [Solution](https://github.com/PyJaipur/PyJaipur-Competitive-Division/tree/master/December/Multiply%20Strings) | **O(1)** | **O(1)**
+||||||||
+|  27-12-2018     | [Remove Element](https://leetcode.com/problems/remove-element)             | [Solution](https://github.com/PyJaipur/PyJaipur-Competitive-Division/tree/master/December/Remove%20Element) | **O(n)** | **O(1)**
+||||||||
+|  28-12-2018     | [Search Insert Position](https://leetcode.com/problems/search-insert-position)             | [Solution](https://github.com/PyJaipur/PyJaipur-Competitive-Division/tree/master/December/Search%20Insert%20Position) | **O(n)** | **O(1)**
+||||||||
+|  29-12-2018     | [Perfect Number](https://leetcode.com/problems/perfect-number)             | [Solution](https://github.com/PyJaipur/PyJaipur-Competitive-Division/tree/master/December/Perfect%20Number) | **O(log n)** | **O(log n)** 
+||||||||
+|  30-12-2018     | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers)             | [Solution](https://github.com/PyJaipur/PyJaipur-Competitive-Division/tree/master/December/Self%20Dividing%20Number) | **O(nlog n)** | **O(n)**
+||||||||
+|  31-12-2018     | [Reach A Number](https://leetcode.com/problems/reach-a-number)             | [Solution](https://github.com/PyJaipur/PyJaipur-Competitive-Division/tree/master/December/Reach%20A%20Number) | **O(sqrt n)** | **O(1)**
+
+</details>
+
+<details>
+  <summary> January </summary>
+
+|     Date     |          Title                                                   | Solutions   |  Time     | Space   |
+|    :---:     |          :---                                                    |  :---:      |  :---:    | :---:   |
+||||||||
+|  01-01-2019     | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate)             | [Solution](https://github.com/PyJaipur/PyJaipur-Competitive-Division/tree/master/January/Contains%20Duplicate) | **O(n)** | **O(n)**
+||||||||
+|  02-01-2019     | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)             | [Solution](https://github.com/PyJaipur/PyJaipur-Competitive-Division/tree/master/January/Contains%20Duplicate%20II) | **O(n)** | **O(n)**