Upload Button Icon Add office photos

Filter interviews by

Tokopedia Software Developer Interview Questions and Answers

Updated 27 Mar 2024

Tokopedia Software Developer Interview Experiences

2 interviews found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.

Round 1 - Coding Test 

Kadance algorithm and find the middle of the linklist

Round 2 - Coding Test 

More on java and Python based coding questions

Round 3 - HR 

(4 Questions)

  • Q1. Behavioural questions were asked
  • Q2. What are your expectations from this job
  • Q3. What are your plans ahead
  • Q4. Where do you see yourself in 5 years ahead

Interview Preparation Tips

Interview preparation tips for other job seekers - Do good practise of DSA
Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Feb 2023. There were 2 interview rounds.

Round 1 - Aptitude Test 

- simple basic ios questions

Round 2 - Technical 

(1 Question)

  • Q1. Asked DSA array questions

Interview Preparation Tips

Interview preparation tips for other job seekers - prepare well DSA and code

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more

Interview questions from similar companies

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Impliment counter using closure in js
  • Ans. 

    Implement a counter using closure in JavaScript.

    • Create a function that returns another function which increments a counter variable.

    • The counter variable should be defined in the outer function's scope and only accessible to the inner function.

    • Each time the inner function is called, increment the counter variable and return its value.

  • Answered by AI
  • Q2. Explain promises, promise.all(), impliment binary search
  • Ans. 

    Promises are objects representing the eventual completion or failure of an asynchronous operation. promise.all() is a method that takes an array of promises and returns a single promise that resolves when all of the promises have resolved.

    • Promises are used in JavaScript to handle asynchronous operations.

    • promise.all() takes an array of promises and returns a single promise that resolves when all promises in the array ha...

  • Answered by AI
Round 2 - Technical 

(1 Question)

  • Q1. Questions on kafka, cache invalidation, diff b/w authentication and authorization

Interview Preparation Tips

Interview preparation tips for other job seekers - brush up basics of js and microservices

Skills evaluated in this interview

I appeared for an interview in Apr 2022.

Round 1 - Coding Test 

Round duration - 75 minutes
Round difficulty - Medium

Test Comprises of 3 coding questions and some MCQs

Round 2 - Video Call 

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 3 - Video Call 

(1 Question)

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...

  • Ans. 

    Find the Next Greater Element for each element in a list of integers.

    • Iterate through the list of integers from right to left.

    • Use a stack to keep track of elements whose NGE is yet to be found.

    • Pop elements from the stack until a greater element is found or the stack is empty.

    • Assign the NGE as the top element of the stack or -1 if the stack is empty.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Chandigarh Group of Colleges (CGC), Landran. I applied for the job as SDE - 1 in NoidaEligibility criteriaNo criteriaClearwater Analytics interview preparation:Topics to prepare for the interview - DSA, Java, OOPS, Microservices, REST APITime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Require coding skills to pass the interview. 
Tip 2 : Brush up on Java Skills
Tip 3 : Brush up on OOPS

Application resume tips for other job seekers

Tip 1 : Keep it to one page
Tip 2 : Mention relevant skills as per the job

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Dec 2020.

Round 1 - Coding Test 

(1 Question)

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...
  • Ans. 

    Count subarrays with sum divisible by K in an array.

    • Iterate through the array and keep track of the running sum modulo K.

    • Use a hashmap to store the frequency of remainders.

    • For each prefix sum, check how many previous prefix sums have the same remainder.

    • Return the total count of subarrays with sum divisible by K.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

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...
  • Ans. 

    Sort an array in a wave-like pattern where each element is greater than or equal to its adjacent elements.

    • Iterate through the array and swap elements at even indices with their adjacent odd indices to form a wave pattern.

    • There can be multiple valid wave arrays, so any valid wave array is acceptable.

    • Ensure the first element is greater than or equal to the second element to start the wave pattern.

  • Answered by AI
  • 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...
  • Ans. 

    Convert a given integer number into its corresponding word representation.

    • Implement a function that takes an integer as input and returns the word representation of that number.

    • Break down the number into its individual digits and convert each digit into its word form.

    • Handle special cases like numbers between 10 and 19, and multiples of 10.

    • Combine the word forms of individual digits to form the final word representation

  • Answered by AI
Round 3 - Video Call 

(1 Question)

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?
  • Ans. 

    Facebook stores comments in its database using a combination of relational and non-relational databases.

    • Comments are typically stored in a relational database like MySQL for structured data storage.

    • For scalability and performance, Facebook may also use a NoSQL database like Cassandra or HBase for storing comments in a denormalized format.

    • Metadata related to comments such as likes, timestamps, and user information may b...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Developer in NoidaEligibility criteriaShortlisting was done on the basis of coding test.Clearwater Analytics interview preparation:Topics to prepare for the interview - Data Structures, Algorithm Design, DBMS, Object Oriented Design, Machine LearningTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Practice the most frequent and most common questions DSA questions asked in companies like Amazon, Microsoft.
Tip 2 : Focus on solving the questions on your own as much as you can. 
Tip 3 : Don't waste your time on the number of questions while compromising quality.
Tip 4 : Do mock interviews with your friend if it's been a long since you have given the interview.
Tip 5 : For virtual interviews, always have a backup of data(you may use mobile data if Wi-Fi goes out). While during an interview try to maintain eye contact every now and then.
Tip 6 : Keep your resume short to 1 page and have far/good knowledge of the tech stack you have mentioned

Application resume tips for other job seekers

Tip 1 : Keep it short to 1 page
Tip 2 : Prepare it well.
Tip 3 : Focus more on the problem and the solution. Rather than tools used to solve the problem

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview before Apr 2021.

Round 1 - Telephonic Call 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

It was in the mid day and since I applied for a Frontend role the discussion was majorly around data structure and bit of Javascript.
The interviewer was helping and good listener.

  • Q1. 

    Merge Two Sorted Linked Lists Problem Statement

    You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.

    ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list without using additional space.

    • Create a dummy node to start the merged list

    • Compare the values of the two linked lists and add the smaller value to the merged list

    • Move the pointer of the merged list and the pointer of the smaller value list

    • Continue this process until one of the lists is fully traversed

    • Append the remaining elements of the other list to the me

  • Answered by AI
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. 

    Sort an array of 0s, 1s, and 2s in linear time complexity.

    • Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

    • Swap elements based on the values encountered to sort the array in-place.

    • Time complexity should be O(N) and space complexity should be O(1).

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

It was more of a in depth round on the framework I'm working on and problem solving.

  • Q1. What is the event loop and what is its significance?
  • Ans. 

    The event loop is a mechanism in programming that allows for asynchronous execution of code.

    • The event loop is a key component in JavaScript's runtime environment, responsible for handling asynchronous operations.

    • It continuously checks the call stack for any pending tasks and executes them in a non-blocking manner.

    • The event loop ensures that the program remains responsive by allowing other code to run while waiting for ...

  • Answered by AI
  • Q2. Can you provide examples of output-based questions in JavaScript that utilize browser APIs?
  • Ans. 

    Output-based questions in JavaScript using browser APIs

    • Example 1: Write a script that uses the Geolocation API to display the user's current location on a map

    • Example 2: Create a program that uses the Web Audio API to play a sound when a button is clicked

    • Example 3: Develop a web page that uses the Canvas API to draw a simple animation

  • Answered by AI
  • Q3. How would you design a system to support localization in a mobile app?
  • Ans. 

    Designing a system to support localization in a mobile app

    • Use resource files to store localized strings for different languages

    • Implement a language selection feature for users to choose their preferred language

    • Utilize localization libraries or frameworks to streamline the process

    • Consider cultural differences when localizing content, such as date formats and currency symbols

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 75 Minutes
Round difficulty - Hard

It was more of a fitment/managerial round.
Didn't had any coding questions, but was asked more on approaches and optimisations.
Discussions on the project you have worked on.

  • Q1. You need to find the fastest 3 horses out of a group, given that you can only race 5 horses at a time. How would you approach this problem?
  • Ans. 

    To find the fastest 3 horses out of a group with 5 horses racing at a time, we can use a tournament style approach.

    • Divide the horses into groups of 5 and race them against each other. This will give you the fastest horse in each group.

    • Take the winners from each group and race them against each other. The top 3 horses in this final race will be the fastest 3 overall.

    • Keep track of the results and compare the timings to d

  • Answered by AI
  • Q2. How do you debug the root cause of lag on a screen?
  • Ans. 

    To debug lag on a screen, analyze code, check for memory leaks, optimize rendering, and use profiling tools.

    • Analyze code to identify any inefficient algorithms or operations causing lag.

    • Check for memory leaks that could be impacting performance.

    • Optimize rendering by reducing the number of draw calls, optimizing shaders, and minimizing overdraw.

    • Use profiling tools like Xcode Instruments or Android Profiler to identify p

  • Answered by AI
  • Q3. Can you explain the architecture of the app you have recently worked on?
  • Ans. 

    The app I recently worked on is a social media platform for sharing photos and connecting with friends.

    • The app follows a client-server architecture, with the client being the mobile app and the server handling data storage and processing.

    • The client side is built using React Native for cross-platform compatibility.

    • The server side is implemented using Node.js with a MongoDB database for storing user data and photos.

    • The a...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteriaNo criteriaCars24 interview preparation:Topics to prepare for the interview - Data Structures Algorithms, Javascript, System DesignTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Get your JS fundamentals right (if applying for a Frontend role, https://javascript.info/ is a good start)
Tip 2 : Apart from preparing data structures, practise on the communication skills as well (prepare your introduction, be a good listener and on spot improvisation plays key roles)

Application resume tips for other job seekers

Tip 1 : highlight projects related to the job profile in your resume and mention what was your contribution in them precisely in 1/2 lines.
Tip 2 : Include URLs to applications/projects that you have build and your achievements/blog (if any)

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before May 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 150 Minutes
Round difficulty - Medium

3 coding questions and 20 mcq's

  • Q1. 

    Maximum Sum of Two Non-Overlapping Subarrays

    Given an integer array ARR and a positive integer K, your task is to determine two non-overlapping subarrays of length K that yield the maximum combined sum.

    ...

  • Ans. 

    The task is to find two non-overlapping subarrays of length K in an array, such that their sum is maximum.

    • Iterate through the array and calculate the sum of each subarray of length K

    • Store the maximum sum obtained from the first subarray

    • Iterate again and calculate the sum of each subarray of length K, excluding the previous subarray

    • Store the maximum sum obtained from the second subarray

    • Return the sum of the two maximum

  • Answered by AI
  • Q2. 

    Distinct Subsequences Problem Statement

    You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.

    Exampl...

  • Ans. 

    The task is to find the count of distinct subsequences in a given string.

    • Use dynamic programming to solve the problem.

    • Create a 2D array to store the count of distinct subsequences for each prefix of the string.

    • Initialize the first row of the array with 1, as there is only one subsequence of an empty string.

    • For each character in the string, calculate the count of distinct subsequences by considering two cases: including...

  • Answered by AI
  • Q3. 

    Array Intersection Problem Statement

    Given two integer arrays/ lists ARR1 and ARR2 of sizes N and M respectively, you are required to determine their intersection. An intersection is defined as the set of...

  • Ans. 

    The task is to find the intersection of two integer arrays/lists.

    • Read the number of test cases

    • For each test case, read the size and elements of the first array/list

    • Read the size and elements of the second array/list

    • Find the intersection of the two arrays/lists

    • Print the intersection elements in the order they appear in the first array/list

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

Online video call based round, Timing was 10-11 AM
Interview started with basic greetings, post that i explained by projects in brief and then we jumped right into dsa questoins.

  • Q1. 

    Number of Islands Problem Statement

    You are given a non-empty grid that consists of only 0s and 1s. Your task is to determine the number of islands in this grid.

    An island is defined as a group of 1s (re...

  • Ans. 

    The task is to find the number of islands in a grid consisting of 0s and 1s.

    • An island is a group of 1s connected horizontally, vertically, or diagonally

    • The grid is surrounded by 0s on all four edges

    • Use a depth-first search (DFS) or breadth-first search (BFS) algorithm to traverse the grid and count the number of islands

    • Initialize a visited array to keep track of visited cells

    • For each unvisited cell with a value of 1, p...

  • Answered by AI
  • Q2. 

    Arrangement Problem Statement

    Determine the number of permutations of list A = [1, 2, ..., N] such that for every index i, either A[i] is divisible by i or i is divisible by A[i].

    Input:

    The input start...
  • Ans. 

    The goal is to find the number of permutations of a list satisfying certain conditions.

    • Iterate through all permutations of the list

    • Check if each permutation satisfies the given conditions

    • Count the number of permutations that satisfy the conditions

    • Return the count for each test case

  • Answered by AI
  • Q3. 

    Idempotent Matrix Verification

    Determine if a given N * N matrix is an idempotent matrix. A matrix is considered idempotent if it satisfies the following condition:

    M * M = M

    Input:

    The first line cont...
  • Ans. 

    An idempotent matrix is a square matrix that remains unchanged when multiplied by itself.

    • Check if the given matrix satisfies the property M*M = M

    • Iterate through each element of the matrix and perform the matrix multiplication

    • Compare the result with the original matrix

    • If they are equal, return true; otherwise, return false

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 120 Minutes
Round difficulty - Easy

This was EM round, started with me explaining my projects in deep and facing some counter questions on that, proceeded to os, dbms basic questions and some low level designing and lastly a puzzle to end interview.

  • Q1. Can you design an attendance management system?
  • Ans. 

    Design attendance management system

    • Create a database to store employee information

    • Implement a user interface for employees to mark their attendance

    • Develop a system to track and record attendance data

    • Generate reports and analytics based on attendance data

  • Answered by AI
Round 4 - HR 

Round duration - 20 Minutes
Round difficulty - Easy

This was formality round, HR came and explained what meesho does and told my joining dates and compensation details.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaMeesho interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, DBMS, Dynamic Programming, Low level designTime required to prepare for the interview - 5 MonthsInterview preparation tips for other job seekers

Tip 1 : Do medium level queustions
Tip 2 : Learn basic system design for startup interviews.

Application resume tips for other job seekers

Tip 1 : Put things on your resume that you know by your heart, otherwise will have a lot of difficulty in the HM round.
Tip 2 : Do not mention co-curricular activities on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.

Round 1 - Coding Test 

3 Moderate questions were asked. I managed to solve 2 completely and 1 partially.

Round 2 - Technical 

(2 Questions)

  • Q1. Question related to system design were asked.
  • Q2. He asked me to design some functions of facebook.
Round 3 - HR 

(1 Question)

  • Q1. Introduction type questions were asked. In this it will prefer only CS students
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I applied via Referral and was interviewed in Mar 2024. There were 3 interview rounds.

Round 1 - Coding Test 

There were 2 questions.
1. Knapsack
2. Median in an array

Round 2 - One-on-one 

(1 Question)

  • Q1. LLD(machine coding) of Google meet
Round 3 - One-on-one 

(1 Question)

  • Q1. In depth discussion on my projects and resume
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - Coding Test 

2 medium - question 1 array and 1 dp
1 med to hard - dynamic programming

Round 2 - Technical 

(2 Questions)

  • Q1. System design LLD - Polling System
  • Q2. How to implement Concurrency in it.
  • Ans. 

    Concurrency in software development allows multiple tasks to run simultaneously, improving performance and responsiveness.

    • Use multithreading to execute multiple tasks concurrently

    • Implement asynchronous programming to handle tasks that may take longer to complete

    • Use synchronization techniques like locks and semaphores to manage access to shared resources

    • Consider using thread pools to manage and reuse threads efficiently

  • Answered by AI

Tokopedia Interview FAQs

How many rounds are there in Tokopedia Software Developer interview?
Tokopedia interview process usually has 2-3 rounds. The most common rounds in the Tokopedia interview process are Coding Test, Aptitude Test and Technical.
What are the top questions asked in Tokopedia Software Developer interview?

Some of the top questions asked at the Tokopedia Software Developer interview -

  1. Behavioural questions were as...read more
  2. Asked DSA array questi...read more

Tell us how to improve this page.

Tokopedia Software Developer Interview Process

based on 2 interviews

Interview experience

3
  
Average
View more
Tokopedia Software Developer Salary
based on 16 salaries
₹7.8 L/yr - ₹18 L/yr
66% more than the average Software Developer Salary in India
View more details

Tokopedia Software Developer Reviews and Ratings

based on 2 reviews

3.6/5

Rating in categories

2.7

Skill development

4.5

Work-life balance

3.0

Salary

3.0

Job security

3.7

Company culture

2.6

Promotions

3.1

Work satisfaction

Explore 2 Reviews and Ratings
Software Engineer
138 salaries
unlock blur

₹6.2 L/yr - ₹26 L/yr

Senior Software Engineer
53 salaries
unlock blur

₹16 L/yr - ₹35 L/yr

Technical Architect
21 salaries
unlock blur

₹50 L/yr - ₹73 L/yr

Senior Data Scientist
18 salaries
unlock blur

₹18 L/yr - ₹40 L/yr

Software Developer
16 salaries
unlock blur

₹7.8 L/yr - ₹18 L/yr

Explore more salaries
Compare Tokopedia with

OLX

3.8
Compare

Udaan

4.0
Compare

Swiggy

3.8
Compare

CARS24

3.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview