Microsoft

It was a campus event through the career fair. I was asked to implement the breadth-first B-tree parsing algorithm and to write code. I was then given a string with an unknown length in which I had to sort the alphabets from the numerals within the

Had an initial behavioral interview, and later two technical interviews with separate interviewers. Moderately difficult coding problems. One interviewer seemed miffed to be there and was entirely unhelpful as I struggled with the question. Rather

1. Online Assessment (OA) Usually conducted on platforms like Codility, HackerRank, or AMCAT. Duration: 90–120 minutes. Format: * 2–3 coding problems (DSA-focused). * Difficulty: Easy to Medium-Hard. * Topics: Arrays, Strings, Trees, Dynamic