#Data Structures

Binary Search (Recursive)

Recursive binary search on a sorted array in O(log n) time with O(log n) call-stack space, in Python, Java and C++.

Binary Search (Classic Iterative)

Classic iterative binary search on a sorted array in O(log n) time, with Python, Java and C++ code and an overflow-safe midpoint.

Recognizing a Sliding Window Problem (Interview Concept)

When to Use Sliding Window vs Two Pointers (Interview Con...

Fixed-Size vs Variable-Size Sliding Window (Interview Con...

Shortest Subarray With Sum At Least K (With Negatives)

Maximum Sum of Distinct Subarrays With Length K

Number of Subarrays With Bounded Maximum

Count Complete Subarrays in an Array

Substring With Concatenation of All Words

Sliding Window Median

Maximum Frequency After K Increments