Fractal Analytics Software Developer Interview Questions and Answers

OOPS , DBMS , OS , and DSA concepts

Q1. DBMS related concepts
Add your answer
Q2. Networking and Network Security
Add your answer

Q1. What are React Queries?
Ans. 
React Queries are a library for managing server state in React applications.
• React Queries provide a way to fetch and cache data from an API in React components.

• They offer features like caching, background fetching, and automatic refetching.

• React Queries can handle complex data fetching requirements, such as pagination and infinite scrolling.
Answered by AI
Add your answer
Q2. Can useEffect() hook run twice?
Ans. 
Yes, useEffect() hook can run twice under certain conditions.
• useEffect() hook can run twice if the dependencies array changes between renders.

• This can happen if the dependencies array contains values that change frequently.

• For example, if a state variable is included in the dependencies array and it is updated in the component, useEffect() will run again.
Answered by AI
Add your answer

Building small UI screen application in 1 hr for frontend developer

Q1. Graph traversal question
Add your answer
Q2. React js questions
Add your answer
Q3. Javascript output guessing question
Add your answer

As a recent college graduate, I am actively seeking employment opportunities where I can effectively apply my
skills. Currently pursuing a Bachelor of Engineering in Artificial Intelligence and Machine Learning, I strive to push
my limits to explore new possibilities and acquire additional skills. Aspiring to work in a growth-oriented
environment where I can achieve excellence under existing working conditions, and contribute to the goals of the
organization.

Q1. -----CJn8Dy4pcAH_MQs3xeEvGEHJGUFLdotsXJs50U0/?igshid=1ovlixg7am262
Add your answer

Array duplicates and burn binary tree

Q1. Project specific
Add your answer

Core Java , DS and Algo

Q1. LLD Spotify only structure
Add your answer
Q2. Shortest path algorithm
Ans. 
Shortest path algorithm finds the shortest path between two nodes in a graph.
• Dijkstra's algorithm is a popular shortest path algorithm that uses a priority queue to find the shortest path in a weighted graph.

• A* algorithm is another popular shortest path algorithm that uses heuristics to guide the search towards the goal node.

• Bellman-Ford algorithm is used for finding the shortest path in a graph with negative edge weig
Answered by AI
Add your answer

Q1. Reason for the change
Add your answer
Q2. What you bring to the table
Add your answer