Explore my thoughts, experiences, and insights on technology, development, and more.
Doubly linked lists offer bidirectional traversal, making insertions and deletions more efficient than singly linked lists. Learn how they work, when to use them, and why they are essential for certain applications requiring fast navigation in both directions.
Linked lists are a fundamental data structure, but how do they compare in efficiency using Big O notation? In this post, we break down how linked lists work, when they excel, and when they fall short—using a fun treasure hunt analogy to illustrate their strengths and weaknesses
Understand how arrays store elements in a continuous block of memory, explore their optimal use cases, and recognize common pitfalls. Learn how Big O notation helps in choosing arrays for efficient operations like fast indexing and searching.
I spent years thinking about starting a blog but always found reasons to put it off—until I changed my mindset. In this post, I break down the limiting beliefs that held me back and the mental shifts that finally got me writing. If you've ever doubted yourself, this one's for you.
Understanding Big O notation is essential for building efficient e-commerce applications. This guide explores real-world tasks—like searching for products, sorting items, and detecting duplicate orders—analyzing their time complexity with practical TypeScript examples and performance insights. Learn how to optimize your code and improve scalability!