MMT || SDE 2
September 10, 2026 · 0 reads
Summary
I interviewed for an SDE 2 role at MMT, went through two rounds and was ultimately rejected.
Full Experience
Recently Interviewed for MMT.
contacted via naukri for this job opportunity.
R1:
- Basic introduction.
- Projects
- https://leetcode.com/problems/subarray-sum-equals-k/description/
- find cycle in directed graph.
R2:
- Introduction
- write a code where
- producer produces the task
- consumer consumes the task
- produces has to wait it queue is full
- produces and consumer should work parallely.
- write a code for
- we have W workers
- we have T tasks
- we have P phases in each task
- we have to write a code where workers works parallely and complete all tasks. where all workers must complete one phase of all tasks then proceed with next phases of all tasks.
- ex : if 3 tasks are there and 3 phases are there in each task then all workers should complete phase 1 of each task then they start working on next phase of the tasks.
Rejected
Interview Questions (4)
1.
Subarray Sum Equals K
Data Structures & Algorithms·Medium
Given an integer array nums and an integer k, return the total number of continuous subarrays whose sum equals to k.
2.
Detect Cycle in Directed Graph
Data Structures & Algorithms
Given a directed graph, determine whether the graph contains a cycle.
3.
Producer Consumer with Bounded Queue
Data Structures & Algorithms
Write code where a producer generates tasks and a consumer processes them. The producer must wait when the queue is full, and both operate concurrently.
4.
Parallel Workers Phase Scheduling
Data Structures & Algorithms
Given W workers, T tasks, each task having P phases, design a solution where workers execute tasks in parallel such that all workers complete one phase of every task before moving to the next phase.