Filter interviews by
I applied via Indeed and was interviewed in Mar 2023. There were 4 interview rounds.
Basics mental ability
I applied via Naukri.com and was interviewed in Mar 2022. There were 4 interview rounds.
Salary discussion and basic question like why you want to change and why this location
I applied via Walk-in and was interviewed before Nov 2021. There were 4 interview rounds.
Top trending discussions
posted on 21 Nov 2020
I applied via Referral and was interviewed before Jan 2020. There were 6 interview rounds.
Amortization is the process of spreading out a loan into smaller, regular payments over a period of time.
It is used to pay off a debt over time with regular payments
Each payment includes both principal and interest
The amount of interest decreases over time as the principal is paid off
Examples include mortgages, car loans, and student loans
WASO is Wake After Sleep Onset, TSO is Total Sleep Time, and EPS is Earnings Per Share.
WASO is the amount of time spent awake after initially falling asleep.
TSO is the total amount of time spent sleeping, including both REM and non-REM sleep.
EPS is a financial metric that represents the portion of a company's profit allocated to each outstanding share of common stock.
WASO and TSO are commonly used in sleep studies, whi
The financial statements (BS, IS, CF) have common elements such as assets, liabilities, equity, revenue, expenses, and cash flows.
Assets: resources owned by the company
Liabilities: obligations owed by the company
Equity: residual interest in the assets of the company
Revenue: income generated by the company
Expenses: costs incurred by the company
Cash flows: inflows and outflows of cash
A stock split increases the number of shares outstanding and decreases the price per share, but does not affect the market capitalisation.
Stock split does not affect the total value of the company
Market capitalisation remains the same after a stock split
Stock split increases the number of shares outstanding and decreases the price per share
For example, if a company has 1 million shares outstanding and the stock splits ...
Cash flow statements have three main components: operating activities, investing activities, and financing activities.
Operating activities: cash inflows and outflows from the company's core business operations.
Investing activities: cash inflows and outflows from buying or selling long-term assets.
Financing activities: cash inflows and outflows from borrowing or repaying debt, issuing or buying back stock, and paying di...
EPS is calculated by dividing the company's net income by the number of outstanding shares.
EPS = Net Income / Outstanding Shares
Net Income is the company's total earnings after expenses and taxes
Outstanding Shares are the total number of shares issued by the company
EPS is an important metric for investors to evaluate a company's profitability
Higher EPS indicates better profitability and potential for higher dividends
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
posted on 11 Mar 2022
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process
Track the time taken to rot all oranges and return -1 if any fresh oranges remain
Handle edge cases like no fresh oranges or all oranges already rotten
Consider using a queue to efficiently process adjacent oranges
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Find the majority element in an array, return -1 if no majority element exists.
Iterate through the array and keep track of the count of each element using a hashmap.
Check if any element's count is greater than floor(N/2) to determine the majority element.
Return the majority element or -1 if no majority element exists.
You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...
Find the maximum path sum between two leaf nodes in a binary tree.
Traverse the tree to find the maximum path sum between two leaf nodes.
Keep track of the maximum sum found so far.
Consider all possible paths between leaf nodes.
Handle cases where the tree has only a single leaf node.
Implement a recursive function to calculate the maximum path sum.
Round duration - 60 minutes
Round difficulty - Medium
This was a technical round with DSA based questions.
You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.
If the given list is (1 -> -2 -&g...
Find the N-th node from the end of a Singly Linked List of integers.
Traverse the list to find the length L of the list.
Calculate the position of the N-th node from the beginning as L - N + 1.
Traverse the list again to reach the calculated position and return the node's value.
You are given a binary tree consisting of distinct integers and two nodes, X
and Y
. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the LCA.
Handle cases where one node is an ancestor of the other or when one node is the LCA itself.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.
Split the input string by spaces to get individual words
Reverse the list of words
Join the reversed words with a single space in between
Handle leading/trailing spaces by stripping them before and after reversing
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA
Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...
Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.
Sort subjects in descending order
Assign subjects to friends one by one until all subjects are assigned
The maximum workload will be the sum of problems assigned to the friend with the most problems
Return the maximum workload as the minimum time required
Grammar in compiler design defines the syntax and structure of a programming language.
Grammar specifies the rules for forming valid statements in a programming language.
It consists of a set of production rules that define how valid programs can be constructed.
There are different types of grammars such as context-free grammar, regular grammar, etc.
Example: In C programming language, the grammar specifies that a for loop...
A token in compiler design is a basic unit of syntax that the compiler can understand and process.
Tokens are the smallest units of a program that are meaningful to the compiler.
Examples of tokens include keywords, identifiers, operators, and punctuation symbols.
Tokens are generated by the lexical analysis phase of the compiler.
Tokens are used by the parser to build the abstract syntax tree of the program.
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.
Traverse the binary tree from root to leaf nodes, keeping track of the current path sum
Add the current path sum to the total sum when reaching a leaf node
Use modulo (10^9 + 7) to handle large outputs
A regular language is a language that can be recognized by a finite automaton.
Regular languages can be described by regular expressions.
Regular languages are closed under union, concatenation, and Kleene star operations.
Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.
NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.
NP problems can be verified in polynomial time but not necessarily solved in polynomial time.
NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.
Examples of NP problems include the subset sum problem and the traveling salesm...
Round duration - 30 minutes
Round difficulty - Easy
That was the round for which I’ve been waiting for hours
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I appeared for an interview in Sep 2017.
based on 54 reviews
Rating in categories
Design Engineer
35
salaries
| ₹3.8 L/yr - ₹7.5 L/yr |
Senior Design Engineer
17
salaries
| ₹5.6 L/yr - ₹16.9 L/yr |
Mechanical Engg. Design
7
salaries
| ₹5.3 L/yr - ₹5.8 L/yr |
Senior Engineer
6
salaries
| ₹4.5 L/yr - ₹9.1 L/yr |
Teritory Sales Officer
6
salaries
| ₹2.3 L/yr - ₹5 L/yr |
Udaan
Home Credit Finance
Swiggy
Oyo Rooms