Hitachi Digital Services Qa Automation Testing Engineer Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Medium

This round had 2 questions with Easy to Medium level of difficulty

Q1. 
Problem: Total Area of Overlapping Rectangles
You are given two rectangles situated on a 2-D coordinate plane, which may overlap. Your task is to compute the total area covered by these rectangles.
Input...read more
Ans. 
Calculate total area covered by two overlapping rectangles on a 2-D plane.
• Calculate the area of each rectangle separately using the given coordinates.

• Find the overlapping region by determining the intersection of the two rectangles.

• Calculate the area of the overlapping region by multiplying its width and height.

• Add the areas of the two rectangles and subtract the area of the overlapping region to get the total area cov
Answered by AI
Add your answer
Q2. 
Rearrange Array: Move Negative Numbers to the Beginning
Given an array ARR consisting of N integers, rearrange the elements such that all negative numbers are located before all positive numbers. The orde...read more
Ans. 
Yes, this can be achieved by using a two-pointer approach to rearrange the array with negative numbers at the beginning.
• Use two pointers, one starting from the beginning and one from the end of the array.

• Swap elements at the two pointers if one is negative and the other is positive, and move the pointers accordingly.

• Continue this process until the two pointers meet in the middle of the array.

• The resulting array will ha...read more
Answered by AI
Add your answer

Round duration - 70 minutes
Round difficulty - Medium

Standard DS/Algo round with 2 questions

Q1. 
Middle Node of a Linked List Problem Statement
Given the head node of a singly linked list, return a pointer to the middle node of the linked list. If there are an odd number of nodes, return the middle o...read more
Ans. 
Return the middle node of a singly linked list, considering odd and even number of nodes.
• Traverse the linked list with two pointers, one moving at twice the speed of the other

• When the faster pointer reaches the end, the slower pointer will be at the middle node

• Handle cases for odd and even number of nodes separately

• Return null if the list is empty
Answered by AI
Add your answer
Q2. 
All Prime Numbers Less Than or Equal to N
Given a positive integer N, your task is to return all the prime numbers less than or equal to N.
Note:
1) A prime number is a number that has only two factors:...read more
Ans. 
Return all prime numbers less than or equal to a given positive integer N.
• Iterate from 2 to N and check if each number is prime using a helper function.

• A number is prime if it is not divisible by any number from 2 to its square root.

• Store and return the prime numbers in an array in increasing order.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was a Technical Cum HR round where I was first asked some basic Java-related concepts and then we discussed my expectations from the company, learnings and growth in the forthcoming years. I would suggest be honest and try to communicate your thoughts properly in these types of rounds to maximise your chances of getting selected.