In this video, I conduct an easy Google coding interview with Ben Awad, a software engineer and tech KZheadr. As a Google Software Engineer, I interviewed dozens of candidates. This is an easier version of the type of coding interview that you would get at Google or any other big tech company.
Want to see me get interviewed by Ben Awad? Check out the video we made on his channel: • Beginner React.js Codi...
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!
What’s more cocky and sarcastic than Ben Awad? Ben Awad after he successfully reverses a linked list. Check out the video we did on Ben’s channel if you wanna see _me_ get interviewed by Ben! kzhead.info/sun/mtKkoqirnGuHfps/bejne.html
you guys are making awesome content, making software engineering fun
Can i apply and get an interview at Google when I'm living overseas? Or do i have to move to the US before applying for the job...
What advice do you have for us foreigners?
😂
kzhead.info/sun/ZqmqmcinnGR_op8/bejne.html
Hey, why does Ben get the easy question!!! I had to suffer through the very hard one for a whole hour 😑
R.I.P
coding interviews are truly broken.......it just went brrr
Rip
Hey Tim you can watch the title , it says " Easy interview " And I think you r better than awad in coding 😏😉⚘
but thanks ;)
I imagine this guy saying "idk that's pretty sus" in the actual interview and the google techlead be like "Aight, you in"
AMOGUS KEANU REEVES REDDIT WHOLESOME 100 EPIC GAMER MOMENT GOOGLE APPROVED INTERVIEW
@@ZVEKOfficial ok
@@ZVEKOfficial this was 11 months ago, give it a rest brainlet
Clem : Do you have any questions for us ? Ben : How on earth can you keep using Angular ?
Clement you should interview more beginners and see their progress in a couple of months. this would be really fun and interesting
It'll be awesome! 🚀
calling ben a beginner DAMN
@@list9016 bro did you see how much he struggled to reverse a linked list? Clearly a beginner, at least with data structures and algorithms
@@jomalomal these things take practice ,it's nothing magical with them.
@@jomalomal you're confusing the meaning of a "beginner" to programming to the meaning of knowing how to study particular coding problems like reversing a linked list. I might have studied linked lists in a college class. But programming for 5 years + earning more than 6 figures. I have never needed to know how to reverse a linked list. But once I looked at the problem, studied it and learnt it fully within a couple hours. So I'm saying you're confusing studying leetcode questions to being a beginner to coding. You can program without knowing a lot of these questions like inverting a binary tree. All those questions only show you know how to study for an exam. Ben is clearly not a beginner, he's programmed a lot. He just didn't take time to study those Leetcode questions
I love Clement giggling at Ben's every move
That's what happens when you interview a natural comedian.
@@clem ehm👀 do you mean he is a joke?😂😂
@@nomadvagabond1263 nope his live is a joke 😂😂😂
Im subscribed to both and am happy to finally see you two in action. Had fun watching this and the one on Ben's channel! Cannot wait for the follow up videos on both sides. xD
This video was super fun, I myself love frontend engineering and I'm a big fan of both you and Ben Awad, so I'd definitely like to see you put him through a real google coding interview.
It's kind of fun seeing a master failing a bit in other master's craft. Great video clement.
There is a video on my Algoexpert ad 😂
*changes d to D and calls it Big D in a coding interview* Interviewer - HHHHHMMMMMMMM 👀
tel me the timestamp for when that happened! Please!
@@aryamankukal1056 pretty much at the beginning, first question when he starts commenting the way
Dallas is also referred to as The Big D 😂
@@aryamankukal1056 6:48
Finally someone who noticed
Ben looks so much happier in this video then he does in any of his own.
You should interview him for Angular
I think Ben would just walk out of that interview and even *rm -rf* the machine he'd be interviewing on.
Ben hates angular
I literally want to watch this😂😂
@@clem hahahahahah
@@clem 😂😂😂
Absolutely love this video!!!! Look forward to you guys making the next one 🤩
This was fun. Really looking forward to the next interview with Ben.
10/10 would love to see Ben do the actual coding interview. Make him use Angular 👀
this is one of a few computer programmers that is this energetic and interesting in terms of communication and interaction, most people I know are nerds and introverts, that is also myself LOL
Your videos are so awesome, funny and at the same knowledgeable ❤️ Please make more Google coding Interviews @AlgoExpert Guy
This was by far one of the best nd funniest vids I've seen on this channel.... "How about that algo girl" was just epic 😂😂
best variable name : next_guy xD
next_next_guy next_guys_neighbor_that_asks_for_sugar
Ben is the man. Cool to see the colab!
Thanks for this, these videos have definitely upped my confidence in my own abilities so I appreciate you guys!
i thought clement will pull his hair out as soon as awad named a variable "next_guy" :)
😂Not the best variable name for an arbitrary linked list node, but I figured Ben wouldn't name it like that in a real production-grade codebase. Also, this was just a fun interview!
Classic Ben Awad though.
what would be a better name? xD
@@JustTheHighlights Equality!
😂😂😂😂
Apart from the actual coding, this guy is just so fun to work with.
He lost me when he shortened “temp” to “tmp” but left “previous” as “previous
😂😂😂
@@brooksgunn5235 LMAO
Typo
Can you do the round two please? With more difficult questions??? Would love to see Ben grind
Jezz i can never be this happy talking or giving my interview both of them are so chill. Greate watching them . I'm far away to crack any interview btw.
This the only video I know how to reverse linked list. Means easy task I have seen on this channel otherwise I have only seen a difficult task here. I prefer all who see my comment to see this channel because it is really helpful. Best for logic design.
Hey Clement, Pls make a playlist of your Mock Programming interview questions. Thank you in advance.
dude seems so happy and cocky at the same time, couldnt help it but smile all the way through the video
That inverseLinkedList could be a real challenge for someone who never heard about that before, it is not something we normally do in a daily basis. I can say it is not easy, even harder than the matrix challenge in the later session with Ben.
"I'm not happy about that naming convention" ohhh Ben I love you for this.
You also can reverse linked list with recursion: def reverse_linked_list(node, next=None): if node.next is None: node.next = next return node new_node = node.next node.next = next return reverse_linked_list(new_node, node)
I don't know why but this video hyped me up to practice my programming!
how could you beat the guys who have been coding for years when you have been coding only for 6 months? you are amazing and talented.
He is smart and also has a math background so that helps him a lot when he codes as coding involves a lot of problem solving, logic, and analytical thinking.
I just loved the video ❤❤ the interview was too cool to be called as an interview 😊
Imagine if a very skilled candidate adopted Ben’s skill of typing jk and troll var names and comments
I started watching this video and i got so lost in it that i didn't feel that it was 28 fuckin minutes long... Amazing one🔥❤️
Ok! Now I wanna see Ben go thought a real intreview! :D
This video was awesome, really. Waiting for the google interview heheh
using Python made inverting the binary tree a lot easier.. I'm a medium level coder and it took me about 45 mins to come up with the recursive logic and code the same in Java.
I forgot how to reverse a linked list after I saw Ben scramble😂
U guys are awesome ! I enjoyed watching the video
17:21 Ben is not pulling his punches back lol. Roasting about Vim mode in the video 😂
I am not ready lol. Great video, first video I watch 100%.
this was fun, one of those easy questions that just takes some examples to run through and get it down
This is really fun !! I totally agree that the Py indentation is over whelming lol. Thank you guys for the video !
GREAT video please do a second part!!! Cheers from Arg
yeeeaaaaah, let's do that!!! let's do the full interview for Mr. ben
Yes please! Another video! Ben and Clem =
inverted binary should be reversing all the numbers where head now points to the last record which is the highest number and the last record at the bottom should be pointing to 1. This binary tree problem is instead called flipping the left and right nodes of a binary tree
Dude watching this again after an year or so, watching Ben is still so funny man
Your videos are all over the internet. I had to subscribe this time, :)
Yes. Please. Let's see the google interview!
I didn't know what inverting a binary tree was and once I saw that diagram, I immediately got the solution(same as what Ben did). Also, using multiple assignment is shorter tree.left, tree.right = tree.right, tree.left.
tree.left, tree.right = tree.right, tree.left will be incorrect because tree.left will not be what you want to set tree.right to. You still need a "temp" var to hold tree.left before you set tree.right. But yes, multiple assignment (for languages that understand it, is useful here).
@@dyanosis it does. The assignment expression has variables passed by values on the right. Try running it for yourself once.
I pause the video at the linked list reversal question and challenged myself to come up with a function. It took me an hour but I finally got it! Now I'll watch what he came up with.
I completely over complicated my method compared to his...
Let's get that interview!!!!!
q.q.: would it be fine to add a parameter with default value to the function? If so this would be my take: def reverseLinkedList(curr, prev = None) : next = curr.next curr.next = prev if next: return reverseLinkedList(next, curr) return curr If not just add it as an auxiliary function.
I hope Ben gets the job after countless of interviews lol Great Content. Thanks!!
Hey, man, I don't know about you, but I absolutely enjoyed this video. Learned so much!
yes part two please!! new sub :)
Awesome video guys! Thanks!!
i love how the algoexpert guy just smiles all the time
I'd love to see a legitimate interview!
these questions getting easier and easier
I think we are gonna get a new worker for algo expert 😁
👀
Oh snap, finally a question I actually saw in algorithms class.
You are great! Following you always 👍👌
Your previous vedio is of very much knowledge, fun and this is insane plzz both of you kindly upload more vedio like this you with algo ben with react or vue.... Or other framwrks... Hoping your best for future 🙏🙏.. We are Indian we are doing 🙏 rather than 👍🏼,🔥.... ... Plz consider my concern ....🥺
There's actually a missing edge case. If the linked list is empty, it is represented by None and the function crashes accessing curr.next in line 14.
The function accepts the head as input, implying that the list has at least one item being the head
@@ayhamboi9720 no not really. head can point to null (empty list)
@@theendurance its passing the node itself not the pointer of a linked list struct, and a null node would be invalid here
@@ayhamboi9720 not correct
This was a fun interview video! 👍
I think that's the first video where I really understood something (beginner programmer problems) =))
I really enjoyed this video but I don't believe Ben can simulate a legit technical interview. He didn't take this seriously at all. I'd really love to see a mock interview with a recent Fullstack graduate.
8:55 "This is what I know I think is right" story of my life lol
Great work clem. Best getting your application tested by Ben himself.
Entertaining and fun as always ;)
I never inverted a binary tree before. paused the video and solved it and continue to watch. I came up with the same solution
this is a coolest interview video, 3 nodes create prev, curr, frwd and get job in google😁
Your video was really amazing🎉🎉🎉 but I wanted to ask that if we will subscribe to the algo expert then how frequently can I give my mock coding interviews
/*I stopped the video at 12:29 and decided to do it by my own before watching his solution (not sure if it's kind of cheating because I saw a "starting point", although I didn't really based the idea on the solution so far at that point) After between 3-5 minutes I came up with this:*/ (head) curr = head; prev = null; do { next = curr.next; curr.next = prev; prev = curr; curr = next; } while (curr != null); //What do you guys think? //Well, time to keep watching the video, to see what Ben came up with
Yes please, do the legitimate google interview with Ben Awad!
I've got youtube notification for this video from both channels 😂
Oddly enough, this is a lot like my recent interviews went, minus the fact that I had a white background google drive instead of an ide. My interviewer also asked me weird questions and then got both of confused for half an hour c:
And how did they go
Bring the interview!!
We want part 2, clément
24:00: Just a sidenode, in Python you can actually do this: tree.left, tree.right = tree.right, tree.left
I'm looking forward to a video that you interview a Turing award winner
One thing I don't understand is how you can be using .next outside of the LinkedList class definition without having a "getter" for it. I only see the constructor there.
I just started learning data structures (just means 2 days). I can do this with O(2n-1) time complexity. Is there any fast algorithm for this.
You should do a video with Coding Garden, it would be really interesting !
For whatever reason linked lists are so confusing to me compared to other data structures. Seeing that it even made Ben have to really think about it makes me feel somewhat better about myself
LinkedLists are exactly what you think the are. They're Lists that refer to their elements by links. If you think about how Arrays work under the hood, they're LinkedLists, but only in memory. Meaning the Array knows where each element is due to its place in memory. If you're confused by LinkedLists, you must be really confused by DoublyLinkedLists then. Which is just a List where each Node knows it prev and next. Did a project in school where we built Google's ranking system using DoublyLinkedLists, it was easy and made total sense.
@@dyanosis "If you think about how Arrays work under the hood, they're LinkedLists, but only in memory" - that's gotta be the most confusing way of explaining arrays i've ever seen lol
Ben throwing shade on clem every now and then ;)
I didn’t get notified for the video but it popped on my recommendations. I guess where the notifications fail the all mighty KZhead algorithm is there to save the day. Also, what did you main back in the days you were playing Overwatch ? YoE: -1 TC:0K/ Year
Thank goodness for the KZhead algorithm. And I mained Mei, believe it or not. YoE: 3.5 TC: over 9000
@@clem you should do a video where you play Overwatch, btw I am a 14 yo romanian who loves your content
Imagine cracking an angular jocks in google coding interview.
The chemistry is unmatched.
Google coding interview with Tourist when 👀
I'm down whenever he is!
@@clem tourist tourist tourist tourist tourist tourist tourist tourist tourist tourist tourist tourist tourist tourist tourist tourist tourist tourist tourist tourist tourist tourist tourist!!!
I'm waiting for that day!!
torist doesn't give interviews
@@clem Tourist will be like "I have 7 gold medals in code jam . So ask your question and watch my screen casts , rather than wasting my time". Anyway, i don't think Gennedy would ever say that.
Recursion is our friend here. Pop off the head, reverse the rest (recursively), append the original head. Return :) To preserve the original llist, do the same but loop through reverse(head.rest) as another variable, then append head.first as a separate link on the end. Return :)
Just want to type out a solution that immediatly came to me when seeing him comment to visualize the problem, Im not sure if its good and too lazy to test it: It just comes from the fact that it doesnt make sense to go from a to None and instead u should just do the opposite path, from None to a: def reverseLinkedList(head): return rec(None, head) rec(previous, current): head = None if current.next != None: head = rec(current, current.next) else head = current current.next = previous return head dont know if it works but sounds good to me
Holy shit this guy rocked it, made me a fan
what's the hardest thing in the world? Ben: AngularJS