</a>

Leetcode-September-Challenge-2021

It contains the solutions of Leetcode September Challenge 2021

Link to the contest : <a href="https://leetcode.com/explore/challenge/card/september-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>Array Nesting</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Array%20Nesting.cpp">

</a>
</td>
</tr>
<tr>
<td>Unique Binary Search Trees II</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-September-Challenge-2021/blob/main/Unique%20Binary%20Search%20Trees%20II.cpp">

</a>
</td>
</tr>
<tr>
<td>Unique Binary Search Trees II</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-September-Challenge-2021/blob/main/Erect%20The%20Fence.cpp">

</a>
</td>
</tr>
<tr>
<td>Sum of Distances in Tree</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-September-Challenge-2021/blob/main/Sum%20of%20Distances%20in%20Tree.cpp">

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

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

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

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

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

</a>
</td>
</tr>
<tr>
<td>Arithmetic Slices II - Subsequence</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Arithmetic%20Slices%20II%20-%20Subsequence.cpp">

</a>
</td>
</tr>
<tr>
<td>Basic Calculator</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Stack/Basic%20Calculator.cpp">

</a>
</td>
</tr>
<tr>
<td>Reachable Nodes In Subdivided Graph</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-September-Challenge-2021/blob/main/Reachable%20Nodes%20In%20Subdivided%20Graph.cpp">

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

</a>
</td>
</tr>
<tr>
<td>Reverse Only Letters</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-September-Challenge-2021/blob/main/Reverse%20Only%20Letters.cpp">

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

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

</a>
</td>
</tr>
<tr>
<td>Intersection of Two Arrays II</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-September-Challenge-2021/blob/main/Intersection%20of%20Two%20Arrays%20II.cpp">

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

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

</a>
</td>
</tr>
<tr>
<td>Find Winner on a Tic Tac Toe Game</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-September-Challenge-2021/blob/main/Find%20Winner%20on%20a%20Tic%20Tac%20Toe%20Game.cpp">

</a>
</td>
</tr>
<tr>
<td>Maximum Length of a Concatenated String with Unique Characters</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Recursion/Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters.cpp">

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

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

</a>
</td>
</tr>
<tr>
<td>Shortest Path in a Grid with Obstacles Elimination Solution</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/BFS_DFS/Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination%20%20Solution.cpp">

</a>
</td>
</tr>
<tr>
<td>Transform to Chessboard</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-September-Challenge-2021/blob/main/Transform%20to%20Chessboard.cpp">

</a>
</td>
</tr>
<tr>
<td>Unique Email Addresses</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-September-Challenge-2021/blob/main/Unique%20Email%20Addresses.cpp">

</a>
</td>
</tr>
<tr>
<td>Sort Array By Parity II</td>
<td><a href="https://github.com/MAZHARMIK/Leetcode-September-Challenge-2021/blob/main/Sort%20Array%20By%20Parity%20II.cpp">

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

</a>
</td>
</tr>
<tr>
<td>Partition to K Equal Sum Subsets</td>
<td><a href="https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Backtracking/Partition%20to%20K%20Equal%20Sum%20Subsets.cpp">

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

README

Leetcode-September-Challenge-2021