REACH Technologies Software Developer Intern Interview Questions and Answers

It was a 2 hour test with medium level questions

Q1. Mostly asked about CN
Add your answer
Q2. Small Linked list question
Add your answer

Q1. Bfs tree traversal
Ans. 
BFS tree traversal visits nodes level by level starting from the root.
• Start at the root node and visit its children before moving on to the next level.

• Use a queue data structure to keep track of nodes to visit next.

• BFS is often used to find the shortest path in unweighted graphs.
Answered by AI
Add your answer
Q2. Resume and core
Add your answer

There were 2 DSA medium level questions

Q1. Leetcode medium problem on hashmap
Add your answer
Q2. Binary search tree plus heap question
Add your answer

Q1. Basic HR question on why you want to work at this company
Add your answer
Q2. Technical questions on OOPS and a problem on system design
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It was basically to check my problem solving and OOPS concepts. Also , concepts related to development were asked

Q1. Alpha Pattern
Ninja loves playing with characters. So one day, he wants to arrange a few characters in the ‘N’ number of rows. The first row contains 1 character, the second row has two characters, the thi...read more
Ans. Brute force
The key here is to traverse all the lines sequentially, and for each line, we print the required character at the given index.

 
The steps are as follows:
• We define an ‘ans’ matrix to store the final pattern.
• We initialize a variable ‘k’ to 0, which will be the starting value for the pattern.
• We will iterate over all the rows, i.e., i = 0 to i = N - 1:
  • We will run a for loop starting from j = 0 with the condi...read more
Answered by CodingNinjas
Add your answer
Q2. Covid Vaccination
We are suffering from the Second wave of Covid-19. The Government is trying to increase its vaccination drives. Ninja wants to help the Government to plan an effective method to help incr...read more
Ans. Brute force
The idea is to choose a peak value at the ‘dayNumber’ th index. Then we can create the array like a mountain with the peak of the mountain being at the  ‘dayNumber’ th index. The sum of the elements of this array must be less than or equal to maxVaccines.If we find that the sum is greater, then we have chosen a high peak value, and if it is less, then it means we have chosen a smaller peak value. So we ...read more
Answered by CodingNinjas
View 1 more amswer
Q3. Treasure Hunt
Alex and Rome are playing treasure hunting. Rome has a treasure box that Alex wants to open. Rome has N keys, each of which has a unique key number. She placed the keys in boxes numbered from...read more
Ans. Brute Force
The idea here is to traverse the entire array ‘key’ linearly and find the box which contains the required key. 
The steps are as follows:
• We will initialize a variable ‘answer’ to -1.
• Iterate from i = 0 to N - 1:
  • If the current box contains the required key, then update ‘answer’ to the current index.
  • We will start from the 1st box and iteratively move to the Nth box.
• If there is no box with the required key, ...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 90 Minutes
Round difficulty - Easy

It was an HR cum Technical round taken by a senior member of the technical team

Q1. Party Over
Ninja is coming after a long party to his home, but he faces a monster while returning. Monster puts up a condition to Ninja in order to free him. The monster gives him ‘n’ strings and asks him ...read more
Ans. Brute Force
The idea is to reverse all the strings and then sort them in alphabetical order and return the sorted strings back in their original form. We can use a nested loop and compare each string with all the preceding strings to sort the strings.
 
The steps are as follows:
• Initially, input a string array “arr” containing all the strings needed to be sorted based on the last character.
• Reverse the array containing...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Mirror Diagonals
Ninja has a 2D array ‘arr’ with ‘N’ rows and each row contains ‘N’ elements. Your task is to check if the left diagonal numbers and right diagonal numbers are equal in the 2D Array.
Inpu...read more
Ans. Greedy Approach
We only need to check whether the diagonal elements are equal or not. So we can only iterate over the main diagonal elements and do the checking.
For the left diagonal, 'i' should be equal to ‘j’ and for the right diagonal, sum of 'i' and ‘j’ must be ‘N’ - 1 where 'i' is the row index and 'j' is the column index. For the left diagonal, we can use ‘i’ in place of ‘j’ as they both are the same and for the r...read more
Answered by CodingNinjas
Add your answer

40 MCQ's, 2 Coding question

Q1. Dijkastra's Algorithm
Ans. 
Dijkstra's Algorithm is a graph search algorithm that finds the shortest path between nodes in a graph.
• Dijkstra's Algorithm is used to find the shortest path from a starting node to all other nodes in a weighted graph.

• It works by maintaining a set of nodes whose shortest distance from the starting node is known.

• The algorithm iteratively selects the node with the smallest distance and updates the distances of its neighb...read more
Answered by AI
Add your answer
Q2. Snake and Ladder
Add your answer

Two easy coding problems with few mcqs

Q1. Design google contacts
Ans. 
Google Contacts is a web-based address book application.
• Users can add, edit, and delete contacts

• Contacts can be organized into groups

• Users can import and export contacts

• Contacts can be searched and filtered

• Integration with other Google services like Gmail and Calendar
Answered by AI
Add your answer
Q2. Problems related to C
Add your answer