</a>

Leetcode-August-Challenge-2021

It contains the solutions of Leetcode August Challenge 2021

Link to the contest : <a href="https://leetcode.com/explore/challenge/card/august-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>Making A Large Island</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/BFS_DFS/Making%20A%20Large%20Island.cpp">

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

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

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

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

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

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

</a>
</td>
</tr>
<tr>
<td>Rank Transform of a Matrix</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-August-Challenge-2021/blob/main/Rank%20Transform%20of%20a%20Matrix.cpp">

</a>
</td>
</tr>
<tr>
<td>Add Strings</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/strings/Add%20Strings.cpp">

</a>
</td>
</tr>
<tr>
<td>Flip String to Monotone Increasing</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-August-Challenge-2021/blob/main/Flip%20String%20to%20Monotone%20Increasing.cpp">

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

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

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

</a>
</td>
</tr>
<tr>
<td>Minimum Window Substring</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Sliding%20Window/Minimum%20Window%20Substring.cpp">

</a>
</td>
</tr>
<tr>
<td>Range Sum Query - Immutable</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-August-Challenge-2021/blob/main/Range%20Sum%20Query%20-%20Immutable.cpp">

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

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

</a>
</td>
</tr>
<tr>
<td>Decode Ways</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-August-Challenge-2021/blob/main/Maximum%20Product%20of%20Splitted%20Binary%20Tree.cpp">

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

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

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

</a>
</td>
</tr>
<tr>
<td>Two Sum IV - Input is a BST</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-August-Challenge-2021/blob/main/Two%20Sum%20IV%20-%20Input%20is%20a%20BST.cpp">

</a>
</td>
</tr>
<tr>
<td>Complex Number Multiplication</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/strings/Complex%20Number%20Multiplication.cpp">

</a>
</td>
</tr>
<tr>
<td>Sum of Square Numbers</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-August-Challenge-2021/blob/main/Sum%20of%20Square%20Numbers.cpp">

</a>
</td>
</tr>
<tr>
<td>Verify Preorder Serialization of a Binary Tree</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-August-Challenge-2021/blob/main/Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree.cpp">

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

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

</a>
</td>
</tr>
<tr>
<td>Find Minimum in Rotated Sorted Array</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Binary%20Search/Find%20Minimum%20in%20Rotated%20Sorted%20Array.cpp">

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

README

Leetcode-August-Challenge-2021