i
Cogoport
Filter interviews by
I applied via Referral and was interviewed before May 2022. There were 4 interview rounds.
Discussion with president of co.
Top trending discussions
I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.
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...
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 ...
posted on 20 Jul 2024
I applied via Walk-in and was interviewed in Jun 2024. There were 3 interview rounds.
Array and stack based lc standard questions
LLD of Payment Systems
My vision is to create innovative software solutions that positively impact people's lives and drive technological advancements.
Developing cutting-edge software applications that improve efficiency and user experience
Utilizing emerging technologies like AI and machine learning to solve complex problems
Collaborating with cross-functional teams to deliver high-quality products
Continuously learning and adapting to stay ah
I applied via Recruitment Consulltant and was interviewed before Aug 2023. There were 2 interview rounds.
The current project follows a microservices architecture with Docker containers for scalability and flexibility.
Microservices architecture is used to break down the application into smaller, independent services that can be developed, deployed, and scaled independently.
Docker containers are utilized for packaging the application and its dependencies into a standardized unit for easy deployment and management.
Service di...
Basic coding questions
I applied via Approached by Company and was interviewed in Aug 2021. There were 3 interview rounds.
Assignment to develop a prototype
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
Will be given Requirement to write code for Restraunt. Based on that have write code for delivering orders by delivery boys.
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 7 Jun 2024
I applied via LinkedIn and was interviewed in May 2024. There was 1 interview round.
Use dynamic programming to find the shortest path sum with negative integers allowed in a matrix.
Implement dynamic programming to store the minimum sum at each cell
Consider negative integers when calculating the sum of the path
Start from the top left cell and iterate through the matrix to find the shortest path sum
based on 1 interview
Interview experience
based on 1 review
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
74
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
70
salaries
| ₹0 L/yr - ₹0 L/yr |
Freight Tiger
BlackBuck
FarEye
Delhivery