AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Clear (1)
Tokopedia Android App Developer Interview Questions and Answers
Tokopedia Android App Developer Interview Experiences
1 interview found
Anonymous
I applied via LinkedIn and was interviewed before Apr 2021. There were 4 interview rounds.
There were few MCQ questions based on android and 2 coding questions
(2 Questions)
- Q1. Purely DSA round it was. There were 3 coding question asked and I was able to solve all of that.
- Q2. All questions from leetcode coding question (easy- medium).
(1 Question)
- Q1. In this round, the interviewer was very weird, he asked some questions related to the internal working of JSON & restApis technologies. He was not supportive and made me feel like I`m nothing in front of ...
Interview Preparation Tips
Top trending discussions
Interview questions from similar companies
Interview Preparation Tips
Experience: GD was conducted for shortlisted candidates and candidates were divided into groups of 6 people.There were 3 topics and each topic was discussed for 2 minutes.No specific rules,like each person needs to speak,are to be followed during the GD.Anyone can initiate,intervene,etc. Finally we were asked to link all three topics and this discussion went on for another 2 minutes.
Round: HR Interview
Experience: Only a single round lasting about 40-45 minutes.There were only 4 people in the panel and technical as well as HR questions were asked. First I was asked to go through my own resume, “Introduce/Tell us about yourself?". E.g.:“Where have you shown leadership qualities?Have you led a
team?Size of team? What new initiatives did you take?”.Core questions starting form basics like “How does an airplane fly?” to specific questions about the different types of engines used in airplanes,their specifications, etc. were asked. HR questions were put up like"What was the most difficult decision in your life?" and grilled on my internship for 15-20 minutes which I did in Transocean. (Another oil field services company).
General Tips: You need to be very good in the basics of your
core courses and if you have done an internship in the oil industry,
you will definitely be grilled on that.Questions will be asked in quick succession.
Skill Tips: Highlight any intern in Oil industry or anything related to that in your resume.Any POR or any sport activity which shows your leadership qualities should me mentioned in your resume.
Skills: Leadership qualities, Athletic, Quick thinking, presence of mind
College Name: IIT MADRAS
Adithya H K Upadhya
Interview Preparation Tips
Experience: An aptitude test which was followed by three rounds of technical interviews and finally the HR interview.
Round: HR Interview
Experience: Snapdeal offered placements for 5 students (3 from CS and 2 from IT).
General Tips: Be extremely well prepared for any company. Research about the company's profile extensively before the company's interview. HR panel always looks for candidates who are well aware of the company in order to measure the candidate's interest. Data structures are absolutely necessary for any company. Improve coding skills through frequent participation in competitive programming arena such as codeForces, codeChef, HackerEarth etc. "Software development job profile was offered to me.
Unnecessary and irrelevant questions are to be avoided. We should raise questions only if we have some genuine questions. However any question related to job profile or location preference could be raised. "
"It was very grueling and tiring at first but the sweet taste of placement makes it all worth it.
Placements are a turning point in everybody's career."
Skill Tips: Snapdeal is more focussed on Data structures and object oriented technology.
For data structures, online materials such as GeeksforGeeks are excellent and in case of OOPS concepts, stronghold in either C++ or java programming language is necessary.
Skills:
College Name: NIT Surathkal
Aman Jain
Interview Preparation Tips
Experience: Algorithmic coding test was conducted on hackerank platform. Around 60 students gave online test. There were 4-5 algo questions to be done in 90 mins duration.
Tips: Try to do at least 2 questions.
Round: Technical Interview
Experience: First Interviewer asked me to introduce myself. Then he asked me questions on data structures & Algo. He asked me about tree data structures, why it is used, time complexities of various operations on tree, balancing of tree, AVL Tree. He asked me write AVL Tree insertion, deletion, update code. Then he jumps to BTree, B+Tree and asks me write code on paper for various operations. Questions were asked on indexing, various types of indexing, how it is used in databases, etc. Then he briefly asked about the project I done in my internship.
Round: Technical Interview
Experience: Interviewer asked me how was my 1st round, I said it was great. He first asked me introduce myself. Then he asked about my projects mentioned in my resume. I done a project in machine learning on spam webpage detection. He was interested in that. He asked me what language, libraries I used to implement that project. Then he gave me real time scenario to predict whether an item is explosive or not. Then I approached this problem and asked information related to problem. He was impressed by the approach I target the problem. He asked me what machine learning model will be best and what are their pros and cons. Then he asked me question that given 100 sorted linked lists, you have to merge them and return single sorted linked list. I gave 3-4 solutions with their time & space complexities.
Round: HR Interview
Experience: Interviewer asked me common HR questions like tell me about yourself, my family background, why do you want to join the company, what impact you can make in Snapdeal, why should we hire you. After that he congratulated me for the role of SDE at Snapdeal. I was very happy at that moment.
All the 5 students cleared this round.
Skills: SQL, ML, Algorithms And Data Structures, Python, Basic C/C++
College Name: IIT Guwahati
I was interviewed before Apr 2021.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Easy
There were 22 MCQ questions of aptitude and technical based while 3 questions were of coding type.
Tips: MCQ questions were not time consuming , so try to do that questions in less time , so you will get enough time for coding questions.
- Q1.
Balanced Parentheses Check
Given a string
STRconsisting solely of the characters '{', '}', '(', ')', '[', and ']', determine whether the parentheses are balanced.Input:
The first line contains an inte... - Ans.
Implement a function to check if parentheses in a string are balanced.
Use a stack to keep track of opening parentheses and pop when a closing parenthesis is encountered.
If the stack is empty when a closing parenthesis is encountered or if there are unmatched parentheses at the end, return 'NO'.
Ensure that all opening parentheses have a corresponding closing parenthesis in the correct order.
Return 'YES' if all parenthes...
- Q2.
Find the Next Greater Number with the Same Set of Digits
Given a string
Sthat represents a number, determine the smallest number that is strictly greater than the original number and has the same set of ... - Ans.
The task is to find the smallest number greater than the given number with the same set of digits.
Sort the digits of the number in descending order.
Find the first digit from the right that is smaller than the digit to its right.
Swap this digit with the smallest digit to its right that is greater than it.
Sort all the digits to the right of the swapped digit in ascending order to get the smallest number greater than the
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
My experience was very awesome , I answered all the questions , although in starting I was very nervous , so at starting interviewer help me get my confidence, interviewer was very helpful.
- Q1.
Maximum Level Sum in Binary Tree Problem Statement
Given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, your task is to find the maximum sum for any le...
- Ans.
Find the maximum sum for any level in a binary tree.
Traverse the binary tree level by level and calculate the sum for each level.
Keep track of the maximum sum encountered so far.
Return the maximum sum found.
Example: For the input tree, the maximum level sum is 13 (5+6+2).
- Q2.
Find Top K Frequent Numbers in a Stream
Given an integer array
ARRand an integerK, your task is to find theKmost frequent elements inARR. Return the elements sorted in ascending order.Example:
Inp...
- Ans.
Find the K most frequent elements in an integer array and return them sorted in ascending order.
Use a hashmap to store the frequency of each element in the array.
Use a min heap to keep track of the K most frequent elements.
Return the elements from the min heap in ascending order.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This round was based on DSA and questions on core subjects that I had studied throughout college.
- Q1.
Vertical Sum in a Binary Tree
Given a binary tree where each node has a positive integer value, compute the vertical sum of the nodes. The vertical sum is defined as the sum of all nodes aligned along the...
- Ans.
Compute the vertical sum of nodes in a binary tree aligned along the same vertical line.
Traverse the binary tree in a level order manner to calculate the vertical sum.
Use a hashmap to store the vertical sum at each vertical level.
Recursively traverse the tree and update the vertical sum in the hashmap.
Output the vertical sums in the required format for each test case.
- Q2. What is TCP/IP?
- Ans.
TCP/IP is a set of protocols that governs the way data is transmitted over the internet.
TCP/IP stands for Transmission Control Protocol/Internet Protocol.
It is a suite of communication protocols used to connect devices on the internet.
TCP ensures that data is reliably transmitted between devices.
IP is responsible for addressing and routing data packets across networks.
Examples of TCP/IP protocols include HTTP, FTP, and
Round duration - 30 minutes
Round difficulty - Easy
Experience : Keep confidence and show them good communication skills. Previous round's performance also matters in this rounds
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Interview Questionnaire
1 Question
- Q1. Questions based on tree
Interview Preparation Tips
Experience: Keep your Calm
Tips: Practice matters
Duration: 90 minutes
Total Questions: 30
Round: Interview
Tips: They are not going to eat you.. they will help you out only...
So just go inside the interview room as some of your friends called you to ask some question..relax
Skills: Thinking Process
College Name: IIT GUWHATI
Piyush Raman
Interview Questionnaire
7 Questions
- Q1. Discussion on internship at IBM' Cloud Unit
- Q2. Find LCM of all numbers from 1 to n. Give an algorithm, then correctly estimate the time complexity
- Ans.
Algorithm to find LCM of all numbers from 1 to n and its time complexity
Find prime factors of all numbers from 1 to n
For each prime factor, find the highest power it appears in any number from 1 to n
Multiply all prime factors raised to their highest power to get LCM
Time complexity: O(n*log(log(n)))
- Q3. SQL vs NoSQL. Why NoSQL
- Ans.
NoSQL databases are flexible, scalable, and can handle large amounts of unstructured data.
NoSQL databases are schema-less, allowing for easy and flexible data modeling.
They can handle large amounts of unstructured data, making them suitable for big data applications.
NoSQL databases are highly scalable and can easily handle high traffic and large user bases.
They provide horizontal scalability by distributing data across...
- Q4. Some DBMS designing question relating to Snapdeal website
- Q5. JAVA-Spring and Hibernate
- Q6. Variation of -----/ Given a dictionary of words and a number n. Find count of all words in dictionary that can be formed by given number n
- Ans.
The question asks to find the count of words in a dictionary that can be formed by a given number.
Iterate through each word in the dictionary
Check if the characters in the word can be formed using the given number
Increment the count if the word can be formed
- Q7. Given an array of elements. We can perform following operation only- Increase an array element. Cost of operation is the amount of increment made per array element. Now for a given H, we need to make any H...
Interview Preparation Tips
Experience: I did both coding question ( 1 full and 2nd partial ) and 5 MCQ only and was shortlisted
Tips: Refer to interview sets on Geeksforgeeks.
Do solve both the coding questions first. Not necessary to pass all test cases for both.
Then go for C based o/p questions. At last aptitude.
Duration: 60 minutes
Total Questions: 23
Round: Technical Interview
Experience: I did not know JAVA and DBMS so could not answer any of the last 2 questions. I told him directly thati had no experience in JAVA / DBMS and justified. I had proficiency in Data Structure and Algorithms and I beleive the interviewer liked my internship work on Cloud / Virtualization
Tips: Focus on Data Strucure-Algorithms, JAVA, DBMS, Puzzles
Round: Test
Experience: All repeated questions from previous interviews.
Tips: Refer interview set from geeksforgeeks.org
Duration: 60 minutes
Total Questions: 3
Round: Technical Interview
Experience: For the first question, I started by exponential solution and reduced it to polynomial. We
discussed various approaches and tried a variety of methods and after
1-1.5 hrs of discussion finally ended up with an O(1) solution with some
pre-processing overhead. After achiveing O(1) time complexity, he asked
to further optimize the space complexity.
Usage of Trie / TST. Internal Implementation of Hashing structure and replacing the hashing mechanism using Trie / TST.
Tips: Focus on Tree, Stacks, Queue, Linked List, Hash Maps, Trie, Hashing, String Algorithms, Ternary Search Tree
Round: HR Interview
Experience: Typical HR
General Tips: Practice programming
Skill Tips: Focus on Data Structure-Algorithms and programming in either C++ / JAVA
Skills: Data Structure, Algorithms, Programing, JAVA, DBMS
College Name: Indian Institute of Information Technology, Design and Manufacturing, Jabalpur
Motivation: -
Funny Moments: -
Skills evaluated in this interview
Interview Questionnaire
16 Questions
- Q1. Lowest Common Ancestor of two nodes in binary tree.I wrote code for this.Then interviewer drew a tree and asked to print stacktrace on it
- Ans.
Finding lowest common ancestor of two nodes in binary tree
Traverse the tree from root to both nodes and store the paths in separate arrays
Compare the paths to find the last common node
Return the last common node as the lowest common ancestor
Use recursion to traverse the tree efficiently
- Q2. You are given two ropes.Each rope takes exactly 1 hour to burn. How will you measure period of 45 minutes
- Q3. Singleton Design pattern
- Q4. Two linked list are merging at a point.Find merging point
- Ans.
To find the merging point of two linked lists
Traverse both linked lists and find their lengths
Move the pointer of the longer list by the difference in lengths
Traverse both lists simultaneously until they meet at the merging point
- Q5. Reverse linked list without recursion
- Ans.
Reverse a linked list iteratively
Create three pointers: prev, curr, and next
Initialize prev to null and curr to head
Loop through the list and set next to curr's next node
Set curr's next node to prev
Move prev and curr one step forward
Return prev as the new head
- Q6. Number of rectangles in MxN matrix
- Ans.
The number of rectangles in an MxN matrix can be calculated using a formula.
The formula is (M * (M + 1) * N * (N + 1)) / 4
The matrix can be divided into smaller sub-matrices to count the rectangles
The number of rectangles can also be calculated by counting all possible pairs of rows and columns
- Q7. All anagrams of a string.He called it anagram but i think he wanted to ask all possible substrings of a string
- Q8. Which Design patterns you have used.I said Decorator,Factory,Singleton.Then he asked about Decorator design pattern
- Q9. Tell me about yourself.Then by looking at my resume he said you don’t have hands on experience in Java as i was working in php.I said though i don’t have hands on experience but i am good in programming an...
- Q10. There is four digit number in aabb form and it is a perfect square.Find out the number
- Ans.
The number is 7744.
The number must end in 00 or 44.
The square root of the number must be a whole number.
The only possible number is 7744.
- Q11. You have a deck of 10 cards.You take one card out and put it on table and put next card in the end of deck.You repeat this sequence till all cards are on the table.Sequence formed on the table is 1,2,3,4,...
- Q12. Same tell me about yourself
- Ans.
I am a software developer with experience in multiple programming languages and a passion for problem-solving.
Proficient in Java, Python, and C++
Experience with web development using HTML, CSS, and JavaScript
Familiarity with agile development methodologies
Strong problem-solving and analytical skills
Passionate about learning new technologies and staying up-to-date with industry trends
- Q13. There is a file which contains ip addresses and corresponding url. Example 192.168.1.15 www.abc.com 10.255.255.40 ----- You have to return the subnet mask of the ip and the url after “www.” Output 192.1...
- Ans.
Java function to return subnet mask of IP and URL after www.
Read the file and store IP addresses and URLs in separate arrays
Use regex to extract subnet mask from IP address
Use substring to extract URL after www.
Return subnet mask and URL as separate strings
- Q14. 3 mislabeled jar puzzle.Since i had heard this puzzle many times,i answered it in 2-3 minutes.He said i can make out that you have heard this puzzle already ;)
- Q15. What are inner join and outer join in sql
- Ans.
Inner join returns only the matching rows between two tables, while outer join returns all rows from one table and matching rows from the other.
Inner join combines rows from two tables based on a matching column.
Outer join returns all rows from one table and matching rows from the other.
Left outer join returns all rows from the left table and matching rows from the right table.
Right outer join returns all rows from the...
- Q16. A linked list contains loop.Find the length of non looped linked list
- Ans.
To find the length of non-looped linked list, we need to traverse the list and count the number of nodes.
Traverse the linked list using a pointer and count the number of nodes until the end of the list is reached.
If a loop is encountered, break out of the loop and continue counting until the end of the list.
Return the count as the length of the non-looped linked list.
Interview Preparation Tips
Experience: 3.You have a deck of 10 cards.You take one card out and put it on table and put next card in the end of deck.You repeat this sequence till all cards are on the table.Sequence formed on the table is 1,2,3,4,5…10. What was the original sequence of card.After doing some exercise i answered 1,6,2,10,3,7,4,9,5,8.Then he asked me to write a function for this which takes a number and return the array.
Skills: Algorithm, Java, OOP, data structure
College Name: NA
Skills evaluated in this interview
Interview Preparation Tips
Experience: Online Test-21 (MCQ) +2 (Coding) in 1 hr. Test conducted on hackerrank21 MCQ had almost 10 aptitude and 11 C output based questions.
Give preference to coding questions. Try to solve both questions ( Pass all test cases for one of the questions and do attempt the other question ( even brute force would pass many test cases )
Aptitude can’t be solved just within a minute. Solve C o/p based questions first.Questions-
1. Overlapping paintings, find no. of paintings that can be seen distinctly, extreme co-ordinates of paintings are given. Ordering of paintings matter. ( Assume heights of all paintings are same, start and end coordinates are given )E.g.
5
1 4
2 6
3 4
8 10
7 10
XXXX
XXXXXX
XX
XXX <- This painting is hidden completely
XXXX Simple O(N^2) solution. Starting from rightmost painting, check if it completely hides any painting or not based on start and end coordinates. ( modification of interval selection problem )2- Given points of two lines segments A(x1,y1 x2,y2) & B(x3,y3 x4,y4) find whether the 2 segments intersect or not.
Simpler approach ( short code )-
-----?module=Static&d1=tutorials&d2=geometry2#line_line_intersectionLength / complicated soln-
----- cut-off -
I solved 2nd question and passed 1 test case for first question ( misunderstood the question during online round !! :p ) and solved 4 MCQ's only ( all fluke )
So my advice, do solve both coding questions for sure and solve C o/p questions in last 15 min
Duration: 60 minutes
Round: Technical Interview
Experience: Avg 20-30 mins. 22 shortlisted
My went on for 1 hr to 1hr 15 minsInternship based dicussion (20-30 mins ). Based on Cloud, Virtualization, Networking
Q1- Given N, find LCM from of all numbers from 2 to N. Give the complexity expressed in the form of Number of prime numbers <= N. Had to be really precise in terms of complexity ( in terms of prime factors, maximum recurrences, each recurrence complexity ). Long dicussion on complexity. Don't say any method whose complexity you cannot prove. (E.g saying that i can use Sieve of Eratosthenes for prime pre-processing will lead to question of complexity of Sieve which is O( Log LogN), that cannot be proved trivally. ) So avoid using any such termsQ3- Spring / Hibernate in JAVA
Told him i work in C/C++ only. No experience in JAVAQ2- Types of SQL- NoSQL and SQL(Relational DBMS ). Why the need of NoSQL- Big Data AnalyticsQ3- How would you design DBMS for Snapdeal's website's shoe section.
Now if you want to further break it into Sports and Casual Shoe would you break the DB into two or add another entity ? Full justificdation
I initially answered with a multi-level indexed structure for DBMS storage. Could not answer on the second part of the question. He asked if i knew DBMS and i told him I do not know DBMS. He skipped the question and ended the interview. Told him i had advanced DBMS lab in my course currenlty and would learn it before graduating.
Round: Puzzle Interview
Experience: Q1- -----/
Q2- -----/
Q3- ----- was the first one to solve all 3 in 45 mins roughly and went for next interview. Shortlisting criteria- 2 questions in 1 hr – 1hr 15 mins even though they said that we had 2 hrs to solve all 3 questions !!
Round: Technical Interview
Experience: 4 shortlisted. This round went for almost 1hr 45 min - 2 hrs for me since I solved the Round 2 question earliest. Other 3 had almost 45 mins interview.Q1- Variation of
-----/
Given a dictionary of words and a number n. Find count of all words in dictionary that can be formed by given number n.
I started by exponential solution and reduced it to polynomial. We discussed various approaches and tried a variety of methods and after 1-1.5 hrs of discussion finally ended up with an O(1) solution with some pre-processing overhead. After achiveing O(1) time complexity, he asked to further optimize the space complexity.
Usage of Trie / TST. Internal Implementation of Hashing structure and replacing the hashing mechanism using Trie / TST.Q2- Given an array of elements. We can perform following operation only- Increase an array element. Cost of operation is the amount of increment made per array element. Now for a given H, we need to make any H ( not necessarily consecutive ) elements of array equal with minimum cost.E.g.
N=6, H=4
2 3 5 6 4 4changes to -> 4 4 5 6 4 4
Cost is ( 4-2 + 4-3 = 3 )N=6, H=3
2 3 5 6 4 4changes to -> 2 4 5 6 4 4
Cost is ( 4-3 = 1 )
Optimal complexity- O(N)
Round: HR Interview
Experience: 3 shortlistedTypical HR round.I would like to thank geeksforgeeks for a exhaustive set of interview questions and study material on data structures-algorithms.
College Name: NA
Interview Preparation Tips
Experience: First round was a simple round which involved 10 multiple choice questions and 3 coding questions on hackerrank platform.
Round: Technical Interview
Experience: Mainly on topics like networks, data structures and algorithms, operating systems. The interviewers looked for people who have had prior experience in web development and asked questions regarding web development in depth too.
Tips: I recommend everyone to read the book titled, 'Cracking the Coding Interview' as it was helpful in my approach to an interview.
General Tips: The one major thing that would give you the edge in joining Myntra would definitely be exposure to web development. Since it is not a part of the curriculum , it's all the more important for you to familiarize yourself with web development. In fact, a few projects in the same field would put you in a very advantageous position to get the job.
Skill Tips: 1. Start your placement preparations well ahead, no point regretting later.
2. Keep a concise resume. Do not take your resume to several pages.
3. Do not neglect aptitude preparation. Many people do this mistake and end up not clearing the first round for several companies.
4. Be thorough with your basics across all subjects. (Do not neglect any subject, even they you may like a few and dislike the others.)
5. Keep in mind, the interviewers are really friendly and try to make sure that you're not nervous during the interview. All they want to do is to test you. Be confident and give it your best shot.
Skills:
College Name: NIT Surathkal
Tokopedia Interview FAQs
Some of the top questions asked at the Tokopedia Android App Developer interview -
Recently Viewed
INTERVIEWS
Hummingbird Web Solutions
No Interviews
SALARIES
Invenio Business Solutions
SALARIES
Truminds Software Systems
SALARIES
Truminds Software Systems
INTERVIEWS
Tokopedia
No Interviews
LIST OF COMPANIES
Navyug Infosolutions
Locations
INTERVIEWS
Truminds Software Systems
No Interviews
LIST OF COMPANIES
Invenio Business Solutions
Overview
SALARIES
ZF India Technology Center
SALARIES
Navyug Infosolutions
Tell us how to improve this page.
Tokopedia Interviews By Designations
- Tokopedia Software Engineer Interview Questions
- Tokopedia Data Analyst Interview Questions
- Tokopedia Software Developer Interview Questions
- Tokopedia Senior Software Engineer Interview Questions
- Tokopedia Technical Architect Interview Questions
- Tokopedia Associate Product Manager Interview Questions
- Tokopedia Software Engineer Intern Interview Questions
- Tokopedia Lead Interview Questions
- Show more
Interview Questions for Popular Designations
- Android Developer Interview Questions
- Senior Android Developer Interview Questions
- Android Developer Intern Interview Questions
- Android Engineer Interview Questions
- Senior Android Application Developer Interview Questions
- Android Mobile Application Developer Interview Questions
- Android Team Lead Interview Questions
- android and Flutter Developer Interview Questions
- Show more
Interview Questions from Similar Companies
Fast track your campus placements
|
Software Engineer
138
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Senior Software Engineer
53
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Technical Architect
21
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Data Scientist
18
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Software Developer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
OLX
Flipkart
Snapdeal
Paytm Mall
- Home >
- Interviews >
- Tokopedia Interview Questions >
- Tokopedia Android App Developer Interview Questions
