Filter interviews by
I applied via Job Fair and was interviewed before Oct 2023. There was 1 interview round.
I applied via Naukri.com and was interviewed before Dec 2021. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Apr 2020. There were 5 interview rounds.
React life cycle hooks are methods that allow you to hook into the component's life cycle events.
There are three phases of a component's life cycle: Mounting, Updating, and Unmounting.
Mounting phase includes methods like constructor, render, and componentDidMount.
Updating phase includes methods like shouldComponentUpdate, render, and componentDidUpdate.
Unmounting phase includes method componentWillUnmount.
Hooks can be ...
Context API is a feature in React that allows sharing data between components without passing props.
Context API provides a way to pass data through the component tree without having to pass props down manually at every level.
It consists of two parts: the Provider component and the Consumer component.
The Provider component is used to wrap the components that need access to the data, and the Consumer component is used to...
To avoid then chain and make API call effective through promise, use async/await syntax.
Use async keyword before the function definition.
Use await keyword before the API call.
Wrap the API call in try-catch block to handle errors.
Use Promise.all() to make multiple API calls simultaneously.
Use Promise.race() to get the result of the fastest API call.
Use .finally() to perform actions after the API call is complete.
Top trending discussions
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 70 Minutes
Round difficulty - Hard
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...
The task is to distribute candies to students based on their performance while minimizing the total candies distributed.
Create an array to store the minimum candies required for each student.
Iterate through the students' ratings array to determine the minimum candies needed based on the adjacent ratings.
Consider both left-to-right and right-to-left passes to ensure fair distribution.
Keep track of the total candies dist
You are given a sequence of numbers, ARR
. Your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Use Divide and Conquer approach to recursively divide the input array into two halves.
Merge the sorted halves to produce a completely sorted array.
Ensure the implementation handles the constraints specified in the problem statement.
Example: For input [3, 1, 4, 1, 5], the output should be [1, 1, 3, 4, 5].
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 1 : Do not put false things on resume.
Tip 2 : Have some projects on resume.
posted on 10 Feb 2022
Nothing
posted on 16 Mar 2023
I applied via Walk-in and was interviewed before Mar 2022. There were 3 interview rounds.
Java and python test was there
posted on 10 May 2024
I applied via Naukri.com and was interviewed before May 2023. There was 1 interview round.
posted on 23 Aug 2024
I applied via Campus Placement and was interviewed in Jul 2024. There was 1 interview round.
Question based on array string linkedlist
posted on 21 Dec 2024
I applied via Approached by Company and was interviewed before Dec 2023. There were 4 interview rounds.
2 sum program from Geeks for Geeks
Lazy loading delays loading of related data until it is specifically requested, while eager loading loads all related data upfront. N+1 problem occurs when lazy loading results in multiple additional queries being made.
Lazy loading is used to improve performance by only loading related data when needed
Eager loading loads all related data upfront to reduce the number of queries made
N+1 problem occurs in lazy loading whe...
posted on 18 Aug 2022
I applied via Campus Placement and was interviewed in Jul 2022. There were 3 interview rounds.
Questions based or percentage, profit loss, ratio
Stacks are a data structure that follows the Last In First Out (LIFO) principle.
Elements are added and removed from the top of the stack
Common operations include push (add element) and pop (remove element)
Stacks can be implemented using arrays or linked lists
Examples of stack usage include function call stack and undo/redo functionality in text editors
To find the middle number in a linked list.
Traverse the linked list using two pointers, one moving twice as fast as the other.
When the fast pointer reaches the end, the slow pointer will be at the middle node.
If the linked list has even number of nodes, there will be two middle nodes. Return either one.
based on 1 interview
Interview experience
based on 28 reviews
Rating in categories
Software Engineer
208
salaries
| ₹6 L/yr - ₹21.8 L/yr |
Senior Software Engineer
189
salaries
| ₹9.1 L/yr - ₹33 L/yr |
Software Developer
47
salaries
| ₹6.3 L/yr - ₹19.8 L/yr |
QA Engineer
41
salaries
| ₹4 L/yr - ₹14.3 L/yr |
Associate Technical Leader
30
salaries
| ₹14.5 L/yr - ₹30 L/yr |
Maxgen Technologies
Value Point Systems
JoulestoWatts Business Solutions
F1 Info Solutions and Services