# Data Structures & Algorithms
[](https://GitHub.com/Naereen/StrapDown.js/graphs/contributors/)
[](https://GitHub.com/Naereen/StrapDown.js/issues/)
[](http://hits.dwyl.io/Naereen/badges)
Data Structures & Algorithms
#### DS & ALgo Practice... mostyl in Javascript
Table of Contents
- [Data Structures & Algorithms](#data-structures--algorithms)
- [Algorithms](#algorithms)
- [Books](#books)
- [Coding practice](#coding-practice)
- [Guides](#guides)
- [Misc](#misc)
- [Guides](#guides-1)
- [Articles](#articles)
- [Courses](#courses)
- [Mock interviews](#mock-interviews)
- [Q&A](#qa)
- [Sites](#sites)
- [Videos](#videos)
- [Languages and technologies](#languages-and-technologies)
- [JavaScript](#javascript)
- [Node](#node)
- [PHP](#php)
- [Python](#python)
- [React](#react)
- [Math](#math)
- [Networking](#networking)
- [System design](#system-design)
- [Resource Repos](#resource-repos)
- [MISC](#misc-1)
## Getting Started
To get a local copy up and running follow these simple steps.
### Prerequisites
This is an example of how to list things you need to use the software and how to install them.
* npm
```sh
npm install npm@latest -g
```
### Installation
1. Clone the repo
```sh
git clone https://github.com/github_username/repo_name.git
```
2. Install NPM packages
```sh
npm install
```
## Usage
Use this space to show useful examples of how a project can be used. Additional screenshots, code examples and demos work well in this space. You may also link to more resources.
_For more examples, please refer to the [Documentation](https://example.com)_
## Contributing
Contributions are what make the open source community such an amazing place to be learn, inspire, and create. Any contributions you make are **greatly appreciated**.
1. Fork the Project
2. Create your Feature Branch (`git checkout -b feature/AmazingFeature`)
3. Commit your Changes (`git commit -m 'Add some AmazingFeature'`)
4. Push to the Branch (`git push origin feature/AmazingFeature`)
5. Open a Pull Request
## License
Distributed under the MIT License. See `LICENSE` for more information.
# Contact
### _Email_
[bryan.guner@gmail.com](#)
### _Phone_
*551-254-5505*
### Social
- [GitHub](https://github.com/bgoonz)
- [Gitlab](https://gitlab.com/bryan.guner.dev)
- [Bitbucket](https://bitbucket.org/bgoonz/)
- [code pen](https://codepen.io/bgoonz)
- [Glitch](https://glitch.com/@bgoonz)
- [Instagram](https://www.instagram.com/bgoonz/)
- [LinkedIn](https://www.linkedin.com/in/bryan-guner-046199128/)
- [Replit](https://repl.it/@bgoonz/)
- [Redit](https://www.reddit.com/user/bgoonz1)
- [runkit](https://runkit.com/bgoonz)
- [stack-exchange](https://meta.stackexchange.com/users/936785/bryan-guner)
- [Netlify](https://app.netlify.com/user/settings#profile)
[contributors-shield]: https://img.shields.io/github/contributors/github_username/repo.svg?style=for-the-badge
[contributors-url]: https://github.com/github_username/repo/graphs/contributors
[forks-shield]: https://img.shields.io/github/forks/github_username/repo.svg?style=for-the-badge
[forks-url]: https://github.com/github_username/repo/network/members
[stars-shield]: https://img.shields.io/github/stars/github_username/repo.svg?style=for-the-badge
[stars-url]: https://github.com/github_username/repo/stargazers
[issues-shield]: https://img.shields.io/github/issues/github_username/repo.svg?style=for-the-badge
[issues-url]: https://github.com/github_username/repo/issues
[license-shield]: https://img.shields.io/github/license/github_username/repo.svg?style=for-the-badge
[license-url]: https://github.com/github_username/repo/blob/master/LICENSE.txt
[linkedin-shield]: https://img.shields.io/badge/-LinkedIn-black.svg?style=for-the-badge&logo=linkedin&colorB=555
[linkedin-url]: https://linkedin.com/in/github_username
------
# Resources!
------
## Algorithms
### Books
* Steven Skiena – [The Algorithm Design Manual](http://www.algorist.com/)
* Udi Manber – [Introduction to Algorithms: A Creative Approach](https://www.amazon.com/Introduction-Algorithms-Creative-Udi-Manber/dp/0201120372)
* Cormen, Leiserson, Rivest, Stein – [Introduction to Algorithms](https://mitpress.mit.edu/books/introduction-algorithms)
* Sedgewick, Wayne – [Algorithms](http://algs4.cs.princeton.edu/home/)
* Antti Laaksonen – [Competitive Programmer's Handbook](https://cses.fi/book.html)
* Steven & Felix Halim – [Competitive Programming](https://cpbook.net/)
* Jon Bentley – [Programming Pearls](http://www.wou.edu/~jcm/Spring-P-2015/Programming%20Pearls%20(2nd%20Ed)%20Bentley.pdf)
* [E-Maxx Algorithms](https://e-maxx-eng.appspot.com/)
* [Original [RU]](https://e-maxx.ru/algo/)
* [vhf/free-programming-books](https://github.com/vhf/free-programming-books)
* [it-ebooks.info](http://it-ebooks.info/)
* S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani -[Algorithms](http://algorithmics.lsi.upc.edu/docs/Dasgupta-Papadimitriou-Vazirani.pdf)
### Coding practice
* [LeetCode](https://leetcode.com/)
* LeetCode w/ Explanations [labuladong/fucking-algorithm](https://github.com/labuladong/fucking-algorithm/tree/english)
* [InterviewBit](https://www.interviewbit.com/)
* [Codility](https://codility.com/)
* [HackerRank](https://www.hackerrank.com/)
* [Project Euler](https://projecteuler.net/)
* [Spoj](https://spoj.com/)
* [Google Code Jam practice problems](https://code.google.com/codejam/contests.html)
* [HackerEarth](https://www.hackerearth.com/)
* [Top Coder](https://www.topcoder.com/)
* [CodeChef](https://www.codechef.com/)
* [Codewars](https://www.codewars.com/)
* [CodeSignal](https://codesignal.com)
* [CodeKata](http://codekata.com/)
* [Firecode](https://www.firecode.io/)
### Guides
* [GeeksForGeeks – A CS portal for geeks](http://www.geeksforgeeks.org/)
* [Learneroo – Algorithms](https://www.learneroo.com/subjects/8)
* [Top Coder tutorials](http://www.topcoder.com/tc?d1=tutorials&d2=alg_index&module=Static)
* [Infoarena training path](http://www.infoarena.ro/training-path) (RO)
* Steven & Felix Halim – [Increasing the Lower Bound of Programming Contests](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=118) (UVA Online Judge)
### Misc
* [Top 10 Algorithms in Interview Questions](http://www.geeksforgeeks.org/top-10-algorithms-in-interview-questions/)
* [Hard interview questions that have a short recursive solution](https://www.quora.com/What-are-some-of-the-hardest-programming-questions-asked-during-an-interview-from-Google-Facebook-Microsoft-Amazon-Quora-Linkedin-Apple-Yahoo-etc-that-can-be-coded-in-a-few-lines-with-a-recursive-solution)
* [Grow Your Technical Skills with Google](https://techdevguide.withgoogle.com/)
## Guides
### Articles
* Steve Yegge – [Get That Job at Google](http://steve-yegge.blogspot.co.uk/2008/03/get-that-job-at-google.html)
* Steve Yegge – [Ten Tips for a (Slightly) Less Awful Resume](http://steve-yegge.blogspot.co.uk/2007_09_01_archive.html)
* Carlos Bueno – [Get That Job at Facebook](https://www.facebook.com/notes/10150964382448920)
* Daniel Blumenthal – [How to Prepare for Technical Interviews](http://dandreamsofcoding.com/2012/11/25/how-to-prepare-for-technical-interviews/)
* David Byttow – [ABC: Always Be Coding](https://medium.com/tech-talk/d5f8051afce2)
* David Byttow – [Four Steps to Google, Without a Degree](https://medium.com/this-happened-to-me/8f381aa6bd5e)
* Thomas L. Friedman – How to Get a Job at Google [[part 1](http://mobile.nytimes.com/2014/02/23/opinion/sunday/friedman-how-to-get-a-job-at-google.html)] [[part 2](http://mobile.nytimes.com/2014/04/20/opinion/sunday/friedman-how-to-get-a-job-at-google-part-2.html)]
* Andrew Rothbart – [Preparing for a technical interview with programming contests](https://www.facebook.com/notes/10151298476823920)
* Mina Azib – [Resources for Preparing for the Google Interview](http://itsallonesandzeroes.blogspot.ro/2013/07/prepping-for-google-interview.html)
* [u/RunninADorito](https://www.reddit.com/user/RunninADorito) – [How to Prepare for Tech Interviews](https://www.reddit.com/r/cscareerquestions/comments/1jov24/heres_how_to_prepare_for_tech_interviews/)
* Bill Sourour – [How To Win the Coding Interview](https://blog.devmastery.com/how-to-win-the-coding-interview-71ae7102d685)
* Ammon Bartram – [How To Pass a Programming Interview](http://blog.triplebyte.com/how-to-pass-a-programming-interview)
### Courses
* MIT – [Hacking a Google Interview](https://courses.csail.mit.edu/iap/interview/materials.php)
* [Algorithms: Design and Analysis](https://lagunita.stanford.edu/courses/course-v1:Engineering+Algorithms1+SelfPaced/about)
* [Algorithms and Data Structures - Part 1](https://www.pluralsight.com/courses/ads-part1)
* [Algorithms and Data Structures - Part 2](https://www.pluralsight.com/courses/ads2)
### Mock interviews
* [interviewing.io](https://interviewing.io/)
* [Pramp](https://www.pramp.com/) *"Practice coding interviews for free"*
* [Refdash](https://refdash.com/)
* [Gainlo](http://www.gainlo.co/)
* [Candidacy.io](https://www.candidacy.io/)
* [Skilled](https://www.skilledinc.com/)
* [Gainlo](http://www.gainlo.co/#!/)
### Q&A
* [How to prepare for my Google/Facebook interview if I have 6 months left?](http://www.quora.com/Career-Advice/What-are-the-ways-to-utilize-6-months-to-build-skill-set-to-get-into-Facebook-or-Google)
* [How should I prepare for my Google interview if I have 1 month left?](https://www.quora.com/Google-Interview-Questions/How-should-I-prepare-for-my-Google-interview-if-I-have-1-month-left)
* [What is the best advice for an engineering internship interview at Google or Facebook?](https://www.quora.com/What-is-the-best-advice-for-an-engineering-internship-interview-at-Google-or-Facebook)
* [What graph topics should I study in order to be adequately prepared for a Google Software Engineer interview?](https://www.quora.com/Google-Interview-Questions/What-graph-topics-should-I-study-in-order-to-be-adequately-prepared-for-a-Google-Software-Engineer-interview)
### Sites
* [Coding for Interviews](http://codingforinterviews.com/)
* [Career Cup](https://www.careercup.com/)
* [HiredInTech](https://www.hiredintech.com/)
* [Codela](https://www.codela.net/)
* [TestDome](https://www.testdome.com/)
* [FreeCodeCamp](https://www.freecodecamp.com/) *"Learn to code and help nonprofits"*
* [Dynamic Programming Practice Problems](https://people.cs.clemson.edu/~bcdean/dp_practice/)
* [Codility Lessons](https://app.codility.com/programmers/lessons/1-iterations/)
* [Introduction to Theoretical Computer Science](https://introtcs.org/)
### Videos
* [How to: Work at Google – Candidate Coaching Session for Technical Interviewing [45:45]](https://www.youtube.com/watch?v=oWbUtlUhwa8)
* Gayle McDowell – [Cracking the Coding Interview [1:14:24]](https://www.youtube.com/watch?v=rEJzOhC5ZtQ)
* Gayle McDowell - [Cracking the Coding Interview (examples) [9:05]](https://www.youtube.com/watch?v=aClxtDcdpsQ)
* [Google Recruiters Share Technical Interview Tips [31:06]](https://www.youtube.com/watch?v=qc1owf2-220)
* [Google Recruiters Share Non-Technical Interview Tips [28:23]](https://www.youtube.com/watch?v=DINxNbBOEoI)
* Moishe Lettvin – [What I Learned Doing 250 Interviews at Google [1:00:24]](https://www.youtube.com/watch?v=r8RxkpUvxK0)
* Sean Lee – [How to Get a Job at the Big 4 [42:34]](https://www.youtube.com/watch?v=YJZCUhxNCv8)
* Ladies Storm Hackathons – [Interview Prep Round 1: Strings, Arrays, Linked Lists [1:12:39]](https://www.youtube.com/watch?v=fIpliB-ton8)
* Randall Koutnik – [Rethinking the Developer Career Path [25:03]](https://www.youtube.com/watch?v=yIPbE7BssOs)
---
### JavaScript
* [Free books by Dr. Axel Rauschmayer](http://exploringjs.com/)
* [You Don't Know JS](https://github.com/getify/You-Dont-Know-JS)
* [Superhero.js](http://superherojs.com/)
* [h5bp/Front-end-Developer-Interview-Questions](https://github.com/h5bp/Front-end-Developer-Interview-Questions)
### Node
* [Node.js Best Practices and Tips](https://www.toptal.com/nodejs/tips-and-practices)
* [Node.js Interview - Guide](https://elemefe.github.io/node-interview/#/sections/en-us/?id=guide)
### PHP
* [PHP The Right Way](http://www.phptherightway.com)
### Python
* [The Hitchhiker's Guide to Python](http://docs.python-guide.org/en/latest/)
* [quantifiedcode/python-anti-patterns](https://github.com/quantifiedcode/python-anti-patterns)
* [The Insider's Guide to Python Interviewing](http://www.toptal.com/python#hiring-guide)
* Book: [Elements of Programming Interviews in Python](http://elementsofprogramminginterviews.com/sample/epilight_python_new.pdf)
### React
* [markerikson/react-redux-links](https://github.com/markerikson/react-redux-links)
* [12 Essential React.js Interview Questions](https://www.toptal.com/react/interview-questions)
* [React Interview Questions](https://tylermcginnis.com/react-interview-questions/)
### Math
* MIT - [Mathematics for Computer Science](https://www.youtube.com/watch?v=L3LMbpZIKhQ&list=PLB7540DEDD482705B)
* Graham, Knuth, Patashnik – [Concrete Mathematics: A Foundation for Computer Science](https://www.amazon.com/Concrete-Mathematics-Foundation-Computer-Science/dp/0201558025)
* Bogart, Drysdale, Stein – [Discrete Math for Computer Science Students](http://www.cse.iitd.ernet.in/~bagchi/courses/discrete-book/fullbook.pdf)
### Networking
* Joyent – [TCP Puzzlers](https://www.joyent.com/blog/tcp-puzzlers)
* Andrew Tanenbaum – [Computer Networks](https://www.amazon.com/Computer-Networks-Tanenbaum-International-Economy/dp/9332518742)
* Kurose, Ross – [Computer Networking: A Top-Down Approach](https://www.amazon.com/Computer-Networking-Top-Down-Approach-6th/dp/0132856204)
* W. Richard Stevens – [TCP/IP Illustrated, Vol. 1: The Protocols](https://www.amazon.com/TCP-Illustrated-Vol-Addison-Wesley-Professional/dp/0201633469)
* W. Richard Stevens – [UNIX Netowrk Programming](https://www.amazon.com/UNIX-Network-Programming-Richard-Stevens/dp/0139498761)
### System design
* [donnemartin/system-design-primer](https://github.com/donnemartin/system-design-primer)
* [binhnguyennus/awesome-scalability](https://github.com/binhnguyennus/awesome-scalability)
* [Architecture of Open Source Applications](http://aosabook.org/en/index.html)
* [How should I prepare system design questions for Google/Facebook interview?](http://www.quora.com/Job-Interviews/How-should-I-prepare-system-design-questions-for-Google-Facebook-Interview)
## Resource Repos
* [MaximAbramchuck/awesome-interview-questions](https://github.com/MaximAbramchuck/awesome-interview-questions)
* [donnemartin/interactive-coding-challenges](https://github.com/donnemartin/interactive-coding-challenges)
* [schmatz/cs-interview-guide](https://github.com/schmatz/cs-interview-guide)
* [mission-peace/interview](https://github.com/mission-peace/interview)
* [prakhar1989/awesome-courses](https://github.com/prakhar1989/awesome-courses)
* [SITZ/JobPuzzles](https://github.com/SITZ/JobPuzzles)
* [davidhampgonsalves/interview-resources](https://github.com/davidhampgonsalves/interview-resources)
* [blakeembrey/code-problems](https://github.com/blakeembrey/code-problems)
* [ChiperSoft/InterviewThis](https://github.com/ChiperSoft/InterviewThis)
* [ruby-jokes/job_interview](https://github.com/ruby-jokes/job_interview)
* [what-happens-when](https://github.com/alex/what-happens-when)
* [poteto/hiring-without-whiteboards](https://github.com/poteto/hiring-without-whiteboards)
* [liwei606/interview](https://github.com/liwei606/interview)
* [yangshun/tech-interview-handbook](https://github.com/yangshun/tech-interview-handbook)
## MISC
* [leetcode](https://leetcode.com)
* [leetcode premium](https://leetcode.com/subscribe/)
* [this pdf](https://drive.google.com/open?id=1ao4ZA28zzBttDkuS6MLQI52gDs_CJZEm)
* [cracking the coding interview](http://www.crackingthecodinginterview.com/contents.html)
* [here](https://hackernoon.com/14-patterns-to-ace-any-coding-interview-question-c5bb3357f6ed)
* [topcoder](https://www.topcoder.com/community/competitive-programming/tutorials/dynamic-programming-from-novice-to-advanced/)
* [back to back swe youtube channel](https://www.youtube.com/watch?v=jgiZlGzXMBw)
* [solutions](https://github.com/SeanPrashad/leetcode-patterns/tree/solutions)
* [leetcode discuss](https://leetcode.com/discuss/interview-question)
* [grokking the coding interview](https://www.educative.io/courses/grokking-the-coding-interview)
* [issue](https://github.com/SeanPrashad/leetcode-patterns/issues/new)
* [blind 75 list](https://www.teamblind.com/article/New-Year-Gift---Curated-List-of-Top-100-LeetCode-Questions-to-Save-Your-Time-OaM1orEU?utm_source=share&utm_medium=ios_app)
* [14 patterns to ace any coding interview question](https://hackernoon.com/14-patterns-to-ace-any-coding-interview-question-c5bb3357f6ed)
```
.
├── DS-n-Algos
│ ├── 0-TESTING-RESOURCES
│ │ ├── main-data
│ │ └── text-2-js
│ ├── ALGO
│ │ ├── Dynamic-Programming
│ │ ├── LEETCODE
│ │ ├── UNSORTED
│ │ │ └── Hash Table Data-Structure
│ │ ├── binary_search_project
│ │ │ ├── lib
│ │ │ └── test
│ │ ├── callbacks-solution
│ │ │ ├── problems
│ │ │ └── test
│ │ ├── coin-change
│ │ │ ├── MINchange
│ │ │ │ └── test
│ │ │ ├── coinchange-memoized
│ │ │ └── itterative-4-fun
│ │ ├── computational-complexity
│ │ ├── dice-roll
│ │ ├── egg-drop
│ │ ├── factorial
│ │ ├── fibonacci
│ │ ├── memoization_project
│ │ │ ├── lib
│ │ │ └── test
│ │ ├── radix_sort_project
│ │ │ ├── lib
│ │ │ └── test
│ │ └── tabulation_project
│ │ ├── lib
│ │ └── test
│ ├── Arrays
│ │ ├── 53-max-subArr
│ │ ├── All Unique
│ │ │ └── test
│ │ ├── Array
│ │ ├── Array-Flatten
│ │ ├── Intersection
│ │ ├── Transpose-2-d-array
│ │ ├── all
│ │ ├── append-arr
│ │ ├── array-helpers
│ │ ├── array-of-cumulative-partial-sums
│ │ ├── array-of-nums-in-range
│ │ ├── atleast
│ │ ├── average
│ │ ├── basic-examples
│ │ │ └── problems
│ │ ├── deep-map
│ │ ├── difference-between-arrays
│ │ ├── flatten
│ │ ├── python
│ │ │ ├── sum-arr-dir
│ │ │ └── sum-avg
│ │ ├── resize-array
│ │ └── stringify-arr
│ ├── Binary-Trees
│ │ ├── 105-construct-b-tree
│ │ ├── leetcode110-balanced-bin-tree
│ │ └── tree_order_project
│ │ ├── lib
│ │ └── test
│ ├── Dynamic-Programming
│ │ ├── dynamic-time-warping
│ │ │ ├── doc
│ │ │ │ └── api
│ │ │ ├── lib
│ │ │ │ └── distanceFunctions
│ │ │ ├── ms
│ │ │ └── tests
│ │ ├── popular-problems
│ │ └── tabulation_project
│ │ ├── lib
│ │ └── test
│ ├── Fifo-Lifo
│ │ ├── Queue
│ │ ├── Stack
│ │ ├── queue_project
│ │ │ ├── lib
│ │ │ └── test
│ │ ├── stack_project
│ │ │ ├── lib
│ │ │ └── test
│ │ └── stack_queue_interview_problems
│ │ ├── lib
│ │ └── test
│ ├── File-System
│ │ ├── file-name-from-path
│ │ ├── file-utilities
│ │ ├── guessing-game
│ │ ├── is-valid-file-name
│ │ └── recursive-read-folder
│ ├── Graphs
│ │ ├── Graph
│ │ │ └── basic
│ │ ├── advanced
│ │ ├── bonus-graph-project
│ │ │ ├── lib
│ │ │ └── test
│ │ ├── graph_project
│ │ │ ├── lib
│ │ │ └── test
│ │ ├── graphs-intro-solution
│ │ │ ├── problems
│ │ │ └── test
│ │ └── graphs-solution
│ │ ├── problems
│ │ └── test
│ ├── Hash-Table
│ │ └── advanced
│ ├── Heap
│ ├── Lists
│ │ ├── Linked-List
│ │ ├── advanced
│ │ ├── linked_list_interview_problems
│ │ │ ├── lib
│ │ │ └── test
│ │ └── linked_list_project
│ │ ├── lib
│ │ └── test
│ ├── Misc
│ │ ├── console.table
│ │ ├── data-structures-html-spec-runner
│ │ │ ├── lib
│ │ │ │ ├── chai
│ │ │ │ ├── jquery
│ │ │ │ ├── mocha
│ │ │ │ ├── require
│ │ │ │ └── underscore
│ │ │ ├── sprint-one
│ │ │ │ ├── spec
│ │ │ │ └── src
│ │ │ │ ├── functional
│ │ │ │ ├── functional-shared
│ │ │ │ ├── prototypal
│ │ │ │ └── pseudoclassical
│ │ │ └── sprint-two
│ │ │ ├── spec
│ │ │ └── src
│ │ ├── heaps_project
│ │ │ ├── lib
│ │ │ └── test
│ │ ├── is-reserved-wordJS
│ │ ├── set-utils
│ │ ├── tree
│ │ ├── trie_project
│ │ │ ├── lib
│ │ │ └── test
│ │ ├── type-checker
│ │ └── whiteboarding
│ ├── Numbers_Math
│ │ ├── C++
│ │ ├── base-converter
│ │ ├── basic-examples
│ │ ├── euclidean-distance
│ │ └── isBase
│ ├── POJOs
│ │ ├── basic-examples
│ │ ├── clone
│ │ ├── extend-obj-prop
│ │ ├── obj2Array
│ │ └── objPropMap
│ ├── Recursion
│ │ ├── My-Recursion-Prac-Website
│ │ │ └── Live-htmlRendered-Mocha-Spec--Recursion-Practice-master
│ │ │ ├── AUX_MATERIALS
│ │ │ │ └── sandbox
│ │ │ ├── blank
│ │ │ │ ├── lib
│ │ │ │ │ └── css
│ │ │ │ ├── spec
│ │ │ │ ├── src
│ │ │ │ └── testing
│ │ │ ├── images
│ │ │ ├── my-solutions
│ │ │ │ ├── lib
│ │ │ │ │ └── css
│ │ │ │ ├── spec
│ │ │ │ └── src
│ │ │ ├── part-2
│ │ │ │ ├── lib
│ │ │ │ │ └── jasmine-1.0.0
│ │ │ │ ├── solutions
│ │ │ │ ├── spec
│ │ │ │ └── src
│ │ │ └── tabs
│ │ │ └── template-files
│ │ ├── Recursive
│ │ ├── binary-search
│ │ ├── fibonacci
│ │ │ └── __test__
│ │ ├── fibonacci-versions
│ │ ├── lucas-num-versions
│ │ ├── recursion_problems-master
│ │ │ ├── problems
│ │ │ │ └── dist
│ │ │ └── test
│ │ └── recursion_project
│ │ ├── lib
│ │ └── test
│ ├── Sorting-n-Searching
│ │ ├── 1-searching-algorithms
│ │ │ ├── Search
│ │ │ └── depth_breadth_first_project
│ │ │ ├── lib
│ │ │ └── test
│ │ └── 2-sorting-algorithms
│ │ ├── Sorts
│ │ ├── bubble_sort_project
│ │ │ ├── lib
│ │ │ └── test
│ │ ├── counting_sort_project
│ │ │ ├── lib
│ │ │ └── test
│ │ ├── insertion_sort_project
│ │ │ ├── lib
│ │ │ └── test
│ │ ├── merge_sort_project
│ │ │ ├── lib
│ │ │ └── test
│ │ ├── quick_sort_project
│ │ │ ├── lib
│ │ │ └── test
│ │ ├── radix_sort_project
│ │ │ ├── lib
│ │ │ └── test
│ │ └── selection_sort_project
│ │ ├── lib
│ │ └── test
│ ├── Strings
│ │ ├── 03-lengthOfLongestSubString
│ │ ├── C++
│ │ │ ├── escape-quotes
│ │ │ ├── remove-quotes
│ │ │ └── trim-white-space
│ │ ├── String
│ │ │ └── test
│ │ ├── python
│ │ │ ├── reverse-word
│ │ │ └── split-string
│ │ └── string-helpers
│ ├── Trees
│ │ ├── Binary-Search-Tree
│ │ ├── Tree
│ │ ├── advanced
│ │ ├── bfs-vs-dfs
│ │ ├── leetcode-450-delete-bst-node
│ │ ├── leetcode108-sorted-arr-2-bst
│ │ └── tree_order_project
│ │ ├── lib
│ │ └── test
│ ├── Utilities-Snippets
│ │ ├── general
│ │ └── whitespace-identifier
│ ├── _Extra-Practice
│ │ ├── anagrams
│ │ ├── bst
│ │ ├── capitalize
│ │ ├── chunk
│ │ ├── circular
│ │ ├── events
│ │ ├── fib
│ │ ├── fizzbuzz
│ │ ├── fromlast
│ │ ├── levelwidth
│ │ ├── linkedlist
│ │ ├── matrix
│ │ ├── maxchar
│ │ ├── midpoint
│ │ ├── palindrome
│ │ ├── pyramid
│ │ ├── qfroms
│ │ ├── queue
│ │ ├── reverseint
│ │ ├── reversestring
│ │ ├── sorting
│ │ ├── stack
│ │ ├── steps
│ │ ├── tree
│ │ ├── validate
│ │ ├── vowels
│ │ └── weave
│ ├── functions
│ │ ├── HASH
│ │ ├── MemoizeFunc
│ │ ├── bindTo
│ │ └── call-closure
│ ├── temp
│ └── web-dev
│ ├── convert-2-js-arr
│ ├── html-2-text
│ ├── listenForEvent-s
│ └── tagify-arr
└── Resources
├── My-Data-Structures-Notes
│ ├── tiny-prac-probs
│ │ └── problems
│ └── z-NOTES
│ ├── async_await
│ ├── choosing_the_right_approach
│ ├── concepts
│ ├── data-structures
│ ├── introducing
│ ├── promises
│ └── timeouts_and_intervals
└── gitserve
309 directories
```