Tokopedia Software Developer Interview Questions and Answers

HAckerrank based test

Q1. Past Experience
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

Test Comprises of 3 coding questions and some MCQs

Round duration - 60 minutes
Round difficulty - Medium

2 coding questions of (1 easy and 1 medium level) on hackerrank code-pair with the Interviewer

Round duration - 60 minutes
Round difficulty - Easy

This Round was based on CS fundamentals and One coding question was there as a Code-pair.

Q1. 
Next Greater Element Problem Statement
Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...read more
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

Machine Coding Round
2 Hours in Total
15 Mins for Question Explaination and Doubts
1.5 Hours for coding
15 mins to discuss the approach 

Timing - 3 to 5 pm (They are flexible)
Interviewer was very patient and helped me understand the question

Round duration - 60 Minutes
Round difficulty - Medium

2 Data Strucutre Questions
Timing 5-6 pm (They are flexible)
Google Meet
Online IDE

Q1. 
Unique Binary Search Trees Problem Statement
Given an integer 'N', your task is to compute the number of structurally unique BSTs (binary search trees) that can be formed using an exact number of 'N' uniq...read more
Add your answer
Q2. 
Subsequences of String Problem Statement
You are provided with a string 'STR' that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen...read more
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

HIRING MANAGER ROUND

Discussion about the organisation now questions

Round duration - 90 minutes
Round difficulty - Medium

Total of 8 questions:

4 MCQ(oops and expected output type questions) + other 2 were coding questions, out of which one is some class implementation question.

Q1. 
Count Subarrays with Sum Divisible by K
Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.
Input:
The first line of input contains an...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This round was with the USA team, the panel consisted of 2 members. It took place at around 9 PM IST. The interviewer's focus was on approach.

Q1. 
Sort an Array in Wave Form
You are given an unsorted array ARR. Your task is to sort it so that it forms a wave-like array.
Input:
The first line contains an integer 'T', the number of test cases.
For ea...read more
Add your answer
Q2. 
Convert a Number to Words
Given an integer number num, your task is to convert 'num' into its corresponding word representation.
Input:
The first line of input contains an integer ‘T’ denoting the number o...read more
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

It was a managerial round. The position of the person taking the interview was of a technical architect. As was informed by the recruiter, previously he was a technical architect at Amazon.

Q1. How does Facebook store comments in its database?
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

1 easy and 2 medium-hard DSA problems to solve

Q1. 
Hurdle Game Problem Statement
Kevin is playing a hurdle game where he must jump over hurdles to clear levels. Each level ‘i’ consists of ‘i’ hurdles (e.g., Level 6 has 6 hurdles).
Given the total number ...read more
Ans. Brute Force
The basic idea is to iterate through all the levels and keep subtracting the hurdles that Kevin has jumped. The steps are as follows:
 
1. Create two variables “hurdle” and “level” to count the hurdles that Kevin has jumped and to count the level cleared, respectively.
2. Iterate till the ”hurdle” becomes greater than ‘N’.
   • “hurdle” = “hurdle” + “level” + 1
   • “level” = “level” + 1
3. Return “level” - 1
Space Complexity: O...read more
Answered Anonymously
Add your answer
Q2. 
N Queens Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they ar...read more
Ans. Backtracking
1. Instead of checking all the places on the chessboard, we can use backtracking and place queen row-wise or column-wise.
2. Suppose we place queens row-wise, and we start with the very first row. Place the queen and move to the next row until either there is a solution or there are no viable cells left.
3. As we backtrack, check to place the queen in the different columns of the same row.
4. When we can place a queen at ...read more
Answered Anonymously
Add your answer
Q3. 
Count Ways To Travel Triangular Pyramid
Bob is given a triangular pyramid with vertices 'O', 'X', 'Y', and 'Z'. He is also provided with an integer 'N'. Bob can move to any adjacent vertex in a single ste...read more
Ans. Brute Force
The idea is very simple, as standing at any point we will always have three choices to move. So we will make a recursive function and call it for all three choices and decrease ‘N’ by 1 each time. So when ‘N’ will reach 0 then we will check the current position, if it is ‘O’ then we can say we have found a way.
 
Complete Algorithm :
• We will make a helper recursive function named ‘SOLVE’ which will receive...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

2 DSA problems and computer subject questions

Q1. 
Generate Binary Strings with No Consecutive 1s
Given an integer K, your task is to produce all binary strings of length 'K' that do not contain consecutive '1's.
Input:
The input begins with an integer ...read more
Ans. Recursive Approach
Since we need to generate all substring which does not have consecutive 1s we can simply start adding new characters to the string until the length of the string is ‘K’ taking care that if the last character of the current string is ‘1’ we cannot add another ‘1’ as it will result in consecutive ‘1s.’ Otherwise, if the last character is ‘0’ we have 2 options either to add ‘1’ or ‘0’. We explore both th...read more
Answered Anonymously
Add your answer
Q2. 
Shuffle Two Strings Problem Statement
You are provided with three strings A, B, and C. The task is to determine if C is formed by interleaving A and B. C is considered an interleaving of A and B if:
• T...read more
Ans. Brute-force, Recursion
Approach:
 
To solve this problem, let us solve a smaller problem first. Let’s assume that the length of the string A and B is one and the length of the string C is two. Now to check whether C is formed by interleaving A and B or not, we consider the last character of string C, and if this character matches neither with the character of the string A nor with the character of string B, then we r...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

DSA round

Q1. 
Ninja and Intersection of Lines
You are given coordinates for two lines on a 2D plane: Line 'AB' is defined by points 'A' and 'B', and Line 'PQ' is defined by points 'P' and 'Q'. Your task is to find the ...read more
Ans. Mathematics
The idea behind this approach is to derive the equation of both of the lines ‘AB’ and ‘PQ’ and check if the Slope of these two lines is equal or not. Following are the two cases:
• If the slope of ‘AB’ and ‘PQ’ is the same that means they are parallel so we return -1.
• Else there must a point where ‘AB’ and ‘PQ’ are intersecting.
For a better understanding of this approach, Assume that we have two points which are...read more
Answered Anonymously
Add your answer
Q2. 
Cycle Detection in Directed Graph
Determine if a given directed graph contains a cycle. If the graph has at least one cycle, return true. Otherwise, return false.
Input:
The first line of input contains...read more
Ans. 
1. Create the graph using the given number of edges and vertices.
2. Create a recursive function that initializes the current index or vertex, visited, and recursion stack.
3. Mark the current node as visited and also mark the index in the recursion stack.
4. Find all the vertices which are not visited and are adjacent to the current node. Recursively call the function for those vertices, If the recursive function returns...read more
Answered Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

It is a managerial round

Q1. How does a URL work and what is a load balancer?
Add your answer