Section 1 : Introduction
|
|
Lecture 1 | Introduction | 00:02:48 Duration |
Section 2 : Arrays
|
|
Lecture 1 | Integer Reverse | 00:05:47 Duration |
|
|
Lecture 2 | Find Smallest Difference | 00:08:47 Duration |
|
|
Lecture 3 | Find Largest Sum in a given Array( Kadene's algorithm ) | 00:05:35 Duration |
Section 3 : Strings
|
|
Lecture 1 | Find All Anagrams | 00:07:21 Duration |
|
|
Lecture 2 | Find Char In a String | 00:08:11 Duration |
|
|
Lecture 3 | String Reverse | 00:03:56 Duration |
Section 4 : Stack
|
|
Lecture 1 | Balanced Parantheses | 00:08:01 Duration |
|
|
Lecture 2 | Roman Number Conversion |
Section 5 : Queue
|
|
Lecture 1 | Queue data structure | 00:01:02 Duration |
|
|
Lecture 2 | Implementing Queue By Stack | 00:07:03 Duration |
Section 6 : HashMap HashSet
|
|
Lecture 1 | HashMap Iteration |
Section 7 : Search Algorithms
|
|
Lecture 1 | Binary Search Recursive Iterative | 00:09:03 Duration |
|
|
Lecture 2 | Cut Wood | 00:09:45 Duration |
Section 8 : Sort Algorithms
|
|
Lecture 1 | Absolute Value Sort | |
|
|
Lecture 2 | Pancake Sort | 00:10:39 Duration |
|
|
Lecture 3 | Merge Sorted Arrays To New Array | |
|
|
Lecture 4 | Sorted Merge | 00:05:05 Duration |
Section 9 : Object Oriented Design
|
|
Lecture 1 | LRU Cache | 00:10:30 Duration |
|
|
Lecture 2 | Calculator Design with Object Oriented Programming | 00:10:43 Duration |
Section 10 : Dynamic Programming
|
|
Lecture 1 | Fibonacci Recursion & Memoization |
