Deloitte Java Developer Interview Questions, Process, and Tips

Round duration - 60 minutes
Round difficulty - Easy

Timing( was it late night) Not late but interview conducted in the evening
How was the environment? Google meet
Any other significant activity Checked my projects my contribution my past experiences
How the interviewer was? (If it was there any interview) Interviewer was check technical knowledge and personality test

Q1. 
Sort 0 and 1 Problem Statement
Given an integer array ARR of size N containing only integers 0 and 1, implement a function to sort this array. The solution should scan the array only once without using an...read more
Ans. 
The function sorts an integer array containing only 0s and 1s in linear time complexity.
• Use two pointers, one starting from the beginning and the other from the end of the array.

• Swap the elements at the pointers if the element at the beginning pointer is 1 and the element at the end pointer is 0.

• Continue moving the pointers towards each other until they meet in the middle of the array.
Answered by AI
View 2 more answers
Q2. 
Convert BST to Greater Sum Tree
Given a Binary Search Tree (BST) of integers, your task is to convert it into a greater sum tree. In the greater sum tree, each node's value should be replaced with the sum...read more
Ans. 
The task is to convert a Binary Search Tree into a Greater Sum Tree.
• Traverse the BST in reverse inorder (right, root, left) to visit nodes in descending order.

• Keep track of the sum of all greater nodes encountered so far.

• Update the value of each node by adding the sum of greater nodes and update the sum.

• Continue this process until all nodes have been visited.

• Return the modified BST.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This round was TechnoManagerial round where both technical as well as HR questions where asked. Interviewer was very supportive and he just wanted to check your best and your problem solving skills and you personality.