Chaotic Llama, a FAANG engineer, interviewed Aerodynamic Hobbit in C++
Target powerset sums
1) Given a BST, return the nodes that are visible only from the right side. 2) Given an array of values and a target value, does there exist a series of subsets of the array such that the sum of all values in the subset equals to the target.
Feedback about Aerodynamic Hobbit (the interviewee)
Advance this person to the next round?
How were their technical skills?
How was their problem solving ability?
What about their communication ability?
Good job solving the problems. Not too much feedback since you managed to solve both problems.
Feedback about Chaotic Llama (the interviewer)
Would you want to work with this person?
How excited would you be to work with them?
How good were the questions?
How helpful was your interviewer in guiding you to the solution(s)?
Chaotic Llama: Hello. Can you hear me? Aerodynamic Hobbit : Yes, I can hear you now. Can you hear me? Chaotic Llama: Yes. Okay. Thanks. How are you? Aerodynamic Hobbit : Good? How are you? Chaotic Llama: Yeah, great. Thanks. Yeah. So I guess to start with, do you want to tell me a little bit about yourself, your experience, and how long you've been doing the interview prep? Aerodynamic Hobbit : Yeah, I have around like 10 plus years of software development experience, mostly on the server side programming. And I have been preparing from like, last six months, and I have an on site scheduled from Facebook on in next week. Chaotic Llama: Oh, awesome. Yeah, I have my, my first phone screen with them in two weeks. Yeah, so I guess to start with, I'll give you a problem. And if you've seen the problem before, then I can give you a different one. But this question will be good, because I think