Filter interviews by
I applied via Naukri.com and was interviewed in Aug 2024. There was 1 interview round.
Reconciliation in React is the process of updating the virtual DOM to match the actual DOM.
Reconciliation is the process of comparing the virtual DOM with the actual DOM and making necessary updates.
React uses a diffing algorithm to efficiently update the DOM without re-rendering the entire component tree.
Key prop is important for React to efficiently reconcile elements and maintain component state.
Reconciliation can b...
Performance optimization in React is crucial for creating fast and efficient web applications.
Use React.memo and PureComponent to optimize rendering performance by preventing unnecessary re-renders.
Avoid unnecessary re-renders by using shouldComponentUpdate or React.memo with custom comparison functions.
Use code splitting and lazy loading to reduce initial load time and improve performance.
Optimize component rendering ...
Hooks in React are functions that let you use state and other React features in functional components.
Hooks were introduced in React 16.8 to allow state and lifecycle features in functional components.
useState() hook is used to add state to functional components.
useEffect() hook is used to perform side effects in functional components.
Custom hooks can be created to reuse stateful logic across components.
I applied via Recruitment Consulltant and was interviewed in Oct 2023. There were 4 interview rounds.
I applied via Referral and was interviewed before Apr 2021. There were 2 interview rounds.
A company designed the test basically to understand the nature of the interviewee. Simple test.
I applied via Approached by Company and was interviewed before Apr 2021. There were 2 interview rounds.
posted on 16 Apr 2021
I applied via Referral and was interviewed in Oct 2020. There was 1 interview round.
posted on 16 Apr 2021
Implement merge sort and find kth largest element in an array.
Merge sort is a divide and conquer algorithm that recursively divides the array into two halves, sorts them and then merges them.
Kth largest element can be found using quick select algorithm or by sorting the array and returning the kth element from the end.
Merge sort has a time complexity of O(nlogn) and space complexity of O(n).
Quick select has a time comp...
posted on 20 Apr 2022
I applied via Recruitment Consulltant and was interviewed before Apr 2021. There was 1 interview round.
NoSQL databases are non-relational databases that store and retrieve data in a non-tabular format.
Document-oriented databases (MongoDB, Couchbase)
Key-value stores (Redis, Riak)
Column-family stores (Cassandra, HBase)
Graph databases (Neo4j, OrientDB)
Scaling refers to the process of increasing or decreasing the capacity of a system to handle more or less load.
Vertical Scaling: Adding more resources to a single node
Horizontal Scaling: Adding more nodes to a system
Load Balancing: Distributing the load across multiple nodes
Database Sharding: Splitting a database into smaller parts to distribute the load
Caching: Storing frequently accessed data in memory for faster acc
posted on 21 Nov 2020
I applied via Naukri.com and was interviewed in Nov 2020. There were 3 interview rounds.
I applied via Recruitment Consultant and was interviewed in May 2019. There were 3 interview rounds.
based on 2 interviews
Interview experience
based on 4 reviews
Rating in categories
Process Associate
436
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Process Associate
140
salaries
| ₹0 L/yr - ₹0 L/yr |
Developer 2
63
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
60
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
60
salaries
| ₹0 L/yr - ₹0 L/yr |
Yardi Systems
MRI Software
Buildium
Entrata