i
Cogoport
Filter interviews by
I applied via Campus Placement and was interviewed in Sep 2023. There were 5 interview rounds.
Easy questions but less time
2 easy and 1 hard leet code
Reverse a linked list
Iterate through the linked list and reverse the pointers
Use three pointers - prev, current, next to reverse the links
Update the head of the linked list to the last node after reversing
I applied via Campus Placement and was interviewed before Mar 2023. There were 4 interview rounds.
Basic Apti and Behavioural Online Round 15-30 minutes
1.5 hrs long. 3 Problems Easy to Medium
Merge Sort is a divide and conquer algorithm that divides the input array into two halves, sorts them separately, and then merges them.
Divide the array into two halves recursively
Sort each half separately using merge sort
Merge the sorted halves back together
I was interviewed before Oct 2023.
1 hour long time in hyper loop
Singularity is not a point in space, it is a moment in time.
I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.
Basic questions that anyone could answer
O(N) questions, questions like string reversal etc…
Cogoport interview questions for designations
I applied via Campus Placement and was interviewed in Dec 2021. There was 1 interview round.
Find all numbers whose consecutive digits differ by 1
Iterate through all numbers and check if consecutive digits differ by 1
Start with 12 and increment by 1 until 98
Add the number to the result array if it satisfies the condition
I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.
Design a stack that supports getmin in O(1) time and O(1) space complexities.
Use two stacks, one for storing the actual values and the other for storing the minimum values.
When pushing a new value, check if it is smaller than the current minimum value and push it to the minimum stack if it is.
When popping a value, check if it is the current minimum value and pop it from the minimum stack if it is.
To get the minimum val...
Binary tree traversal is the process of visiting each node in a binary tree exactly once in a specific order.
There are three main types of binary tree traversal: inorder, preorder, and postorder.
Inorder traversal visits the left subtree, then the root, then the right subtree.
Preorder traversal visits the root, then the left subtree, then the right subtree.
Postorder traversal visits the left subtree, then the right subt...
LRU cache is a data structure that stores the most recently used items and discards the least recently used items.
LRU stands for Least Recently Used
It has a fixed size and when the cache is full, the least recently used item is removed to make space for a new item
It uses a combination of a doubly linked list and a hash map to achieve O(1) time complexity for both insertion and deletion
Example: A web browser cache that ...
I applied via Recruitment Consultant and was interviewed in May 2020. There were 3 interview rounds.
Diameter of a binary tree is the longest path between any two leaf nodes.
Calculate the height of left and right subtrees recursively.
Calculate the diameter recursively using the formula max(left_height + right_height + 1, max(left_diameter, right_diameter)).
Return the maximum diameter.
To find interchanged terms from an AP series
Identify the common difference between terms
Swap the positions of adjacent terms
Check if the new series is also an AP
Repeat until no more interchanged terms can be found
Database indexing is a technique to improve the performance of database queries.
Indexing creates a data structure that allows for faster retrieval of data.
Indexes are created on one or more columns of a table.
Queries that use indexed columns can be executed faster.
Indexes can be clustered or non-clustered.
Clustered indexes determine the physical order of data in a table.
Non-clustered indexes create a separate structure...
Leecode medium level question
Leetcode Hard level Question
posted on 24 Oct 2024
Count the number of islands in a given 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 encountered.
Consider edge cases like grid boundaries and handling visited cells.
posted on 24 Dec 2022
I applied via Naukri.com and was interviewed before Dec 2021. There were 4 interview rounds.
Matrix rotation and counting 0 and 1's.
based on 6 interviews
2 Interview rounds
based on 8 reviews
Rating in categories
Key Account Manager
226
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
110
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
81
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
81
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
70
salaries
| ₹0 L/yr - ₹0 L/yr |
Freight Tiger
BlackBuck
FarEye
Delhivery