Snapchat | Software Engineer | Onsite
Timeline: 2026(Jan - Mar) • Fulltime • JobHopper • 
Waiting for result
The interview started with a brief introduction about my background and experiences. The first question was aimed at understanding my understanding of data structures, specifically trees. They asked me to explain how a binary search tree works and to write a function that checks if a given tree is balanced.
After that, we moved to some behavioral questions. They wanted to know about a time I faced a conflict in a team and how I resolved it. I shared an experience from my previous internship where differing opinions on project direction led to a productive discussion over coffee that aligned our goals.
Following the behavioral segment, I was given a coding challenge that involved implementing a function to find the longest substring without repeating characters. The interviewer seemed pleased with my approach and our discussion on optimizing the solution, which involved sliding windows.
Lastly, I had some quick-fire technical questions about multi-threading and memory management, which I felt went well as I was able to demonstrate my knowledge effectively. Overall, the experience was positive and I’m hopeful about the outcome.
Interview Questions
Binary Tree Balance Checker
Write a function that checks if a given binary tree is balanced.
Difficulty: Medium | Reference: LC-110 | Tags: Tree, DFS
Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.
Difficulty: Medium | Reference: LC-3 | Tags: Sliding Window, Hash Map