This is A complete DSA preparation Course. A DSA self-paced course for ultimate Interview and Placement Preparation
<h1 align="center">
  <a name="logo"><img src="https://github.com/Prince-1501/Complete-DSA-Preparation/blob/main/img/dsa%20logo.png" alt="Complete DSA Preparation" width="750"></a>
  <br>
  Complete DSA Preparation Course
</h1>
<h4 align="center">Make sure to :star: my DSA repo so you can keep up to date on any daily progress!</h4>
<!-- <div align="center">
  <h4>
    <a href="https://github.com/CCOSTAN/Home-AssistantConfig/stargazers"><img src="https://img.shields.io/github/stars/CCOSTAN/Home-AssistantConfig.svg?style=plasticr"/></a>
    <a href="https://github.com/CCOSTAN/Home-AssistantConfig/commits/master"><img src="https://img.shields.io/github/last-commit/CCOSTAN/Home-AssistantConfig.svg?style=plasticr"/></a>
        <a href="https://github.com/CCOSTAN/Home-AssistantConfig/commits/master"><img src="https://img.shields.io/github/commit-activity/y/CCOSTAN/Home-AssistantConfig.svg?style=plasticr"/></a>

  </h4>
</div> -->


<!-- 
<p><font size="3">
This Repo is designed for Smart Home inspiration.  The configuration, devices, layout, linked Blog posts and YouTube videos should help inspire you to jump head first into the IOT world.  This is the live working configuration of <strong>my Smart Home</strong>. Use the menu links to jump between sections.  All of the code is under the <em>config</em> directory and free to use and contribute to.  Be sure to subscribe to the <a href="https://eepurl.com/dmXFYz">Blog Mailing list</a> and YouTube Channel. (https://YouTube.com/vCloudInfo)</p> -->
 
 
 
<!-- <div align="center"><a name="menu"></a>
  <h4>
    <a href="https://www.vCloudInfo.com/tag/iot">
      Blog
    </a>
    <span> | </span>
    <a href="https://github.com/CCOSTAN/Home-AssistantConfig#devices">
      Devices
    </a>
    <span> | </span>
    <a href="https://github.com/CCOSTAN/Home-AssistantConfig/issues?q=is%3Aissue+is%3Aopen+sort%3Aupdated-desc">
      Todo List
    </a>
    <span> | </span>
    <a href="https://twitter.com/BearStoneHA">
      Smart Home Stats
    </a>
    <span> | </span>
    <a href="https://www.vcloudinfo.com/click-here">
      Follow Me
    </a>
    <span> | </span>
    <a href="https://github.com/CCOSTAN/Home-AssistantConfig/tree/master/config">
      Code
    </a>
    <span> | </span>
    <a href="https://github.com/CCOSTAN/Home-AssistantConfig#diagram">
      Diagram
    </a>
    <span> | </span>
    <a href="https://youtube.com/vCloudInfo">
      Youtube
    </a>
    <span> | </span>
    <a href="https://amzn.to/2HXSx2M">
      Merch
    </a>
  </h4>
</div> -->





# [LeetCode](https://leetcode.com/problemset/algorithms/) | [GeeksforGeeks](https://practice.geeksforgeeks.org/) 
[![GitHub license](https://img.shields.io/github/license/Prince-1501/Complete-DSA-Preparation.svg)](https://github.com/Prince-1501/Complete-DSA-Preparation/blob/master/LICENSE)


_If you like this project, please leave me a star._ &#9733;

<img src="https://github.com/Prince-1501/Complete-DSA-Preparation/blob/main/img/leetcode.png" alt="leetcode" width="60"/><img src="https://github.com/Prince-1501/Complete-DSA-Preparation/blob/main/img/geeksforgeeks.png" alt="geeksforgeeks" width="60"/><a href="https://www.youtube.com/channel/UCbW63uLlDnsL7l992Z9nF_Q/"><img src="https://github.com/Prince-1501/Complete-DSA-Preparation/blob/main/img/hello_world.png" alt="Hello World" width="90"/></a>



_A little Contribution :moneybag:Makes You Happy :heart: (And me Also :blush:)_
<br>
<img src="https://github.com/Prince-1501/Complete-DSA-Preparation/blob/main/img/phone-pe.png" alt="Phone Pe" width="60"/><img src="https://github.com/Prince-1501/Complete-DSA-Preparation/blob/main/img/Google-Pay.png" alt="Google Pay" width="60"/><img src="https://github.com/Prince-1501/Complete-DSA-Preparation/blob/main/img/bhim.png" alt="bhim" width="50"/><a href="https://github.com/Prince-1501/Complete-DSA-Preparation/blob/main/img/dsa-course%40upi.jpg"><img src="https://github.com/Prince-1501/Complete-DSA-Preparation/blob/main/img/dsa-course@upi.jpg" alt="bhim upi" width="50"/></a>



``` JavaScript
dsa-course@upi
```




> "For coding interview preparation, LeetCode & GeeksforGeeks is one of the best online resource providing a rich library of more than 500+ real coding interview questions for you "

## Table of Contents

- [Time Complexity](#Time-complexity)
- [Mathematics](#mathematics)
- [Bits Manipulation](#Bits-Manipulation)
- [Recursion](#Recursion)
- [Arrays](#Arrays)
- [Searching](#Searching)
- [Sorting](#Sorting)
- [Matrix](#matrix)
- [Hashing](#Hashing)
- [String](#String)
- [Linked List](#Linked-List)
- [Stack](#Stack)
- [Queue](#Queue)
- [Tree](#Tree)
- [Binary Search Tree](#Binary-Search-Tree)
- [Heap](#Heap)
- [Graph](#Graph)
- [Greedy](#Greedy)
- [Backtracking](#Backtracking)
- [Dynamic Programming](#Dynamic-Programming)
- [Trie](#Trie)


:green_square:
:orange_square:
:red_square:


## Mathematics

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1|Absolute value||[Theory](https://www.geeksforgeeks.org/program-to-find-absolute-value-of-a-given-number/)||:green_square: Easy| abs() |
|2| Celsius To Fahrenheit ||[Theory](https://www.geeksforgeeks.org/program-celsius-fahrenheit-conversion/)||:green_square: Easy| Math |
|3| Roots of Quadratic equation||[Theory](https://www.geeksforgeeks.org/program-to-find-the-roots-of-quadratic-equation/)||:green_square: Easy| Math |
|4| [Factorial Of Number](https://practice.geeksforgeeks.org/problems/factorial5739/1)||||:green_square: Easy| Math |
|5| [Count digits in a factorial ](https://practice.geeksforgeeks.org/problems/count-digits-in-a-factorial3957/1)||||:green_square: Easy| Factorial, Math |
|6| [Series GP](https://practice.geeksforgeeks.org/problems/series-gp4646/1)||||:green_square: Easy| Basic Math |
|7| [Prime Number](https://practice.geeksforgeeks.org/problems/prime-number2314/1)||||:green_square: Easy| Basic Math |
|8| Exactly 3 Divisors ||[Theory](https://www.geeksforgeeks.org/numbers-exactly-3-divisors/)||:green_square: Easy| Basic Math |
|9| Addition Under Modulo||[Theory](https://www.geeksforgeeks.org/sum-of-two-numbers-modulo-m/)||:green_square: Easy| Modulo |
|10| Multiplication Under Modulo||[Theory](https://www.geeksforgeeks.org/multiply-large-integers-under-large-modulo/)||:green_square: Easy| Modulo |
|11| [Modular Multiplicative Inverse](https://practice.geeksforgeeks.org/problems/modular-multiplicative-inverse-1587115620/1)||||:green_square: Easy| Modulo |
|12| [Trailing zeroes in factorial](https://practice.geeksforgeeks.org/problems/trailing-zeroes-in-factorial5134/1)||||:orange_square: Medium| Logic |
|13| [Prime Factors ](https://practice.geeksforgeeks.org/problems/prime-factors5052/1)||||:orange_square: Medium| Prime |

## Bits Manipulation

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1| [Find first set bit](https://practice.geeksforgeeks.org/problems/find-first-set-bit-1587115620/1)| | | |:green_square: Easy| Bits, Modulo |
|2| [Rightmost different bit ](https://practice.geeksforgeeks.org/problems/rightmost-different-bit-1587115621/1)| | | |:green_square: Easy| XOR, Modulo |
|3| [Check whether K-th bit is set or not ](https://practice.geeksforgeeks.org/problems/check-whether-k-th-bit-is-set-or-not-1587115620/1)| | | |:green_square: Easy| XOR, Modulo |
|4| [Count total set bits ](https://practice.geeksforgeeks.org/problems/count-total-set-bits-1587115620/1)| | | |:orange_square: Medium| RIght shift |
|5| [Bit Difference ](https://practice.geeksforgeeks.org/problems/bit-difference-1587115620/1)| | | |:green_square: Easy| Bits |
|6| [Number is sparse or not  ](https://practice.geeksforgeeks.org/problems/number-is-sparse-or-not-1587115620/1)| | | |:green_square: Easy| Bits |
|7| [Longest Consecutive 1's  ](https://practice.geeksforgeeks.org/problems/longest-consecutive-1s-1587115620/1)| | | |:green_square: Easy| Bits |
|8| [ Gray Code    ](https://practice.geeksforgeeks.org/problems/gray-code4907/1)| | | |:green_square: Easy| Xor, Right Shift |
|9| [Gray to Binary equivalent   ](https://practice.geeksforgeeks.org/problems/gray-to-binary-equivalent-1587115620/1)| | | |:green_square: Easy| Xor, Right Shift |
|10| [Power of 2](https://practice.geeksforgeeks.org/problems/power-of-2-1587115620/1)| | | |:green_square: Easy| AND |
|11| [Swap all odd and even bits](https://practice.geeksforgeeks.org/problems/swap-all-odd-and-even-bits-1587115621/1)| | | |:green_square: Easy| OR |
|12| [Maximum AND Value ](https://practice.geeksforgeeks.org/problems/maximum-and-value-1587115620/1)| | | |:orange_square: Medium| AND |



## Recursion

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1| [Print 1 to n without using loops](https://practice.geeksforgeeks.org/problems/print-1-to-n-without-using-loops3621/1)| | | |:green_square: Easy| Recursion|
|2| [Sum Of Digits ](https://practice.geeksforgeeks.org/problems/sum-of-digits1742/1)| | | |:green_square: Easy|Recursion|
|3| [Count Total Digits in a Number  ](https://practice.geeksforgeeks.org/problems/count-total-digits-in-a-number/1)| | | |:green_square: Easy|Recursion|
|4| [Digital Root  ](https://practice.geeksforgeeks.org/problems/digital-root/1/)| | | |:orange_square: Medium|Recursion|
|5| [Fibonacci Using Recursion](https://practice.geeksforgeeks.org/problems/fibonacci-using-recursion/1/)| | | |:green_square: Easy|Recursion|
|6| [Tower Of Hanoi](https://practice.geeksforgeeks.org/problems/tower-of-hanoi-1587115621/1)| | | |:orange_square: Medium|Recursion|
|7| [Josephus problem](https://practice.geeksforgeeks.org/problems/josephus-problem/1)| | | |:orange_square: Medium|Recursion|


## Arrays

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1| | | | | |  |



## Searching

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1| | | | | |  |




## Sorting

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1| | | | | |  |




## Matrix

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1|[What is Multidimensional Arrays c++](https://www.geeksforgeeks.org/multidimensional-arrays-c-cpp/)||[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/multi%20dimension%20array.pdf)|[Video](https://youtu.be/TfE2c7SXaUo)|:green_square: Easy| Matrix, Array |
|2|[Sum of upper and lower triangles ](https://practice.geeksforgeeks.org/problems/sum-of-upper-and-lower-triangles-1587115621/1)||[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Sum%20of%20upper%20and%20lower%20triangles.pdf)|[Solution](https://youtu.be/YuqtMC6Nvg8)|:green_square: Easy| Matrix, Array|
|3|[Transpose of Matrix ](https://practice.geeksforgeeks.org/problems/transpose-of-matrix-1587115621/1)||[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Transpose%20of%20Matrix.pdf)|[Solution](https://youtu.be/n3-XWx-Inns)|:green_square: Easy| Matrix, Array|
|4|[Rotate by 90 degree ](https://practice.geeksforgeeks.org/problems/rotate-by-90-degree-1587115621/1)||[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Rotate%20by%2090%20degree.pdf)|[Solution](https://youtu.be/yIUryrv2I7I)|:green_square: Easy| Matrix, Array|
|5|[Multiply the matrices  ](https://practice.geeksforgeeks.org/problems/multiply-the-matrices-1587115620/1)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Multiply%20two%20matrices.cpp)|[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Multiply%20two%20matrices.pdf)|[Solution](https://youtu.be/DvG9SF2VXL4)|:green_square: Easy| Matrix, Array|
|6|[ Spirally traversing a matrix  ](https://practice.geeksforgeeks.org/problems/spirally-traversing-a-matrix-1587115621/1)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Spirally%20traversing%20a%20matrix.cpp)|[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Spirally%20traversing%20a%20matrix%20.pdf)|[Solution](https://youtu.be/4mSTiSBk_iY)|:orange_square: Medium| Matrix, Array|
|7|[ Interchanging the rows of a Matrix   ](https://practice.geeksforgeeks.org/problems/reversing-the-rows-of-a-matrix-1587115621/1)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Interchanging%20the%20rows%20of%20a%20Matrix.cpp)|[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Interchanging%20The%20Rows%20of%20a%20Matrix.pdf)|[Solution](https://youtu.be/72UDspLEZAg)|:green_square: Easy| Matrix, Array|
|8|[ Matrix Interchange ](https://practice.geeksforgeeks.org/problems/matrix-interchange/1)||| Practice |:green_square: Easy| Matrix, Array|
|9|[ Search in a row-column sorted Matrix   ](https://practice.geeksforgeeks.org/problems/search-in-a-matrix-1587115621/1)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Search%20in%20a%20row-column%20sorted%20Matrix.cpp)|[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Search%20in%20a%20row-column%20sorted%20Matrix.pdf)|[Solution](https://youtu.be/Gy0WeuIuTg4)|:orange_square: Medium| Matrix, Array|
|10|[ Boolean Matrix   ](https://practice.geeksforgeeks.org/problems/boolean-matrix-problem-1587115620/1)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Boolean%20Matrix.cpp)|[Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Boolean%20Matrix.pdf)|[Solution](https://youtu.be/TBTNZXzwpP8)|:orange_square: Medium| Matrix, Array|



## Hashing

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1|What is Hashing Data structure|| [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Tree/Hashing%20in%20Data%20Structure.pdf)|[Theory](https://youtu.be/AV36hu5TFRQ)|:green_square: Easy|Hashing|
|2|Code of Hashing in c++| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Tree/code%20of%20Hashing%20in%20C++.cpp) | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Tree/code%20of%20Hashing%20in%20C%2B%2B.pdf)|[Solution](https://youtu.be/G87TuBjByts)|:green_square: Easy|Hashing|
|3|Direct Access Table| | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/what%20is%20hashing%20data%20structure%20and%20direct%20access%20table.pdf)|[Theory](https://youtu.be/6qjOspk0Yg0)|:green_square: Easy|Hash|
|4|What is Hash Function and collision| | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/collision%20in%20hashing%20data%20structure.pdf)|[Theory](https://youtu.be/oLR9Zf8JSUI)|:green_square: Easy|Hash|
|5|What is chaining in collision handling| | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/what%20is%20hashing%20data%20structure%20and%20direct%20access%20table.pdf)|[Theory](https://youtu.be/ER03smJIVFE)|:green_square: Easy|Hashing|
|6|What is unordered_set| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/unordered_set.cpp) | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/unordered_set.pdf)|[Theory](https://youtu.be/EMvLygYr6Gg)|:green_square: Easy|Hash|
|7|What is unordered_map| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/unordered_map.cpp) | [GFG](https://www.geeksforgeeks.org/unordered_map-in-cpp-stl/)|[Theory](https://youtu.be/Uv0kd7mM0ts)|:green_square: Easy|Hash|
|8|[Non Repeating Element](https://practice.geeksforgeeks.org/problems/non-repeating-element3958/1)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Non-Repeating%20Element.cpp) | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Non-Repeating%20Element.pdf)|[Solution](https://youtu.be/KpjXziZMHwI)|:green_square: Easy|Hashing|
|9|[First Repeating Element](https://practice.geeksforgeeks.org/problems/first-repeating-element4018/1)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/First%20Repeating%20Element.cpp) | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/First%20Repeating%20Element.pdf)|[Solution](https://youtu.be/n5-uvGlhcCI)|:green_square: Easy|Hashing|
|10|[Union of two arrays ](https://practice.geeksforgeeks.org/problems/union-of-two-arrays3538/1)| | | Practice |:green_square: Easy|Hashing|
|11|[Intersection of Two Arrays](https://practice.geeksforgeeks.org/problems/intersection-of-two-arrays2404/1)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Intersection%20of%20two%20arrays.cpp) | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Intersection%20of%20two%20arrays.pdf)|[Solution](https://youtu.be/zgLtdM8-6CE)|:green_square: Easy|unordered_set|
|12|[Key Pair](https://practice.geeksforgeeks.org/problems/key-pair5616/1)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Key%20Pair.cpp) | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Key%20Pair.pdf)|[Solution](https://youtu.be/7xx1YcXXEYU)|:green_square: Easy|unordered_map|
|13|[Subarray with sum 0](https://practice.geeksforgeeks.org/problems/subarray-with-0-sum-1587115621/1)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Subarray%20with%200%20sum.cpp) | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Subarray%20with%200%20sum.pdf)|[Solution](https://youtu.be/8inhayLCCHs)|:orange_square: Medium |unordered_set|
|14|[Winner of an election ](https://practice.geeksforgeeks.org/problems/winner-of-an-election-where-votes-are-represented-as-candidate-names-1587115621/1)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Winner%20of%20an%20election.cpp) | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Winner%20of%20an%20election%20.pdf)|[Solution](https://youtu.be/GySYmmehLM0)|:green_square: Easy |unordered_map |
|15|[Pairs with Positive Negative values](https://practice.geeksforgeeks.org/problems/pairs-with-positive-negative-values3719/1)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Pairs%20with%20Positive%20Negative%20values.cpp) | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Pairs%20with%20Positive%20Negative%20values%20.pdf)|[Solution](https://youtu.be/hCGUty76A6M)|:green_square: Easy |map, Vector |
|16|[Print Anagrams Together  ](https://practice.geeksforgeeks.org/problems/print-anagrams-together/1) / [Group Anagrams](https://leetcode.com/problems/group-anagrams/)| [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Group%20Anagrams.cpp) | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Group%20Anagrams.pdf) |[Solution](https://youtu.be/zX9k1XvVUXI) |:orange_square: Medium |unordered_map, string |
|17|[Relative Sort Array](https://leetcode.com/problems/relative-sort-array/) / [Sort an array according to the other ](https://practice.geeksforgeeks.org/problems/relative-sorting4323/1) | [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Relative%20Sort%20Array.cpp) | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Relative%20Sort%20Array.pdf)|[Solution](https://youtu.be/bNuMPAuQN4g)|:orange_square: Medium |Map| 
|18|[Custom Sort String ](https://leetcode.com/problems/custom-sort-string/)|  [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Custom%20Sort%20String.cpp) | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Custom%20Sort%20String.pdf) | [Solution](https://youtu.be/z4KYZGv7L-I) |:orange_square: Medium | map |
|19|[Sort Array by Increasing Frequency ](https://leetcode.com/problems/sort-array-by-increasing-frequency/)|  [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Sort%20Array%20by%20Increasing%20Frequency.cpp) | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Hashing/Sort%20Array%20by%20Increasing%20Frequency.pdf) | [Solution](https://youtu.be/PjKjbpI2Z3s) |:green_square: Easy | map, Lambda |
|20|[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)|  | | Practice |:orange_square: Medium | map |



## String

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1| Naive Pattern Search | | | [Important](https://youtu.be/_ZWnkyae2gA) | :green_square: Easy | Pattern |
|2| [Implement strStr()](https://leetcode.com/problems/implement-strstr/) | [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Naive%20Pattern%20Search.cpp) | [pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Naive%20Pattern%20Search%20:%20Implement%20strStr()%20.pdf) | | :green_square: Easy | Pattern |
|3| [Binary String ](https://practice.geeksforgeeks.org/problems/binary-string-1587115620/1) | | | | :green_square: Easy | string |
|4| [Anagram ](https://practice.geeksforgeeks.org/problems/anagram-1587115620/1) | | | | :green_square: Easy | string |
|5| [Check if string is rotated by two places ](https://practice.geeksforgeeks.org/problems/check-if-string-is-rotated-by-two-places-1587115620/1) | | | | :green_square: Easy | string |
|6| [Check if strings are rotations of each other or not ](https://practice.geeksforgeeks.org/problems/check-if-strings-are-rotations-of-each-other-or-not-1587115620/1) | | | | :green_square: Easy | string |
|7| [Isomorphic Strings ](https://practice.geeksforgeeks.org/problems/isomorphic-strings-1587115620/1) | | | | :green_square: Easy | string |
|8| [Check if a string is Isogram or not ](https://practice.geeksforgeeks.org/problems/check-if-a-string-is-isogram-or-not-1587115620/1) | | | | :green_square: Easy | string |
|9| [Keypad typing ](https://practice.geeksforgeeks.org/problems/keypad-typing0119/1) | | | | :green_square: Easy | string |
|10| [Repeated Character ](https://practice.geeksforgeeks.org/problems/repeated-character2058/1) | | | | :green_square: Easy | string |
|11| [ Non Repeating Character ](https://practice.geeksforgeeks.org/problems/non-repeating-character-1587115620/1) | [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Non%20Repeating%20Character.cpp) | | [solution](https://youtu.be/MN37co8M37g) | :orange_square: Medium | string |
|12| [  Maximum Occuring Character  ](https://practice.geeksforgeeks.org/problems/maximum-occuring-character-1587115620/1) | | |  | :green_square: Easy | string |
|13| [  Remove common characters and concatenate  ](https://practice.geeksforgeeks.org/problems/remove-common-characters-and-concatenate-1587115621/1) | | |  | :green_square: Easy | string |
|14| [  Reverse words in a given string  ](https://practice.geeksforgeeks.org/problems/reverse-words-in-a-given-string5459/1) | | |  | :green_square: Easy | string |
|15| [ Sum of numbers in string  ](https://practice.geeksforgeeks.org/problems/sum-of-numbers-in-string-1587115621/1) | [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/sum%20of%20numbers%20in%20string.cpp)| [pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/sum%20of%20numbers%20in%20string.pdf) | [solution](https://youtu.be/XdbGdoTf3Fs) | :orange_square: Medium | string |
|16| [  Pangram Checking   ](https://practice.geeksforgeeks.org/problems/pangram-checking-1587115620/1) | | |  | :green_square: Easy | string |
|17| [ Minimum indexed character ](https://practice.geeksforgeeks.org/problems/minimum-indexed-character-1587115620/1) | | |  | :green_square: Easy | string |
|18| [ Smallest window in a string containing all the characters of another string ](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string-1587115621/1) | | |  | :orange_square: Medium | string |
|19| [ Nth number made of prime digits ](https://practice.geeksforgeeks.org/problems/nth-number-made-of-prime-digits4319/1) | | |  | :green_square: Easy | Prime, string |




## Linked List

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1| Introduction to Linked list Playlist c++ |||[Theory](https://youtu.be/rrPsVNwvfxg)|:green_square: Easy|Linked List|
|2| Data structures Competitive Programming |||[Theory](https://youtu.be/zwjLygQPBb0)|:green_square: Easy|DSA|
|3| Arrays in Data Structures |||[Theory](https://youtu.be/vPfD_50rwog)|:green_square: Easy|Arrays|
|4| Pointers in C++ with code Practice |||[Theory](https://youtu.be/-x0QnooY6O8)|:green_square: Easy|Pointers|
|5| Struct in c++ |||[Theory](https://youtu.be/PLivrxyXTMc)|:green_square: Easy|Struct|





## Stack

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1| What is stack | |[GFG Link](https://www.geeksforgeeks.org/stack-data-structure-introduction-program/)|[Solution](https://youtu.be/cppd9DhKHYc)|:green_square: Easy| Stack, Array|
|2| [Implement stack using array](https://practice.geeksforgeeks.org/problems/implement-stack-using-array/1) | | | |:green_square: Easy| Stack, Array|
|3| [Implement Stack using Linked List ](https://practice.geeksforgeeks.org/problems/implement-stack-using-linked-list/1) | | | |:green_square: Easy| Stack, Linked List|
|4| [Implement Stack using Linked List ](https://practice.geeksforgeeks.org/problems/implement-stack-using-linked-list/1) | | | |:green_square: Easy| Stack, Linked List|
|5| [Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/) | | | |:green_square: Easy| Stack, string|
|6| [Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/) | | | |:orange_square: Medium| Stack, string|
|7| [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | | | |:green_square: Easy| Stack, string|
|8| [Implement two stacks in an array](https://practice.geeksforgeeks.org/problems/implement-two-stacks-in-an-array/1) | | | |:green_square: Easy| Stack, Array|
|9| [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | | | |:green_square: Easy| Stack, string|
|10| [Get min at pop ](https://practice.geeksforgeeks.org/problems/get-min-at-pop/1/) | | | |:green_square: Easy| Stack, Array|
|11| [Min Stack](https://leetcode.com/problems/min-stack/) | | | |:green_square: Easy| Stack, Array|
|12| [Delete middle element of a stack ](https://practice.geeksforgeeks.org/problems/delete-middle-element-of-a-stack/1) | | | |:green_square: Easy| Stack, STL|
|13| [Infix to Postfix](https://practice.geeksforgeeks.org/problems/infix-to-postfix-1587115620/1) | | | |:green_square: Easy| Stack |
|14| [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) | | | |:orange_square: Medium| Stack, Evaluation of Postfix Expression|
|15| [Online Stock Span](https://leetcode.com/problems/online-stock-span/) | | | |:orange_square: Medium| Stack, Stock span problem |
|16| [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii/) | | | |:orange_square: Medium| Stack, Array |
|17| [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/) | | | |:red_square: Hard| Stack, Array |
|18| [The Celebrity Problem ](https://practice.geeksforgeeks.org/problems/the-celebrity-problem/1/) | | | |:orange_square: Medium| Stack, Array |


## Queue

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1| What is Queue | |[GFG Link](https://www.geeksforgeeks.org/queue-set-1introduction-and-array-implementation/)|[Solution](https://youtu.be/f-7SBV09Ots)|:green_square: Easy| Queue, STL|
|2| [Implement Queue using array ](https://practice.geeksforgeeks.org/problems/implement-queue-using-array/1) | | | |:green_square: Easy| Queue, Array|
|3| [Implement Queue using Linked List](https://practice.geeksforgeeks.org/problems/implement-queue-using-linked-list/1) | | [Scaler Topics Link](https://www.scaler.com/topics/c/implementation-of-queue-using-linked-list/) | |:green_square: Easy| Queue, Linked List|
|4| [Queue Reversal](https://practice.geeksforgeeks.org/problems/queue-reversal/1/) | | | |:green_square: Easy| Queue, Stack|
|5| [Queue using two Stacks](https://practice.geeksforgeeks.org/problems/queue-using-two-stacks/1) | | | |:green_square: Easy| Queue, Stack|
|6| [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/) | | | |:green_square: Easy| Stack, Queue|
|7| [Stack using two queues](https://practice.geeksforgeeks.org/problems/stack-using-two-queues/1) | | | |:green_square: Easy| Stack, Queue|
|8| [Generate Binary Numbers](https://practice.geeksforgeeks.org/problems/generate-binary-numbers-1587115620/1) | | | |:green_square: Easy| Queue |
|9| [Reverse First K elements of Queue](https://practice.geeksforgeeks.org/problems/reverse-first-k-elements-of-queue/1) | | | |:green_square: Easy| Queue, Stack|
|10| [Circular tour](https://practice.geeksforgeeks.org/problems/circular-tour-1587115620/1) | | | |:orange_square: Medium| Queue, Sliding window|




## Tree


|  #  |      Question     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1| What is Tree | | [pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Tree/Tree%20data_structure.pdf) | [Solution1](https://youtu.be/nbgtyBKn2tI), [solution2](https://youtu.be/9Z87SnIua8I) | :green_square: Easy | Tree, Theory | 
|2| What is Binary tree | | [pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Tree/Binary_tree.pdf) | [solution](https://youtu.be/cS5XtSXm6fw) | :green_square: Easy | Tree, Binary Tree |
|3| How to code binary tree | [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Tree/Binary_tree.cpp) | | [Solution](https://youtu.be/r7ytFtYaFV0)| :green_square: Easy | Tree, Code |
|4| Properties of Binary tree | | [pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Tree/properties%20of%20Binary%20tree.pdf) | [solution](https://youtu.be/bu1xCi6izdA)| :green_square: Easy | Tree, Node|
|5| Types of Binary tree | | [pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Tree/Types%20of%20Binary%20Tree.pdf)| [solution](https://youtu.be/NUMEZO-BziM)| :green_square: Easy | Binary Tree|
|6| Tree Traversal | | [pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Tree/Tree%20traversal%20data_structure.pdf) | [solution1](https://youtu.be/oTA58OYsO5A), [solution2](https://youtu.be/XZPCADenpWY)| :green_square: Easy | Traversal, Inorder|
|7| Code of Inorder Traversal | [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Tree/Code%20of%20Inorder%20Traversal.cpp) | [pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Tree/Code%20of%20Inorder%20Traversal.pdf) | [solution](https://youtu.be/EswF52mFtmo)| :green_square: Easy | Inorder Traversal |
|8| Code of Preorder and Postorder | [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Tree/code%20of%20preorer%20and%20Postorder%20traversal.cpp)| | [Solution](https://youtu.be/hgmC_ss13yQ)| :green_square: Easy | Preorder, Postorder |
|9| [Binary Tree Inorder Traversal ](https://leetcode.com/problems/binary-tree-inorder-traversal/) | [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Tree/Binary%20Tree%20Inorder%20Traversal.cpp) | | [Solution](https://youtu.be/pnVw3yo-3Kg) | :green_square: Easy | Recursion, Tree |
|10| [Binary Tree Preorder Traversal ](https://leetcode.com/problems/binary-tree-preorder-traversal/) | | | Practice | :green_square: Easy | Recursion, Tree |
|11| [Binary Tree Postorder Traversal ](https://leetcode.com/problems/binary-tree-postorder-traversal/) | | | Practice | :green_square: Easy | Recursion, Tree |
|12| [Same Tree](https://leetcode.com/problems/same-tree/) |[c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Tree/same%20Tree.cpp) | | [Solution](https://youtu.be/3104dX4_zwI) | :green_square: Easy | Tree Traversal |
|13| [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Tree/Maximum%20Depth%20of%20Binary%20Tree.cpp) | | [Solution](https://youtu.be/u9gLZIlomn4) | :orange_square: Medium | Recursion, Tree |
|14| [Children Sum Parent ](https://practice.geeksforgeeks.org/problems/children-sum-parent/1/) | [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Tree/Children%20Sum%20Parent.cpp) | | [Solution](https://youtu.be/vv2hUDCnKP0) | :green_square: Easy | Recursion, Tree |
|15| [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Tree/Level%20Order%20Traversal.cpp) | | [Solution](https://youtu.be/me7AXvWv4jc) | :orange_square: Medium | Queue, Tree |
|16| [Level order traversal Line by Line](https://practice.geeksforgeeks.org/problems/level-order-traversal-line-by-line/1/) | | | Practice | :green_square: Easy | stack, Tree |
|17| [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/) | [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Tree/Binary%20Tree%20Zigzag%20Level%20Order%20Traversal.cpp) |  | [Solution](https://youtu.be/pgc-Mo_1E58) | :orange_square: Medium | Queue, Tree |
|18| [Maximum Width of Tree](https://practice.geeksforgeeks.org/problems/maximum-width-of-tree/1) | | |  | :green_square: Easy | Tree |
|19| [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | [c++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Tree/Balanced%20Binary%20Tree.cpp) | | [Solution](https://www.youtube.com/watch?v=gkssX4evzkM&t=1s) | :green_square: Easy | Tree |
|20| [Left View of Binary Tree](https://practice.geeksforgeeks.org/problems/left-view-of-binary-tree/1) | | |  | :green_square: Easy | Tree |
|21| [Right View of Binary Tree ](https://practice.geeksforgeeks.org/problems/right-view-of-binary-tree/1) | | |  | :green_square: Easy | Tree |
|22| [Lowest Common Ancestor in a Binary Tree ](https://practice.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-binary-tree/1/) | | |  | :orange_square: Medium | Tree |
|23| [Diameter of Binary Tree](https://practice.geeksforgeeks.org/problems/diameter-of-binary-tree/1/) | | |  | :green_square: Easy | Tree |
|24| [Vertical Width of a Binary Tree](https://practice.geeksforgeeks.org/problems/vertical-width-of-a-binary-tree/1/) | | |  | :green_square: Easy | Tree |
|25| [Mirror Tree ](https://practice.geeksforgeeks.org/problems/mirror-tree/1/) | | |  | :green_square: Easy | Tree |
|26| [Check if subtree ](https://practice.geeksforgeeks.org/problems/check-if-subtree/1/) | | |  | :orange_square: Medium | Tree |
|27| [Make Binary Tree From Linked List ](https://practice.geeksforgeeks.org/problems/make-binary-tree/1) | | |  | :orange_square: Medium | Tree |



## Binary Search Tree

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1| [Inorder traversal of a BST  ](https://practice.geeksforgeeks.org/problems/inorder-traversal-of-a-bst/1/) | | | | :green_square: Easy | BST, Tree |
|2| [Search in a Binary Search Tree ](https://leetcode.com/problems/search-in-a-binary-search-tree/) | | | | :green_square: Easy | BST, Tree |



## Heap

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1| [Heap sort](https://practice.geeksforgeeks.org/problems/heap-sort/1) | | | [Solution](https://youtu.be/79KoeErdQtk) | :green_square: Easy | Heap Basic |
|2| [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | | | [Solution](https://youtu.be/g5mmW0GOTx8) | :green_square: Easy | Heap Basic |
|3| [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/) | | | [Solution](https://youtu.be/8HR8Ak5zuus) | :green_square: Easy | Heap Basic |
|4| [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | | | [Solution](https://youtu.be/3YFFqwzxosU) | :green_square: Easy | Heap Basic |
|5| [Minimum Cost of ropes](https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes-1587115620/1) | | | [Solution](https://youtu.be/mRtq1ucnjJg) | :green_square: Easy | Heap Basic |
|6| [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements/) | | | [Solution](https://youtu.be/Of4bdCDwcdY) | :orange_square: Medium | Heap Medium |
|7| [Merge k Sorted Arrays](https://practice.geeksforgeeks.org/problems/merge-k-sorted-arrays/1) | | | [Solution](https://youtu.be/l8CuET0jlDU) | :orange_square: Medium | Heap Medium |
|8| [Find median in a stream](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream-1587115620/1) | | | [Solution](https://youtu.be/cjQNm2eS6Lw) | :red_square: Hard | Heap Hard |



## Graph

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1| Graph Introduction | | | [Solution](https://youtu.be/Y_0-AmbC0Ig) | :green_square: Easy | Graph Theory |
|2| Adjacency Matrix in graph | | | [Solution](https://youtu.be/9MdpJuYliQM) | :green_square: Easy | Graph Basic |
|3| Adjacency List in graph | | | [Solution](https://youtu.be/Ysh31pZqIQs) | :green_square: Easy | Graph |
|4| How to code graph | | | [Solution](https://youtu.be/MjOwemGFoR8) |   :green_square: Easy | Graph |
|5| BFS Of Graph | | | [Solution](https://youtu.be/pQTbrRhuWXI) | :green_square: Easy | Graph Theory |
|6| [Find If Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph/) | [C++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Graph/Find%20if%20Path%20Exists%20in%20Graph.cpp) | | [Solution](https://youtu.be/QC4bDHEnmLM) | :green_square: Easy | Graph BFS |
|7| [Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/) | [C++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Graph/Find%20the%20Town%20Judge.cpp) | | [Solution](https://youtu.be/V_MPL5O-hDw) | :green_square: Easy | Graph BFS |
|8| DFS Of Graph | | | [Solution](https://youtu.be/7jDCxMQW1GA) | :green_square: Easy | Graph Theory |
|9| [Number of Islands](https://leetcode.com/problems/number-of-islands/) | [C++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Graph/Number%20of%20Islands.cpp) | | [Solution](https://youtu.be/UbzHYtUwKOY) | :orange_square: Medium | Graph DFS |
|10| [Flood Fill](https://leetcode.com/problems/flood-fill/) | [C++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Graph/Flood%20Fill.cpp) | | [Solution](https://youtu.be/7aikf56h9Gs) | :green_square: Easy | Graph Theory |
|11| Detect cycle in undirected graph | | | [Solution](https://youtu.be/KPLn9DjwpW4) | :green_square: Easy | Graph |
|12| [Topological sort (Kahn's BFS)](https://practice.geeksforgeeks.org/problems/topological-sort/1) | [C++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Graph/Topological%20sort%20.cpp) | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Graph/Topological%20sort.pdf) | [Solution](https://youtu.be/X7VdEG51__E) | :green_square: Easy | Graph |
|13| [Topological sort using DFS](https://practice.geeksforgeeks.org/problems/topological-sort/1) | [C++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Graph/Topological%20sort%20using%20dfs.cpp) | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Graph/Topological%20sort%20using%20dfs.pdf) | [Solution](https://youtu.be/tv8yJLKOZ0g) | :orange_square: Medium | Graph DFS |
|14| [Detect Cycle in a Directed Graph](https://practice.geeksforgeeks.org/problems/detect-cycle-in-a-directed-graph/1) | [C++](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Graph/Detect%20cycle%20in%20a%20directed%20graph.cpp) | [Pdf](https://github.com/Prince-1501/Hello_world-Competiitve-Programming/blob/master/Leetcode/Graph/Detect%20cycle%20in%20a%20directed%20graph.pdf) | [Solution](https://youtu.be/TL9oORCqHe8) | :orange_square: Medium | Graph GFG |






## Greedy

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1|



## Backtracking

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1|


## Dynamic Programming

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1| [Fibonacci Numbers - Top Down DP](https://practice.geeksforgeeks.org/problems/fibonacci-numbers-top-down-dp/1) | | |  | :green_square: Easy | Recursion |


## Trie

|  #  |      Title     |   Code   |    Document   |  Video  | Difficulty  | Tag                   
|-----|----------------|----------|---------------|---------|-------------|--------
|1| [Insert and Search](https://practice.geeksforgeeks.org/problems/trie-insert-and-search0651/1) | | |  | :orange_square: Medium | Trie |


<br>
<br>
<br>


## 📘&nbsp; License

The Whole content management system is released under the under terms of the [MIT License](LICENSE).


## Connect with us  ~Prince

<a href="https://telegram.me/helloworldbyprince" target="_blank"><img src="https://github.com/Prince-1501/Complete-DSA-Preparation/blob/main/img/telegram.png" alt="telegram" width="60"/></a>
<a href="https://www.linkedin.com/in/iamprince/" target="_blank"><img src="https://github.com/Prince-1501/Complete-DSA-Preparation/blob/main/img/linkedin.png" alt="Linkedin" width="60"/></a>
<a href="https://www.youtube.com/c/HelloWorldbyprince/" target="_blank"><img src="https://github.com/Prince-1501/Complete-DSA-Preparation/blob/main/img/youtube.png" alt="youtube" width="85"/></a>

***Do star, fork and share the repo to show your support, it would help others too!***   <br>
 <br>
 Let me know your views on the repository or any changes or improvements at ***[LinkedIn](https://www.linkedin.com/in/iamprince/)***, ***[Telegram](https://telegram.me/helloworldbyprince)***
 
 :heart: ***Thank you all for Forking this repository***  :heart:

