Cogoport Software Developer Interview Questions and Answers for Experienced

Leecode medium level question

Leetcode Hard level Question

Q1. This is cto round asked some interview questions
Add your answer

Computer Fundamentals

Q1. Flatten a binary tree
Ans. 
Flatten a binary tree by converting it into a linked list in-place.
• Use a recursive approach to flatten the binary tree.

• Traverse the tree in a pre-order manner and keep track of the previous node.

• Set the left child of each node to null and the right child to the next node in the linked list.

• Example: Input: 1 -> 2 -> 5 -> 3 -> 4 -> null, Output: 1 -> null -> 2 -> null -> 3 -> null -> 4 -> null -> 5 -> null
Answered by AI
Add your answer

- simple basic ios questions

Q1. Asked DSA array questions
Add your answer

Kadance algorithm and find the middle of the linklist

More on java and Python based coding questions

Q1. Behavioural questions were asked
Add your answer
Q2. What are your expectations from this job
Add your answer
Q3. What are your plans ahead
Add your answer
Q4. Where do you see yourself in 5 years ahead
Add your answer

Easy to medium, can solve with leetcode medium

Q1. Number of islands count
Ans. 
Count the number of islands in a 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 found

• Ensure to handle boundary cases and check for visited nodes
Answered by AI
Add your answer
Q2. First and last index of a particular element in an array
Ans. 
Find the first and last index of a specific element in an array of strings.
• Iterate through the array and keep track of the index of the first and last occurrence of the element.

• Return the first and last index once the iteration is complete.

• Example: Array ['apple', 'banana', 'apple', 'orange'], element 'apple' - First index: 0, Last index: 2.
Answered by AI
Add your answer

Q1. Oops Inheritance and Incapsulation
Add your answer