Round 1
Questions:
-
Warmup problem: Pow(x,n)
Leetcode Problem Link -
Second Problem: Variation to Nested List Weight Sum: the weights are in reverse order
Leetcode Problem Link
Candidate's Approach
- For the Nested List Weight Sum problem, the candidate came up with a naive hashmap solution that involved sorting.
- The interviewer provided a formula to solve it, but the candidate did not have enough time to implement the solution.
- They discussed a two-pass approach to find the unweighted sum and a one-pass approach to find the weighted sum.
Interviewer's Feedback
No feedback provided.
iOS Questions
Questions:
- Strong and weak pointers
- Structs vs values
- Protocols
- Standard iOS-related topics
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Performance Rating: 6/10