Filter interviews by
I applied via Recruitment Consulltant and was interviewed before Nov 2023. There were 3 interview rounds.
Optimizing SQL queries involves using indexes, avoiding unnecessary joins, and optimizing the query structure.
Use indexes on columns frequently used in WHERE clauses
Avoid using SELECT * and only retrieve necessary columns
Minimize the use of functions in WHERE clauses
Optimize joins by using INNER JOIN instead of OUTER JOIN when possible
Consider denormalizing data for frequently accessed queries
Top trending discussions
I applied via Recruitment Consulltant and was interviewed before Feb 2021. There were 2 interview rounds.
I applied via Referral and was interviewed before Jul 2021. There was 1 interview round.
I applied via Walk-in and was interviewed before Mar 2021. There were 3 interview rounds.
Aptitude Test is very straight forward, logical, communications are tested.
I applied via Recruitment Consultant and was interviewed in Jun 2021. There was 1 interview round.
posted on 1 Aug 2020
I applied via Recruitment Consultant and was interviewed in Feb 2020. There were 3 interview rounds.
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Easy
It was a hangout video call. The interviewer asked me these questions. Tell me about yourself and 1 coding question.
Your task is to find the total count of special numbers within a range from 1 to a given integer, 'MAXVAL'. A special number is defined as a number whose digits, when rot...
Count the total number of special numbers within a given range by rotating digits 180 degrees.
Create a function to check if a number is a special number by rotating its digits.
Iterate through the range from 1 to MAXVAL and count the special numbers.
Handle the digit rotation mapping for 0, 1, 6, 8, 9.
Return the count of special numbers for each test case.
Round duration - 60 Minutes
Round difficulty - Easy
This was an On-site (Behavioural Round) interview. He asked me these questions.
Round duration - 60 Minutes
Round difficulty - Easy
This was another On-site ( DS & Algo) algorithm.
As the Government ramps up vaccination drives to combat the second wave of Covid-19, you are tasked with helping plan an effective vaccination schedule. Your goal is...
Given constraints, find max vaccines administered on a specific day during a vaccination drive.
Iterate through each test case and calculate the maximum number of vaccines distributed on the specified day.
Distribute vaccines evenly across days while maximizing the number on the specified day.
Ensure that the sum of vaccines administered does not exceed the maximum allowed.
Consider edge cases like when the number of days ...
Round duration - 60 Minutes
Round difficulty - Easy
Another On-site ( DS & Algo) interview.
Given an array/list representing boards, where each element denotes the length of a board, and a number ‘K’ of available painters, determine the minimum time required...
Determine the minimum time required to paint all boards with given constraints.
Use binary search to find the minimum and maximum possible time to paint all boards.
Iterate through the boards and assign them to painters based on the time constraints.
Calculate the total time taken to paint all boards with the assigned painters.
You are given an array/list CHOCOLATES
of size 'N', where each element represents the number of chocolates in a packet. Your task is to distribute these chocolates among 'M'...
Distribute chocolates among students to minimize the difference between the largest and smallest number of chocolates.
Sort the array of chocolates.
Use sliding window technique to find the minimum difference between the largest and smallest number of chocolates.
Return the minimum difference as the output.
Round duration - 60 Minutes
Round difficulty - Easy
Another On-site ( DS & Algo) interview.
You are given an array of integers and an integer K
. For each array element, you can adjust it by increasing or decreasing it by a value of K
. Your goal is to minim...
Given an array of integers and an integer K, minimize the difference between the maximum and minimum elements after adjusting each element by +/- K.
Sort the array in non-decreasing order.
For each element, calculate the difference between the current element and the next element.
Adjust the element by adding or subtracting K to minimize the difference.
Return the minimum possible difference between the maximum and minimum
Round duration - 60 minutes
Round difficulty - Easy
On-site ( DS & Algo) interview.
Google mainly focuses on logic and how you are coming with a solution. It notes down each and every small mistake. Interviewers are really very helpful. They expect clear code with an optimal approach.
Given a binary square matrix 'ARR' with 'N' rows and 'N' columns, where '0' represents water and '1' represents land.
Determine the water cell whose distanc...
Find the water cell farthest from land in a binary matrix using Manhattan distance.
Iterate through the matrix to find all land cells and water cells
Calculate the Manhattan distance of each water cell to the nearest land cell
Return the maximum distance found
Tip 1 : Participate in coding contests.
Tip 2 : Practice as many questions as you can.
Tip 3 : Do some good projects.
Tip 1 : Have some projects on your resume.
Tip 2 : Do not put false things on your resume.
I appeared for an interview before Nov 2020.
Round duration - 60 Minutes
Round difficulty - Easy
Round duration - 90 minutes
Round difficulty - Easy
You are provided with a sorted dictionary (by lexical order) in an alien language. Your task is to determine the character order of the alien language from this dictiona...
Given a sorted alien dictionary, determine the character order of the alien language.
Create a graph data structure to represent the relationships between characters based on the given dictionary.
Perform a topological sort on the graph to determine the character order of the alien language.
Return the character array obtained from the topological sort as the final output.
Preeti plans to shop for her father's birthday at a store with unlimited quantities of N different items. She has a budget that allows her to buy a maximum of K items. Hel...
Calculate the number of ways Preeti can purchase items within budget, considering distinct ways.
Use dynamic programming to calculate the number of ways to purchase items within budget
Consider different scenarios where Preeti buys different quantities of each item
Return the result modulo 10^9 + 7 to handle large answers
Round duration - 60 Minutes
Round difficulty - Easy
Basic DBMS problems.
Round duration - 30 Minutes
Round difficulty - Easy
He asked basic Database and oops questions and discussion about my projects.
Round duration - 50 Minutes
Round difficulty - Easy
It was evening. Since it was a telephonic interview so all at the home. NOthing different. About my soft skills, resume, and some basic coding stuff. Why google? Where do you see yourself in 5 years?
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...
Count the number of distinct ways to climb to the Nth stair by climbing one or two steps at a time.
Use dynamic programming to solve the problem efficiently.
The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.
Handle base cases where N=0 and N=1 separately.
Apply modulo 10^9+7 to avoid overflow in the final result.
Tip 1 : Over-communication is key
Tip 2 : Self-Advocacy and Initiative are twice as important when working virtually.
Tip 3 : Relaxed and Fresh
Tip 1 : Neat and clean. Use a professional font. Include only the most relevant information and put the most important information first. Use active language.
Tip 2 : Specific about the projects they required and your projects should be in bold.
I applied via LinkedIn and was interviewed in Nov 2020. There was 1 interview round.
I applied via Naukri.com and was interviewed in Nov 2020. There was 1 interview round.
Answering questions related to REST API, Spring MVC, Spring Boot, abstract class, and interfaces.
REST API is a set of rules for building web services. It uses HTTP methods to access resources.
Spring MVC is a framework for building web applications using the Model-View-Controller architecture.
Spring Boot is a framework for building standalone, production-grade Spring-based applications.
An abstract class is a class that ...
based on 1 interview
Interview experience
Business Development Executive
4
salaries
| ₹1 L/yr - ₹5 L/yr |
Cognizant
Teleperformance
iEnergizer
Reliance Retail