Begin your learning journey with the most basic of all data structures

Array

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 an array

This course teaches you the fundamentals of an&nbsp;array. It provides you with detailed explanations of various concepts that you need to master array in the most intuitive way. We go step by step to explore different types of arrays and how they are stored in memory which will give you a deep insight into this awesome data structure. This will help you gain a thorough understanding of the most basic 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 array problems 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 arrays

Anyone interested in improving their problem solving skills

Anyone preparing for programming interviews

Memory model

What's the problem

A possible solution

Operations

Internal working

Introduction

Row major order

Column major order

Multi dimension Array

Valid palindrome

Valid palindrome II

Reverse a string

Reverse a string II

Reverse vowels in a string

Reverse words in a string

Reverse words in a string II

Rotate an array

Two sum

Two sum less than k

Three sum

Three sum closest

Four sum

Container with most water

Pattern: Two Pointers

Is subsequence

Merge sorted array

Intersection of two arrays

Intersection of two arrays II

Pattern: Simultaneous Traversal

Minimum sum subarray of size K

Maximum average subarray

Maximum sum subarray

Subarray with the given sum

Maximum size subarray sum equals k

Minimum size subarray sum

Subarray product less than K

Max consecutive ones

Max consecutive ones II

Max consecutive ones III

Pattern: Sliding Window

Non overlapping intervals

Merge intervals

Meeting rooms

Meeting rooms II

Pattern: Intervals

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

Singly Linked List

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.

Developers who want to get deepest knowledge of singly linked list

What is a node?

Structure of a singly linked list

Supported operations

Is boundary node

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 the first node

Delete the last node

Delete a list

Delete node with given data

Delete node with given data II

Delete node after the given node

Delete node before the given node

Delete the given node

Delete node at a distance X from the start

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

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

Pattern: Reverse

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.

1. Array

2. Singly Linked List

3. Doubly Linked List

4. Stack

5. Queue

6. Recursion

7. Backtracking

8. Binary Tree

9. Binary Search Tree