Episode Transcript
[00:00:00] Speaker A: You.
[00:00:02] Speaker B: I'm finally here interviewing for my dream job. After all the training I've done, I.
[00:00:07] Speaker C: Can'T let this opportunity slip.
[00:00:11] Speaker B: Ever since I was in high school, I knew I wanted to be a software engineer.
[00:00:19] Speaker D: Oh, it works.
This is so fun.
If keep this up, I'll be a staff engineer at Google in no time.
[00:00:28] Speaker B: And so I studied nonstop in college, with my eyes set to becoming the next Jeff Dean.
I knew it wouldn't be easy, and I would have to get through many obstacles.
I worked day and night, persevered through hardships with one goal in mind.
[00:00:56] Speaker E: It hello?
Hello? Can you hear me? Is this still a good time?
Oh, no worries. I might have been muted or something. All right, let's get started. Just a little intro. My name is Nikhil. I work on the Cloud team. I've been with the company around three years.
Can you tell me a little about yourself and why you want to work for this company?
[00:01:16] Speaker C: Yeah.
[00:01:18] Speaker B: Because the only time I feel free in my life is when I code.
[00:01:23] Speaker F: I may not be the smartest person, and my whole life people have told me no, but coding was the only thing that accepted me. It welcomes anyone with open arms, no matter who you are or where you're from. All you need is a notepad and the world becomes your canvas.
[00:01:43] Speaker B: And just like how coding shined a.
[00:01:45] Speaker F: Light in my darkest days and allowed me to be more open to the world, I want to work here to help make the world become more open and connected.
[00:02:00] Speaker E: Yeah, okay, sure.
Let's move on to the coding question. Shouldn't take too long, and then we'll have some time after, so you can ask me some questions.
So the question is, given a binary tree. Can you print the values out in an in order fashion?
[00:02:18] Speaker A: In order binary tree.
[00:02:24] Speaker B: My favorite binary trees. A data structure where each node has two hello?
[00:02:30] Speaker E: Sorry, I think you cut off again.
[00:02:32] Speaker G: I'm sorry. Yeah, I'm here. Okay, so for that question, I will perform a simple recursive algorithm to go through the tree in an in order fashion and print every node I visit.
[00:02:46] Speaker E: All right. Excellent. Looks good.
Now, the next part of the question. I want you to not use recursion for the same question. Can you do it?
[00:02:56] Speaker A: Iteratively iterative it's very difficult.
[00:03:02] Speaker H: Masako. How is that even possible?
Wait, relax. Think I ran out of flashbacks.
[00:03:14] Speaker A: No.
I can't even pass this phone interview.
[00:03:21] Speaker H: Wait, I got it. I'll use silent keyboard.
With my left hand, I can start.
[00:03:33] Speaker C: Typing nonsense on the shared Codepad as.
[00:03:36] Speaker H: Comments, while my right hand will silently.
[00:03:38] Speaker C: Google the answers on my iPad.
[00:03:41] Speaker H: And since there's no physical keyboard, it.
[00:03:43] Speaker C: Makes absolutely no sound.
[00:03:49] Speaker A: I've won't.
[00:04:05] Speaker E: That looks good. And what is the time and space complexity of this?
[00:04:10] Speaker G: Well, if N is the number of nodes in the tree, then the time complexity is O. Of N, and the space complexity is O of H, where H is the height of the tree. And in worst case scenario, in an unbalanced tree, the height of the tree is N. So O of N would.
[00:04:26] Speaker B: Be the worst case.
[00:04:28] Speaker E: All right, that's great.
I don't think I have any more questions for you. Do you have any questions for me?
[00:04:34] Speaker G: Yeah. So how do you become a staff engineer?
[00:04:43] Speaker C: Thanks for watching. I hope you enjoyed that. Sorry I haven't posted in a while. It's because I've been working on Joma Class, which is a subscription service to get high quality educational videos made by me on data science and computer science, and there's new videos every week. I think I made, like, 60 plus videos. Now.
[00:05:02] Speaker G: I think that number keeps increasing every week.
[00:05:05] Speaker C: I also regularly chat and mentor all of the members who are in the Joma Class community. I know a lot of people get lost in their education, whether it's data science or software engineering, which is why I created all these classes, so that I could teach them the right way. The first class I just launched is programming fundamentals with Python. I'm very proud of it. There's lots of good content, there lots of good projects in that course, and it's the way I learned how to program at first. Lastly, to say thank you to all of you people who are still watching me after I took a long ass break, I'm going to give 15% off for the first 100 people to use.
[00:05:42] Speaker B: The promo code Animate Two.
[00:05:44] Speaker C: And, yeah, I really hope you like the course.
[00:05:47] Speaker G: I really hope you enjoy it because I put a lot of effort into it.
[00:05:50] Speaker C: And, yeah, if you have any questions.
[00:05:53] Speaker B: Email me, any feedback, please email me.
[00:05:55] Speaker G: I would love to hear it.
[00:05:56] Speaker C: And that's pretty much it. All right, I love you. Bye.
