Dell India interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Dell India
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
During college, i join the internship program then got Pre-placement offer from the company. During internship I have good hands-on coding and reasoning skills and aptitude. With these skills during internship, I cracked the internal company exam and got placed as an engineer.
Application story
> First applied by on-campus > Resume screening happens > Coding and logical abilities during interview period > Give aptitude and coding test and clear all approaches > Go for HR interview
Why selected/rejected for the role?
I selected because have strong aptitude and coding practices I learn from this selection that practice mock interviews Selected because of good optimize approcahes
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, Aptitude, DBMS.
Tip
Tip

Tip 1 : Data Structure should be clear till hashmaps, graphs & DP are not asked frequently
Tip 2 : Aptitude is important
Tip 3 : Must have 1 Projects

Application process
Where: Campus
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1 : 1 Project is necessary
Tip 2 : and should be 1 Pager

Interview rounds

01
Round
Easy
Online Coding Interview
Duration60 min
Interview date22 Sep 2022
Coding problem2

Firstly, they told me to introduce myself and then asked some DBMS questions and follows by Java questions, & OOPs, and 1 basic data structure question. then some casual talks about my life.

1. OOPs Questions


What is the difference between OOP and SOP?
What is Object Oriented Programming?
What are the main features of OOPs?
What are the different types of inheritance?
What are the limitations of inheritance?
What is a superclass?
What are ‘access specifiers’?

Problem approach

Tip 1: give the proper answer with an example of real life 
Tip 2: don't try to mislead by the answer.

2. Rat In A Maze

Easy
15m average time
85% success
0/40
Asked in companies
OlaIBMGoldman Sachs

You are given a starting position for a rat which is stuck in a maze at an initial point (0, 0) (the maze can be thought of as a 2-dimensional plane). The maze would be given in the form of a square matrix of order 'N' * 'N' where the cells with value 0 represent the maze’s blocked locations while value 1 is the open/available path that the rat can take to reach its destination. The rat's destination is at ('N' - 1, 'N' - 1). Your task is to find all the possible paths that the rat can take to reach from source to destination in the maze. The possible directions that it can take to move in the maze are 'U'(up) i.e. (x, y - 1) , 'D'(down) i.e. (x, y + 1) , 'L' (left) i.e. (x - 1, y), 'R' (right) i.e. (x + 1, y).

Note:
Here, sorted paths mean that the expected output should be in alphabetical order.
For Example:
Given a square matrix of size 4*4 (i.e. here 'N' = 4):
1 0 0 0
1 1 0 0
1 1 0 0
0 1 1 1 
Expected Output:
DDRDRR DRDDRR 
i.e. Path-1: DDRDRR and Path-2: DRDDRR

The rat can reach the destination at (3, 3) from (0, 0) by two paths, i.e. DRDDRR and DDRDRR when printed in sorted order, we get DDRDRR DRDDRR.
Problem approach

step 1: Create a solution matrix, initially filled with 0’s.
step 2: Create a recursive function, which takes initial matrix, output matrix and position of rat (i, j).
step 3: if the position is out of the matrix or the position is not valid then return.
step 4: Mark the position output[i][j] as 1 and check if the current position is destination or not. If destination is reached print the output matrix and return.
step 5: Recursively call for position (i+1, j) and (i, j+1).
step 6: Unmark position (i, j), i.e output[i][j] = 0.

Try solving now
02
Round
Medium
Online Coding Test
Duration30 min
Interview date20 Dec 2022
Coding problem2

- Morning time
- Environment was good.
- No
- Interviewer was good

1. 3Sum

Moderate
15m average time
85% success
0/80
Asked in companies
IntuitSamsungGrofers

You are given an array/list ARR consisting of N integers. Your task is to find all the distinct triplets present in the array which adds up to a given number K.

An array is said to have a triplet {ARR[i], ARR[j], ARR[k]} with sum = 'K' if there exists three indices i, j and k such that i!=j, j!=k and i!=j and ARR[i] + ARR[j] + ARR[k] = 'K'.

Note:
1. You can return the list of values in any order. For example, if a valid triplet is {1, 2, -3}, then {2, -3, 1}, {-3, 2, 1} etc is also valid triplet. Also, the ordering of different triplets can be random i.e if there are more than one valid triplets, you can return them in any order.
2. The elements in the array need not be distinct.
3. If no such triplet is present in the array, then return an empty list, and the output printed for such a test case will be "-1".
Problem approach

step 1: Traverse the array from start to end. (loop counter i)
step 2: Create a HashMap or set to store unique pairs.
step 3: Run another loop from i+1 to end of the array. (loop counter j)
step 4: If there is an element in the set which is equal to x- arr[i] – arr[j], then print the triplet (arr[i], arr[j], x-arr[i]-arr[j]) and break
step 5: Insert the jth element in the set.

Try solving now

2. Check Permutation

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

You have been given two strings 'STR1' and 'STR2'. You have to check whether the two strings are anagram to each other or not.

Note:
Two strings are said to be anagram if they contain the same characters, irrespective of the order of the characters.
Example :
If 'STR1' = “listen” and 'STR2' = “silent” then the output will be 1.

Both the strings contain the same set of characters.
Problem approach

Step 1: Create count arrays of size 256 for both strings. Initialize all values in count arrays as 0.
Step 2: Iterate through every character of both strings and increment the count of characters in the corresponding count arrays.
Step 3: Compare count arrays. If both count arrays are the same, then return true else return false.

Try solving now
03
Round
Easy
HR Round
Duration30 min
Interview date3 Jan 2023
Coding problem1

- Morning time
- Environment was good.
- No
- Interviewer was good

1. Basic HR Questions

Why are you interested in this job? ...
Where do you see yourself in the next 5 years? ...
Would you like to work overtime or odd hours?
What motivated you to do your job well?
why do you want to join incedo inc even though you have 3 offers ?

Problem approach

Tip 1: show eagerness to join there company
Tip 2: Be confident

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 recursion?

Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 2 problems
Interviewed by Dell India
1143 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Dell India
0 views
1 comments
0 upvotes
SDE - 1
1 rounds | 3 problems
Interviewed by Dell India
0 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Dell India
880 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57824 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes