i
Club Oxygen
Filter interviews by
Clear (1)
I applied via Job Fair and was interviewed in May 2023. There were 2 interview rounds.
Top trending discussions
My hobbies include reading, playing guitar, and hiking.
Reading: I enjoy reading books from various genres, such as fiction, fantasy, and self-help.
Playing guitar: I have been playing the guitar for several years and enjoy learning new songs and techniques.
Hiking: I love exploring nature and going on hikes to discover new trails and beautiful landscapes.
I applied via Apna Jobs and was interviewed in Feb 2023. There were 2 interview rounds.
Housekeeping pertains to the management and organization of a living space to maintain cleanliness and order.
Housekeeping involves cleaning, organizing, and maintaining a home or other living space.
It includes tasks such as dusting, vacuuming, mopping, and laundry.
Housekeeping also involves decluttering, tidying up, and ensuring proper storage of items.
Regular housekeeping helps prevent the buildup of dirt, dust, and g...
Jaggery is a traditional non-centrifugal cane sugar consumed in many countries in Asia and Africa.
Types of jaggery include palm jaggery, sugarcane jaggery, date palm jaggery, and coconut jaggery.
Jaggery can also be made from sap of the Palmyra palm, sugar cane, or date palm.
Different types of jaggery vary in color, taste, and texture based on the source of the sugar.
Butter can be extracted by churning cream until the fat separates from the liquid.
Obtain fresh cream from milk or purchase heavy cream from the store.
Allow the cream to come to room temperature.
Place the cream in a jar or container and shake or use a hand mixer to churn it.
Continue churning until the fat separates from the liquid, forming butter.
Drain the liquid (buttermilk) from the butter and rinse the butter with co...
I am a recent graduate with a degree in Business Administration and a passion for marketing and project management.
Graduated with a Bachelor's degree in Business Administration
Passionate about marketing and project management
Completed internships in marketing departments
Strong communication and organizational skills
The F&B department in a company is responsible for managing food and beverage operations, including menu planning, ordering supplies, and ensuring quality service.
Responsible for menu planning and development
Oversees ordering and inventory management of food and beverage supplies
Ensures quality service and customer satisfaction
Coordinates with kitchen staff and servers for smooth operations
Manages pricing and cost cont
I applied for this internship because I am passionate about gaining practical experience in the field and developing my skills.
Passionate about gaining practical experience
Desire to develop skills in the field
Opportunity to learn from professionals
Interest in the company's work and values
The newspaper contains news articles, opinion pieces, advertisements, and other information.
News articles covering current events
Opinion pieces discussing various topics
Advertisements for products and services
Sports section with updates on games and matches
Weather forecast for the day
Local events and community news
Business section with stock market updates
Entertainment section featuring movie reviews and celebrity news
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 Campus Placement
I applied via Campus Placement
I am a dedicated professional with experience in management. I want to work in Oyo for its innovative approach to hospitality. Life in Bangalore is vibrant and diverse.
I have a strong background in management and leadership roles
I am attracted to Oyo for its innovative technology-driven approach to hospitality
Bangalore offers a vibrant cultural scene with diverse food options and entertainment
The city is known for its
Tele Marketing Executive
13
salaries
| ₹1.8 L/yr - ₹3 L/yr |
Direct Sales Manager
13
salaries
| ₹4 L/yr - ₹5.8 L/yr |
Team Manager
10
salaries
| ₹4.8 L/yr - ₹9 L/yr |
Senior Sales Executive
7
salaries
| ₹3 L/yr - ₹3.3 L/yr |
Team Lead
6
salaries
| ₹3.4 L/yr - ₹5.5 L/yr |
Talwalkars Better Value Fitness
Gold's Gym
Anytime Fitness
Cult India