
In progress3 parts
Data Structures & Algorithms
Cooking my dsa notebook : )
123
Time and Space Complexity
Time and Space Complexity - analyze how an algorithm's running work and memory requirements grow with input size.
Oct 19, 2026
Kadane's Algorithm - The Maximum Subarray Problem
Kadane's Algorithm finds the maximum sum of a contiguous subarray in O(n) time using a single pass.
Oct 20, 2026
Moore's Voting Algorithm - Finding the Majority Element
Moore's Voting Algorithm finds the majority element in O(n) time using vote cancellation and O(1) extra space.
Oct 21, 2026