Filter interviews by
I am a passionate React Js developer with 5 years of experience in building user-friendly and responsive web applications.
5 years of experience in React Js development
Skilled in building user-friendly and responsive web applications
Passionate about frontend development
A React application is a web application built using the React JavaScript library for creating interactive user interfaces.
React applications are built using components, which are reusable pieces of code that represent a part of the user interface.
React uses a virtual DOM to efficiently update the actual DOM based on changes in the application state.
React applications can be created using tools like Create React App or...
Top trending discussions
It’s an average test experience
Best questions with tricky one
I was interviewed in Jun 2023.
I applied via LinkedIn and was interviewed in Apr 2023. There were 3 interview rounds.
Todo application javascript todo app creation needs to submit
I applied via Referral and was interviewed in Jul 2023. There were 4 interview rounds.
String , Array ,Collection framework related questions.
Ecommerce site with Login,Review,AddToCart,Order features,Filter features.
Abstract class can have both abstract and non-abstract methods, while interface can only have abstract methods.
Abstract class can have method implementations, while interface cannot.
A class can implement multiple interfaces, but can only inherit from one abstract class.
Interfaces are used to define contracts for classes to implement, while abstract classes are used to provide a common base for subclasses.
Example: Abstr...
I applied via Company Website and was interviewed in Jul 2023. There were 4 interview rounds.
I have given the coding test in python language. Out of 5 questions, we have to attain a minimum of 3 questions.
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:...
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.
based on 1 interview
Interview experience
Implementation Consultant
44
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Project Manager
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
22
salaries
| ₹0 L/yr - ₹0 L/yr |
PeopleStrong
KEKA TECHNOLOGIES
Darwinbox
greytHR