Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Agoda Full Stack Developer Interview Questions and Answers

Updated 14 Oct 2024

Agoda Full Stack Developer Interview Experiences

2 interviews found

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

I applied via Approached by Company and was interviewed before Oct 2023. There were 4 interview rounds.

Round 1 - One-on-one 

(3 Questions)

  • Q1. Questions related to the past experience and projects
  • Q2. Coding problem related to frontend in react
  • Q3. System design question on showing live number of users on hotel page.
Round 2 - One-on-one 

(1 Question)

  • Q1. A leetcode problem
Round 3 - One-on-one 

(2 Questions)

  • Q1. Problem related to Code review
  • Q2. System design question
Round 4 - One-on-one 

(2 Questions)

  • Q1. Problem related to Code review
  • Q2. System Design tiktok

I applied via Referral and was interviewed in Dec 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. 4 rounds. Ist Machine Coding Round, 2nd Coding Round (Hard, Medium, solved both in 45 minutes, rest of the time we were discussing about company and my expectation), 3rd System Design Interview (Many Cross...

Interview Preparation Tips

Interview preparation tips for other job seekers - process is somewhat obscure, no feedback from HR.

Full Stack Developer Interview Questions Asked at Other Companies

asked in DBS Bank
Q1. Query and Matrix Problem Statement You are given a binary matrix ... read more
asked in Accenture
Q2. Find Duplicates in an Array Given an array ARR of size 'N', where ... read more
asked in MakeMyTrip
Q3. Tower of Hanoi Problem Statement You have three rods numbered fro ... read more
Q4. Maximum Difference Problem Statement Given an array ARR of N elem ... read more
asked in Samsung
Q5. LCA of Binary Tree Problem Statement You are given a binary tree ... read more

Interview questions from similar companies

I was interviewed in Sep 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

The test was in the morning at around 11.
It was on online assessment.
HackerEarth was perfect like everytime.\
MCQ were based on HTML ,CSS , JS, OOPS, SQL, Aptitude, OS.

  • Q1. 

    Reach the Destination Problem Statement

    You are given a source point (sx, sy) and a destination point (dx, dy). Determine if it is possible to reach the destination point using only the following valid mo...

  • Ans. 

    The problem involves determining if it is possible to reach a destination point from a source point using specified moves.

    • Iterate through each test case and check if destination is reachable from source using specified moves

    • Implement a recursive function to explore all possible paths from source to destination

    • Keep track of visited points to avoid infinite loops

    • Return true if destination is reachable, false otherwise

  • Answered by AI
  • Q2. 

    Delete Node in Binary Search Tree Problem Statement

    You are provided with a Binary Search Tree (BST) containing 'N' nodes with integer data. Your task is to remove a given node from this BST.

    A BST is a ...

  • Ans. 

    Implement a function to delete a node from a Binary Search Tree and return the inorder traversal of the modified BST.

    • Understand the properties of a Binary Search Tree (BST) - left subtree contains nodes with data less than the node, right subtree contains nodes with data greater than the node.

    • Implement a function to delete the given node from the BST while maintaining the BST properties.

    • Perform inorder traversal of the...

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 90 Minutes
Round difficulty - Hard

The interviewer was very friendly. He gave me problems one by one and asked me to write code for all of them in Code Pair round. Explain Scope and Scope Chain in javascript. What is a Stored Procedure in SQL?

  • Q1. 

    Shortest Path in a Binary Matrix Problem Statement

    Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...

  • Ans. 

    Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.

    • Use Breadth First Search (BFS) algorithm to find the shortest path.

    • Keep track of visited cells to avoid revisiting them.

    • Calculate the path length by counting the number of 1s in the path.

    • Handle edge cases such as invalid inputs and unreachable destination.

  • Answered by AI
  • Q2. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Given an array of integers and a target sum, find all pairs of elements that add up to the target sum.

    • Use a hashmap to store the difference between the target sum and each element as keys and their indices as values.

    • Iterate through the array and check if the current element's complement exists in the hashmap.

    • Return the pairs of elements that add up to the target sum in sorted order.

  • Answered by AI
  • Q3. 

    Validate Binary Search Tree (BST)

    You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).

    BST Definition:

    A Binary Search Tr...

  • Ans. 

    Validate if a given binary tree is a Binary Search Tree (BST) or not.

    • Check if the left subtree of a node contains only nodes with data less than the node's data.

    • Check if the right subtree of a node contains only nodes with data greater than the node's data.

    • Ensure that both the left and right subtrees are also binary search trees.

    • Traverse the tree in an inorder manner and check if the elements are in sorted order.

    • Recurs...

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

The round was with CTO level person. He was very friendly. What is the difference between SQL and MySQL? What are Constraints in SQL?

  • Q1. 

    Longest Duplicate Substring Problem Statement

    You are provided with a string 'S'. The task is to determine the length of the longest duplicate substring within this string. Note that duplicate substrings ...

  • Ans. 

    Find the length of the longest duplicate substring in a given string.

    • Iterate through all possible substrings of the input string.

    • Use a rolling hash function to efficiently compare substrings.

    • Store the lengths of duplicate substrings and return the maximum length.

  • Answered by AI
  • Q2. 

    Maximum Sum of Products for Array Rotations

    You are given an array ARR consisting of N elements. Your task is to determine the maximum value of the summation of i * ARR[i] among all possible rotations of ...

  • Ans. 

    Find the maximum sum of products for array rotations.

    • Iterate through all possible rotations of the array and calculate the sum of products for each rotation.

    • Keep track of the maximum sum of products found so far.

    • Return the maximum sum of products obtained.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Fullstack Developer in BangaloreEligibility criteria7 CGPAMakeMyTrip interview preparation:Topics to prepare for the interview - Data Structures, OOPS, OS, DBMS, Computer NetworkingTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : DSA should be very very good.
Tip 2 : Computer Science Fundamentals are very important
Tip 3 : Think out loud in an interview

Application resume tips for other job seekers

Tip 1 : At least 2 very well prepared projects
Tip 2 : Internship experiences always help

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Sep 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Easy

2 Coding Questions and 20 MCQ's to be solved in 90 minutes. It was from 6 pm. The camera and screen-recorders were on. The mcq was on web, oops, dbms.

  • Q1. 

    Number of Islands II Problem Statement

    You have a 2D grid of dimensions 'N' rows by 'M' columns, initially filled with water. You are given 'Q' queries, where each query contains two integers 'X' and 'Y'....

  • Ans. 

    The task is to determine the number of islands present on a 2D grid after each query of converting water to land.

    • Create a function that takes the grid dimensions, number of queries, and query coordinates as input.

    • For each query, convert the water at the given coordinates to land and then count the number of islands on the grid.

    • Use depth-first search (DFS) or breadth-first search (BFS) to identify connected land cells f...

  • Answered by AI
  • Q2. 

    Make Array Elements Equal Problem Statement

    Given an integer array, your objective is to change all elements to the same value, minimizing the cost. The cost of changing an element from x to y is defined ...

  • Ans. 

    Find the minimum cost to make all elements of an array equal by changing them to the same value.

    • Calculate the median of the array and find the sum of absolute differences between each element and the median.

    • Sort the array and find the median element, then calculate the sum of absolute differences between each element and the median.

    • If the array has an even number of elements, consider the average of the two middle elem

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 70 minutes
Round difficulty - Medium

The interview started with the interviewer asking me about my projects and why and what I have used in them. Be very clear with all the technologies you have used in your project as the interviewer will ask you in-depth about it.
Explain Components, Modules and Services in Angular. What is a Recursive Stored Procedure?

  • Q1. 

    Sub Sort Problem Statement

    You are given an integer array ARR. Determine the length of the shortest contiguous subarray which, when sorted in ascending order, results in the entire array being sorted in a...

  • Ans. 

    Determine the length of the shortest contiguous subarray that needs to be sorted to make the entire array sorted in ascending order.

    • Iterate from left to right to find the first element out of order.

    • Iterate from right to left to find the last element out of order.

    • Calculate the length of the subarray between the two out of order elements.

  • Answered by AI
  • Q2. 

    Minimum Operations Problem Statement

    You are given an array 'ARR' of size 'N' consisting of positive integers. Your task is to determine the minimum number of operations required to make all elements in t...

  • Ans. 

    Minimum number of operations to make all elements in an array equal by performing addition, subtraction, multiplication, or division.

    • Iterate through the array to find the maximum and minimum elements.

    • Calculate the difference between the maximum and minimum elements.

    • The minimum number of operations needed is the difference between the maximum and minimum elements.

  • Answered by AI
  • Q3. 

    Tower of Hanoi Problem Statement

    You have three rods numbered from 1 to 3, and 'N' disks initially stacked on the first rod in increasing order of their sizes (largest disk at the bottom). Your task is to...

  • Ans. 

    Tower of Hanoi problem involves moving 'N' disks from one rod to another following specific rules in less than 2^N moves.

    • Implement a recursive function to move disks from one rod to another while following the rules.

    • Use the concept of recursion and backtracking to solve the Tower of Hanoi problem efficiently.

    • Maintain a count of moves and track the movement of disks in a 2-D array/list.

    • Ensure that larger disks are not p...

  • Answered by AI
  • Q4. Can you explain the concepts of multithreading and semaphore in operating systems?
  • Ans. 

    Multithreading allows multiple threads to run concurrently, while semaphores are used to control access to shared resources in a synchronized manner.

    • Multithreading involves running multiple threads within a single process, allowing for parallel execution of tasks.

    • Semaphores are used to control access to shared resources by allowing only a certain number of threads to access the resource at a time.

    • Semaphores can be bina...

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

The interviewer was VP of Engineering at MakeMyTrip with more than 10 years of experience. He asked about the 4 Pillars of OOPS and we had an in-depth discussion with real-life applications for each of them.

  • Q1. 

    Square Root with Decimal Precision Problem Statement

    You are provided with two integers, 'N' and 'D'. Your objective is to determine the square root of the number 'N' with a precision up to 'D' decimal pl...

  • Ans. 

    Implement a function to find the square root of a number with a given precision.

    • Create a function that takes 'N' and 'D' as input parameters

    • Use a mathematical algorithm like Newton's method to approximate the square root

    • Iterate until the precision condition is met

    • Return the square root with the required precision

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Vellore Institute of Technology. Eligibility criteria8.5 CGPAMakeMyTrip interview preparation:Topics to prepare for the interview - DSA, OOPS, OS, DBMS, Computer Networks, Dynamic Programming, GraphsTime required to prepare for the interview - 12 monthsInterview preparation tips for other job seekers

Tip 1 : Never lose hope. Just keep working.
Tip 2 : Solve at least 5 problems each day of medium level or 3 questions of hard level with complete understanding.
Tip 3 : Keep at least 3-4 projects in your resume.

Application resume tips for other job seekers

Tip 1 : Keep it 1 page.
Tip 2 : Revise it very well before the interview.
Tip 3 : Know your projects in-depth. They might also ask you to show a demo as it is a virtual interview. So, keep them ready before the interview.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Aug 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

There were two sections mcq's and coding. We were allowed to switch between sections and there was no specific time for any section. Around 350 students gave the test.

  • Q1. 

    Count Inversions Problem Statement

    Given an integer array ARR of size N, your task is to find the total number of inversions that exist in the array.

    An inversion is defined for a pair of integers in the...

  • Ans. 

    Count the total number of inversions in an integer array.

    • Iterate through the array and for each pair of elements, check if the inversion condition is met.

    • Use a nested loop to compare each pair of elements efficiently.

    • Keep a count of the inversions found and return the total count at the end.

  • Answered by AI
  • Q2. 

    Maximum Consecutive Ones Problem Statement

    Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...

  • Ans. 

    Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.

    • Iterate through the array and keep track of the current window of 1's and zeroes.

    • Use a sliding window approach to find the maximum length of the sequence.

    • Update the window by flipping zeroes to ones within the limit of K flips.

    • Return the maximum length of the sequence obtained.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

About 45 students were shortlisted for this round. My interview was at 10:15am. I was asked to introduce myself. 

  • Q1. 

    Maximum Distance Problem Statement

    Given an integer array 'A' of size N, your task is to find the maximum value of j - i, with the restriction that A[i] <= A[j], where 'i' and 'j' are indices of the ar...

  • Ans. 

    Find the maximum distance between two elements in an array where the element at the first index is less than or equal to the element at the second index.

    • Iterate through the array and keep track of the minimum element encountered so far along with its index.

    • Calculate the maximum distance by subtracting the current index from the index of the minimum element.

    • Update the maximum distance if a greater distance is found whil...

  • Answered by AI
  • Q2. 

    Determine the Left View of a Binary Tree

    You are given a binary tree of integers. Your task is to determine the left view of the binary tree. The left view consists of nodes that are visible when the tree...

  • Ans. 

    The task is to determine the left view of a binary tree, which consists of nodes visible when viewed from the left side.

    • Traverse the binary tree level by level from left to right, keeping track of the first node encountered at each level.

    • Use a queue to perform level order traversal and keep track of the level number for each node.

    • Store the first node encountered at each level in a result array to get the left view of t

  • Answered by AI
Round 3 - Video Call 

Round duration - 40 Minutes
Round difficulty - Easy

About 17 students cleared the first round. My second round was at 4:30pm. The interviewer was very humble. 

Round 4 - Telephonic Call 

Round duration - 20 Minutes
Round difficulty - Easy

This was HR round, 7 students were shortlisted for this round. I received the call after 6:30pm. 

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Fullstack Developer in GurgaonEligibility criteriaAbove 8.5 CGPA, No active or any previous semester backlog, Allowed branches - CS and ENCMakeMyTrip interview preparation:Topics to prepare for the interview - OOPS, Data Structures, DBMS, OS, CN, Machine Learning(Based on resume)Time required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : For on campus placements, focus more on core subjects rather than very good projects/internships.
Tip 2 : You must cover all important Data Structures and their important/fundamental questions at least twice. For advanced Data Structures like DP, graph, trees, you should have good practice before hand.
Tip 3 : Solve aptitude questions occasionally.

Application resume tips for other job seekers

Tip 1 : Don't put too much skills/projects if you are not confident about it, u need not have very rich resume during on campus placements
Tip 2 : it should be readable and authentic

Final outcome of the interviewSelected

Skills evaluated in this interview

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

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

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.

  • Answered by AI
  • 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.

    • ...

  • Answered by AI
  • 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.

  • Answered by AI
  • 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

  • Answered by AI
  • 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.

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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.

  • Answered by AI
  • 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:...

  • Answered by AI
  • 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();

  • Answered by AI
  • 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);

  • Answered by AI
  • 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

  • Answered by AI
  • 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.

  • Answered by AI
  • 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.

  • Answered by AI
  • 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.

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Javascript
College Name: na

Skills evaluated in this interview

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

Agoda Interview FAQs

How many rounds are there in Agoda Full Stack Developer interview?
Agoda interview process usually has 4 rounds. The most common rounds in the Agoda interview process are One-on-one Round.
What are the top questions asked in Agoda Full Stack Developer interview?

Some of the top questions asked at the Agoda Full Stack Developer interview -

  1. System design question on showing live number of users on hotel pa...read more
  2. Coding problem related to frontend in re...read more
  3. Problem related to Code rev...read more

Recently Viewed

INTERVIEWS

Welspun Enterprises

No Interviews

INTERVIEWS

Agoda

No Interviews

SALARIES

Jabil Circuit India

INTERVIEWS

Jabil Circuit India

No Interviews

JOBS

Jabil Circuit India

No Jobs

JOBS

Jabil Circuit India

No Jobs

SALARIES

Welspun Enterprises

INTERVIEWS

Bosch Power Tools

No Interviews

SALARIES

Futures First info Services

No Salaries

SALARIES

Welspun Enterprises

Tell us how to improve this page.

Agoda Full Stack Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 428 Interviews
BigBasket Interview Questions
3.9
 • 359 Interviews
Udaan Interview Questions
4.0
 • 334 Interviews
CARS24 Interview Questions
3.5
 • 331 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
Lenskart Interview Questions
3.2
 • 304 Interviews
Oyo Rooms Interview Questions
3.3
 • 219 Interviews
Myntra Interview Questions
4.0
 • 215 Interviews
Square Yards Interview Questions
3.8
 • 200 Interviews
Blinkit Interview Questions
3.7
 • 182 Interviews
View all
Software Engineer
31 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
28 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Product Manager
10 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Engineering Manager
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Strategic Account Manager
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Agoda with

MakeMyTrip

3.6
Compare

Yatra

3.4
Compare

Cleartrip

3.4
Compare

Oyo Rooms

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