Day 6 - Time & Space Complexity + Arrays
Complexity scaling, O(1) to O(n^2), loop analysis, and classic array logic.
terminal
Core Concepts
1
Big-O Notation
Topic
2
Common Complexities (O(1), O(log n), O(n), O(n²))
Topic
3
Complexity Analysis of Loops & Arrays
Topic
library_books Reference Study Material
assignment Sprint Practice Problems
task
P26. Two Sum
LeetCode
task
P27. Sort an Array of 0's, 1's and 2's
LeetCode
task
P28. Majority Element-I
LeetCode
task
P29. Kadane's Algorithm (Maximum Subarray)
LeetCode
task
P30. Best Time to Buy and Sell Stock
LeetCode