The Hi-tech Robotic Systemz Software Developer Interview Questions and Answers

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

Q1. Project related
Add your answer
Q2. How you solve questions
Add your answer

Q1. You have a hotel and how will you create a complete schema for hotel
Ans. 
To create a complete schema for a hotel, you need to consider various entities like rooms, guests, reservations, staff, amenities, etc.
• Entities to include: rooms, guests, reservations, staff, amenities, invoices, payments

• Relationships between entities: guest stays in a room, staff manages reservations, amenities are available in rooms

• Attributes for each entity: room number, guest name, reservation date, staff ID, ameni
Answered by AI
Add your answer

Q1. They will ask you about core java
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