Introduction to Linear Data Structures

Getting Started with Arrays

Understanding Memory Allocation

Dynamic Arrays and Array Lists in Java

Creating Array from Scratch

Finding Index using Linear Search

Removing Elements

Minimum and Maximum Element in Array

Reverse an Array

Adding Support for Dynamic Sized Arrays

Single Number - LeetCode

Two Sum - LeetCode

Sort Colors - LeetCode

Intersection of Two Arrays - LeetCode

Merge Sorted Array - LeetCode

Move Zeroes - LeetCode

Rotate Array - LeetCode

check If Array is Sorted and Rotated

Introduction to linked lists

Understanding Memory Allocation of Linked Lists

Working with Built-In LinkedList Class

Types of LinkedLists

Creating LinkedList From Scratch

Traversing Linked List

Inserting Node at Beginning

Inserting Node at Specific Index

Reverse a Link List

Delete Node From Beginning

Delete Node From End

N-th Node from the end

Traversing Linked List Recursively

Reverse a Linked List - Recursion

Swap Pairs of Linked List

Reverse Linked List in K Groups

Cyclic Detection in LinkedList

Find Middle of Linked List

Detect & Remove Loop in Linked List

Remove Duplicated From Sorted List

Introduction to Stacks

Working with Stack Class in Java

Creating our own Stack Class

Removing Elements from Top

Peek Elements in Stack

Stack Overflow

Stack Underflow

Creating Stack using LinkedList

TwoStack

Reverse String

Valid Parentheses

Insert An Element At Its Bottom In A Given Stack

Reverse Stack Using Recursion

Sort a Stack

Redundant Brackets

The Celebrity Problem

Min Stack - O(n) Space

Min Stack - O(1) Space

Introduction to Queues

Working with Queues in Java

Reverse a Queue

Creating our own Queue from scratch

Dequeue From Queue

Bug in Queue

Fixing Bug using Circular Arrays

Building Queue using Stacks

Priority Queues

Building Priority Queue

Design Circular Queue

Design Doubly Ended Queue

Reverse Queue using Recursion

First negative Integer in every window of size K

Reverse First K elements of Queue

Interleave The First Half Of The Queue With The Second Half

Introduction to HashMap

HashMaps in Java

First Non Repeated Character in String

First Repeated Character in String

Hash Functions

Chaining - LinkedLists

Open Addressing - Linear Probing

Open Addressing - Quadratic Probing

Double Hashing - Probing

Building Our Own HashMap in Java - Chaining

Getting Data

Removing Data

Complete Guide and Hands-on Tutorials on Linear Data Structures

course content is really good and easily understandable .

Mohammad Ayaan Siddiqui

This is the second part of the Complete Data Structures and Algorithms Course.
Checkout First Part (Introduction to Data Structures and Algorithms): <a href="https://codedamn.com/learn/data-structures-algorithms?coupon=INSTRUCTOR#buy" target="_blank" rel="noopener nofollow noreferrer" class="text-blue-500 hover:underline">https://codedamn.com/learn/data-structures-algorithms</a>
Linear data structures are the most basic and fundamental data structures in computer science. They are used to store a sequence of elements, which can be accessed by their index.
The Java programming language provides a number of classes for implementing linear data structures. These classes include: Arrays, ArrayList, LinkedList, Stack and Queues.
In this course, we&#x27;ll be focusing on linear data structures
Here&#x27;s what you&#x27;re going to learn in this course:
<ul>
<li>Arrays</li>
<li>Linked Lists</li>
<li>Stacks</li>
<li>Queues</li>
<li>HashMaps</li>
</ul>

Hi, I am Piyush and I love to explore new technologies and frameworks. I work as a freelancer in various domains such as the Backend engineer, AWS Cloud solution architect, etc. 

Fun fact about me: 
I am obsessed with clean codes that follow proper design principles and patterns.

Certificate Details

Master Linear Data Structures

Course Goals

Piyush Garg