Skip to content

Latest commit

 

History

History

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

README.md

Arrays

Comprehensive collection of array-based problems covering manipulation, searching, sorting, and optimization techniques.

Key Concepts Covered

  • Array traversal and manipulation
  • Two-pointer technique
  • Sliding window
  • Prefix sum / Range queries
  • Kadane's algorithm (maximum subarray)
  • Array rotation and reversal
  • Majority element finding
  • Interval problems
  • Binary search applications
  • Stack-based array problems
  • Bit manipulation on arrays
  • Matrix operations

Problems by Category

Subarray Problems

Matrix Problems

Searching Problems

Sorting Problems

Two-Pointer Problems

Prefix Sum Problems

Array Manipulation

Stack-Based Problems

Selection & Order Statistics

Binary Search Applications

Bit Manipulation

Array Properties & Checks

Missing/Finding Elements

Interval & Range Problems

Mathematical Problems

Water Trapping & Histogram

String Operations

Miscellaneous

Tips

  • Always consider edge cases: empty arrays, single elements
  • Think about time/space tradeoffs
  • Consider sorting when order doesn't matter
  • Use prefix sums for range queries