i
Clover Ventures
Filter interviews by
posted on 27 Jan 2017
I was interviewed in Dec 2016.
I applied via Campus Placement and was interviewed in Mar 2023. There were 4 interview rounds.
A Google Form-based Aptitude Test with Basic Questions
It was the final round asked to do a medium-level coding Question to convert a number such as 244 to word i.e Two Hundred and Forty four
I applied via Referral and was interviewed in Sep 2023. There was 1 interview round.
Merge two sorted linked lists into a single sorted linked list
Create a new linked list to store the merged result
Iterate through both input linked lists and compare nodes to determine the order in which they should be merged
Update the next pointers of the nodes in the new linked list accordingly
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
I applied via Instahyre and was interviewed before Sep 2023. There was 1 interview round.
If its for the SDE 1 , mostly they will start with javascript fundamentals and deep dive in the hard topics
I applied via Referral and was interviewed before Apr 2022. There were 3 interview rounds.
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 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.
based on 1 interview
Interview experience
Agronomist
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Accountant
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Supervisor
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
6
salaries
| ₹0 L/yr - ₹0 L/yr |
City Head
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Cogoport
Arzooo.com
Treebo Hotels
KrazyBee