Dell
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Campus Placement and was interviewed in Jul 2022. There were 2 interview rounds.
Cs subjects regarding OS, C, DBMS
Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time.
Start with the second element and compare it with the first element, swap if necessary
Move to the third element and compare it with the second and first element, swap if necessary
Continue this process until the entire array is sorted
Time complexity: O(n^2)
Example: ['banana', 'apple', 'orange', 'grape'] -> ['apple', 'banan...
Implementing a tree data structure using code
Define a Node class with left and right child pointers
Implement insert, search, and delete functions
Traversal methods: inorder, preorder, postorder
Examples: binary search tree, AVL tree, red-black tree
I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.
I appeared for an interview before May 2021.
Round duration - 60 minutes
Round difficulty - Medium
Functional relations in DBMS define a relationship between input and output values where each input has a unique output.
Functional relations ensure that each input value maps to only one output value.
They are commonly used in database design to enforce data integrity and consistency.
For example, in a table storing employee information, the employee ID can be a functional key that uniquely identifies each employee.
Round duration - 40 minutes
Round difficulty - Hard
Questions related to Web development and machine learning
The question is related to Web development and machine learning.
Web development involves creating websites and web applications using languages like HTML, CSS, and JavaScript.
Machine learning is a subset of artificial intelligence that involves building models to make predictions based on data.
Examples of web development frameworks include React, Angular, and Vue.js.
Examples of machine learning algorithms include linea...
Round duration - 20 minutes
Round difficulty - Medium
Tip 1 : Have clear understanding of fundamental concepts.
Tip 2 : Have a skill of explaining your thoughts as clearly as possible.
Tip 3 : Practice RDBMS and OS concepts.
Tip 1 : Mention about the projects you've done with detail
Tip 2 : Have deep knowledge about everything mentioned on your resume.
Top trending discussions
I applied via Internshala
Nlp discussion around the nlp q and ans
I applied via Walk-in and was interviewed in May 2022. There were 3 interview rounds.
Basic coding round with 3 CP based questions
Namespace in C++ is used to avoid naming conflicts and organize code.
Namespace allows grouping of related functions, classes, and variables.
It helps in avoiding naming conflicts by providing a unique identifier to each entity.
Namespace can be nested within another namespace.
Using namespace keyword, we can access the entities within a namespace.
Example: namespace std { class string {}; }
Example: using namespace std; str...
The expression would increment the value of i twice before using it in the operation.
The value of i would be incremented by 2 before being used in the operation.
This is equivalent to writing i = i + 2; followed by the operation using the new value of i.
For example, if i was initially 3, the expression would evaluate to 6.
Coding test which was difficult (Hard Leetcode)
I applied via Naukri.com and was interviewed before Oct 2022. There were 3 interview rounds.
It was of 3 hours and they have their own software for this.
I applied via Job Portal
2 Coding quesiton were asked based on dsa
I appeared for an interview before Sep 2020.
Round duration - 180 Minutes
Round difficulty - Medium
Round was held in the morning at 10 am.
Given an undirected graph with 'N' nodes in the form of an adjacency matrix and an integer 'M', determine if it is possible to color the vertices of the graph using at most ...
The problem involves determining if a given graph can be colored with at most 'M' colors without adjacent vertices sharing the same color.
Create a function that takes the adjacency matrix, number of nodes 'N', and maximum number of colors 'M' as input.
Implement a graph coloring algorithm such as backtracking or greedy coloring to check if the graph can be colored with at most 'M' colors.
Check if adjacent vertices have ...
Round duration - 40 Minutes
Round difficulty - Medium
The round was held in the evening
Design and implement a Trie (prefix tree) to perform the following operations:
insert(word)
: Add a string "word" to the Trie.search(word)
: Verify if the string "w...Implement a Trie data structure to insert, search, and check for prefixes in strings.
Create a TrieNode class with children and isEndOfWord attributes.
Implement insert, search, and startsWith methods in the Trie class.
Use a Trie to efficiently store and search for strings based on prefixes.
Example: insert 'apple', search 'apple' returns true, startsWith 'app' returns true, search 'app' returns false.
Round duration - 10 Minutes
Round difficulty - Easy
Was held in the morning around 9 am
Tip 1 : Focus on graphs, most questions are from this topic
Tip 2 : Prepare well about the projects you mention in your resume
Tip 3 : Do not fill the resume with too many things. Keep it simple
Tip 1 : Have 2-3 projects on resume. But also be prepared to answer questions related to the projects.
Tip 2 : Do not mention too many things. Keep it short and simple
I appeared for an interview before Jan 2021.
Round duration - 120 Minutes
Round difficulty - Medium
The round had 2 coding problems to solve with varying difficulty. Each candidate had a different set of questions. The round was around 2 pm. The webcam was turned on to keep an eye on candidates.
Given an array ARR
of size N
, where each element represents the height of a balloon. The task is to destroy all balloons by shooting arrows from left to right. When an arrow hits...
Count the number of leaf nodes present in a given binary tree. A binary tree is a data structure where each node has at most two children, known as the left child and the...
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 questions related to DSA. I was first asked to explain my approach with proper complexity analysis and then code the soution in any IDE that I prefer.
Given a rod of a certain length, the rod can be divided into different sizes, each with an associated cost. Your task is to determine the maximum cost that can be obtained by...
The Rod Cutting Problem involves maximizing the profit obtained by cutting a rod into smaller pieces and selling them.
Use dynamic programming to solve this problem efficiently.
Create a table to store the maximum profit for each sub-length of the rod.
Iterate through the rod lengths and update the table with the maximum profit.
The final answer will be the maximum profit for the total length of the rod.
You are given an array of integers ARR
and an integer X
. Your task is to determine the number of subarrays of ARR
whose bitwise XOR is equal to X
.
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
A...
Round duration - 50 Minutes
Round difficulty - Medium
This round had 2 Algorithmic questions wherein I was supposed to code both the problems after discussing their
approaches and respective time and space complexities . After that , I was grilled on some OOPS concepts related to C++.
You are provided with a string STR
of length N. The task is to find the longest palindromic substring within STR
. If there are several palindromic substring...
You are provided with an array of integers. The task is to sort the array in ascending order using the quick sort algorithm.
Quick sort is a divide-and-conquer algorithm. It ...
Friend functions in C++ are functions that are not members of a class but have access to its private and protected members.
Friend functions are declared inside a class with the keyword 'friend'.
They can access private and protected members of the class.
They are not member functions of the class, but have the same access rights as member functions.
Friend functions are useful for implementing operators that are not part ...
Early binding is resolved at compile time while late binding is resolved at runtime in C++.
Early binding is also known as static binding, where the function call is resolved at compile time based on the type of the object.
Late binding is also known as dynamic binding, where the function call is resolved at runtime based on the actual type of the object.
Early binding is faster as the function call is directly linked to ...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 1 interview experience
Senior Software Engineer
2k
salaries
| ₹18.3 L/yr - ₹32.1 L/yr |
Principal Software Engineer
1.2k
salaries
| ₹28 L/yr - ₹52 L/yr |
Software Engineer
1.1k
salaries
| ₹9 L/yr - ₹15 L/yr |
Software Engineer2
995
salaries
| ₹12.8 L/yr - ₹22 L/yr |
Senior Analyst
537
salaries
| ₹10.6 L/yr - ₹18.7 L/yr |
Samsung
vivo
OPPO
LG Electronics