Implement An LRU Cache - The LRU Cache Eviction Policy ("LRU Cache" on LeetCode)

1

4 Tips To Learn Java Programming As Fast As Possible As A Beginner

Back To Back SWE

2

3 Mistakes Beginners Make When First Learning Java and Android Development

Back To Back SWE

3

How To Get A Job At Google | The Ultimate Guide To Algorithmic/Coding Interviews

Back To Back SWE

4

The Ultimate Big O Notation Tutorial (Time & Space Complexity For Algorithms)

Back To Back SWE

5

Total Occurrences Of K In A Sorted Array (Facebook Software Engineering Interview Question)

Back To Back SWE

6

The N Queens Problem using Backtracking/Recursion - Explained

Back To Back SWE

7

Compute All Mnemonics For A Phone Number (Recursion/Backtracking Problem)

Back To Back SWE

8

How To Reverse A Singly Linked List | The Ultimate Explanation (Iteratively & Recursively)

Back To Back SWE

9

Depth First & Breadth First Graph Search - DFS & BFS Graph Searching Algorithms

Back To Back SWE

10

The 0/1 Knapsack Problem (Demystifying Dynamic Programming)

Back To Back SWE

11

The Dutch National Flag Problem (The Quicksort "Band-Aid")

Back To Back SWE

12

Test If A Binary Tree Is Symmetric ("Symmetric Tree" on Leetcode)

Back To Back SWE

13

The IP Address Decomposition Problem - Compute All Valid IP Addresses From Raw IP String

Back To Back SWE

14

How To Permute A String - Generate All Permutations Of A String

Back To Back SWE

15

The Balanced Parentheses Problem - Classic Stack Problem ("Valid Parentheses" on Leetcode)

Back To Back SWE

16

Knuth–Morris–Pratt (KMP) Pattern Matching Substring Search - First Occurrence Of Substring

Back To Back SWE

▶

Implement An LRU Cache - The LRU Cache Eviction Policy ("LRU Cache" on LeetCode)

Back To Back SWE

18

Find The Longest Increasing Subsequence - Dynamic Programming Fundamentals

Back To Back SWE

19

Generate All Palindromic Decompositions Of A String ("Palindrome Partitioning" on Leetcode)

Back To Back SWE

20

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

Back To Back SWE

21

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

Back To Back SWE

22

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

Back To Back SWE

23

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

Back To Back SWE

24

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

Back To Back SWE

25

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

Back To Back SWE

26

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

Back To Back SWE

27

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

Back To Back SWE

28

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

Back To Back SWE

29

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

Back To Back SWE

30

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

Back To Back SWE

31

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

Back To Back SWE

32

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

Back To Back SWE

33

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

Back To Back SWE

34

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

Back To Back SWE

35

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

Back To Back SWE

36

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

Back To Back SWE

37

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

Back To Back SWE

38

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

Back To Back SWE

39

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

Back To Back SWE

40

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

Back To Back SWE

41

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

Back To Back SWE

42

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

Back To Back SWE

43

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

Back To Back SWE

44

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

Back To Back SWE

45

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

Back To Back SWE

46

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

Back To Back SWE

47

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

Back To Back SWE

48

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

Back To Back SWE

49

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

Back To Back SWE

50

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

Back To Back SWE

51

Egg Dropping Problem: Dynamic Programming Fundamentals & Understanding Subproblem Decomposition

Back To Back SWE

52

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

Back To Back SWE

53

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

Back To Back SWE

54

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

Back To Back SWE

55

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

Back To Back SWE

56

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

Back To Back SWE

57

The Backtracking Blueprint: The Legendary 3 Keys To Backtracking Algorithms

Back To Back SWE

58

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

Back To Back SWE

59

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

Back To Back SWE

60

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

Back To Back SWE