Tokopedia interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

Tokopedia
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I had some coding knowledge when I joined college, but I didn't actively pursue it until my second year. However, during my second year, I dedicated a lot of time to improving my coding skills. As a result, I received several job offers and eventually decided to join Cisco as an intern in my fourth year. Following my internship, I received a PPO and have since transitioned to working full-time at Cisco
Application story
Tokopedia visited our campus for internships, and since the location was in Noida, which is close to my home, I applied for the position.
Why selected/rejected for the role?
I believe I was rejected because I already secured a full-time offer. This was communicated to the interviewer when they asked if I had received any other offers. I am confident this was the sole reason for the rejection, as the interview itself went well.
Preparation
Duration: 4 Months
Topics: Data Structures, Algorithms, Aptitude, OOPS
Tip
Tip

Tip 1: Prioritize practicing previously asked interview questions as well as online test questions. 

Tip 2: Develop a strong understanding of Data Structures and Algorithms (DSA). 

Tip 3: Create at least two high-quality projects and ensure you understand every aspect of them thoroughly.

Application process
Where: Campus
Eligibility: 60% marks in 10th,12th, B.Tech (For M.Tech students) and current CGPA 6.0 and above, with no active backlog(s).
Resume Tip
Resume tip

Tip 1: Include concise explanations of at least two impressive projects, covering all essential details.

Tip 2: Ensure all your skills are listed. 

Tip 3: Prioritize emphasizing your skills, projects, and experiences in your resume.

Interview rounds

01
Round
Easy
Video Call
Duration60 Minutes
Interview date9 Dec 2021
Coding problem2

The interviewer asked 2 Coding Problems.

1. Smallest divisor

Moderate
20m average time
70% success
0/80
Asked in companies
SalesforceVymo

You are given an array of integers 'arr' and an integer 'limit'.


Your task is to find the smallest positive integer divisor, such that upon dividing all the elements of the given array by it, the sum of the division's result is less than or equal to the given integer's limit.


Note:
Each result of the division is rounded to the nearest integer greater than or equal to that element. For Example, 7/3 = 3.
Try solving now

2. Median of Two Sorted Arrays

Hard
25m average time
65% success
0/120
Asked in companies
GrabAtlassianAmazon

Given two sorted arrays 'a' and 'b' of size 'n' and 'm' respectively.


Find the median of the two sorted arrays.


Median is defined as the middle value of a sorted list of numbers. In case the length of list is even, median is the average of the two middle elements.


The expected time complexity is O(min(logn, logm)), where 'n' and 'm' are the sizes of arrays 'a' and 'b', respectively, and the expected space complexity is O(1).


Example:
Input: 'a' = [2, 4, 6] and 'b' = [1, 3, 5]

Output: 3.5

Explanation: The array after merging 'a' and 'b' will be { 1, 2, 3, 4, 5, 6 }. Here two medians are 3 and 4. So the median will be the average of 3 and 4, which is 3.5.
Try solving now
02
Round
Easy
Video Call
Duration60 Minutes
Interview date10 Dec 2021
Coding problem2

1. Split Array With Equal Sums

Moderate
15m average time
85% success
0/80
Asked in companies
alibabaD.E.ShawCapegemini Consulting India Private Limited

You are given an array/list 'ARR' of size 'N'. You task is to find if there exists a triplet (i, j, k) such that 0 < i , i + 1 < j , j + 1 < k and k < 'N' - 1 and the sum of the subarrays [0, i - 1],[i + 1, j - 1], [j + 1, k - 1], [k + 1, N - 1] are equal.

An array c is a subarray of array d if c can be obtained from d by deletion of several elements from the beginning and several elements from the end.

Example:

let 'ARR' = [1, 2, 3] then the possible subarrays of 'ARR' will be - {1}, {2}, {3}, {1, 2}, {2, 3}, {1, 2, 3}.
Note: Assume That the Array has Zero-based indexing.
Try solving now

2. Puzzle

The following is a description of the instance of this famous puzzle involving 2 eggs and a building with 100 floors. 

Suppose that we wish to know which stories in a 100-story building are safe to drop eggs from, and which will cause the eggs to break on landing. What strategy should be used to drop eggs such that the total number of drops in the worst case is minimized and we find the required floor? 

03
Round
Easy
HR Round
Duration60 minutes
Interview date12 Dec 2021
Coding problem1

1. Basic HR Questions

Tell me about yourself.

Tell me about your projects.

Why do you know about us?

Why do you want to join us?

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4658 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
962 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6451 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3453 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
15481 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
15339 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
10143 views
2 comments
0 upvotes