Explore

A row of lockers for your data

Connected nodes forming a chain

Last In First Out structure

First In First Out structure

Fast lookup using keys

Arrange data in order

Find items efficiently

Transform and analyze text

Two indices moving through data in tandem

Hierarchical node-based structure

Priority-based tree structure

Nodes connected with edges

Break problems into overlapping subproblems

Maintain a moving subarray over data

Explore all possibilities, prune dead ends

Make the locally optimal choice at each step

Operate directly on binary representations

Split problems, solve halves, combine results

Grid traversal, rotation, and DP on 2D

Merge, insert and count overlapping ranges

Self-balancing binary search trees

Prefix-based word lookup tree

Shortest paths and connectivity

Range queries and updates in O(log n)

Track connected components efficiently