Traveloka Interview Questions, Process, and Tips

Q1. Why do you join Traveloka
Add your answer
Q2. How is your past role can contribute
Add your answer

Q1. Market sizing Question,
Add your answer
Q2. Leadership style
Add your answer

Simple Hackerrank test with medium level of questions

Leetcode medium level of questions - 1 hour round

Q1. System Design round with focus on real world system design.
Add your answer
Q2. Design Twitter timeline
Ans. 
Design Twitter timeline to display tweets in chronological order
• Use a database to store tweets with timestamps

• Implement a sorting algorithm to display tweets in chronological order

• Include features like retweets, likes, and replies

• Allow users to filter timeline based on hashtags or users they follow
Answered by AI
Add your answer

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.
 

Q1. 
Ways To Make Coin Change
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...read more
Ans. 
I first tried to solve the problem using BackTracking and was able to pass only 8 test cases out of 13. Then I checked the constraints again and realised that for clearing all 13 test cases I have to submit a solution with worst time complexity O(n^2). I tried to solve the question again but due to limited time couldn't solved it completely.
Answered Anonymously
Add your answer
Q2. 
Longest Increasing Subsequence Problem Statement
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...read more
Ans. 
I read the question first and the constraints. After reading the question I wrote the recurrence relation on paper and verified with the help of some examples. After verifying the recurrence relation, I coded the memoized solution and was able to pass all test cases.
Answered Anonymously
Add your answer

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.

Q1. 
Search Element in a Rotated Sorted Array
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 ...read more
Ans. 
1. I first solved the problem with brute force i.e using linear search. Complexity of solution was O(N) . Interviewers asked me to optimise more.
2. Then I used the fact that initially array was sorted , so I started thinking in the direction of binary search and was able to propose a solution with O(NLogn) Complexity.
3. Then Interviewers asked me about the explanation of the solution and I was able to tell them correct
Answered Anonymously
Add your answer
Q2. 
Construct Binary Tree from Parent Array Representation
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...read more
Ans. 
1. Read the questions and constraints carefully.
2. Came to conclusion that I have to find the height of binary tree represented by parent arrary.
3. Coded the solution while keeping the corner cases in mind.
Answered Anonymously
Add your answer

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.

Q1. 
Maximum Path Sum in a Matrix
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...read more
Ans. Brute Force
The basic approach is that we are going to explore all possible paths recursively from the first row for each cell and return the maximum sum among all paths. Steps are as follows:
1. Start exploring the path from each cell of the first row.
2. And the path can end at any cell of the last row.
3. If any move gets out of the boundary of the given matrix, then we return negative infinity, i.e. INT_MIN, because we do not w...read more
Answered Anonymously
Add your answer
Q2. 
Partition Equal Subset Sum Problem
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...read more
Ans. 
1. Initially I wasn't able to come up with solution then I thought of brute force solution.
2. I focused on solving with brute force and solved the problem with brute force i.e using Backtracking. Complexity of solution was Exponential . Interviewer asked me to optimise more, since solution was of exponential time complexity.
3. Then I used the fact that if sum of entire array is even then only we can divide the array in...read more
Answered Anonymously
Add your answer

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.