SDE - 2

'N' students are standing in a row. You are given the height of every student standing in the row. Your task is to find the longest strictly increasing subsequence of heights from the row such that the relative order of the students does not change.

A subsequence is a sequence that can be derived from another sequence by deleting zero or more elements without changing the order of the remaining elements.

You are given a binary tree having 'n' nodes. Each node of the tree has an integer value.

Your task is to find the maximum possible sum of a simple path between any two nodes (possibly the same) of the given tree.

A simple path is a path between any two nodes of a tree, such that no edge in the path is repeated twice. The sum of a simple path is defined as the summation of all node values in a path.

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.

You are given a network with ‘N’ system nodes [0 to N - 1] and ‘M’ connection. Your task is to find out all critical connections in a given network.

Note: A connection between node ‘u’ and ‘v’ is said to be a critical connection, if after removal of a connection ‘u’ - ‘v’, there is no connection between node ‘u’ and ‘v’ and the network goes down.

For example:

For given N = 4, M = 4, 

The connection between system node 0 and 1 is a critical connection.

You have been given a string 'S' containing only three types of characters, i.e. '(', ')' and '*'.

A Valid String is defined as follows:

1. Any left parenthesis '(' must have a corresponding right parenthesis ')'.
2. Any right parenthesis ')' must have a corresponding left parenthesis '('.
3. Left parenthesis '(' must go before the corresponding right parenthesis ')'.
4. '*' could be treated as a single right parenthesis ')' or a single left parenthesis '(' or an empty string.
5. An empty string is also valid.

Your task is to find out whether the given string is a Valid String or not.

Design a rate limiter. Only maintain connections for an hour, thenterminate the connections. Some coding was required to display actual implementatio, but the discussion was mostly high level based

Design hotel management system. Focus was mostly on designing classes, db schema, designing table structure and columns to handle different types of requeirements coming from both customer side(such as scheduling a room, cancelling a booking, eequesting for add on facilities, user login, deleting user account, etc) and developer side( such as getting list of bookings for a particular duration, getting a list of active users, request to display system logs, proper indexing etc). Was also asked how to impelement a new requirement in an existing system.