Yatra Refrigeration Plant Operator Interview Questions and Answers

Implement an iterator to flatten 2D vector

Q1. Find shortest path to get all keys
Ans. 
Use Dijkstra's algorithm to find the shortest path to get all keys
• Implement Dijkstra's algorithm to find the shortest path in a graph

• Consider the keys as nodes in the graph and the paths between keys as edges

• Keep track of the keys collected and update the shortest path accordingly
Answered by AI
Add your answer

45 MCQ Which includes below topics
Basic core Java
Database
Spring
Hibernate
Angular
One program based on core Java logic

Q1. Discussion about Hashmaps.
Add your answer
Q2. How to make Spring Applications?
Ans. 
Spring applications can be made using Spring Boot, which simplifies the setup and configuration process.
• Use Spring Initializr to create a new Spring Boot project

• Add dependencies in the pom.xml file for required Spring modules

• Create Java classes with annotations like @Controller, @Service, @Repository, etc.

• Define application properties in application.properties or application.yml file

• Run the application using the main m
Answered by AI
Add your answer

Q1. Discussion about Goals.
Add your answer
Q2. Discussed points from Resume
Add your answer

Custom problem was given and asked to solve and discuss solution with the interviewer

Current project discussion with panel

Q1. Behaviour questions
Add your answer

Q1. Two sum leetcode question
Add your answer

Solve sudoku, row and columns should have 1-9 numbers and the numbers shouldnt repeat

Q1. What is the toughest problem you solved and once I answered they started digging in to it
Add your answer

Q1. System Design - Design a parking lot
Ans. 
Design a parking lot system with features like parking, retrieving, and tracking available spots.
• Create a ParkingLot class with attributes like total number of spots, available spots, and a list of parked vehicles.

• Implement methods for parking a vehicle, retrieving a vehicle, and tracking available spots.

• Use data structures like arrays or lists to manage parked vehicles and available spots.

• Consider implementing feature...read more
Answered by AI
Add your answer

Q1. Several questions related to behavioral and troubleshooting
Add your answer

Q1. Given array of integer create subarray with sum = 0
Ans. 
Create subarrays with sum = 0 from given array of integers.
• Iterate through the array and keep track of the running sum.

• Store the running sum in a hashmap and check if the current sum - any previous sum equals 0.

• If yes, then the subarray between those two indices has a sum of 0.
Answered by AI
Add your answer
Q2. Left view of binary tree
Ans. 
The left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.
• Traverse the tree in a level order manner and keep track of the first node at each level.

• Use a queue to store nodes at each level and update the left view nodes accordingly.

• Example: For a binary tree with root node 1, left child 2, and right child 3, the left view would be [1, 2].
Answered by AI
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 code, how would you find and correct the bugs in the code?
Ans. 
To find and correct bugs in code, analyze problem statement, review code, use debugging tools, run test cases, and make necessary changes.
• 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 features

• Run test cases to identify the bugs and verify the corrections

• Make necessary changes to the
Answered by AI
Add your answer
Q2. 
Count Nodes within K-Distance Problem Statement
Given a connected, undirected, and acyclic graph where some nodes are marked and a positive integer 'K'. Your task is to return the count of nodes such that...read more
Ans. 
Count the number of nodes within K-distance from marked nodes in a connected, undirected, acyclic graph.
• Create a graph using the given vertices and edges.

• Perform a BFS traversal starting from each marked node to find nodes within K-distance.

• Count the nodes within K-distance from all marked nodes and return the total count.
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. 
Problem Statement: Largest Subarray with Equal Number of 0s and 1s
Given an array containing only 0s and 1s, determine the length of the longest contiguous subarray that has an equal number of 0s and 1s.
...read more
Ans. 
Find the length of the longest subarray with equal number of 0s and 1s in a given array of 0s and 1s.
• Iterate through the array and maintain a running count of the difference between the number of 0s and 1s encountered so far.

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

• If the same count is encountered again, calculate the length of the subarray between the two occurrences.

• Return the maximum length foun
Answered by AI
Add your answer
Q2. Can you explain how the file system is stored on a disk and how it works?
Ans. 
File system is stored on disk using data blocks and metadata, organized in a hierarchical structure.
• File system is stored on disk using data blocks and metadata

• Data blocks contain actual file data, while metadata stores information about files and directories

• File system is organized in a hierarchical structure with directories containing files and subdirectories

• File system uses a file allocation table (FAT) or an index
Answered by AI
Add your answer
Q3. Can you distinguish between RISC and CISC architectures?
Ans. 
RISC focuses on simplicity and efficiency, while CISC emphasizes complex instructions and flexibility.
• RISC uses a small set of simple instructions, while CISC uses a large set of complex instructions.

• RISC architectures have a uniform instruction format, while CISC architectures have variable-length instructions.

• RISC architectures rely on optimizing compilers for performance, while CISC architectures have hardware optim...read more
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.

Round duration - 180 Minutes
Round difficulty - Medium

coding questions on DSA and MCQs on java 
timing : late night 
no camera

Q1. 
Knight Probability in Chessboard
Calculate the probability that a knight remains on an N x N chessboard after making K moves. Initially, the knight is placed at a given position on the board. It can move ...read more
Ans. 
Calculate the probability that a knight remains on an N x N chessboard after making K moves.
• Use dynamic programming to calculate the probability of the knight staying on the board after each move.

• Consider all possible moves the knight can make from its current position.

• Keep track of the probabilities at each position on the board after each move.

• Normalize the probabilities at the end to get the final result.

• Example: Fo...read more
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

It was a DSA round.

Q1. 
Binary Tree to Doubly Linked List
Transform a given Binary Tree into a Doubly Linked List.
Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.
Input:
The fi...read more
Ans. 
Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.
• Perform Inorder Traversal of the Binary Tree to get the nodes in order.

• Create a Doubly Linked List by connecting the nodes in the order obtained from Inorder Traversal.

• Return the head of the Doubly Linked List as the output.
Answered by AI
Add your answer
Q2. 
Find Duplicates in an Array
Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...read more
Ans. 
Find duplicates in an array of integers within a specified range.
• Iterate through the array and keep track of the count of each element using a hashmap.

• Return elements with count greater than 1 as duplicates.

• Time complexity can be optimized to O(N) using a set to store duplicates.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

DSA Questions were asked.

Q1. 
Remove Character from String Problem Statement
Given a string str and a character 'X', develop a function to eliminate all instances of 'X' from str and return the resulting string.
Input:
The first lin...read more
Ans. 
Develop a function to remove all instances of a given character from a string.
• Iterate through the string character by character and skip the character to be removed.

• Build a new string by appending characters that are not equal to the given character.

• Return the final modified string.

• Handle edge cases like empty string or character not found in the string.
Answered by AI
Add your answer
Q2. 
String Rearrangement Problem Statement
You are given a string of lowercase characters. The objective is to rearrange (reorder) the string so that no two adjacent characters are identical.
Return the rear...read more
Ans. 
The objective is to rearrange a string so that no two adjacent characters are identical. Return the rearranged string or 'NO SOLUTION'.
• Iterate through the string and count the frequency of each character.

• Create two lists, one for characters with odd frequency and one for characters with even frequency.

• If the count of characters with odd frequency is greater than 1, return 'NO SOLUTION'.

• Alternate between characters with...read more
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

It was a behavioural round.