Filter interviews by
Top trending discussions
I appeared for an interview before Nov 2020.
Round duration - 150 Minutes
Round difficulty - Medium
Have to attempt 2 programming questions within 2:30 hours. Can take any time over the weekend. Relatively easy problems. Questions were long, but the solution code was small.
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.
Iterate through the buildings and create a list of critical points (x, y) where the height changes.
Sort the critical points based on x-coordinate and process them to generate the skyline.
Merge consecutive horizontal segments of equal height to ensure no duplicates in the output.
You are given a Singly Linked List of integers. Your task is to sort the list using the 'Merge Sort' algorithm.
The input consists of a single line contain...
Sort a Singly Linked List using Merge Sort algorithm.
Implement the Merge Sort algorithm for linked lists.
Divide the list into two halves, sort each half recursively, then merge them.
Use a fast and slow pointer to find the middle of the list for splitting.
Handle the base case of a single node or empty list.
Example: Input: 4 3 2 1 -1, Output: 1 2 3 4
Round duration - 240 Minutes
Round difficulty - Medium
Had to solve 1 programming question in 4 hours. It was in the morning on a weekend. The environment was not so good. It was a small institute and got very crowded. The platform was also buggy. but the question was not difficult. Was able to solve it in just 1 hour and leave.
Alex has acquired a machine that can photocopy photos in batches of a minimum size 'K'. Given 'N' photos with resolutions represented in an integer array photos
, the machine prod...
Minimize maximum error by splitting photos into batches of size at least 'K'.
Sort the array of resolutions in ascending order.
Iterate through the array and calculate the error for each possible batch.
Return the minimum possible maximum error found.
Round duration - 30 Minutes
Round difficulty - Easy
It was in the afternoon. The interviewer basically asked me what technologies I have worked on. Checked my knowledge of those technologies with simple questions. Told me what I'll be working on if I get selected.
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.
Maintain left pointer for 0s, right pointer for 2s, and current pointer for traversal.
Example: If current element is 0, swap it with element at left pointer and increment both pointers.
E...
Round duration - 90 Minutes
Round difficulty - Hard
It was also in the afternoon. The interviewer was the member of the team I'll be working on if I get selected. He asked me some basic questions about related technologies.
Gave me 2-3 DS & Algo problems and asked me to solve them.
Calculate the sum of all elements in an array of length N
.
Line 1: An integer N indicating the size of the array.
Line 2: N integers, the elements of the array, separated by ...
Calculate the sum of all elements in an array of length N.
Iterate through the array and add each element to a running sum.
Return the final sum as the output.
An alien dropped its dictionary while visiting Earth. The Ninja wants to determine the order of characters used in the alien language, based on the given list of wor...
Determine the order of characters in an alien language based on a list of words.
Create a graph where each character is a node and there is a directed edge from character 'a' to character 'b' if 'a' comes before 'b' in any word.
Perform a topological sort on the graph to get the order of characters.
Return the order as a string in lexicographical order.
Tip 1 : It's a Daily process. Not weekly, Not monthly. DAILY!
Tip 2 : Take part in Online Contests. HackerEarth is best for Contests posted by companies.
Tip 3 : Even after you have solved some problem, try to find a better solution for it online. Companies don't want a solution, they want optimized solution.
Tip 1 : Modify resume for each job you are applying for. It should show why you are suitable for that particular job.
Tip 2 : Remove any extra things like interests and hobbies. No one cares.
I appeared for an interview in Jun 2016.
I applied via Campus Placement and was interviewed in Jan 2024. There were 3 interview rounds.
Basic aptitude train, time and work distance
I'm a passionate software developer with a strong background in full-stack development and a love for problem-solving.
Education: Bachelor's degree in Computer Science from XYZ University.
Experience: 3 years of experience in developing web applications using React and Node.js.
Projects: Developed an e-commerce platform that increased sales by 30% within the first quarter.
Skills: Proficient in JavaScript, Python, and SQL,...
I bring a unique blend of technical skills, problem-solving abilities, and a passion for innovation that can drive your projects forward.
Proven experience in full-stack development, having successfully built and deployed multiple web applications using React and Node.js.
Strong problem-solving skills demonstrated through optimizing an existing application, resulting in a 30% increase in performance.
Excellent teamwork an...
I applied via Approached by Company and was interviewed in Sep 2022. There were 3 interview rounds.
Basic oops concepts and .net core DI related questions
Angular intermediate level questions and .net coding on screen for questions like creating an Oauth syntax
I applied via Campus Placement and was interviewed in Feb 2024. There were 2 interview rounds.
Logical reasoning, quantitative
Recursion is a programming technique where a function calls itself in order to solve a problem.
Recursion involves breaking down a problem into smaller subproblems and solving them recursively.
It requires a base case to stop the recursive calls.
Examples include factorial calculation, Fibonacci sequence generation, and tree traversal.
I applied via Campus Placement and was interviewed in Nov 2023. There were 3 interview rounds.
2 medium level questions
I am comfortable with the company's policies and appreciate their role in fostering a positive work environment.
I have reviewed the employee handbook and understand the expectations regarding conduct and performance.
I appreciate the emphasis on work-life balance, which aligns with my values.
The company's commitment to diversity and inclusion resonates with my personal beliefs.
I am familiar with the policies on remote w...
I applied via Naukri.com and was interviewed in Jan 2023. There were 4 interview rounds.
Data structures, linq and .net core related questions
I appeared for an interview before Jun 2024, where I was asked the following questions.
Prototypal inheritance allows objects to inherit properties and methods from other objects in JavaScript.
In JavaScript, every object has a prototype, which is another object from which it can inherit properties.
You can set an object's prototype using Object.create() or by setting the __proto__ property.
Example: const animal = { sound: 'roar' }; const lion = Object.create(animal); console.log(lion.sound); // 'roar'
Proto...
based on 1 interview experience
Senior Software Engineer
12
salaries
| ₹14.8 L/yr - ₹21.3 L/yr |
Software Engineer
10
salaries
| ₹7 L/yr - ₹8.7 L/yr |
Business Finance Manager
6
salaries
| ₹27 L/yr - ₹43.3 L/yr |
Senior QA Automation Engineer
6
salaries
| ₹18.2 L/yr - ₹20 L/yr |
BI Developer
5
salaries
| ₹10.6 L/yr - ₹11.5 L/yr |
OPPO
LG Electronics
Daikin
Sony