Filter interviews by
Be the first one to contribute and help others!
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 Naukri.com
A program to find a palindrome word in a 2D matrix of strings.
Iterate through each row and column of the matrix
Check if each string is a palindrome using two pointers approach
Return the first palindrome word found
I applied via Naukri.com and was interviewed before Jan 2021. There was 1 interview round.
I am a detail-oriented business analyst with strong analytical skills and experience in data analysis and project management.
Experienced in conducting market research and identifying business opportunities
Skilled in data analysis and visualization using tools like Excel and Tableau
Proficient in project management methodologies like Agile and Waterfall
Strong communication and interpersonal skills for effective collabora...
I appeared for an interview before Sep 2020.
Round duration - 120 Minutes
Round difficulty - Easy
The round was conducted in day around 3PM.
Given an array ARR
consisting of 'N' positive integers, determine if it is possible to partition the array into two subsets such that the sum of the elements in both sub...
The problem is to determine if it is possible to partition an array into two subsets with equal sum.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the results of subproblems.
Check if the sum of the array is even before attempting to partition it.
Iterate through the array and update the 2D array based on the sum of subsets.
Return true if a subset with half the sum is found, false ot
Round duration - 30 Minutes
Round difficulty - Easy
The interview was preponed and was conducted at 9AM.
The interviewer was friendly and I had saw him earlier at pre-placement talk.
Given a string STR
, your task is to remove spaces from STR
and convert it to Pascal case format. The function should return the modified STR
.
In Pascal case, words are con...
Convert a given string to Pascal case format by removing spaces and capitalizing the first letter of each word.
Iterate through each character in the string
If the character is a space, skip it
If the character is not a space and the previous character is a space or it is the first character, capitalize it
SQL query to retrieve the Nth highest salary from a database
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT clause to retrieve the Nth highest salary
Consider handling cases where there might be ties for the Nth highest salary
Round duration - 30 Minutes
Round difficulty - Easy
This round was conducted 15mins after 1st round.
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...
Remove the Kth node from the end of a singly linked list.
Traverse the list to find the length 'N'.
Calculate the position of the node to be removed from the beginning as 'N - K + 1'.
Remove the node at the calculated position.
Handle edge cases like removing the head or tail of the list.
Update the pointers accordingly after removal.
Tip 1 : Do Competitive Coding
Tip 2 : Learn at least 1 framework
Tip 3 : Build interest in computers
Tip 1 : Be well informed of everything you mention in your resume
Tip 2 : Mention competitive coding achivements in your resume(if any)
I applied via Approached by Company and was interviewed before Aug 2021. There was 1 interview round.
Abstract class can have implementation while interface cannot. Classes can implement multiple interfaces but only one abstract class.
Abstract class can have constructors while interface cannot.
Abstract class can have non-abstract methods while interface cannot.
Interfaces are used for full abstraction while abstract classes are used for partial abstraction.
Example: Abstract class - Animal with method eat() and subclass ...
I applied via Company Website and was interviewed in Dec 2020. There was 1 interview round.
I applied via Company Website and was interviewed in Nov 2020. There was 1 interview round.
I applied via Naukri.com and was interviewed in Jan 2021. There were 3 interview rounds.
Senior Software Engineer
9
salaries
| ₹40 L/yr - ₹46.7 L/yr |
Softwaretest Engineer
8
salaries
| ₹25 L/yr - ₹28 L/yr |
Senior UX Designer
5
salaries
| ₹40 L/yr - ₹41 L/yr |
Payroll Specialist
4
salaries
| ₹11.1 L/yr - ₹11.1 L/yr |
Software Engineer
3
salaries
| ₹12 L/yr - ₹35 L/yr |
Oracle
Amdocs
Global Edge Software
Prometric Testing