Competitive Coding Q1 - Min Stack

Series: Competitive Coding - Code along!

This is the first post of my new series Competitive Coding - Code along! I plan to add more questions (with solutions) and algorithms to this series as we go on. In this post, we will learn to design a Min stack i.e. a stack that supports pop, push, peek/top, retrieveMinElem in constant or O(1) time.

Merge Sort - Algorithm Analysis

Series: Data Structures and Algorithms - A complete course

In this article, we will learn the algorithm for Merge Sort, one of the most popular algorithms for sorting. We will also analyze its performance and compare it with Insertion Sort.

Insertion Sort - Algorithm Analysis

Series: Data Structures and Algorithms - A complete course

In this article, we will learn the algorithm for insertion sort, one of the simplest algorithms for sorting. We will also analyze its performance using the notation we learned in the previous article of this series.

Complexity Analysis

Series: Data Structures and Algorithms - A complete course

In this article, we will discuss different kinds of complexity analysis like the worst case, best case, and average case. We will also discuss various asymptotic notations which will enable us to analyze the performance of programs.

Introduction to DSA

Series: Data Structures and Algorithms - A complete course

This post will introduce you to the basics of Data Structures and Algorithms (DSA) and take you through the content of the course.

Pretty printing data in console

As web developers we spend a lot of time going through complex nested data, read this blog to learn two ways to pretty-print data to save time and make debugging easier!