Filter interviews by
You can import all exports of a file as an object in JavaScript using the 'import * as' syntax.
Use the 'import * as' syntax followed by the object name and 'from' keyword to import all exports of a file as an object.
For example: import * as myExports from './myFile.js';
You can then access the exports using dot notation, like myExports.myFunction().
Determine if a given graph is bipartite. A graph is bipartite if its vertices can be divided into two independent sets, 'U' and 'V', such that every edge ('u', 'v') connec...
The function checks whether a given graph is bipartite or not.
A bipartite graph can be divided into two independent sets such that every edge connects a vertex from one set to the other.
We can use graph coloring algorithm to check if the graph is bipartite.
Start by coloring the first vertex with one color and all its neighbors with the other color.
Continue coloring the remaining vertices, making sure that no adjac...
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These sub...
The task is to find all the different possible substrings of size two that appear in a given string as contiguous substrings.
Iterate through the string and extract substrings of size two
Store the substrings in an array
Return the array of substrings
You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. You...
The problem is to connect N ropes of different lengths into one rope with minimum cost.
Sort the array of rope lengths in ascending order.
Initialize a variable to keep track of the total cost.
While there are more than one rope remaining, take the two shortest ropes and connect them.
Add the cost of connecting the two ropes to the total cost.
Replace the two shortest ropes with the connected rope.
Repeat the above step...
Given an undirected and disconnected graph G(V, E)
, where V
is the number of vertices and E
is the number of edges, the connections between vertices are provided in the 'GRA...
The question asks to print the DFS traversal of an undirected and disconnected graph.
Implement a Depth First Search (DFS) algorithm to traverse the graph.
Use a visited array to keep track of visited vertices.
For each unvisited vertex, start a DFS traversal and print the connected component.
Sort the vertices of each connected component in ascending order before printing.
I applied via Naukri.com and was interviewed in Oct 2024. There were 2 interview rounds.
Here are some common coding interview questions and answers:
String-based questions: How to find the first unrepeated character in a string, how to determine if two strings are anagrams, or how to convert a numeric string to an integer
Array-based questions: How to find the maximum element in an array, how to sort an array of integers in ascending order, or how to remove duplicates from an array
Linked list-based questions: How to find the middle element of a linked list, how to remove a loop in a linked list, or how to merge two sorted linked lists
General programming questions: How to write a piece of code from requirements to delivery, how to debug a program while it's being used, or how to stay up-to-date with the latest technology developments
Data structure questions: What is a tree in data structure, or what is a binary tree
Palindrome questions: How to determine if a string is a palindrome
In addition to the technical aspects of coding, interviewers may also assess an applicant's communication skills. They may ask how well the applicant explains complex concepts or the method they used in a live coding exercise.
You can also watch this video to learn more about coding interview questions:
Python is a high-level programming language known for its simplicity and readability.
Python is an interpreted language, meaning code is executed line by line.
It supports multiple programming paradigms like procedural, object-oriented, and functional programming.
Python has a large standard library and a thriving community with many third-party libraries available.
It is widely used in web development, data science, artif...
Python is a versatile, easy-to-read language with a large community and extensive libraries.
Python has a simple syntax that makes it easy to learn and read.
Python has a large community of developers, making it easy to find support and resources.
Python has a wide range of libraries and frameworks for various applications, such as web development, data analysis, and machine learning.
Self-intersection occurs when a curve or surface intersects itself at a point.
Self-intersection can occur in computer graphics when rendering complex shapes.
It can also occur in geometry when analyzing curves and surfaces.
Self-intersection can lead to rendering artifacts or inaccuracies in calculations.
Coding allows me to solve complex problems, create innovative solutions, and continuously learn and improve my skills.
Coding enables me to automate tasks and processes, increasing efficiency and productivity.
It provides a creative outlet for problem-solving and allows me to build practical applications.
Coding opens up opportunities for collaboration with other developers and working on exciting projects.
It is a valuabl...
DSA and Arrays question
Linkedlist , graph and tree
SOC processes and techniques involve monitoring, detecting, and responding to cybersecurity threats.
Continuous monitoring of network traffic and system logs
Utilizing security information and event management (SIEM) tools
Implementing threat intelligence feeds for proactive defense
Incident response planning and execution
Regular security assessments and penetration testing
1hr java and selenium
It was a DS and Algo round.
Implement a queue using two stacks
Use two stacks - one for enqueue operation and one for dequeue operation
For enqueue operation, push elements into the first stack
For dequeue operation, if the second stack is empty, pop all elements from the first stack and push into the second stack, then pop from the second stack
Example: Enqueue 1,2,3 -> Stack1: [1,2,3], Dequeue -> Stack2: [3,2,1], Dequeue -> 1
I applied via Campus Placement
Basic apt questions asked along with few quiz on various cs subjects
Top trending discussions
Some of the top questions asked at the Gainsight interview -
The duration of Gainsight interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 28 interview experiences
Difficulty level
Duration
based on 114 reviews
Rating in categories
Software Engineer
127
salaries
| ₹12 L/yr - ₹21 L/yr |
Senior Software Engineer
85
salaries
| ₹16.6 L/yr - ₹28 L/yr |
Lead Software Engineer
26
salaries
| ₹26 L/yr - ₹40.5 L/yr |
Associate Software Engineer
25
salaries
| ₹9.8 L/yr - ₹16 L/yr |
Senior Solution Engineer
25
salaries
| ₹13.6 L/yr - ₹20.5 L/yr |
Xoriant
Photon Interactive
CitiusTech
Iris Software