i
TravoZone
Filter interviews by
I applied via Apna Jobs and was interviewed in Sep 2024. There was 1 interview round.
To increase the number of Pax in a married segment, offer discounts for booking multiple tickets together.
Offer discounts for booking multiple tickets together
Promote family or group travel packages
Provide incentives for adding additional passengers to existing bookings
To show the connection in Amadeus, create a multi-city itinerary with separate segments for each leg of the journey.
Create a multi-city itinerary in Amadeus with the following segments: DEL-DXB, DXB-AUH, AUH-LHR.
Ensure that there is enough layover time between the flights to account for the cab ride from DXB to AUH.
Enter the passenger's details and preferences for each segment of the journey.
Confirm the booking and pro...
The command to find the minimum time needed to travel between 2 terminals in Amadeus is TTP/T1T2 and in Sabre is TTP/T1T2.
In Amadeus, the command is TTP/T1T2 where T1 and T2 are the terminal codes of the departure and arrival terminals respectively.
In Sabre, the command is TTP/T1T2 where T1 and T2 are the terminal codes of the departure and arrival terminals respectively.
Accuracy is ensured by double-checking dates, using calendar tools, and verifying with customers.
Double-check dates before finalizing ticket issuance
Use calendar tools to avoid errors in date entry
Verify dates with customers to ensure accuracy
IATA EasyPay is a payment solution for travel agents to issue tickets efficiently and securely.
IATA EasyPay allows agents to make payments for airline tickets without needing a credit card.
It provides a secure and efficient way to manage ticketing transactions.
Agents can issue tickets directly through their GDS using EasyPay credentials.
Example: An agent can use EasyPay to pay for a ticket and receive a confirmation in...
Top trending discussions
I applied via Referral and was interviewed in Feb 2022. There were 4 interview rounds.
Hackerrank test : 3 questions
1. Simple Array
2. Recursion followed by DP
3. DFS/BFS Graph Question
IRCTC reserves seats using a complex system of availability checks and booking processes.
IRCTC uses a combination of real-time availability checks and booking processes to reserve seats.
The system checks for availability of seats in real-time and reserves them for a short period of time while the booking process is completed.
IRCTC uses a locking mechanism to ensure that the same seat is not booked by multiple users at ...
Makemytrip blocks seat for 15 mins by using a hold on the seat inventory.
Makemytrip uses a hold on the seat inventory to block the seat for 15 mins.
If the payment doesn't go through, the hold is released and the seat becomes available again.
This ensures that the seat is not booked by someone else during the payment process.
The hold time can vary depending on the airline's policy.
Makemytrip also sends reminders to compl...
Checked exceptions are checked at compile-time while unchecked exceptions are not.
Checked exceptions are those that are checked at compile-time and must be handled by the programmer.
Unchecked exceptions are those that are not checked at compile-time and can be handled or not handled by the programmer.
Checked exceptions are subclasses of Exception class while unchecked exceptions are subclasses of RuntimeException class...
Comparison of in-memory and distributed databases
In-memory databases are faster due to data being stored in RAM
Distributed databases offer better scalability and fault tolerance
In-memory databases are limited by available RAM
Distributed databases require more complex setup and maintenance
In-memory databases are suitable for real-time applications
Distributed databases are suitable for large-scale applications with high ...
I appeared for an interview before Mar 2023.
LC Medium+ easy questions
I appeared for an interview in Nov 2020.
Round duration - 90 minutes
Round difficulty - Medium
Basically a hackerrank link was shared and I was suppose to take the test within a day. Online Test comprised of 3 algorithmic Questions. Duration of round was 90 minutes.
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...
The task is to find the total number of ways to make change for a specified value using given denominations.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the number of ways to make change for each value up to the specified value.
Iterate through the denominations and update the array based on the current denomination.
The final answer will be in the last cell of the array correspond...
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to solve this problem efficiently.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the array as the length of the longest increasi...
Round duration - 70 minutes
Round difficulty - Medium
It was a 60 minute virtual face 2 face round with 2 senior software engineers of the company. Interview started with brief introduction by the engineers followed by my Introduction. Interview started at 3:00 P.M and lasted till 4:10 P.M. Google Doc was used for coding purposes.
Given a sorted array that has been rotated, the task is to find the index of a specific element. The array is initially sorted in ascending order and then rotated ...
Search for an element in a rotated sorted array in O(logN) time complexity.
Implement binary search to find the pivot point where rotation occurs.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle cases where the element lies in the left or right subarray after rotation.
Given an array parent
which represents a binary tree, the parent-child relationship is defined by (PARENT[i], i)
, meaning that the parent of i
is PAR...
Construct a binary tree from parent array representation ensuring specific conditions are met.
Iterate through the parent array to create the binary tree
Handle cases where a node has both left and right children
Ensure left child is smaller than the right child if both exist
If a node has only one child, make it the left child
Round duration - 60 minutes
Round difficulty - Medium
It was a face 2 face algorithmic round taken by Senior Backend engineer. Interview Round Started at around 2:00 P.M and lasted till 3:05 P.M. Interview started with the brief introduction followed by 2 algorithmic questions. Interviewer was focusing problem solving skills. After discussing the approach, Coding part was to be done on google doc.
Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...
Find the maximum sum that can be obtained from a path in a matrix from the first row to the last row.
Use dynamic programming to keep track of the maximum sum at each cell in the matrix.
Consider moving down, diagonally left, and diagonally right to calculate the maximum sum.
Start from the second row and update each cell with the maximum sum from the cell above it and the diagonally adjacent cells.
Continue this process u...
Given an array ARR
consisting of 'N' positive integers, determine if it is possible to partition the array into two subsets such that the sum of the elements in both sub...
The problem is to determine if it is possible to partition an array into two subsets with equal sum.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store if a subset with a particular sum is possible.
Check if it is possible to form a subset with half the total sum of the array.
Round duration - 120-130 minutes
Round difficulty - Medium
It was a face 2 face round which was taken by Line manager. Interview started at 11:00 A.M and lasted around 2 hours approx. Interviewer was very friendly and supportive. Interview started with brief introduction of the interviewer followed by mine. Then a System design question was asked by the interviewer over google doc. Interviewer was focusing on how I'm approaching the problem. Overall It was a good experience.
Tip 1 : We should focus on other topics apart from DSA. Knowledge of LLD, HLD, OOPS and other subjects also plays a very important role.
Tip 2 : Communication also plays a key role in interviews. We should be able to explain our solution precisely and also able to catch hints given by Interviewer.
Tip 3 : While practising DSA focus should be on logic building rather than cramming the solution because proper reasoning will hep you to solve other new questions.
Tip 4 : Always remember interview is two way communication.
Tip 1 : Mention only those projects and skills in which you are confident.
Tip 2 : Resume should be of one page(preferrable).
I applied via Job Portal and was interviewed in Feb 2024. There were 2 interview rounds.
1. Slowest Key
2. Junggle Box
3. Kind of Sum
I have experience working on various software projects in different industries.
Developed web applications using Java, Spring Boot, and Angular for a finance company
Worked on mobile app development using React Native for a healthcare startup
Implemented machine learning algorithms in Python for a data analytics project
I applied via Referral and was interviewed before Dec 2023. There was 1 interview round.
I applied via Approached by Company and was interviewed in Oct 2023. There was 1 interview round.
Digital marketing is the use of online platforms and technologies to promote products or services.
Utilizes social media, email marketing, SEO, and online advertising
Targets specific audiences based on demographics, interests, and behaviors
Measures success through metrics like website traffic, conversion rates, and ROI
Yes, I am aware of the latest updates of Google.
Google recently announced the Page Experience update which focuses on user experience metrics like Core Web Vitals.
Google also introduced the MUM (Multitask Unified Model) which is a new AI model for understanding complex search queries.
There have been updates in Google Ads, Google Maps, and Google Workspace as well.
SEO stands for Search Engine Optimization, which is the practice of increasing the quantity and quality of traffic to your website through organic search engine results.
SEO involves optimizing your website content and structure to make it more attractive to search engines like Google.
Keywords play a crucial role in SEO, as they help search engines understand what your content is about.
Backlinks from reputable websites ...
I appeared for an interview before Jan 2024.
General aptitude, SQL, and basic coding exercises.
Coding according to our current roles.
I applied via Walk-in and was interviewed before Oct 2023. There was 1 interview round.
PHP array functions are built-in functions in PHP that allow manipulation and handling of arrays.
Some common PHP array functions include array_push(), array_pop(), array_merge(), array_filter(), and array_map().
These functions can be used to add elements to an array, remove elements from an array, merge arrays, filter arrays based on a callback function, and apply a callback function to each element of an array.
Example...
Basic javascript questions.
Some of the top questions asked at the TravoZone interview -
based on 1 interview experience
Difficulty level
Duration
P&O Cruises
Country Holidays Travel India
TFG Vacations
Veena world