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
Graviton Research Capital LLP | Quantitative Analyst (New Grad) | India | May 2025 [Rejected]
Summary
I interviewed for a Quantitative Analyst (New Grad) position at Graviton Research Capital LLP in Gurgaon, India, in May 2025 and was ultimately rejected. The experience provided a valuable opportunity to solve challenging problems and understand their rigorous selection process.
Full Experience
๐ Interview Process
Stages:
- Introductory Call
- Technical Round 1
- Technical Round 2
- Technical Round 3
๐ Round 1: Problem Solving
- Q1: Find the maximum value of
A[i] + A[j] + A[k]in an array such thatA[i] < A[j] < A[k]andi < j < k. - Q2: Leetcode - Domino and Tromino Tiling
๐ก Round 2: Project + Logical Thinking
Discussion: Summer Internship Project
-
Q1: On a standard chessboard, what is the maximum number of (for each type of piece):
- Rooks
- Kings
- Bishops
- Queens
- Pawns
that can be placed such that none attack each other? Also find the number of distinct ways to place them in such maximum configurations.
-
Q2: There are 11 soldiers marching on a field, each one watches only his nearest soldier. Distances between all soldiers are distinct.
Prove: There is at least one soldier who is not being watched.
๐ง Round 3: Project + Mathematical Puzzles
Discussion: Summer Internship Project
-
Q1: Given an array of size 200 with whole numbers (โค 200, possibly with duplicates),
Prove: There exists at least one subset whose sum is divisible by 200. -
Q2: A collection initially has numbers from 1 to 50 (1,2,3....,50).
In each operation, pick any two numbersaandb, remove them, and insert|a - b|.
This is done 49 times until one number remains.
Question: What are all possible final states of the collection?
๐งพ Outcome
Final Status: Rejected
Despite not clearing the final round, the experience was a valuable opportunity to solve challenging problems and understand Graviton's rigorous selection process.
Interview Questions (6)
Find the maximum value of A[i] + A[j] + A[k] in an array such that A[i] < A[j] < A[k] and i < j < k.
On a standard chessboard, what is the maximum number of (for each type of piece): - Rooks - Kings - Bishops - Queens - Pawns that can be placed such that none attack each other? Also find the number of distinct ways to place them in such maximum configurations.
There are 11 soldiers marching on a field, each one watches only his nearest soldier. Distances between all soldiers are distinct. Prove: There is at least one soldier who is not being watched.
Given an array of size 200 with whole numbers (โค 200, possibly with duplicates), Prove: There exists at least one subset whose sum is divisible by 200.
A collection initially has numbers from 1 to 50 (1,2,3....,50). In each operation, pick any two numbers a and b, remove them, and insert |a - b|. This is done 49 times until one number remains. Question: What are all possible final states of the collection?