Skip to content
</>
CodingGyan
Topics
About
Search problems
☾
Home
/
Arrays
🧱
Arrays
Search, rotate, merge and rearrange arrays. 45 problems · Beginner level.
All
Easy
Medium
Hard
45 problems
Basics
✓
Average of an Array
beginner
✓
Maximum Consecutive Ones
easy
Searching
✓
Binary Search
easy
Order statistics
✓
Second Largest Element
easy
✓
Maximum Product of Two Elements
easy
✓
Kth Largest Element
medium
Duplicates and frequency
✓
Missing Number
easy
✓
Remove Duplicates from a Sorted Array
easy
✓
Intersection of Two Arrays
easy
✓
Find Duplicate Values
easy
✓
Frequency of Each Element
easy
✓
Majority Element (Boyer-Moore)
medium
Two pointers and partition
✓
Move Zeros to the End
easy
✓
Merge Two Sorted Arrays
easy
✓
Container With Most Water
medium
✓
Sort an Array of 0, 1 and 2 (Dutch National Flag)
medium
Rotation and reversal
✓
Reverse an Array In Place
easy
✓
Rotate Array to the Right
medium
Prefix sums and windows
✓
Range Sum Queries (Prefix Sums)
easy
✓
Maximum Subarray Sum (Kadane)
medium
✓
Product of Array Except Self
medium
✓
Equilibrium Index
medium
two pointers and hashing
✓
Two Sum
easy
scans
✓
Leaders in an Array
easy
two pointers
✓
Squares of a Sorted Array
easy
✓
Pair with Target Sum in a Sorted Array
easy
✓
Remove All Copies of a Value
easy
✓
Best Pair Sum Below k
medium
hashing
✓
Contains Nearby Duplicate
easy
✓
Count Pairs with Difference k
medium
scanning
✓
Longest Strictly Increasing Run
easy
sliding window
✓
Minimum Size Subarray with Sum at Least k
medium
✓
Subarray with a Given Sum (Positive Numbers)
medium
sorting applications
✓
H-Index
medium
single pass
✓
Third Maximum Distinct Number
medium
✓
Longest Mountain in an Array
hard
carry
✓
Plus One on a Digit Array
medium
in place marking
✓
Find the Disappeared Numbers
medium
binary search
✓
k-th Missing Positive Number
medium
prefix sums
✓
Range Addition with a Difference Array
medium
✓
Subarrays with Sum Divisible by k
hard
rearrangement
✓
Alternate Positives and Negatives
medium
permutations
✓
Next Permutation
hard
divide and conquer
✓
Count Inversions
hard
kadane variations
✓
Maximum Sum of a Circular Subarray
hard