Filter interviews by
I applied via Approached by Company and was interviewed in Jun 2023. There were 3 interview rounds.
I applied via Recruitment Consultant and was interviewed in Jun 2021. There were 7 interview rounds.
I expect BIO-RAD to provide opportunities for career advancement and professional development.
I hope to receive regular performance evaluations and feedback to identify areas for improvement and growth.
I would like to attend training programs and conferences to enhance my skills and knowledge.
I expect to be considered for promotions and leadership roles based on my performance and potential.
I hope to work with mentors ...
Top trending discussions
I applied via LinkedIn and was interviewed before Jul 2021. There were 2 interview rounds.
I appeared for an interview before Apr 2021.
Indexes in MySQL are used to improve query performance by allowing faster data retrieval.
Indexes are created on one or more columns of a table.
They work by creating a separate data structure that allows for faster data retrieval.
Indexes can be created using the CREATE INDEX statement.
Indexes can also be dropped using the DROP INDEX statement.
Indexes can be used to speed up SELECT, UPDATE, and DELETE statements.
Indexes ...
include_once and require_once are PHP functions used to include files. The difference is in how they handle errors.
include_once will only include the file once, and will not throw a fatal error if the file is not found
require_once will also only include the file once, but will throw a fatal error if the file is not found
Both functions are used to include files that contain functions or variables that are needed in the
Sessions and cookies are both used for maintaining user state, but sessions are server-side and cookies are client-side.
Sessions store user data on the server, while cookies store data on the client's browser
Sessions are more secure than cookies because the data is not accessible to the client
Cookies can be used for tracking user behavior and preferences
Sessions are typically used for authentication and authorization p...
To find missing number in an array of first n numbers.
Calculate the sum of first n numbers using formula n*(n+1)/2
Calculate the sum of given array using loop
Subtract the sum of array from sum of first n numbers to get the missing number
Design a database schema for a chat application with individual and group messaging.
Create a 'users' table with unique user IDs
Create a 'messages' table with message IDs, sender and receiver IDs, message content, and timestamp
Create a 'groups' table with unique group IDs and group names
Create a 'group_members' table with group ID and user ID to track group membership
Use foreign keys to link tables together
Consider inde
SQL query to retrieve all unread messages upon user sign in
Use a JOIN statement to combine the messages and user tables
Filter the results to only show messages that have not been read by the user
Use the user's sign in information to identify which messages are unread
I am excited to join OLX because of its innovative approach to online marketplaces and its commitment to customer satisfaction.
I am impressed by OLX's user-friendly platform and its ability to connect buyers and sellers from all over the world.
I am excited to work with a team of talented developers who are passionate about creating cutting-edge technology.
I believe that OLX's focus on customer satisfaction aligns with ...
I have faced difficulties in debugging complex code and managing project timelines.
Debugging complex code with multiple dependencies
Managing project timelines with changing requirements
Working with legacy code and outdated technologies
Collaborating with team members in different time zones
Dealing with unexpected bugs and errors
I report to the Technical Lead and am part of the development team.
I report to the Technical Lead
I am part of the development team
Our website receives an average of 10,000 unique visitors per day.
Our website has a steady flow of traffic with a consistent number of unique visitors per day.
We use Google Analytics to track our web traffic and analyze user behavior.
Our peak traffic times are during weekdays from 9am to 5pm.
We have noticed an increase in mobile traffic over the past year.
Our website's traffic is primarily driven by organic search and
posted on 21 Feb 2015
Quantifiable factors to rate cab drivers for company's purpose
Customer ratings and feedback
Number of completed trips
Average trip duration
Percentage of on-time pickups
Accident and traffic violation history
Vehicle cleanliness and maintenance
Driver punctuality and professionalism
The criterion for choosing between Yuvraj Singh and Stuart Binny for the World Cup squad would be based on their recent performance, fitness, and team balance.
Evaluate recent performance of both players
Assess fitness levels of both players
Consider team balance and required skill sets
Analyze pitch and weather conditions of the tournament
Take into account the opposition teams and their strengths and weaknesses
I appeared for an interview before Feb 2021.
Round duration - 60 minutes
Round difficulty - Easy
It comprised of general aptitude questions and two coding questions. It was an offline test.
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not attack each other.
Generate and print valid configurations where queens are placed safely.
Consider constraints and time limit for efficient solution.
Exam...
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.
Iterate through the array and swap elements based on the values encountered.
Achieve sorting in a single scan over the array without using any extra space.
Round duration - 60 minutes
Round difficulty - Easy
After having a technical discussion about my CV. He gave me two questions to code.
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...
Find all unique contiguous substrings of size two from a given string.
Iterate through the string and extract substrings of size two
Use a set to store unique substrings
Return the set as an array of strings
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.
If the two pointers meet at any point, there is a cycle in the linked list.
If one of the pointers reaches the end of the list (null), there is no cycle.
Round duration - 30 minutes
Round difficulty - Easy
This was supposed to be the HR round but out of surprise the interviewer started by giving me a question to code.
After I approached this question with the right solution he just asked about my family. After that he said to wait. After half an hour the results were announced. A total of three students were hired and I was amongst one of them.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
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 applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.
Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.
Iterate through the matrix and find the doors
Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door
Update the distance matrix with the minimum distances
Find kth smallest element in unordered array with O(1) space
Use the QuickSelect algorithm to partition the array and find the kth smallest element
Choose a pivot element and partition the array into two subarrays
Recursively partition the subarray that contains the kth smallest element
Repeat until the pivot element is the kth smallest element
Time complexity: O(n) average case, O(n^2) worst case
To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.
Get your list of friends
For each friend, get their list of friends
Exclude yourself and your friends from the final list of friends of friends
based on 1 interview
Interview experience
based on 54 reviews
Rating in categories
Senior Accounts Manager
11
salaries
| ₹8 L/yr - ₹20 L/yr |
Information Security Specialist
7
salaries
| ₹23 L/yr - ₹26 L/yr |
Field Service Engineer
7
salaries
| ₹4.1 L/yr - ₹12.5 L/yr |
Informatics Specialist
6
salaries
| ₹4 L/yr - ₹11 L/yr |
Senior Administration Associate
5
salaries
| ₹10.4 L/yr - ₹12.8 L/yr |
Udaan
BigBasket
Swiggy
Lenskart