Western Digital Software Developer Intern Interview Questions and Answers

Easy to medium questions

Q1. Create a software
Ans. 
A software for managing inventory in a retail store
• Create a user-friendly interface for adding, updating, and deleting products

• Include features for tracking sales, restocking inventory, and generating reports

• Implement barcode scanning functionality for quick product lookup
Answered by AI
Add your answer

Q1. Tell me about yourself
Add your answer

Aptitude and dsa questions

Q1. Sql, Oops, dsa, API and projects were asked
Add your answer
Q2. Some sql queries
Add your answer

Q1. Normal interaction to know about me
Add your answer

Q1. Why do want to work here?
Ans. 
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...read more
Answered by AI
View 1 more answer
Q2. Tell me about yourself?
Ans. 
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
Answered by AI
Add your answer

Q1. Questions were regarding my previous internships and projects
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

This round was scheduled in the morning hours from 10:30 to 11:15 AM. I was informed about the round 2 days earlier through an e-mail and a phone call both.

Q1. 
Ninja and Candies Problem
Ninja, a boy from Ninjaland, receives 1 coin every morning from his mother. He wants to purchase exactly 'N' candies. Each candy usually costs 2 coins, but it is available for 1 ...read more
Ans. Using Linear Search
We will iterate over all possible days, which will be between 1 to 2*(sum of all K[i]). Let our current day be ‘currDay’. We will check if any valid distribution is possible for the current day.
If we had several days for some type of candies, let's use the last one, it is always not worse than some of the previous days. Then let's iterate over all days from 1 to ‘ansd’ and do the following: 
• Firs...read more
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Hard

After the first round, some candidates were shortlisted and I was one of them which was scheduled 2 days later at the same time.

Q1. 
Minimum Umbrellas Problem
You are provided with ‘N’ types of umbrellas, where each umbrella type can shelter a certain number of people. Given an array UMBRELLA that indicates the number of people each um...read more
Ans. Brute Force
Approach: The idea here is to try every possible option and consider the minimum ans.

 We have two possible options: either we use the i-th umbrella to cover people or not. 

So, the recurrence for the above problem is:
minNumberOfUmbrellas(i, M) = min(minNumberOfUmbrellas(i - 1, M), 1+ minNumberOfUmbrellas(i, M - UMBRELLA[i])).
 
minNumberOfUmbrellas(i, M) represents the minimum number of umbrellas...read more
Answered Anonymously
Add your answer
Q2. 
Lazy Santa Problem Statement
It's Christmas and Santa has 'K' gifts to distribute. There are 'N' children standing in a straight line in the park due to COVID restrictions. You are given an array distance...read more
Ans. Brute Force
We can note that it is always optimal to distribute gifts to ‘K’ children who are adjacent to each other. 
 
For example, if the position of children are [2, 4, 7] and K = 2, it is optimal to give gifts to children with positions 2 and 4. If the positions were to be [2, 5, 7], it is optimal to give gifts to children at positions 5 and 7. In general, if the positions are [p1, p2, p3] where p1 < p2 ...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was a simple conversation, no shortlisting was done here, all of the students who passed the previous round were offered the role.

Fundamental output questions and aptitude assessments.

Q1. Pattern printing Delete drop truncate difference Projects discussion
Add your answer

Q1. What motivated you to choose Dell?
Ans. 
I chose Dell for their reputation for innovation, strong company culture, and opportunities for growth.
• Reputation for innovation in technology industry

• Strong company culture focused on employee development

• Opportunities for growth and advancement within the company
Answered by AI
Add your answer
Q2. Opinion about JD.
Add your answer

Coding skills should be good

Basic c and c++ and python and networking

Round duration - 45 minutes
Round difficulty - Hard

Interview was conducted at zoom in the evening hours.

Q1. 
Max GCD Pair Problem Statement
Given an array of positive integers, determine the Greatest Common Divisor (GCD) of a pair of elements such that it is the maximum among all possible pairs in the array. The...read more
Ans. Brute force
If a number is a divisor of two or more elements then it can be the GCD of the pair formed using those elements.
 
In this method, we will iterate over all the elements in the array and find the divisors of every element. We will also maintain a count array where the index represents the divisor and the value at that index is the number of elements in the given array having this as a divisor.
 
After t...read more
Answered Anonymously
Add your answer
Q2. 
Kevin and his Fruits Problem Statement
Kevin has 'N' buckets, each consisting of a certain number of fruits. Kevin wants to eat at least 'M' fruits. He is looking to set a marker as high as possible such ...read more
Ans. Brute Force
First, we should know that the marker can’t be negative and also it will not be greater than the maximum number of fruits in a particular bucket because if this happens then Kevin are not able to eat any of these fruits.
 
 Therefore, the marker must be in the range of 0 to a maximum number of fruits in a particular bucket. So, the idea is to first calculate the maximum number of fruits in any partic...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

This round was scheduled in the morning hours from 10:30 to 11 am. The interviewer was cool-minded and I really enjoyed talking to him.