i
GoComet
Filter interviews by
I applied via Referral and was interviewed in Oct 2024. There were 2 interview rounds.
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
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
I appeared for an interview in Mar 2021.
Round duration - 90 minutes
Round difficulty - Easy
Timing was 10:00 AM. Platform was good.
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...
Given an array of integers, find a subarray with a given sum S.
Iterate through the array while keeping track of the current sum and start index.
Use a hashmap to store the sum and its corresponding index.
If the current sum - S is found in the hashmap, a subarray with sum S exists.
Return the start index and current index as the end index.
Given a string S, your task is to recursively remove all consecutive duplicate characters from the string.
String S
Output string
Recursively remove consecutive duplicate characters from a string.
Use recursion to check if the current character is the same as the next character, if so skip the next character
Base case: if string length is 1, return the string
Example: Input: 'aabbc' Output: 'abc'
Tip 1 : Practice Data structure questions.
Tip 2 : Do some projects.
Tip 3 : Have knowledge of DBMS.
Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume.
Coding test in any language
Any topics for the GD
A palindrome is a word, phrase, number, or other sequence of characters that reads the same forward and backward.
Check if the input string is equal to its reverse
Ignore spaces and punctuation when checking for palindromes
Convert the input string to lowercase for case-insensitive comparison
I applied via Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.
A peak element in an array is an element that is greater than or equal to its neighbors.
Iterate through the array and check if the current element is greater than its neighbors.
If the element at index i is greater than or equal to elements at indices i-1 and i+1, it is a peak element.
Example: ['1', '3', '2', '4', '1'] has peak elements at index 1 and 3.
Rotate a 2D array by 90 degrees clockwise
Transpose the array
Reverse each row of the transposed array
Pollitices current generation
I applied via Campus Placement and was interviewed in Sep 2023. There were 4 interview rounds.
1st round we had 3 coding question that has to be written(Easy,Medium,Hard)
We had Gd with self intro
I applied via Recruitment Consulltant and was interviewed before May 2023. There were 2 interview rounds.
DSA coding easy ,time complexity,space complexity
Written Coding Test - Arrays, Matrix in any language
GD is Group Discussion only shortlisted students will attend GD Round
I applied via LinkedIn and was interviewed in Feb 2021. There were 5 interview rounds.
posted on 6 Jan 2025
I applied via LinkedIn and was interviewed in Dec 2024. There were 2 interview rounds.
Based on JavaScript and Java.
A task based on JavaScript.
based on 2 interviews
Interview experience
based on 1 review
Rating in categories
Inside Sales Executive
8
salaries
| ₹6 L/yr - ₹8.5 L/yr |
Customer Success Manager
7
salaries
| ₹7 L/yr - ₹12.5 L/yr |
Sales Development Representative
7
salaries
| ₹6.5 L/yr - ₹8.5 L/yr |
Software Development Engineer II
7
salaries
| ₹15 L/yr - ₹17.6 L/yr |
Senior Customer Success Manager
7
salaries
| ₹8.5 L/yr - ₹10.5 L/yr |
NexTurn
Kanerika Software
Smarter BIZ Technologies
Nxtra Data