SDE - 1

What is Overfitting, and How Can You Avoid It?

How Do You Handle Missing or Corrupted Data in a Dataset?

You are given an array/list 'ARR' consisting of N integers, which contains elements only in the range 0 to N - 1. Some of the elements may be repeated in 'ARR'. Your task is to find all such duplicate elements.

Note:

1. All the elements are in the range 0 to N - 1.
2. The elements may not be in sorted order.
3. You can return the duplicate elements in any order.
4. If there are no duplicates present then return an empty array.

You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.

For example:

 If the given string is: STR = "abcde". You have to print the string "edcba".

follow up:

Try to solve the problem in O(1) space complexity. 

Given an AVL tree,delete an element in the AVL Tree.

An AVL tree is a self-balancing binary search tree.

It has the following properties:

It has the property of the binary search tree , i.e for every node , the nodes in its left subtree is less than the node and the node in the right subtree is greater than the current node.

The absolute difference between the height of left subtree and right subtree of any node is less than or equal to 1.

Read more about AVL Tree Here: https://en.wikipedia.org/wiki/AVL_tree

Note

1. Do not print anything, just return the root node of the tree.
2. Your constructed tree will be checked by doing an in-order traversal of the tree from the returned root node.