I was asked a 2D matrix problem. Variant of shortest path in binary matrix. Interviewer wasn't interested at all. No questions asked no help provided. No introduction. I don't even know if I did it correctly. Or may be it was just me who might have ruined the interview in the first impression. Overall didn't expect this question in the first round and the interviewer not being helpful.

Interview process I interviewed for a Meta summer internship and the process consisted of two 45-minute live coding interviews. Each interview followed a similar structure: one easier warm-up problem followed by one medium-level problem. Both sessions were fast-paced. The interviewer expected me to clarify requirements quickly, propose an approach, and implement efficiently within the time limit. There wasn’t much slack for long exploration, so it helped to communicate clearly, write clean code, and validate edge cases as I went. Interview questions The questions were standard data structures and algorithms style. The “easy” question typically checked basic implementation and correctness, while the “medium” question required a more structured approach and careful handling of edge cases and complexity. (I won’t share exact questions, but expect common DS/Algo patterns.) What went well The interviews were structured and consistent (easy → medium). Interviewers cared about communication (explaining reasoning and trade-offs), not just the final code. Complexity discussion and edge cases mattered. What was challenging Time pressure: two problems in 45 minutes means you need to move quickly. The medium question often required both correctness and optimization (thinking about time/space complexity early). Tips for candidates Practice solving two problems in 45 minutes (simulate the pacing). Focus on core DS/Algo patterns (arrays/strings, hash maps, two pointers, sliding window, stacks/queues, BFS/DFS, heaps, basic DP). Get in the habit of: clarify constraints → outline approach → code cleanly → test a few edge cases → state complexity.