Skip to content
ReadMe Daily

Search articles, problems, patterns and every cheat sheet topic.

Array

Articles and practice problems tagged Array.

Articles

  • Data Structures

    Arrays Explained: How They Work and What Each Operation Costs

    How arrays store data in memory, why reading by index is O(1) but inserting at the front is O(n), and what that means for JavaScript arrays.

    · 8 min read

  • Data Structures

    Linked Lists Explained

    How a linked list stores data as nodes joined by pointers, what its operations cost compared with an array, and a simple JavaScript implementation.

    · 9 min read

  • Data Structures

    Stacks and Queues Explained

    How stacks (last in, first out) and queues (first in, first out) work, what their operations cost, and how to build both correctly in JavaScript.

    · 8 min read

Problems

ProblemDifficultyPatternTimeSpaceRead
Binary SearcheasyBinary SearchO(log n)O(1)Short read: 4 min
Check if Array Is Sorted and RotatedeasyRotated Sorted ArraysO(n)O(1)Medium read: 8 min
Contains DuplicateeasyHashingO(n)O(n)Quick read: 3 min
Count Negative Numbers in a Sorted MatrixeasyMatrix SearchO(rows + columns)O(1)Medium read: 8 min
Find Pivot IndexeasyPrefix SumsO(n)O(1)Short read: 4 min
Maximum Sum Subarray of Size KeasySliding WindowO(n)O(1)Quick read: 3 min
Peak Index in a Mountain ArrayeasyPeak FindingO(log n)O(1)Medium read: 7 min
Search Insert PositioneasyBinary SearchO(log n)O(1)Short read: 4 min
Two SumeasyHashingO(n)O(n)Quick read: 3 min
3SummediumTwo PointersO(n²)O(n)Medium read: 6 min
Container With Most WatermediumTwo PointersO(n)O(1)Short read: 5 min
Daily TemperaturesmediumStack and Monotonic StackO(n)O(n)Short read: 5 min
Find Minimum in Rotated Sorted ArraymediumRotated Sorted ArraysO(log n)O(1)Medium read: 8 min
Find Peak ElementmediumPeak FindingO(log n)O(1)Long read: 9 min
Koko Eating BananasmediumBinary Search on the AnswerO(n log m)O(1)Medium read: 8 min
Minimum Size Subarray SummediumSliding WindowO(n)O(1)Medium read: 6 min
Search a 2D Matrix IImediumMatrix SearchO(rows + columns)O(1)Long read: 9 min
Search in Rotated Sorted ArraymediumBinary SearchO(log n)O(1)Medium read: 6 min
Subarray Sum Equals KmediumPrefix SumsO(n)O(n)Short read: 5 min
Two Sum on a Sorted ArraymediumTwo PointersO(n)O(1)Quick read: 3 min
Find in Mountain ArrayhardPeak FindingO(log n)O(1)Long read: 10 min
Find Minimum in Rotated Sorted Array IIhardRotated Sorted ArraysO(log n) typical, O(n) worst caseO(1)Long read: 9 min
First Missing PositivehardHashingO(n)O(1)Medium read: 7 min
Kth Smallest Element in a Sorted MatrixhardMatrix SearchO(n log(max − min))O(1)Long read: 11 min
Largest Rectangle in HistogramhardStack and Monotonic StackO(n)O(n)Medium read: 8 min
Median of Two Sorted ArrayshardBinary SearchO(log(min(m, n)))O(1)Medium read: 8 min
Shortest Subarray with Sum at Least KhardPrefix SumsO(n)O(n)Medium read: 8 min
Sliding Window MaximumhardSliding WindowO(n)O(n)Medium read: 8 min
Split Array Largest SumhardBinary Search on the AnswerO(n log S)O(1)Long read: 11 min
Trapping Rain WaterhardTwo PointersO(n)O(1)Medium read: 8 min