Big O Notation: Analyzing Time and Space Complexity
Master Big O notation — understand how to analyze algorithm efficiency, compare time and space complexities, and reason about performance at scale.
AlgorithmsBig OComputer Science
Zainal Arifin
Software Developer
Crafting robust back-ends and intuitive front-ends from Bandung, Indonesia.
Featured Showcase
A selection of my most recent and impactful projects
No featured projects available. Check back soon!
Latest from the Blog
Thoughts, tutorials, and insights from my development journey
Dynamic Programming: Memoization, Tabulation, and Classic Problems
Understand dynamic programming from first principles — overlapping subproblems, optimal substructure, top-down memoization, bottom-up tabulation, and 10 classic DP problems.
AlgorithmsDynamic ProgrammingComputer Science
Greedy Algorithms: Locally Optimal, Globally Optimal
Learn how greedy algorithms work, when they produce optimal solutions, and how to apply them to classic problems like activity selection, interval scheduling, and Huffman coding.
AlgorithmsGreedyComputer Science