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 🚀
Построить BST-дерево минимальной высоты из отсортированного массива | Вопрос для собеседования по...
Введение в асимптотические обозначения
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
Сортировка подсчётом: исследование сортировки специальных входных данных за линейное время
Sort A K Sorted Array - Investigating Applications of Min/Max Heaps
Наименьший общий предок между двумя узлами двоичного дерева (рекурсивный подход)
Алгоритм быстрой сортировки: выбор опорного элемента, разбиение и рекурсия
Search A 2D Sorted Matrix - Fundamentals of Search Space Reduction
Быстрое умножение: от умножения в начальной школе до алгоритма Карацубы
The Backtracking Blueprint: The Legendary 3 Keys To Backtracking Algorithms
Асимптотические обозначения 101: Большое О, Большое Омега и Тета (Учебный лагерь по асимптотическ...
Investigating Heap Sort - Why Is Heap Sort Θ(n * log(n))? An Even Longer Really Long Answer.
Обратная польская нотация: типы математических обозначений и использование стека для решения выра...
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
Самая длинная общая подпоследовательность (2 строки) — динамическое программирование и конкурирую...