Ho sostenuto un colloquio presso Microsoft nel mese di ott 2024
Colloquio
The first round Interview was timed for 45 minutes. The inetrviewer didn't waste any time and started straight with a DSA question after a small chat. It was a DSA question which was a Dynamic Programming question if tried to be solved with the most optmized solution but the brute force approach was encouraged by the interviewer which was supposedly a Recursive approach.It was a little tricky to code.
The interviewer was friendly and helping at every step, also helping or hinting to think in a direction which can be said as a good discussion.
Domande di colloquio [1]
Domanda 1
1 question about interpreting a string message from its concatinated and distorted form. A spy message interpreting problem to what it originally could be.
The hiring process started with an online assessment that focused on problem-solving and coding skills.
After passing the assessment, I was invited to a series of 3 back-to-back technical interviews.
Each interview was primarily centered around data structures and algorithms, with questions similar in style and difficulty to LeetCode problems.
Interviewers also evaluated problem-solving approach, code quality, and the ability to explain thought processes clearly while coding.
Overall, the process was structured, technical, and heavily focused on algorithmic problem solving and communication skills.
Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Microsoft (Bengaluru) nel mese di mar 2026
Colloquio
Interviewer was intrested in my Open source work for first 25 min where I told him about my GSoC work which was about decompression and asked a simple dsa question about trees. And asked follow ups like print it without storing it in a vector of vector.
Ho sostenuto un colloquio presso Microsoft (Redmond, WA)
Colloquio
2 45 min back to back with leetcode and behavioral questions. Wasn’t too bad just tagged will help and be prepared for resume grill. Review resume fully and should be ok
