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