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
ZOHO Offcampus Interview Experience 2025
Summary
Hey everyone! π
I recently appeared for the Zoho off-campus drive held on April 4th, and I wanted to share my experience here. The drive saw a huge turnout of around 1500+ candidates, and by the end, only about 10β12 students were shortlisted. Though I couldnβt make it past the third round, I learned a lot and hope this post helps someone preparing for it in the future.
Full Experience
π My Zoho Off-Campus Drive Experience β April 4th, 2025
Hey everyone! π
I recently appeared for the Zoho off-campus drive held on April 4th, and I wanted to share my experience here. The drive saw a huge turnout of around 1500+ candidates, and by the end, only about 10β12 students were shortlisted. Though I couldnβt make it past the third round, I learned a lot and hope this post helps someone preparing for it in the future.
πΉ Round 1 β Aptitude + Java Snippets
This was the first and major filtration round.
We had 20 questions in total:
- 10 Aptitude questions β Medium level (time, speed, probability, logical reasoning)
- 10 Java code snippet questions β Tough and conceptually heavy
β± Duration: 75 minutes
β
Only 90β100 students were shortlisted from the original 1500 in this round!
Tip: Make sure youβre strong in both logic-building and Java fundamentals. And yes, practice aptitude thoroughly β it was definitely the toughest round.
πΉ Round 2 β Data Structures & Algorithms
This was a coding round with 7 questions of medium level.
The topics included:
- Trees (e.g., Validate BST)
- HashMaps
- Arrays & Strings
- Sliding Window problems (both fixed and variable size)
The questions asked in this round were
- 1. Validate BST
- 2. length of longest substring having distinct characters
- 3. Check palindrome
- 4. FInd first missing Positive
- 5. Number of substring having exactly k characters
- 6. Find the first non repeating character in a string in 1 pass
- 7. I forgot this question and it was easy itself
β Around 40β50 candidates cleared this round.
Tip: Focus on conceptual clarity and edge case handling. Practicing on platforms like LeetCode or GeeksForGeeks really helps here.
πΉ Round 3 β Low-Level Design (LLD)
This round was unexpectedly challenging.
We were asked to design a Task Manager application, and the interview was structured in 8 progressive steps:
- Starting from basic design
- Adding persistence using local file storage
- Handling multiple edge cases and improving functionality step by step
β Only 10β15 students made it to the next technical face-to-face round mostly all of them got selected ig.
Unfortunately, this is where my journey ended.
β My Outcome & Personal Thoughts
Despite performing decently, I wasnβt shortlisted after LLD. I noticed that most of the candidates selected for the next round were from Tamil Nadu, and while it may have been coincidence, I felt there may have been some bias β especially considering that a few others and I implemented almost the same solutions as some of the selected candidates.
But thatβs life β sometimes it's about more than just the code.
π Final Tips for Future Aspirants
- β Prepare well for Aptitude β This is the most difficult and most important round.
- π» LLD Practice is essential β Go beyond just DSA.
- β¨οΈ Get comfortable with online IDEs β You'll be expected to code in them during interviews.
- πͺ Stay consistent and positive β Even if it doesn't work out, every experience counts.
π A Note on the Journey
I travelled 600 km for this drive with a lot of hopes, and though it didnβt go as planned, Iβm taking this as a valuable experience. To anyone out there grinding β your day will come too. Just keep showing up. π
Feel free to ask me if you have questions about the process. Good luck to all future Zoho aspirants! π
Interview Questions (7)
Given the root of a binary tree, determine if it is a valid binary search tree (BST).
Given a string s, find the length of the longest substring without repeating characters.
Given a string or number, determine if it is a palindrome.
Given an unsorted integer array nums, find the smallest missing positive integer.
Given a string S and an integer K, find the number of substrings of S that contain exactly K distinct characters.
Given a string s, find the first non-repeating character in it and return its index. If it does not exist, return -1. This should be achievable in a single pass.
Design a Task Manager application. This involved starting from basic design, adding persistence using local file storage, and handling multiple edge cases and improving functionality step by step.