Top KTop K problem asks to find the Kth largest/smallest element or the top K largest/smallest items from an unsorted array. It’s one of the…May 27May 27
Disjoint-set / Union-findDisjoint-set is a data structure that manages a partition of a set into disjoint subsets. It supports two primary operations:May 21May 21
Lowest Common AncestorThere is a series of LeetCode questions about the lowest common ancestor (LCA) in binary trees. It’s a great way to learn about recursions…May 16May 16
LeetCode — 962. Maximum Width RampI like this problem because it’s quite inspiring about how we can handle an array.May 15May 15
Compare lexicographicallyThere are problems involving processing strings such that they can be lexicographically smallest/largest. Some patterns could be observed…May 15May 15
Monotonic StackA stack is a linear data structure and allows LIFO (Last-In-First-Out) operations. Monotonic stacks are stacks where elements are…May 14May 14
