Filter interviews by
posted on 30 Jan 2023
I applied via Referral and was interviewed in Dec 2022. There were 2 interview rounds.
Answer to QA Automation Tester interview question on prime numbers and opening Chrome browser via Java Selenium.
Prime number program can be implemented using a loop and checking for factors
Code snippet to open Chrome browser via Java Selenium involves creating a WebDriver instance and using the get() method to open the browser
Example code for prime number: for(int i=2;i<=n/2;i++){if(n%i==0){flag=1;break;}}
Example code ...
Questions on Selenium architecture, Git, waits, lambda expressions, OOP concepts, POJO, and mouse/keyboard events.
Selenium architecture involves a client library, WebDriver, and a browser driver.
Code can be pushed to Git using Git commands or through an IDE like Eclipse or IntelliJ.
Waits in Selenium are used to synchronize test execution with the application's response.
Lambda expressions are used to create anonymous fu...
I applied via Recruitment Consulltant
Easy DSA . few of them were
Asked me to find unique char in a string and its count
Merge sort and quick sort
Indexing in NoSQL is a technique used to optimize query performance by creating data structures that allow for faster data retrieval.
Indexes in NoSQL databases are similar to indexes in relational databases, but they are typically more flexible and can be created on any field in a document.
By creating indexes on specific fields, queries can quickly locate the desired data without having to scan through the entire datab...
Hoisting is a JavaScript mechanism where variable and function declarations are moved to the top of their containing scope during compilation.
Variable declarations are hoisted but not their initializations.
Function declarations are fully hoisted, including their definitions.
Hoisting can lead to unexpected behavior if not understood properly.
I applied via Company Website and was interviewed in Nov 2023. There was 1 interview round.
Tecan Fluent control software is a user-friendly platform for managing automated liquid handling systems.
Tecan Fluent control software allows users to create and run protocols for liquid handling tasks.
Users can easily customize protocols to meet specific experimental needs.
The software provides real-time monitoring of liquid handling processes.
It offers advanced scheduling and data tracking capabilities for increased ...
I applied via LinkedIn and was interviewed in May 2023. There were 4 interview rounds.
20 mcqs on aptitude+ 2 easy to medium coding question
Omnicell interview questions for popular designations
I applied via Company Website and was interviewed in Apr 2023. There were 3 interview rounds.
It was combination of the verbal ability, aptitude, English grammer.if u qualify min marks u can go the forward step.
I applied via Referral and was interviewed before Nov 2022. There were 4 interview rounds.
1 Hour Time 2 Questions one hard one moderate difficulty, discussion on solution ,code optimization if any
Top trending discussions
I appeared for an interview before Sep 2020.
Round duration - 45 minutes
Round difficulty - Easy
This round was telephonic round. The interview lasted for approximately 45 minutes. The interviewer asked me three coding questions. I hustled a bit on 3rd question but after a hint was able to solve it.
Round duration - 120 minutes
Round difficulty - Easy
This round was Online Test on Hackerrank for 120 minutes, it contained 3 questions.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Use a combination of hashmap and doubly linked list to implement the LRU cache.
Keep track of the least recently used item and evict it when the cache reaches its capacity.
Update the position of an item in the cache whenever it is accessed or updated.
Handle both get and put operations efficiently to main...
Round duration - 60 minutes
Round difficulty - Easy
This round was face to face Interview at Ola Campus and lasted for 1 hour.
Round duration - 35 minutes
Round difficulty - Easy
This round was again a face to face technical interview, I was just asked one question in this round.
Round duration - 30 minutes
Round difficulty - Easy
Only a question of System Design was asked
Design a toll booth system for Ola cabs with necessary functions and data structures.
Use a queue data structure to manage the order of vehicles waiting at the toll booth.
Implement functions for vehicle entry, toll calculation, and exit.
Store vehicle information such as license plate number, type of vehicle, and toll amount in a hash map.
Utilize a priority queue to handle VIP or premium customers efficiently.
Include a f...
Round duration - 30 minutes
Round difficulty - Easy
Very general HR questions were asked
Tip 1 : Be confident in the projects you have mentioned in your resume.
Tip 2 : Always discuss your approach with the interviewer first for any problem.
Tip 3 : Always start with a basic solution and then discuss further optimisations.
Tip 1 : Good projects showing your skills (Be clear in what you achieved from those projects)
Tip 2 : Internship experience at the top (It gives you an edge over others)
I appeared for an interview before May 2021.
Round duration - 90 minutes
Round difficulty - Medium
It was in the morning, where there were 3 questions to answer.
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid redundant traversal.
Increment the island count each time a new island is encountered.
Consider all eight possible directions for connectivity while traversing the matrix.
Handle edge ca...
You are provided with an array called ARR
, consisting of distinct positive integers. Your task is to identify all the numbers that fall within the range of the smallest a...
Identify missing numbers within the range of smallest and largest elements in an array.
Find the smallest and largest elements in the array.
Generate a list of numbers within this range.
Filter out the numbers present in the array.
Return the missing numbers in sorted order.
Given a binary tree, your task is to count and return the number of leaf nodes present in it.
A binary tree is a data structure where each node has at most two children,...
Count and return the number of leaf nodes in a binary tree.
Traverse the binary tree and count nodes with both left and right children as NULL.
Use recursion to traverse the tree efficiently.
Leaf nodes have no children, so check for NULL left and right children to identify them.
Round duration - 20 minutes
Round difficulty - Medium
It was a system design round.
OLA app system design involves multiple components like user interface, driver matching algorithm, payment processing, etc.
User interface for booking rides and tracking
Driver matching algorithm based on location and availability
Payment processing for seamless transactions
Real-time tracking of rides for both users and drivers
Round duration - 45 minutes
Round difficulty - Medium
It was a DS Algo round.
Given a binary tree, your task is to determine the diagonal traversal of the tree.
1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1
...
Diagonal traversal of a binary tree involves traversing nodes diagonally from top to bottom and left to right.
Traverse the tree level by level, starting from the root node.
For each level, keep track of the diagonal nodes and their children.
Use a queue to store nodes at each level and traverse them accordingly.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the diagonal traversal is 1 3 6 2 5 4 7.
You are required to determine the minimum number of taps that need to be opened to water an entire one-dimensional garden defined along the x-axis,...
Find the minimum number of taps to water an entire garden along the x-axis.
Iterate over the taps and find the farthest point each tap can reach.
Sort the taps based on their starting points and use a greedy approach to select the taps.
Keep track of the farthest point reachable by the selected taps and the number of taps opened.
Return the minimum number of taps needed to water the entire garden or -1 if it's impossible.
Round duration - 15 minutes
Round difficulty - Medium
HR Round
Tip 1 : Go through standard problems
Tip 2 : You should know about everything you have written on your resume
Tip 1 : Keep it short not more than 1 page.
Tip 2 : Write more about figures and technicality on your resume.
I got to participate in a robotics competition at IIT
Designed and built a robot from scratch
Programmed the robot to complete tasks autonomously
Competed against other teams from different colleges
Learned valuable skills in engineering and teamwork
I chose IIT for its reputation and opportunities. No regrets. The environment is competitive and challenging.
IIT has a strong reputation for producing successful graduates
I was attracted to the opportunities for research and innovation
The academic environment is highly competitive and challenging
I have no regrets about my decision to attend IIT
A portfolio is a collection of investments. Risk can be measured through standard deviation, beta, or value at risk.
A portfolio is a combination of different investments such as stocks, bonds, and mutual funds.
The purpose of a portfolio is to diversify investments and reduce risk.
Risk can be measured through standard deviation, which measures the volatility of returns.
Beta measures the sensitivity of a portfolio to mar...
Beta is a measure of a stock's volatility. Value at risk is a statistical measure of potential losses. Formula for beta is Covariance(Stock, Market) / Variance(Market).
Beta measures a stock's sensitivity to market movements.
Value at risk is the maximum potential loss that an investment portfolio may suffer within a given time frame.
Beta formula is calculated by dividing the covariance of the stock and market returns by...
Covariance measures the relationship between two variables. It measures sensitivity by indicating the direction of the relationship.
Covariance is a statistical measure that shows how two variables are related to each other.
It measures the direction of the relationship between two variables.
A positive covariance indicates that the two variables move in the same direction.
A negative covariance indicates that the two vari...
WACC is the weighted average cost of capital. To value a company, one can use various methods such as DCF, comparables, or precedent transactions. A method to decide on project undertaking is NPV analysis.
WACC is the average cost of all the capital a company has raised
To value a company, one can use DCF, comparables, or precedent transactions
DCF involves projecting future cash flows and discounting them back to present...
I appeared for an interview before Dec 2020.
Round duration - 120 minutes
Round difficulty - Medium
This was a 2 hour round consisting of 5 mcqs and 2 codes. The mcqs were pretty much simple based on DS, DBMS, OS, OOP, and C.
Consider 'n' carrots numbered from 1 to 'n' and 'k' rabbits. Each rabbit jumps to carrots only at multiples of its respective jumping factor Aj (i.e., Aj, 2Aj, 3Aj, ...), for all ra...
Calculate uneaten carrots by rabbits with specific jumping factors.
Iterate through each carrot and check if any rabbit jumps on it.
Use the jumping factors to determine which carrots are eaten.
Subtract the eaten carrots from the total to get the uneaten count.
Given an array of integers ARR
of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.
Consider flipping a sub-array from index i to j by changing 0s to 1s and vice versa.
Update the maximum count of 1s if the current count after flipping is greater.
Return the maximum count of 1s obtained by flipping a sub-array
Round duration - 60 minutes
Round difficulty - Medium
Started with a brief discussion on my projects and internships. A thorough discussion on whichever languages, frameworks I had used in my projects. Followed by discussion on coding questions. Apart from the codes there were some questions on OS, process stack, heap memory in Java, Garbage collection, OOP principles and comparison based sorting
Given an array ARR
of size N
, your objective is to determine the sum of the largest and smallest elements within the array.
Can you achie...
Find sum of maximum and minimum elements in an array with least number of comparisons.
Iterate through the array and compare each element with current maximum and minimum to update them.
Initialize max as smallest possible value and min as largest possible value.
Return the sum of max and min after iterating through the array.
Given a Binary Tree and one of its leaf nodes, invert the binary tree by following these guidelines:
• The given leaf node becomes the root after the inversion. • F...
Invert a binary tree based on a given leaf node as the root.
Start by finding the leaf node in the binary tree.
Move the left child of the leaf node to the right side of the leaf node.
Make the parent of the leaf node the left child of the leaf node.
Repeat the process for each test case.
Return the inverted binary tree in level order format.
Round duration - 60 minutes
Round difficulty - Medium
Questions based on programming, DBMS and puzzles were asked in this round.
Given an array ARR
consisting of non-negative integers, rearrange the numbers to form the largest possible number. The digits within each number cannot be changed.
Rearrange the array elements to form the largest possible number by concatenating them.
Sort the array elements in a custom way where the concatenation of two numbers results in a larger number.
Use a custom comparator function while sorting the array elements.
Convert the sorted array elements to a single string to get the largest possible number.
Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.
Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.
They work similar to the index in a book, allowing the database to quickly find the relevant data without having to scan the entire table.
Examples of indexes include ...
B+ Trees are advantageous in database management systems due to their ability to efficiently store and retrieve data.
B+ Trees have a high fanout, allowing for more keys to be stored in each node, reducing the height of the tree and improving search performance.
B+ Trees are balanced trees, ensuring that operations like search, insertion, and deletion have a predictable time complexity of O(log n).
B+ Trees are optimized ...
Round duration - 45 minutes
Round difficulty - Medium
Puzzles and HR based questions were asked in this round.
He asked questions like : what are my career goals, what do you look forward to in a boss , how do you see yourself in 5 years ,etc etc .
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
The duration of Omnicell interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 7 interviews
Interview experience
based on 22 reviews
Rating in categories
Software Engineer2
7
salaries
| ₹13.5 L/yr - ₹28 L/yr |
Software Engineer III
6
salaries
| ₹26.8 L/yr - ₹37 L/yr |
Software Engineer
5
salaries
| ₹9 L/yr - ₹10.5 L/yr |
Software Developer
4
salaries
| ₹8 L/yr - ₹27 L/yr |
Software Engineer II
4
salaries
| ₹18.6 L/yr - ₹27 L/yr |
Udaan
BigBasket
Swiggy
CARS24