Microsoft SDE Intern Interview Experience
💼 LTIMindtree Interview Experience (On-Campus) | Fresher | 2026
Salesforce SMTS | Interview Experience | Rejected
JPMC | SDE2 (Associate) - Java Backend - Interview Experience + Compensation
Microsoft - SDE2 - Coding Round
Accolite Digital || Software Engineer || January 2023 || Women In Tech || Off Campus || Selected
Summary
I successfully navigated five rounds of interviews with Accolite Digital for a Software Engineer role in January 2023, ultimately receiving an offer. The process included an MCQ+Coding round, three technical interviews covering DSA, Java, DBMS, OS, Networking, and Git, followed by an HR discussion.
Full Experience
My interview journey with Accolite Digital began in January 2023 for a Software Engineer position through an off-campus drive. I was selected after successfully completing five rounds.
My first round was an MCQ and coding test on Accolite's Eduthrill platform, lasting 90 minutes with camera and web proctoring. It featured over 30 MCQs on topics like Java, DBMS, Networking, OS, and DSA, along with one coding question. After 2-3 days, I received a call for an interview.
My first technical interview followed. After a brief introduction, the interviewer immediately delved into technical questions. These included printing prime numbers from 1 to 20, checking if a given string is a palindrome, removing duplicates from an array, discussing Git commands, SQL joins and their types, deadlocks and how to avoid them, and fundamental data structures like recursion, arrays, stacks, and queues. We also discussed my projects. This round lasted about 30 minutes.
Later that same day, I moved on to the second technical interview. The interviewer was very friendly and made me comfortable, starting by asking about my city before my introduction. Questions covered finding missing numbers in a sorted array, determining the longest consecutive sequence in an unsorted array, reversing a linked list, explaining SQL clauses (WHERE, HAVING, GROUP BY) and writing some MySQL queries, the working principles and differences between NoSQL and SQL databases, and the distinctions between IPv4 and IPv6. My projects were discussed again. This round was about an hour long.
The next day, I had my third technical interview. After my introduction, we discussed the working mechanisms and complexities of Merge Sort and Quick Sort. I was asked to find the power of a given number using the Divide and Conquer approach without using an inbuilt function, and to explain Aggregation and Composition in Java. I also had to write some more MySQL queries. This round also lasted about an hour.
Finally, the HR round took place the following day. The HR representative introduced herself, I introduced myself, and she provided detailed information about the company. She asked me some questions and discussed various aspects like working locations, salary breakdown, and the work environment. I was presented with two offer choices: an Internship + FTE Offer or a direct FTE Offer, with the location choice being mine. This round was about 45 minutes.
Overall, my experience was very positive. The interviewers were friendly and supportive whenever I got stuck. All questions ranged from Easy to Medium difficulty. I recommend practicing extensively on platforms like LeetCode and GeeksforGeeks.
Interview Questions (17)
Write a program to print all prime numbers between 1 and 20, including both 1 and 20.
Given a string, determine if it is a palindrome.
Given an array, remove duplicate elements from it.
Discuss various common Git commands and their usage.
Explain what SQL joins are and describe different types of joins (e.g., INNER, LEFT, RIGHT, FULL).
Explain what a deadlock is in an operating system context and discuss methods to prevent or avoid deadlocks.
Explain the concepts of recursion, arrays, stacks, and queues.
Discuss the details, technologies, and challenges of your past projects.
Given a sorted array of integers, identify and print all the missing numbers within a certain range or sequence.
Given an unsorted array of integers, find the length of the longest consecutive elements sequence. The algorithm should run in O(n) time.
Reverse a singly linked list.
Explain the usage of WHERE, HAVING, and GROUP BY clauses in SQL, and write some corresponding MySQL queries.
Explain the fundamental differences between SQL (Relational) and NoSQL databases, including their working principles and use cases.
Discuss the key differences between IPv4 and IPv6, including address format, address space, and features.
Discuss the working mechanism, time complexity, and space complexity of Merge Sort and Quick Sort algorithms.
Implement a function to calculate x raised to the power of n using the Divide and Conquer approach, without using any built-in power functions.
Explain the concepts of Aggregation and Composition in Java object-oriented programming, including their differences and use cases.
Preparation Tips
I highly recommend practicing as much as possible on platforms like LeetCode and GeeksforGeeks. Before writing any code, always think about your approach and explain it thoroughly to the interviewer. Once the approach is approved, make sure to write clean, understandable code using descriptive variable names. It's also beneficial to research the company's website to know more about them. During the interview, maintain composure and confidence, treating it more as a discussion rather than a stressful evaluation. Always prepare unique and interesting questions to ask the interviewers at the end.