Info Edge
10+ Dr. Reddy's Interview Questions and Answers
Given an array ‘A’ having ‘N’ integers and an integer ‘m’. You need to rearrange the array elements such that after re-arrangement difference of array elements with ‘m’ should be in a s...read more
Pre-requisites: Anagrams are defined as words or names that can be formed by rearranging letters of another word. Such as "spar" can be formed by rearranging letters of "rasp". Hence, "spar" and "...read more
You are given an arbitrary binary tree, a node of the tree, and an integer 'K'. You need to find all such nodes which have a distance K from the given node and return ...read more
The task is to find all nodes in a binary tree that are at a distance K from a given node.
Traverse the binary tree to find the given node
From the given node, perform a depth-first search to find all nodes at distance K
Use a list to store the values of the nodes at distance K
Return the list of values in any order
Ninja is given a pattern. Now he is asked to print the same pattern for any given ‘N’ number of rows.
For example, Pattern for ‘N’ = 4 will be. 1 232 34545 4567654 Input Format:
The...read moreWhat is web server and application server ?
Create a class and than inherit it in child class. Create an object. Add some exceptions.
Write query to find nth highest salary.
Explain oops concepts.
Q10. Insert node in binary search tree
To insert a node in a binary search tree, compare the value of the node to be inserted with the current node and traverse left or right accordingly.
Start at the root node and compare the value of the node to be inserted with the current node.
If the value is less than the current node, move to the left child node. If it is greater, move to the right child node.
Repeat this process until reaching a leaf node, then insert the new node as the left or right child of the leaf node.
Top HR Questions asked in Dr. Reddy's
Interview Process at Dr. Reddy's
Top Software Developer Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
