Traveloka interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Traveloka
4 rounds | 7 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3-4 months
Topics: Data Structures and Algorithms, Object Oriented Design, LLD & HLD, Operating System, Computer Networks, DBMS
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.
Application process
Where: Linkedin
Eligibility: No criteria
Tip 1 : Mention only those projects and skills in which you are confident.
Tip 2 : Resume should be of one page(preferrable).
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date7 Aug 2020
Coding problem2
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.
1. Ways to make coin change
Moderate
20m average time
80% success
0/80
Asked in companies
You are given an infinite supply of coins of each of denominations D = {D0, D1, D2, D3, ...... Dn-1}. You need to figure out the total number ...
View more
Problem approach
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.
2. Longest increasing subsequence
Moderate
30m average time
65% success
0/80
Asked in companies
For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly increasing order.
View more
Problem approach
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.
02
Round
Medium
Online Coding Interview
Duration70 minutes
Interview date13 Aug 2020
Coding problem2
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.
1. Search an element in a sorted and rotated array
Moderate
30m average time
65% success
0/80
Asked in companies
Aahad and Harshit always have fun by solving problems. Harshit took a sorted array consisting of distinct integers and rotated ...
View more
Problem approach
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 an...
View more
2. Construct Binary Tree from given Parent Array representation
Easy
15m average time
80% success
0/40
Asked in companies
Given an array parent which represents a binary tree such that parent-child relationship is defined by ('PARENT'[i], 'i') which means that parent of i is &...
View more
Problem approach
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.
03
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date19 Aug 2020
Coding problem2
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.
1. Maximum path sum in the matrix
Moderate
35m average time
70% success
0/80
Asked in companies
You have been given an N*M matrix filled with integer numbers, find 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.
View more
2. Partition equal subset sum
Moderate
25m average time
65% success
0/80
Asked in companies
You are given an array 'ARR' of 'N' positive integers. Your task is to find if we can partition the given array into two subsets such that the sum of elements in both subsets is equal.
View more
Problem approach
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 the...
View more
04
Round
Medium
Online Coding Interview
Duration120-130 minutes
Interview date24 Nov 2020
Coding problem1
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.
1. System Design
Build Search Functionality, for a Hotel booking system like OYO, which should results in relevant search result based on User query. Constraints were as follows:-
1. User Query can be anything.
2. Hotel Records/Data can be Huge.
3. Have to respond with relevant search result even if user query is not correct. Have to respond with closest relevant result.
Schema of Data:-...
View more
Problem approach
Tip 1 : Clarify each and everything with the Interviewer.
Tip 2 : Don't assume anything.
Tip 3 : You should be able to reason your decision of choosing one thing over another. Answering without any reasoning is a red flag .
Tip 4: This resource really helped. https://github.com/donnemartin/system-design-primer
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
What is the result of 4 % 2?
Start a Discussion
Similar interview experiences
Product Intern
6 rounds | 9 problems
Interviewed by Squadstack
Selected 
0 views
0 comments
0 upvotes
Business Technology Analyst
4 rounds | 5 problems
Interviewed by Squadstack
Selected 2269 views
0 comments
0 upvotes
SDE - 1
3 rounds | 10 problems
Interviewed by Sterlite Technologies Limited
Selected 2112 views
0 comments
0 upvotes
Product Engineer
3 rounds | 5 problems
Interviewed by Squadstack
Selected 1399 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 103832 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 49225 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 30722 views
6 comments
0 upvotes