</a>

Leetcode-June-Challenge-2021

It contains the solutions of Leetcode June Challenge 2021

Link to the contest : <a href="https://leetcode.com/explore/challenge/card/june-leetcoding-challenge-2021/">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>Paint House</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Paint_House.cpp">

</a>
</td>
</tr>
<tr>
<td>Max Area of Island</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Backtracking/Max_Area_of_Island.cpp">

</a>
</td>
</tr>
<tr>
<td>Interleaving String</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Interleaving_String.cpp">

</a>
</td>
</tr>
<tr>
<td>Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Maximum_Area_of_a_Piece_of%20Cake_After_Horizontal_and_Vertical_Cuts.cpp">

</a>
</td>
</tr>
<tr>
<td>Open the Lock</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/Open_the_Lock.cpp">

</a>
</td>
</tr>
<tr>
<td>Maximum Performance of a Team</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Greedy/Maximum_Performance_of_a_Team.cpp">

</a>
</td>
</tr>
<tr>
<td>Longest Consecutive Sequence</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/HashMap/Longest_Consecutive_Sequence.cpp">

</a>
</td>
</tr>
<tr>
<td>Min Cost Climbing Stairs</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Min_Cost_Climbing_Stairs.cpp">

</a>
</td>
</tr>
<tr>
<td>The Maze II</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/The%20Maze%20II.cpp">

</a>
</td>
</tr>
<tr>
<td>Construct Binary Tree from Preorder and Inorder Traversal</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Tree/Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.cpp">

</a>
</td>
</tr>
<tr>
<td>Jump Game VI</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Jump%20Game%20VI.cpp">

</a>
</td>
</tr>
<tr>
<td>My Calendar I</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/HashMap/My%20Calendar%20I.cpp">

</a>
</td>
</tr>
<tr>
<td>Stone Game VII</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Game%20Strategy/Stone%20Game%20VII">

</a>
</td>
</tr>
<tr>
<td>Minimum Number of Refueling Stops</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Minimum%20Number%20of%20Refueling%20Stops.cpp">

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

</a>
</td>
</tr>
<tr>
<td>Maximum Units on a Truck</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-June-Challenge-2021/blob/main/Maximum%20Units%20on%20a%20Truck.cpp">

</a>
</td>
</tr>
<tr>
<td>Shortest Distance to Target Color</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Binary%20Search/Shortest%20Distance%20to%20Target%20Color.cpp">

</a>
</td>
</tr>
<tr>
<td>Matchsticks to Square</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Backtracking/Matchsticks%20to%20Square.cpp">

</a>
</td>
</tr>
<tr>
<td>Generate Parentheses</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Backtracking/Generate%20Parentheses%20(O(2%5En))">

</a>
</td>
</tr>
<tr>
<td>Number of Subarrays with Bounded Maximum</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Sliding%20Window/Number%20of%20Subarrays%20with%20Bounded%20Maximum.cpp">

</a>
</td>
</tr>
<tr>
<td>Range Sum Query Mutable</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Segment%20Tree/Range_Sum_Query_Mutable.cpp">

</a>
</td>
</tr>
<tr>
<td>K Inverse Pairs Array</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/K%20Inverse%20Pairs%20Array.cpp">

</a>
</td>
</tr>
<tr>
<td>Swim in Rising Water</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/Swim%20in%20Rising%20Water.cpp">

</a>
</td>
</tr>
<tr>
<td>Pascal's Triangle</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Pascal's%20Triangle.cpp">

</a>
</td>
</tr>
<tr>
<td>All Paths from Source Lead to Destination</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/All%20Paths%20from%20Source%20Lead%20to%20Destination.cpp">

</a>
</td>
</tr>
<tr>
<td>Number of Matching Subsequences</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/HashMap/Number%20of%20Matching%20Subsequences.cpp">

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

</a>
</td>
</tr>
<tr>
<td>Out of Boundary Paths</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Out%20of%20Boundary%20Paths.cpp">

</a>
</td>
</tr>
<tr>
<td>Out of Boundary Paths</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/Redundant%20Connection.cpp">

</a>
</td>
</tr>
<tr>
<td>Candy</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Greedy/Candy.cpp">

</a>
</td>
</tr>
<tr>
<td>Remove All Adjacent Duplicates In String</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Stack/Remove%20All%20Adjacent%20Duplicates%20In%20String.cpp">

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

</a>
</td>
</tr>
<tr>
<td>Max Consecutive Ones III</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Two%20Pointer/Max%20Consecutive%20Ones%20III.cpp">

</a>
</td>
</tr>
<tr>
<td>Lowest Common Ancestor in a Binary Tree</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Tree/Lowest%20Common%20Ancestor%20in%20a%20Binary%20Tree">

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

README

Leetcode-June-Challenge-2021