Coding Interview Problem: Calendar Conflicts
Jackson walks through a linear (O(n)) complexity solution to the problem of finding conflicts in a calendar represented as a list of start and end times. The video features code written in PHP. It's written in the style of a Google coding interview (or Facebook, Amazon, etc. company).
▶︎
Coding Interview Problem: Least Disruptive Subrange
▶︎
System Design : Design messaging/chat service like Facebook Messenger or Whatsapp
▶︎
Systems Architecture Interview: Clarifying the Question
▶︎
Mastering Dynamic Programming - How to solve any interview problem
▶︎
How We've Scaled Dropbox
▶︎
System Design Introduction For Interview.
▶︎
How to Solve ANY Coding Interview Question in 6 Steps
▶︎
Data Structure and Algorithm Patterns for LeetCode Interviews – Tutorial
▶︎
How I Approach a New Leetcode Problem (live problem solving)
▶︎
System Design : Design a service like TinyUrl
▶︎
Amazon Coding Interview Question - Recursive Staircase Problem
▶︎
'How to Get a Job at the Big 4 - Amazon, Facebook, Google & Microsoft' by Sean Lee
▶︎
System design : Design Autocomplete or Typeahead Suggestions for Google search
▶︎
Simple Code, High Performance
▶︎
Coding Interview Problem: Dinner Party
▶︎
We're 99.9% sure this pattern is true, but no one can prove it
▶︎
How to Crack a Google Coding Interview - An Ex-Googler’s Guide
▶︎
Creator of C++: Bell Labs, Negative Overhead Abstraction, Mistakes | Bjarne Stroustrup
▶︎
Cracking the Coding Interview at Silicon Valley Code Camp 2016
▶︎