Filter interviews by
Clear (1)
I applied via Referral and was interviewed in Jan 2024. There were 4 interview rounds.
Machine Coding of Google Calendar
Machine Coding of MP3 Player
Find duplicates in an array of strings
Iterate through the array and store each element in a hash set
If an element is already in the hash set, it is a duplicate
Return a list of all duplicates found
Simpl offers a collaborative and innovative work environment with competitive compensation.
Simpl values teamwork and creativity in software development
Competitive compensation package offered to attract top talent
Opportunities for growth and learning through challenging projects
Top trending discussions
posted on 10 Jan 2025
MVVM was asked and swift questions
I applied via Campus Placement and was interviewed in Jun 2022. There were 5 interview rounds.
50 mcq were asked in 12 mins. Most of the candidates qualified this round.
3 coding questions of basic DSA were asked. Also few mcqs from Operating System, Networking and DBMS.
I applied via Referral and was interviewed before May 2023. There were 3 interview rounds.
2 Codes on Hackerrank
I applied via Naukri.com and was interviewed before Oct 2022. There were 4 interview rounds.
15 minutes test.
50 questions
easy questions
Management , Leadership , Character Type questions
2 coding questions
resume grilling
easy medium questions
I applied via Referral and was interviewed before Feb 2023. There were 2 interview rounds.
45 mins, Basic aptitude , comprehension and decision making questions
I applied via LinkedIn and was interviewed before May 2023. There were 3 interview rounds.
It was leetcode questions for 60 min for 2 questions.
I applied via Campus Placement and was interviewed before Jul 2022. There were 5 interview rounds.
50 questions in 12 minutes mostly test your arthimetic, logical knowledge.
3 coding questions in 90 mins, 1st one is from arrays an easy question, 2nd one is related to stacks and queues relatively harder and last one is hard which i am also unable to attempt. I cracked the first two questions and my solutions passed all the test cases.
Sorting algorithms are methods used to arrange elements in a specific order.
Different sorting algorithms include bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort.
Some algorithms are more efficient than others depending on the size of the data set and the initial order of the elements.
For example, quick sort is generally faster than bubble sort for large data sets.
BFS and DFS are traversal algorithms used in trees. BFS explores level by level, while DFS explores depth first.
BFS (Breadth-First Search) visits nodes level by level, using a queue. Example: traversing a binary tree level by level.
DFS (Depth-First Search) explores as far as possible along each branch before backtracking. Example: in-order traversal of a binary tree.
I applied via Campus Placement and was interviewed before Sep 2022. There were 4 interview rounds.
Question from Array,DP
Medium Leetcode, Array, String, Tree, DP
based on 1 interview
Interview experience
based on 4 reviews
Rating in categories
Software Engineer
30
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Scientist
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer experience Officer
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Product Manager
15
salaries
| ₹0 L/yr - ₹0 L/yr |
LazyPay
ZestMoney
EarlySalary Services
MoneyTap