i
Amadeus
Filter interviews by
Clear (1)
Top trending discussions
Full Java Theories cover the core concepts of Java programming language.
Object-oriented programming
Inheritance, polymorphism, encapsulation, and abstraction
Exception handling
Multithreading
Collections framework
Create a class with attributes, sort objects based on attributes, and print.
Create a class with attributes like name, age, and salary
Implement Comparable interface to define sorting logic based on attributes
Create objects of the class, add them to a list, and use Collections.sort() to sort them
Print the sorted objects
Automate scenario to search for 'Mobile' on Amazon, retrieve name and price of results, store in custom class, and display on console.
Use Selenium WebDriver to launch Amazon website
Locate search box element and enter 'Mobile' text
Retrieve name and price of search results using appropriate locators
Store name and price in custom class with attributes 'name' and 'product'
Display stored data on console
Ask Python List Questions
I applied via Approached by Company and was interviewed in Oct 2024. There was 1 interview round.
Reverse a string without using Java built-in functions
Create a character array from the input string
Use two pointers to swap characters at the beginning and end of the array until they meet
Convert the character array back to a string
Relative Xpath is based on the current node while Absolute Xpath starts from the root node of the XML document.
Relative Xpath does not start with a forward slash (/) while Absolute Xpath starts with a forward slash (/).
Relative Xpath is more flexible and less prone to changes in the structure of the XML document.
Absolute Xpath is more specific and provides the full path to the element in the XML document.
Relative Xpath...
I applied via Campus Placement and was interviewed before Dec 2023. There was 1 interview round.
Interviewed as part of college placements, first round consisted of aptitude and CS related MCQs;
I applied via Campus Placement
20 MCQs, 1 RestAPI Problem, 1 Dp problem
I applied via Campus Placement and was interviewed in Mar 2022. There were 4 interview rounds.
Finding common elements in two sorted linked lists.
Traverse both lists simultaneously using two pointers.
Compare the values of the nodes pointed by the two pointers.
If they are equal, add the value to the result list and move both pointers.
If not, move the pointer pointing to the smaller value.
Repeat until one of the lists is fully traversed.
Finding the Kth element after merging two sorted arrays.
Merge the two sorted arrays into a single array.
Sort the merged array.
Return the Kth element from the merged and sorted array.
OOPS is a programming paradigm based on objects while DBMS is a software system for managing databases.
OOPS focuses on encapsulation, inheritance, and polymorphism
DBMS manages data through CRUD operations and supports ACID properties
Examples of OOPS languages include Java, C++, and Python
Examples of DBMS include MySQL, Oracle, and SQL Server
I applied via LinkedIn and was interviewed in Apr 2022. There were 5 interview rounds.
String manipulation problems from geeks for geeks with some medium and hard problems in DSA from leetcode
Graph implementation involves creating nodes and edges to represent data and relationships.
Nodes represent data points and edges represent relationships between them
Graphs can be directed or undirected
Common graph algorithms include BFS, DFS, and Dijkstra's algorithm
String pool is a cache of string literals stored in memory for efficient reuse.
String pool is a part of Java's memory management system.
It stores a collection of unique string literals to save memory.
When a new string is created, it is first checked in the pool and reused if already present.
String pool can be accessed using the intern() method.
Example: String s1 = "Hello"; String s2 = "Hello"; s1 and s2 will point to t
Strings are immutable in Java to ensure thread safety and prevent unintended changes.
Immutable objects are safer to use in multi-threaded environments
String pool optimization is possible because of immutability
StringBuffer and StringBuilder classes are available for mutable string operations
I applied via Campus Placement and was interviewed in Jul 2022. There were 4 interview rounds.
Conducted on their platform for 120 minutes
To find the diameter of a binary tree, we need to find the longest path between any two nodes in the tree.
Traverse the tree recursively and calculate the height of the left and right subtrees.
Calculate the diameter of the left and right subtrees recursively.
The diameter of the tree is the maximum of the following three values: 1. Diameter of the left subtree 2. Diameter of the right subtree 3. Height of the left sub...
based on 1 interview
Interview experience
Senior Software Engineer
615
salaries
| ₹0 L/yr - ₹0 L/yr |
Member Technical Staff
316
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
220
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer II
183
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Business Analyst
182
salaries
| ₹0 L/yr - ₹0 L/yr |
Sabre
Travelport
Expedia Group
Booking Holdings