CareerCup

A smart-set is a set of distinct numbers in which all the elements have the same number of 1s in their binary form. The set of all smallest elements from each smart-set
that can be formed from a given array of distinct positive numbers is known as the smartest-set.

So given an array of distinct numbers, outline the elements of the smartest-set in ascending sorted order.

Example
Let the array be {6 , 2 , 11 , 1 , 9 , 14 , 13 , 4 , 18}.
In binary form the set is {110, 010, 1011, 0001, 1001, 1110, 1101, 0100, 10010}.
The smart-sets are {1, 2, 4}, {6, 9, 18}, {11, 13, 14}.

The smartest-set is {1,6,11} as each element is the smallest element from each smart-set.

Input Format

The first line of input consists of an integer t. This is the number of test cases. For each test case,
the first line of input contains an integer n. Here n is the number of elements in the array. The next line contains n space separated distinct integers which are the elements
of the array.

Output Format

The output will space separated integer elements of the smartest-set in ascending order.

Constraints

0 < t < 1000 (This is the number of test cases
2 < n < 10000 (This is the number of integer elements of the array)
1 < Xi < 100000 (This is the size of each element of the array)

Sample input :
3
9
6 2 11 1 9 14 13 4 18
3
7 3 1
3
1 2 4
Sample Output :
1 6 11
1 3 7
1 please send me javascript code

Name the asset that is an accumulated visual asset and can be utilized as a foundation, title, or in other piece of the screen?

What do you believe are a few disservices of Android?

Tell me What Is the Google Android SDK?

Explain what is Android?

A graph has N vertices numbered from 1 to N. We have two lists. One list M consisted of edges between vertices. The other list K consists of restricted paths. We have to add edges one by one from M and check whether the addition of the particular edge leads to a path between the restricted vertices given in K. If it creates a path, we have to discard the edge.

Example: N = 4; K = {(1,4)}; M = {(1, 2), (2, 3), (3, 4)}. Here, addition of edge (3, 4) will create a path between 1 and 4. Hence we discard edge (3, 4)

You have given a string which consists of four characters {a,c,t,g}, find minimum length of unique substring which occurs only once.

Eg:

Input :
#1 aacc
#2 actg

Output:
#1 2 3
#2 1 4

Explain:

aacc -> {aa, ac, cc} are the smallest unique string with single occurrence.

why we need dua for love back ?

What sort of help will you be offered once your application is discharged?

Will I have the capacity to get to the application while it's in advancement?

How is the app going to be hosted?

What sort of help will I get all through the advancement procedure?

What item the executives procedure will you use?

How to find if a Binary tree has an odd number of nodes without using node count? Binary tree does not have to be balanced

Are there progressing costs once my application is discharged?

Regardless of whether you need an iOS or an Android App?

For what reason would You Like to Develop an App?

How Do I Manage Different Display Resolutions?

What is the most ideal approach to get my application found?

It will gain you more knowledge intensify your soft skills, grow your network and work ethics, what is it

What application adaptation techniques should I pick?

What amount of time would it take for application to create?

What dialects are versatile applications customized in?

Does your application thought take care of any genuine issue?

What is an activity in android?

Generate random max index

Given an array of integers, randomly return an index of the maximum value seen by far.

e.g.
Given [11,30,2,30,30,30,6,2,62, 62]

Having iterated up to the at element index 5 (where the last 30 is), randomly give an index among [1, 3, 4, 5] which are indices of 30 - the max value by far. Each index should have a ¼ chance to get picked.

Having iterated through the entire array, randomly give an index between 8 and 9 which are indices of the max value 62.

Given a word of length n, and n six-sided dice with a character in each side, find out if this word is constructible by the set of given dice

[[2, NULL, 2, NULL], 
 [2, NULL, 2, NULL], 
 [NULL, NULL, NULL, NULL], 
 [NULL, NULL, NULL, NULL]]

What does the array look like after the corrected function has run?

":=" denotes the substitution, and "=" is the equal comparator.

========
Initial state of an array "a":

[[4, 2, 4, 2],
[4, NULL, 4, 2],
[2, NULL, 8, 2],
[16, NULL, 4, NULL]]

========
Main function:

FUNCTION foo()
   FOR y := 0 to 3
       FOR x := 0 to 3
           IF a[x+1][y] != NULL
               IF a[x+1][y] = a[x][y]
                   a[x][y] := a[x][y]*2
                   a[x+1][y] := NULL
               END IF
               IF a[x][y] = NULL
                   a[x][y] := a[x+1][y]
                   a[x+1][y] := NULL
               END IF
           END IF
       END FOR
  END FOR
END FUNCTION

What is the issue with the above code, and how would you fix it?

How can I tell what version of Microsoft Office 365 that I am using?