hello-algo/en/docs/index.md at 04ebee03082198acd3497da22bfe93bae0d62a52

mirror of https://github.com/krahets/hello-algo.git synced 2024-12-26 02:16:29 +08:00

Several bug fixes and improvements (#1178 )

* Update pythontutor block with the latest code

* Move docs-en to en/docs

* Move mkdocs.yml and README to en folder

* Fix en/mkdocs.yml

* Update the landing page

* Fix the glossary

* Reduce the font size of the code block tabs

* Add Kotlin blocks to en/docs

* Fix the code link in en/.../deque.md

* Fix the EN README link

2024-03-26 02:49:26 +08:00

16 KiB

Raw Blame History

comments

glightbox

hide

true

false

footer

toc

edit

Hello Algo

Data Structures and Algorithms Crash Course with Animated Illustrations and Off-the-Shelf Code

Dive In Clone Repo Get PDF

The English edition is brewing...

Feel free to engage in Chinese-to-English translation and pull request review! For guidelines, please see #914.

Quote

"An easy-to-understand book on data structures and algorithms, which guides readers to learn by minds-on and hands-on. Strongly recommended for algorithm beginners!"

—— Junhui Deng, Professor of Computer Science, Tsinghua University

Quote

"If I had 'Hello Algo' when I was learning data structures and algorithms, it would have been 10 times easier!"

—— Mu Li, Senior Principal Scientist, Amazon

Animated illustrations

Easy to understand
Smooth learning curve

"A picture is worth a thousand words."

Off-the-Shelf Code

Multi programming languages
Run with one click

"Talk is cheap. Show me the code."

Learning Together

Discussion and questions welcome
Readers progress together

"Learning by teaching."

Preface

Two years ago, I shared the "Sword Offer" series of problem solutions on LeetCode, which received much love and support from many students. During my interactions with readers, the most common question I encountered was "How to get started with algorithms." Gradually, I developed a deep interest in this question.

Blindly solving problems seems to be the most popular method, being simple, direct, and effective. However, problem-solving is like playing a "Minesweeper" game, where students with strong self-learning abilities can successfully clear the mines one by one, but those with insufficient foundations may end up bruised from explosions, retreating step by step in frustration. Thoroughly reading textbooks is also common, but for students aiming for job applications, the energy consumed by graduation, resume submissions, and preparing for written tests and interviews makes tackling thick books a daunting challenge.

If you are facing similar troubles, then you are lucky to have found this book. This book is my answer to this question, not necessarily the best solution, but at least an active attempt. Although this book won't directly land you an Offer, it will guide you through the "knowledge map" of data structures and algorithms, help you understand the shape, size, and distribution of different "mines," and equip you with various "demining methods." With these skills, I believe you can more comfortably solve problems and read literature, gradually building a complete knowledge system.

I deeply agree with Professor Feynman's saying: "Knowledge isn't free. You have to pay attention." In this sense, this book is not entirely "free." To not disappoint the precious "attention" you pay to this book, I will do my utmost, investing the greatest "attention" to complete the creation of this book.

Author

Yudong Jin(krahets), Senior Algorithm Engineer in a top tech company, Master's degree from Shanghai Jiao Tong University. The highest-read blogger across the entire LeetCode, his published "Illustration of Algorithm Data Structures" has been subscribed to by over 300k.

Contribution

This book is continuously improved with the joint efforts of many contributors from the open-source community. Thanks to each writer who invested their time and energy, listed in the order generated by GitHub:

The code review work for this book was completed by codingonion, Gonglja, gvenusleo, hpstory, justin‐tse, krahets, night-cruise, nuomi1, and Reanon (listed in alphabetical order). Thanks to them for their time and effort, ensuring the standardization and uniformity of the code in various languages.