Western Digital Software Testing Engineer 1 Interview Questions, Process, and Tips

They ask to many technical question and ask to code also

They ask for your background and thing you learnt in your past

It was 1 coding question with 10 test cases. They asked a question based on binary search. I got 3 hrs to clear that test. I went in as a campus fresher. For lateral joinees, it is a much more difficult question that you have to clear in 4hrs.

Q1. What's the best way to find majority element in an array?
Ans. 
The best way to find the majority element in an array is by using the Boyer-Moore Voting Algorithm.
• Initialize a candidate variable and a count variable.

• Iterate through the array and for each element:

• - If the count is 0, set the current element as the candidate.

• - If the current element is the same as the candidate, increment the count.

• - Otherwise, decrement the count.

• After the iteration, the candidate will be the ...read more
Answered by AI
Add your answer
Q2. Reverse a linked list in K groups.
Ans. 
Reverse a linked list in K groups
• Iterate through the linked list in groups of size K

• Reverse each group of nodes using a temporary pointer

• Connect the reversed groups to form the final reversed linked list
Answered by AI
Add your answer

1. Revere Linked List
2. Maximum water in a container

Q1. 1. ArrayList 2. Types of locaters in Appium 3. D/b UI automator1 and ui Automator 2?
Ans. 
ArrayList is a resizable array implementation in Java. Appium locators include ID, name, class name, xpath, etc. UI Automator 1 and 2 are tools for testing Android apps.
• ArrayList is a dynamic array that can grow or shrink in size. Example: ArrayList<String> list = new ArrayList<>();

• Appium locators include ID, name, class name, xpath, etc. Example: driver.findElement(By.id("elementID"));

• UI Automator 1 is a t...read more
Answered by AI
Add your answer

1. What is same for you and even for PM of US?

Coding round with medium complexity

Q1. Implementation of linkedlist
Ans. 
A linked list is a data structure where each element points to the next element in the sequence.
• Create a Node class with data and a reference to the next Node

• Initialize a LinkedList class with a head Node

• Implement methods to add, remove, search, and traverse the linked list
Answered by AI
Add your answer
Q2. Sorting algoritgms
Add your answer

Q1. General expectations
Add your answer
Q2. Role clarity discussion
Add your answer

C coding questions on bitwise concepts
DSA coding concepts

Q1. What I have fone in previous organization
Add your answer
Q2. About work and projects
Add your answer

Q1. Excel sheet cell determining logic
Add your answer
Q2. Calculate the number of complete squares inscribed in a circle
Ans. 
The number of complete squares inscribed in a circle can be calculated using a formula based on the number of sides of the square.
• The formula to calculate the number of complete squares inscribed in a circle is n*(n+1)*(2n+1)/6, where n is the number of sides of the square.

• For example, if the circle has a square with 4 sides inscribed in it, the number of complete squares would be 30 (4*(4+1)*(2*4+1)/6 = 30).
Answered by AI
Add your answer

Q1. What are my expectations from company
Add your answer
Q2. Why am I leaving previous organisation
Ans. 
Seeking new challenges and growth opportunities in a different environment.
• Desire for new challenges and growth

• Opportunity for career advancement

• Seeking a change in work environment

• Exploring new technologies or industries
Answered by AI
Add your answer