Skip to content

structure.md

Latest commit

 

History

History
96 lines (83 loc) · 2.56 KB

structure.md

File metadata and controls

96 lines (83 loc) · 2.56 KB
Raw

Book Structure and Progress

Fundamentals

  • Introduction
  • How to Use This Reference

Data Structures

STL Basics

  • Vectors and Arrays
    • Common Operations
    • Two-dimensional Arrays
    • Vector of Vectors
  • Sets and Maps
    • Set vs Unordered Set
    • Map vs Unordered Map
    • Multiset and Multimap
  • Priority Queue and Heaps
    • Min/Max Heap
    • Custom Priority Queues
  • Stack and Queue
    • Basic Operations
    • Deque Usage
  • Bitset
    • Operations and Optimizations
  • Bit Manipulation
  • Ordered Set Template

Advanced Data Structures

  • Segment Tree (Iterative)
  • Disjoint Set Union (DSU)

Dynamic Programming

  • LIS - Iterative
  • LIS - Recursive
  • LIS - Recursive (v2)
  • LIS - Binary Search
  • LIS - Segment Tree

Graph Algorithms

  • Depth-First Search (DFS)
  • Breadth-First Search (BFS)
  • Dijkstra's Algorithm
  • Floyd-Warshall Algorithm
  • Topological Sort
  • Path Finding
  • Cycle Detection

Backtracking

  • Subsets
  • Permutations
  • Combinations

String Algorithms

  • C++ STL String Functions
  • Longest Substring Without Repeating Characters
  • Trie (Prefix Tree)

Mathematics

  • Fast Power (Binary Exponentiation)
  • GCD and LCM Functions
  • Combinatorics
  • Sieve of Eratosthenes

Searching Algorithms

  • Binary Search
  • Lower Bound / Upper Bound
  • Ternary Search (Integer & Floating Point)

Geometry (CP Basics)

  • Points & Vectors
  • Lines & Segments
  • Polygons & Areas
  • Circles and Advanced Geometry
  • 3D Geometry

Notes & Utilities

  • Binary Conversions
  • Coordinate Compression
  • Performance Utilities
  • Random Number Generation
  • String Utilities
  • Custom Comparators

Progress Summary:

  • ✅ Completed: Introduction, Data Structures (STL Basics + Advanced), Graph Algorithms, Dynamic Programming, Backtracking, String Algorithms, Mathematics, Searching Algorithms, Geometry (CP Basics), Notes & Utilities
  • 🎉 All sections completed!
  • 📝 Implementation Order: Top to bottom, focusing on fundamentals first

Summary of Added Topics:

  • ✅ Dynamic Programming section (LIS variations)
  • ✅ Backtracking section (Subsets, Permutations, Combinations)
  • ✅ Notes & Utilities section (Binary Conversions, Coordinate Compression, etc.)
  • ✅ Searching Algorithms section (Binary Search, Lower/Upper Bound, Ternary Search)
  • ✅ Geometry (CP Basics) section (Mathematical formulas in LaTeX)
  • ✅ Ordered Set Template moved to Data Structures