नमस्ते (Namaste)🙏🏻, I'm a Software Developer!

Software Engineer at Policybazaar.com

DSA

About Repo:

serial: 0.0(chapter priority. topic of topic priority)

Topics:

Plans:

find resource(video channel, book, website,) for theory better than karumanchi find a resource so that we can compare this repo to google microsoft amazon interview rounds(including dsa and systemsdesign)

  array m and hash m subarray ka topic could be more improved check and update
  
  GFG status: 
        array: easy med hard
        string: med hard
        tree: med hard
        matrix: easy med hard
        queue: med hard
        stack: med hard
        recursion: med hard
        LL: med hard
        heap: easy med hard
        sorting: eay med hard
        hashing: med hard
        DP: easy med
        graph easy med hard 

immp links: https://www.geeksforgeeks.org/difference-between-np-hard-and-np-complete-problem/

Why DFS can't be used for shortest distance on graph, but works on tree https://codeforces.com/blog/entry/16479

reccurence relation https://www.youtube.com/watch?v=4V30R3I1vLI

License This repository is released under the MIT license. In short, this means you are free to use this software in any personal, open-source or commercial projects. Attribution is optional but appreciated.