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
RazorPay Product Engineer -2 (Backend) Reject
Summary
My interview experience at RazorPay for a Product Engineer -2 (Backend) role involved an online assessment, two technical rounds, and a final hiring manager round. Unfortunately, I was rejected after the hiring manager round, despite feeling confident about my performance in most of the earlier stages.
Full Experience
I was initially contacted by a recruiter on Instahyre and received an OA link. The first round, an Online Assessment, consisted of 20 MCQ questions and two LeetCode medium-level problems.
The second round, Tech 1, was an interview with two POS team engineers who were both very supportive. They asked me questions on data structures like 'zigzag traversal of matrix', 'finding a loop in a linked list', and 'finding the intersection node of two linked lists'. There were also several questions related to Spring Boot and Java.
The third round, Tech 2, was with a principal engineer from the POS team. He began with an introduction and shared some background on working at RazorPay. I was able to answer almost all questions, except for one or two Java-related ones. The technical questions included 'given an array (1 -> n) find the non-duplicate number (allowed to modify input array)' and 'find a number which occurred twice in a sorted array (using binary search) and an unsorted array (using XOR logic)'. Additionally, there were questions about my projects, and specific topics like Java, Kafka, and Spring Boot. I managed to answer most of these, with only one or two Kafka-related questions posing a challenge.
The final round, with the Hiring Manager, was quite a frustrating experience. The HM was late by about 10 minutes, so I informed the recruiter and dropped the call. After some time, the recruiter called me back, saying the HM was available, so I rejoined. The HM immediately asked me to solve a LeetCode question without writing it down, just stating 'given an array find maximum sum subset'. I clarified if it was 'find the max sum of subarray' or 'find the max sum of subset'. I knew the optimal solution using Kadane's algorithm but tried to explain a brute-force approach first, detailing its time and space complexity. She seemed to misinterpret my explanation, wrongly swapping time and space complexities, which made me feel she was determined to reject me. I then explained and coded Kadane's algorithm. I initially presented a general approach, planning to address the all-negative numbers case later, but she pointed that out, so I fixed it. Following this, she asked some situation-based questions. I thought the round went well and was expecting a positive outcome, but I later received a rejection, with feedback stating that I was 'not able to find and check all possible scenarios for the given problem'. This feedback came as a surprise given my performance. Despite the HM round, all other interviewers were nice and helpful.
Interview Questions (6)
Implement a function to perform a zigzag traversal of a given matrix, printing elements alternately from left-to-right and right-to-left for each subsequent row.
Given the head of a singly linked list, determine if it contains a cycle. A cycle means that some node in the list can be reached again by continuously following the next pointers.
Given the heads of two singly linked lists, headA and headB, return the node at which the two lists intersect. If the two lists have no intersection at all, return null.
Given an array containing numbers in the range 1 to n, where all numbers appear twice except for one which appears once, find that non-duplicate number. You are allowed to modify the input array.
Given an array, identify and return a number that has occurred exactly twice. Provide a solution for when the array is sorted (hint: use binary search) and another solution for when the array is unsorted (hint: use XOR logic).
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. I clarified with the interviewer if the question was to find the maximum sum of a subarray or a subset.