Mastering Binary Tree Traversal: My Challenging iOS Engineer Interview at Snapchat

snapchat | Mobile | Interview Experience

Interview Date: Not specified
Result: Not specified
Difficulty: Not specified

Interview Process

I had an onsite interview with Snapchat for a full-time iOS Software Engineer position. The interview consisted of three main rounds:

  1. Technical Interview: This round focused on data structures and algorithms. The interviewer asked me to solve two coding problems on a whiteboard. The first question was related to binary trees, where I had to implement a function to traverse the tree and return the values in an array. The second question was about optimizing an algorithm for finding the shortest path in a graph.

  2. System Design Interview: In this round, I was asked to design a scalable system for handling user notifications. I discussed how to handle millions of notifications and maintain system performance.

  3. Behavioral Interview: The final round consisted of various behavioral questions, including how I handle conflicts within a team and my experiences in previous internships.

Overall, the interview was challenging but very enlightening. I appreciated the opportunity to discuss my thought processes with the interviewers. They seemed genuinely interested in understanding my problem-solving approaches and experiences.

Technical Questions

  1. Binary Tree Traversal (Tree, DFS)
  2. Shortest Path in Graph (Graph, BFS, Dijkstra)

Tips & Insights

I spent a significant amount of time preparing for the coding problems and reviewing common iOS frameworks.