GoComet Software Developer Interview Questions and Answers

There was an OA on hackerearth of an hour. In that there were 20 MCQs and two DSA questions easy to medium on Heap, Hashmap and Subarray

Q1. Asked about previous worked project in last company
Add your answer
Q2. Asked one medium DSA question (DNA sequencing) and asked to design some schema
Add your answer
Q3. Asked one puzzle If there are 1000 bottles and one is poisonous, a rat will diw after one hour of drinking and you have only one hour to find out which bottle is poisonous, How many minimum rats you need ?
Add your answer

Q1. One Puzzle to detect Defective Box
Add your answer
Q2. Previous Work Experience
Ans. 
I have 3 years of experience as a Software Developer at XYZ company.
• Developed web applications using Java and Spring framework

• Collaborated with cross-functional teams to deliver projects on time

• Implemented new features and enhancements based on client requirements
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Timing was 10:00 AM. Platform was good.

Q1. 
Subarray With Given Sum Problem Statement
Given an array ARR of N integers and an integer S, determine if there exists a contiguous subarray within the array with a sum equal to S. If such a subarray exis...read more
Ans. Bruteforce Approach
• In this approach, we will traverse all the subarrays and for each subarray, we will check whether the sum of the elements of the subarray matches with the given sum.
• To traverse all the subarrays we will use two nested loops.
• The outer loop will select the start index and the inner loop will fix the end index of the subarray. While incrementing the inner pointer(inner loop pointer) we will also maintai...read more
Answered Anonymously
Add your answer
Q2. 
Remove Consecutive Duplicates Problem Statement
Given a string S, your task is to recursively remove all consecutive duplicate characters from the string.
Input:
String S
Output:
Output string
Constr...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered Anonymously
Add your answer