Linked List Operations: Traverse, Insert and Delete   In this tutorial, you will learn different operations on a linked list. Also, you will find implementation of linked list operations in Python.   Now that you have got an understanding of the basic concepts behind linked list and their types, it’s time to dive into the common operations that …

LinkedList Data Structure   In this tutorial, you will learn about linked list data structure and it’s implementation in Python. A linked list data structure includes a series of connected nodes. Here, each node store the data and the address of the next node. For example, Linked List Data Structure You have to start somewhere, …

Deque Data Structure   In this tutorial, you will learn what a double ended queue (deque) is. Also, you will find working examples of different operations on a deque in Python. Deque or Double Ended Queue is a type of queue in which insertion and removal of elements can be performed from either from the front or …

Priority Queue   In this tutorial, you will learn what priority queue is. Also, you will learn about it’s implementations in Python. A priority queue is a special type of queue in which each element is associated with a priority and is served according to its priority. If elements with the same priority occur, they …

Types of Queue   In this tutorial, you will learn different types of queue along with illustration. A queue is a useful data structure in programming. It is similar to the ticket queue outside a cinema hall, where the first person entering the queue is the first person who gets the ticket. There are four different types …

Queue Data Structure   In this tutorial, you will learn what a queue is. Also, you will find implementation of queue in Python. A queue is a useful data structure in programming. It is similar to the ticket queue outside a cinema hall, where the first person entering the queue is the first person who …

Stack Data Structure   In this tutorial, you will learn about the stack data structure and it’s implementation in Python. A stack is a useful data structure in programming. It is just like a pile of plates kept on top of each other. Stack representation similar to a pile of plate Think about the things …

Divide and Conquer Algorithm   In this tutorial, you will learn how the divide and conquer algorithm works. Also, you will find the comparision between divide and conquer approach and other approach to solve a recursive problem. A divide and conquer algorithm is a strategy of solving a large problem by breaking the problem into smaller sub-problems …

Master Theorem   In this tutorial, you will learn what master theorem is and how it is used for solving recurrence relations. The master method is a formula for solving recurrence relations of the form: T(n) = aT(n/b) + f(n), where, n = size of input a = number of subproblems in the recursion n/b …

Asymptotic Analysis   In this tutorial, you will learn what asymptotic notations are. Also, you will learn about Big-O notation, Theta notation and Omega notation. The efficiency of an algorithm depends on the amount of time, storage and other resources required to execute the algorithm. The efficiency is measured with the help of asymptotic notations. …

Why Learn Data Structures and Algorithms?   In this article, we will learn why every programmer should learn data structures and algorithms with the help of examples. This article is for those who have just started learning algorithms and wondered how impactful it will be to boost their career/programming skills. It is also for those …

What is an Algorithm?   In this tutorial, we will learn what algorithms are with the help of examples. An algorithm is a set of well-defined instructions in sequence to solve a problem. Qualities of a good algorithm Input and output should be defined precisely. Each step in the algorithm should be clear and unambiguous. …