Software Engineer Notes

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

---

Table of Contents

• 1. Part I - Introduction
  • 1.1. About SEIN
    • 1.1.1. How to use this book
    • 1.1.2. Structure of SEIN
    • 1.1.3. Website
  • 1.2. Tools and Environment Setup
    • 1.2.1. Operating System
    • 1.2.2. C++ Standard and Compiler
    • 1.2.3. C++ REPL
    • 1.2.4. Advice
    • 1.2.5. Reference
  • 1.3. How to use this book?
    • 1.3.1. Build The Source Code
    • 1.3.2. Debug The Source Code
    • 1.3.3. How this book is structured?
    • 1.3.4. How do I wrote this book?
  • 1.4. C++ Tips
    • 1.4.1. lower_bound and upper_bound
    • 1.4.2. Virtual Function
    • 1.4.3. shared_ptr unique_ptr weak_ptr
• 2. Part II - C++ Built-in Data Structure
  • 2.1. Vector and Deque
    • 2.1.1. Sort
    • 2.1.2. Two Pointers
    • 2.1.3. Cumulative Sum
    • 2.1.4. Sliding Window
    • 2.1.5. Meeting Room
    • 2.1.6. Questions
  • 2.2. String
    • 2.2.1. Questions
  • 2.3. Linked List
    • 2.3.1. Questions
  • 2.4. Priority Queue
    • 2.4.1. Dynamic Heap
    • 2.4.2. Index Heap
    • 2.4.3. Questions
    • 2.4.4. Beam Search
  • 2.5. Stack and Queue
    • 2.5.1. Questions
  • 2.6. Binary Search Tree
    • 2.6.1. General Binary Search Tree
    • 2.6.2. Map and Set
    • 2.6.3. Questions
  • 2.7. Hash Table
• 3. Part III - Advanced Data Structure and Algorithm
  • 3.1. Number System
    • 3.1.1. Binary and Bits
    • 3.1.2. Number System Conversion
    • 3.1.3. Number Representation
    • 3.1.4. Questions
  • 3.2. Matrix
    • 3.2.1. Questions
  • 3.3. Tree
    • 3.3.1. Tree Traversal
    • 3.3.2. Lowest Common Ancestor
    • 3.3.3. Segment Tree
    • 3.3.4. Tournament Tree
    • 3.3.5. AVL Tree
    • 3.3.6. Cord Tree
    • 3.3.7. QuadTree
    • 3.3.8. Questions
  • 3.4. Dynamic Programming
    • 3.4.1. Questions
  • 3.5. Computational Geometry
    • 3.5.1. Questions
  • 3.6. Math
    • 3.6.1. Probability Theory
    • 3.6.2. Number Theory
    • 3.6.3. Game Theory
    • 3.6.4. Questions
  • 3.7. Combinatorics
    • 3.7.1. Letter Combinations of a Phone Number
  • 3.8. Graph
    • 3.8.1. Representation of Graph
    • 3.8.2. BFS
    • 3.8.3. DFS
    • 3.8.4. Topological Sort
    • 3.8.5. Minimum Spanning Tree
    • 3.8.6. Single-Source Shortest Paths
    • 3.8.7. All-Pairs Shortest Paths
    • 3.8.8. Other Graph Algorithms
    • 3.8.9. Questions
  • 3.9. Binary Search
    • 3.9.1. Split Array Largest Sum
  • 3.10. Concurrency
  • 3.11. Greedy Algorithm
    • 3.11.1. Huffman Coding
    • 3.11.2. Maximum Length of Pair Chain
  • 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
  • 4.1. Candidate: Interview and Negotiation
  • 4.2. Interviewer: Debrief and Bartendering
    • 4.2.1. Pre-Interview
    • 4.2.2. Interview
    • 4.2.3. Post-Interview
    • 4.2.4. Debrief
• 5. Sample
  • 5.1. Question 0
  • 5.2. Question 1
  • 5.3. Question 2
  • 5.4. Question 3