Google Coding Interview with an ex-Microsoft Software Engineer

Rachit, an ex-Microsoft Software Engineer and Clement, an ex-Google Software Engineer do a Mock Coding Interview.

🔥 System Design Course: Educative - Must for experienced SDEs
💰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:
===================

[RachitJain]

Hope this was fun to watch as we simulated a real world Interview over Google Hangouts.
"Going Greedy does result in minimization but it comes at a cost, and that cost is Wrong Answer".

Part II and other links are in the description.

[clem]

How many other people think doing coding interview questions is fun like Rachit and I? 😂

[abhisheksharma-udmz]

i remember giving interview at adobe and totally changing my code at the last while writing. It is always good to be interactive while writing code. Thanks Rachit.

[sidforreal]

love to see how whole YT community helping each other with such collabs

[shanefield]

I have 0 coding ability/experience, and I have no idea what they are talking about. Why am I watching this?!

[diojoestar]

you must be that guy who does all the work in a group project damn.

[dee]

I thought coding interview only caused me to talk weirdly. Now I feel better

[sunnykumarjaiswal]

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 from offcampus. What are the process, what are there expectations from interns, how there resume should look like..

[wian]

Hey Rachit,
I owe you a lot for my learning weekends.
Thanks a ton!! :)

[BleedingKnight]

There's a minor improvement you can do to improve that solution as well. Instead of using an unordered map for storing the favorite strings, you could use a trie instead. Maintain two variables for each trie node, one which stores the list of next pointers from the current node and the other, a boolean variable which tells whether the prefix denoted by the path from the sentinel node to the current node is one of the favorite strings. The checking part is straightforward after that. The time complexity will still be O(n*max_length(favString)) theoretically, but in practice, it'll be much faster than an unordered map based solution because unordered maps have a huge constant factor, which might even be worse than an ordered map based solution sometimes.

[BABRY]

Really nice interaction. Also i think this problem is same as word break O(n^2), chao.

[atulkale]

Thing I learned from this video is to make an interactive interview session, Interviewer should be that much supportive. Please bring such topics which really gives feeling of giving interview with sense of thinking that needs to be followed by candidate while giving interviews.

[chamarakvmadushanka]

This is great great...Just motivated by watching a real programmer's coding. Today I got to know how programmers solving problems and how they are coding and about the steps also. Thank you soo much.lv ya.

[WiseFatOwl]

This is a really interesting question... Gonna search if this question is on any coding platforms.. thanks for the question Clement and Rachit

[AdityaKumar-pblr]

i just learnt how to write hello world in c and now this video is recommended to me.
😑😑

[Nikhil-cjrn]

Loved your channel keep this good work going...hats of man

[navdeepkaushik]

I can done it with recursive, , calling check thrive

[mohamedfazil]

No of "Basically" used by rachit in video is 47 damn high basically😂

[sarthakjoshi]

I was waiting up on you to take care of that -1 part which you obviously did in the end. I think you even made a vid earlier on this type of question.

[nipulsindwani]

Again Quaility content from this channel Thanks a lot