LeetCode 815. Bus Routes Detailed Explanation + Coding (Python)

In this video, I walk through, from start to finish, how to do LeetCode 815. Bus Routes. This is a HARD difficulty question that, according to LeetCode, is one of the most frequently seen interview questions on the platform. I walk through an O(m^2) time + O(n+m) memory solution using pointers in detail. At the end, I code up the solution using Python3.

▬ Contents of this video  ▬▬▬▬▬▬▬▬▬▬

00:00 Introduction
00:28 Problem Description
02:00 Examples
04:31 Key Observations
07:32 Solution Implementation
10:54 Solution Visualization
16:29 Big-O Analysis
22:29 Coding Out the Solution

▬ About Algorithms Simplified ▬▬▬▬▬▬

I am a software engineer and computer science student who specializes in mathematics, logic, and algorithms. When I was a 2nd-year university, despite having only started programming for 6 months before my first interview, I received multiple FAANG + other software engineering offers following my interview rounds due to my strength in algorithms. I’d like to bring both my passion for mathematical logic and experience interviewing for software engineering roles to you, the viewers, so that you may be better prepared for your next coding interview.

On this channel, I walk through Leetcode interview questions in excruciating detail, so that you can really understand, not memorize. If you enjoy these walkthroughs and explanations, please consider subscribing, as these videos take a lot of work.

▬ Social Media ▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬

► Business email: [email protected]