oyo rooms logo
Oyo Rooms· Associate Software Development Engineer (ASDE)

OYO Rooms (PRISM) | Associate Software Development Engineer | Campus Placement Interview Experience

Posted
30 Oct 2026
35 reads

Summary

I participated in OYO Rooms' campus placement interview for an Associate Software Development Engineer role, solved all online assessment questions but was not selected after the technical interview.

How it went

Company: OYO Rooms (PRISM) Role: Associate Software Development Engineer (ASDE) Interview Type: Campus Placement Online Assessment: Easy-Medium Technical Interview: Medium-Hard Final Result: No candidates selected for the technical role.


Round 1: Online Assessment (OA)

The campus placement process started with an initial screening, after which approximately 100-120 students were shortlisted for an online coding assessment conducted on campus.

The assessment consisted of 4 coding questions, with difficulty ranging from Easy to Medium.

Topics covered:

  • Two Pointers
  • Sliding Window
  • Other common DSA patterns

I was able to solve all 4 questions in the assessment.

Following the OA, 7 students were shortlisted for the technical interview round.


Round 2: Technical Interview

The shortlisted candidates appeared for an online technical interview.

I was asked two coding questions during my interview.

1. Binary Tree Cameras — LeetCode 968

Problem Link

Topics: Binary Trees, Greedy, Tree DP

The problem asks you to find the minimum number of cameras required to monitor every node in a binary tree.

2. Modified Meeting Rooms II — LeetCode 253

Problem Link

Topics: Intervals, Sorting, Min Heap

The interviewer asked a slightly modified version of Meeting Rooms II, based on meeting intervals and determining the number of rooms required.

Note: The interview question was a customized variation of the original LeetCode problem.


Questions Asked in Other Candidates' Interviews

From discussions with my classmates, other interviews also included questions related to:

  • Linked Lists
  • Binary Trees
  • Tree-based problems

Final Result

Unfortunately, no candidates were selected for the technical role through this placement drive.

OYO had also recruited for non-technical roles, for which approximately 20 students were placed. However, no students were selected for the technical position.


Overall, this was a valuable interview experience and a reminder that consistent DSA practice and strong problem-solving fundamentals are essential for software development roles.

I hope this helps students preparing for OYO's campus placement process. All the best!

Questions asked (2)

  1. 01

    Binary Tree Cameras

    Data Structures & Algorithms · Hard

    Given a binary tree, find the minimum number of cameras needed to monitor every node. A camera at a node can monitor its parent, itself, and its immediate children.

    Open the problem
  2. 02

    Modified Meeting Rooms II

    Data Structures & Algorithms · Medium

    Given a list of meeting intervals, determine the minimum number of meeting rooms required. The interview used a customized variation of the standard Meeting Rooms II problem.

    Open the problem

How they prepared

I consistently practiced DSA patterns such as two‑pointer techniques and sliding‑window problems, solving numerous coding questions to build strong problem‑solving fundamentals.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Oyo Rooms recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!