design 9
- Heap: Kth Largest Element In a Stream — Kotlin Solution
- Heap: Find Median From Data Stream — Kotlin Solution
- Heap: Design Twitter — Kotlin Solution
- Trie: Implement Trie (Prefix Tree) — Kotlin Solution
- Trees: Serialize And Deserialize Binary Tree — Kotlin Solution
- Linked List: LRU Cache — Kotlin Solution
- Binary Search: Time Based Key-Value Store — Kotlin Solution
- Stack: Min Stack — Kotlin Solution
- Arrays: Encode and Decode Strings — Kotlin Solution