Skip to main content

Array Fundamentals

Master the essential operations and patterns for working with arrays effectively.

Array traversal & manipulation​

  • Linear Traversal: Single pass through array elements
  • Reverse Traversal: Processing elements from end to beginning
  • Multi-pass: Multiple iterations for complex operations
  • In-place Manipulation: Modifying array without extra space

Finding elements & indices​

  • Linear Search: O(n) time complexity for unsorted arrays
  • Binary Search: O(log n) for sorted arrays
  • Finding Multiple Elements: Handling duplicates and multiple matches
  • Index-based Operations: Working with array positions

Array rotation & reversal​

  • Array Rotation: Shifting elements by k positions
  • Array Reversal: Reversing entire array or segments
  • In-place Rotation: Efficient rotation without extra space
  • Multiple Rotations: Handling multiple rotation operations

Subarray problems​

  • Maximum Subarray: Finding contiguous subarray with maximum sum
  • Subarray Sum: Computing sums of various subarrays
  • Subarray Length: Finding subarrays with specific properties
  • Sliding Window: Efficient subarray processing

Array sorting & searching​

  • Sorting Algorithms: Understanding when to use different sorts
  • Search in Sorted Arrays: Binary search variations
  • Search in Unsorted Arrays: Linear search and optimization
  • Custom Sorting: Sorting with custom comparison functions