i
Travclan Technology India
Filter interviews by
I was interviewed in Jan 2021.
Round duration - 90 minutes
Round difficulty - Easy
This round consist of coding as well as mcq questions
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 ...
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
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'.
The first line contains...
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.
Round duration - 36 minutes
Round difficulty - Easy
Given an array representation of a min-heap of size 'n', your task is to convert this array into a max-heap.
The first line of input contains an int...
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.
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...
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'
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...
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 ...
Tip 1 : I practiced a lot of problems related to Data structures on the Coding ninjas platform and other coding platforms.
Tip 2 : If you are stuck somewhere in a problem and want to see reference, first, try to understand the algorithm and then move on to code.
Tip 3 : Just see the algorithm that is how to approach first and don't try to understand from the code right off the bat, code has finer implementation variation that can be done on your own if you are clear with the algorithm. Also for big product companies, prepare enough problems of graphs and trees as these are the most important topics for interviews.
Tip 1 : Mention a good level of projects in your resume, and also give a brief detail about each and every project.
Tip 2 : Have at least 1 or 2 good projects from which you know everything involved in the project.
I applied via LinkedIn and was interviewed in Apr 2021. There were 4 interview rounds.
Top trending discussions
Some of the top questions asked at the Travclan Technology India interview -
The duration of Travclan Technology India interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 57 interviews
Interview experience
based on 70 reviews
Rating in categories
3-5 Yrs
Not Disclosed
3-5 Yrs
Not Disclosed
5-10 Yrs
Not Disclosed
Operations Associate
67
salaries
| ₹0 L/yr - ₹0 L/yr |
Financial Associate
22
salaries
| ₹0 L/yr - ₹0 L/yr |
Accounts Manager
22
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Associate
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Razorpay
Paytm
Cashfree Payments
Instamojo