Section 1 : Introduction

Lecture 1 Introduction 2:48

Section 2 : Arrays

Lecture 2 Integer Reverse 5:47
Lecture 3 Find Smallest Difference 8:47
Lecture 4 Find Largest Sum in a given Array( Kadene's algorithm ) 5:35

Section 3 : Strings

Lecture 5 Find All Anagrams 7:21
Lecture 6 Find Char In a String 8:11
Lecture 7 String Reverse 3:56

Section 4 : Stack

Lecture 8 Balanced Parantheses 8:1
Lecture 9 Roman Number Conversion

Section 5 : Queue

Lecture 10 Queue data structure 1:2
Lecture 11 Implementing Queue By Stack 7:3

Section 6 : HashMap HashSet

Lecture 12 HashMap Iteration

Section 7 : Search Algorithms

Lecture 13 Binary Search Recursive Iterative 9:3
Lecture 14 Cut Wood 9:45

Section 8 : Sort Algorithms

Lecture 15 Absolute Value Sort
Lecture 16 Pancake Sort 10:39
Lecture 17 Merge Sorted Arrays To New Array
Lecture 18 Sorted Merge 5:5

Section 9 : Object Oriented Design

Lecture 19 LRU Cache 10:30
Lecture 20 Calculator Design with Object Oriented Programming 10:43

Section 10 : Dynamic Programming

Lecture 21 Fibonacci Recursion & Memoization