›What are weighted and directed graphs, and what problems do they model?Senior#Complexity#GraphsDetails →
›What is a disjoint-set (union-find) structure with path compression and union by rank?Senior#Complexity#GraphsDetails →
›What is a skip list and how does it achieve O(log n) search?Senior#Data Structures#ComplexityDetails →
›How do segment trees and Fenwick trees (BIT) support fast range queries?Senior#Complexity#TreesDetails →
›How do you design a data structure with specific O(1)/O(log n) requirements?Senior#Data Structures#ComplexityDetails →
