SDE - 1

You are given an array 'ARR' of N integers. Each integer represents the height of a balloon. So, there are N balloons lined up.

Your aim is to destroy all these balloons. Now, a balloon can only be destroyed if the player shoots its head. So, to do the needful, he/ she shoots an arrow from the left to the right side of the platform, from an arbitrary height he/she chooses. The arrow moves from left to right, at a chosen height ARR[i] until it finds a balloon. The moment when an arrow touches a balloon, the balloon gets destroyed and disappears and the arrow continues its way from left to right at a height decreased by 1. Therefore, if the arrow was moving at height ARR[i], after destroying the balloon it travels at height ARR[i]-1. The player wins this game if he destroys all the balloons in minimum arrows.

You have to return the minimum arrows required to complete the task.

You are given a positive integer N and an equation 1/X + 1/Y = 1/N

You need to determine the count of all possible positive integral solutions (X, Y) for the above equation.

Note:

1. X and Y should be greater than 0.
2. (X, Y) and (Y, X) are considered different solutions if X is not equal to Y, i.e. (X, Y) and (Y, X) will not be distinct if X=Y.

You have been given a Binary Tree of integers. You are supposed to return the level order traversal of the given tree.

For example:

For the given binary tree

The level order traversal will be {1,2,3,4,5,6,7}.

You are given a 2 - D matrix, ‘MAT’, which consists of only 0s and 1s. Every row of the matrix is interpreted as a binary number, and the sum of all these “binary number interpreted rows” is defined as the score of the matrix, ‘MAT’.

You have to maximize the score by making any number of passes where a pass consists of choosing any row or column, and toggling each value in that row or column, i.e., changing all 0s to 1s, and all 1s to 0s. Your task is to return the highest possible score of the matrix, ‘MAT’.

Given a string ‘str’ and a string ‘pat’. The string s has some wildcard characters i.e ‘?’ and ‘*’.If any character is a ‘?’ we can replace that character with any other character. If a character is a * we can replace * with any sequence of characters including the empty sequence.  Your task is to determine if it is possible that we can make ‘str' = 'pat’ using appropriate conversions in ‘str’.For Example:Let str = “abc?" and pat= “abcd”We return true as ‘?’ can be replaced with ‘d’ and this makes ‘str’ and ‘pat’ same.Input Format:The first line of input contains an integer ‘T’ which contains the number of test cases. The next '2 * T' lines represent the 'T' test cases.The first line of each test case contains the string ‘str’.The second line of each test case contains the string ‘pat’.Output Format:For each test case return true if it is possible to modify string ‘str’ such that ‘pat’ is a substring of ‘s’ under given rules and conditions. Otherwise, return false.Note:You do not need to print anything; it has already been taken care of, Just implement the given function.The words do not contain whitespace.The string ‘pat’ contains only lowercase English alphabets.Constraints:1 <= T <= 101 <= pat.length() <= 2001 <= str.length() <= 200Time Limit: 1secFollow Up:Try to do this problem in O(M * N).

There are 2 trees in a garden (tree "A" and "B") and on both trees are some birds.
The birds of tree A say to the birds of tree B that if one of you comes to our tree, then our population will be the double of yours.
Then the birds of tree B tell to the birds of tree A that if one of you comes here, then our population will be equal to that of yours. How many birds in each tree?

There are ‘N’ horses running in ‘N’ different lanes numbered from 1 to ‘N’. You are given an array “FINISHTIME” containing ‘N’ integers where “FINISHTIME[i]” represents the time taken by the ith horse to complete the race.
You are now given ‘Q’ queries, each containing two integers each, ‘L’ and ‘R’. For each query, return the time taken by the fastest horse amongst the horses with numbers {L, L + 1, L + 2, …., R - 1, R} to complete the race.
Note:
The fastest horse is the one that takes the minimum time to finish the race.

You have been given an array/list of strings 'STR_LIST'. You are supposed to return the strings as groups of anagrams such that strings belonging to a particular group are anagrams of one another.

Note :

An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase. We can generalize this in string processing by saying that an anagram of a string is another string with the same quantity of each character in it, in any order.

Example:

{ “abc”, “ged”, “dge”, “bac” } 
In the above example the array should be divided into 2 groups. The first group consists of { “abc”, “bac” } and the second group consists of { “ged”, “dge” }.