SDE - 1

Ninja has been given a string S, consisting of only the '(' or ')' parenthesis. The string is not balanced, and to make the string balanced, he can remove one or more parentheses. He needs to print all possible balanced strings that can be formed from the given string by removing the minimum number of parentheses.

Note:

Print only those distinct strings that can be formed by removing the minimum number of parentheses.

If the string is already balanced, return the original string.

For example:

(()()()

Expected strings are:

[ (()()), (())(), ()()() ]

Given an array of integers with only a single unique no. Rest are repeated, find that unique no. 
Expected TC: O(n) or lesser.

Write code of singleton and prototype in Java.

Explain 4 core principles of OOPS. (Learn)

Find the second highest salary of an employee.

You have been given a long type array/list 'arr’ of size 'n’.

It represents an elevation map wherein 'arr[i]’ denotes the elevation of the 'ith' bar.

Print the total amount of rainwater that can be trapped in these elevations.

Note :

The width of each bar is the same and is equal to 1.

Example:

Input: ‘n’ = 6, ‘arr’ = [3, 0, 0, 2, 0, 4].

Output: 10

Explanation: Refer to the image for better comprehension:

Note :

You don't need to print anything. It has already been taken care of. Just implement the given function.

Given 25 horses find the top 5 fastest horses with a minimum no of races given you can only race 5 horses at a time.

Explain your best project in detail.

What are your weaknesses and strengths?