Backend Engineer | Zenskar
JP Morgan Chase | SDE 3 | YOE 3.4
Microsoft SDE - 2 | Interview Experience | Status Pending
eBay || SWE3 Interview Experience || Bangalore
Bloomberg | Interview Experience | Senior Software Engineer | NYC | Nov 2025
Meta - Got Offer | SWE | E3 US New Grad
Summary
I successfully navigated Meta's interview process, which included an OA, two technical rounds, and a behavioral round, ultimately leading to an offer for a Software Engineer E3 New Grad position.
Full Experience
My interview process with Meta began after a recruiter reached out to me, and the entire journey felt very streamlined. It kicked off with an Online Assessment on CodeSignal, which consisted of one easy, two medium, and one hard problem.
During Technical Round 1, I was presented with two problems. The first involved converting a Binary Search Tree (BST) into a sorted doubly linked list in place, which I managed to solve. The second problem was a variation of the classic Merge Intervals (LeetCode #56). I found a solution, but it was suboptimal, running in O(N log N) time while the optimal approach would have been O(N). Despite this, the interviewer was quite pleasant.
Technical Round 2 also featured two problems. The first was exactly LeetCode #339, Nested List Weight Sum, which I solved optimally. The second problem was a variation of the Basic Calculator problems, but it focused exclusively on '+' and '*' operators. I achieved optimal time complexity for this problem and, after a follow-up, managed to optimize for both time and space. The interviewer in this round was also very friendly.
The final stage was a Behavioral interview. I found that mastering the STAR method was incredibly useful here. I was asked about my most proud project, a time I disagreed with a design choice and its impact, and how I approached a problem with limited information. The interview concluded with a question about my areas for improvement, which naturally arose from previous discussions.
Overall, I felt the process was seamless, and I was thrilled to receive an offer.
Interview Questions (8)
Convert a Binary Search Tree (BST) into a sorted circular doubly linked list in-place.
A variation of the Merge Intervals problem (LeetCode #56), possibly involving merging two interval lists as seen in the provided LeetCode Discuss link: https://leetcode.com/discuss/interview-question/124616/Merge-two-interval-lists.
A variation of the Basic Calculator problems, specifically involving only '+' and '*' operators. A follow-up asked for optimal time and space complexity.
Describe your most proud project.
Describe a time when you disagreed with a design choice and how it affected the outcome.
Describe a time when you had limited information on a problem and how you proceeded.
What do you feel you lack and can improve upon?
Preparation Tips
For the behavioral round, understanding and applying the STAR method was crucial. I focused on preparing stories that demonstrated my skills and experiences in various scenarios, such as my most proud project, handling disagreements, and navigating problems with incomplete information. While specific LeetCode tags were mentioned for technical questions, I mainly relied on my general LeetCode practice and problem-solving skills.