Repository

Leetcode-July-Challenge-2021

It contains the solutions of Leetcode July Challenge 2021

README

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

Fork me on GitHub

</a>

Leetcode-July-Challenge-2021

It contains the solutions of Leetcode July Challenge 2021

Link to the contest : <a href="https://leetcode.com/explore/challenge/card/july-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>Find Leaves of Binary Tree</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Tree/Find%20Leaves%20Of%20Binary%20Tree.cpp">

</a>
</td>
</tr>
<tr>
<td>Gray Code</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Bit_Magic/Gray%20Code.cpp">

</a>
</td>
</tr>
<tr>
<td>Find K Closest Elements</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Binary%20Search/Find%20K%20Closest%20Elements.cpp">

</a>
</td>
</tr>
<tr>
<td>Max Sum of Rectangle No Larger Than K</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K.cpp">

</a>
</td>
</tr>
<tr>
<td>Count Vowels Permutation</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Count%20Vowels%20Permutation.cpp">

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

</a>
</td>
</tr>
<tr>
<td>Reduce Array Size to The Half</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-July-Challenge-2021/blob/main/Reduce%20Array%20Size%20to%20The%20Half.cpp">

</a>
</td>
</tr>
<tr>
<td>Kth Smallest Element in a Sorted Matrix</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/2-D%20Array/Kth%20Smallest%20Element%20in%20a%20Sorted%20Matrix.cpp">

</a>
</td>
</tr>
<tr>
<td>Reverse Words in a String II</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/strings/Reverse%20Words%20in%20a%20String%20II.cpp">

</a>
</td>
</tr>
<tr>
<td>Maximum Length of Repeated Subarray</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Maximum_Length_of_Repeated_Subarray.cpp">

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

</a>
</td>
</tr>
<tr>
<td>Decode Ways II</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Decode%20Ways%20II.cpp">

</a>
</td>
</tr>
<tr>
<td>Decode Ways II</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Design/Find%20Median%20from%20Data%20Stream.cpp">

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

</a>
</td>
</tr>
<tr>
<td>Find Peak Element</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-July-Challenge-2021/blob/main/Find%20Peak%20Element.cpp">

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

</a>
</td>
</tr>
<tr>
<td>Range Addition</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Cumulative_Sum(Prefix%20Array)/Range%20Addition.cpp">

</a>
</td>
</tr>
<tr>
<td>Valid Triangle Number</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Two%20Pointer/Valid%20Triangle%20Number.cpp">

</a>
</td>
</tr>
<tr>
<td>Three Equal Parts</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Three%20Equal%20Parts.cpp">

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

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

</a>
</td>
</tr>
<tr>
<td>Shuffle an Array</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Mathematical/Shuffle%20an%20Array.cpp">

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

</a>
</td>
</tr>
<tr>
<td>Partition Array into Disjoint Intervals</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Partition%20Array%20into%20Disjoint%20Intervals.cpp">

</a>
</td>
</tr>
<tr>
<td>Binary Tree Pruning</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Tree/Binary%20Tree%20Pruning.cpp">

</a>
</td>
</tr>
<tr>
<td>Word Ladder II</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-July-Challenge-2021/blob/main/Word%20Ladder%20II.cpp">

</a>
</td>
</tr>
<tr>
<td>Non-negative Integers without Consecutive Ones</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-July-Challenge-2021/blob/main/Non-negative%20Integers%20without%20Consecutive%20Ones.cpp">

</a>
</td>
</tr>
<tr>
<td>Convert Sorted Array to Binary Search Tree</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-July-Challenge-2021/blob/main/Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree.cpp">

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

</a>
</td>
</tr>
<tr>
<td>Binary Tree Longest Consecutive Sequence II</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Tree/Binary%20Tree%20Longest%20Consecutive%20Sequence%20II.cpp">

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

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

</a>
</td>
</tr>
<tr>
<td>Trapping Rain Water</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Stack/Trapping%20Rain%20Water%20(using%20stack)">

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