hacktoberfest2020

ADVANCED DSA in C++

Various complex DSA problems solved with ease with brief approach !

1. dyanamic programming solved using both the Memoized version(top down approach) and Tabulation version(bottom up approach)

2. Graph problems using the dfs and bfs approach mainly like frog positions arter t seconds and number of islands

3. priority queue which is basically the min/max heap solved a Hard leetcode problem sliding window median problem with brief approach

4. segment tree solved problem segment tree for the sum

5. Trie

6. Sweepline solved leetcode my calander problem