Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Algorithms, Data Structures and Time Complexity in C++
Introduction
01 Course Overview (9:14)
02. Fizzbuzz (5:41)
03 Types Of Time Complexity (26:17)
Source Code
String and Array Interview Questions
01 Reverse Words In A String (6:30)
02 Rotate Array (14:16)
03 Isomorphic Strings (15:31)
S1 Source Code
Matrix Interview Questions
01 Set Matrix Ones (15:35)
02 Spiral Matrix Cpp (16:46)
03 Number Of Islands (17:35)
S2 Source Code
Linked List Interview Questions
01 Implement A Stack Using An Array (15:02)
02 Add Two Numbers As Reversed Linked Lists (24:07)
03 Reverse A Linked List (12:57)
S3 Source Code
Binary Tree Interview Questions
01 Inorder Traversal (13:30)
02 Preorder Traversal (10:17)
03 Postorder Traversal (10:05)
04 Binary Tree Maximum Path Sum (13:25)
S4 Source Code
Graph Interview Questions
01 Clone An Undirected Graph (13:19)
02 Build A Graph (7:19)
03 Postorder Traversal (10:05)
S5 Source Code
Sorting Interview Questions
01 Bubble Sort Algorithm (13:48)
02 Selection Sort Algorithm (10:56)
03 Insertion Sort Algorithm (4:18)
04 Quicksort Algorithm (11:56)
05 Merge Sort Algorithm (14:55)
06 Time Complexity Of Different Sorting Algorithms (2:55)
S6 Source Code
Time Complexity of Different Sorting Algorithms Slides
Dynamic Programming
01 Coin Change (10:20)
02 Edit Distance (17:04)
03 Distinct Subsequences (12:46)
S7 Source Code
Bit Manipulation Interview Questions
01 Bitwise And Shift Operators (7:02)
02 Single Number (6:09)
03 Number Of 1 Bits (9:03)
04 Sum Of Two Integers (8:17)
05 Reverse Bits (7:49)
06 Bitwise And Of A Range (5:08)
S8 Source Code
Combinations and Permutations Interview Questions
01 Permutations (10:19)
02 Letter Combinations Of A Phone Number (10:34)
03 Factor Combinations (12:16)
S9 Source Code
Math Interview Questions
01 Reverse Integer (7:35)
02 Palindrome Number (8:47)
03 Excel Sheet Column Number (8:06)
S10 Source Code
01 Course Overview
Complete and Continue