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
WePay Coding Challenge (JP Morgan) | SWE | San Francisco Bay | Feb 2020 [Reject]
Summary
I received an online coding assessment invitation from WePay, a subsidiary of JP Morgan, for a Software Engineer role. I completed two interesting LeetCode questions, including 'Sliding Puzzle', but ultimately received a template rejection email as I anticipated.
Full Experience
I received an invitation from WePay for a coding challenge. Before attempting it, I had a feeling it might lead to an automated rejection, so I tried replying to the invitation email with a small question, but received no response. Despite this, I logged into HackerRank as I had some free time and wanted to document the questions.
There were two quite interesting LeetCode problems. I quickly solved both: the first easy one using two methods, including a one-liner, and the second one, which was 'Sliding Puzzle', using Alex Wice's heap-priority queue method. Only one edge case for 'Sliding Puzzle' wasn't passing.
I meticulously added detailed Time/Memory Complexities, docstrings, and type hinting (in Python3) before submitting my answers.
As expected, I received a template rejection email. I believe this was partly because I wasn't a good fit, and there had been no prior communication from HR or the Hiring Manager. However, I still valued the experience.
Interview Questions (2)
Given an array of integers and a target value, determine if there exist two elements in the array (at different indices) such that their sum equals the target. Return true if such a pair exists, false otherwise.
On a 2x3 board, there are five numbers from 1 to 5 and an empty square represented by 0. A move consists of swapping 0 with any adjacent number (up, down, left, or right). The goal is to return the minimum number of moves required to transform the board from the starting state to the target state [[1,2,3],[4,5,0]]. If it's impossible to reach the target state, return -1.