7. Example Of How To Solve Any Leetcode Problem | Welcome to the Coding Interview: You Suck

preview_player
Показать описание
Ever wonder how to go from a naive solution to an optimal solution without cheating on Leetcode questions? I'll show you how here! This time I'm going to try to solve a problem using my heuristic systems that I showed in my last video. Hopefully this shows you how to think about problems you are struggling with!

Welcome To The Coding Interview, You Suck.

► Full Coding Interview Guide Playlist:

► Social!

► Donate

► Want to get coached? Sign up here

As an ex-Apple Engineer, I interviewed dozens of candidates from entry to senior level.

I focus primarily on the thought process and strategy that goes into approaching technical interview questions, how a candidate can be more efficient with their time, and how a candidate can avoid a lot of the non-obvious cues that makes them appear weaker than they really are.

► Music
Рекомендации по теме
Комментарии
Автор

Great series man! Hope you continue this awesome series

rifatmahfuz
Автор

Wow, I think I just found a gem channel !!

codeintern
Автор

Isn't generating subsets also 2^n

rockstar
Автор

It's great video! I have one question for your optimal solution. How can time complexity be O(n) instead of o(x)? I think we need to iterate the timeline array from 0 to x which is the highest index requested to get the answer. Sample code using Java is like below:

wooyoungjeong
Автор

Nice video, but shouldn't the question be the minimum number of rooms needed to support all students who need them without overlapping?

terreyshih
join shbcf.ru