Design

Hard | Binary Search, Design, Binary Indexed Tree, Segment Tree

Hard | Array, Hash Table, String, Design, Trie

Hard | Binary Search, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Breadth-First Search, Design

Medium | Hash Table, String, Design, Trie

Easy | Array, Hash Table, Design, Matrix, Simulation

Medium | Hash Table, Design, Heap (Priority Queue), Ordered Set

Medium | Array, Hash Table, String, Design, Matrix

Medium | Array, Hash Table, Binary Search, Design, Queue, Ordered Set

Medium | Array, Binary Search, Design, Prefix Sum

Medium | Hash Table, Design, Heap (Priority Queue), Ordered Set

Medium | Hash Table, Design, Queue, Data Stream

Medium | Array, Hash Table, Design, Heap (Priority Queue), Ordered Set

Hard | Graph Theory, Design, Heap (Priority Queue), Shortest Path

Medium | Hash Table, Design

Medium | Array, Hash Table, Design, Counting, Data Stream

Medium | Hash Table, Design, Heap (Priority Queue), Data Stream, Ordered Set

Medium | Array, Hash Table, Design, Simulation

Medium | Design, Simulation

Medium | Array, Hash Table, Binary Search, Design, Segment Tree

Hard | Design, Heap (Priority Queue), Data Stream, Ordered Set