CODING INTERVIEW STEP BY STEP GUIDE | FOLLOW THIS ALGORITHM FOR SUCCESS IN A TECHNICAL INTERVIEW

In this video we are going over my personal algorithm for solving a question in a technical interview. This approach works so well because it ticks all the boxes and gives your interviewer the best signal regarding your coding abilities.
If you follow this guide you'll have the best chances of success, provided you actually answer the question correctly! Nothing I can do to save you if you don't know how to solve it :)
-Timestamps-
00:00 Introduction
01:30 Mock Interview Question Begins
02:15 Question Presented
03:00 Asking Clarifying Questions
04:45 Discussing Proposed Solution Approach
05:50 Start Coding Solution
08:25 Dry Run the Solution
12:00 Time/Space Complexity Analysis
13:05 Algorithm Presentation Begins
13:12 Step #1: Read Question & Re-Iterate Problem Statement
13:37 Step #2: ASK QUESTIONS
15:52 Come Up With A Solution & Discuss with Interviewer
16:00 Code your Solution
16:27 Dry Run Your Solution
17:15 Time/Space Complexity Analysis
17:58 Recap & Outro

[@janhavidesale8755]

If anyone wants to try , it is LC 515. Not exactly the same, instead of product you have to print a list of max values. But you can try your variation in it.
Thanks for this run through!

[@HASEakaLandShark]

Awesome content , preparation and great insight on the tips for interviewing as well! Your work is much appreciated and looking forward to more

[@jonathanlo9210]

This is amazing content! This is literally the secret sauce (after leetcoding) for any technical interview. Thank you so much for your time and effort in helping all of us obtain our dreams.

[@alexandercannon3329]

Great video! Very concise and to the point! Specificity kills ambiguity.

[@steineronie]

This is an incredible video! I've been so anxious about preparing for coding interviews, but you made the process feel so approachable and manageable. I'm really glad this showed up in my recommendations and will definitely be working through the rest of your videos as I continue to prepare for interviews! Thank you and keep up the amazing work :)

[@crackfaang]

Thanks for the kind words! Glad the videos are helping

[@Change510]

I'm glad I found your channel, it has been very helpful for me, especially this video, when I solved questions on leetcode I always skipped step 2 and 5, time to include them in my preparation I guess. I appreciate the videos and am inspired by your consistency of making them.

[@mikelan9854]

amazing video.

[@justlc7]

Highly informative and helpful! Thanks for this.
Requesting Word Ladder 2 in the upcoming videos.

[@crackfaang]

Yes yes it’s in my queue. This week was quite crazy and I only got around to Word Ladder I. Luckily they are basically the same question with some minor details

[@ThisIsntmyrealnameGoogle]

This was super helpful!

[@burneryak1822]

BTW shout out to you for making this amazing video's I really find it amazing. Hope you continue to make more of such kind. What would be even more interesting is creating a small discord channel for this community where one can discuss about future video's/ questions in details.

[@crackfaang]

I will look into this. Though I already have so much on my plate that it’s going to be tricky to then manage a discord server and respond to questions/make sure people aren’t chatting random shit in the server and ruining the experience for others lol

[@burneryak1822]

@@crackfaang You can actually put some restriction's on discord, If you want any help I can manage it for you.

[@ScienceSeekho]

Nice videos

[@fahrettingulmez]

Sir, thank you a lot.

[@anthonyalabado9545]

I'm already here before this channel will reach million subs!

[@crackfaang]

Hell yea brother, one day at a time we get closer to the goal 💪

[@zainablawal97]

It is an amazing video.
Love every concept of it.
I am still anticipating the system design videos as well.
Well done and thank you so much for the free premium content 😊. Emphasis on free please..😀 😊

[@crackfaang]

Haha of course. Content will always be free here. Hopefully in the future I can have a channel sponsor so I can make some money from ads and keep everything free and accessible for everyone

[@Jack-hk6kl]

Besides the awesome sauce that youve given us, I just wanna point out that you kinda sound like Joji

[@pieter5466]

Interesting verification approach of annotating state in a separate comment block, instead of inline with the code. Have you tried both and found this works better?

[@emmanuelonah4596]

You are the best!

[@crackfaang]

Thanks mate!

[@banankulovski]

thanks

[@keerthivasan138]

Another question might be if the values all are positive and non zero numbers

[@TheQuancy]

I dont have trouble with algorithms. I have trouble with the OOP design questions

[@crackfaang]

Systems design series coming very soon. Stay tuned

[@justlc7]

+1

[@AntroullaStasinou]

Is faang similar to the step internship in google

[@ganeshkumar269]

what if the tree contains negative values?

[@crackfaang]

Doesn’t matter, you return the final product. Can be positive, negative, or even zero if you encounter one. Doesn’t matter for this problem but may for others

[@ganeshkumar269]

@@crackfaang Yes you are correct, I shud have read the question more carefuly, guess I failed at step 1 😅

[@mohitpalriwal7157]

Java version:
private static int findMaxProduct(TreeNode root) {
final Queue queue = new LinkedList();
if(root == null) return -1;
queue.add(root);
int result = 1;
while (!queue.isEmpty()) {
int qSize = queue.size();
int max = Integer.MIN_VALUE;
while (qSize-- > 0) { //loop only item at current Level "L"
final TreeNode current = queue.poll();
max = Math.max(max, current.value);
if(current.left != null) queue.add(current.left); //add L+1 level item
if(current.right != null) queue.add(current.right); //add L+1 level item
}
result *= max;
}
return result;
}

[@burneryak1822]

Am I the first one to see this video😅?