Promote Sign in Sign up

Repository

Leetcode-May-Challenge-2021

It contains the solutions of Leetcode May Challenge 2021

MAZHARMIK
Repository

README

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

Fork me on GitHub

</a>

Leetcode-May-Challenge-2021

It contains the solutions of Leetcode May Challenge 2021

Link to the contest : <a href="https://leetcode.com/explore/featured/card/may-leetcoding-challenge-2021/598/week-1-may-1st-may-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>Number of Connected Components in an Undirected Graph</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph">

</a>
</td>
</tr>
<tr>
<td>Prefix and Suffix Search</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Trie/Prefix%20and%20Suffix%20Search">

</a>
</td>
</tr>
<tr>
<td>Course Schedule III</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Heap/Course%20Schedule%20III">

</a>
</td>
</tr>
<tr>
<td>Running Sum of 1d Array</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-May-Challenge-2021/blob/main/Running%20Sum%20of%201d%20Array">

</a>
</td>
</tr>
<tr>
<td>Non-decreasing Array</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Non-decreasing_Array.cpp">

</a>
</td>
</tr>
<tr>
<td>Jump Game II</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Jump%20Game%20II%20(Brute%20Force%20-%3E%20Memoized(DP)%20-%3EBest)">

</a>
</td>
</tr>
<tr>
<td>Convert Sorted List to Binary Search Tree</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Tree/Convert%20Sorted%20List%20to%20Binary%20Search%20Tree">

</a>
</td>
</tr>
<tr>
<td>Delete Operation for Two Strings</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Delete_Operation_for_Two_Strings.cpp">

</a>
</td>
</tr>
<tr>
<td>Put Boxes Into the Warehouse I</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Greedy/Put_Boxes_Into_the_Warehouse_I.cpp">

</a>
</td>
</tr>
<tr>
<td>Super Palindromes</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Mathematical/Super_Palindromes.cpp">

</a>
</td>
</tr>
<tr>
<td>Construct Target Array With Multiple Sums</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Heap/Construct_Target_Array_With_Multiple_Sums.cpp">

</a>
</td>
</tr>
<tr>
<td>Count Primes</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-May-Challenge-2021/blob/main/Count%20Primes">

</a>
</td>
</tr>
<tr>
<td>Maximum Points You Can Obtain from Cards</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Sliding%20Window/Maximum%20Points%20You%20Can%20Obtain%20from%20Cards">

</a>
</td>
</tr>
<tr>
<td>Range Sum Query 2D - Immutable</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Range%20Sum%20Query%202D%20-%20Immutable">

</a>
</td>
</tr>
<tr>
<td>Ambiguous Coordinates</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-May-Challenge-2021/blob/main/Ambiguous_Coordinates.cpp">

</a>
</td>
</tr>
<tr>
<td>Flatten Binary Tree to Linked List</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Tree/Flatten%20Binary%20Tree%20to%20Linked%20List%20(2%20approaches)">

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

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

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

</a>
</td>
</tr>
<tr>
<td>Longest String Chain</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-May-Challenge-2021/blob/main/Minimum_Moves_to_Equal_Array_Elements_II.cpp">

</a>
</td>
</tr>
<tr>
<td>Binary Tree Level Order Traversal</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-May-Challenge-2021/blob/main/Binary_Tree_Level_Order_Traversal.cpp">

</a>
</td>
</tr>
<tr>
<td>Find and Replace Pattern</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/HashMap/Find_and_Replace_Pattern.cpp">

</a>
</td>
</tr>
<tr>
<td>Design Tic-Tac-Toe</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Design/Design%20Tic-Tac-Toe.cpp">

</a>
</td>
</tr>
<tr>
<td>N-Queens</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Backtracking/N-Queens.cpp">

</a>
</td>
</tr>
<tr>
<td>Find the Shortest Superstring</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Find%20the%20Shortest%20Superstring">

</a>
</td>
</tr>
<tr>
<td>To Lower Case</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-May-Challenge-2021/blob/main/To%20Lower%20Case">

</a>
</td>
</tr>
<tr>
<td>Evaluate Reverse Polish Notation</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-May-Challenge-2021/blob/main/Evaluate_Reverse_Polish_Notation.cpp">

</a>
</td>
</tr>
<tr>
<td>Partitioning Into Minimum Number Of Deci-Binary Numbers</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Greedy/Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers">

</a>
</td>
</tr>
<tr>
<td>Maximum Product of Word Lengths</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Bit_Magic/Maximum_Product_of_Word_Lengths.cpp">

</a>
</td>
</tr>
<tr>
<td>Maximum Erasure Value</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Two%20Pointer/Maximum_Erasure_Value.cpp">

</a>
</td>
</tr>
<tr>
<td>Minimum Cost to Connect Sticks</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Heap/Minimum%20Cost%20to%20Connect%20Sticks">

</a>
</td>
</tr>
<tr>
<td>N-Queens II</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Backtracking/N-Queens_II.cpp">

</a>
</td>
</tr>
<tr>
<td>Maximum Gap</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Maximum_Gap.cpp">

</a>
</td>
</tr>
<tr>
<td>Search Suggestions System</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Design/Search_Suggestions_System.cpp">

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