Google Coding Interview With A Normal Software Engineer

  Рет қаралды 1,637,576

Clément Mihailescu

Clément Mihailescu

3 жыл бұрын

In this video, I conduct a mock Google coding interview with a normal software engineer, Keerti Purswani, who's a software developer based in India. As a Google Software Engineer, I interviewed dozens of candidates. This is exactly the type of coding interview that you would get at Google or any other big tech company.
Check out the other Google coding interview that we filmed on Keerti's channel: • Google Coding Intervie...
AlgoExpert: www.algoexpert.io/clem
SystemsExpert: www.systemsexpert.io/clem
My LinkedIn: / clementmihailescu
My Instagram: / clement_mihailescu
My Twitter: / clemmihai
Prepping for coding interviews or systems design interviews? Practice with hundreds of video explanations of popular interview questions and a full-fledged coding workspace on AlgoExpert - www.algoexpert.io - and use the promo code "clem" for a discount on the platform!

Пікірлер: 2 000
@clem
@clem 3 жыл бұрын
“Google Coding Interview With A __________” - what should the next one be? And be sure to check out the other Google coding interview that we filmed on Keerti’s channel here: kzfaq.info/get/bejne/gK6qi5BmnMrLnmQ.html
@creationduwal
@creationduwal 3 жыл бұрын
myself.
@samarthparnami
@samarthparnami 3 жыл бұрын
Current google employee
@occo5877
@occo5877 3 жыл бұрын
Do more design please, the one you did was awesome
@vedrathi6592
@vedrathi6592 3 жыл бұрын
you said google coding interview 16 times from what I counted
@codewithvath7990
@codewithvath7990 3 жыл бұрын
The next one will be Traversy Media
@Ayoub-adventures
@Ayoub-adventures 3 жыл бұрын
Acording to Mr. KZfaqr, there is a Google Software engineer, a Facebook Software engineer, and a normal Software engineer
@snowhusk
@snowhusk 3 жыл бұрын
These are some weird pokemon types, man
@averageheightwizard4798
@averageheightwizard4798 3 жыл бұрын
I'm dead🤣🤣🤣🤣🤣
@JoanFFF
@JoanFFF 3 жыл бұрын
LMAO so true
@AbdulAhad-pj1mj
@AbdulAhad-pj1mj 3 жыл бұрын
Yeah, idk why this is making me sad
@Doctorchris100
@Doctorchris100 3 жыл бұрын
If you not FAANG, you ain’t gang
@JohnFarrellDev
@JohnFarrellDev 3 жыл бұрын
Is someone still considered "normal" when they have a channel dedicated to soliving algorithmic problems similar to the style asked in Google interviews. Isn't a normal software engineer someone who works as an engineer, probably knows commonly used languages/frameworks but hasn't spent any time working on these types of problems. For example they might be an excellent full stack web developer with experience in React, Vue, Node and Spring but not know how to traverse binary trees because that has never been required in their job.
@BcomingHIM
@BcomingHIM 3 жыл бұрын
there's my man...the true normal/average software engineer 😉. Most of the people fall in this range...and feel insecure about not knowing competitive programming or cloud computing or AI and what not. Unfortunate.
@troys1426
@troys1426 3 жыл бұрын
In Silicon Valley, not Craigs-list level
@JohnFarrellDev
@JohnFarrellDev 3 жыл бұрын
@@BcomingHIM most normal software engineers won't even know what the term competitive programming really means.
@winnumber101
@winnumber101 3 жыл бұрын
You’re right-don’t worry about the classifications he uses
@simpletongeek
@simpletongeek 3 жыл бұрын
I think that the average professional computer programmer is expert at browsing StackOverflow. That should be the skill tested in job interview. Here are some examples: 1. Should Dihydrogen Monoxide be banned? 2. Is filtered water safe to drink? 3. What is the proper way to use GOTO? But my favorite interview question is: Are you Mensa? :p
@scottrobinson2284
@scottrobinson2284 3 жыл бұрын
As a former Facebook, Google, Amazon tech lead, millionaire *sarcasm*..... I didn't even understand the question. "Google coding interview with a rock" would be up my alley
@renocarsons9449
@renocarsons9449 Жыл бұрын
😄
@GameDevNerd
@GameDevNerd Жыл бұрын
I just look at them and ask: "Are you even qualified to be asking me this question?" 🤔 Lmao _this_ comment wasn't the one the world deserved, but it was the one it needed 😂😂😂
@sunnyg989
@sunnyg989 3 жыл бұрын
Not me being nervous when I'm not even the one being interviewed😭
@jorgevasquezang
@jorgevasquezang 3 жыл бұрын
I realized I don't even reach a Normal Software Engineer level
@travellerrana9978
@travellerrana9978 3 жыл бұрын
Same pinch
@jerodewert8334
@jerodewert8334 3 ай бұрын
You are likely both fine, I have been in industry for 10 years, problems like these are quite rare in reality and we solve it over hours.
@AdityaSingh-sq6sw
@AdityaSingh-sq6sw 26 күн бұрын
what about now? did you reach that level?
@crjacinro
@crjacinro 3 жыл бұрын
If this is already a normal engineer, I don't know what kind of engineer already I am. Maybe abnormal?
@vetrit1820
@vetrit1820 3 жыл бұрын
Just curious , are you a his paying software engineer. I am a college student these kind of interviews creep me out
@crjacinro
@crjacinro 3 жыл бұрын
@@vetrit1820 yes i am engineer with 6 year experience
@trusttheprocess4775
@trusttheprocess4775 3 жыл бұрын
Ffs I'm a fresher in computer and Communications engineering. These interviews make me so nervous. Idek why.
@varunmanjunath6204
@varunmanjunath6204 3 жыл бұрын
Software engineering is competitive. Get into data science or cloud.
@harishs4214
@harishs4214 3 жыл бұрын
@@varunmanjunath6204 even data science or cloud is competitive, for everything in IT,if I'm right you need to be good at problem solving
@fusion_flicks95
@fusion_flicks95 2 жыл бұрын
"Does that sound fine?" - That's all i understood.
@nastudio405
@nastudio405 2 жыл бұрын
Heya I am here to explore from scratch and I am watching this nightmare!!! Omg should I lose my interest here 😌
@fusion_flicks95
@fusion_flicks95 2 жыл бұрын
@@nastudio405 Maybe not.
@innovativedevelopers4708
@innovativedevelopers4708 2 жыл бұрын
You guys have not watched it properly. It is not that difficult. It was doable if you let go of pre cognitive bias.
@SolarPlayer
@SolarPlayer 2 жыл бұрын
Man it seems difficult for an interviewer as well trying to follow along with someone forming a nebulous idea into a real solution. And this is with an excellent candidate I can imagine how hard it is if you're interviewing me instead
@stewartzayat7526
@stewartzayat7526 2 жыл бұрын
And imagine doing this like 5 times a day. Sounds like a mental nightmare for the interviewer!
@Mb-eo6bg
@Mb-eo6bg 2 жыл бұрын
It’s not that hard. There’s only so many topics and ways of doing things in computer science - the interviewer is bound to have an idea of whatever solution the candidate is trying to do.
@AaronAsherRandall
@AaronAsherRandall 2 жыл бұрын
Very good point!
@drinkarmor
@drinkarmor Жыл бұрын
@@stewartzayat7526 I give interviews for a startup they can be mentally straining but thankfully you never really do more than 3 a week
@markmd9
@markmd9 Жыл бұрын
The interviewer can simply get silent and nod 😂😂😂
@greentoadboy
@greentoadboy 3 жыл бұрын
At this rate "Google interview with a garbage can" might be more relatable to me
@aleksandartomic9048
@aleksandartomic9048 3 жыл бұрын
Imagine the satisfaction and fulfilment once you actually get to this level though 😲
@ChristianFure
@ChristianFure 3 жыл бұрын
@@aleksandartomic9048 feels so far away
@aleksandartomic9048
@aleksandartomic9048 3 жыл бұрын
@@ChristianFure I wouldn’t put myself down about that, there’s no rush, even if it takes you 10 years to become a very proficient engineer, it would still pay off in the end when you start solving massive problems and teaching others. For the record I’m not a software engineer I’m just someone who has recently started learning to code and am trying to have a positive mindset because personally if I stress, I freeze and slow myself down.
@alexanderarea6157
@alexanderarea6157 3 жыл бұрын
Learn algorithms and discrete maths too
@kage-musha1702
@kage-musha1702 3 жыл бұрын
lmao my man
@a_9414
@a_9414 3 жыл бұрын
I'm officially changing my major to business.....
@adrid.senpai7587
@adrid.senpai7587 3 жыл бұрын
It looks intimidating for sure. But your school should prepare you no? My school has programs and internships to help with this stuff
@sakshamdogra
@sakshamdogra 2 жыл бұрын
@@ElonHusky how and where did you prepare for this?
@shriduttkothari
@shriduttkothari 2 жыл бұрын
@@ElonHusky but you need correct way of how to prepare
@theyellowflash100
@theyellowflash100 2 жыл бұрын
@@ElonHusky How did you prepare?
@benkaplun8431
@benkaplun8431 2 жыл бұрын
I honestly thought the questions would’ve been harder. I came up w a different solution tho w plenty of room for tweaks and optimizations
@skifast_takechances
@skifast_takechances 2 жыл бұрын
Definitely slightly harder than the interviews I did for SWE internships since this is (presumably) for a full-time role, but Keerti solved it amazingly!
@chaseblackbeard
@chaseblackbeard Жыл бұрын
The
@sherwinbangs
@sherwinbangs Жыл бұрын
Actually, I find this technical interview much easier than the ones in (let's say) somewhat big, mid, and not-so-big companies in the CIS area. They all ask questions from the university textbooks. Here I see that the really important things are tested like problem-solving and communication. I always (apparently for absolutely no reason) thought that big companies hire only the absolute monster super coders, which I'm not yet. But now I realize that it's not the case and I even might try landing a job somewhere "big". These videos let me understand that you don't have to be an all-around beast to be just the right person for the position at Google for example.
@AIschooloftrading
@AIschooloftrading 8 ай бұрын
TBH I found These questions like a piece of cake but still unable to get a job 🙃
@boacaandrei2187
@boacaandrei2187 5 ай бұрын
It's one of the easiest I've ever seen
@ashutoshtiwari5222
@ashutoshtiwari5222 3 жыл бұрын
Just here for a reminder that your probability of getting hit by an algo-expert ad on KZfaq is higher than getting yourself a gf .
@sakandchoudhary2941
@sakandchoudhary2941 3 жыл бұрын
Damn, truth hurts 😂
@robert8930
@robert8930 3 жыл бұрын
Imo a normal software engineer is one that hasn't touched algorithms in the last X years and don't remember to do anything similar to this. I was expecting something like that.
@dijiflex
@dijiflex 3 жыл бұрын
😂
@smithcodes1243
@smithcodes1243 3 жыл бұрын
Normal software developers just use different languages, tools and frameworks to solve a given problem. They don't really need to implement any fancy algorithms in their day to day work. They just need to know how to use data structures effectively, at least that is my experience in the industry.
@Jamie-kf2vf
@Jamie-kf2vf 3 жыл бұрын
Exactly. I have 11 years experience in software and there's no way I would've solved this in the allotted time. In fact I probably would've melted. I've built out multi-million pound applications from scratch though. I haven't touched low level algorithms and data structures in many, many years. I would need to practice them again if I was ever deranged enough to want to work for FAANG.
@ab123232
@ab123232 3 жыл бұрын
@@Jamie-kf2vf so after 11 years of experience are u still looking want to be a sw developer, coz i thought that i would be at the manager level after 10 years ?
@Jamie-kf2vf
@Jamie-kf2vf 3 жыл бұрын
@@ab123232 I've helped build a startup and I'm currently founding a new one so I'm building the MVP. The manager thing is unusual because I've done for it a short while but prefer to engineer the application myself (ideally with a team if there's resources). It's true that the longer you work as an engineer, the further removed you become from the underlying algorithms and data structures. Frameworks and tools etc provide abstractions over these, so even easy coding interview exercises can be difficult if you're not familiar with the concepts any more. The question is SHOULD you be familiar with these concepts? Ideally yes, but time is finite and I've never had a job where I've had to reverse a linked list, traverse a binary tree etc and I've worked in many industries (big pharma, fintech, telecoms, real estate). Hell, even 2d arrays haven't made an appearance! It's crazy, but it's the real world and these coding interview questions simply don't reflect that. I'd probably get a basic understanding of them (as I have no interest in applying or working for FAANG) but that's it. I've interviewed people in the past and would never ask anything like these questions. I provided scenarios for the applicant to build incrementally "add a button to do x", "update redux state and show result" etc as they mimic the day-to-day job.
@trocks1722
@trocks1722 3 жыл бұрын
If I ever receive this type of interview, I'll just shut my computer midway in the interview.
@checkoverstripes1464
@checkoverstripes1464 3 жыл бұрын
you're hired!
@jeffreyko8558
@jeffreyko8558 2 жыл бұрын
The questions r hard ngl
@franciscoalmonte8657
@franciscoalmonte8657 2 жыл бұрын
Kudos to Keerti. It takes guts to take a coding interview, let alone publishing video of it for all to see. It was a painful reminder of how broken technical interviews are. Most engineers, especially ones far removed from college, would struggle with this problem. My one critique/takeaway, and I'll phrase it in a positive light: - Ask high quality clarifying questions as early as possible; and - Use that early opportunity to put your interviewer at ease about heading in the right direction, before coding (pseudo or otherwise). For example, I would've asked early on "the problem might have more than one solution, do I only return the first one or return them all?" Again, it's so sad that excellent engineers who "just get s&*t done" would likely fail to adequately answer this question. If anything, Engineers who display good attitudes while attempting to solve these problems should be considered a pass.
@gabrielburgos2533
@gabrielburgos2533 Жыл бұрын
Interesting how you say this, does it depend on the company, or is "just getting shit done" not ever the attitude to show? Coming from all the testing in American education, I'm used to going for speed in most assessments.
@farazahmed7
@farazahmed7 Жыл бұрын
It's not broken. It's just you can't work for it. Accept your failures rather than crying about it
@yougetonthathorseyougottar6126
@yougetonthathorseyougottar6126 Жыл бұрын
@@farazahmed7people with the attitude you have are like a blessing and a curse. On one hand, it’s a benefit to be brutally honest with yourself sometimes so that one can “get shit done”. But I hope you can take what you dish out. On the other hand, it shows that the world is designed to constantly try and tear you down and rip your dreams apart. I willingly opt to encourage people despite how I might feel about their shortcomings, because there are enough of people like you trying to be “honest”.
@Janak217
@Janak217 11 ай бұрын
​@@yougetonthathorseyougottar6126it's not that deep
@yougetonthathorseyougottar6126
@yougetonthathorseyougottar6126 11 ай бұрын
@@Janak217 depends on your perspective. this is mine.
@jakariasami
@jakariasami 3 жыл бұрын
I'm storing these interviews for the future, at this time they are way above my reach 😂
@enhalepositivity9431
@enhalepositivity9431 3 жыл бұрын
Same here 😂😂😁
@sandeeptottadi
@sandeeptottadi 3 жыл бұрын
Same here
@Gummylongtail
@Gummylongtail 3 жыл бұрын
"storying" I'm sure you meant storing...
@siddhantswaroop4376
@siddhantswaroop4376 3 жыл бұрын
same hereee
@aman9267
@aman9267 3 жыл бұрын
😅
@janehoe531
@janehoe531 3 жыл бұрын
"she's not a Olympic competitive programmer, not a one who has won medals..." hold up,,, that's a lot of damage
@andreycuy6541
@andreycuy6541 3 жыл бұрын
why wtf . why do u think every programer have to won medals ?
@janehoe531
@janehoe531 3 жыл бұрын
@@andreycuy6541 *win
@richarddaniel7088
@richarddaniel7088 3 жыл бұрын
@@janehoe531 lol. Flushing out with this mistake correction instead of answering. What a pure personality.
@stsinner05
@stsinner05 3 жыл бұрын
​@@janehoe531 if you are correcting people. At least correct completely and properly. Why? Do you think that every programmer has to have won medals? Why do you think that every programmer has to win medals? Why do you think that every programmer has to have won medals? Why do you think that all programmers have to have won medals? Why do you think that all programmers have to win medals? No one likes a person who shows off limited knowledge.
@janehoe531
@janehoe531 3 жыл бұрын
@@stsinner05 autocorrectExpert!? @clement
@bensas42
@bensas42 2 жыл бұрын
Wow, this question is the one that made me fail the Google interviews a couple of years ago, it was a weird flashback seeing it again!
@sniGGandBaShoR
@sniGGandBaShoR 2 жыл бұрын
i dont get why people have so struggle with it the solutions are kinda easy... i had like 10min to solve it in an more efficient way wtf
@shriduttkothari
@shriduttkothari 2 жыл бұрын
@@sniGGandBaShoR are ex tech lead 😁
@CarzyNavi
@CarzyNavi 3 жыл бұрын
whenever I think I have seen everything in my life, youtube is waiting to suggest me a video.
@manasdange8800
@manasdange8800 3 жыл бұрын
The first question seems really good, would be really helpful if anyone can provide the link to the actual question with all the test cases and constraints!
@ajaydhingra1982
@ajaydhingra1982 3 жыл бұрын
Google coding interview with Tech Lead. That would be fun.
@TheBarinco
@TheBarinco 3 жыл бұрын
I think they have put their conflicts to rest but don't want to be involved with each other anymore
@ajaydhingra1982
@ajaydhingra1982 3 жыл бұрын
Tech lead is a sad guy
@programmer4047
@programmer4047 3 жыл бұрын
A millionaire interviews a millionaire
@Clockendmo
@Clockendmo 3 жыл бұрын
He will say "as a millionaire, I will do..." Every time
@AtriTripathi
@AtriTripathi 3 жыл бұрын
That’d probably bust his myth.
@pratyushkanojia3650
@pratyushkanojia3650 3 жыл бұрын
Imagine replying to a interviewer that I don't know how to do it lol
@nandanapalchowdhury4588
@nandanapalchowdhury4588 2 жыл бұрын
Actually thats what you should do if you truly have no idea. Thats the way real interviews work, to show people that you might not know everything under the sun but you are ready to learn and grow. And all good companies or boards don’t want a robot, of course u have to be skilled but u dont have to be perfect
@sindhumohan1709
@sindhumohan1709 3 жыл бұрын
Great mock interview. Loved it. Please keep posting more inspiring content.
@thaiproud2b12
@thaiproud2b12 3 жыл бұрын
I think we should see you do a mock interview- would be interesting!
@CARRYMINATI_Y
@CARRYMINATI_Y 3 жыл бұрын
She tries her best, I also learn a lot of things from this interview.
@steelsteez6118
@steelsteez6118 2 жыл бұрын
She's also a cutie 😍
@shriduttkothari
@shriduttkothari 2 жыл бұрын
@@steelsteez6118 when first he said kirti, I heard cutie 🤣🤣🤣😂😂😂
@napoleonborntoparty8654
@napoleonborntoparty8654 3 жыл бұрын
This question was nearly never ending.... There goes my selfconfidence
@suriname9253
@suriname9253 3 жыл бұрын
Life is too short for coding interviews. If you really enjoy doing them, okay, do it. But if you hate them, there are plenty of other nice jobs and options, just because FAANG decided that this is the way software engineers are measured doesn't mean this is truly reflecting your skills and abilities.
@nishantverma9169
@nishantverma9169 2 жыл бұрын
So tell us, what other methods are there???? 🙃🙂🙃🙂
@puneetwasan771
@puneetwasan771 2 жыл бұрын
@@nishantverma9169 Development, Android , IOS, Web, that's what I know. Other trendy things I have heard of are , Machine learning, Data Science, AI, Blockchain.
@greenapple9204
@greenapple9204 2 жыл бұрын
So true 🥲
@steelsteez6118
@steelsteez6118 2 жыл бұрын
@@ElonHusky in my company you just need to know how to build sand castles with bucket and sand shovel. And we are top Forbes 500. All depends on your company.
@Pointlessparodys
@Pointlessparodys 2 жыл бұрын
Seriously this shit is so stupid. Why can't I just go back to google and find the applicable algorithm I learned and forgot about in college
@kumarvs66
@kumarvs66 3 жыл бұрын
For your information , she shares her knowledge in her KZfaq channel which help people to crack interviews in companies like Google, Walmart etc
@davidreviews8413
@davidreviews8413 3 жыл бұрын
Clement : Normal SWE Me : Hug...all SWEs are legends!!
@hanjelly5410
@hanjelly5410 3 жыл бұрын
this video is so great, really similar to the real interview.
@thecomputerman5042
@thecomputerman5042 2 жыл бұрын
Really enjoyed the mock interview. Hopefully, I have learned some things from it. Keerti does look like has done serious practice with Algorithmic problem-solving.
@kage-musha1702
@kage-musha1702 3 жыл бұрын
Literally No One: Not even Google: Clement: Google coding interview
@TheHippyHoppyHippo
@TheHippyHoppyHippo 3 жыл бұрын
lmfao
@vikasc89581
@vikasc89581 2 жыл бұрын
🤣😂🤣😂
@TebiByyte
@TebiByyte 3 жыл бұрын
I'm using these videos to prepare for any future coding interviews I get, and for the most part it's been helpful in learning some strategies for problem solving, but man it's difficult to follow the logic here. Nothing really gets explained and it hurts.
@jay8929
@jay8929 2 жыл бұрын
I think it's better to fix problems on leetcode one by one for diving into these algorithm details. As to this video, it works better for those person who just want to know what the real interview feel like.
@alxolr
@alxolr Жыл бұрын
I came up with a video to help people understand more deeply what is going on: kzfaq.info/get/bejne/nNxzg7eImsnLgZ8.html
@MathTech83
@MathTech83 2 жыл бұрын
My background is not in software development (about to head down that path), but I have had a great deal of exposure to graph theory. I believe the first problem could be modeled with a complete graph with the blocks as nodes and the edges weighted with distances between them. Then use an algorithm like Kruskal’s to find the minimum-weighted spanning tree connecting the nodes.
@pratheekbhat9647
@pratheekbhat9647 2 жыл бұрын
If you're going to use greedy technique then, the time complexity will be higher
@Ari-jm6xx
@Ari-jm6xx 2 жыл бұрын
I'm not very good with algorithms, but my first thought was that this was a graph problem. I started thinking about Shortest Path.
@dineshmohanty9229
@dineshmohanty9229 2 жыл бұрын
In prims or kruskal one will have to traverse the entire graph I.e we are supposed to include all the blocks in our spanning tree.. That is a bit different and wouldn't work in this case... modified Floyd warshall might have worked in this case I guess
@tommasochiti4237
@tommasochiti4237 Жыл бұрын
the moment he said shortest distance i thought about graphs and nodes too ngl
@user-wy5es3xx2t
@user-wy5es3xx2t 9 ай бұрын
ok so how will u calculate distance of each building from the apartment(which is the weight basically) without traversing multiple times?
@The7shabir
@The7shabir 3 жыл бұрын
OMG Keerti in Clement's channel! 😱😱😱 She was my senior in college and I got super excited to see her in Clement's thumbnail. Yet to watch the full video! 😅😄
@vaalarivanvaalariva1388
@vaalarivanvaalariva1388 3 жыл бұрын
Which clg bro?
@shaf8200
@shaf8200 3 жыл бұрын
@@vaalarivanvaalariva1388 Algo Expert io
@vaalarivanvaalariva1388
@vaalarivanvaalariva1388 3 жыл бұрын
@@shaf8200lolololol bruh 😂
@jathins6809
@jathins6809 3 жыл бұрын
@@shaf8200 nani??😂😂
@rudraneelghosh5309
@rudraneelghosh5309 3 жыл бұрын
@@vaalarivanvaalariva1388 NIT calicut.
@samatbryan
@samatbryan 3 жыл бұрын
Assuming in real life num preferences
@techhackz2897
@techhackz2897 3 жыл бұрын
keerti explained the approach very beautifully. really liked how she was able to show that dp part that was awesome. my thoughts : so when u are going from the right to left what I was thinking is create another dp(dp2). find the max of that block and then compare dp1 and dp2 for min of the block and return the index. but we don't have to do another loop and compare both dps in keerti's approach so keerti really optimize the program
@slimshady5864
@slimshady5864 Жыл бұрын
Or you could just store the max when going back from right to left only!
@shashwatsharma4420
@shashwatsharma4420 3 жыл бұрын
Waiting for an interview with a psycho software engineer, that'll be fun.
@krishnavala2748
@krishnavala2748 3 жыл бұрын
😅
@abhisheksankpal261
@abhisheksankpal261 3 жыл бұрын
XD
@Ryan-gq9nr
@Ryan-gq9nr 3 жыл бұрын
"So how I would approach this problem is to repeatedly punch my monitor and type the word SOLVE until I got fired."
@tessy28
@tessy28 3 жыл бұрын
😂
@danyloi
@danyloi 3 жыл бұрын
I kinda like watching this being a doctor
@chiragagrawal3501
@chiragagrawal3501 3 жыл бұрын
Please make a seprate playlist that contains all these coding interviews. Sometimes if I get stuck on some question there is nobody to answer those... A discord group would be enough I guess.
@sdcair
@sdcair 2 жыл бұрын
My solution would have been to have a stack for every requirement, where each stack has the indices of blocks in which that requirement is true. We fill the stacks by iterating in reverse over the blocks. Now iterate over the blocks forward, and maintain for each requirement the index of the last blocks, where that requirement has been true. At every index, for every requirement, the minimum distance is the max of the "last seen true index" and the top of the stack. Take the max over all requirements, and pop the stack when we pass the top index. Minimize over the answer values for each index. Time complexity O(n * m), space complexity O(n * m), where n is number of blocks, and m is number of requirements.
@josiahroa177
@josiahroa177 2 жыл бұрын
I'd love to see you do one of these interviews with a software developer/full-stack developer that is good with frameworks like React, Vue, Angular, Node, Spring, .Net, etc... but doesn't really see these kind of 'google' problems at their job. That seems like more of a regular software engineer to me at least.
@xfire3778
@xfire3778 2 жыл бұрын
Have you not seen Clement’s two Ben Awad interviews?
@TheAndre2131
@TheAndre2131 2 жыл бұрын
lol most likely google engineers themselves don't see these kind of problems in their jobs. Software development is an artform which is so much more than just spamming the most optimal solution in a pressured 45 minute time period.
@anikets4699
@anikets4699 2 жыл бұрын
I'm that normal fullstack developer, I can't even answer language feature questions. 😂😅
@-Deco
@-Deco 2 жыл бұрын
Interview questions like this are a painful reminder that underlying knowledge for problem solving is required. The first question in particular if the candidate can think of the problem in a assumptions based approach, it becomes much easier to solve. There will be an assumption that "true" = 1, and "false" = 0, and there can be a second assumption made the number of elements in the array will match the requirements. (3 requirements will mean there is 3 elements per block), and with these we can break it down to a pretty simple solution. Fetch the number of requirements from the list and it will be represented as an integer. Take the total amount of indexes in the array, and divide them by the requirements (e.g. 12 elements and 3 requirements will be 12/3 resulting in 4 blocks). A third assumption can be made that the requirements and array indexes will match each other in their order set. Knowing this, initialise a loop e.g. (for the total number in the list, when an index of (the maximum number (4) is hit), take the total sum, and assign it to a unique counter in a subloop increment the loop by one, till the maximum number (4) counters are present. Once you've broken it down this far, the solution becomes relatively straightforward to solve as you have everything you need. Simply loop the for each element in the index with the counter, and output the result (e.g. "counter1 = 2, counter2 = 1, counter3=3, counter 4=0"). You now have the result per block in the array, meaning to find the smallest distance of each block, simply find the lowest integer of each counter. Now to find the smallest possible distance out the entire array, you will take the smallest counter, with whichever index (in a -1/+1 iteration) is the next smallest index from each other, you've now got the shortest possible distance. Alternatively for those curious these types of questions are excellent for parallelism. We can take the same approach and stream each block to calculate it's minimum, then apply the last approach, skipping the need for 40 different loops.
@codychaffin9224
@codychaffin9224 2 жыл бұрын
@@anikets4699 I get that man same here 😂
@syednadeembe
@syednadeembe 3 жыл бұрын
She got me so confused that i almost forgot what i was watching...
@Southpaw101
@Southpaw101 5 ай бұрын
That's a great interview trick .... If you can't solve it ... CONFUSE the interviewer :)
@jessebroxton8687
@jessebroxton8687 3 жыл бұрын
I think she was suppose to set dp[i][m] to zero again in second set of nested for loops because she would be carrying the previous max value over when the updated could possibly be smaller
@AG-uu7nm
@AG-uu7nm 3 жыл бұрын
No think again she has to carry it
@tseramed35
@tseramed35 2 жыл бұрын
Her algo does not work because in the second iteration (from end to begin), some dp[i][m] have INT_MAX value from the first iteration, so that the max function cannot return something smaller anymore... I tested her program with the debugger and in the end, the dp[i][m] have these values: - dp[0][m]: INT_MAX - dp[1][m]: INT_MAX - dp[2][m]: INT_MAX - dp[3][m]: INT_MAX - dp[4][m]: 2 So clearly, it cannot work and return index 3 as the best solution... I wonder whether Clément did not see the problem or if he didn't want to tell her...
@connorg8259
@connorg8259 3 жыл бұрын
Just curious, I am almost done my first year of a csc program at the university of Victoria. I have worked with python and java. As far as complexity we have worked with recursion, linked lists, stacks/queues, and will soon be moving into trees and such. Would algoExpert be good for extra practice, or are the questions more targeted toward experienced programmers getting ready for an interview?
@chudchadanstud
@chudchadanstud 3 жыл бұрын
My first thought on the 1st one. Check block for 1 of the items item, search for how far the next item is and calculate the distance. Store the index of the smallest block, if it's 0. Just print the index, no need to search. Obviously is can be improved as this is quite slow and intensive. My second step was to grid the data and see if the items will organise themselves in a pattern.
@heyitsyeh
@heyitsyeh 3 жыл бұрын
Damn she rocked it! Dp always scares me :(
@franciscov511
@franciscov511 3 жыл бұрын
it is not hard, it is just about to remember key things of dp
@salsaSamuel
@salsaSamuel 2 жыл бұрын
this wasn't dp btw. she just named it that
@andrewshirley9240
@andrewshirley9240 2 жыл бұрын
@@salsaSamuel It's technically DP, because you're using the solution from a previous subset to construct the answer for the current one. That's all DP is, is a fancy name for finding base cases, storing them, and building the solution base-case-up.
@tonymcfarlan9593
@tonymcfarlan9593 2 жыл бұрын
Just started programming and watching this made me realize I got a long way to go
@whonayem01
@whonayem01 2 жыл бұрын
Thanks! Would appreciate if you do some more like this, Clem.
@shwackthenoobsac
@shwackthenoobsac 3 жыл бұрын
This was intimidating but I finally solved it with JavaScript after a few hours of trying. Hopefully one day I can get to this level.
@miscEngineer
@miscEngineer 3 жыл бұрын
I bled in my Google interviews, the questions were so harsh.. I wish life was so easy 😭😭😭
@trusttheprocess4775
@trusttheprocess4775 3 жыл бұрын
:(
@numseidizer
@numseidizer 3 жыл бұрын
Harsh?
@miscEngineer
@miscEngineer 3 жыл бұрын
The easiest question I had in my interview involved 2D DP in a DAG after topologically sorting it.
@andrerhea4168
@andrerhea4168 3 жыл бұрын
@@miscEngineer how did you become better, I recently started coding.
@miscEngineer
@miscEngineer 3 жыл бұрын
@@andrerhea4168 I practiced on leetcode and participated in leetcode contests
@theebulll
@theebulll 3 жыл бұрын
I have been really enjoying these videos! If you ever want an amateur programmer with no professional experience to try one of these just let me know. I don't have much of a formal education but I believe I could take one of these on 💪
@anoopkb
@anoopkb 3 жыл бұрын
I think the easiest and best approach ( in my way ) would be to run a euclidean algorithm ( with each need as a feature ) which automatically calculates the distance between every block. Which will return the best route.
@preciouscodes1188
@preciouscodes1188 2 жыл бұрын
The same I was thinking 👍
@HTWwpzIuqaObMt
@HTWwpzIuqaObMt 2 жыл бұрын
Thought the same thing
@d96yt4
@d96yt4 2 жыл бұрын
My brain could not process the your sentence
@HTWwpzIuqaObMt
@HTWwpzIuqaObMt 2 жыл бұрын
@@d96yt4 wtf bro
@treyshaffer
@treyshaffer 2 жыл бұрын
Your solution, if I understand it correctly, is suboptimal. It would be O(n^2 * m) time while her solution is O(n + m) time
@littlemini39
@littlemini39 6 ай бұрын
I coded the following solution: 1) maintaining the map for list of indexes where each of the required building is placed so eg map mp;// where key could be "office" or "gym" and vector would contain the list of the blocks where the specific building appears. this loop will take me o(block array size*req array size) also the vector list would be in pre sorted order 2) I would look through each block and then loop through each requirement then I would do a binary search to find the nearest index where this required building appears and store max_idx (maximum of all of the nearest indexes where the required building is found) and min_idx(minimum of all the nearest indexes where the required building is found) and my result would be max(result,max_idx-min_idx+1) such that I would be then return result. the time complexity for this one o(block array size*req array size* log(req array size)).
@Kruxxy
@Kruxxy 3 жыл бұрын
A normal software engineer is a stackoverflow expert. This person is beyond normal.
@srivatskrishnamoorthy5948
@srivatskrishnamoorthy5948 3 жыл бұрын
I am from a hardcore bpo background, but after seeing this video...I love to learn coding 👍
@y_nk
@y_nk 3 жыл бұрын
the amount of time of "google coding interview" is said within the 2 first minutes is crazy.
@MomsDailyCorner
@MomsDailyCorner 3 жыл бұрын
While watching this interview I realize the truth that the MNC interview that I attended was too simple. From a 5yr java developer.
@patrykblu838
@patrykblu838 3 жыл бұрын
Normal Software Engineer? It's kind of offensive
@53strat55
@53strat55 3 жыл бұрын
Why, because you want to feel special?
@patrykblu838
@patrykblu838 3 жыл бұрын
@@53strat55 What I mean is that, yes, there are several types of developers (in experience). We have for example Junior/Regular/Senior developer. It is not known what this term means. As you say, normal... So she doesn't have much skills?
@53strat55
@53strat55 3 жыл бұрын
@@patrykblu838 Well normal is a relative concept. It all depends on a persons skill level so I don't really understand how people get offended by such a statement. I'm nowhere near a developer myself lol btw.
@patrykblu838
@patrykblu838 3 жыл бұрын
​@@53strat55 Thank you for your answer. I don't think there is a term "normal developer" in our industry. Hence my answer ;)
@53strat55
@53strat55 3 жыл бұрын
@@patrykblu838 Makes sense seeming its a relative concept but I understand. It does imply there is some special type of developer, only makes me wonder what that would be according to this channel. He could have left it out imo, but I was simply wondering why people felt offended by it. Thanks for your explanation.
@stauber28
@stauber28 2 жыл бұрын
Wouldn't optimal distance solution be to store last index for each location as you go. Once you find all locations, find distance halfway between min and max indexes. Only re-calculate and check against existing distance when you find a new location.
@haimmichalashvili8251
@haimmichalashvili8251 2 жыл бұрын
@Keerti Purswani , Actually, in the first for loop(left->right direction), it is not necessary to operate the min function, because if (blocks[i][j]) equals False, dp[i][j] sure equal to INT_MAX , and if (dp[i-1][j] != INT_MAX) then I just need to assign dp[i][j] = dp[i-1][j] + 1, without the operation of min function
@gabrielbittar2337
@gabrielbittar2337 3 жыл бұрын
The idea here in my opinion is to find the block that travel no more than 1 from the above/below blocks. Index 3 which is the correct answers, allows you to be between or in the center of the block 2 and block 4 which have at least one of the requirements as true. So you need to travel only one from block 3 to block 4 and at same time you also travel only one from block 3 to block 2. Therefore index 3 is the most optimal choice in order to travel the minimum distance between blocks and meet the requirements. Let’s say if you chose index 2 as the correct answer you gonna travel twice from index 2 to index 4 in order to meet the requirements ( the store is true ). Both index 3 and index 1 which is above/below index 2, have the store as false. Therefore index 2 is not the Optimum choice in order to get to travel at the minimum distance which is 1. I’m very new to coding and I don’t know any programming language to solve this problem technically. I’m just giving my logical solutions to this problem so please correct me if I got anything wrong.
@Nekroz05
@Nekroz05 2 жыл бұрын
9 mo late, but if i perceive it correctly If you just check a block with 1 distance to be completed, what if there are block that need 4 distance for gyms and 1 for store, while any other blocks need at least 2 for both. Or what if there are no block that needs 1 distance. I'm also not an expert at this, so please correct me too if i'm wrong.
@aishat3808
@aishat3808 2 жыл бұрын
Clement I think for the level of probably most of the people that subscribe to your channel, a "normal software engineer" would be probably someone who has some experience coding and developing software and starting to learn about algorithms etc. I think a lot of people that look for videos like this fall into that category. The ideal person should not be someone too experienced like this or it defeats the purpose.
@rayhanmahmudshihab
@rayhanmahmudshihab 3 жыл бұрын
While walking alone a few hours ago I was thinking how many times did I see you with beard :3
@adityadeore4649
@adityadeore4649 2 жыл бұрын
Have not seen her solution yet but I would 1. loop through and keep a list for each required building at which index it exists O(N) 2. for each index where a building does not exist do a binary search for the closest building on the list. The list would be sorted by index and save the values in another list. o(kNlogN) 3. finally loop thorough the list and find the minimum O(N)
@zhussupov
@zhussupov 2 жыл бұрын
We can solve the first problem using sliding window approach. Basically, what we need is the shortest subsequence that has all of the requirements and just put an apartment in the middle of it.
@aditnegi2577
@aditnegi2577 3 жыл бұрын
=> Iterate over blocks => make a copy of reqs => Start walking towards left and right simultaneously or condition => Iterate over sub-block => if element is true and is in reqs, remove element from reqs and update distance. => repeat till reqs is empty => keep track of minimum this is what my approach would be kinda brute force, should be improved upon
@anonymousstranger3113
@anonymousstranger3113 2 жыл бұрын
5 mins of thinking: Sliding window works. Here's how it work: [left, right] be the minimum length includes all reqs, then left++,find smallest right include all reqs again, repeat this procedure. Every window you find is the candidates, just find the window with smallest length and the middle block should be the answer. I give this question medium level.
@xriwarrior4329
@xriwarrior4329 Жыл бұрын
we may settal in the middle of the window. say, window=[gym, empty, settal here, school, market]
@t-zex4650
@t-zex4650 12 күн бұрын
yeah I was surprised the dynamic programming was used here.
@jatindersinghaujla
@jatindersinghaujla 3 жыл бұрын
seriously after watching this video I realize where I am standing right now way too far. she has done quite well I can imagine how difficult it was to face such a coding interview. But need a lot more practice to achieve such kind of level. Thanks for making such kind of video. At the initial time, I was thinking it's easy to do but when I reached around 11:30 minutes of video things are going over my head. Head off to those people who face such kinds of interviews. I think she is far better.
@KeertiPurswani
@KeertiPurswani 2 жыл бұрын
Thanks Jatinder, I have doubted myself for a long time. You can do much better than you think. You will surprise yourself ✌️✌️😇😇
@kapilbhardwaj4680
@kapilbhardwaj4680 2 жыл бұрын
Kisan Aandolan Zindabad.
@patronam9396
@patronam9396 2 жыл бұрын
@@KeertiPurswani im in my first year of b.tech and im already sh*ttin my pants 😅🙃.
@chowderwhillis9448
@chowderwhillis9448 Жыл бұрын
@@patronam9396 wtf is the matter with you??
@sanatani5399
@sanatani5399 2 жыл бұрын
A DP solution? Didn’t expect that. For me, a BFS solution seems more intuitive. We can start with the block_0 as the source and run it to the block_n as the sink. Along the way, will keep updating the distance to the amenities. Then, for the subsequent blocks, we can use the previous block’s distances to compute this block’s distance to the amenities.
@ahmedbashir5012
@ahmedbashir5012 3 жыл бұрын
Me: see’s title with google and clement in the same sentence Also me:clicks automatically 💀
@ajaydhingra1982
@ajaydhingra1982 3 жыл бұрын
Clement, banking technology is a different ballgame. how about algo interview with a banker. i volunteer myself.
@SatyamKumar-ts2jh
@SatyamKumar-ts2jh 3 жыл бұрын
Dude she's a software engineer at Intuit. I still am in my 3rd year B.Tech, but honestly that is pretty impressive, and not just "Normal" software engineer. But yeah, google still wins.
@touaxiong5285
@touaxiong5285 3 жыл бұрын
I would have loved to see you do a mock interview with TechLead, but probably not something you’d want to do considering what happened between your company and him.
@AlgosWithKartik
@AlgosWithKartik 3 жыл бұрын
Really useful videos, great work!
@em_nikhil_007
@em_nikhil_007 3 жыл бұрын
Kartik bhaiya OP 🤩
@shubho5das
@shubho5das 3 жыл бұрын
Wish to see you next on Clement's Video, haha!
@nurkanatkhametov6225
@nurkanatkhametov6225 2 жыл бұрын
For the second question the main problem is to find the index of the first false value for each case. Binary search can help us with that. Then we have to divide value of that index by number of tests on this build. Here we can just iterate over all builds and find maximal percentage. Time complexity O(nlogm), space O(1)
@MyGroo
@MyGroo Жыл бұрын
You cannot use binary search because there can be true values after the false one. You just need percentages. You need to build a list of percentages by simply counting the true/false items, which is O(n) per list.
@diya.codes93
@diya.codes93 7 ай бұрын
I don’t think you have true after the false in the same list. Look at the samples
@ericnail1
@ericnail1 4 ай бұрын
You loop once, then inside, a second loop starting from the current index increments an offset that checks both forwards and backwards in the array simultaneously until each key is found or the distance of any key is greater than the current max.
@Haylem
@Haylem 2 жыл бұрын
so hard to follow, what makes a great engineer is making it easy to understand.
@akihihi
@akihihi 3 жыл бұрын
Everytime he says "Google coding interview" I am going to add extra days to my no fast food week🤣🤣🤣
@casperes0912
@casperes0912 3 жыл бұрын
I got to a correct brute force before she did, but hadn't thought of dynamic programming until she mentioned it, which was rather clever :)
@OptiMystic-IN
@OptiMystic-IN 3 жыл бұрын
Honestly, I was able to think of that O(nnm) brute force approach as well. I have little knowledge of DP. But what she said after that how it became O(nm), I have no idea... suggestions? 😅
@BharCode09
@BharCode09 2 жыл бұрын
I was thinking of solving using postfix and prefix dist calculation for each requirements from both directions of linear array. Then having a consolidated calculation of dist (using post and Prefix Dist) to find the one with minimal max dist.
@SiddharthBhadauria
@SiddharthBhadauria 2 ай бұрын
LOL! How are you going to use binary search in the second question if the size of the list is different all the time. It will take O(N) time itself to calculate the end bound of that list before you can start with binary search to find the first false. So it eventually is O(N) itself. Am I missing something here ?
@RizkiFikriansyah
@RizkiFikriansyah 3 жыл бұрын
I had coding interview where I had to solve the problem by explaining it step by step to the interviewer, while he's the one who writes the code. It's really frustrating.
@datsrough6217
@datsrough6217 3 жыл бұрын
Weird
@najeei7794
@najeei7794 3 жыл бұрын
Feels terrifying 😖
@urugulu1656
@urugulu1656 2 жыл бұрын
actually makes sense. peer programming is a thing and also businesses needs people that really really can write code and come up with algorithmns and communicate with other people. when you can explain the solution well and precise enough that not only shows technical skill but also softskills which are also high priority usually. also could be a test on whether you could be not only a developer but also a system architect at some point
@Haylem
@Haylem 2 жыл бұрын
That seems like a nightmare... Only if the interviewer is a complete idiot, other-wise that's a perfect team if ya'll think alike.
@aurinator
@aurinator 3 жыл бұрын
The approach I was initially thinking was to compute the distance to each one at each square, e.g. [gym, 0], [school, n], and [office, 2], where 'n' is the number of squares to reach the location. Then, you've reduced it to a linear-programming problem that would probably be solved on pen & paper with matrices. And, she appeared to initially tread down this route - still watching.
@swarishdashora1963
@swarishdashora1963 2 жыл бұрын
Enjoyed watching this interview... Good way to understand what is needed in a google interview.
@SchmittySchfin
@SchmittySchfin 2 ай бұрын
For the first one, this as a simple sliding window problem. The question is essentially “What is the smallest sub-array that contains a value of ‘true’ for each requirement? Return the midpoint of that sub-array.” A variable size sliding window algorithm solves this with time O(n) and space O(k), with k being the requirements size. For those unfamiliar with the algorithm: Store two positions - left and right (both ints, start at 0). Create a map where we will store the amount of “true” values we’ve seen as we go across. Look at the right position and, for each requirement, add the requirement as a key and the index’s bool cast to an int as the value into the map. If any of the requirements are still zero, increment the right position and add that new index’s values to the map. Continue incrementing the right position until every requirement is greater than 0. If that distance is a better solution than you’ve seen, store it. Shrink the window by incrementing the left position, subtracting the values of the position you just cut out. Keep going until you have a zero. If the last distance to have non-zero’s is better than what you’ve found, store it. Go back and repeat the whole process until the right position hits the end.
@ec8483
@ec8483 11 сағат бұрын
Much clever way, but still got a O(n) time complexity though.
@talanky
@talanky 3 жыл бұрын
Wow she nailed it!
@swazza3071
@swazza3071 3 жыл бұрын
There is a bug in first part of interview. While doing right to left traversal that is i=n-2 to 0, she must set if(dp[i][m]==INT_MAX) dp[i][m]=0. Otherwise if dp[i][m] is set to INT_MAX while left to right traversal the following line dp[i][m] = max(dp[i][m], dp[i][j]) won't get updated as it is storing INT_MAX which is highest value already. Left to right Right to left as per her code Dry run : // 1 * 0 * * 1 0 4 * // 2 0 1 * * 0 1 3 * // 3 0 0 * * 0 0 2 * // 4 1 0 * * 1 0 1 * // 5 2 0 0 2 2 0 0 2 As per her code answer will be 5th instead of 4th
@kolesplace
@kolesplace 2 жыл бұрын
Please publish how many times we heard "Google Coding Interview" 😂 I like the natural conversation aspect of this video. Nice job.
@timlabi23
@timlabi23 Жыл бұрын
Just out of curiosity, is there any chance that the problem could have been solved using a directed graph? I feel like each block can be identified using a vertex, and the available building be represented using edges, I can try solving this, but just wondering why this shouldn't pass for a graph problem?
@Alex-hr2df
@Alex-hr2df Жыл бұрын
As a software engineer I don't even waste my time applying with companies that "test" me this way. Solving this "puzzle" is not that hard, but 99.99% of such challenges are never going to be real cases at work. Big companies blackmail poor young developers with their money and names. Arrogance and narcissism through the roof!
@AnkitSaini-ij6wl
@AnkitSaini-ij6wl 3 жыл бұрын
Someone: are you a software engineer? Googler: NO! I’m Google engineer.
@ChongFrisbee
@ChongFrisbee 3 жыл бұрын
First idea just having listened to the problem. First, iterate trough the array compiling the distances from initial index to last, for each relevantbuilding type. Some kind of infinity representation must be used until the first of each building type is found Then, make a second pass through the array from last to initial index, updating the previously calculated values when distance is lower. And you can keep track of minimal distance indices in that 2nd pass. There probably is some subtlety there I'm not seeing, because that doesn't seem that hard. EDIT: I don't know why I thought this was ment to be a hard question. It doesn't say that anywhere
@amitwithglasses
@amitwithglasses 3 жыл бұрын
This same question was asked to me in a interview, I wish I had watched this video earlier
@sdksfo487
@sdksfo487 3 жыл бұрын
The optimal solution for qn 1 is with sliding window. We are looking for the smallest window that meets all the requirements.
@magesRNTcute
@magesRNTcute 2 жыл бұрын
And the result that you would store is the mid point between the left and right of the window - as it has the minimum distance
@sarveshchavan4391
@sarveshchavan4391 2 жыл бұрын
Can u please share me the questions link if you have one or some similar sort of problem ?
@sdksfo487
@sdksfo487 Жыл бұрын
@@magesRNTcute yep, mid point of that window.
@agmharry
@agmharry 2 жыл бұрын
I'm not a programmer. I did watched this channel last time and it made me headache lol. Somehow, I did finish python for the beginner course about a year ago. After watched this video, I'm also impressed with this Keerti.
@mohammadsolaiman9579
@mohammadsolaiman9579 2 жыл бұрын
just watched the video . now i feel the headache. lol 😂
@ChillAutos
@ChillAutos Жыл бұрын
This dude really worked at facebook for 3 months and knows it all lmao.
@trunghieuphan5229
@trunghieuphan5229 2 жыл бұрын
explain very clearly, i think i had studied a lot from your interview, thank so much
@abhayvashokan5580
@abhayvashokan5580 3 жыл бұрын
You are the nemesis to the programmer's girlfriend memes :’-)
Google Coding Interview With A High School Student
57:24
Clément Mihailescu
Рет қаралды 4 МЛН
Google Coding Interview With A College Student
59:57
Clément Mihailescu
Рет қаралды 1,5 МЛН
Why You Should Always Help Others ❤️
00:40
Alan Chikin Chow
Рет қаралды 135 МЛН
OMG🤪 #tiktok #shorts #potapova_blog
00:50
Potapova_blog
Рет қаралды 17 МЛН
a day in the life of an engineer working from home
8:42
Joma Tech
Рет қаралды 20 МЛН
Become A Software Engineer For Free (Class 01) - 100Devs
3:23:06
Leon Noel
Рет қаралды 649 М.
Google Coding Interview With A Facebook Software Engineer
49:59
Clément Mihailescu
Рет қаралды 923 М.
Mock Technical Interview - Javascript Developer Entry Level
1:36:22
Tech with Nader
Рет қаралды 490 М.
Software Engineering Job Interview - Full Mock Interview
1:14:29
freeCodeCamp.org
Рет қаралды 1,3 МЛН
Winning Google Kickstart Round A 2020 + Facecam
17:10
William Lin
Рет қаралды 9 МЛН
Google system design interview: Design Spotify (with ex-Google EM)
42:13
IGotAnOffer: Engineering
Рет қаралды 1 МЛН
Medium Google Coding Interview With Ben Awad
51:27
Clément Mihailescu
Рет қаралды 1,2 МЛН
Advice from the Top 1% of Software Engineers
10:21
Kevin Naughton Jr.
Рет қаралды 3,2 МЛН
Секретный смартфон Apple без камеры для работы на АЭС
0:22
Asus  VivoBook Винда за 8 часов!
1:00
Sergey Delaisy
Рет қаралды 1,1 МЛН
Gizli Apple Watch Özelliği😱
0:14
Safak Novruz
Рет қаралды 3,6 МЛН
cute mini iphone
0:34
승비니 Seungbini
Рет қаралды 4,7 МЛН