If the window is valid, expand right.

Else, shrink left.

O(n)

If the element exists, finds its leftmost index

If it doesn’t exist, locates the index of where it should be

O(log n)

Replaces Stack, Queue, and LinkedList

O(1)

String is immutable

String concatenation += is expensive

O(n)

Visits nodes in ascending order

O(n)

Finds the kth smallest/largest element

Average: O(n)
Worst: O(n²)

Detects whether the two intervals overlap

O(1)

Coming Soon

O(n)