Circular

4 articles

dsa1 min read

Find the smallest letter in a circular sorted list that is greater than the target using left-boundary binary search.

March 19, 2026Read →

dsa2 min read

Insert a value into a sorted circular linked list by finding the correct position with careful edge case handling.

March 19, 2026Read →

dsa1 min read

Find the next greater element in a circular array by iterating twice (0 to 2n) and using a monotonic stack.

March 19, 2026Read →

dsa1 min read

Implement a circular queue using a fixed-size array with head and tail pointers and a size counter.

March 19, 2026Read →