i
PAJASA Apartments
Filter interviews by
Be the first one to contribute and help others!
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
I applied via Campus Placement
I applied via Campus Placement
I applied via LinkedIn and was interviewed in Aug 2023. There were 2 interview rounds.
Self-join is used to join a table with itself to compare rows within the same table.
Used to compare rows within the same table
Helps in retrieving hierarchical data
Can be used to find employees who report to the same manager
Critical KPIs to monitor after creating a new website include traffic, conversion rate, bounce rate, and user engagement.
Traffic: Monitor the number of visitors to the website to gauge its reach and popularity.
Conversion Rate: Track the percentage of visitors who take a desired action, such as making a purchase or signing up for a newsletter.
Bounce Rate: Measure the percentage of visitors who leave the website after vi...
The probability of getting at least one six after throwing 2 unbiased dice is 11/36.
The total number of outcomes when throwing 2 dice is 36 (6 sides on each die)
The number of outcomes where at least one die shows a six is 11 (6 outcomes where one die shows a six, plus 1 outcome where both dice show sixes)
I applied via Campus Placement and was interviewed in May 2023. There were 4 interview rounds.
SQL questions and logical reasoning
A guesstimate and a case study on profitability
I applied via Campus Placement and was interviewed before Dec 2021. There were 3 interview rounds.
Coding Rond consisted of 3 questions
I applied via Campus Placement and was interviewed in Apr 2023. There were 4 interview rounds.
Coding Questions and SQL
I appeared for an interview 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...
Find the position of the rightmost set bit in a given number's binary representation.
Convert the number to binary representation.
Find the position of the rightmost set bit by counting from right to left.
Return the position of the rightmost set bit.
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...
The Water Jug Problem involves determining if a specific amount of water can be measured using two jugs of different capacities.
Start by considering the constraints and limitations of the problem.
Think about how the operations allowed can be used to reach the target measurement.
Consider different scenarios and test cases to understand the problem better.
Implement a function that can determine if the target measurement
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 and was interviewed in Feb 2024. There were 2 interview rounds.
Basic aptitude question and 2 Sql question
Merge sort is a sorting algorithm that divides an array into smaller chunks and then merges them in sorted order.
Merge sort is a divide-and-conquer algorithm.
It recursively divides the array into two halves until each subarray has only one element.
Then it merges the subarrays in sorted order.
The merge step compares elements from both subarrays and places them in the correct order.
It has a time complexity of O(n log n).
based on 1 review
Rating in categories
Oyo Rooms
FabHotels
Taco Bell
TAJSATS AIR CATERING