WITHOUT SUBSCRIBE TO TRADITIONAL VLOGS YOUTUBE CHANNEL YOU CAN NOT ACCESS ANYTHING IN MY WEBSITE....! ( CLICK HERE TO SUBSCRIBE)

OORWIN TEST

OORWIN TEST
I.Given list of n integers, insert one of the operators (+, -, *) between pair of consecutive integers such that the result obtained after calculating the resulting expression should be divisible by 101. Given lists of integers for which an answer exists if answers do not exist print error message.

For Interview Team, below are the inputs for which answers exists
Sample Input
3
22 79 21

Sample Output
22*79-21 or

Explanation
     Solution 1: 22*79-21=1717, where 1717/101=17, so it is perfectly divisible by 101.
      Solution 2: 22+79*21= (22+79) *21=2121, which is also divisible by 101.

                                For Source-Code:- Click Here


II.A 3*10 Crossword grid is provided to you, along with a set of words need to be filled into the grid. Cells are marked either + or -. Cells marked with a – are to be filled with the word list.

Sample Input
+-++++++++
+-++++++++
+-++++++++
LONDON; DELHI; ICELAND; ANKARA

Sample Output
+L++++++++
+O+++++++++

+N+++++++++

                        For Source-Code:Click Here


III.Find an element of the array such that the sum of all elements to the left is equal to the sum of all elements to right. For instance, given the array arr= [5,6,8,11], 8 is between to subarrays the sum to 11. If your starting array is [1], that element satisfies the rule as left and right sum to.
You will be given arrays of integers and must determine whether there is an element that meets the criterion.

Sample Input
3
1 2 3

Sample Output
NO

                                    For Source-Code:Click Here


IV.Given an array of integers, find and print the maximum number of integers you can select from the array such that the absolute difference between any two of the chosen integers is less than or equal to 1. For example, if your array is a= [1,1,2,2,3,3,4,4,5,5,5], you can create two subarrays meeting the criteria: [1,1,2,2] and [4,4,5,5,5]. The maximum length of sub array has 5 elements;

Sample Input:
6
4 6 5 3 3 1

Sample Output
3

We choose the following multiset of integers from the array: [4,3,3}.
Each pair in the multiset has an absolute difference <=1 (i. e|4-3|=1, and |3-3|=0), so we print the number of chosen integers 3, as our answer.

                                   For Source-Code:Click Here