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
Nagarro Online Assessment – Java Dev (3-5 Years) | DSA + SQL + Java + Spring Boot | Mettl
Summary
I participated in the Nagarro Online Assessment for a Java Developer role, which included DSA coding, SQL, Java, Spring Boot, Java 8 MCQs, and Aptitude questions. I solved the DSA and SQL problems, detailing my approach for the DP jumping problem.
Full Experience
🏢 Company: Nagarro 📝 Round: Online Assessment (OA) 📅 Date: [Insert the date you appeared] 📍 Platform: Mettl 👨💻 Role: Java Developer (3–5 Years Experience) 🧪 Test Pattern: Total Duration: 2 hours
Platform: Mettl
Sections Included:
✅ 4 DSA Coding Questions
✅ 2 SQL Questions
✅ 20 Java MCQs
✅ 20 Spring Boot MCQs
✅ 10 Java 8 MCQs
✅ 20 Aptitude Questions
💻 DSA Coding Questions (4): Chocolate Arrangement
Type: Implementation / Greedy
Description: Arrange chocolates in a way to avoid specific constraints (e.g., no two same adjacent types, maximize variation).
Difficulty: Medium
Find Maximum Length Subarray with Bitwise OR = 1
Type: Bit Manipulation / Sliding Window
Description: Given a binary array, find the longest subarray where the bitwise OR of all elements is exactly 1.
Difficulty: Medium
Find Numbers with Exactly 3 Set Bits < N
Type: Bit Manipulation / Combinatorics
Description: Given an integer N, count how many numbers less than N have exactly 3 set bits in their binary form.
Difficulty: Medium
DP Jumping Problem (Jump to i+1 or i+3)
Type: Dynamic Programming
Description: From index 0, you can jump to i+1 or i+3 to reach the end. Each index has a score. Maximize the total score.
Difficulty: Medium
Approach: Solved using both memoization and tabulation. Compared max score from each jump option at every index.
🗃️ SQL Questions (2): Basic SELECT Query
Difficulty: Easy
Description: Simple query using SELECT, WHERE, ORDER BY on a single table.
LEFT JOIN Query
Difficulty: Medium
Description: Join two tables and return unmatched records from the left table.
Tip: Be comfortable using LEFT JOIN and handling NULL values in filters.
☕ MCQ Sections: Java (20 MCQs): Covers OOPs, Exception Handling, Threads, Collections, and basic language fundamentals.
Spring Boot (20 MCQs): Focused on annotations, REST controllers, autowiring, dependency injection, and bean lifecycle.
Java 8 (10 MCQs): Mostly on streams, lambdas, method references, functional interfaces, and Optional.
Aptitude (20 Questions): Quantitative aptitude and logical reasoning – difficulty ranged from easy to moderate.
Interview Questions (6)
Arrange chocolates in a way to avoid specific constraints (e.g., no two same adjacent types, maximize variation).
Given a binary array, find the longest subarray where the bitwise OR of all elements is exactly 1.
Given an integer N, count how many numbers less than N have exactly 3 set bits in their binary form.
From index 0, you can jump to i+1 or i+3 to reach the end. Each index has a score. Maximize the total score.
Simple query using SELECT, WHERE, ORDER BY on a single table.
Join two tables and return unmatched records from the left table. Tip: Be comfortable using LEFT JOIN and handling NULL values in filters.
Preparation Tips
⏱️ Time management is crucial – With multiple sections, it's important not to spend too much time on one DSA problem.
💡 DSA sections were bit-heavy – Focus on practicing bit manipulation, combinatorics, and dynamic programming.
🧠 SQL was straightforward – Be confident with JOINs, filtering, grouping, and sorting operations.
☕ Java & Spring Boot MCQs covered real-world scenarios and in-depth concepts.
📘 Java 8 section leaned heavily on functional programming – make sure you're fluent with streams and lambda expressions.