</a>

Leetcode-January-Challenge-2021

It contains the solutions of Leetcode January Challenge 2021

Link to the contest : <a href="https://leetcode.com/explore/featured/card/january-leetcoding-challenge-2021/579/week-1-january-1st-january-7th/3589/">Click:triangular_flag_on_post:</a>

<h1>Questions</h1>
<table id = "example" class="SectionTable display" >
<thead>
<th>Problem Name</th>
<th>Click to open the Problem</th>
</thead>
<tbody>
<tr>
<td>Palindrome Permutation</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-January-Challenge-2021/blob/main/Palindrome%20Permutation">

</a>
</td>
</tr>
<tr>
<td>Check Array Formation Through Concatenation</td>
<td><a href="https://github.com/MAZHARMIK/-Leetcode-January-Challenge-2021/blob/main/Check%20Array%20Formation%20Through%20Concatenation">

</a>
</td>
</tr>
<tr>
<td>Find a Corresponding Node of a Binary Tree in a Clone of That Tree</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-January-Challenge-2021/blob/main/Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree">

</a>
</td>
</tr>
<tr>
<td>Beautiful Arrangement</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Backtracking/Beautiful%20Arrangement">

</a>
</td>
</tr>
<tr>
<td>Merge Two Sorted Lists</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Linked%20List/Merge%20Two%20Sorted%20Lists(Iterative))">

</a>
</td>
</tr>
<tr>
<td>Remove Duplicates from Sorted List II</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Linked%20List/Remove%20Duplicates%20from%20Sorted%20List%20II">

</a>
</td>
</tr>
<tr>
<td>Kth Missing Positive Number</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-January-Challenge-2021/blob/main/Kth%20Missing%20Positive%20Number">

</a>
</td>
</tr>
<tr>
<td>Longest Substring Without Repeating Characters</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Two%20Pointer/Longest%20Substring%20Without%20Repeating%20Characters">

</a>
</td>
</tr>
<tr>
<td>Find Root of N-Ary Tree</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Tree/N-Ary%20Tree/Find%20Root%20of%20N-Ary%20Tree">

</a>
</td>
</tr>
<tr>
<td>Check Array Formation Through Concatenation</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-January-Challenge-2021/blob/main/Check%20Array%20Formation%20Through%20Concatenation">

</a>
</td>
</tr>
<tr>
<td>Word Ladder</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/Word%20Ladder">

</a>
</td>
</tr>
<tr>
<td>Create Sorted Array through Instructions</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-January-Challenge-2021/blob/main/Create%20Sorted%20Array%20through%20Instructions">

</a>
</td>
</tr>
<tr>
<td>Merge Sorted Array</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-January-Challenge-2021/blob/main/Merge%20Sorted%20Array">

</a>
</td>
</tr>
<tr>
<td>Add Two Numbers</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Linked%20List/Add%20Two%20Numbers">

</a>
</td>
</tr>
<tr>
<td>Boats to Save People</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Greedy/Boats%20to%20Save%20People">

</a>
</td>
</tr>
<tr>
<td>Minimum Operations to Reduce X to Zero</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Greedy/Minimum%20Operations%20to%20Reduce%20X%20to%20Zero">

</a>
</td>
</tr>
<tr>
<td>Nested List Weight Sum</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-January-Challenge-2021/blob/main/Nested%20List%20Weight%20Sum">

</a>
</td>
</tr>
<tr>
<td>Get Maximum in Generated Array</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-January-Challenge-2021/blob/main/Get%20Maximum%20in%20Generated%20Array">

</a>
</td>
</tr>
<tr>
<td>Kth Largest Element in an Array</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Heap/Kth%20Largest%20Element%20in%20an%20Array">

</a>
</td>
</tr>
<tr>
<td>Count Sorted Vowel Strings</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Backtracking/Count%20Sorted%20Vowel%20Strings">

</a>
</td>
</tr>
<tr>
<td>Max Number of K-Sum Pairs</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-January-Challenge-2021/blob/main/Max%20Number%20of%20K-Sum%20Pairs">

</a>
</td>
</tr>
<tr>
<td>Longest Palindromic Substring</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Longest%20Palindromic%20Substring">

</a>
</td>
</tr>
<tr>
<td>Valid Parentheses</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-January-Challenge-2021/blob/main/Valid%20Parentheses">

</a>
</td>
</tr>
<tr>
<td>Find the Most Competitive Subsequence</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/42cf5eedfad3c5cd20f1f5557941aa4ce13f7202/Greedy/Find%20the%20Most%20Competitive%20Subsequence">

</a>
</td>
</tr>
<tr>
<td>One Edit Distance</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/strings/One%20Edit%20Distance">

</a>
</td>
</tr>
<tr>
<td>Determine if Two Strings Are Close</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/strings/Determine%20if%20Two%20Strings%20Are%20Close">

</a>
</td>
</tr>
<tr>
<td>Sort the Matrix Diagonally</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/2-D%20Array/Sort%20the%20Matrix%20Diagonally">

</a>
</td>
</tr>
<tr>
<td>Check If All 1's Are at Least Length K Places Away</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-January-Challenge-2021/blob/main/Check%20If%20All%201's%20Are%20at%20Least%20Length%20K%20Places%20Away">

</a>
</td>
</tr>
<tr>
<td>Path With Minimum Effort</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/Path With Minimum Effort">

</a>
</td>
</tr>
<tr>
<td>Concatenation of Consecutive Binary Numbers</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/768d6d2dfd89c73c2e3477d78f8ed5866b197aaa/Bit_Magic/Concatenation%20of%20Consecutive%20Binary%20Numbers">

</a>
</td>
</tr>
<tr>
<td>Smallest String With A Given Numeric Value</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Greedy/Smallest%20String%20With%20A%20Given%20Numeric%20Value">

</a>
</td>
</tr>
<tr>
<td>Vertical Order Traversal of a Binary Tree</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Greedy/Smallest%20String%20With%20A%20Given%20Numeric%20Value">

</a>
</td>
</tr>
<tr>
<td>Minimize Deviation in Array</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Greedy/Smallest%20String%20With%20A%20Given%20Numeric%20Value">

</a>
</td>
</tr>
</tbody>
</table>

README

Leetcode-January-Challenge-2021