Hard Problems on Array
- Find k numbers with most occurrences in the given array
- MO’s Algorithm
- Square Root (Sqrt) Decomposition Algorithm
- Sparse Table
- Range sum query using Sparse Table
- Range Minimum Query (Square Root Decomposition and Sparse Table)
- Range LCM Queries
- Merge Sort Tree for Range Order Statistics
- Minimum number of jumps to reach end
- Space optimization using bit manipulations
- Sort a nearly sorted (or K sorted) array
- Find maximum value of Sum( i*arr[i]) with only rotations on given array allowed
- Median in a stream of integers (running integers)
- Construct an array from its pair-sum array
- Maximum equlibrium sum in an array
- Smallest Difference Triplet from Three arrays
- Find all triplets with zero sum
Quick Links :
- ‘Practice Problems’ on Arrays
- ‘Quizzes’ on Arrays
- ‘Video Tutorials’ on Arrays
Recommended:
Array Data Structure Guide
An array data structure is a fundamental concept in computer science that stores a collection of elements in a contiguous block of memory. It allows for efficient access to elements using indices and is widely used in programming for organizing and manipulating data.
Table of Content
- What is an Array?
- Need of Array Data Structures
- Types of Array Data Structures
- Array Operations
- Application of Array