|
1 | 1 | Learning JavaScript Data Structures and Algorithms |
2 | 2 | =================================================== |
3 | 3 |
|
4 | | -Source code of **Learning JavaScript Data Structures and Algorithms** (4th edition) book. |
5 | | - |
6 | | -# Chapters |
7 | | - |
8 | | -## Part 1: Introduction |
9 | | - |
10 | | -* 01: Introducing Data Structures and Algorithms in JavaScript |
11 | | -* 02: Understanding Big O Notation |
12 | | - |
13 | | -## Part 2: Data Structures |
14 | | - |
15 | | -* 03: Arrays |
16 | | - * _Hackerrank_ exercises: |
17 | | - * Arrays DS |
18 | | - * Array Left Rotation |
19 | | -* 04: Stacks |
20 | | - * Stack data structure (array-based) |
21 | | - * Stack data structure (object-based) |
22 | | - * Decimal to binary algorithm |
23 | | - * Decimal to bases 2-32 algorithm |
24 | | - * Decimal to bases 2-32 or 64 algorithm |
25 | | - * Tower of Hanoi algorithm |
26 | | - * _LeetCode_ exercises: |
27 | | - * Valid Parantheses |
28 | | - * MinStack |
29 | | - * Simplify Path |
30 | | -* 05: Queues and Deques |
31 | | -* 06: Linked Lists |
32 | | -* 07: Sets |
33 | | -* 08: Dictionaries and Hashes |
34 | | -* 09: Recursion |
35 | | -* 10: Trees |
36 | | -* 11: Binary Heap and Heap Sort |
37 | | -* 12: Tries |
38 | | -* 13: Graphs |
39 | | - |
40 | | -## Part 3: Algorithms |
41 | | - |
42 | | -* 14: Sorting Algorithms |
43 | | -* 15: Searching and Shuffling Algorithms |
44 | | -* 16: String Algorithms |
45 | | -* 17: Math Algorithms |
46 | | -* 18: Algorithm Designs and Techniques |
47 | | - |
48 | 4 | # Project Structure |
49 | 5 |
|
50 | 6 | You can find the source code organized by chapter under the `src` folder. |
@@ -86,4 +42,4 @@ node src/01-intro/01-hello-variables.js |
86 | 42 | * TypeScript |
87 | 43 | * Jest (tests) |
88 | 44 |
|
89 | | -Happy Coding! |
| 45 | +Happy Coding! |
0 commit comments