Faster and better experience!
i
Cogoport
Filter interviews by
I applied via campus placement at Indian Institute of Technology (IIT), Mumbai and was interviewed in Dec 2022. There were 4 interview rounds.
2 questions dsa based
Top trending discussions
I was interviewed before Jun 2016.
I have the ability to handle pressure effectively.
I remain calm and focused in high-pressure situations.
I prioritize tasks and manage my time efficiently.
I seek support and guidance from team members when needed.
I maintain a positive attitude and adapt to changing circumstances.
I have successfully completed projects under tight deadlines.
I applied via Referral and was interviewed in Apr 2024. There were 5 interview rounds.
2 dsa questions of easy/medium
Leecode medium level question
Leetcode Hard level Question
I applied via campus placement at Indian Institute of Technology (IIT), Roorkee and was interviewed before Sep 2020. There was 1 interview round.
posted on 13 Jun 2021
I applied via Naukri.com and was interviewed before Jun 2020. There were 3 interview rounds.
posted on 27 Jan 2017
I was interviewed in Dec 2016.
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
I applied via Internshala and was interviewed in Dec 2023. There were 2 interview rounds.
Easy to medium, can solve with leetcode medium
Count the number of islands in a grid of '1's and '0's
Iterate through the grid and for each '1' encountered, perform a depth-first search to mark all connected '1's as visited
Increment the island count for each new island found
Ensure to handle boundary cases and check for visited nodes
Find the first and last index of a specific element in an array of strings.
Iterate through the array and keep track of the index of the first and last occurrence of the element.
Return the first and last index once the iteration is complete.
Example: Array ['apple', 'banana', 'apple', 'orange'], element 'apple' - First index: 0, Last index: 2.
based on 1 interview
Interview experience
Key Account Manager
226
salaries
| ₹4 L/yr - ₹10 L/yr |
Associate Software Engineer
110
salaries
| ₹7 L/yr - ₹15 L/yr |
Software Engineer
81
salaries
| ₹7 L/yr - ₹19.1 L/yr |
Product Manager
74
salaries
| ₹20 L/yr - ₹35 L/yr |
Software Developer
70
salaries
| ₹7.5 L/yr - ₹20 L/yr |
Freight Tiger
BlackBuck
FarEye
Delhivery