Algorithm Category · Arrays

Arrays Suite.

Contiguous memory representations, two pointers, sliding window, and in-place transformations.

Module Under Active Development

Arrays Visualizers Coming Soon

We are actively building the Arrays interactive laboratory with theGnaN Visual Learning Language (GVLL). Review the planned curriculum and algorithmic structures below.

Try Selection Sort (Live)

Curriculum Roadmap

Planned Arrays Modules (6)

In Production

#1Coming Soon

Two Pointers Technique

Symmetric converging pointers for pair searching and reversals.

Time (Avg):O(n)

Time (Worst):O(n)

Space:O(1)

#2Coming Soon

Sliding Window

Optimizes contiguous subarray or substring queries.

Time (Avg):O(n)

Time (Worst):O(n)

Space:O(1)

#3Coming Soon

Kadane's Algorithm

Maximum contiguous subarray sum in O(n) time.

Time (Avg):O(n)

Time (Worst):O(n)

Space:O(1)

#4Coming Soon

Dutch National Flag

In-place 3-way partitioning for 0s, 1s, and 2s.

Time (Avg):O(n)

Time (Worst):O(n)

Space:O(1)

#5Coming Soon

Merge Intervals

Consolidation of overlapping range pairs.

Time (Avg):O(n log n)

Time (Worst):O(n log n)

Space:O(n)

#6Coming Soon

Prefix Sum

Constant-time range sum queries with linear preprocessing.

Time (Avg):O(1)

Time (Worst):O(1)

Space:O(n)