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. Backtracking
Maintain a visited array and try to explore all the possibilities with the help of backtracking.
1. Start with (0, 0) and mark it as visited and try to move in all 4 directions.
2. Say at any point we are at (i, j) then the cost of reaching (x,y) will be the minimum of these four cases.
   1. Option 1 -  Left: cost of reaching from (i, j-1)
   2. Option 2 - Right: cost of reaching from (i, j+1)
   3. Option 3 - Up: 1 + cost of rea...read more
Answered Anonymously
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. Brute force approach
• The Idea behind this brute force approach is to consider each subarray of size K by fixing a point i in the array and then consider all the points after it till we have considered K elements from the starting point i and finding the maximum element in it and then storing it.
• Now, run a loop(say, loop variable i) till (N-K) elements of the array:
  • Run a nested loop(say, loop variable j) through the elem...read more
Answered Anonymously
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. Sorting Approach
The main idea is that when an array is sorted in descending order it becomes max heap as for every ‘i’ from i=0 to n/2 it is greater than equal to arr[2*i+1] and arr[2*i+2].
Space Complexity: O(1)Explanation:
O(1)
 
We are using constant space to solve this.
Time Complexity: O(nlogn)Explanation:
O(n*log(n)), where n is the size of the array.
 
Sorting an array takes O(n*log(n)) time complexity.

Pytho...read more
Answered Anonymously
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. Two Pointer Approach
Let us initialize two pointers, newHead and newTail, with NULL (These will be the head and tail of the final list). Now traverse the given list. Ignore the first zero. Now, as you encounter non-zero nodes, add their values in a variable called ‘sum’. As soon as you encounter a node with data 0, change that node's value to ‘sum’, and
1. If newHead is NULL, this node becomes the new head and tail of the l...read more
Answered Anonymously
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. BFS
We will use Breadth-First Search to find the shortest path from cellNumber 1 to cellNumber N*N.
1. We will maintain a queue of cellNumber where the front of the queue will always contain a cell which can be reached by minimum dice throw from starting cell (cellNumber = 1).
2. Create a minDiceThrow array of size N*N initialise it with the maximum value (INT_MAX)
3. Start with pushing cellNumber 1 and updating minDiceThrow[1] = 0...read more
Answered Anonymously
Add your answer