Upload Button Icon Add office photos

Filter interviews by

FabHotels Lead Software Engineer Interview Questions and Answers

Updated 9 May 2024

FabHotels Lead Software Engineer Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
Easy
Process Duration
4-6 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed before May 2023. There were 2 interview rounds.

Round 1 - Coding Test 

First round was on basics of java. It was surprising to have such questions asked to interviewee applying for a lead role.

Round 2 - Technical 

(1 Question)

  • Q1. It was majorly around system design. HLD, LLD and scalability and adaptability issues.

Interview Preparation Tips

Interview preparation tips for other job seekers - The interview process was smooth.

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Use of model in laravel
  • Ans. 

    Models in Laravel are used to interact with the database and represent data.

    • Models in Laravel are used to perform database operations such as retrieving, inserting, updating, and deleting data.

    • Models help in organizing and structuring the data in the application.

    • Models in Laravel follow the MVC (Model-View-Controller) pattern.

    • Example: Creating a User model in Laravel to interact with the users table in the database.

  • Answered by AI
  • Q2. SQL get highest salary for employee
Round 2 - Technical 

(2 Questions)

  • Q1. SQL joins and types of joins
  • Ans. 

    SQL joins are used to combine rows from two or more tables based on a related column between them.

    • Types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN.

    • INNER JOIN returns rows when there is at least one match in both tables.

    • LEFT JOIN returns all rows from the left table and the matched rows from the right table.

    • RIGHT JOIN returns all rows from the right table and the matched rows from the left table.

    • F...

  • Answered by AI
  • Q2. What is self join and realted question
Round 3 - HR 

(1 Question)

  • Q1. Previous projects and contributions

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Apr 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

Coding Questions and SQL

Round 3 - Technical 

(1 Question)

  • Q1. Topics : Trees and LinkedList
Round 4 - Technical 

(1 Question)

  • Q1. Trees, LinkedList and SQL queries
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed before Apr 2023. There were 2 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Basic Php ,Oops
Round 2 - Technical 

(1 Question)

  • Q1. Security questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Join if you don't have only offer in your hand

I applied via campus placement at SRM university (SRMU) and was interviewed in Sep 2022. There were 2 interview rounds.

Round 1 - Coding Test 

3 data structure problem with medium to hard level leetcode type.

Round 2 - One-on-one 

(2 Questions)

  • Q1. 1st question was on vertical order traversal in a tree. it was from gfg he also told me to optimise it
  • Q2. 2nd question was from leetcode ie meeting rooms ll , medium question

Interview Preparation Tips

Interview preparation tips for other job seekers - do data structure practise from striver sheet as the ask dsa the most
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Dictionary Sort , DFS, BFS
Round 3 - Technical 

(1 Question)

  • Q1. Reverse a LinkedList from m to n
  • Ans. 

    Reverse a LinkedList from m to n

    • Traverse the list to m-1th node

    • Reverse the nodes from m to n

    • Connect the reversed list to the original list

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare DSA as the rounds are only technical. No projects were asked

Skills evaluated in this interview

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Easy

This round was conducted on the HackerEarth platform. It had 2 sections and candidates were given a time of 1 hour 30 minutes. 

Programming MCQs — 18 MCQs (each of 2 marks)
Questions were a little tricky. it tested upon one’s programming fundamentals. It had C/C++ output questions, pseudocode questions, Operating systems, and SQL queries.
Coding — 2 ( one contains 75 marks and the other contains 100 marks )

Our scores of the first 2 sections weren’t revealed. My MCQs went really well. I solved 2 coding questions in the coding section. Only 15 students got selected for the interview round, and I was one of them.

  • Q1. 

    Count Ways to Complete Journey in Triangular Pyramid

    Given a triangular pyramid with vertices marked as ‘O’, ‘X’, ‘Y’, and ‘Z’, and an integer 'N', you need to calculate the number of ways Bob can start a...

  • Ans. Brute Force

    The idea is very simple, as standing at any point we will always have three choices to move. So we will make a recursive function and call it for all three choices and decrease ‘N’ by 1 each time. So when ‘N’ will reach 0 then we will check the current position, if it is ‘O’ then we can say we have found a way.

     

    Complete Algorithm :

    • We will make a helper recursive function named ‘SOLVE’ which will receive...
  • Answered Anonymously
  • Q2. 

    Maximum Profit Problem Statement

    Mukesh is evaluating the maximum profit from his business over a series of days. Given a list of profits over 'N' days, Mukesh wants to determine the highest profit achiev...

  • Ans. Brute Force

    The basic idea is to iterate through the given array/list ‘profit’ and check for each index as a starting point, if any possible consecutive days in the range [ ‘A’, ‘B’ ] is possible, calculate its ‘sum’ and update the ‘maxProfit’ if the ‘sum’ is greater than ‘maxProfit’ ( where ‘maxProfit’ denotes the Maximum possible profit from the array/list ‘profit’ under the given range).

     

    Algorithm:

     

    1. Declare ...
  • Answered Anonymously
Round 2 - Video Call 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round was scheduled for 1 hour and the panel had 1 interviewer. Being a virtual interview, the first challenge that I faced was that the interviewer was not audible. I suggest you not panic in such a situation and use the chatbox feature (or contact HR if need be) to figure out something that works for you and the panel. We later connected over voice call (over the phone) with our videos ON (over a laptop) and continued with the interview.

The interview was very calm and helpful. I was able to solve all questions and I explained different approaches to solve the questions. Once he was convinced of my solution, he asked me to write the code on my own IDE.

  • Q1. 

    Running Median Problem

    Given a stream of integers, calculate and print the median after each new integer is added to the stream.

    Output only the integer part of the median.

    Example:

    Input:
    N = 5  
    Stre...
  • Ans. Sorting Approach

    The median of n numbers is the middle-most element among the numbers when sorted in ascending order, when n is odd, and is the average of the two middle-most elements, when n is even. To find the middle-most elements, we do this: For every new addition to the stream, we sort all the numbers that are currently present. This makes it easy for us to obtain the middle-most elements.

    Space Complexity: O(1)Exp...
  • Answered Anonymously
  • Q2. 

    Boundary Traversal of a Binary Tree

    Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.

    Input:

    The first line ...
  • Ans. Recursion Based Approach

    The boundary traversal of a binary tree can be broken down into 4 parts. These parts are given in the same order as they are present in the traversal-

     

    1. The root node - The root node will always be our first node in the whole boundary traversal.
       
    2. The left boundary - The left most nodes of the left subtree are also included in the boundary traversal, so we will process them next except for...
  • Answered Anonymously
  • Q3. 

    Count Pairs with Given Sum

    Given an integer array/list arr and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.

    Input:

    The first line c...
  • Ans. Brute Force Approach
    • Initialize the ans = 0
    • Run two loops first from i = 0 to n-1 and second from j = i+1 to  n-1 and if arr[i] + arr[j] == Sum then increase the ans by 1.
    • Return ans
    Space Complexity: O(1)Explanation:

    O(1)

     

    As constant extra space is used.

    Time Complexity: O(n^2)Explanation:

    O(N^2), where N is the size of the array.


    As we are running two nested loops of size N.

  • Answered Anonymously
Round 3 - Video Call 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

This was a technical + HR round. First, he asked me to introduce myself. This round was also based on your knowledge of DSA. I was asked 2 coding questions. Then he asked a couple of questions from OS and DBMS which were pretty easy. At last, we ended the interview on a good note. Then he asked me questions about myself.
Why I want to join OYO rooms. 
What are my hobbies?
Goals in the next five years.

  • Q1. 

    Zig-Zag String Problem Statement

    Given a string 'STR' of length 'N' and an integer 'M' representing the number of rows in the zig-zag pattern, your task is to return the string formed by concatenating all...

  • Ans. Iteration

    Create an array ‘arr’ of size ‘m’, use the array index ‘arr[i]’ to store the string at row ‘i’. Traverse the string ‘str’, identify the character’s row in the current iteration, and append that character to its corresponding row/index in ‘arr’.

     

    1. Create an array of strings named ‘arr’ of size ‘m’.
    2. Initialize variable ‘curRow’ with value 0 and ‘move’ with value 1. Use ‘curRow’ to identify the character’s row ...
  • Answered Anonymously
  • Q2. 

    Ways To Make Coin Change

    Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...

  • Ans. Recursion

     

    1. The idea is to use recursion.
    2. For a particular coin, we have two options either include it or exclude it.
    3. If we include that coin, then calculate the remaining number that we have to generate so recur for that remaining number.
    4. If we exclude that coin, then recur for the same amount that we have to make.
    5. Our final answer would be the total number of ways either by including or excluding.
    6. There will be two edg...
  • Answered Anonymously

Interview Preparation Tips

Eligibility criteriaNo CriteriaOYO interview preparation:Topics to prepare for the interview - Data Structures, Computer Networking, C++, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 12 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice coding questions as much as you can.
Tip 2 : Your communication skills must be good.
 

Application resume tips for other job seekers

Tip 1 : Mention some good projects on your resume.
Tip 2 : Don't write any false information on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Hard

Timing was 11 am. Platform was quite well.

  • Q1. 

    Rat in a Maze Problem Statement

    You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...

  • Ans. Bactracking

    Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.

     

    Algorithm is as follows:

     

    1. Take the starting position of th...
  • Answered Anonymously
  • Q2. 

    Minimum Cost to Destination

    You are given an NxM matrix consisting of '0's and '1's. A '1' signifies that the cell is accessible, whereas a '0' indicates that the cell is blocked. Your task is to compute ...

  • Ans. Backtracking

    Maintain a visited array and try to explore all the possibilities with the help of backtracking.

    1. Start with (0, 0) and mark it as visited and try to move in all 4 directions.
    2. Say at any point we are at (i, j) then the cost of reaching (x,y) will be the minimum of these four cases.
      1. Option 1 -  Left: cost of reaching from (i, j-1)
      2. Option 2 - Right: cost of reaching from (i, j+1)
      3. Option 3 - Up: 1 + cost of rea...
  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Chitkara University. Eligibility criteria6.5 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structure, OS, DBMS, Java, Problem Solving, OOPSTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Practice data structure based questions.
Tip 2 : OOPS is very important.
Tip 3 : Prepare OS and DBMS for mcq.

Application resume tips for other job seekers

Tip 1 : Mention atleast 2 projects on resume.
Tip 2 : Keep it short in length.

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before May 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Easy

  • Q1. 

    Position of Right Most Set Bit

    Determine the position of the rightmost set bit in the binary representation of a given number N.

    Input:

    T: Number of test cases
    N: An integer for which the position of the...
Round 2 - Coding Test 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Water Jug Problem Statement

    You have two water jugs with capacities X and Y liters respectively, both initially empty. You also have an infinite water supply. The goal is to determine if it is possible to...

Round 3 - Video Call 

Round duration - 60 Minutes
Round difficulty - Medium

Interview Preparation Tips

Eligibility criteriaAbove 7.5 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structures and Algorithm, Machine Learning, DBMS, C++, Python, Front End Web DevelopmentTime required to prepare for the interview - 1 YearInterview preparation tips for other job seekers

Tip 1 : Make your DSA and Algorithm as much as strong as possible.Main focus should be on Graphs and Trees.
Tip 2 : There are many standard algorithm on which questions are frequently asked.Try to practice as much as you can on them.
Tip 3 : Your project should be unique to create unforgettable impression.

Application resume tips for other job seekers

Tip 1 : Add 2-3 best of your projects which shows something extraordinary.
Tip 2 : Add your achievements if you have any like getting top rank in a coding competition.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via campus placement at Netaji Subhas Institute of Technology (NSIT) and was interviewed before Dec 2021. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Properly align and format text in your resume. A recruiter will have to spend more time reading poorly aligned text, leading to high chances of rejection.
View all tips
Round 2 - Coding Test 

Coding Rond consisted of 3 questions

Round 3 - One-on-one 

(3 Questions)

  • Q1. 1. Data structures and algorithms
  • Q2. 2. Computer fundamentals
  • Q3. Revise all cs fundamentals

Interview Preparation Tips

Interview preparation tips for other job seekers - Just polish your DSA concepts and projects in your resume

FabHotels Interview FAQs

How many rounds are there in FabHotels Lead Software Engineer interview?
FabHotels interview process usually has 2 rounds. The most common rounds in the FabHotels interview process are Coding Test and Technical.
How to prepare for FabHotels Lead Software Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at FabHotels. The most common topics and skills that interviewers at FabHotels expect are Agile, Front End, Postgresql, Automation and Data Structures.

Tell us how to improve this page.

FabHotels Lead Software Engineer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

Oyo Rooms Interview Questions
3.3
 • 217 Interviews
MakeMyTrip Interview Questions
3.7
 • 122 Interviews
Agoda Interview Questions
3.6
 • 62 Interviews
Hyatt Regency Interview Questions
4.1
 • 43 Interviews
Pizza Hut Interview Questions
3.9
 • 41 Interviews
JW Marriott Interview Questions
4.2
 • 39 Interviews
Tata Starbucks Interview Questions
4.3
 • 39 Interviews
Ihg Group Interview Questions
3.9
 • 35 Interviews
View all
Key Account Manager
120 salaries
unlock blur

₹2.9 L/yr - ₹10 L/yr

Manager- Corporate Sales
53 salaries
unlock blur

₹4 L/yr - ₹9 L/yr

Assistant Manager
50 salaries
unlock blur

₹4 L/yr - ₹9.2 L/yr

Guest Delight Officer
40 salaries
unlock blur

₹1.8 L/yr - ₹4 L/yr

Deputy Manager
38 salaries
unlock blur

₹4 L/yr - ₹10 L/yr

Explore more salaries
Compare FabHotels with

Oyo Rooms

3.3
Compare

Treebo Hotels

3.3
Compare

Goibibo

4.3
Compare

MakeMyTrip

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview