Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Travel Boutique Online Senior Software Development Engineer Interview Questions and Answers

Updated 17 Sep 2024

Travel Boutique Online Senior Software Development Engineer Interview Experiences

1 interview found

Interview experience
1
Bad
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Approached by Company and was interviewed in Aug 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Coding test was easy, had 5 dsa questions. I solved them all.

Round 2 - One-on-one 

(1 Question)

  • Q1. Write an efficient code to dump large amount of data.
  • Ans. 

    Use parallel processing and efficient data structures to dump large data efficiently.

    • Utilize parallel processing to divide the data into smaller chunks and process them simultaneously.

    • Implement efficient data structures like arrays, hashmaps, or trees to store and retrieve the data quickly.

    • Optimize the code for memory usage and processing speed to handle large amounts of data efficiently.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - I recently interviewed with tbo.com, and I must say that it was one of the worst interview experiences I've ever had. Having given over 20 interviews in my career, this one left me feeling undervalued and frustrated. I want to share this so future candidates can be better prepared and so that the company can improve its process.

The key issues I encountered:

1. Lack of Professionalism:
The interviewer didn't introduce herself and didn’t turn her camera on, which immediately set a tone of detachment. I expected a more respectful and engaging interaction, especially from a company of this size.


2. Rushed Process:
From the moment the interview started, it felt like the interviewer was in a hurry. She asked me to explain my project but didn’t give me enough time to properly respond. She quickly moved on to the coding question, expecting immediate answers without providing proper context or details.


3. Poor Problem Explanation:
The technical question was vague, and the interviewer provided insufficient guidance. I assumed this was a DSA round based on the problem, so I explained an API chunking solution. She then abruptly stopped me and said it should be an executable file. This key detail had not been communicated clearly beforehand, which caused unnecessary confusion.


4. Lack of Technical Competence:
To my surprise, the interviewer seemed unfamiliar with programming concepts and couldn’t even read my code properly. Her inability to engage in technical discussions made me question her expertise. It felt like I was speaking to someone with very little experience in software development, which was disappointing for a senior-level interview.


5. Rude and Arrogant Attitude:
The interviewer displayed a rude and arrogant attitude throughout the process. She interrupted frequently, offered no constructive feedback, and was dismissive of my efforts. When I requested feedback on my approach, she simply told me to ask HR for further clarification, which was unhelpful.
Suggestions for Improvement:

Interviewers should introduce themselves and engage respectfully with candidates to create a professional atmosphere.

Ensure that interviewers are qualified to assess candidates on a technical level, especially for senior positions.

Provide clearer instructions and requirements upfront, so candidates know exactly what’s expected of them.

Constructive feedback should be given during or at the end of the interview to help candidates learn and grow.


Overall, this experience made me question the quality of hiring processes at tbo.com. I hope the company takes these points seriously and improves the way they conduct interviews. A company’s reputation is reflected not just in its products but also in how it treats potential employees during recruitment.

Skills evaluated in this interview

Interview questions from similar companies

I was interviewed before Feb 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 65 minutes
Round difficulty - Easy

There were 2 sections – 
Aptitude and Logical Reasoning and MCQ based on Java question ,C++, coding for 20 min and 45 min respectively.
Section A- Not very difficult to clear this round although less time was a problem.
Section B- It contains 15 multiple choice question on c/c++,java and 4 simple coding questions

  • Q1. 

    Cycle Detection in a Singly Linked List

    Determine if a given singly linked list of integers forms a cycle or not.

    A cycle in a linked list occurs when a node's next points back to a previous node in the ...

  • Ans. 

    Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.

    • Traverse the linked list using two pointers, one moving at double the speed of the other.

    • If the two pointers meet at any point, there is a cycle in the linked list.

    • Use Floyd's Cycle Detection Algorithm for O(N) time complexity and O(1) space complexity.

  • Answered by AI
Round 2 - Coding Test 

(3 Questions)

Round duration - 75 minutes
Round difficulty - Medium

It was an online coding test in which 3 coding question were given.

  • Q1. 

    Smallest Window Problem Statement

    Given two strings, S and X, your task is to find the smallest substring in S that contains all the characters present in X.

    Example:

    Input:
    S = "abdd", X = "bd"
    Outpu...
  • Ans. 

    Find the smallest substring in string S that contains all characters in string X.

    • Iterate through string S and keep track of characters in X found in a window

    • Use two pointers to maintain the window and slide it to find the smallest window

    • Return the smallest window containing all characters in X

  • Answered by AI
  • Q2. 

    Smallest Integer Not Representable as Subset Sum

    Given a non-decreasing sorted array ARR of N positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...

  • Ans. 

    Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a non-decreasing sorted array of positive numbers.

    • Start with the smallest possible integer that cannot be represented, which is 1.

    • Iterate through the array and update the smallest integer that cannot be represented.

    • If the current element is greater than the smallest integer that cannot be represented, return tha...

  • Answered by AI
  • Q3. 

    Minimum Steps for a Knight to Reach Target

    Given a square chessboard of size 'N x N', determine the minimum number of moves a Knight requires to reach a specified target position from its initial position...

  • Ans. 

    Calculate the minimum number of moves a Knight needs to reach a target position on a chessboard.

    • Implement a function that takes knight's starting position, target position, and chessboard size as input

    • Use breadth-first search algorithm to find the shortest path for the Knight

    • Consider all possible 8 movements of the Knight on the chessboard

    • Return the minimum number of moves required for the Knight to reach the target po

  • Answered by AI
Round 3 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

It started with a discussion on the programs given in coding round. They asked me about my interest field after that they directly jumped into Networking, Linux and Ethical Hacking part looking my interest domain. They asked me various question on networking and linux.
Then they asked me to code a simple c program

  • Q1. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • Ans. 

    Reverse a singly linked list of integers and return the head of the reversed linked list.

    • Iterate through the linked list and reverse the pointers to point to the previous node.

    • Keep track of the current, previous, and next nodes while reversing the linked list.

    • Update the head of the reversed linked list as the last node encountered during reversal.

  • Answered by AI
  • Q2. What are the port numbers of protocols such as FTP and SMTP?
  • Ans. 

    FTP uses port number 21 and SMTP uses port number 25.

    • FTP uses port 21 for data transfer and port 20 for control information.

    • SMTP uses port 25 for email communication.

    • Understanding port numbers is important for network communication.

  • Answered by AI
  • Q3. Can you explain the OSI Model?
  • Ans. 

    The OSI Model is a conceptual framework that standardizes the functions of a telecommunication or computing system into seven layers.

    • The OSI Model stands for Open Systems Interconnection Model.

    • It consists of seven layers: Physical, Data Link, Network, Transport, Session, Presentation, and Application.

    • Each layer has specific functions and communicates with the adjacent layers.

    • Example: Layer 1 (Physical) deals with physi...

  • Answered by AI
  • Q4. How do you copy files in Linux?
  • Ans. 

    To copy files in Linux, you can use the 'cp' command.

    • Use the 'cp' command followed by the source file and destination directory to copy a file.

    • To copy a directory and its contents, use the '-r' flag with the 'cp' command.

    • You can also use wildcards like '*' to copy multiple files at once.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMakeMyTrip interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

8 Questions

  • Q1. Find out the subset of an array of continuous positive numbers from a larger array whose sum of of the elements is larger in comparision to other subset. eg: {1,2 5 -7, 2 5} .The two subarrays are {1,2,5} ...
  • Ans. 

    Find the subset of an array with the largest sum of continuous positive numbers.

    • Iterate through the array and keep track of the current sum and the maximum sum seen so far.

    • If the current element is positive, add it to the current sum. If it is negative, reset the current sum to 0.

    • Also keep track of the start and end indices of the maximum sum subset.

    • Return the subset using the start and end indices.

  • Answered by AI
  • Q2. Given two classes C1 and C2 which are almost same.(remember not exactly same). You want to choose best among these classes so that it can be use as key in hashmap. What question will you ask regarding two ...
  • Q3. You are given two strings s1 and s2.Now, find the smallest substring in s1 containing all characters of s2
  • Ans. 

    Find smallest substring in s1 containing all characters of s2.

    • Create a hash table of characters in s2

    • Use sliding window technique to find smallest substring in s1

    • Check if all characters in s2 are present in the substring

    • Update the smallest substring if a smaller one is found

  • Answered by AI
  • Q4. Questions on OOPS (almost all the concepts were covered like polymorphism, overriding, overloading, inheritance, concept of virtual fxns etc.)
  • Q5. Write algo for reversing a linked list
  • Ans. 

    Algorithm to reverse a linked list

    • Create a new empty linked list

    • Traverse the original linked list and insert each node at the beginning of the new list

    • Return the new list

  • Answered by AI
  • Q6. What is lazy loading? Advantages and disadvantages of the same?
  • Ans. 

    Lazy loading is a technique used to defer the loading of non-critical resources until they are needed.

    • Advantages: faster initial page load, reduced bandwidth usage, improved user experience

    • Disadvantages: increased complexity, potential for slower subsequent page loads, difficulty with SEO

    • Examples: images, videos, and other media files can be loaded only when they are visible on the screen

  • Answered by AI
  • Q7. How ajax works? Difference between angular js and jquery?
  • Ans. 

    Ajax is a technique for creating fast and dynamic web pages. AngularJS is a framework for building dynamic web applications, while jQuery is a library for simplifying HTML DOM traversal and manipulation.

    • Ajax stands for Asynchronous JavaScript and XML

    • It allows web pages to be updated asynchronously by exchanging data with a web server behind the scenes

    • AngularJS is a JavaScript framework that extends HTML with new attrib...

  • Answered by AI
  • Q8. Design a traffic light system?
  • Ans. 

    A traffic light system controls the flow of traffic at intersections.

    • The system consists of three lights: red, yellow, and green.

    • Each light has a specific duration for which it stays on.

    • The system also includes sensors to detect the presence of vehicles and pedestrians.

    • The duration of each light can be adjusted based on traffic patterns.

    • The system can be connected to a central control system for remote monitoring and m

  • Answered by AI

Interview Preparation Tips

Skills: Javascript, Ajax, Angular JS, Jquery
College Name: na

Skills evaluated in this interview

I was interviewed before Feb 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with 3 problems based on DSA and Algorithms.

  • Q1. 

    Smallest Integer Not Representable as Subset Sum

    Given a non-decreasing sorted array ARR of N positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...

  • Ans. 

    Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a given array.

    • Sort the array in non-decreasing order.

    • Iterate through the array and keep track of the smallest sum that can be formed.

    • If the next element in the array is greater than the current sum + 1, then the answer is the current sum + 1.

    • Return the answer as the smallest integer not representable as a subset

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • Ans. 

    Reverse a singly linked list of integers and return the head of the reversed linked list.

    • Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

    • Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

    • Update the head of the reversed linked list to be the last node encountered during the reversal process.

  • Answered by AI
  • Q3. 

    Smallest Window Problem Statement

    Given two strings S and X containing random characters, the task is to find the smallest substring in S which contains all the characters present in X.

    Input:

    The first...
  • Ans. 

    The task is to find the smallest substring in string S which contains all the characters present in string X.

    • Iterate through string S and keep track of characters in X using a hashmap

    • Use two pointers to maintain a sliding window and find the smallest window containing all characters in X

    • Return the smallest window found

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions based on OOPS and Angular.

  • Q1. What are the different OOP concepts?
  • Ans. 

    OOP concepts include inheritance, encapsulation, polymorphism, and abstraction.

    • Inheritance allows a class to inherit properties and behavior from another class.

    • Encapsulation restricts access to certain components of an object, protecting its integrity.

    • Polymorphism allows objects to be treated as instances of their parent class.

    • Abstraction hides the complex implementation details of an object and only shows the necessar

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Questions based on System Design, ajax, jquery were asked.

  • Q1. How would you design a traffic light system?
  • Ans. 

    Designing a traffic light system involves creating a system that controls the flow of traffic at intersections.

    • Divide the traffic light system into three main lights: red, yellow, and green.

    • Implement timers to control the duration of each light.

    • Include sensors to detect the presence of vehicles and pedestrians.

    • Consider implementing a pedestrian crossing signal.

    • Integrate a central control system to coordinate the timing

  • Answered by AI
  • Q2. How does AJAX work?
  • Ans. 

    AJAX allows for asynchronous communication between client and server without needing to reload the entire page.

    • AJAX stands for Asynchronous JavaScript and XML.

    • It allows for sending and receiving data from a server without reloading the entire page.

    • AJAX uses XMLHttpRequest object to make requests to the server.

    • It can update parts of a web page without requiring a full page reload.

    • Commonly used in web applications to pro

  • Answered by AI
  • Q3. What is the difference between AngularJS and jQuery?
  • Ans. 

    AngularJS is a full-fledged MVC framework for building dynamic web applications, while jQuery is a lightweight library for DOM manipulation and event handling.

    • AngularJS is a full-fledged MVC framework, providing features like two-way data binding, dependency injection, and routing.

    • jQuery is a lightweight library primarily used for DOM manipulation and event handling.

    • AngularJS is suitable for building single-page applic...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMakeMyTrip interview preparation:Topics to prepare for the interview - Javascript, Ajax, Angular JS, Jquery, Data Structures, Algorithms, System Design, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview Preparation Tips

Round: Technical Interview
Experience: The interviewers were professional in their approach and ensured that I was comfortable through the whole process.

General Tips: Interview process was fairly fast but a bit heavy. There were 4 technical interviews and 1 HR. It turns out to be not too difficult as some questions are duplicated in all the interviews.
Skills: Algorithm, data structure
College Name: na

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 75 minutes
Round difficulty - Easy

This was the online round held at university. All students who met the eligibility criteria were called for the online test on hackerrank.

  • Q1. 

    Anagram Difference Problem Statement

    Given two strings, 'STR1' and 'STR2', of equal lengths, determine the minimum number of manipulations required to make the two strings anagrams of each other.

    Input:

    ...
  • Ans. 

    The problem involves finding the minimum number of manipulations required to make two strings anagrams of each other.

    • Create frequency maps for both strings

    • Find the absolute difference in frequencies of each character

    • Sum up the absolute differences to get the total manipulations needed

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

This round was technical round and the interview started with formal introduction and general questions.
After that We had a discussion on LRU Cache.
Followed by coding and set of data structure questions.

  • Q1. 

    Gas Tank Problem Statement

    You have a car with a gas tank of infinite capacity. There are 'N' gas stations located along a circular route, numbered from 0 to N-1. You begin your journey with an empty tank...

  • Ans. 

    Find the starting gas station index to complete a circular route with gas and cost arrays.

    • Iterate through gas stations, keeping track of total gas and total cost from each station

    • If total gas is greater than or equal to total cost, update the starting station index

    • Return the starting station index if a valid one is found, else return -1

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This Round was DS and Algo round and it started with formal introduction, followed by 2 problems. We first dicussed the approach the time complexity and proper code covering all cases.

  • Q1. 

    Boundary Traversal of Binary Tree

    Given a binary tree of integers, your task is to print the boundary nodes of this binary tree in an anti-clockwise direction starting from the root node.

    Input:

    The fir...
  • Ans. 

    Print the boundary nodes of a binary tree in an anti-clockwise direction starting from the root node.

    • Traverse the left boundary nodes from the root to the leftmost leaf node.

    • Traverse the leaf nodes from left to right.

    • Traverse the right boundary nodes from the rightmost leaf node to the root.

  • Answered by AI
  • Q2. 

    Maximum Sum of Two Non-Overlapping Subarrays

    Given an integer array ARR and a positive integer K, your objective is to find two non-overlapping subarrays (contiguous) of length K each, such that their sum...

  • Ans. 

    Find two non-overlapping subarrays of length K with maximum sum in an integer array.

    • Iterate through the array to find all possible subarrays of length K.

    • Calculate the sum of each pair of non-overlapping subarrays of length K.

    • Keep track of the maximum sum obtained from the pairs of subarrays.

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

This was the Final Interview and it started with formal introduction and general HR questions. Then We discussed about the projects and the things written in my resume. The interviewer was very frank and this round was very interactive. He asked me about my college, my future plans, teachers, various subjects, why Expedia and questions like that.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in DelhiEligibility criteriaAbove 7.5 CGPA, Candidates from computer related branch only.Expedia Group interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Designs, Operating Systems, DBMSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be solid with the basics of Ds & Algorithms. Good to have end to end projects which are hosted on cloud.
Tip 2 : Its always good to be presentable and have good communications skills
Tip 3 : Be honest, clear in approach and always walkthrough your thought process to the interviewer

Application resume tips for other job seekers

Tip 1: Mention your projects and experience at the top. Be clear on what was done, a brief on how it was done, language /tech stack involved. If possible try to host and make it accessible. You never know if you can present it with just one click.
Tip 2: Choose a balance between, white spaces and text, it should be well indented, no grammatical errors.
Tip 3: It takes less than 2 min to scan a resume. Don't mention things which are irrelevant.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Easy

The test was divided into two parts : Section A had questions from Quantitative, C language, Logical and English. The second part had two coding questions.

  • Q1. 

    Deletion in Circular Linked List Problem Statement

    Given a Circular Singly Linked List of integers, and a specific value 'VAL', your task is to delete the first occurrence of this value in the linked list...

  • Ans. 

    Delete the first occurrence of a specific value in a Circular Linked List.

    • Traverse the circular linked list to find the value to be deleted.

    • Update the pointers to skip the node containing the value.

    • Handle edge cases like deleting the only node in the list.

    • Return the modified circular linked list.

  • Answered by AI
  • Q2. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

  • Ans. 

    Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraints.

    • Use a combination of a doubly linked list and a hashmap to efficiently implement the LRU cache.

    • Keep track of the least recently used item and update it accordingly when new items are added.

    • Ensure that the cache does not exceed its capacity by evicting the least recently used item when necessary.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAExpedia Group interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Easy

Hello everyone! Expedia came to our campus for full time hiring of final year students. They had shortlisted candidates for the interviews by taking an online test comprised of four sections (Quantitative, C, Logical and English). Every section had a timer attached to it, so you need to think and answer quickly. Although, the questions were easy but cutoff was quite high. This round was followed by a coding round, comprised of two questions.

  • Q1. 

    Problem: Deletion in Circular Linked List

    You are provided with a Circular Linked List of integers and a specific integer, referred to as 'key'.

    Your task is to implement a function that locates the spec...

  • Ans. 

    Implement a function to delete a specific key from a Circular Linked List of integers.

    • Traverse the Circular Linked List to find the key to be deleted.

    • Adjust the pointers to remove the node containing the key.

    • Handle the case where the Circular Linked List becomes empty after deletion.

    • Return -1 if the Circular Linked List is empty after deletion.

  • Answered by AI
  • Q2. 

    Page Faults Identification Problem Statement

    In computing, a page fault occurs when a process accesses a memory page that is not currently mapped by the memory management unit. To handle new pages being b...

  • Ans. 

    The problem involves determining the number of page faults using the Least Recently Used (LRU) replacement algorithm.

    • Page faults occur when a process accesses a memory page not currently mapped by the memory management unit.

    • Page replacement algorithm like LRU is used to decide which existing page should be replaced.

    • The goal is to calculate the number of page faults based on the given input sequences and memory capacity...

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The man who was taking my first round was my alumni. He started-off by asking my introduction and then gave me 2 programming questions to code. He then navigated on to my Codechef profile and asked a question that I did in the June 14 Long Contest. I explained him and he was satisfied. 
Tips : You don’t have to answer the stuffs quickly, rather you need to develop some test cases and have some discussion regarding the structure of the problem, and then answer.

  • Q1. 

    Cycle Detection in a Singly Linked List

    Determine if a given singly linked list of integers forms a cycle or not.

    A cycle in a linked list occurs when a node's next points back to a previous node in the ...

  • Ans. 

    Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.

    • Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.

    • If the two pointers meet at any point, it indicates the presence of a cycle in the linked list.

    • Use Floyd's Cycle Detection Algorithm for efficient detection of cycles in a linked list.

  • Answered by AI
  • Q2. 

    Closest Sum Problem Statement

    Given an array of integers ARR of size N and an integer target, find three integers in ARR such that their sum is closest to the target. If there are two closest sums, return...

  • Ans. 

    Find three integers in an array whose sum is closest to a given target, return the smallest sum if there are two closest sums.

    • Iterate through all possible triplets in the array to find the sum closest to the target.

    • Keep track of the closest sum found so far and update it if a closer sum is found.

    • Return the closest sum at the end of the iteration.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAExpedia Group interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

  • Q1. 

    Rotate Matrix Right K Times

    You are given a matrix MAT of size 'N' * 'M', where 'N' is the number of rows and 'M' is the number of columns, along with a positive integer 'K'. Your task is to rotate the ma...

  • Ans. 

    Rotate a matrix to the right 'K' times by shifting each column to the right 'K' times.

    • Iterate 'K' times to perform right rotation on the matrix

    • Shift each column to the right by one position in each rotation

    • Handle wrapping around the matrix when shifting columns

    • Return the matrix elements row-wise after 'K' rotations

  • Answered by AI
  • Q2. 

    Word Search Problem Statement

    Given a two-dimensional grid of size N x M consisting of upper case characters and a string 'WORD', determine how many times the 'WORD' appears in the grid.

    The 'WORD' can b...

  • Ans. 

    Count how many times a given word appears in a 2D grid by moving in any of the eight possible directions.

    • Iterate through each cell in the grid and check if the word can be formed starting from that cell in any of the eight directions.

    • Use recursion to explore all possible paths from a starting cell to form the word.

    • Keep track of visited cells to avoid revisiting the same cell in the same path.

    • Return the count of how man

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 75 minutes
Round difficulty - Medium

Interview started with an introduction and walk through the resume for first 5 minutes. After that, interview asked few coding questions.

  • Q1. 

    Problem Statement: Largest Island

    You are provided with a non-empty grid consisting of only 0s and 1s. Your task is to determine the maximum area of an island within the given grid.

    An island consists of a...

  • Ans. 

    Find the maximum area of an island in a grid of 0s and 1s.

    • Iterate through the grid and perform depth-first search (DFS) to find connected 1s.

    • Keep track of the area of each island found and return the maximum area.

    • Consider all four directions (horizontal, vertical, and diagonal) while exploring the island.

    • Handle edge cases like grid boundaries and already visited cells during DFS.

    • If no island is present, return 0 as the

  • Answered by AI
  • Q2. 

    Pythagorean Triplet Problem

    Determine if there exists a Pythagorean triplet within a given array of integers. A Pythagorean triplet consists of three numbers, x, y, and z, such that x^2 + y^2 = z^2.

    Expl...

  • Ans. 

    Check if there exists a Pythagorean triplet in a given array of integers.

    • Iterate through all possible triplets in the array and check if they form a Pythagorean triplet.

    • Use a nested loop to generate all possible combinations of three numbers from the array.

    • Check if the sum of squares of two numbers is equal to the square of the third number.

  • Answered by AI
  • Q3. 

    Top View of Binary Tree Problem Statement

    Given a Binary Tree of integers, you are tasked with finding the top view of the binary tree. The top view is the set of nodes visible when the tree is viewed fro...

  • Ans. 

    Find the top view of a Binary Tree by returning a list of visible nodes when viewed from the top.

    • Traverse the Binary Tree in level order and keep track of the horizontal distance of each node from the root.

    • Use a map to store the nodes at each horizontal distance, and only keep the topmost node for each horizontal distance.

    • Return the values of the topmost nodes in the map as the top view of the Binary Tree.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This round was focused on DSA along with short discussion on computer science fundamentals. For coding problems, I was asked to code the first problem only. For others, had to discuss the approach only. For computer science fundamentals, discussion on OOPS. Differences between process and threads were discussed.

  • Q1. 

    Fixing a Swapped Binary Search Tree

    Given a Binary Search Tree (BST) where two nodes have been swapped by mistake, your task is to restore or fix the BST without changing its structure.

    Input:

    The first...
  • Ans. 

    Restore a Binary Search Tree by fixing two swapped nodes without changing its structure.

    • Identify the two nodes that are swapped by mistake in the BST.

    • Swap the values of the two identified nodes to restore the BST.

    • Perform an in-order traversal of the BST to verify the correct restoration.

    • Ensure no extra space other than the recursion stack is used for the solution.

  • Answered by AI
  • Q2. 

    Implement Stack with Linked List

    Your task is to implement a Stack data structure using a Singly Linked List.

    Explanation:

    Create a class named Stack which supports the following operations, each in O(1...

  • Ans. 

    Implement a Stack data structure using a Singly Linked List with operations like getSize, isEmpty, push, pop, and getTop in O(1) time.

    • Create a class named Stack with methods for getSize, isEmpty, push, pop, and getTop.

    • Use a Singly Linked List to store the elements of the stack.

    • Ensure that each operation runs in constant time O(1).

    • Handle edge cases like empty stack appropriately.

    • Test the implementation with sample queri

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Software Engineering from TIET - Thapar Institute of Engineering And Technology. I applied for the job as SDE - 1 in GurgaonEligibility criteria7 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, OS, DBMSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Focus on DSA as you will be judged mostly on that for entry-level software engineer profiles.
Tip 2 : Don't mug up the solution as you might not be able to recall the approach or you might face new question that you haven't seen earlier.
Tip 3 : Practice as much as possible from platforms like InterviewBit, LeetCode.

Application resume tips for other job seekers

Tip 1 : Try not to mention those things about which you are not comfortable. 
Tip 2 : Having one or two good projects in resume helps.
Tip 3 : Mention good competitive programming ranks (if any)
Tip 4 : Use overleaf.com for making a resume using Latex.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

Coding question of medium level difficulty, from DP. 
18 MCQs were core CSE related concepts e.g: OS, OOPs, DBMS, Networking
Time was 90 minutes.

  • Q1. 

    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. 

    Find the minimum cost to reach a destination in a matrix with blocked cells.

    • Use Breadth First Search (BFS) algorithm to explore all possible paths from the starting point to the destination.

    • Keep track of the cost incurred at each cell and update it as you move through the matrix.

    • Return the minimum cost to reach the destination or -1 if it is unreachable.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Medium

It was an one-to-one interview. It checks your problem solving ability and a few OOPs, OS, DBMS etc concepts. Coding questions were related to array, queue and DP.

  • Q1. 

    Triangle Formation Using Array Elements

    Given an integer array/list ARR of length 'N', determine if it is possible to form at least one non-degenerate triangle using the values of the array as the sides o...

  • Ans. 

    Determine if it is possible to form a non-degenerate triangle using array elements as sides.

    • Check if the sum of any two sides is greater than the third side for all combinations of sides.

    • If the above condition is met for any combination, return true; otherwise, return false.

  • Answered by AI
  • Q2. 

    Maximum Sum of Non-Adjacent Elements

    You are given an array/list of integers. The task is to return the maximum sum of a subsequence such that no two elements in the subsequence are adjacent in the given ...

  • Ans. 

    Find the maximum sum of non-adjacent elements in an array.

    • Use dynamic programming to keep track of the maximum sum at each index, considering whether to include the current element or not.

    • At each index, the maximum sum can be either the sum excluding the current element or the sum including the current element but excluding the previous element.

    • Iterate through the array and update the maximum sum accordingly.

    • Example: F...

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Easy

It was also a problem solving round. However after coding questions, they also asked CSE conceptual questions.

  • Q1. 

    Sum Tree Conversion

    Convert a given binary tree into its sum tree. In a sum tree, every node's value is replaced with the sum of its immediate children's values. Leaf nodes are set to 0. Finally, return th...

  • Ans. 

    Convert a binary tree into a sum tree by replacing each node's value with the sum of its children's values. Return preorder traversal.

    • Traverse the tree in a bottom-up manner, starting from the leaf nodes.

    • For each node, update its value to the sum of its children's values.

    • Set leaf nodes to 0.

    • Return the preorder traversal of the modified tree.

  • Answered by AI
  • Q2. What are the core concepts of indexing in Database Management Systems (DBMS)?
  • Ans. 

    Core concepts of indexing in DBMS include types of indexes, benefits of indexing, and factors affecting index performance.

    • Types of indexes: B-tree, Hash, Bitmap, etc.

    • Benefits of indexing: Faster data retrieval, improved query performance, reduced disk I/O.

    • Factors affecting index performance: Selectivity, clustering factor, index fragmentation.

    • Examples: Creating an index on a column in a table to speed up search queries

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute of Technology Delhi (New Campus). Eligibility criteria7 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structures, OS, DBMS, Algorithms, Networking, Coding, OOPTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Strengthen your coding, algorithms. This is one most important thing for OYO. Practice Graph, tree, DP, greedy, recursion, data structures questions.
Tip 2 : OS, DBMS concepts will give you an edge over others. Like serialisation, index, deadlock, semaphore
Tip 3 : Only mention those projects in your resume which you are very clear about. They don't ask for detailed explanation, just an overall idea about your projects will increase your chances

Application resume tips for other job seekers

Tip 1 : Mention college projects wisely. No need to mention fancy projects. Any project that you can describe to the interviewer will be a best solution
Tip 2 : Neat & clean resume with your skills, technical stacks that you mastered. That's all. They don't require you to be very active in extra-curricular activities, and these things will not give you any advantage.
Tip 3 : Keep it of single page

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Travel Boutique Online Interview FAQs

How many rounds are there in Travel Boutique Online Senior Software Development Engineer interview?
Travel Boutique Online interview process usually has 2 rounds. The most common rounds in the Travel Boutique Online interview process are Coding Test and One-on-one Round.

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

INTERVIEWS

S&P Global

No Interviews

INTERVIEWS

Antino

No Interviews

INTERVIEWS

Fragomen Immigration Services

No Interviews

INTERVIEWS

Headout

No Interviews

INTERVIEWS

Quorum Software

No Interviews

INTERVIEWS

Elektrobit India

No Interviews

INTERVIEWS

S&P Global

30 top interview questions

INTERVIEWS

Elektrobit India

No Interviews

Tell us how to improve this page.

Travel Boutique Online Senior Software Development Engineer Interview Process

based on 1 interview

Interview experience

1
  
Bad
View more

Interview Questions from Similar Companies

Oyo Rooms Interview Questions
3.3
 • 217 Interviews
MakeMyTrip Interview Questions
3.7
 • 122 Interviews
BCD Travel Interview Questions
4.3
 • 111 Interviews
Expedia Group Interview Questions
3.8
 • 75 Interviews
Thomas Cook Interview Questions
3.7
 • 44 Interviews
Yatra Interview Questions
3.4
 • 31 Interviews
Airbnb Interview Questions
3.8
 • 23 Interviews
View all
Travel Consultant
45 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
38 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Travel Consultant
34 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Executive Accountant
25 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Executive
24 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Travel Boutique Online with

Cox & Kings

3.7
Compare

MakeMyTrip

3.7
Compare

Yatra

3.4
Compare

Cleartrip

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