Filter interviews by
I applied via Recruitment Consulltant and was interviewed before May 2023. There were 2 interview rounds.
First round was on basics of java. It was surprising to have such questions asked to interviewee applying for a lead role.
Top trending discussions
posted on 21 Jul 2024
Models in Laravel are used to interact with the database and represent data.
Models in Laravel are used to perform database operations such as retrieving, inserting, updating, and deleting data.
Models help in organizing and structuring the data in the application.
Models in Laravel follow the MVC (Model-View-Controller) pattern.
Example: Creating a User model in Laravel to interact with the users table in the database.
SQL joins are used to combine rows from two or more tables based on a related column between them.
Types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN.
INNER JOIN returns rows when there is at least one match in both tables.
LEFT JOIN returns all rows from the left table and the matched rows from the right table.
RIGHT JOIN returns all rows from the right table and the matched rows from the left table.
F...
I applied via Campus Placement and was interviewed in Apr 2023. There were 4 interview rounds.
Coding Questions and SQL
posted on 5 Apr 2024
I applied via Recruitment Consulltant and was interviewed before Apr 2023. There were 2 interview rounds.
I applied via campus placement at SRM university (SRMU) and was interviewed in Sep 2022. There were 2 interview rounds.
3 data structure problem with medium to hard level leetcode type.
Reverse a LinkedList from m to n
Traverse the list to m-1th node
Reverse the nodes from m to n
Connect the reversed list to the original list
I was interviewed in Jan 2021.
Round duration - 90 Minutes
Round difficulty - Easy
This round was conducted on the HackerEarth platform. It had 2 sections and candidates were given a time of 1 hour 30 minutes.
Programming MCQs — 18 MCQs (each of 2 marks)
Questions were a little tricky. it tested upon one’s programming fundamentals. It had C/C++ output questions, pseudocode questions, Operating systems, and SQL queries.
Coding — 2 ( one contains 75 marks and the other contains 100 marks )
Our scores of the first 2 sections weren’t revealed. My MCQs went really well. I solved 2 coding questions in the coding section. Only 15 students got selected for the interview round, and I was one of them.
Given a triangular pyramid with vertices marked as ‘O’, ‘X’, ‘Y’, and ‘Z’, and an integer 'N', you need to calculate the number of ways Bob can start a...
The idea is very simple, as standing at any point we will always have three choices to move. So we will make a recursive function and call it for all three choices and decrease ‘N’ by 1 each time. So when ‘N’ will reach 0 then we will check the current position, if it is ‘O’ then we can say we have found a way.
Complete Algorithm :
Mukesh is evaluating the maximum profit from his business over a series of days. Given a list of profits over 'N' days, Mukesh wants to determine the highest profit achiev...
The basic idea is to iterate through the given array/list ‘profit’ and check for each index as a starting point, if any possible consecutive days in the range [ ‘A’, ‘B’ ] is possible, calculate its ‘sum’ and update the ‘maxProfit’ if the ‘sum’ is greater than ‘maxProfit’ ( where ‘maxProfit’ denotes the Maximum possible profit from the array/list ‘profit’ under the given range).
Algorithm:
Round duration - 60 Minutes
Round difficulty - Medium
This round was scheduled for 1 hour and the panel had 1 interviewer. Being a virtual interview, the first challenge that I faced was that the interviewer was not audible. I suggest you not panic in such a situation and use the chatbox feature (or contact HR if need be) to figure out something that works for you and the panel. We later connected over voice call (over the phone) with our videos ON (over a laptop) and continued with the interview.
The interview was very calm and helpful. I was able to solve all questions and I explained different approaches to solve the questions. Once he was convinced of my solution, he asked me to write the code on my own IDE.
Given a stream of integers, calculate and print the median after each new integer is added to the stream.
Output only the integer part of the median.
N = 5
Stre...
The median of n numbers is the middle-most element among the numbers when sorted in ascending order, when n is odd, and is the average of the two middle-most elements, when n is even. To find the middle-most elements, we do this: For every new addition to the stream, we sort all the numbers that are currently present. This makes it easy for us to obtain the middle-most elements.
Space Complexity: O(1)Exp...Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
The first line ...
The boundary traversal of a binary tree can be broken down into 4 parts. These parts are given in the same order as they are present in the traversal-
Given an integer array/list arr
and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.
The first line c...
O(1)
As constant extra space is used.
Time Complexity: O(n^2)Explanation:O(N^2), where N is the size of the array.
As we are running two nested loops of size N.
Round duration - 90 Minutes
Round difficulty - Medium
This was a technical + HR round. First, he asked me to introduce myself. This round was also based on your knowledge of DSA. I was asked 2 coding questions. Then he asked a couple of questions from OS and DBMS which were pretty easy. At last, we ended the interview on a good note. Then he asked me questions about myself.
Why I want to join OYO rooms.
What are my hobbies?
Goals in the next five years.
Given a string 'STR' of length 'N' and an integer 'M' representing the number of rows in the zig-zag pattern, your task is to return the string formed by concatenating all...
Create an array ‘arr’ of size ‘m’, use the array index ‘arr[i]’ to store the string at row ‘i’. Traverse the string ‘str’, identify the character’s row in the current iteration, and append that character to its corresponding row/index in ‘arr’.
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...
Tip 1 : Practice coding questions as much as you can.
Tip 2 : Your communication skills must be good.
Tip 1 : Mention some good projects on your resume.
Tip 2 : Don't write any false information on your resume.
I was interviewed in Jan 2021.
Round duration - 90 Minutes
Round difficulty - Hard
Timing was 11 am. Platform was quite well.
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.
Algorithm is as follows:
You are given an NxM matrix consisting of '0's and '1's. A '1' signifies that the cell is accessible, whereas a '0' indicates that the cell is blocked. Your task is to compute ...
Maintain a visited array and try to explore all the possibilities with the help of backtracking.
Tip 1 : Practice data structure based questions.
Tip 2 : OOPS is very important.
Tip 3 : Prepare OS and DBMS for mcq.
Tip 1 : Mention atleast 2 projects on resume.
Tip 2 : Keep it short in length.
I was interviewed before May 2021.
Round duration - 90 Minutes
Round difficulty - Easy
Determine the position of the rightmost set bit in the binary representation of a given number N.
T: Number of test cases
N: An integer for which the position of the...
Round duration - 60 Minutes
Round difficulty - Medium
You have two water jugs with capacities X
and Y
liters respectively, both initially empty. You also have an infinite water supply. The goal is to determine if it is possible to...
Round duration - 60 Minutes
Round difficulty - Medium
Tip 1 : Make your DSA and Algorithm as much as strong as possible.Main focus should be on Graphs and Trees.
Tip 2 : There are many standard algorithm on which questions are frequently asked.Try to practice as much as you can on them.
Tip 3 : Your project should be unique to create unforgettable impression.
Tip 1 : Add 2-3 best of your projects which shows something extraordinary.
Tip 2 : Add your achievements if you have any like getting top rank in a coding competition.
I applied via campus placement at Netaji Subhas Institute of Technology (NSIT) and was interviewed before Dec 2021. There were 3 interview rounds.
Coding Rond consisted of 3 questions
based on 1 interview
Interview experience
Key Account Manager
120
salaries
| ₹2.9 L/yr - ₹10 L/yr |
Manager- Corporate Sales
53
salaries
| ₹4 L/yr - ₹9 L/yr |
Assistant Manager
50
salaries
| ₹4 L/yr - ₹9.2 L/yr |
Guest Delight Officer
40
salaries
| ₹1.8 L/yr - ₹4 L/yr |
Deputy Manager
38
salaries
| ₹4 L/yr - ₹10 L/yr |
Oyo Rooms
Treebo Hotels
Goibibo
MakeMyTrip