06:55

Build A Min Height BST From A Sorted Array | Coding Interview Question

05:17

Introducing Asymptotic Notations

20:38

AVL Trees & Rotations (Self-Balancing Binary Search Trees)

09:55

The New Back To Back SWE Platform (2020 Plans)

21:56

Network Flows: Max-Flow Min-Cut Theorem (& Ford-Fulkerson Algorithm)

20:20

Interval Scheduling Maximization (Proof w/ Exchange Argument)

20:36

Dijkstra's Algorithm vs Prim's Algorithm

06:15

Professor Clyde Kruskal On Kruskal's Algorithm

04:19

i'm starting a coding interview class

06:31

How I Got An Internship @ Twitter

17:10

Why Comparison Based Sorting Algorithms Are Ω(n*lg(n))

55:43

Software Engineer On Negotiating Job Offers & Finding The Right Workplace (Samrat Jha - B2B Show 3)

15:19

Serialize & Deserialize A Binary Tree - Crafting Recursive Solutions To Interview Problems

46:36

Gaurav Sen: Talking Daily Life At Uber & System Design Wisdom (The Back To Back Show - Show 1)

29:13

Find the k'th Largest or Smallest Element of an Array: From Sorting To Heaps To Partitioning

17:28

Counting Sort: An Exploration of Sorting Special Input In Linear Time

14:25

Sort A K Sorted Array - Investigating Applications of Min/Max Heaps

20:30

Lowest Common Ancestor Between 2 Binary Tree Nodes (A Recursive Approach)

26:31

The Quicksort Sorting Algorithm: Pick A Pivot, Partition, & Recurse

29:31

Search A 2D Sorted Matrix - Fundamentals of Search Space Reduction

34:10

Fast Multiplication: From Grade-School Multiplication To Karatsuba's Algorithm

13:44

The Backtracking Blueprint: The Legendary 3 Keys To Backtracking Algorithms

23:16

Asymptotic Notations 101: Big O, Big Omega, & Theta (Asymptotic Analysis Bootcamp)

40:18

Investigating Heap Sort - Why Is Heap Sort Θ(n * log(n))? An Even Longer Really Long Answer.

08:57

Reverse Polish Notation: Types of Mathematical Notations & Using A Stack To Solve RPN Expressions

18:25

Add Two Numbers Without The "+" Sign (Bit Shifting Basics)

22:34

Minimum Window Substring: Utilizing Two Pointers & Tracking Character Mappings With A Hashtable

36:50

Why Is Merge Sort O(n * log(n))? The Really Really Long Answer.

25:39

Egg Dropping Problem: Dynamic Programming Fundamentals & Understanding Subproblem Decomposition

25:31

Longest Common Subsequence (2 Strings) - Dynamic Programming & Competing Subproblems

15:55

All Nodes Distance K In A Binary Tree - Performing Bidirectional Search On A Tree Using A Hashtable

15:00

Implement A Queue Using Stacks - The Queue ADT ("Implement Queue Using Stacks" on LeetCode)

12:56

Binary Tree Level Order Traversal - Drawing The Parallel Between Trees & Graphs

36:39

A Detailed Algorithmic Analysis of Insertion Sort. Best Case & Worst Case.

27:05

Maximum Sum Rectangle In A 2D Matrix - Kadane's Algorithm Applications (Dynamic Programming)

28:47

An In-Depth Algorithmic Analysis of Bubble Sort. Best Case, Average Case, & Worst Case.

08:05

What Is Asymptotic Analysis? And Why Does It Matter? A Deeper Understanding of Asymptotic Notation.

20:00

Binary Tree Bootcamp: Full, Complete, & Perfect Trees. Preorder, Inorder, & Postorder Traversal.

19:38

Max Contiguous Subarray Sum - Cubic Time To Kadane's Algorithm ("Maximum Subarray" on LeetCode)

20:19

Implement A Binary Heap - An Efficient Implementation of The Priority Queue ADT (Abstract Data Type)

10:24

Deeply Understanding Logarithms In Time Complexities & Their Role In Computer Science

17:38

Clone A Linked List (With Random Pointers) - Linear Space Solution & Tricky Constant Space Solution

14:43

Clone An Undirected Graph - The Utility of Hashtable Mappings ("Clone Graph" on Leetcode)

09:36

Merge 2 Sorted Lists - A Fundamental Merge Sort Subroutine ("Merge Two Sorted Lists" on LeetCode)

05:41

Increment An Integer Represented As An Array ("Plus One" on LeetCode)

09:34

Find The Second Largest Item - Heap & Tracking Approach (Beginner Big N Interview Question)

14:17

Test If A Binary Tree Is Height Balanced ("Balanced Binary Tree" on LeetCode)

11:42

Total Unique Ways To Make Change - Dynamic Programming ("Coin Change 2" on LeetCode)

17:49

Search A Maze For Any Path - Depth First Search Fundamentals (Similar To "The Maze" on Leetcode)

19:31

The Recursive Staircase - Top Down & Bottom Up Dynamic Programming ("Climbing Stairs" on LeetCode)

16:37

Implement A Max Stack - A Stack With A .max() API (Similar To "Min Stack" on LeetCode)

12:01

Generate All Strings With n Matched Parentheses - Backtracking ("Generate Parentheses" on LeetCode)

14:18

Count Total Unique Binary Search Trees - The nth Catalan Number (Dynamic Programming)

12:40

Compute The Next Permutation of A Numeric Sequence - Case Analysis ("Next Permutation" on Leetcode)

23:12

The Change Making Problem - Fewest Coins To Make Change Dynamic Programming

11:58

Total Ways To Decode A String - Recursive Dynamic Programming Approach ("Decode Ways" on LeetCode)

16:16

Edit Distance Between 2 Strings - The Levenshtein Distance ("Edit Distance" on LeetCode)

11:03

Partition To K Equal Sum Subsets From An Array of Integers - The Backtracking Approach

11:25

Merge K Sorted Arrays - Min Heap Algorithm ("Merge K Sorted Lists" on LeetCode)

09:53

Implement A Sudoku Solver - Sudoku Solving Backtracking Algorithm ("Sudoku Solver" on LeetCode)