Filter interviews by
I applied via Company Website and was interviewed before Feb 2022. There were 3 interview rounds.
I want to work here because of the company's reputation, the opportunity for growth, and the chance to work on innovative projects.
Company's reputation: The company has a strong reputation in the industry for its high-quality software development work.
Opportunity for growth: I believe that working here will provide me with ample opportunities to learn and grow as a software developer.
Innovative projects: I am excited a...
I am a software development intern with a passion for coding and problem-solving.
Currently pursuing a degree in Computer Science
Proficient in programming languages such as Java, C++, and Python
Experience with web development frameworks like React and Angular
Completed several projects including a mobile app for task management
Strong problem-solving and analytical skills
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 Aug 2016.
I appeared for an interview in Oct 2016.
My hobbies include hiking, playing guitar, and cooking.
Hiking: I enjoy exploring nature trails and challenging myself physically.
Playing guitar: I love learning new songs and improving my skills.
Cooking: I like experimenting with different recipes and creating delicious meals.
In 5 years, I see myself as a senior software developer leading a team and working on complex projects.
Leading a team of developers
Working on complex projects
Continuously learning and improving my skills
Contributing to the growth and success of the company
I want to join DELL because of their innovative technology solutions and strong reputation in the industry.
DELL is known for their cutting-edge technology solutions which align with my passion for software development.
I admire DELL's strong reputation in the industry and their commitment to customer satisfaction.
I believe joining DELL will provide me with opportunities for growth and career advancement.
I appeared for an interview in Jan 2017.
I appeared for an interview in Sep 2016.
posted on 2 Dec 2016
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
I appeared for an interview in Jun 2016.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Service Engineer
85
salaries
| ₹1.5 L/yr - ₹5.8 L/yr |
Senior Accounts Manager
44
salaries
| ₹7.4 L/yr - ₹14.6 L/yr |
Major Accounts Manager
40
salaries
| ₹10 L/yr - ₹18 L/yr |
Business Manager
38
salaries
| ₹11 L/yr - ₹25 L/yr |
Assistant Manager
37
salaries
| ₹7.5 L/yr - ₹14 L/yr |
Vivo
OPPO
Dell
LG Electronics