Filter interviews by
Clear (1)
I applied via Job Fair and was interviewed in Oct 2024. There were 2 interview rounds.
It was an online test for interview
Dijkstra's algorithm is a graph search algorithm that finds the shortest path between nodes in a graph.
Dijkstra's algorithm uses a priority queue to select the node with the smallest distance from the start node.
It maintains a list of tentative distances to each node and updates them as it explores the graph.
The algorithm is commonly used in routing and network protocols to find the shortest path between nodes.
Example:...
Node.js is single-threaded, but it can support multi-threading through child processes and worker threads.
Node.js is single-threaded, meaning it runs on a single thread in the event loop.
To achieve multi-threading, Node.js can create child processes using the 'child_process' module.
Another way to achieve multi-threading in Node.js is through worker threads using the 'worker_threads' module.
Using child processes or work...
I applied via Campus Placement
General aptitude and reasoning
Dsa three codes for 2 hours
Josephus problem is a famous theoretical problem involving a circle of people where every kth person is eliminated until only one person remains.
Josephus problem involves a circle of n people where every kth person is eliminated until only one person remains.
The problem can be solved in O(1) time complexity by using the formula: f(n, k) = (f(n-1, k) + k) % n.
For example, if n=5 and k=2, the last person remaining would
Top trending discussions
I applied via Referral
Java internals, coding questions 2sum
Developed a web-based project management tool for tracking tasks and deadlines.
Used React.js for front-end development
Implemented RESTful APIs for backend using Node.js and Express
Utilized MongoDB for database storage
Incorporated authentication and authorization features for user security
Open to relocation for the right opportunity
Willing to relocate for the right job opportunity
Flexible with location for the right role
Open to considering different locations for the right position
I was interviewed in Oct 2021.
Round duration - 105 minutes
Round difficulty - Medium
There were 3 problems .
One was easy but the other two were of medium level.
Given an array representing positions of stalls and an integer ‘K’ representing the number of aggressive cows, determine the largest minimum distance between any two cows ...
The problem requires assigning aggressive cows to stalls in a way that maximizes the minimum distance between any two cows.
Sort the array of stall positions in ascending order.
Use binary search to find the largest minimum distance between cows.
Check if it is possible to assign cows with this minimum distance by iterating through the sorted array.
If it is possible, update the maximum distance and continue binary search ...
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...
The problem is to find the shortest path between two houses in an unweighted graph.
The graph represents the city of Ninjaland with houses connected by roads.
The input consists of the number of test cases, number of houses and roads, starting and ending house, and the roads between houses.
The output is a vector of nodes representing the shortest path from the starting house to the ending house.
If there are multiple shor...
Given a positive integer N
, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...
The task is to count the total number of '1' in the binary representation of all numbers from 1 to N.
Convert each number from 1 to N into its binary representation
Count the number of '1' bits in each binary representation
Sum up the counts of '1' bits for all numbers
Return the sum modulo 1e9+7
Round duration - 60 minutes
Round difficulty - Easy
The interviewer was very polite and straightforward.
Firstly he introduced himself and then asked me to introduce myself and then he jumped to the coding problems.
After the coding problems, he asked some questions from the OS and DBMS.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
The task is to reverse the words in a given string, removing any leading or trailing spaces and replacing multiple spaces between words with a single space.
Split the string into words using spaces as delimiters
Reverse the order of the words
Join the reversed words with a single space between them
Remove any leading or trailing spaces
You are provided with a linked list containing 'N' nodes and an integer 'K'. The task is to reverse the linked list in groups of size K, which means reversing the nodes ...
The task is to reverse a linked list in groups of size K.
Iterate through the linked list in groups of size K
Reverse each group using a helper function
Connect the reversed groups to form the final reversed linked list
Round duration - 60 minutes
Round difficulty - Medium
The interviewer was very polite and straightforward, firstly he introduce himself and then ask me to introduce myself and then ask some ques on my projects and then he jumps to the coding problems.
Given a string STR
consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters from the string a...
The task is to remove consecutive duplicate characters from a given string and return the new string.
Iterate through the characters of the string
Compare each character with the next character
If they are the same, skip the next character
If they are different, add the current character to the new string
Return the new string
Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...
The question asks to find the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row of a given matrix.
Iterate through each cell in the first row and calculate the maximum sum path ending at that cell
For each cell, calculate the maximum sum path ending at that cell by considering the three possible directions
Store the maximum sum path ending at each cell in a se...
Tip 1 : Deep knowledge of the projects mentioned in your resume is a must.
Tip 2 : Practice must do GFG coding questions.
Tip 3 : Practice as many problems as you can from Leetcode.
Tip 1 : Mention 1 or 2 projects in your resume.
Tip 2 : Don't put false things in your resume.
I applied via LinkedIn and was interviewed before Aug 2023. There were 2 interview rounds.
Data extraction, solid questions, oops
It was the ask mostly about DSA
posted on 4 Jan 2025
I applied via Company Website and was interviewed before Jan 2024. There were 2 interview rounds.
Online technical aptitude test
based on 4 interviews
Interview experience
based on 1 review
Rating in categories
Product Specialist
74
salaries
| ₹0 L/yr - ₹0 L/yr |
Accounts Manager
71
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Consultant
57
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Manager
55
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
50
salaries
| ₹0 L/yr - ₹0 L/yr |
PeopleStrong
SAP SuccessFactors
greytHR
Sumtotal Systems