Back To Back SWE

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

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

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

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

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

Coding Interview | Binary Tree Traversal

3 Mistakes Beginners Make When First Learning Java and Android Development

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

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

Coding Interview | Levels of a Binary Tree

How I Got An Internship @ Twitter

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

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

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

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

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

Explained | Priority Queue Functions

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

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

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

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

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

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

Linked Lists Explained | DSA Concept for Beginners

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

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

3 Test Cases You Should Always Keep in Mind

Terms to know | Summation Notation

Dijkstra's Algorithm vs Prim's Algorithm

Important Coding Interview Concept | Parts of a Recursive Function

Important Coding Interview Concept | 3 Keys to Backtracking

The New Back To Back SWE Platform (2020 Plans)

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

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

Coding Interview | Terms to know | API & ADT

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

The Backtracking Blueprint: The Legendary 3 Keys To Backtracking Algorithms

What are Greedy Algorithms?

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

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

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

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

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

Coding Interview Concept | Asymptotic Behaviour

Professor Clyde Kruskal On Kruskal's Algorithm

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

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

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

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

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

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