Oracle
10+ New Amma Hospitals Interview Questions and Answers
Q1. Intersection of Linked List Problem
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine the data...read more
Q2. LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherwise, re...read more
Q3. Convert a Binary Tree to its Sum Tree
Given a binary tree of integers, convert it to a sum tree where each node is replaced by the sum of the values of its left and right subtrees. Set leaf nodes to zero.
Input...read more
Q13. Binary tree balanced or not.
A binary tree is balanced if the height of its left and right subtrees differ by at most 1.
A balanced binary tree has a smoother and faster search time than an unbalanced one.
Balancing a binary tree can be done using various algorithms like AVL tree, Red-Black tree, etc.
An example of a balanced binary tree is the AVL tree, where the heights of the left and right subtrees differ by at most 1.
More about working at Oracle
Interview Process at New Amma Hospitals
Top Senior Application Developer Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month