Completed
Introduction
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Data Structures and Algorithms with Visualizations – Full Course (Java)
Automatically move to the next video in the Classroom when playback concludes
- 1 Introduction
- 2 Introduction to Data Structures
- 3 Introduction to Data Structures
- 4 Introduction to Algorithms
- 5 Time Complexity of an Algorithm
- 6 Space Complexity of an Algorithm
- 7 Asymptotic Analysis of an Algorithm
- 8 Asymptotic Notations
- 9 Analysis and Rules to calculate Big O notation
- 10 One-Dimensional Array
- 11 print elements of an Array
- 12 Remove Even Integers from an Array
- 13 Reverse an Array
- 14 find Minimum value in an Array
- 15 Find Second Maximum value in an Array
- 16 move Zeroes to end of an Array
- 17 resize an Array
- 18 Find the Missing Number in an Array
- 19 check if a given String is a Palindrome
- 20 Create a Singly Linked List
- 21 Print elements of a Singly Linked List
- 22 Find length of a Singly Linked List
- 23 Insert nodes in a Singly Linked List
- 24 Delete nodes of a Singly Linked List
- 25 search an element in a Singly Linked List
- 26 Reverse a Singly Linked List
- 27 find nth node from the end of a Singly Linked List
- 28 remove duplicate from sorted Singy Linked List
- 29 insert a node in a sorted Singly Linked List
- 30 remove a given key from Singly Linked List
- 31 detect a loop in a Singly Linked List
- 32 find start of a loop in a Singly Linked List？
- 33 Why Floyd's Cycle Detection algorithm works？
- 34 remove loop from a Singly Linked List？
- 35 Merge Two Sorted ListsQuestion
- 36 LeetCode #2： Add Two Numbers
- 37 represent a Doubly Linked List
- 38 implement Doubly Linked List
- 39 print elements of a Doubly Linked List
- 40 insert node at the beginning of a Doubly Linked List
- 41 Insert node at the end of a Doubly Linked List
- 42 delete first node in a Doubly Linked List
- 43 delete last node in a Doubly Linked List
- 44 represent a Circular Singly Linked List
- 45 implement a Circular Singly Linked List
- 46 traverse and print a Circular Singly Linked List
- 47 insert node at the start of a Circular Singly Linked List
- 48 insert node at the end of a Circular Singly Linked List
- 49 remove first node from a Circular Singly Linked List
- 50 Stacks
- 51 Next Greater Element
- 52 Valid Parentheses problem Balanced Brackets
- 53 represent a Queue
- 54 implement a Queue
- 55 Generate Binary numbers from 1 to n using a Queue
- 56 Binary Trees
- 57 Search in a row and column wise sorted matrix
- 58 Print a given matrix in Spiral form
- 59 Introduction to Priority Queue and Binary Heap
- 60 represent a Binary Heap
- 61 implement Max Heap
- 62 Bottom - Up Reheapify Swim in Max Heap
- 63 insert in a Max Heap
- 64 Top - Down Reheapify Sink in Max Heap
- 65 delete max element in a Max Heap
- 66 Linear Search
- 67 Binary Search
- 68 Search Insert Position in a Sorted Array
- 69 Bubble Sort
- 70 Insertion Sort
- 71 Selection Sort Algorithm
- 72 merge two sorted arrays
- 73 Merge Sort
- 74 Sort an array of 0’s, 1’s, and 2’s Dutch National Flag Problem
- 75 Quick Sort Algorithm
- 76 Squares of a Sorted Array
- 77 Rearrange Sorted Array in Max⧸Min form
- 78 Graphs
- 79 Number of Islands
- 80 Hashing and Hash Tables
- 81 Contains Duplicate
- 82 Introduction to Intervals and Overlapping Intervals
- 83 Merge Intervals
- 84 Insert Interval
- 85 Trie Data Structures
- 86 Dynamic Programming
- 87 Kadane's Algorithm for Maximum Sum Subarray
- 88 LeetCode: Two Sum
- 89 Is Valid Subsequence problem
- 90 First Non-Repeating Character in a String
- 91 Remove Vowels from a String
- 92 Reverse an Integer
- 93 Remove Element
- 94 Remove Duplicates from Sorted Array
- 95 Three Sum problem Animation
- 96 Product of an Array except self
- 97 Sliding Window Maximum
- 98 Maximum Sum Subarray of Size K
- 99 LeetCode: Longest Substring Without Repeating Characters
- 100 LeetCode: Symmetric Tree
