<a href="https://github.com/MAZHARMIK">

</a>

Leetcode-April-Challenge-2021

It contains the solutions of Leetcode April Challenge 2021

Link to the contest : <a href="https://leetcode.com/explore/challenge/card/april-leetcoding-challenge-2021/593/week-1-april-1st-april-7th/">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>Largest Unique Number</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-April-Challenge-2021/blob/main/Largest%20Unique%20Number">

</a>
</td>
</tr>
<tr>
<td>Palindrome Linked List</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-April-Challenge-2021/blob/main/Palindrome%20Linked%20List">

</a>
</td>
</tr>
</tr>
<tr>
<td>Ones and Zeroes</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Ones%20and%20Zeroes">

</a>
</td>
</tr>
</tr>
<tr>
<td>Longest Valid Parentheses</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Stack/Longest%20Valid%20Parentheses%20(2%20Approaches)">

</a>
</td>
</tr>
<tr>
<td>Design Circular Queue</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Design/Design%20Circular%20Queue">

</a>
</td>
</tr>
<tr>
<td>Global and Local Inversions</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Mathematical/Global%20and%20Local%20Inversions">

</a>
</td>
</tr>
<tr>
<td>Minimum Operations to Make Array Equal</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Mathematical/Minimum%20Operations%20to%20Make%20Array%20Equal">

</a>
</td>
</tr>
<tr>
<td>Determine if String Halves Are Alike</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-April-Challenge-2021/edit/main/README.md">

</a>
</td>
</tr>
<tr>
<td>Inorder Successor in BST</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Tree/Inorder%20Successor%20in%20BST">

</a>
</td>
</tr>
<tr>
<td>Letter Combinations of a Phone Number</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Backtracking/Letter%20Combinations%20of%20a%20Phone%20Number">

</a>
</td>
</tr>
<tr>
<td>Verifying an Alien Dictionary</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/HashMap/Verifying%20an%20Alien%20Dictionary">

</a>
</td>
</tr>
<tr>
<td>Longest Increasing Path in a Matrix</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/2-D%20Array/DFS/Longest_Increasing_Path_in_a_Matrix.cpp">

</a>
</td>
</tr>
<tr>
<td>Deepest Leaves Sum</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Beautiful_Arrangement_II.cpp">

</a>
</td>
</tr>
<tr>
<td>Beautiful Arrangement II</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-April-Challenge-2021/blob/main/Deepest_Leaves_Sum.cpp">

</a>
</td>
</tr>
<tr>
<td>Flatten Nested List Iterator</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Design/Flatten%20Nested%20List%20Iterator">

</a>
</td>
</tr>
<tr>
<td>Partition List</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Linked%20List/Partition_List.cpp">

</a>
</td>
</tr>
<tr>
<td>Minimum Swaps to Group All 1's Together</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Sliding%20Window/Minimum_Swaps_to_Group_All_1s_Together.cpp">

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

</a>
</td>
</tr>
<tr>
<td>Remove All Adjacent Duplicates in String II</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-April-Challenge-2021/blob/main/Remove%20All%20Adjacent_Duplicates_in_String_II.cpp">

</a>
</td>
</tr>
<tr>
<td>Number of Submatrices That Sum to Target</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/2-D%20Array/Number%20of%20Submatrices%20That%20Sum%20to%20Target">

</a>
</td>
</tr>
<tr>
<td>Remove Nth Node From End of List</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-April-Challenge-2021/blob/main/Remove_Nth_Node_From_End_of_List.cpp">

</a>
</td>
</tr>
<tr>
<td>Combination Sum IV</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Backtracking/Combination_Sum_IV.cpp">

</a>
</td>
</tr>
<tr>
<td>N-ary Tree Preorder Traversal</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Tree/N-Ary%20Tree/N-ary_Tree_Preorder_Traversal.cpp">

</a>
</td>
</tr>
<tr>
<td>Triangle</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Triangle">

</a>
</td>
</tr>
<tr>
<td>Missing Number In Arithmetic Progression</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Binary%20Search/Missing%20Number%20In%20Arithmetic%20Progression">

</a>
</td>
</tr>
<tr>
<td>Brick Wall</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/HashMap/Brick%20Wall">

</a>
</td>
</tr>
<tr>
<td>Count Binary Substrings</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/tree/master/strings">

</a>
</td>
</tr>
<tr>
<td>Count Binary Substrings</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/Critical%20Connections%20in%20a%20Network">

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

</a>
</td>
</tr>
<tr>
<td>Furthest Building You Can Reach</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Heap/Furthest_Building_You_Can_Reach.cpp">

</a>
</td>
</tr>
<tr>
<td>Power of Three</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-April-Challenge-2021/blob/main/Power%20of%20Three">

</a>
</td>
</tr>
<tr>
<td>Unique Paths II</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Unique%20Paths%20II%20(DP%20and%20Memoized)">

</a>
</td>
</tr>
<tr>
<td>Meeting Scheduler</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Intervals_Based_Qn/Meeting_Scheduler.cpp">

</a>
</td>
</tr>
<tr>
<td>Find First and Last Position of Element in Sorted Array</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Binary%20Search/Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array">

</a>
</td>
</tr>
<tr>
<td>Powerful Integers</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Mathematical/Powerful_Integers.cpp">

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