Learn in-depth the most fundamental data structure in a programmer's life

Singly Linked List

This is a complete course and assumes that you know nothing about linked lists but are familiar with some basic foundational topics in any programming language.

Basic knowledge of programming in any language

Data structures are used extensively in software development and a linked list is the most fundamental of all data structures. Irrespective of the language, framework, or system that you use, you will always be using a linked list in some form or the other.&nbsp;

Representation of a singly linked list

This course teaches you the fundamentals of a singly linked list and how it works. It provides you with code implementations and detailed explanations of a singly linked list and its operations in the most intuitive way. We go step by step to explore its various functions which will give you a deep insight into this awesome data structure. This will help you gain a thorough understanding of the most important data structure of all.

This course is an interactive course with high-quality problems and is deeply focused on problem-solving. It bridges the gap between theoretical concepts and common interview problems by providing detailed explanations of the most common interview problems on a linked list. This will help you gain confidence and understand how to convert your learning into action. By the end of the course, you will be pretty confident to solve any singly linked list problem thrown at you.

This course is an all-rounder course and targets a variety of audiences ranging from complete beginners to experienced programmers who want to take their knowledge to the next level. You will greatly benefit from this course if you identify yourself as one of the following

Non developers who want to start their journey to learn data structures

Developers who want to get deepest knowledge of singly linked list

Anyone interested in improving their problem solving skills

Anyone preparing for programming interviews

What's the problem

A possible solution

What is a node?

Structure of a singly linked list

Supported operations

Is boundary node

Introduction

What is traversal?

Array vs linked list

Print all nodes from the start

Length of the linked list

Find node with given data

Find node with given data II

Traversal

Clone a list

Insert at the beginning

Insert at the end

Insert after the given node

Insert before the given node

Insert a distance X from the start

Insert at correct position

Add a single number to the list

Insertion

Delete a list

Delete the first node

Delete the last node

Delete node with given data

Delete node after the given node

Delete the given node

Delete node before the given node

Delete node at a distance X from the start

Delete node with given data II

Remove duplicates from a sorted list

Delete every N nodes after M nodes

Deletion

What is the two pointer pattern?

How to approach this pattern?

Move last node to the start

Find intersection of two linked lists

Remove Nth node from the end

Swap Nth nodes

Rotate list

Pattern: Two Pointer

What is the fast and slow pointers pattern?

Find middle of the linked list

Find cycle in a linked list

Find cycle in a linked list II

Remove loop in a linked list

Pattern: Fast and Slow Pointers

What is the reversal pattern?

Reverse a linked list

Palindrome linked list

Swap nodes in pairs

Reverse the given segment

Reverse list in groups of K

Reverse every alternate K nodes

Pattern: Reversal

Merge alternate nodes

Merge two sorted lists

Merge two sorted lists II

Add two linked lists

Sort a singly linked list

Merge k sorted lists

Pattern: Merge

What is the split pattern?

Split linked list in half

Split linked list in parts

Odd even list

Odd even list II

Reorder list

Partition list

Pattern: Split

Learn about the powerful extension of the singly linked list that powers stacks and queues



Doubly Linked List

This is a complete course and assumes that you know nothing about doubly linked lists but are familiar with some basic foundational topics in any programming language.

You have completed the singly linked list course

Representation of a doubly linked list

This course teaches you the fundamentals of a doubly linked list and how it works. It provides you with code implementations and detailed explanations of a doubly linked list and its operations in the most intuitive way. We go step by step to explore its various functions which will give you a deep insight into this awesome data structure. This will help you gain a thorough understanding of the most important data structure of all.

This course is an interactive course with high-quality problems and is deeply focused on problem-solving. It bridges the gap between theoretical concepts and common interview problems by providing detailed explanations of the most common interview problems on a linked list. This will help you gain confidence and understand how to convert your learning into action. By the end of the course, you will be pretty confident to solve any doubly&nbsp;linked list problem thrown at you.

Developers who want to get deepest knowledge of doubly linked list

Structure of a doubly linked list

Ways to traverse

Print all nodes from the end

Insert at a distance X from the start

Insert node at correct position

Clone a list with random pointer

Move the last node to the start

Pairs with given sum

Pattern: Two pointer

Flatten a multilevel linked list

Flatten a multilevel linked list II

Flatten a multilevel linked list III

Pattern: Flatten

Pattern: Reverse

Sort a doubly linked list

Update random pointer of linked list

Pattern: Ad hoc

The data structure behind recursion, memory management and much more

Stack

This is a complete course and assumes that you know nothing about stacks but are familiar with some basic foundational topics in any programming language.

Data structures are used extensively in software development and a stack is the most fundamental of all data structures. Irrespective of the language, framework, or system that you use, you will always be using a stack in some form or the other.&nbsp;

Representation of a stack

This course teaches you the fundamentals of a stack&nbsp;and how it works. It provides you with code implementations and detailed explanations of a stack and its operations in the most intuitive way. We go step by step to explore its various functions which will give you a deep insight into this awesome data structure. This will help you gain a thorough understanding of the most important data structure of all.

This course is an interactive course with high-quality problems and is deeply focused on problem-solving. It bridges the gap between theoretical concepts and common interview problems by providing detailed explanations of the most common interview problems on a stack. This will help you gain confidence and understand how to convert your learning into action. By the end of the course, you will be pretty confident to solve any stack problem thrown at you.

Developers who want to get deepest knowledge of stacks

What's the problem?

Properties of stack

Structure

Stack class

Size of the stack

Is stack empty

Top of the stack

Push an item onto the stack

Pop the item from the top of the stack

Implement a stack using an array

Implement two stacks in an array

Array implementation

Pop the item form the top of the stack

Implement a stack using a linked list

Linked list implementation

Reverse a stack

Reverse a stack II

Reverse a stack III

Sort a stack

Sort a stack II

Sort a stack III

Pattern: Sorting

Min stack

Max stack

Min stack II

Max stack II

Min stack III

Max stack III

Pattern: Min-Max stack

Valid parentheses

Duplicate parentheses

Pattern: Sequence validation

Next greater element

Next smaller element

Previous greater element

Previous smaller element

Next greater element II

Next smaller element II

Previous greater element II

Previous smaller element II

Next greater node in a linked list

Pattern: Closest occurrence

Convert prefix to infix

Convert prefix to postfix

Convert postfix to prefix

Convert postfix to infix

Convert infix to prefix

Convert infix to postfix

Pattern: Conversion

Evaluate a postfix expression

Evaluate a prefix expression

Evaluate an infix expression

Pattern: Evaluation

Reverse an array

Reverse the string

Reverse the string II

Decode string

Simplify UNIX path

Trapping rain water

Longest balanced parentheses

Largest rectangle area in a histogram

Pattern: Applications

Learn about the data structure that powers CPU and disk scheduling algorithms

Queue

This is a complete course and assumes that you know nothing about queues but are familiar with some basic foundational topics in any programming language.

Data structures are used extensively in software development and a queue is the most fundamental of all data structures. Irrespective of the language, framework, or system that you use, you will always be using a queue in some form or the other.&nbsp;

Representation of a queue

This course teaches you the fundamentals of a queue&nbsp;and how it works. It provides you with code implementations and detailed explanations of a queue and its operations in the most intuitive way. We go step by step to explore its various functions which will give you a deep insight into this awesome data structure. This will help you gain a thorough understanding of the most important data structure of all.

This course is an interactive course with high-quality problems and is deeply focused on problem-solving. It bridges the gap between theoretical concepts and common interview problems by providing detailed explanations of the most common interview problems on a queue. This will help you gain confidence and understand how to convert your learning into action. By the end of the course, you will be pretty confident to solve any queue problem thrown at you.

Data Structures Learning Path

Annual Subscription