Toluna India Pvt. Ltd. interview experience Real time questions & tips from candidates to crack your interview
Survey Programmer
Toluna India Pvt. Ltd.
3 rounds | 8 Coding
problems
Selected Interview preparation journey
Journey
Hi,
I graduated in 2019 in mechanical engineering. I was preparing for ssc exams but after 2 unsucessfull attempts . I gave up and started searching for different ways to enter it industry , i was very confused in the begininng and tried all sorts of different courses , then one day upon randomly scrolling you tube i came across the you tube channel of coding ninjas , I tookup their DSA with Java course but dropped out of the course since i was not able to see any job prospects of doing the course at that time, then i came across their carrer camp programme the good part about this programme was that we get to learn from scratch each and every thing from the industry experts like Ankush Sir , he himself helped in the difficulties we faced during the course. I personally would like to give all the credit to coding ninjas for equipping me with the industry standards like frontend with react.js and backend with node.js also their DSA and java module equipped me with some exceptional skills that i even use till date in my current company. I did the carrer camp completely did all the projects and passed all the skill test after that I my placment journey started , like all other students i also faced a lot of rejections but i did not let those rejections demotivate me instead i used them as a learning . I also made a list of questions that i was not able to answer in all the interviews that i was not able to crack then in september 2022 i gave the written test for toluna , after that i gave 2 rounds of interview and got the call from CN in October mid that i was selected. After all the grinding I was finally able to land a job in devlopment. At last I would like to thank coding ninjas , all the mentors and placment team of coding ninjas for helping me and assisting me in each and every step of the process.
Application story
There was 3 rounds.
Fist round was a aptitude test on cocubes.
Second round was HR Round.
Third and final round was technical round.
Why selected/rejected for the role?
I had prepared for DSA well , basic javascript and aptitude that helped a lot in passing all the rounds.
I did all the modules of javascript from Coding ninjas also i studied from akshay saini's you tube channel for advanced javascript.
Preparation
Duration: 6 months
Topics: OOPS, Linked List, Recursion, Trees, Arrays, Dynamic Programming, Graphs, Frontend web Development , HTML, CSS, Javascript, Node.js
Tip 1 : Do all the modules within the given time frame.
Tip 2 : Follow the advice of the Mentors that take weekly sessions for every topic
Tip 3 : Complete all the projects without copy-pasting from others as copy-pasting may help you in clearing a skill test but it wont help you in clearing any interview.
Application process
Where: Campus
Eligibility: 7 CGPA
Tip 1 : Mention all the projects on your resume.
Tip 2 : Attatch the links of all the projects that show a live demo of your project, try making short videos on how you made that project, why you choose a particular techstack.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date3 Oct 2022
Coding problem3
Timing : 90 minutes
Total Questions : 60
Type of questions : Aptitude Questions medium level
1. Puzzle
A runner can complete a 750 m race in two and a half minutes. Will he be able to beat another runner who runs at 17.95 km/hr?
Problem approach
We are given that the first runner can complete a 750 m race in 2 minutes and 30 seconds or 150 seconds.
=> Speed of the first runner = 750 / 150 = 5 m / sec
We convert this speed to km/hr by multiplying it by 18/5.
=> Speed of the first runner = 18 km / hr
Also, we are given that the speed of the second runner is 17.95 km/hr.
Therefore, the first runner can beat the second runner.
2. Puzzle
A bag contains 50 p, 25 p, and 10 p coins in the ratio 2: 5 : 3, amounting to Rs. 510. Find the number of coins of each type.
Problem approach
Let the common ratio be 100k.
Number of 50 p coins = 200 k
Number of 25 p coins = 500 k
Number of 10 p coins = 300 k
Value of 50 p coins = 0.5 x 200 k = 100 k
Value of 25 p coins = 0.25 x 500 k = 125 k
Value of 10 p coins = 0.1 x 300 k = 30 k
=> Total value of all coins = 100 k + 125 k + 30 k = 255 k = 510 (given)
=> k = 2
Therefore, Number of 50 p coins = 200 k = 400
Number of 25 p coins = 500 k = 1000
Number of 10 p coins = 300 k = 600
3. Puzzle
Find the probability of getting a red card when a card is drawn from a well shuffled pack of cards.
Problem approach
Total number of outcomes = 52 Number of favorable outcomes = Number of red cards = 26 => Required probability = 26 / 52 = 0.50
02
Round
Easy
HR Round
Duration20 minutes
Interview date7 Oct 2022
Coding problem1
Timing : 20 minutes
How was the environmeint : The interviewer was a very chill guy. He asked me abut myself kinda short intro of myself.
1. Basic HR Questions
Introduction of myself
What are your strengths?
What are your weakness?
Problem approach
Tip 1 : Be confident
Tip 2 : Be as honest as possible
Tip 3 : Be bold
03
Round
Easy
Video Call
Duration45 minutes
Interview date13 Oct 2022
Coding problem4
Duration of round : 45 minutes
2 coding questions were asked - 15 mins for each question
2 aptitude question were asked - 10 mins total for both the questions
In the end they asked me wether I wanted to ask any questions or not , I asked about the tech stack being used
1. Reverse the String
Easy
15m average time
85% success
0/40
Asked in companies
You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.
For example:
If the given string is: STR = "abcde". You have to print the string "edcba".
follow up:
Try to solve the problem in O(1) space complexity.
Problem approach
1) Initialize start and end indexes as start = 0, end = n-1
2) Swap arr[start] with arr[end]
3) Recursively call reverse for rest of the array.
2. Pair Sum
Easy
15m average time
90% success
0/40
Asked in companies
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to return the list of all pairs of elements such that each sum of elements of each pair equals 'S'.
Note:
Each pair should be sorted i.e the first value should be less than or equals to the second value.
Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.
Problem approach
Follow the steps below to solve the given problem:
Sort the array arr[] in increasing order.
Loop from i = 0 to N-1.
Find the index of the first element having value same or just greater than (sum – arr[i]) using lower bound.
Find the index of the first element having value just greater than (sum – arr[i]) using upper bound.
The gap between these two indices is the number of elements with value same as (sum – arr[i]).
Add this with the final count of pairs.
Return the final count after the iteration is over.
3. Puzzle
From a bag containing red and blue balls, 10 each, 2 balls are drawn at random. Find the probability that one of them is red and the other is blue.
Problem approach
Total number of outcomes = 20 C 2 = 190 Number of favorable outcomes = 10 C 1 x 10 C 1 = 100 Therefore, required probability = 100 / 190 = 10 / 19
4. Puzzle
A 100 m long train moving at a speed of 60 km/hr passes a man standing on the pavement near a railway track. Find the time taken by the train to pass the man.
Problem approach
Length of the train = 100 m = 0.1 km
Speed of the train = 60 km / hr
So, the time taken by the train to pass the man = time taken to cover 0.1 km at the speed of 60 km/hr
Therefore, time taken by the train to pass the man = 0.1 / 60 hour = (0.1 / 60) x 3600 sec = 6 sec
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
Survey Programmer
3 rounds | 12 problems
Interviewed by Toluna India Pvt. Ltd.
Selected 
545 views
0 comments
0 upvotes
Survey Programmer
2 rounds | 4 problems
Interviewed by Toluna India Pvt. Ltd.
Selected 620 views
0 comments
0 upvotes
Survey Programmer
3 rounds | 10 problems
Interviewed by Toluna India Pvt. Ltd.
Selected 607 views
0 comments
0 upvotes
Web Developer
2 rounds | 2 problems
Interviewed by Toluna India Pvt. Ltd.
Selected 287 views
0 comments
0 upvotes