# Java Data Structures Algorithms LEETCODE Exercises

DSA for the Cracking the Coding Interview. Animated Examples for Faster Learning and Deeper Understanding.

4.7/5

## Java Data Structures Algorithms LEETCODE Exercises

### What you’ll learn

<> 99 Coding Exercises with Detailed Explanations
Learn DSA Faster with Animated Examples
Mastery of Data Structures and Algorithms
Time and Space Complexity of Data Structures and Algorithms
Strengthen Your Skills as a Developer

### Requirements

Basic programming
No experience with data structures or algorithms required

### Overview

Section 1: Introduction

Lecture 1 Introduction

Lecture 3 Code Editor

Section 2: Big O

Lecture 4 Big O: Intro

Lecture 5 Big O: Worst Case

Lecture 6 Big O: O(n)

Lecture 7 Big O: Drop Constants

Lecture 8 Big O: O(n^2)

Lecture 9 Big O: Drop Non-Dominants

Lecture 10 Big O: O(1)

Lecture 11 Big O: O(log n)

Lecture 12 Big O: Different Terms for Inputs

Lecture 13 Big O: Array Lists

Lecture 14 Big O: Wrap Up

Section 3: Classes & Pointers

Lecture 15 Classes

Lecture 16 Pointers

Lecture 18 LL: Big O

Lecture 19 LL: Under the Hood

Lecture 20 LL: Constructor

Lecture 21 Coding Exercises (Important)

Lecture 22 LL: Print List

Lecture 23 LL: Append

Lecture 24 LL: Remove Last (Intro)

Lecture 25 LL: Remove Last (Code)

Lecture 26 LL: Prepend

Lecture 27 LL: Remove First

Lecture 28 LL: Get

Lecture 29 LL: Set

Lecture 30 LL: Insert

Lecture 31 LL: Remove

Lecture 32 LL: Reverse

Section 5: <> LL: Coding Exercises

Section 6: <> LL: Interview / LeetCode Exercises

Lecture 33 DLL: Constructor

Lecture 34 DLL: Append

Lecture 35 DLL: Remove Last

Lecture 36 DLL: Prepend

Lecture 37 DLL: Remove First

Lecture 38 DLL: Get

Lecture 39 DLL: Set

Lecture 40 DLL: Insert

Lecture 41 DLL: Remove

Section 8: <> DLL: Coding Exercises

Section 9: <> DLL: Interview / LeetCode Exercises

Section 10: Stacks & Queues

Lecture 42 Stack: Intro

Lecture 43 Stack: Constructor

Lecture 44 Stack: Push

Lecture 45 Stack: Pop

Lecture 46 Queue: Intro

Lecture 47 Queue: Constructor

Lecture 48 Queue: Enqueue

Lecture 49 Queue: Dequeue

Section 11: <> S&Q: Coding Exercises

Section 12: <> S&Q: Interview / LeetCode Exercises

Section 13: Trees

Lecture 50 Trees: Intro & Terminology

Lecture 51 Binary Search Trees: Example

Lecture 52 BST: Big O

Lecture 53 BST: Constructor

Lecture 54 BST: Insert – Intro

Lecture 55 BST: Insert – Code

Lecture 56 BST: Contains – Intro

Lecture 57 BST: Contains – Code

Section 14: <> BST: Coding Exercises

Section 15: Hash Tables

Lecture 58 Hash Table: Intro

Lecture 59 HT: Collisions

Lecture 60 HT: Constructor

Lecture 61 HT: Hash Method

Lecture 62 HT: Set

Lecture 63 HT: Get

Lecture 64 HT: Keys

Lecture 65 HT: Big O

Lecture 66 HT: Interview Question

Section 16: <> HT: Coding Exercises

Section 17: <> HT: Interview / LeetCode Exercises

Lecture 67 Introduction to Sets

Section 18: Graphs

Lecture 68 Graph: Intro

Lecture 71 Graph: Big O

Lecture 74 Graph: Remove Edge

Lecture 75 Graph: Remove Vertex

Section 19: <> Graph: Coding Exercises

Section 20: Heaps

Lecture 76 Heap: Intro

Lecture 77 Heap: Insert (Intro)

Lecture 78 Heap: Helper Methods

Lecture 79 Heap: Insert (Code)

Lecture 80 Heap: Remove

Lecture 81 Heap: Sink Down

Lecture 82 Heap: Priority Queues & Big O

Section 21: <> Heap: Coding Exercises

Section 22: <> Heap: Interview / LeetCode Exercises

Section 23: Recursion

Lecture 83 Recursion: Intro

Lecture 84 Call Stack

Lecture 85 Factorial

Section 24: Recursive Binary Search Trees

Lecture 86 rBST: Contains

Lecture 87 rBST: Insert

Lecture 88 rBST: Delete Intro

Lecture 89 rBST: Delete Code (1 of 3)

Lecture 90 rBST: Delete Code (2 of 3)

Lecture 91 rBST: Minimum Value

Lecture 92 rBST: Delete Code (3 of 3)

Section 25: <> rBST: Coding Exercises

Section 26: Tree Traversal

Lecture 93 Tree Traversal: Intro

Lecture 94 BFS (Breadth First Search): Intro

Lecture 95 BFS: Code

Lecture 96 DFS (Depth First Search): PreOrder – Intro

Lecture 97 DFS: PreOrder – Code

Lecture 98 DFS: PostOrder – Intro

Lecture 99 DFS: PostOrder – Code

Lecture 100 DFS: InOrder – Intro

Lecture 101 DFS: InOrder – Code

Section 27: <> BST Traversal: Coding Exercises

Section 28: BST Traversal: <> BST Traversal: Interview / LeetCode Exercises

Section 29: Basic Sorts

Lecture 102 Bubble Sort: Intro

Lecture 103 Bubble Sort: Code

Lecture 104 Selection Sort: Intro

Lecture 105 Selection Sort: Code

Lecture 106 Insertion Sort: Intro

Lecture 107 Insertion Sort: Code

Lecture 108 Insertion Sort: Big O

Section 30: <> Basic Sorts: Coding Exercises

Section 31: <> Basic Sorts: Interview / LeetCode Exercise

Section 32: Merge Sort

Lecture 109 Merge Sort: Overview

Lecture 110 Merge: Intro

Lecture 111 Merge: Code

Lecture 112 Merge Sort: Intro

Lecture 113 Merge Sort: Code

Lecture 114 Merge Sort: Big O

Section 33: <> Merge Sort: Coding Exercises

Section 34: <> Merge: Interview / LeetCode Exercise

Section 35: Quick Sort

Lecture 115 Quick Sort: Intro

Lecture 116 Pivot: Intro

Lecture 117 Pivot: Code

Lecture 118 Quick Sort: Code

Lecture 119 Quick Sort: Big O

Section 36: <> Quick Sort: Coding Exercises

Section 37: <> Array: Interview / LeetCode Exercises

Section 38: Coding Exercises