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
Tekion SDE2 | 2.5 yrs experience | 2022
Summary
I interviewed for an SDE2 role at Tekion with 2.5 years of experience and was selected after multiple technical rounds.
Full Experience
Round 1
1. Given a fixed camera in a forest (with predefined trees), give the best angle in which the camera pictures the maximum of trees. Input angle is given in radian, return angle from 0 (say north)
int ForestCover(vector<Pair<int,int>> coordinateList, int angle)
{
}2. Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus the sum of all keys greater than the original key in BST.
As a reminder, a binary search tree is a tree that satisfies these constraints:
The left subtree of a node contains only nodes with keys less than the node's key.
The right subtree of a node contains only nodes with keys greater than the node's key.
Both the left and right subtrees must also be binary search trees.
Round 2
1. Splitwise LLD
Round 3
1. HLD basics discussions
Verdict: Selected.
Interview Questions (2)
Given a fixed camera in a forest (with predefined trees), give the best angle in which the camera pictures the maximum of trees. Input angle is given in radian, return angle from 0 (say north)
int ForestCover(vector<Pair<int,int>> coordinateList, int angle)
{
}Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus the sum of all keys greater than the original key in BST. As a reminder, a binary search tree is a tree that satisfies these constraints: The left subtree of a node contains only nodes with keys less than the node's key. The right subtree of a node contains only nodes with keys greater than the node's key. Both the left and right subtrees must also be binary search trees.