Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Dell Technologies interview experience Real time questions & tips from candidates to crack your interview

Graduate intern

Dell Technologies
upvote
share-icon
3 rounds | 9 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2 months
Topics: Data structures & Algorithms, C, Java, Python coding questions in arrays, strings, etc, Operating systems, Computer architecture
Tip
Tip

Tip 1 : Practice dynamic programming coding questions
Tip 2 : Be strong on data structures
Tip 3 : Make sure to know all the basics and fundamentals of CS subjects like operating system, compiler design(linker, loader etc.,)

Application process
Where: Campus
Eligibility: 8.5 CGPA
Resume Tip
Resume tip

Tip 1 : Include more projects if you have done it will add weightage 
Tip 2 : Important sections in resume are projects and skill set. Make sure to put them only when you are confident. 
Tip 3 : Try to prepare a short and crisp resume

Interview rounds

01
Round
Medium
Video Call
Duration50 minutes
Interview date20 Apr 2022
Coding problem6

1. Implement Stack With Linked List

Moderate
30m average time
73% success
0/80
Asked in companies
AmazonMathworksCisco

You must implement the Stack data structure using a Singly Linked List.


Create a class named 'Stack' which supports the following operations(all in O(1) time):


getSize: Returns an integer. Gets the current size of the stack

isEmpty: Returns a boolean. Gets whether the stack is empty

push: Returns nothing. Accepts an integer. Puts that integer at the top of the stack

pop: Returns nothing. Removes the top element of the stack. It does nothing if the stack is empty.

getTop: Returns an integer. Gets the top element of the stack. Returns -1 if the stack is empty
Problem approach

It was easy to do this
Implemented using struct node. 
Based on stack or queue performed operation of push pop or add delete element

Try solving now

2. Implement a Queue

Easy
20m average time
80% success
0/40
Asked in companies
MicrosoftDell TechnologiesPaytm (One97 Communications Limited)

Implement a Queue Data Structure specifically to store integer data using a Singly Linked List or an array.

You need to implement the following public functions :

1. Constructor: It initializes the data members as required.

2. enqueue(data): This function should take one argument of type integer. It enqueues the element into the queue.

3. dequeue(): It dequeues/removes the element from the front of the queue and in turn, returns the element being dequeued or removed. In case the queue is empty, it returns -1.

4. front(): It returns the element being kept at the front of the queue. In case the queue is empty, it returns -1.

5. isEmpty(): It returns a boolean value indicating whether the queue is empty or not.
Operations Performed on the Queue :
Query-1(Denoted by an integer 1): Enqueues integer data to the queue.

Query-2(Denoted by an integer 2): Dequeues the data kept at the front of the queue and returns it to the caller, return -1 if no element is present in the queue.

Query-3(Denoted by an integer 3): Fetches and returns the data being kept at the front of the queue but doesn't remove it, unlike the dequeue function, return -1 if no element is present in the queue.

Query-4(Denoted by an integer 4): Returns a boolean value denoting whether the queue is empty or not.
Problem approach

It was easy to do this Implemented using struct node. Based on stack or queue performed operation of push pop or add delete element

Try solving now

3. Swap Nodes in Pairs

Moderate
40m average time
60% success
0/80
Asked in companies
Dell TechnologiesWalmartOLX Group

You are given a singly linked list of integers.

Your task is to swap every two adjacent nodes, and return the head of the modified, linked list.

For Example:

We have a linked list 1->2->3->4->5->6->7 and so on. You are supposed to swap pairs of a linked list like swap (1,2), (3,4), (5,6), and so on.
Note:
1. You may not modify the data in the list’s nodes; only nodes themselves may be changed. Because imagine a case where a node contains many fields, so there will be too much unnecessary swap.

2. If a pair of a node does not exist, then leave the node as it is.
Problem approach

In case of swap, I have taken 2 pointers, next will be traversing the list to search for data, prev will be point just before the next pointer. (Both will be traversing but oreg will be one node behind) 
If data matches, swap next and prev and reorder the links

Try solving now

4. Delete Node In A Linked List

Easy
15m average time
80% success
0/40
Asked in companies
AdobeCIS - Cyber InfrastructureDell Technologies

You are given a Singly Linked List of integers and a reference to the node to be deleted. Every node of the Linked List has a unique value written on it. Your task is to delete that node from the linked list.

A singly linked list is a linear data structure in which we can traverse only in one direction i.e. from Head to Tail. It consists of several nodes where each node contains some data and a reference to the next node.

Note:

• The reference to the head of the linked list is not given.
• The node to be deleted is not a tail node.
• The value of each node in the Linked List is unique.
• It is guaranteed that the node to be deleted is present in the linked list.

A sample Linked List-

singly_linkedlist

Try solving now

5. Swap Number Without Temporary Variable

Easy
15m average time
85% success
0/40
Asked in companies
CiscoDell TechnologiesMicrosoft

Given two variables ‘X’ and ‘Y’. Your task is to swap the number without using a temporary variable or third variable.

Swap means the value of ‘X’ and ‘Y’ must be interchanged. Take an example ‘X’ is 10 and ‘Y’ is 20 so your function must return ‘X’ as a 20 and ‘Y’ as a 10.

Problem approach

a, b

a= a+b
b= a-b
a= a-b

Try solving now

6. DBMS

Given 3 tables and a problem statement on how to get the data

1. Used inner join and where conditions to get the data
2. For another question, used group by and sum, count functions ( this question is based on how to get the Ntg highest salary)

Problem approach

Tip 1 : Thorough with ER relationships like association etc
Tip 2 : Strong on SQL querying

02
Round
Medium
Video Call
Duration40 minutes
Interview date20 Apr 2021
Coding problem2

It was managerial round. 

They were testing both my technical skills and behavioural skills

1. Project Related

  • Explain your projects
  • Which method and logics were used?
  • What are the improvements you want to make if you are given a chance?
  • How you did the analysis
Problem approach

Tip 1 : Casual discussion with manager
Tip 2 : Ask questions about the role and company and their experience

2. Academic Questions

  • What were your post graduation subjects?
  • What technologies you learnt during your post graduation?
  • Which subject of your post graduation do you liked the most? Why?
Problem approach

Tip 1 : Focus on your core academics subjects
Tip 2 : Don't ignore the college lectures

03
Round
Easy
HR Round
Duration40 minutes
Interview date20 Apr 2021
Coding problem1

It was a HR round which was basically focused on personality and character

1. Basic HR Questions

  • Tell me about yourself
  • Why do you want to join Dell?
  • What do you like most about Dell?
  • What is your expected joining date and stipend?
Problem approach

Tip 1 : Research more about the company
Tip 2 : Note some points on recent products released of that company
Tip 3 : Note some points about the performance and any awards or recognition received by company

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is inheritance in C++?

Choose another skill to practice
Start a Discussion
Similar interview experiences
SRE
2 rounds | 3 problems
Interviewed by Dell Technologies
0 views
2 comments
0 upvotes
Software Engineer
3 rounds | 4 problems
Interviewed by Dell Technologies
1677 views
0 comments
0 upvotes
SDE - 1
3 rounds | 4 problems
Interviewed by Dell Technologies
918 views
0 comments
0 upvotes
Senior Software Engineer
3 rounds | 3 problems
Interviewed by Dell Technologies
388 views
0 comments
0 upvotes