The interview was the standard "Coding Gameshow" where you can win a job. The interviewer asked me two technical questions. I nailed the first one. The second one, I struggled for a 3-4 minutes (asking questions all along the way). I finally arrived at a linear solution to the problem. The interviewer was not familiar with my approach and told me I was wrong. I suggested it should work but then proceeded to work out the version of the solution he wanted. Unfortunately, I ran out of time. Interviewer was great to speak with, but ultimately was unfamiliar with all the solutions to the problem he asked.
Interview questions [1]
Question 1
Given an a table, find all the paths from starting position to end.
Recruiter call was pretty standard, first round was 2 Meta tagged LC mediums in 45 minutes. On-site was 2 coding sessions of 2 LC mediums, a system design interview and a behavioral interview with an engineering manager.
Interview questions [1]
Question 1
How do you answer if someone asks how long a deliverable or project will take?
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.
