Cogoport Interview Questions, Process, and Tips

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.

Q1. Difference between sorting algorithms
Ans. 
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.
Answered by AI
View 1 more answer
Q2. BFS and DFS in trees and imlementing them
Ans. 
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.
Answered by AI
Add your answer
Q3. Sql questions and database questions
Add your answer

Q1. Tell me about yourself
Add your answer
Q2. Explain the college life
Add your answer

Personality test + aptitude tes + logical reasoning

Q1. Just random questions on past experience
Add your answer
Q2. Tell me about your self
Add your answer
Q3. What have you heard about cogoport
Add your answer
Q4. Why Key account manager
Add your answer
Q5. What subject i liked most in mba
Add your answer

Easy questions but less time

2 easy and 1 hard leet code

Q1. Reverse the link list
Ans. 
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
Answered by AI
Add your answer
Q2. The Hanoi tower problem was given
Add your answer
Q3. One DP question was given to explain not write
Add your answer

Q1. JEE rank and previous paid internship
Add your answer

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

Q1. They can ask a very easy linked list question or a very hard DP question also depending on your luck and your presentation skills
Add your answer
Q2. Sort the link list
Ans. 
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
Answered by AI
Add your answer

Q1. He will ask your JEE rank and your previous internship experience, but don't worry if you made it to the HR round you are 110% selected
Add your answer