Python Interview with a Samsung engineer.

Python Interview with a Samsung engineer

Watch someone solve the bipartite graph problem in an interview with a Samsung engineer and see the feedback their interviewer left them. Explore this problem and others in our library of interview replays.

Python interview with a Samsung engineer: Bipartite graph

Interview Summary

Problem type
Bipartite graph
Interview question
Determine if a graph is bipartite

Interview Feedback

Feedback about Ghost Armadillo (the interviewee)
Advance this person to the next round?
Yes
How were their technical skills?
4/4
How was their problem solving ability?
4/4
What about their communication ability?
4/4

Good

Feedback about Kind Dragon (the interviewer)
Would you want to work with this person?
Yes
How excited would you be to work with them?
4/4
How good were the questions?
4/4
How helpful was your interviewer in guiding you to the solution(s)?
4/4

1/4

Interview Transcript

Kind Dragon: Can you hear me?
Ghost Armadillo: Yes I can.
Kind Dragon: Okay, cool. Okay. I prepared some coding question from easy to hard. Which level of question you want?
Ghost Armadillo: I think medium onwards.
Kind Dragon: Medium, okay, cool. Okay, I pasted the question, please read it over if you haven't yet okay.
Ghost Armadillo: Yes. So we're looking at an undirected graph, return true if it is bipartite. Okay. Is bipartite everything split into two nodes and two set of nodes into two independent subsets A B. So I said every edge in the graph has one node in a, another in b, okay.
...

Kind Dragon: Okay, cool. Awesome. You want to painted here, channel one, day one. And now the DFS. So we need to dig in more. So now we are here, right? And maybe already visited. So we got are going to the two right? Now here is minus one. And then next, even more. One from one to two. So we are here. And then we are painting. And then different eligibility this already visited, and three will be going there. But when you check, according to the journal. But this one is same color. Right? So at that time, we needed to stop it and then return first. That's it is mixed. Because when we hear checking from neighbor, yeah. Yeah. Yeah. Okay, cool. All right, I think that you are on the right track. Can you calculate a time and a complexity?

Ghost Armadillo: Yeah, it's. So I have to visit, like the worst case is I visit all the nodes. So it's the number of nodes that I have. And the space is because I'm going to build a graph. So also, then it's my space. Yeah.

Kind Dragon: Okay. I think that it makes sense. Okay. Can we can use v and e. Yep. Yeah, point number. Number. Oh, yes. Well, you know, everybody grab the... Yeah. So it's more than Yeah.

...

Ghost Armadillo: Yeah. My English is very similar, because I'm from South Australia. So different parts of Australia. Yeah. So there's some parts of Australia that are more Australian. Like more both.

Kind Dragon: Because I mean, the United States, the New York...

Ghost Armadillo: Oh, wow. must be pretty tough. Are you there at the moment?

Kind Dragon: Yeah, that's right. That is pretty sad story. Medically from there. How about there?

Ghost Armadillo: We, we had the worst because I'm in Melbourne it we had the the most severe lockdown in the world. So we were locked out for three months. can't go anywhere for three months. I've called it as is actually very, it's not good for the mental health. It's very hard. But now that we've got cases again, so. Yeah.

Kind Dragon: Okay. Okay. I have to go.

Ghost Armadillo: Yeah, no worries. Thanks for that. appreciate all your help.

Kind Dragon: Okay, thank you very much. Bye bye.

Ghost Armadillo: Bye.