Easy Google Coding Interview With Ben Awad

sure python indentation system sucks, at least they could use something like end lol

great camel case

they both are smiling thorught the video

I just loved the video ❤❤ the interview was too cool to be called as an interview 😊

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

MIRROR a tree god dammm it… not invert it…

The chemistry is unmatched.

why can't they just stack it in another linked list :_)

Why dont you adjust your mouth bro

Dude watching this again after an year or so, watching Ben is still so funny man

Do you even need to do "right = tree.right"? You're only needing to worry about how tree.left is going to be overridden first. So you could save a small amount of memory by not creating a new variable and instead changing "tree.left = right" to "tree.left = tree.right"

Classic dev failures - defines a variable that is never used (looking at you, new_head)

Bens shit talking is hilarious

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

Algoexpert do not care about resolving product issues. Their website shows huge icon on Safari browser and in reply, they only say we don't reply but we surely read your mails. In reality they don't have anyone working on their product anymore. Completely avoid paying as there is no refund at all.

Gosh, what a train wreck

in python, doesnt this swap elements?:
a,b = b,a

Isn't it's very easy questions for any product based company.

wait so a binary tree inversion is literally just a temp swap??? wtf why is it considered hard then??

Can java data structures land a job there?

Please we want a legit Google Interview

dude seems so happy and cocky at the same time, couldnt help it but smile all the way through the video

my coding is better than him

I wish the computer would have crashed during this “interview” 1listening to these two smug tech bros is infuriating and frankly who gives a F.

recursive solution to inverting a linked list:

public node reverse(node current)
{
node root;
if(current.getNext() != null)
{
root = reverse(current.getNext());
current.getNext().setNext(current);
current.setNext(null);
}
else
{
root = current;
}
return root;
}

written in c#, node has an integer payload, and a node next

I got reverse a binary tree from a very senior person when I interviewed at Microsoft straight out of college. Ha.

Line 7 the word again is spelled wrong!!! LOL

Woah woah woah, you watch yourself about pythonic indents SIR! Jkjk nice job!

dfv lol

Weakest algo enjoyer vs strongest front dev

Can we use stack in the first question?

Holy shit this guy rocked it, made me a fan

I can't track what he's doing but this is already my favorite interview lol

clement is annoying and smug. hes not a narccicist, but he has that inflated ego vibe

"Weak Minded" says the guy who could barely reverse a linked list lmao

"I can turn on vim mode, right?" Me all the time.

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

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.

Ben, you're a genius ))

I am a fan of Ben, but there is a more efficient way to reverse a list. Ben declared too many variables, and making it not efficient.

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'm so happy i can reverse a linkedlist 🤣🤣

It should be my Google question