SDE - 1

You're given a string 'S' consisting of "{", "}", "(", ")", "[" and "]" .

Return true if the given string 'S' is balanced, else return false.

For example:

'S' = "{}()".

There is always an opening brace before a closing brace i.e. '{' before '}', '(' before ').
So the 'S' is Balanced.

You are gifted a tree consisting of 'N' vertices. There are two types of edges each with a weight 'VAL' and denoted by a ‘TYPE’ value that is either 0 or 1.

A pair (i, j), where ‘i’ < ‘j' is called GOOD if, while traversing from vertice 'i' to vertice 'j', we never pass through an edge of ‘TYPE’ 0.

Your task is to calculate the sum of the path’s weight of all the GOOD pairs present in the tree. Return the final answer modulo 10^9 + 7.

Example:

Input: ‘N’ = 3 and edges are [{1, 2, 0, 5}, {2, 3, 1, 3}] and edges are given in format {u, v, type, weight}.
Output: 3
Explanation: There is only one GOOD pair, i.e. {2, 3} and the weight of the edge is 3.

Given an array/list 'ARR' of integers and a position ‘M’. You have to reverse the array after that position.

Example:

We have an array ARR = {1, 2, 3, 4, 5, 6} and M = 3 , considering 0 
based indexing so the subarray {5, 6} will be reversed and our 
output array will be {1, 2, 3, 4, 6, 5}.

Salary negotiations
Asked about family
What are your hobbies?
Role and responsibility in the previous company?
Where do you see yourself in 5 years?
Why do you want to join Gartner?