Filter interviews by
I applied via Referral and was interviewed in Feb 2022. There were 4 interview rounds.
I applied via LinkedIn and was interviewed in Sep 2024. There were 2 interview rounds.
I appeared for an interview in Jan 2025.
I applied via Job Portal and was interviewed in Feb 2024. There were 2 interview rounds.
Traveloka interview questions for popular designations
I appeared for an interview before Mar 2023.
I applied via Referral and was interviewed before Mar 2023. There were 2 interview rounds.
I applied via Referral and was interviewed before Feb 2023. There were 3 interview rounds.
I appeared for an interview in Nov 2020.
Round duration - 90 minutes
Round difficulty - Medium
Basically a hackerrank link was shared and I was suppose to take the test within a day. Online Test comprised of 3 algorithmic Questions. Duration of round was 90 minutes.
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...
The task is to find the total number of ways to make change for a specified value using given denominations.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the number of ways to make change for each value up to the specified value.
Iterate through the denominations and update the array based on the current denomination.
The final answer will be in the last cell of the array correspond
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to solve this problem efficiently.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the array as the length of the longest increasi
Round duration - 70 minutes
Round difficulty - Medium
It was a 60 minute virtual face 2 face round with 2 senior software engineers of the company. Interview started with brief introduction by the engineers followed by my Introduction. Interview started at 3:00 P.M and lasted till 4:10 P.M. Google Doc was used for coding purposes.
Given a sorted array that has been rotated, the task is to find the index of a specific element. The array is initially sorted in ascending order and then rotated ...
Search for an element in a rotated sorted array in O(logN) time complexity.
Implement binary search to find the pivot point where rotation occurs.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle cases where the element lies in the left or right subarray after rotation.
Given an array parent
which represents a binary tree, the parent-child relationship is defined by (PARENT[i], i)
, meaning that the parent of i
is PAR...
Construct a binary tree from parent array representation ensuring specific conditions are met.
Iterate through the parent array to create the binary tree
Handle cases where a node has both left and right children
Ensure left child is smaller than the right child if both exist
If a node has only one child, make it the left child
Round duration - 60 minutes
Round difficulty - Medium
It was a face 2 face algorithmic round taken by Senior Backend engineer. Interview Round Started at around 2:00 P.M and lasted till 3:05 P.M. Interview started with the brief introduction followed by 2 algorithmic questions. Interviewer was focusing problem solving skills. After discussing the approach, Coding part was to be done on google doc.
Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...
Find the maximum sum that can be obtained from a path in a matrix from the first row to the last row.
Use dynamic programming to keep track of the maximum sum at each cell in the matrix.
Consider moving down, diagonally left, and diagonally right to calculate the maximum sum.
Start from the second row and update each cell with the maximum sum from the cell above it and the diagonally adjacent cells.
Continue this process u...
Given an array ARR
consisting of 'N' positive integers, determine if it is possible to partition the array into two subsets such that the sum of the elements in both sub...
The problem is to determine if it is possible to partition an array into two subsets with equal sum.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store if a subset with a particular sum is possible.
Check if it is possible to form a subset with half the total sum of the array.
Round duration - 120-130 minutes
Round difficulty - Medium
It was a face 2 face round which was taken by Line manager. Interview started at 11:00 A.M and lasted around 2 hours approx. Interviewer was very friendly and supportive. Interview started with brief introduction of the interviewer followed by mine. Then a System design question was asked by the interviewer over google doc. Interviewer was focusing on how I'm approaching the problem. Overall It was a good experience.
Tip 1 : We should focus on other topics apart from DSA. Knowledge of LLD, HLD, OOPS and other subjects also plays a very important role.
Tip 2 : Communication also plays a key role in interviews. We should be able to explain our solution precisely and also able to catch hints given by Interviewer.
Tip 3 : While practising DSA focus should be on logic building rather than cramming the solution because proper reasoning will hep you to solve other new questions.
Tip 4 : Always remember interview is two way communication.
Tip 1 : Mention only those projects and skills in which you are confident.
Tip 2 : Resume should be of one page(preferrable).
Top trending discussions
I applied via Other and was interviewed in Sep 2018. There were 3 interview rounds.
based on 5 interviews
Interview experience
based on 12 reviews
Rating in categories
Software Engineer
13
salaries
| ₹10 L/yr - ₹22 L/yr |
Senior Software Engineer
7
salaries
| ₹17 L/yr - ₹31 L/yr |
Software Developer
5
salaries
| ₹6.5 L/yr - ₹14 L/yr |
Lead Engineer
4
salaries
| ₹35 L/yr - ₹44 L/yr |
Security Engineer
4
salaries
| ₹12 L/yr - ₹25.6 L/yr |
MakeMyTrip
Cleartrip
Yatra
Goibibo