Cogoport Software Development Engineer 1 Interview Questions and Answers

Leecode medium level question

Leetcode Hard level Question

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

Q1. Jump Game - II
Add your answer
Q2. Number of Island
Ans. 
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.
Answered by AI
Add your answer

Q1. Framework related questions.
Add your answer
Q2. String palindrome, MySQL queries etc.
Add your answer

Matrix rotation and counting 0 and 1's.

Q1. Salary negotiation and interview feedback.
Add your answer

Q1. Questions on mobile development
Add your answer

Q1. Golang specific question regarding worker pool implementation
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

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