Filter interviews by
posted on 27 Jan 2017
I appeared for an interview in Dec 2016.
I applied via LinkedIn and was interviewed before Feb 2023. There were 2 interview rounds.
- simple basic ios questions
I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.
Kadance algorithm and find the middle of the linklist
More on java and Python based coding 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
I applied via Referral and was interviewed in Oct 2023. There were 4 interview rounds.
NEED TO QUALIFY IN THIS TEST
NEED TO QUALIFY THIS TEST ALSO
Leecode medium level question
Leetcode Hard level Question
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
Computer Fundamentals
Flatten a binary tree by converting it into a linked list in-place.
Use a recursive approach to flatten the binary tree.
Traverse the tree in a pre-order manner and keep track of the previous node.
Set the left child of each node to null and the right child to the next node in the linked list.
Example: Input: 1 -> 2 -> 5 -> 3 -> 4 -> null, Output: 1 -> null -> 2 -> null -> 3 -> null -> 4 -> null -> 5 -> null
Relationship Manager
24
salaries
| ₹3 L/yr - ₹7.5 L/yr |
Inside Sales Specialist
20
salaries
| ₹3 L/yr - ₹5 L/yr |
Customer Success Specialist
17
salaries
| ₹2.4 L/yr - ₹3.8 L/yr |
Operations Analyst
17
salaries
| ₹2.4 L/yr - ₹3.6 L/yr |
Product Manager
15
salaries
| ₹7 L/yr - ₹30.1 L/yr |
Practo
Cogoport
MagicPin
InsanelyGood