Cogoport SDE Interview Questions and Answers

Good HackerRank Question

Q1. 2 sum Array question
Add your answer
Q2. Left View of a tree
Ans. 
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
Answered by AI
Add your answer

Q1. Questions on Django middleware, models and queries
Add your answer

Q1. Design an algorithm to efficiently to send office bus to all location in the city
Ans. 
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
Answered by AI
Add your answer

Q1. Round with CTO, mostly behavioural and expected pay
Add your answer

The basic questions asked in an interview .

DP, graph, and array questions asked in 2nd round also asked my company project

Q1. Tell what is your name
Ans. 
My name is John Smith.
• Full name is John Smith

• Common name in English-speaking countries

• No middle name or initial
Answered by AI
Add your answer
Q2. What do you do in free time
Ans. 
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
Answered by AI
Add your answer

Asked about schema for ecommerce and a coding question

Q1. DSA ROUND - DP problem
Ans. 
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).
Answered by AI
Add your answer
Q2. DSA ROUND - STRING PROBLEM
Ans. 
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'
Answered by AI
Add your answer

Q1. PROJECT RELATED QUESTIONS
Add your answer
Q2. DESIGN LRU CACHE
Ans. 
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.
Answered by AI
Add your answer