Updated Readme + TwoSums + Longest Palindromic Substring (codedecks-in#10)

* 1513 * Upload: "Flower Planting with No adjacent"-Python * Upload: codedecks-in#56 Merge Intervals (Python) * Updated Readme * Fixed Readme * Updated Readme (Shift Twosum -> HashMap) Co-authored-by: Gourav Rusiya <gouravrusiya.lnct@gmail.com>

Author: lokendra1704

README.md

@@ -76,7 +76,6 @@
 
 | # | Title | Solution | Time | Space | Difficulty | Tag | Note |
 | --- | ---------------------------------------------------------------- | --------------------------------------- | ---------- | ------ | ---------- | --------- | ---- |
-| 001 | [Two Sum](https://leetcode.com/problems/two-sum) | [Java](./Java/two-sum.java) | _O(n)_ | _O(n)_ | Easy | | |
 | 56 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | [Python](./Python/56_MergeIntervals.py) | _O(nlogn)_ | _O(n)_ | Medium | Intervals | |
 
 <br/>
@@ -127,7 +126,7 @@
 | # | Title | Solution | Time | Space | Difficulty | Tag | Note |
 | --- | ------------------------------------------------------------- | --------------------------------- | ------ | ------ | ---------- | --- | ------------- |
 | 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | [Java](./Java/valid-anagram.java) | _O(n)_ | _O(1)_ | Easy | | Unicode chars |
-|1| [Two Sum](https://leetcode.com/problems/two-sum/)| [Python](./Python/1_TwoSum.py)|_O(N)_|_O(N)_|Easy|||
+|1| [Two Sum](https://leetcode.com/problems/two-sum/)| [Java](./Java/two-sum.java) <br> [Python](./Python/1_TwoSum.py)|_O(N)_|_O(N)_|Easy|||
 
 <br/>
 <div align="right">