Big-O Complexity Analysis
Master dynamic array complexities: O(1) amortized insert, O(n) worst-case resize, O(1) access/delete-end, O(n) middle operations. Learn space complexity, memory allocation patterns, and performance optimization strategies.
-
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
- Subsets Or Powerset
- Challenge 1: Missing Number
- Solution Review: Missing Number
- Challenge 2: Single Number
- Solution Review: Single Number
Big-O Complexity Analysis