FabHotels Senior Front end Developer Interview Questions and Answers

Implement an iterator to flatten 2D vector

Q1. Find shortest path to get all keys
Ans. 
Use Dijkstra's algorithm to find the shortest path to get all keys
• Implement Dijkstra's algorithm to find the shortest path in a graph

• Consider the keys as nodes in the graph and the paths between keys as edges

• Keep track of the keys collected and update the shortest path accordingly
Answered by AI
Add your answer

Q1. Data Structures and Theoretical Java and SQL concepts like - views, indexes, DML
Add your answer

Programs on Sorting and Search Algorithms and Core Java

Q1. What are the types of data.
Ans. 
Types of data include numerical, categorical, ordinal, and binary.
• Numerical data includes continuous and discrete values, such as height and age.

• Categorical data includes non-numeric values, such as colors and types of fruit.

• Ordinal data includes values with a specific order, such as rankings and ratings.

• Binary data includes only two possible values, such as true/false and yes/no.
Answered by AI
Add your answer

Q1. Core : DBMS , oops in depth coding: basic DSA questions based on Arrays, String.
Add your answer

Q1. He asked me graph questions ( medium level ) based on a node to root, and min cost to target. note: if you really want to crack the yata.com interview practice graph question and they ask a leetcode questi...read more
Add your answer

General reasoning and Mathmatics Aptitude

Q1. Core Java and Coding questions
Add your answer

Coding and system design round

1 week assignment on hotel management to create the api and working solutions