i
Cogoport
Filter interviews by
I applied via Campus Placement and was interviewed in Sep 2023. There were 5 interview rounds.
Was a fairly basic Aptitude test, but time was less so you need to be fast
3 coding questions, 2 were easy and 1 was leetcode medium to hard level. Now that 1 questions is important, I got an interview by solving both easy and returning 0 in the hard one to pass 2 test cases lol
Sort a linked list
Use a sorting algorithm like merge sort or quick sort to rearrange the nodes in the linked list
Maintain pointers to the current node, previous node, and next node while sorting
Update the head of the linked list after sorting
I applied via Campus Placement
Initially aptitude round, followed by coding test
Not yet completed will update later about my experience.
Print Longest Common Subsequence of a string
Use dynamic programming to find the LCS of two strings
Create a 2D array to store the lengths of LCS for each pair of characters
Trace back through the array to find the actual LCS string
Example: For strings 'ABCBDAB' and 'BDCAB', the LCS is 'BCAB'
Good HackerRank Question
The left view of a tree shows the nodes that are visible when looking at the tree from the left side.
Traverse the tree in a level order manner
Keep track of the first node encountered at each level
Add the first node at each level to the result array
posted on 13 Mar 2024
I appeared for an interview before Mar 2023.
Use a greedy algorithm to send the office bus to all locations in the city efficiently.
Start from the office location and pick the nearest location to visit next.
Continue picking the nearest unvisited location until all locations are covered.
Repeat the process until all locations are visited.
Consider using Dijkstra's algorithm or a similar approach for finding the nearest location.
Optimize the route by considering traf
posted on 19 Nov 2024
I applied via Referral and was interviewed before Nov 2023. There were 2 interview rounds.
The basic questions asked in an interview .
DP, graph, and array questions asked in 2nd round also asked my company project
posted on 23 Aug 2024
My name is John Smith.
Full name is John Smith
Common name in English-speaking countries
No middle name or initial
In my free time, I enjoy hiking, playing video games, and learning new programming languages.
Hiking in local trails and national parks
Playing video games like Overwatch and Minecraft
Learning new programming languages like Python and JavaScript
Asked about schema for ecommerce and a coding question
I applied via Approached by Company and was interviewed before Oct 2023. There were 2 interview rounds.
Dynamic Programming problem involving finding the maximum sum of non-adjacent elements in an array.
Use dynamic programming to keep track of the maximum sum at each index.
At each index, the maximum sum is either the current element plus the sum two indices back, or the sum at the previous index.
Example: For array [2, 4, 6, 2, 5], the maximum sum of non-adjacent elements is 13 (2 + 6 + 5).
Find the longest common prefix among an array of strings.
Iterate through the characters of the first string and compare with other strings
Return the prefix when characters don't match or reach end of any string
Example: Input - ['flower', 'flow', 'flight'], Output - 'fl'
LRU cache is a data structure that stores the most recently used items.
Use a doubly linked list to keep track of the order of items based on their usage.
Use a hashmap to quickly access items in the cache.
When a new item is accessed, move it to the front of the linked list.
If the cache is full, remove the least recently used item from the end of the linked list.
based on 3 interviews
Interview experience
based on 5 reviews
Rating in categories
Key Account Manager
231
salaries
| ₹4 L/yr - ₹10 L/yr |
Associate Software Engineer
110
salaries
| ₹7 L/yr - ₹15 L/yr |
Software Engineer
83
salaries
| ₹7 L/yr - ₹20 L/yr |
Product Manager
81
salaries
| ₹20 L/yr - ₹35 L/yr |
Software Developer
70
salaries
| ₹7.5 L/yr - ₹20 L/yr |
Freight Tiger
BlackBuck
FarEye
Delhivery