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
Coding test which was difficult (Hard Leetcode)
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.
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 applied via Naukri.com and was interviewed before Jul 2020. There were 4 interview rounds.
I appeared for an interview before Jan 2021.
Round duration - 120 Minutes
Round difficulty - Medium
This was an online coding round where we had 3 questions to solve under 120 minutes. The questions were of medium to hard difficulty level.
Determine the minimum time required to travel from a starting point to a destination point in a two-dimensional coordinate system, considering both direct movement and the...
Find the minimum time to travel from a starting point to a destination point using direct movement and wormholes.
Calculate the time taken for direct movement from source to destination.
Consider using each wormhole to see if it reduces the total travel time.
Choose the path with the minimum total time to reach the destination.
Ninja needs help in a battle against the string man. Given two strings, 'S' and 'T', the task is to find the number of substrings in 'S' that differ from some su...
The task is to find the number of substrings in 'S' that differ from some substrings of 'T' by exactly one character.
Iterate through all substrings of 'S' and 'T' and compare them character by character to find the ones that differ by exactly one character.
Use nested loops to generate all possible substrings of 'S' and 'T'.
Count the number of substrings that differ by exactly one character and return the total count.
Determine whether a given integer N
is a power of two. Return true
if it is, otherwise return false
.
An integer 'N' is considered a power of two if it can be e...
Check if a given integer is a power of two or not.
Check if the given integer is greater than 0.
Check if the given integer has only one bit set in its binary representation.
Return true if the above conditions are met, else return false.
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 questions related to DSA where I was first expected to explain my approaches and then discuss the time and space complexities of my solution. After that , I was asked some core concepts related to OS.
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...
Reverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.
Use three pointers - prev, current, and next to reverse the linked list in O(N) time and O(1) space complexity.
Update the head of the reversed linked list as the last node encountered during reversal.
You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determi...
Detect cycles in an undirected graph.
Use Depth First Search (DFS) to detect cycles in the graph.
Maintain a visited array to keep track of visited vertices.
If a visited vertex is encountered again during DFS, a cycle exists.
Check for cycles in each connected component of the graph.
Example: For input N=3, Edges=[[1, 2], [2, 3], [1, 3]], output is Yes.
Mutex is used for exclusive access to a resource by only one thread at a time, while semaphore can allow multiple threads to access a resource simultaneously.
Mutex is binary semaphore with ownership, used for mutual exclusion.
Mutex is typically used to protect critical sections of code.
Semaphore is a signaling mechanism, used for synchronization between multiple threads.
Semaphore can have a count greater than 1, allowi...
Multitasking refers to the ability of an operating system to run multiple tasks concurrently, while multithreading involves executing multiple threads within a single process.
Multitasking allows multiple processes to run simultaneously on a single processor, switching between them quickly to give the illusion of parallel execution.
Multithreading involves breaking a process into multiple threads that can be executed ind...
Round duration - 60 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 given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
You are provided with an array nums
which contains the first N positive integers. In this array, one integer appears twice, and one integer is missi...
Given an array of first N positive integers with one number repeating and one missing, find the repeating and missing numbers.
Iterate through the array and keep track of the sum of elements and sum of squares to find the missing and repeating numbers.
Use a set to identify the repeating number and calculate the missing number based on the sum of elements.
Example: For nums = [1, 2, 3, 4, 4, 5], the repeating number is 4 ...
Diamond Problem in C++ is a common issue in multiple inheritance where a class inherits from two classes that have a common base class.
Diamond Problem occurs when a class inherits from two classes that have a common base class, leading to ambiguity in accessing members.
It can be resolved in C++ using virtual inheritance, where the common base class is inherited virtually to avoid duplicate copies of base class members.
...
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 'friend' keyword.
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 membe...
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
| ₹10.2 L/yr - ₹35.8 L/yr |
Principal Software Engineer
1.2k
salaries
| ₹19.2 L/yr - ₹58.9 L/yr |
Software Engineer
1.1k
salaries
| ₹5.1 L/yr - ₹20 L/yr |
Software Engineer2
955
salaries
| ₹8.5 L/yr - ₹24 L/yr |
Senior Analyst
598
salaries
| ₹6 L/yr - ₹21 L/yr |
Samsung
vivo
OPPO
LG Electronics