Part XII · Algorithm Engineering, Java Practice and Tutorial Publishing
68. Java DSA Reference Implementations and Library Mapping
9 lessons•59 topics•Beginner to Expert
0 of 9 lessons published
68.01Outline
Core interface mapping
- Array/List
- Deque
- Queue
- PriorityQueue
- Set
- NavigableSet
- Map
- NavigableMap
68.02Outline
Implement-from-scratch set
- Dynamic array
- Linked list
- Stack
- Circular queue
- Hash table
- Binary heap
- BST
- Trie
- DSU
68.03Outline
Graph templates
- Adjacency list with edges
- BFS
- Iterative DFS
- Dijkstra
- Kahn
- DSU MST
- Topological DP
68.04Outline
Tree and range templates
- Iterative traversals
- LCA binary lifting
- Fenwick tree
- Lazy segment tree
- Sparse table
68.05Outline
Dynamic programming templates
- Memoized recursion
- Tabulation
- Rolling arrays
- 0/1 knapsack
- Digit DP
- Bitmask DP
68.06Outline
String algorithm templates
- KMP
- Z-function
- Rolling hash
- Trie
- Manacher
- Suffix array basic
68.07Outline
Math and geometry templates
- Modular power
- GCD/extended GCD
- Sieve
- nCr
- Matrix power
- Convex hull
68.08Outline
Java pitfalls checklist
- Mutable map key
- Comparator subtraction overflow
- PriorityQueue updates
- Recursion depth
- Non-ASCII char
- Long overflow
68.09Outline
Fast I/O and contest setup
- BufferedReader
- FastScanner
- StringBuilder output
- Multiple test cases
- Large graph memory
- Long[] vs long[]