What is this?
A curated set of 50 Python implementations of classic data structures and algorithms (arrays, linked lists, stacks, queues, trees, graphs, sorting, dynamic programming and more), built as companion exercises for the author's data-structures-and-algorithms course.
A curated set of 50 Python implementations of classic data structures and algorithms (arrays, linked lists, stacks, queues, trees, graphs, sorting, dynamic programming and more), built as companion exercises for the author's data-structures-and-algorithms course.Is this an installable library, or just reference code?It's not a package you import — each topic has its own standalone Python file demonstrating the implementation, meant to be read and copied rather than installed.
It's not a package you import — each topic has its own standalone Python file demonstrating the implementation, meant to be read and copied rather than installed.How do I actually use these implementations?Browse the headings (arrays, linked lists, stacks, queues, trees, graphs, sorting, dynamic programming, etc.) and open the relevant Python file to study or reuse the code; there is no install step.
Browse the headings (arrays, linked lists, stacks, queues, trees, graphs, sorting, dynamic programming, etc.) and open the relevant Python file to study or reuse the code; there is no install step.Do I need anything besides Python?No external dependencies are listed; the files are plain Python meant to be run or read directly.
No external dependencies are listed; the files are plain Python meant to be run or read directly.Does this cover every algorithm I'd need for interviews?It's a curated set of 50 implementations across 13 topics, not an exhaustive algorithms reference, and all comments and section headers are written in Chinese.
It's a curated set of 50 implementations across 13 topics, not an exhaustive algorithms reference, and all comments and section headers are written in Chinese.Who is this repository for?People learning data structures and algorithms for coding interviews or CS fundamentals, especially Chinese-speaking readers following the author's paid course.
People learning data structures and algorithms for coding interviews or CS fundamentals, especially Chinese-speaking readers following the author's paid course.What topics are covered?Arrays, linked lists, stacks, queues, recursion, sorting, binary search, hash tables, strings/tries, binary trees, heaps, graphs, backtracking, divide-and-conquer, and dynamic programming.
Arrays, linked lists, stacks, queues, recursion, sorting, binary search, hash tables, strings/tries, binary trees, heaps, graphs, backtracking, divide-and-conquer, and dynamic programming.Which sorting algorithms are implemented?Merge sort, quicksort, insertion sort, bubble sort, selection sort, and heap sort, plus an O(n) algorithm to find the k-th largest element.
Merge sort, quicksort, insertion sort, bubble sort, selection sort, and heap sort, plus an O(n) algorithm to find the k-th largest element.What are similar projects?hello-algorithm, algorithm-base, javascript-algorithms, algorithm-pattern, apachecn-algo-zh, algorithms, fucking-algorithm, interactive-coding-challenges
hello-algorithm, algorithm-base, javascript-algorithms, algorithm-pattern, apachecn-algo-zh, algorithms, fucking-algorithm, interactive-coding-challenges