Filter interviews by
I appeared for an interview before Jun 2022.
Linear logic troubleshooting involves systematically identifying and resolving print issues.
Start by checking the printer settings and ensuring they are correct.
Verify that the printer has enough paper and ink/toner.
Check for any error messages on the printer display or computer.
Inspect the print queue to see if there are any pending print jobs causing the issue.
Try printing a test page to isolate the problem.
If the is...
Top trending discussions
I applied via Campus Placement and was interviewed in May 2020. There were 6 interview rounds.
Computer networking is the practice of connecting devices together to share resources and communicate with each other.
Computer networking involves the use of hardware and software to connect devices together, such as computers, printers, and servers.
Networking protocols, such as TCP/IP, are used to facilitate communication between devices.
Examples of computer networks include local area networks (LANs), wide area netwo...
I applied via Recruitment Consulltant and was interviewed before Feb 2021. There were 2 interview rounds.
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 Referral and was interviewed before Jan 2021. There were 5 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 Job Portal and was interviewed in Jun 2021. There were 3 interview rounds.
Sorts an array of strings in ascending order.
Use a sorting algorithm like bubble sort, selection sort, or merge sort.
Compare adjacent elements and swap them if they are in the wrong order.
Repeat the process until the array is sorted.
based on 1 interview
Interview experience
Consultant
90
salaries
| ₹13.5 L/yr - ₹30 L/yr |
Associate Consultant
30
salaries
| ₹8.5 L/yr - ₹20 L/yr |
Senior Consultant
23
salaries
| ₹23 L/yr - ₹45 L/yr |
Support Engineer
21
salaries
| ₹12.5 L/yr - ₹28 L/yr |
Software Developer
15
salaries
| ₹14.5 L/yr - ₹45 L/yr |
iEnergizer
Bharti Airtel
WNS
Tata Motors