1.
Note
1.1.
Example Note
1.2.
ToDo
2.
Algorithms
2.1.
Big O notations
2.2.
Stack and Queue
2.3.
Divide and Conquer
2.4.
Sort
2.5.
Dynamic programming
2.6.
A * Search homework
2.7.
Binary Search Tree
2.8.
Balanced Search Trees
2.8.1.
Red-Black BSTs
2.8.2.
B-Trees
2.8.3.
Kd-Trees
2.9.
🪵 Raft
3.
System Design
3.1.
Cache
4.
🦀 Rust note
4.1.
General
4.1.1.
C++ memory mode
4.2.
Note from courses
4.2.1.
Pattern matching
4.2.2.
Smart pointers
4.2.3.
String
4.3.
Note for tokio dev
4.4.
Book note - Rust atomics and locks
4.4.1.
SpinLock implementation
4.5.
Resources
5.
Tech notes
5.1.
Network Programming
5.2.
♨️ Java
5.2.1.
Scheduler stuff
5.2.2.
Some new_features learned
5.3.
CLI tools
6.
Probability and Statistics
6.1.
Useful maths equations
6.2.
Chapter 1 & 2
7.
Efficiency Hack
7.1.
📝 Vi editor tips
7.2.
Git tips
8.
Markdown Notes
8.1.
Some Markdown Tips
8.2.
<details> usage
9.
Good Tips
9.1.
🧘 Life Tips
9.2.
Career Tips
9.3.
Human System Optimization
10.
📚 Book Notes
10.1.
Book Notes Formula
10.2.
Speed Read with the Right Brain / Speed reading
11.
🇸🇪 Swedish Learning
11.1.
Grammar Summary
11.1.1.
Nouns
11.1.2.
Verbs
11.2.
Folkuniversitetet
11.2.1.
2022 A1
11.2.2.
2022 A2
11.3.
TV Show - Huss
11.3.1.
Säsong 1 - Avsnitt 1
12.
Food and Drink
12.1.
Cheese study
12.2.
Restaurants in Stockholm
13.
Random thoughts
13.1.
About learning and memory