10K's
Shortcuts are the farthest path, so you must write and think honestly, which is the basic requirement for progress.
Backtracking
DFS
LeetCode
OOD
Design Pattern
Matrix
Binary Search
Memorization
Stack
Reading
Java
Thread
Other
Queue
Priority Queue
Sorting
Array
QuickSelect
Heap
Bit Manipulation
Shortest Path
Depth First Search&Bread First Search
Minimum Spanning Tree
Union Find
Graph
Tree
Data Structure
Topological Sorting
System Design
Dynamic Programming
Hibernate
Troubleshooting
MySQL
Random
Trie
Database
Greedy algorithm
Algorithm
Design
Chat-GPT
Q&A
String
Test
Grafana
Wavefront
Spring
Performance
Python