Given k arrays assuming they're all length N, choose one array as a query array with which to check if its elements are common in all arrays. The return value should be an array whose elements are common between all input arrays. Develop a linear solution. Can this be done?

Pseudocode for a quadratic, not linear solution:

for each element X in Query_Collection {

for each other collection {

for each element Y in current_collection {

if X.compareTo(Y) == 0 {

X is common between Query_Collection and current_collection

break

}

}

if X not in current_collection {

X not common to all collections

}

}

if X exists in all collections {

add X to common_collection

}

}