Cracking the Coding Interview - Fullstack Academy Speaker Series

[@GmoneyMozart]

1:29:10 is the best part of the video. You can tell she's like "boy if you don't sit your ass down, ain't nobody got time fo dat".

[@congdatt]

2023, this vide is still value to me

[@NckNck-pu9vb]

41:35 Why is it BigO(n+n) ? I still believe the answer is BigO(n) that being linear time. From what I understand, (n+n) really is the same as (2n) which is just proportional is to n. Kind of a loaded question if you ask me! Its really (n+m) as they are two different arrays. I would have asked the question to clarify they are 2 different arrays. Also - glad to see I proved myself seconds later with her other question.

[@NckNck-pu9vb]

It would be O(n) if you were asked to sum one array twice...

[@firecopy]

42:47 You misheard! McDowell does say the answer is O(m + n) or O(a + b) for that question.

[@ralphstube]

1.11 camera not panning to whiteboard😤, 1.12 camera pans to whiteboard😌

[@ArthurSwails]

Great info there.

[@generalqwer]

48:10 You can learn this stuff in a week or two? Wow really.

[@ImNehs]

Good Watch thanks alot!

[@IsaacC20]

How do you implement vectors?

[@justpk5773]

It is exactly same as Array-list in java but the methods related to Vectors are Synchronised(Each thread can use a vector once at a time). Hence vectors performance is low(Increases waiting time of remaining threads). But vectors are thread safe to solve problems on Data Inconsistency. Use same implementations of Array-Lists but make all methods synchronised.

[@trollhelps]

rofl @ cracking the coder interview. Get people skills on top of your coding skills, win. Tho difficult