Back To Back SWE
This channel is our initiative to add to the community of programming interview preparation. It took us a long time to realize while preparing for the first software engineering interview we felt that the resources on programming interviews are not only sparse, but there lacked an abundance of people who could explain answers to interview questions in a way that a student could easily understand.
This channel aims to prepare someone to pass software engineering interviews at "the big 4" companies and any other large tech companies.
Grow with Us and Let's Ace those Interviews 🚀
Build A Min Height BST From A Sorted Array | Coding Interview Question
Introducing Asymptotic Notations
AVL Trees & Rotations (Self-Balancing Binary Search Trees)
The New Back To Back SWE Platform (2020 Plans)
Network Flows: Max-Flow Min-Cut Theorem (& Ford-Fulkerson Algorithm)
Interval Scheduling Maximization (Proof w/ Exchange Argument)
Dijkstra's Algorithm vs Prim's Algorithm
Professor Clyde Kruskal On Kruskal's Algorithm
i'm starting a coding interview class
How I Got An Internship @ Twitter
Why Comparison Based Sorting Algorithms Are Ω(n*lg(n))
Software Engineer On Negotiating Job Offers & Finding The Right Workplace (Samrat Jha - B2B Show 3)
Serialize & Deserialize A Binary Tree - Crafting Recursive Solutions To Interview Problems
Gaurav Sen: Talking Daily Life At Uber & System Design Wisdom (The Back To Back Show - Show 1)
Find the k'th Largest or Smallest Element of an Array: From Sorting To Heaps To Partitioning
Counting Sort: An Exploration of Sorting Special Input In Linear Time
Sort A K Sorted Array - Investigating Applications of Min/Max Heaps
Lowest Common Ancestor Between 2 Binary Tree Nodes (A Recursive Approach)
The Quicksort Sorting Algorithm: Pick A Pivot, Partition, & Recurse
Search A 2D Sorted Matrix - Fundamentals of Search Space Reduction
Fast Multiplication: From Grade-School Multiplication To Karatsuba's Algorithm
The Backtracking Blueprint: The Legendary 3 Keys To Backtracking Algorithms
Asymptotic Notations 101: Big O, Big Omega, & Theta (Asymptotic Analysis Bootcamp)
Investigating Heap Sort - Why Is Heap Sort Θ(n * log(n))? An Even Longer Really Long Answer.
Reverse Polish Notation: Types of Mathematical Notations & Using A Stack To Solve RPN Expressions
Add Two Numbers Without The "+" Sign (Bit Shifting Basics)
Minimum Window Substring: Utilizing Two Pointers & Tracking Character Mappings With A Hashtable
Why Is Merge Sort O(n * log(n))? The Really Really Long Answer.
Egg Dropping Problem: Dynamic Programming Fundamentals & Understanding Subproblem Decomposition
Longest Common Subsequence (2 Strings) - Dynamic Programming & Competing Subproblems