AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Yatra UI Developer Interview Questions and Answers for Experienced
Yatra UI Developer Interview Experiences for Experienced
1 interview found
Anonymous
I applied via Naukri.com and was interviewed before Apr 2020. There were 4 interview rounds.
Interview Questionnaire
3 Questions
- Q1. What is the difference between __proto__ and prototype
- Ans.
The __proto__ is a property that points to the prototype of an object, while prototype is a property of a constructor function.
The __proto__ property is used to access the prototype of an object.
The prototype property is used to add properties and methods to a constructor function.
The __proto__ property is deprecated and should not be used in production code.
Changes to the prototype of a constructor function will affec
- Q2. Css related questions
- Q3. PWS related questions
Interview Preparation Tips
Skills evaluated in this interview
Interview questions from similar companies
Machine coding round
(2 Questions)
- Q1. Explain your project
- Ans.
Developed a web application for managing inventory and sales for a retail store
Used React.js for front-end development
Implemented Node.js for back-end functionality
Utilized MongoDB for database management
- Q2. Tell me about yourself
- Ans.
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development technologies
Strong problem-solving skills
Team player with excellent communication skills
Selected
I applied via LinkedIn and was interviewed before Jun 2023. There were 2 interview rounds.
(2 Questions)
- Q1. Discussion about Hashmaps.
- Q2. How to make Spring Applications?
- Ans.
Spring applications can be made using Spring Boot, which simplifies the setup and configuration process.
Use Spring Initializr to create a new Spring Boot project
Add dependencies in the pom.xml file for required Spring modules
Create Java classes with annotations like @Controller, @Service, @Repository, etc.
Define application properties in application.properties or application.yml file
Run the application using the main m
(2 Questions)
- Q1. Discussion about Goals.
- Q2. Discussed points from Resume
Skills evaluated in this interview
Custom problem was given and asked to solve and discuss solution with the interviewer
Current project discussion with panel
(1 Question)
- Q1. Behaviour questions
I was interviewed in Dec 2020.
(2 Questions)
Round duration - 75 minutes
Round difficulty - Easy
This round was conducted in Hackerrank portal for a total duration of 75 minutes and was divided into 4 sections.
1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes
This Round was Conducted on Hackerrank (Webcam Enabled).
- Q1. Given a problem statement and a code, how would you find and correct the bugs in the code?
- Ans.
To find and correct bugs in code, analyze problem statement, review code, use debugging tools, run test cases, and make necessary changes.
Understand the problem statement and expected output
Review the code for syntax errors, logical errors, and potential bugs
Use debugging tools like breakpoints, print statements, and IDE features
Run test cases to identify the bugs and verify the corrections
Make necessary changes to the
- Q2.
Count Nodes within K-Distance Problem Statement
Given a connected, undirected, and acyclic graph where some nodes are marked and a positive integer 'K'. Your task is to return the count of nodes such that...
- Ans.
Count the number of nodes within K-distance from marked nodes in a connected, undirected, acyclic graph.
Create a graph using the given vertices and edges.
Perform a BFS traversal starting from each marked node to find nodes within K-distance.
Count the nodes within K-distance from all marked nodes and return the total count.
(3 Questions)
Round duration - 90 minutes
Round difficulty - Medium
I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM
- Q1.
Problem Statement: Largest Subarray with Equal Number of 0s and 1s
Given an array containing only 0s and 1s, determine the length of the longest contiguous subarray that has an equal number of 0s and 1s.
... - Ans.
Find the length of the longest subarray with equal number of 0s and 1s in a given array of 0s and 1s.
Iterate through the array and maintain a running count of the difference between the number of 0s and 1s encountered so far.
Store the count values in a hashmap with the index as the key.
If the same count is encountered again, calculate the length of the subarray between the two occurrences.
Return the maximum length foun
- Q2. Can you explain how the file system is stored on a disk and how it works?
- Ans.
File system is stored on disk using data blocks and metadata, organized in a hierarchical structure.
File system is stored on disk using data blocks and metadata
Data blocks contain actual file data, while metadata stores information about files and directories
File system is organized in a hierarchical structure with directories containing files and subdirectories
File system uses a file allocation table (FAT) or an index
- Q3. Can you distinguish between RISC and CISC architectures?
- Ans.
RISC focuses on simplicity and efficiency, while CISC emphasizes complex instructions and flexibility.
RISC uses a small set of simple instructions, while CISC uses a large set of complex instructions.
RISC architectures have a uniform instruction format, while CISC architectures have variable-length instructions.
RISC architectures rely on optimizing compilers for performance, while CISC architectures have hardware optim...
Round duration - 45 minutes
Round difficulty - Easy
The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.
Interview Preparation Tips
Tip 1 : Make sure that you are thorough with CS concepts beforehand.
Tip 2 : Even when you are explaining the approach to a question, try to parallelly think about how you would code it.
Tip 3 : Read the previous interview experiences. It would give a fair idea of the kind of questions one should expect.
Tip 4 : For a company like Adobe, practicing medium difficulty level coding questions would be the way to go.
Tip 5 : Practice atleast 200 questions from coding platforms like CodeZen, LeetCode, Interviewbit as they contain common interview questions.
Tip 1 : Mention atleast 1 project and past work experience as it sets good impression.
Tip 2 : Keep your resume up to date for the role you are applying.
Tip 3 : Try to keep your resume of 1 Page.
Skills evaluated in this interview
I was interviewed in Jul 2022.
(1 Question)
Round duration - 180 Minutes
Round difficulty - Medium
coding questions on DSA and MCQs on java
timing : late night
no camera
- Q1.
Knight Probability in Chessboard
Calculate the probability that a knight remains on an N x N chessboard after making K moves. Initially, the knight is placed at a given position on the board. It can move ...
- Ans.
Calculate the probability that a knight remains on an N x N chessboard after making K moves.
Use dynamic programming to calculate the probability of the knight staying on the board after each move.
Consider all possible moves the knight can make from its current position.
Keep track of the probabilities at each position on the board after each move.
Normalize the probabilities at the end to get the final result.
Example: Fo...
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
It was a DSA round.
- Q1.
Binary Tree to Doubly Linked List
Transform a given Binary Tree into a Doubly Linked List.
Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.
Input:
The fi... - Ans.
Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.
Perform Inorder Traversal of the Binary Tree to get the nodes in order.
Create a Doubly Linked List by connecting the nodes in the order obtained from Inorder Traversal.
Return the head of the Doubly Linked List as the output.
- Q2.
Find Duplicates in an Array
Given an array
ARRof size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.Return the duplicate elements in any orde...
- Ans.
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Return elements with count greater than 1 as duplicates.
Time complexity can be optimized to O(N) using a set to store duplicates.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
DSA Questions were asked.
- Q1.
Remove Character from String Problem Statement
Given a string
strand a character 'X', develop a function to eliminate all instances of 'X' fromstrand return the resulting string.Input:
The first lin...
- Ans.
Develop a function to remove all instances of a given character from a string.
Iterate through the string character by character and skip the character to be removed.
Build a new string by appending characters that are not equal to the given character.
Return the final modified string.
Handle edge cases like empty string or character not found in the string.
- Q2.
String Rearrangement Problem Statement
You are given a string of lowercase characters. The objective is to rearrange (reorder) the string so that no two adjacent characters are identical.
Return the rear...
- Ans.
The objective is to rearrange a string so that no two adjacent characters are identical. Return the rearranged string or 'NO SOLUTION'.
Iterate through the string and count the frequency of each character.
Create two lists, one for characters with odd frequency and one for characters with even frequency.
If the count of characters with odd frequency is greater than 1, return 'NO SOLUTION'.
Alternate between characters with...
Round duration - 50 Minutes
Round difficulty - Easy
It was a behavioural round.
Interview Preparation Tips
Tip 1 : strong grasp on DSA and problem solving
Tip 2 : follow leetcode (try to do as many medium questions as possible)
Tip 3 : should focus on development also and internships
Tip 1 : good projects and coding profiles like leetcode
Tip 2 : some good internships also help
Skills evaluated in this interview
It was a medium-level DSA round
This was also a DSA round
This again a DSA round
(1 Question)
- Q1. Can't disclose the question because of NDA signed but it was a design round
(1 Question)
- Q1. This was a project discussion round
Interview Questionnaire
17 Questions
- Q1. Find if a string is substring of other string
- Ans.
The function checks if a string is a substring of another string.
Use the built-in string methods like 'indexOf' or 'includes' to check for substring.
If the language supports regular expressions, you can also use them to find substrings.
Consider the case sensitivity of the strings when comparing.
- Q2. Write a code to multiply two matrices of dimension M*N and N*K
- Ans.
Code to multiply two matrices of dimension M*N and N*K.
Create a result matrix of dimension M*K.
Iterate through each row of the first matrix.
For each row, iterate through each column of the second matrix.
For each element in the row of the first matrix, multiply it with the corresponding element in the column of the second matrix.
Sum up the products and store the result in the corresponding position of the result matrix.
...
- Q3. Write a Sql to perform Matrix Multiplication.Two tables has three columns row,col and value
- Ans.
SQL query to perform matrix multiplication using two tables with row, col, and value columns.
Use JOIN operation to combine the two tables based on matching row and col values.
Use GROUP BY clause to group the result by row and col values.
Use SUM function to calculate the dot product of corresponding row and col values.
Use INSERT INTO statement to insert the result into a new table.
- Q4. What is prototype in javascript?
- Ans.
Prototype in JavaScript is an object that is associated with every function and object by default.
Prototype is used to add properties and methods to an object.
It allows objects to inherit properties and methods from other objects.
Modifying the prototype of a function affects all instances of that function.
Prototypes can be used to create new objects based on existing objects.
The prototype chain allows for property and
- Q5. How do we write classes in javascript?
- Ans.
Classes in JavaScript are written using the class keyword.
Use the class keyword followed by the class name to define a class.
Use the constructor method to initialize class properties.
Add methods to the class using the class prototype.
Use the new keyword to create an instance of the class.
- Q6. There is a ladder of N steps.We can either take 1 step or 2 steps.In how many different ways one can climb the ladder?
- Ans.
The number of different ways to climb a ladder of N steps by taking 1 or 2 steps at a time.
This is a classic problem that can be solved using dynamic programming.
The number of ways to climb N steps is equal to the sum of the number of ways to climb N-1 steps and N-2 steps.
The base cases are when N is 0 or 1, where there is only 1 way to climb the ladder.
For example, for N=4, there are 5 different ways: [1, 1, 1, 1], [1
- Q7. Print a square matrix in spiral order
- Ans.
Print a square matrix in spiral order
Start by defining the boundaries of the matrix
Iterate through the matrix in a spiral pattern, printing each element
Adjust the boundaries after each iteration to move inward
Repeat until all elements are printed
- Q8. Given a table with 3 columns StudentName,Subject and Marks.Write a sql to retrieve second highest Marks Obtained for each student
- Ans.
Retrieve the second highest marks obtained by each student from a table with student name, subject, and marks.
Use the RANK() function to assign a rank to each row based on the marks in descending order.
Filter the result to only include rows with rank 2 for each student.
Group the result by student name to get the second highest marks for each student.
- Q9. Given a Website with header,footer,side ads(Google ads,Internal ads).How will you extract only useful data from the page
- Q10. Difference between .live() and .delegate() in jquery
- Ans.
The .live() method attaches an event handler to the current and future elements, while .delegate() attaches an event handler to a parent element.
The .live() method is deprecated in newer versions of jQuery.
The .delegate() method is preferred over .live() for performance reasons.
Both methods are used to handle events for dynamically added elements.
Example: $(document).live('click', 'button', function() { ... });
Example:...
- Q11. What is chaining in jquery?
- Ans.
Chaining in jQuery allows multiple methods to be called on a single element in a single line of code.
Chaining simplifies code and improves readability.
Each method in the chain operates on the result of the previous method.
The chain ends with a method that does not return a jQuery object.
Example: $('div').addClass('highlight').fadeOut();
- Q12. What is callback function?
- Ans.
A callback function is a function that is passed as an argument to another function and is executed later.
Callback functions are commonly used in event-driven programming.
They allow asynchronous execution of code.
Callback functions can be used to handle responses from APIs or user interactions.
They can be anonymous functions or named functions.
Example: setTimeout(function() { console.log('Hello!'); }, 1000);
- Q13. What is .bind() function in jquery?
- Ans.
The .bind() function in jQuery is used to attach an event handler function to one or more elements.
It allows you to specify the event type and the function to be executed when the event occurs.
The .bind() function can be used to bind multiple events to the same element.
It can also be used to pass additional data to the event handler function.
The .bind() function is deprecated in jQuery version 3.0 and above. It is reco
- Q14. Find the angle between hour handle and minute handle in a clock
- Ans.
The angle between the hour and minute hands of a clock can be calculated using a formula.
The hour hand moves 30 degrees per hour and 0.5 degrees per minute.
The minute hand moves 6 degrees per minute.
Calculate the angle between the two hands using the formula: |30H - 11M/2|, where H is the hour and M is the minute.
- Q15. Is it possible to create slideshow without using javascript
- Ans.
Yes, it is possible to create a slideshow without using JavaScript.
Use CSS animations and transitions to create the slideshow.
Use HTML and CSS to structure and style the slideshow.
Utilize keyframe animations to create the slide transitions.
Use radio buttons or checkboxes to control the slideshow navigation.
Apply the :target pseudo-class to create a simple slideshow without JavaScript.
- Q16. Questions about my current project and academic project
- Q17. Given two points A and B with distance between them lets say D.there are N men who want to go from point A to point B.All men walk with same speed.They also have one scooter with them which has speed grea...
- Ans.
The men can take turns riding the scooter, allowing them to reach point B faster.
The men can form a queue and take turns riding the scooter.
The person riding the scooter can drop it off at a certain point and the next person can pick it up.
The scooter can be passed along the line of men until everyone reaches point B.
Interview Preparation Tips
College Name: na
Skills evaluated in this interview
I was interviewed before Feb 2021.
(3 Questions)
Round duration - 90 minutes
Round difficulty - Medium
Questions on aptitude, English, logical reasoning, C/C++ and 5 coding ques. (only pseudo code).
- Q1.
Minimum Jumps Problem Statement
Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...
- Ans.
Find the minimum number of trampoline jumps Bob needs to make to reach the final shop, or return -1 if it's impossible.
Use Breadth First Search (BFS) algorithm to find the minimum number of jumps required.
Keep track of the visited shops to avoid revisiting them.
If a shop has an Arr value of 0, it is impossible to reach the final shop.
Return -1 if the final shop cannot be reached.
- Q2.
Smallest Window Problem Statement
Given two strings,
SandX, your task is to find the smallest substring inSthat contains all the characters present inX.Example:
Input:
S = "abdd", X = "bd"
Outpu...
- Ans.
Find the smallest substring in S that contains all characters in X.
Use a sliding window approach to find the smallest window in S containing all characters of X.
Maintain a hashmap to keep track of characters in X and their frequencies in the current window.
Slide the window to the right, updating the hashmap and shrinking the window until all characters in X are present.
Return the smallest window found.
Example: S = 'abd
- Q3.
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.
Find all possible paths for a rat in a maze from start to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Return paths in alphabetical order as a list of strings.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Questions based on OOPS were asked in this round.
- Q1. What is a virtual function?
- Ans.
A virtual function is a function in a base class that is declared using the keyword 'virtual' and can be overridden by a function with the same signature in a derived class.
Virtual functions allow for dynamic polymorphism in C++
They are used in inheritance to achieve runtime polymorphism
Virtual functions are declared in a base class and can be overridden in derived classes
They are called based on the type of object bei...
- Q2. What are the types of polymorphism in Object-Oriented Programming?
- Ans.
Types of polymorphism in OOP include compile-time (method overloading) and runtime (method overriding) polymorphism.
Compile-time polymorphism is achieved through method overloading, where multiple methods have the same name but different parameters.
Runtime polymorphism is achieved through method overriding, where a subclass provides a specific implementation of a method that is already defined in its superclass.
Polymor...
- Q3. What is the difference between deep copy and shallow copy?
- Ans.
Deep copy creates a new object and recursively copies all nested objects, while shallow copy creates a new object and copies only the references to nested objects.
Deep copy creates a new object and copies all nested objects, while shallow copy creates a new object and copies only the references to nested objects.
In deep copy, changes made to the original object do not affect the copied object, while in shallow copy, ch...
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
I was interviewed before Jan 2021.
(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.
- 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...
(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
nextpoints 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.
- Q2.
Closest Sum Problem Statement
Given an array of integers
ARRof sizeNand an integertarget, find three integers inARRsuch that their sum is closest to thetarget. 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.
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
Yatra Interview FAQs
Tell us how to improve this page.
Yatra Interviews By Designations
- Yatra Software Engineer Interview Questions
- Yatra Software Developer Interview Questions
- Yatra Senior Software Engineer Interview Questions
- Yatra Corporate Sales Interview Questions
- Yatra Manager Interview Questions
- Yatra Business Analyst Interview Questions
- Yatra Engineering Manager Interview Questions
- Yatra Sales Executive Interview Questions
- Show more
Interview Questions for Popular Designations
- UI UX Developer Interview Questions
- Front end Developer Interview Questions
- Web Developer Interview Questions
- Backend Developer Interview Questions
- Software Developer Intern Interview Questions
- Senior UI Developer Interview Questions
- Junior Software Developer Interview Questions
- Full Stack Software Developer Interview Questions
- Show more
Interview Questions from Similar Companies
|
Senior Travel Consultant
226
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Senior Executive
219
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Travel Consultant
115
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Assistant Manager
111
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Team Lead
91
salaries
| ₹0 L/yr - ₹0 L/yr |
MakeMyTrip
Cleartrip
Goibibo
Oyo Rooms
- Home >
- Interviews >
- Yatra Interview Questions >
- Yatra UI Developer Interview Questions for Experienced
