How to approach this course

Understanding Time & Space Complexity

Practice Evaluating Algorithm Efficiency

Developing the Correct Problem Solving Approach

Introduction to Arrays

Interview Question #1 - Cyclic Arrays

Cyclic Arrays - Whiteboard Interview Solution

Cyclic Arrays - Code Solution

Interview Question #2 - Sentence Manipulation

Sentence Manipulation - Whiteboard Interview Solution

Sentence Manipulation - Code Solution

Introduction to Hash Maps, Objects, Dictionaries

Interview Question #4 - Subsequences

Subsequences - Whiteboard Interview Solution

Subsequences - Code Solution

Converting Nested Loops To Linear Time Complexity

Working with Multiple Arrays

Interview Question #5 - Multi-Array Intersection

Multi-Array Intersection - Whiteboard Interview Solution

Multi-Array Intersection - Code Solution

Mutating Arrays w/ Swaps

Interview Question #6 - Array Swapping

Array Swapping - Whiteboard Interview Solution

Array Swapping - Code Solution

Combinations And Subsets

Interview Question #7 - Perfect Sum

Perfect Sum - Whiteboard Interview Solution

Perfect Sum - Code Solution

Interview Question #8 - N-Sum

N-Sum - Whiteboard Interview Solution

N-Sum - Code Solution

Sorting Arrays and Lists

QuickSort Algorithm Deep Dive

QuickSort Algorithm Implementation

Binary Search Deep Dive

Introduction to Linked Lists

Implementing Linked Lists

Interview Question #9 - Linked List Manipulation

Linked List Manipulation - Whiteboard Interview Solution

Linked List Manipulation - Code Solution

Interview Question #10 - Advanced LL Manipulation

Advanced LL Manipulation - Whiteboard Interview Solution

Advanced LL Manipulation - Code Solution

Introduction to Stacks

Implementation of Stacks

Interview Question #11 - Valid Parenthesis

Valid Parenthesis - Code Solution

Interview Question #12 - Sentence Reversal

Sentence Reversal - Whiteboard Interview Solution

Sentence Reversal - Code Solution

Queues Introduction & Implementation

Interview Question #13 - Stack with Queue

Stack with Queue - Whiteboard Interview Solution

Stack with Queue - Code Solution

Interview Question #14 - Queue with Stacks

Queue with Stacks - Whiteboard Interview Solution

Queue with Stacks - Code Solution

Introduction to Binary Search Trees

Insert and Search in Binary Search Trees

Delete Algorithm on Binary Search Trees

Text Solution to BST Implementation

Traversals on Binary Search Trees

Interview Question #15 - Kth Smallest

Kth Smallest - Whiteboard Interview Solution

Kth Smallest - Code Solution

Interview Question #16 - Validating Trees

Validating Trees - Whiteboard Interview Solution

Validating Trees - Code Solution

Introduction to Graphs

Graphs Implementation

Text Solution to Graphs Implementation

Adjacency Matrix with Graphs

Breadth First Search (BFS) on Graphs - Deep Dive

BFS on Graphs - Implementation

Depth First Search (DFS) on Graphs - Deep Dive

DFS on Graphs - Implementation

Interview Question #17 - Cycles in Graphs

Cycles in Graphs - Whiteboard Interview Solution

Introduction to Dynamic Programming

Fundamental Concept of Dynamic Programming

Interview Question #18 - Largest Square

Largest Square - Code Solution

Interview Question #19 - Fibonacci Series

Fibonacci Series - Whiteboard Interview Solution

Fibonacci Series - Code Solution

Principles of OOP

How to Approach Design Interviews

Object Oriented Design Interview Example

Step-by-step Algorithm Design -- Interview Question #20

Step-by-step Algorithm Design -- Whiteboard Interview Example