GoComet Interview Questions, Process, and Tips

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