Showing 21 of 21 questions
Easy: 0
Medium: 0
Hard: 0
Overview
Arrays are one of the most fundamental data structures in computer science. This section covers essential array manipulation techniques, from basic operations to advanced algorithms.
Key Concepts
- Array traversal and iteration
- Two-pointer technique
- Sliding window
- Prefix sums
- Sorting and searching
- In-place modifications
Common Problems
Easy
- Two Sum
- Remove Duplicates from Sorted Array
- Best Time to Buy and Sell Stock
- Merge Sorted Array
Medium
- 3Sum
- Container With Most Water
- Product of Array Except Self
- Rotate Array
Hard
- Trapping Rain Water
- Median of Two Sorted Arrays
- First Missing Positive
Practice Tips
- Start with brute force: Always think through the naive solution first
- Optimize space: Many array problems can be solved in-place
- Consider edge cases: Empty arrays, single elements, duplicates
- Time complexity: Aim for O(n) or O(n log n) solutions