Travclan Technology India Technical Trainee Interview Questions, Process, and Tips

Round duration - 90 minutes
Round difficulty - Easy

This round consist of coding as well as mcq questions

Q1. 
Minimum Cost to Destination
You are given an NxM matrix consisting of '0's and '1's. A '1' signifies that the cell is accessible, whereas a '0' indicates that the cell is blocked. Your task is to compute ...read more
Ans. 
Find the minimum cost to reach a destination in a matrix with specified rules.
• Use Breadth First Search (BFS) algorithm to explore all possible paths from the starting point to the destination.

• Keep track of the cost incurred at each cell and update it as you move through the matrix.

• Return the minimum cost to reach the destination or -1 if it is unreachable.

• Consider edge cases such as when the starting point is the desti
Answered by AI
Add your answer
Q2. 
Maximum of All Subarrays of Size k
Given an array of 'N' non-negative integers and an integer 'K', your task is to find the maximum elements for each subarray of size 'K'.
Input:
The first line contains...read more
Ans. 
Find the maximum elements for each subarray of size 'K' in a given array of non-negative integers.
• Iterate through the array and maintain a deque to store the indices of elements in decreasing order.

• Pop elements from the deque if they are out of the current window of size 'K'.

• The front of the deque will always have the index of the maximum element for the current window.
Answered by AI
Add your answer

Round duration - 36 minutes
Round difficulty - Easy

Q1. 
Convert Min Heap to Max Heap Problem Statement
Given an array representation of a min-heap of size 'n', your task is to convert this array into a max-heap.
Input:
The first line of input contains an int...read more
Ans. 
Convert a given array representing a min-heap into a max-heap.
• Iterate through the array and swap parent nodes with their children to convert min-heap to max-heap.

• Maintain the heap property by comparing parent with its children and swapping if necessary.

• Ensure the final array satisfies the max-heap property where parent nodes are greater than their children.
Answered by AI
Add your answer
Q2. 
Sum Between Zeroes Problem Statement
Given a singly linked list containing a series of integers separated by the integer '0', modify the list by merging nodes between two '0's into a single node. This mer...read more
Ans. 
Given a singly linked list with integers separated by '0', merge nodes between '0's into a single node with sum of included nodes.
• Traverse the linked list and keep track of sum between zeroes

• Merge nodes between zeroes by updating the sum in the merged node

• Update the linked list by removing the nodes between zeroes

• Handle edge cases like list starting and ending with '0'
Answered by AI
Add your answer
Q3. 
Snake and Ladder Problem Statement
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...read more
Ans. 
Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.
• Create a graph representation of the board with snakes and ladders as edges.

• Use Breadth First Search (BFS) to find the shortest path from the starting cell to the last cell.

• Keep track of visited cells and the number of dice throws at each cell.

• Handle cases where the last cell is unreachable by returning -1.

• Consider the ...read more
Answered by AI
Add your answer