Software Engineer Notes
1.0
Table of Contents
1. Part I - Introduction
2. Part II - C++ Built-in Data Structure
3. Part III - Advanced Data Structure and Algorithm
3.1. Number System
3.2. Matrix
3.3. Tree
3.4. Dynamic Programming
3.5. Computational Geometry
3.6. Math
3.7. Combinatorics
3.8. Graph
3.9. Binary Search
3.10. Concurrency
3.11. Greedy Algorithm
3.12. Approximation Algorithm
3.13. Advanced Data Structure And Algorithm
3.13.1. Bloom Filter
3.13.2. Disjoint Set (Union-Find)
3.13.3. LRU Cache
3.13.4. Interval Tree
3.13.5. Order Statistic Tree
3.13.6. Token Bucket
3.13.7. SkipList
3.13.8. Questions
4. Part IV - Interview
5. Sample
Software Engineer Notes
3.
Part III - Advanced Data Structure and Algorithm
3.13.
Advanced Data Structure And Algorithm
View page source
3.13.
Advanced Data Structure And Algorithm
3.13.1. Bloom Filter
3.13.1.1. Standard Bloom Filter
3.13.1.2. Counting Bloom Filter
3.13.2. Disjoint Set (Union-Find)
3.13.2.1. Optimization Technique
3.13.3. LRU Cache
3.13.3.1. LRU-Customized Eviction Scheme
3.13.3.2. LFU
3.13.4. Interval Tree
3.13.5. Order Statistic Tree
3.13.6. Token Bucket
3.13.7. SkipList
3.13.8. Questions
3.13.8.1. Longest Consecutive Sequence
3.13.8.2. Number of Connected Components in an Undirected Graph
3.13.8.3. Groups of Strings
3.13.8.4. Percentile Query Tree
3.13.8.5. Maze Generation
3.13.8.6. Multi-language Translator