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
Intuit | SE2 | Interview Experience | Accepted
Summary
I successfully interviewed for a Software Engineer 2 position at Intuit, passing through technical screening, a craft demo, assessor's round, team fitment, and hiring manager rounds, ultimately receiving and accepting the offer.
Full Experience
Time to give back to the community. I am posting a bit late but it's never too late.
R1 - Technical Screening
- Valid parentheses
- debug recursion function f(n){ if (n==0){ reutrn } f(n-1) f(n-1) print(n) }
- "1110010101" given a binary string, check if it is divisible by 3.
Givencannot convert to decimal number
Loop rounds
R2 - Craft Demo Got an assignment of Key generation service. Have to come up with a LLD, HLD and production ready code with a PPT to showcase each step. Questions asked while showcasing the assignment
- why we had came up with NoSql and issue with nosql
- partitioning
- how availability is handled in nosql
R3 - Assesors round
- prodcuer consumer problem in multi threaded environment
- Data structure - max the element picked from array given the element which will be picked adjacent elements will get 0
R4 - Team Fitment
- Design a system which will automate the manual work between tasks of two seprate entities which are chained together suppose Org1 manages task1 and task1 status will be sent to Org2 system. Right now manual operational work is there, optimize this and provide a automated solution
- decorator design pattern problem
R5 - Hiring Manager
- Leadership questions
- cultural fitment
A day after received call from recruiter that i have cleared the interviews. Finally, i have accepted the Offer
Interview Questions (9)
Determine if the input string has valid parentheses.
Debug the given recursive function: f(n){ if (n==0){ reutrn } f(n-1) f(n-1) print(n) }
Given a binary string, e.g., '1110010101', check if it is divisible by 3 without converting it to a decimal number.
Design a Key generation service. This involved coming up with a Low-Level Design (LLD), High-Level Design (HLD), and production-ready code with a PPT to showcase each step. Follow-up questions included: why NoSQL was chosen and its issues, partitioning strategies, and how availability is handled in NoSQL.
Implement or discuss the producer-consumer problem in a multi-threaded environment.
Data structure problem: Maximize the element picked from an array, given that when an element is picked, its adjacent elements will become 0.
Design a system to automate manual work between tasks of two separate entities that are chained together. For example, Org1 manages task1 and its status is sent to Org2's system; optimize this manual operational work into an automated solution.
A problem related to the decorator design pattern.
General leadership and cultural fitment questions asked by the hiring manager.