Morgan Stanley - Round 1 (DSA + Scenario base ) - cleared

Anonymous User
312
Oct 24, 2026
Oct 25, 2026

The interview lasted for about 1.5 hours. I have clered the hackrank test after that I got invited for round 1. I have 6+ years of experiance

Introduction

  • Started of introduction
  • The interviewer asked me to walk through the High leval architecture at my current project.

One Hard DSA problems:

Problem Statement:

You are given an m x n 2D grid. You need to find the total number of unique ways to travel from the top-left cell to the bottom-right cell.

You can move in only two directions:

  1. Right → Move to the next column.
  2. Down ↓ Move to the next row.
    You cannot move left or up.

I was able to solved this problem using DP. The interview went deeper than just getting the right answer, they cross-examined my methodology to assess my logical thinking and decision-making.

Java Trivia questions
Stream vs Collections
Deep dive into HashMap internal
Scenario base question on Equals and hashcode method
predict the output
Sorting on Custom Object(camparable/comparator)
Generics in Java

Result: cleared

Comments (2)