diff --git a/December/Multiply Strings/README.md b/December/Multiply Strings/README.md new file mode 100644 index 0000000..c25d87b --- /dev/null +++ b/December/Multiply Strings/README.md @@ -0,0 +1 @@ +[**Python Solution**](https://github.com/Pratul1997/LeetCode/tree/master/Source%20Code/43.%20Multiply%20Strings) diff --git a/December/Palindrome Number/README.md b/December/Palindrome Number/README.md new file mode 100644 index 0000000..827d6b8 --- /dev/null +++ b/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) diff --git a/December/Perfect Number/README.md b/December/Perfect Number/README.md new file mode 100644 index 0000000..8b13789 --- /dev/null +++ b/December/Perfect Number/README.md @@ -0,0 +1 @@ + diff --git a/December/Reach A Number/README.md b/December/Reach A Number/README.md new file mode 100644 index 0000000..3b87898 --- /dev/null +++ b/December/Reach A Number/README.md @@ -0,0 +1,2 @@ +[**C++ Solution**](https://github.com/moulikcipherX/LeetCode/tree/master/754.%20Reach%20a%20Number) + diff --git a/December/Remove Element/README.md b/December/Remove Element/README.md new file mode 100644 index 0000000..7c09862 --- /dev/null +++ b/December/Remove Element/README.md @@ -0,0 +1 @@ +[**Python Solution**](https://github.com/Pratul1997/LeetCode/tree/master/Source%20Code/27.%20Remove%20Element) diff --git a/December/Search Insert Position/README.md b/December/Search Insert Position/README.md new file mode 100644 index 0000000..41a2590 --- /dev/null +++ b/December/Search Insert Position/README.md @@ -0,0 +1 @@ +[**Python Solution**](https://github.com/Pratul1997/LeetCode/tree/master/Source%20Code/35.%20Search%20Insert%20Position) diff --git a/December/Self Dividing Number/README.md b/December/Self Dividing Number/README.md new file mode 100644 index 0000000..1bcade2 --- /dev/null +++ b/December/Self Dividing Number/README.md @@ -0,0 +1 @@ +[**C++ Solution**](https://github.com/moulikcipherX/LeetCode/tree/master/728.%20Self%20Dividing%20Numbers) diff --git a/January/Contains Duplicate II/README.md b/January/Contains Duplicate II/README.md new file mode 100644 index 0000000..a4007c0 --- /dev/null +++ b/January/Contains Duplicate II/README.md @@ -0,0 +1 @@ +[**Python Solution**](https://github.com/Pratul1997/LeetCode/tree/master/Source%20Code/219.%20Contains%20Duplicate%20II) diff --git a/January/Contains Duplicate/README.md b/January/Contains Duplicate/README.md new file mode 100644 index 0000000..5890a26 --- /dev/null +++ b/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) diff --git a/README.md b/README.md index 44bfa0a..b31c095 100644 --- a/README.md +++ b/README.md @@ -1 +1,33 @@ -# PyJaipur-Competitive-Division \ No newline at end of file +# PyJaipur-Competitive-Division + +
+ December + +| 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)** + +
+ +
+ January + +| 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)**