Day 3: Coding Interview Prep With ex-Microsoft Software Engineer

preview_player
Показать описание


🔥 AlgoExpert: Master DS and Algorithms
💰Use "rachit" as coupon code to get 30% off.

AlgoExpert has video solutions to 70 coding problems, covering all the important topics generally asked in Coding Interviews.

🔥 System Design Course: Educative
💰First 100 Users can use "Rachit" as coupon code to get 10% off.

🔥 DailyCodingProblem: Access to Facebook, Google Interview Questions
💰Use "rachit" as coupon code to get 10$ off.

SUBSCRIBE AND HIT BELL ICON TO CHECK MORE OF MY CONTENT

Social Profiles -

================
Important Playlists:
================

MyProgrammingBlog
===============

MyProgrammingProfiles:
===================
Рекомендации по теме
Комментарии
Автор

Sir make c++ series for beginners with DTS and algos. Please bhaiya .😊😊😊

omthecoder
Автор

Nice video. A few comments for code optimisation and readability
1. The if else conditions in the first while loop could be handled by all the statements in else itself. There is no need to check for if res == NULL.
2. You can handle the next two while loops in the first while loop itself (totally only 1 while loop). When you are evaluating sum you can use ternary operator to check if node is null then use 0 otherwise use node->val or else you do this in better way. You can use implement one more method in your Wrapper (actually should be called Helper/Utility) class, let say getVal which will the the value of node if node is not null and if null just return 0.
3. You can add one entry in your hashmap NULL, NULL so whenever get prev is called on NULL node NULL is written and everything would be taken care of.

saurabhjain
Автор

OMG thank you so much for caring about 360p population!
Suggestion - Please do problems on graphs, shortest paths, strings,
bitwise operators etc.

toxicdesire
Автор

Linked Lists are one of the trickiest ADT's to work with. I have been spending a lot of time with them. Circular Singly Doubly everything. Even the easy questions can be tricky

joshuamarcano
Автор

Rachit i just love your content and i know while working in TR you would be so busy and i am grateful of you posting such knowledgeable stuff here, but can you please consider starting a C++ series ?

Rohitsingh
Автор

My Approach to "Add Two Numbers II" :

Iterate through List 1 and calculate the number.
Iterate through List 2 and calculate the other number.

Add them and present its digits in a linked list format.
Return the final link list.

kunal_chand
Автор

Can we use stacks?
Like storing the values of each nodes in two stacks, adding them and then storing the resulting digits into another stack and then create a new linked list and just populate it in the linked list.
It would take a bit of space though, O(n) I suppose.

sohamsen
Автор

Please make some more video on linkedlist. Thanks you very much rachit. these video are very helpful.

GajendraSingh
Автор

Really Loved this one, you literally explained each and every step and complete thought process using that another untitled file!

hargovind
Автор

Why do we need to create a wrapper like structure, we can also do the same thing while traversing the linked list and we can store the previous pointer for each of the nodes, the purpose of using wrapper is still not clear.It would be good if u can explain me.Thanks in advance

aniketrajani
Автор

Great approach for solving! Btw which software do you use to record webcam and screen simultaneously ?

vatsalhirpara
Автор

Hey...Rachit you are doing a great job your videos are very helpful. please make videos on how to get internship in companies like microsoft, google, goldmansachs etc offcampus. What are the process, what are there expectations from interns, how there resume should look like..

sunnykumarjaiswal
Автор

But 0+278=278 right then why it displayed a error?

sriramsudalairaj
Автор

Hey Rachit, I guess we could have also used Stack to accomplish the same task and the space complexity would be the same..

sumeetbhujang
Автор

Some more videos about LL would help us a lot.. thanks for doing the good deed👍

Rubal
Автор

Please continue interview preparation series

adarshsharmanit
Автор

Please make more kind of such videos at a faster pace.

raihanmdsiqbal
Автор

hello rachit. plz, when u suggest ur video for certain topic, mention video link in description. Love ur work. thank u

SauravKumar-kjuu
Автор

I have solve that question before but to take a unordered map to get the previous value of listnode was the smart move.. Show how stl can be use smartly in problems

mridul
Автор

you are amazing and doing a very good job

shubhamk