mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-04-30 12:46:11 -04:00
62 lines
2.2 KiB
Markdown
62 lines
2.2 KiB
Markdown
## 👾🐍 master algorithms with python (and my book 🖤)
|
||
|
||
<br>
|
||
|
||
|
||
<p align="center">
|
||
<img src="https://user-images.githubusercontent.com/1130416/156927662-1cc6d09f-1124-4a87-8c40-10159b24d307.jpeg" width="30%" align="center" style="padding:1px;border:1px solid black;">
|
||
</p>
|
||
|
||
<br>
|
||
|
||
## [📖 my book on algorithms and data structure in python (2014)](MY_BOOK)
|
||
|
||
<br>
|
||
|
||
- **➡️ [one of the first-ever publications to solve classic computer science algorithm and data structure problems in python, published by hanbit media in 2014](https://www.hanbit.co.kr/store/books/look.php?p_code=B8465804191)**.
|
||
- **➡️ [as of today, it has 4.6/5 stars and 33 reviews (not bad for a book written in school by a self-taught)](https://www.hanbit.co.kr/store/books/look.php?p_code=B8465804191)**.
|
||
- **➡️ [this book as a reference for a CMU computer science class](https://www.andrew.cmu.edu/user/ramesh/teaching/course/48784.pdf)**.
|
||
- **➡️ [here is a pic when this repo used to have 600+ stars and 300 forks (before 💩 happened 😞)](MY_BOOK/600_stars.png)**.
|
||
|
||
|
||
<br>
|
||
<p align="center">
|
||
<img src="https://user-images.githubusercontent.com/1130416/156927666-04e64766-8d8b-4973-a2b1-6e0c48dc6cc1.jpeg" width=50%" align="center" style="padding:1px;border:1px solid black;">
|
||
|
||
<br>
|
||
<br>
|
||
<br>
|
||
|
||
---
|
||
|
||
## 📖 algorithms and data structures revisited (2023)
|
||
|
||
<br>
|
||
|
||
* 𝟘𝟘𝟘𝟙. **[arrays and strings](arrays_and_strings)**
|
||
* 𝟘𝟘𝟙𝟘. **[bit operations](bit_operations)**
|
||
* 𝟘𝟘𝟙𝟙. **[dynamic programming](dynamic_programming)**
|
||
* 𝟘𝟙𝟘𝟘. **[graphs](graphs)**
|
||
* 𝟘𝟙𝟘𝟙. **[hash objects](hash_objects)**
|
||
* 𝟘𝟙𝟙𝟘. **[heaps](heaps)**
|
||
* 𝟘𝟙𝟙𝟙. **[linked lists](linked_lists)**
|
||
* 𝟙𝟘𝟘𝟘. **[math](math)**
|
||
* 𝟙𝟘𝟘𝟙. **[queues](queues)**
|
||
* 𝟙𝟘𝟙𝟘. **[searching](searching)**
|
||
* 𝟙𝟘𝟙𝟙. **[sets](sets)**
|
||
* 𝟙𝟙𝟘𝟘. **[sorting](sorting)**
|
||
* 𝟙𝟙𝟘𝟙. **[stacks](stacks)**
|
||
* 𝟙𝟙𝟙𝟘. **[trees](trees)**
|
||
* 𝟙𝟙𝟙𝟙. **[tries](tries)**
|
||
|
||
<br>
|
||
|
||
---
|
||
|
||
## external resources
|
||
|
||
<br>
|
||
|
||
* **[big-o complexity chart](https://www.bigocheatsheet.com/)**
|
||
* **[hacker rank videos on algorithms](https://www.youtube.com/watch?v=KEEKn7Me-ms&list=PLI1t_8YX-ApvMthLj56t1Rf-Buio5Y8KL)**
|