Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 5 settimane. Ho sostenuto un colloquio presso Metron, Inc. (Reston, VA) nel mese di nov 2025
Colloquio
First had an 1.5 hour online interview, 30 minutes with HR and 1 hr with a technical software engineer. The engineer asked me about my resume / experiences for 30 minutes and then pulled up a CoderPad for me to solve a leetcode style question.
I made it to the final round, which was a 5-hour in person series of interviews. It began with an tour / QA with the HR head, then two 1-hour long interviews with software engineers - both of which asked me a few questions and then had me do leet code questions on a whiteboard. Then I had a 1 hour interview with two directors, who also talked to me for quite a while about my experiences and also finished with a leet code problem. Then lastly I had a "demo" meeting where a software engineer asked me about a problem and how I would solve it before showing me what the company did to solve it.
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Metron, Inc. (Reston, VA) nel mese di mag 2026
Colloquio
Round 1: Phone Screen with a Recruiter which was ~30 mins
- Mostly behavioral and resume review
- Learning about my background, experience, and fit for the role
- Quick turnaround tho, if they like you, they move you forward
Round 2: Technical Phone Interview (1 hour, via Teams/CoderPath)
- First 30 mins the technical engineer asks about your resume, projects, and experience
- Next 30 mins: Live coding problem on CoderPath (easy-to-medium difficulty)
Problem types: Math-based algorithms (Fibonacci, Collatz sequence, clock angles), array manipulation, tree traversal, base conversion, cipher problems
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 mesi. Ho sostenuto un colloquio presso Metron, Inc. (Reston, VA) nel mese di set 2024
Colloquio
There are two technical interview rounds plus a final interview that is 5 hours long. The first technical was some debugging and simple method writing in Java/Python, and the second technical was writing a few simple methods about tree traversals and binary search trees. I have not gone on to the final round yet.
Domande di colloquio [1]
Domanda 1
Can you describe inorder, postorder, and preorder tree traversals?
