i
Filter interviews by
Top trending discussions
I applied via Referral and was interviewed in Sep 2020. There was 1 interview round.
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
Coding question of medium level difficulty, from DP.
18 MCQs were core CSE related concepts e.g: OS, OOPs, DBMS, Networking
Time was 90 minutes.
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 ...
Find the minimum cost to reach a destination in a matrix with blocked cells.
Use Breadth First Search (BFS) algorithm to explore all possible paths from the starting point to the destination.
Keep track of the cost incurred at each cell and update it as you move through the matrix.
Return the minimum cost to reach the destination or -1 if it is unreachable.
Round duration - 30 minutes
Round difficulty - Medium
It was an one-to-one interview. It checks your problem solving ability and a few OOPs, OS, DBMS etc concepts. Coding questions were related to array, queue and DP.
Given an integer array/list ARR
of length 'N', determine if it is possible to form at least one non-degenerate triangle using the values of the array as the sides o...
Determine if it is possible to form a non-degenerate triangle using array elements as sides.
Check if the sum of any two sides is greater than the third side for all combinations of sides.
If the above condition is met for any combination, return true; otherwise, return false.
You are given an array/list of integers. The task is to return the maximum sum of a subsequence such that no two elements in the subsequence are adjacent in the given ...
Find the maximum sum of non-adjacent elements in an array.
Use dynamic programming to keep track of the maximum sum at each index, considering whether to include the current element or not.
At each index, the maximum sum can be either the sum excluding the current element or the sum including the current element but excluding the previous element.
Iterate through the array and update the maximum sum accordingly.
Example: F...
Round duration - 45 minutes
Round difficulty - Easy
It was also a problem solving round. However after coding questions, they also asked CSE conceptual questions.
Convert a given binary tree into its sum tree. In a sum tree, every node's value is replaced with the sum of its immediate children's values. Leaf nodes are set to 0. Finally, return th...
Convert a binary tree into a sum tree by replacing each node's value with the sum of its children's values. Return preorder traversal.
Traverse the tree in a bottom-up manner, starting from the leaf nodes.
For each node, update its value to the sum of its children's values.
Set leaf nodes to 0.
Return the preorder traversal of the modified tree.
Core concepts of indexing in DBMS include types of indexes, benefits of indexing, and factors affecting index performance.
Types of indexes: B-tree, Hash, Bitmap, etc.
Benefits of indexing: Faster data retrieval, improved query performance, reduced disk I/O.
Factors affecting index performance: Selectivity, clustering factor, index fragmentation.
Examples: Creating an index on a column in a table to speed up search queries
Tip 1 : Strengthen your coding, algorithms. This is one most important thing for OYO. Practice Graph, tree, DP, greedy, recursion, data structures questions.
Tip 2 : OS, DBMS concepts will give you an edge over others. Like serialisation, index, deadlock, semaphore
Tip 3 : Only mention those projects in your resume which you are very clear about. They don't ask for detailed explanation, just an overall idea about your projects will increase your chances
Tip 1 : Mention college projects wisely. No need to mention fancy projects. Any project that you can describe to the interviewer will be a best solution
Tip 2 : Neat & clean resume with your skills, technical stacks that you mastered. That's all. They don't require you to be very active in extra-curricular activities, and these things will not give you any advantage.
Tip 3 : Keep it of single page
I applied via Referral and was interviewed before Dec 2023. There was 1 interview round.
I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.
Primary and Secondary B2C and B2B Marketing
I applied via Recruitment Consulltant and was interviewed before Oct 2023. There was 1 interview round.
Yes, I have extensive experience in the FMCG industry.
Managed marketing campaigns for leading FMCG brands such as Procter & Gamble and Unilever
Developed and executed strategies to increase brand awareness and drive sales in competitive FMCG market
Led cross-functional teams to launch new products and drive market penetration
Analyzed market trends and consumer behavior to identify opportunities for growth
I applied via Recruitment Consulltant and was interviewed in Mar 2024. There were 3 interview rounds.
It was a mix of quant questions and logical reasoning questions
Seeking new challenges and opportunities for growth in a different environment.
Looking for new challenges and opportunities for personal and professional growth
Interested in exploring different industries and markets
Seeking a change in work culture or company values
I was drawn to ElasticRun's innovative approach to logistics and the opportunity to make a significant impact in the industry.
I am impressed by ElasticRun's use of technology to optimize logistics operations.
I am excited about the potential to drive growth and efficiency in the company's marketing strategies.
I believe my skills and experience align well with the company's goals and vision.
I applied via Recruitment Consulltant and was interviewed in Oct 2023. There was 1 interview round.
posted on 16 Aug 2024
I applied via Campus Placement and was interviewed in Feb 2024. There were 3 interview rounds.
Was tough but can be cracked in one go
Easy to moderate need to study dsa
I have worked on various projects including a web application for a healthcare company and a mobile app for a retail business.
Developed a web application for a healthcare company to manage patient records and appointments
Created a mobile app for a retail business to enhance customer shopping experience
Implemented features such as user authentication, data visualization, and real-time updates
Utilized technologies like R
posted on 18 Sep 2024
There were easy to medium dsa questions
Object-oriented programming concepts that help in organizing and structuring code.
Encapsulation: Bundling data and methods that operate on the data into a single unit (class).
Inheritance: Allowing a class to inherit properties and behavior from another class.
Polymorphism: Ability to present the same interface for different data types.
Abstraction: Hiding the complex implementation details and showing only the necessary
based on 1 interview
Interview experience
Senior Associate
440
salaries
| ₹5.7 L/yr - ₹21.1 L/yr |
Deputy Manager
112
salaries
| ₹6 L/yr - ₹16 L/yr |
Graduate Engineer Trainee (Get)
100
salaries
| ₹5.2 L/yr - ₹7.7 L/yr |
Lead
88
salaries
| ₹11.5 L/yr - ₹34 L/yr |
Associate
84
salaries
| ₹3.8 L/yr - ₹14.5 L/yr |
Oyo Rooms
Udaan
Ekart Logistics
Thomson Reuters