Traveloka Interview Questions and Answers

LC Medium+ easy questions

Q1. LC : easy medium questions
Add your answer

Q1. Design (LLD)+ DSA
Add your answer

Q1. Manager discussion
Add your answer

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. 
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
Answered by AI
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. 
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
Answered by AI
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. 
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.
Answered by AI
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. 
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
Answered by AI
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. 
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...read more
Answered by AI
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. 
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.
Answered by AI
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.