I applied through university. I interviewed at Meta
Interview
The interview process for the internship position consisted of two phone interviews. The first interview was more about my past experience and had a single programming question. During the interview you're supposed to code the solution in a language of your choice. The interviewer will see what you're coding as you type and make mistakes. By doing so they have insights on how you approach programming problems.
The second interview had two programming questions with similar degree of difficulty.
Interview questions [1]
Question 1
The first problem was the classical "reverse a linked list" problem. It's easy, but may make you feel nervous as getting the pointer manipulation right may be tricky.
Took about a month from start to finish, which felt longer than I expected. After a couple of initial phone screenings, I faced a challenging technical round focused on system design. It was during this round that I was asked to describe overcoming a major career challenge. Interestingly, I had just reviewed a similar framework on PracHub, which helped me articulate my thoughts clearly. Overall, I appreciated the depth of the process and ended up accepting the offer.
Interview questions [1]
Question 1
Describe Overcoming a Major Challenge in Your Career
The entire process usually takes 3–8 weeks, depending on scheduling and the specific role. Coding interviews heavily emphasize common DSA topics such as arrays, strings, trees, graphs, BFS/DFS, heaps, hash maps, and dynamic programming. System design becomes increasingly important for E4+ positions.
Interview questions [1]
Question 1
Given an array of integers and a target value, return the indices of two numbers that add up to the target
Unexpectedly, the first question in the technical round felt familiar. It was about finding a subset of strings with unique character concatenation — same problem I had worked through on PracHub a few days earlier. The interview included a recruiter screen followed by a rigorous pair of technical interviews where I tackled data structures and algorithms alongside system design concepts. After successfully answering a few more challenging DSA questions, I received an offer. The entire experience was intense but ultimately rewarding, and I happily accepted the position.
Interview questions [1]
Question 1
Given an array of strings, pick a subset whose concatenation contains no duplicate characters, and return the maximum possible length of that concatenation.
