Important Coding Interview Concept | Parts of a Recursive Function #shorts #datastructures
Back To Back SWE
Important Coding Interview Concept | Parts of a Recursive Function #shorts #datastructures
0:57
What is Hashing? | Hashtables Explained #datastructures #hashtable
Back To Back SWE
What is Hashing? | Hashtables Explained #datastructures #hashtable
0:58
What are Greedy Algorithms?
Back To Back SWE
What are Greedy Algorithms?
0:54
Linked Lists Explained | DSA Concept for Beginners
Back To Back SWE
Linked Lists Explained | DSA Concept for Beginners
0:55
Build A Min Height BST From A Sorted Array | Coding Interview Question
Back To Back SWE
Build A Min Height BST From A Sorted Array | Coding Interview Question
6:55
3 Test Cases You Should Always Keep in Mind #shorts #datastructures
Back To Back SWE
3 Test Cases You Should Always Keep in Mind #shorts #datastructures
0:49
Coding Interview | Levels of a Binary Tree #shorts #datastructures #binarytree #codinginterview
Back To Back SWE
Coding Interview | Levels of a Binary Tree #shorts #datastructures #binarytree #codinginterview
0:57
Coding Concept You Should Know | Finding the Largest & Smallest Item #shorts #datastructures
Back To Back SWE
Coding Concept You Should Know | Finding the Largest & Smallest Item #shorts #datastructures
0:38
Explained | Flow Network #shorts #datastructures #codinginterview #dsa
Back To Back SWE
Explained | Flow Network #shorts #datastructures #codinginterview #dsa
1:00
Coding Interview | QuickSort Overview #shorts #datastructures #codinginterview
Back To Back SWE
Coding Interview | QuickSort Overview #shorts #datastructures #codinginterview
0:44
Coding Interview Concept | Asymptotic Behaviour #shorts #datastructures #codinginterview
Back To Back SWE
Coding Interview Concept | Asymptotic Behaviour #shorts #datastructures #codinginterview
0:58
Explained | Priority Queue Functions #shorts #datastructures #codinginterview #dsa
Back To Back SWE
Explained | Priority Queue Functions #shorts #datastructures #codinginterview #dsa
0:54
Terms to know | Summation Notation  #shorts #datastructures #codinginterview
Back To Back SWE
Terms to know | Summation Notation #shorts #datastructures #codinginterview
0:59
Coding Interview | Terms to know | API & ADT  #shorts #datastructures #codinginterview
Back To Back SWE
Coding Interview | Terms to know | API & ADT #shorts #datastructures #codinginterview
0:50
Coding Interview | Binary Tree Traversal #shorts #datastructures #binarytree #codinginterview
Back To Back SWE
Coding Interview | Binary Tree Traversal #shorts #datastructures #binarytree #codinginterview
0:56
Important Coding Interview Concept | 3 Keys to Backtracking #shorts #datastructures
Back To Back SWE
Important Coding Interview Concept | 3 Keys to Backtracking #shorts #datastructures
0:52
Introducing Asymptotic Notations
Back To Back SWE
Introducing Asymptotic Notations
5:17
AVL Trees & Rotations (Self-Balancing Binary Search Trees)
Back To Back SWE
AVL Trees & Rotations (Self-Balancing Binary Search Trees)
20:38
The New Back To Back SWE Platform (2020 Plans)
Back To Back SWE
The New Back To Back SWE Platform (2020 Plans)
9:55
Network Flows: Max-Flow Min-Cut Theorem (& Ford-Fulkerson Algorithm)
Back To Back SWE
Network Flows: Max-Flow Min-Cut Theorem (& Ford-Fulkerson Algorithm)
21:56
Interval Scheduling Maximization (Proof w/ Exchange Argument)
Back To Back SWE
Interval Scheduling Maximization (Proof w/ Exchange Argument)
20:20
Dijkstra's Algorithm vs Prim's Algorithm
Back To Back SWE
Dijkstra's Algorithm vs Prim's Algorithm
20:36
Professor Clyde Kruskal On Kruskal's Algorithm
Back To Back SWE
Professor Clyde Kruskal On Kruskal's Algorithm
6:15
i'm starting a coding interview class
Back To Back SWE
i'm starting a coding interview class
4:19
How I Got An Internship @ Twitter
Back To Back SWE
How I Got An Internship @ Twitter
6:31
Why Comparison Based Sorting Algorithms Are Ω(n*lg(n))
Back To Back SWE
Why Comparison Based Sorting Algorithms Are Ω(n*lg(n))
17:10
Software Engineer On Negotiating Job Offers & Finding The Right Workplace (Samrat Jha - B2B Show 3)
Back To Back SWE
Software Engineer On Negotiating Job Offers & Finding The Right Workplace (Samrat Jha - B2B Show 3)
55:43
Serialize & Deserialize A Binary Tree - Crafting Recursive Solutions To Interview Problems
Back To Back SWE
Serialize & Deserialize A Binary Tree - Crafting Recursive Solutions To Interview Problems
15:19
Gaurav Sen: Talking Daily Life At Uber & System Design Wisdom (The Back To Back Show - Show 1)
Back To Back SWE
Gaurav Sen: Talking Daily Life At Uber & System Design Wisdom (The Back To Back Show - Show 1)
46:36
Find the k'th Largest or Smallest Element of an Array: From Sorting To Heaps To Partitioning
Back To Back SWE
Find the k'th Largest or Smallest Element of an Array: From Sorting To Heaps To Partitioning
29:13
Counting Sort: An Exploration of Sorting Special Input In Linear Time
Back To Back SWE
Counting Sort: An Exploration of Sorting Special Input In Linear Time
17:28
Sort A K Sorted Array - Investigating Applications of Min/Max Heaps
Back To Back SWE
Sort A K Sorted Array - Investigating Applications of Min/Max Heaps
14:25
Lowest Common Ancestor Between 2 Binary Tree Nodes (A Recursive Approach)
Back To Back SWE
Lowest Common Ancestor Between 2 Binary Tree Nodes (A Recursive Approach)
20:30
The Quicksort Sorting Algorithm: Pick A Pivot, Partition, & Recurse
Back To Back SWE
The Quicksort Sorting Algorithm: Pick A Pivot, Partition, & Recurse
26:31
Search A 2D Sorted Matrix - Fundamentals of Search Space Reduction
Back To Back SWE
Search A 2D Sorted Matrix - Fundamentals of Search Space Reduction
29:31
Fast Multiplication: From Grade-School Multiplication To Karatsuba's Algorithm
Back To Back SWE
Fast Multiplication: From Grade-School Multiplication To Karatsuba's Algorithm
34:10
The Backtracking Blueprint: The Legendary 3 Keys To Backtracking Algorithms
Back To Back SWE
The Backtracking Blueprint: The Legendary 3 Keys To Backtracking Algorithms
13:44
Asymptotic Notations 101: Big O, Big Omega, & Theta (Asymptotic Analysis Bootcamp)
Back To Back SWE
Asymptotic Notations 101: Big O, Big Omega, & Theta (Asymptotic Analysis Bootcamp)
23:16
Investigating Heap Sort - Why Is Heap Sort Θ(n * log(n))? An Even Longer Really Long Answer.
Back To Back SWE
Investigating Heap Sort - Why Is Heap Sort Θ(n * log(n))? An Even Longer Really Long Answer.
40:18
Reverse Polish Notation: Types of Mathematical Notations & Using A Stack To Solve RPN Expressions
Back To Back SWE
Reverse Polish Notation: Types of Mathematical Notations & Using A Stack To Solve RPN Expressions
8:57
Add Two Numbers Without The "+" Sign (Bit Shifting Basics)
Back To Back SWE
Add Two Numbers Without The "+" Sign (Bit Shifting Basics)
18:25
Minimum Window Substring: Utilizing Two Pointers & Tracking Character Mappings With A Hashtable
Back To Back SWE
Minimum Window Substring: Utilizing Two Pointers & Tracking Character Mappings With A Hashtable
22:34
Why Is Merge Sort O(n * log(n))? The Really Really Long Answer.
Back To Back SWE
Why Is Merge Sort O(n * log(n))? The Really Really Long Answer.
36:50
Egg Dropping Problem: Dynamic Programming Fundamentals & Understanding Subproblem Decomposition
Back To Back SWE
Egg Dropping Problem: Dynamic Programming Fundamentals & Understanding Subproblem Decomposition
25:39
Longest Common Subsequence (2 Strings) - Dynamic Programming & Competing Subproblems
Back To Back SWE
Longest Common Subsequence (2 Strings) - Dynamic Programming & Competing Subproblems
25:31
All Nodes Distance K In A Binary Tree - Performing Bidirectional Search On A Tree Using A Hashtable
Back To Back SWE
All Nodes Distance K In A Binary Tree - Performing Bidirectional Search On A Tree Using A Hashtable
15:55
Implement A Queue Using Stacks - The Queue ADT ("Implement Queue Using Stacks" on LeetCode)
Back To Back SWE
Implement A Queue Using Stacks - The Queue ADT ("Implement Queue Using Stacks" on LeetCode)
15:00
Binary Tree Level Order Traversal - Drawing The Parallel Between Trees & Graphs
Back To Back SWE
Binary Tree Level Order Traversal - Drawing The Parallel Between Trees & Graphs
12:56
A Detailed Algorithmic Analysis of Insertion Sort. Best Case & Worst Case.
Back To Back SWE
A Detailed Algorithmic Analysis of Insertion Sort. Best Case & Worst Case.
36:39
Maximum Sum Rectangle In A 2D Matrix - Kadane's Algorithm Applications (Dynamic Programming)
Back To Back SWE
Maximum Sum Rectangle In A 2D Matrix - Kadane's Algorithm Applications (Dynamic Programming)
27:05
An In-Depth Algorithmic Analysis of Bubble Sort. Best Case, Average Case, & Worst Case.
Back To Back SWE
An In-Depth Algorithmic Analysis of Bubble Sort. Best Case, Average Case, & Worst Case.
28:47
What Is Asymptotic Analysis? And Why Does It Matter? A Deeper Understanding of Asymptotic Notation.
Back To Back SWE
What Is Asymptotic Analysis? And Why Does It Matter? A Deeper Understanding of Asymptotic Notation.
8:05
Binary Tree Bootcamp: Full, Complete, & Perfect Trees. Preorder, Inorder, & Postorder Traversal.
Back To Back SWE
Binary Tree Bootcamp: Full, Complete, & Perfect Trees. Preorder, Inorder, & Postorder Traversal.
20:00
Max Contiguous Subarray Sum - Cubic Time To Kadane's Algorithm ("Maximum Subarray" on LeetCode)
Back To Back SWE
Max Contiguous Subarray Sum - Cubic Time To Kadane's Algorithm ("Maximum Subarray" on LeetCode)
19:38
Implement A Binary Heap - An Efficient Implementation of The Priority Queue ADT (Abstract Data Type)
Back To Back SWE
Implement A Binary Heap - An Efficient Implementation of The Priority Queue ADT (Abstract Data Type)
20:19
Deeply Understanding Logarithms In Time Complexities & Their Role In Computer Science
Back To Back SWE
Deeply Understanding Logarithms In Time Complexities & Their Role In Computer Science
10:24
Clone A Linked List (With Random Pointers) - Linear Space Solution & Tricky Constant Space Solution
Back To Back SWE
Clone A Linked List (With Random Pointers) - Linear Space Solution & Tricky Constant Space Solution
17:38
Clone An Undirected Graph - The Utility of Hashtable Mappings ("Clone Graph" on Leetcode)
Back To Back SWE
Clone An Undirected Graph - The Utility of Hashtable Mappings ("Clone Graph" on Leetcode)
14:43
Merge 2 Sorted Lists - A Fundamental Merge Sort Subroutine ("Merge Two Sorted Lists" on LeetCode)
Back To Back SWE
Merge 2 Sorted Lists - A Fundamental Merge Sort Subroutine ("Merge Two Sorted Lists" on LeetCode)
9:36
Increment An Integer Represented As An Array ("Plus One" on LeetCode)
Back To Back SWE
Increment An Integer Represented As An Array ("Plus One" on LeetCode)
5:41
Find The Second Largest Item - Heap & Tracking Approach (Beginner Big N Interview Question)
Back To Back SWE
Find The Second Largest Item - Heap & Tracking Approach (Beginner Big N Interview Question)
9:34
Test If A Binary Tree Is Height Balanced ("Balanced Binary Tree" on LeetCode)
Back To Back SWE
Test If A Binary Tree Is Height Balanced ("Balanced Binary Tree" on LeetCode)
14:17
Total Unique Ways To Make Change - Dynamic Programming ("Coin Change 2" on LeetCode)
Back To Back SWE
Total Unique Ways To Make Change - Dynamic Programming ("Coin Change 2" on LeetCode)
11:42
Search A Maze For Any Path - Depth First Search Fundamentals (Similar To "The Maze" on Leetcode)
Back To Back SWE
Search A Maze For Any Path - Depth First Search Fundamentals (Similar To "The Maze" on Leetcode)
17:49
The Recursive Staircase - Top Down & Bottom Up Dynamic Programming ("Climbing Stairs" on LeetCode)
Back To Back SWE
The Recursive Staircase - Top Down & Bottom Up Dynamic Programming ("Climbing Stairs" on LeetCode)
19:31
Implement A Max Stack - A Stack With A .max() API (Similar To "Min Stack" on LeetCode)
Back To Back SWE
Implement A Max Stack - A Stack With A .max() API (Similar To "Min Stack" on LeetCode)
16:37
Generate All Strings With n Matched Parentheses - Backtracking ("Generate Parentheses" on LeetCode)
Back To Back SWE
Generate All Strings With n Matched Parentheses - Backtracking ("Generate Parentheses" on LeetCode)
12:01
Count Total Unique Binary Search Trees - The nth Catalan Number (Dynamic Programming)
Back To Back SWE
Count Total Unique Binary Search Trees - The nth Catalan Number (Dynamic Programming)
14:18
Compute The Next Permutation of A Numeric Sequence - Case Analysis ("Next Permutation" on Leetcode)
Back To Back SWE
Compute The Next Permutation of A Numeric Sequence - Case Analysis ("Next Permutation" on Leetcode)
12:40
The Change Making Problem - Fewest Coins To Make Change Dynamic Programming
Back To Back SWE
The Change Making Problem - Fewest Coins To Make Change Dynamic Programming
23:12
Total Ways To Decode A String - Recursive Dynamic Programming Approach ("Decode Ways" on LeetCode)
Back To Back SWE
Total Ways To Decode A String - Recursive Dynamic Programming Approach ("Decode Ways" on LeetCode)
11:58
Edit Distance Between 2 Strings - The Levenshtein Distance ("Edit Distance" on LeetCode)
Back To Back SWE
Edit Distance Between 2 Strings - The Levenshtein Distance ("Edit Distance" on LeetCode)
16:16
Partition To K Equal Sum Subsets From An Array of Integers - The Backtracking Approach
Back To Back SWE
Partition To K Equal Sum Subsets From An Array of Integers - The Backtracking Approach
11:03
Merge K Sorted Arrays - Min Heap Algorithm ("Merge K Sorted Lists" on LeetCode)
Back To Back SWE
Merge K Sorted Arrays - Min Heap Algorithm ("Merge K Sorted Lists" on LeetCode)
11:25
Implement A Sudoku Solver - Sudoku Solving Backtracking Algorithm ("Sudoku Solver" on LeetCode)
Back To Back SWE
Implement A Sudoku Solver - Sudoku Solving Backtracking Algorithm ("Sudoku Solver" on LeetCode)
9:53
Generate All Palindromic Decompositions Of A String ("Palindrome Partitioning" on Leetcode)
Back To Back SWE
Generate All Palindromic Decompositions Of A String ("Palindrome Partitioning" on Leetcode)
11:56
Find The Longest Increasing Subsequence - Dynamic Programming Fundamentals
Back To Back SWE
Find The Longest Increasing Subsequence - Dynamic Programming Fundamentals
19:21
Implement An LRU Cache - The LRU Cache Eviction Policy ("LRU Cache" on LeetCode)
Back To Back SWE
Implement An LRU Cache - The LRU Cache Eviction Policy ("LRU Cache" on LeetCode)
13:31
Knuth–Morris–Pratt (KMP) Pattern Matching Substring Search -  First Occurrence Of Substring
Back To Back SWE
Knuth–Morris–Pratt (KMP) Pattern Matching Substring Search - First Occurrence Of Substring
17:25
The Balanced Parentheses Problem - Classic Stack Problem ("Valid Parentheses" on Leetcode)
Back To Back SWE
The Balanced Parentheses Problem - Classic Stack Problem ("Valid Parentheses" on Leetcode)
11:43
How To Permute A String - Generate All Permutations Of A String
Back To Back SWE
How To Permute A String - Generate All Permutations Of A String
28:37
The IP Address Decomposition Problem - Compute All Valid IP Addresses From Raw IP String
Back To Back SWE
The IP Address Decomposition Problem - Compute All Valid IP Addresses From Raw IP String
13:45
Test If A Binary Tree Is Symmetric ("Symmetric Tree" on Leetcode)
Back To Back SWE
Test If A Binary Tree Is Symmetric ("Symmetric Tree" on Leetcode)
12:17
The Dutch National Flag Problem (The Quicksort "Band-Aid")
Back To Back SWE
The Dutch National Flag Problem (The Quicksort "Band-Aid")
10:54
The 0/1 Knapsack Problem (Demystifying Dynamic Programming)
Back To Back SWE
The 0/1 Knapsack Problem (Demystifying Dynamic Programming)
20:30
Depth First & Breadth First Graph Search - DFS & BFS Graph Searching Algorithms
Back To Back SWE
Depth First & Breadth First Graph Search - DFS & BFS Graph Searching Algorithms
15:22
How To Reverse A Singly Linked List | The Ultimate Explanation (Iteratively & Recursively)
Back To Back SWE
How To Reverse A Singly Linked List | The Ultimate Explanation (Iteratively & Recursively)
14:08
Compute All Mnemonics For A Phone Number (Recursion/Backtracking Problem)
Back To Back SWE
Compute All Mnemonics For A Phone Number (Recursion/Backtracking Problem)
17:55
The N Queens Problem using Backtracking/Recursion - Explained
Back To Back SWE
The N Queens Problem using Backtracking/Recursion - Explained
14:29
Total Occurrences Of K In A Sorted Array (Facebook Software Engineering Interview Question)
Back To Back SWE
Total Occurrences Of K In A Sorted Array (Facebook Software Engineering Interview Question)
14:04
The Ultimate Big O Notation Tutorial (Time & Space Complexity For Algorithms)
Back To Back SWE
The Ultimate Big O Notation Tutorial (Time & Space Complexity For Algorithms)
17:20
How To Get A Job At Google | The Ultimate Guide To Algorithmic/Coding Interviews
Back To Back SWE
How To Get A Job At Google | The Ultimate Guide To Algorithmic/Coding Interviews
16:57
3 Mistakes Beginners Make When First Learning Java and Android Development
Back To Back SWE
3 Mistakes Beginners Make When First Learning Java and Android Development
7:37
4 Tips To Learn Java Programming As Fast As Possible As A Beginner
Back To Back SWE
4 Tips To Learn Java Programming As Fast As Possible As A Beginner
5:13