R.R. Donnelley Software Developer Interview Questions and Answers for Experienced

Online test with two section one is general aptituide and Basic cs concepts. And Second round containing the 2 dsa question with intermediate level question.

Q1. Two sorted array in asscending order give the media of two array after merging in asscending order.
Ans. 
The median of two sorted arrays merged in ascending order.
• Merge the two sorted arrays into a single sorted array.

• Find the median of the merged array.

• If the merged array has an odd length, the median is the middle element.

• If the merged array has an even length, the median is the average of the two middle elements.
Answered by AI
Add your answer
Q2. Question on resume on java script 1. whats is closure? 2. what is hoisting? cookie session.
Add your answer

Q1. Data structure and algorithm problems
Add your answer

Q1. Introduce yourself
Ans. 
I am a software engineer with 5 years of experience in developing web applications using Java, Spring Boot, and Angular.
• 5 years of experience in software development

• Proficient in Java, Spring Boot, and Angular

• Strong problem-solving skills
Answered by AI
Add your answer
Q2. DS/Ago problem - dynamic programming
Add your answer

Q1. It was all about java oops and basic questions
Add your answer

Q1. It will related to the our project and some scenario based questions
Add your answer

Q1. Salary discussion
Add your answer

It consited of apti as well as coding questions

Q1. Basic questions of coding were asked like arrays,strings
Add your answer

Q1. Prepare js array and string functions, and React js core concepts
Add your answer

It was based on frontend technologies

Q1. Basic frontend question
Add your answer

Q1. Managerial round
Add your answer

Round duration - 75 minutes
Round difficulty - Easy

This round was conducted in Hackerrank portal for a total duration of 75 minutes and was divided into 4 sections.

1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes

This Round was Conducted on Hackerrank (Webcam Enabled).

Q1. Given a problem statement and a piece of code, how would you find and correct the bug in the code?
Ans. 
To find and correct a bug in code, analyze problem statement, review code, use debugging tools, and test different scenarios.
• Understand the problem statement and expected output

• Review the code for syntax errors, logical errors, and potential bugs

• Use debugging tools like breakpoints, print statements, and IDE debuggers

• Test the code with different inputs and edge cases to identify the bug

• Make necessary corrections and re
Answered by AI
Add your answer
Q2. 
Nodes at Distance K from Target Node in Binary Tree
Given a Binary Tree of distinct integers and two integers, target and K, return a list of values of all nodes located at a distance K from the target no...read more
Ans. 
Find nodes at distance K from target node in a Binary Tree.
• Use BFS to traverse the tree and keep track of the distance of each node from the target node.

• Maintain a set to keep track of visited nodes to avoid revisiting them.

• Return the values of nodes at distance K from the target node.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM

Q1. 
Subarray Challenge: Largest Equal 0s and 1s
Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.
Input:
Input beg...read more
Ans. 
Find the length of the largest subarray with equal number of 0s and 1s in a given array.
• Iterate through the array and maintain a count of 0s and 1s encountered so far.

• Store the count difference in a hashmap with the index as key.

• If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.

• Return the length of the longest subarray found.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.