Strengths vs. Weaknesses
6 min readMaster array trade-offs: O(1) fast lookups and appends vs O(n) costly inserts/deletes. Learn fixed-size limitations, memory waste, cache friendliness, and when to choose arrays for optimal performance.
-
Arrays Overview
-
Shifting Algorithms
-
Array Construction
-
Dynamic/Resizable Arrays
-
2D Arrays
-
3D Arrays
-
Array Problems
- Two Sum
- Find Largest Value
- Search an Element (Linear & Binary)
- Monotonic Array
- Find Even Number Of Digits
- Find Duplicate Element
- Find Odd Occurring Element
- Reverse Array: Array In-Place Algorithm
- How to reverse the letters in a string in Java
- Challenge 1: Missing Number
- Solution Review: Missing Number
- Challenge 2: Single Number
- Solution Review: Single Number
- Subsets Or Powerset
Strengths vs. Weaknesses
Reading Progress