i
GoComet
Filter interviews by
Clear (1)
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 was interviewed 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.
Top trending discussions
I applied via Recruitment Consultant and was interviewed in May 2020. There were 3 interview rounds.
Diameter of a binary tree is the longest path between any two leaf nodes.
Calculate the height of left and right subtrees recursively.
Calculate the diameter recursively using the formula max(left_height + right_height + 1, max(left_diameter, right_diameter)).
Return the maximum diameter.
To find interchanged terms from an AP series
Identify the common difference between terms
Swap the positions of adjacent terms
Check if the new series is also an AP
Repeat until no more interchanged terms can be found
Database indexing is a technique to improve the performance of database queries.
Indexing creates a data structure that allows for faster retrieval of data.
Indexes are created on one or more columns of a table.
Queries that use indexed columns can be executed faster.
Indexes can be clustered or non-clustered.
Clustered indexes determine the physical order of data in a table.
Non-clustered indexes create a separate structure...
I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.
Design a stack that supports getmin in O(1) time and O(1) space complexities.
Use two stacks, one for storing the actual values and the other for storing the minimum values.
When pushing a new value, check if it is smaller than the current minimum value and push it to the minimum stack if it is.
When popping a value, check if it is the current minimum value and pop it from the minimum stack if it is.
To get the minimum val...
Binary tree traversal is the process of visiting each node in a binary tree exactly once in a specific order.
There are three main types of binary tree traversal: inorder, preorder, and postorder.
Inorder traversal visits the left subtree, then the root, then the right subtree.
Preorder traversal visits the root, then the left subtree, then the right subtree.
Postorder traversal visits the left subtree, then the right subt...
LRU cache is a data structure that stores the most recently used items and discards the least recently used items.
LRU stands for Least Recently Used
It has a fixed size and when the cache is full, the least recently used item is removed to make space for a new item
It uses a combination of a doubly linked list and a hash map to achieve O(1) time complexity for both insertion and deletion
Example: A web browser cache that ...
Standard dsa questions, easy to medium
I applied via Campus Placement and was interviewed in Sep 2024. There were 3 interview rounds.
Aptitude questions with some basic coding questions
They have given 3 coding questions and some pseudo codings
I applied via Campus Placement and was interviewed in May 2024. There were 4 interview rounds.
70 questions in 90 minutes with 7 sections
Developed a web application for tracking project progress and managing tasks
Used React.js for front-end development
Implemented RESTful APIs using Node.js and Express for back-end
Utilized MongoDB for database storage
Incorporated authentication and authorization features for user security
To find the second highest salary in a table, you can use a SQL query with the MAX() function and a subquery.
Use a SQL query to select the MAX() salary from the table.
Use a subquery to select the MAX() salary that is less than the overall MAX() salary.
Combine both queries to get the second highest salary.
Indexing is a technique used to optimize the performance of databases by creating a data structure that allows for quick retrieval of data.
Indexing involves creating a data structure that maps the values of specific columns in a database table to their physical location on disk.
It helps in speeding up data retrieval operations by allowing the database to quickly locate the rows that match a certain condition.
Examples o...
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development technologies
Strong problem-solving skills
Team player with excellent communication skills
Developed a web application for tracking project progress and managing tasks
Used React.js for front-end development
Implemented RESTful APIs using Node.js and Express for back-end
Utilized MongoDB for database storage
Incorporated authentication and authorization features for user security
Truncate is a DDL command that removes all records from a table, while delete is a DML command that removes specific records.
Truncate is faster than delete as it does not log individual row deletions.
Truncate resets the identity seed of the table, while delete does not.
Truncate cannot be rolled back, while delete can be rolled back using a transaction.
Truncate does not fire triggers, while delete does.
In 5 years, I see myself as a senior software developer leading a team and working on cutting-edge technologies.
Leading a team of developers on innovative projects
Continuing to enhance my technical skills and knowledge
Contributing to the growth and success of the company
Possibly pursuing further education or certifications in software development
posted on 24 Oct 2024
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.
posted on 23 Aug 2024
My name is John Smith.
Full name is John Smith
Common name in English-speaking countries
No middle name or initial
In my free time, I enjoy hiking, playing video games, and learning new programming languages.
Hiking in local trails and national parks
Playing video games like Overwatch and Minecraft
Learning new programming languages like Python and JavaScript
based on 2 interviews
Interview experience
based on 1 review
Rating in categories
Inside Sales Executive
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer II
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Customer Success Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Inside Sales Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Freight Tiger
BlackBuck
FarEye
LogiNext Solutions