query: Find number of distinct arrays
positive_passages.docid: 150210
positive_passages.text: Finding total number of multi-sets
negative_passages.docid: 27690
negative_passages.text: Get all unique values in a JavaScript array (remove duplicates)
negative_passages.docid: 27759
negative_passages.text: Count how often a particular value appears in an array
negative_passages.docid: 66761
negative_passages.text: Is it costly to do array.length or list.count in a loop
negative_passages.docid: 12835
negative_passages.text: How to efficiently find positions of duplicates?
negative_passages.docid: 137072
negative_passages.text: Number Of Distinct Paths In A Rectangular Grid
negative_passages.docid: 153174
negative_passages.text: How can I get every distinct size-n combination of a list?
negative_passages.docid: 150710
negative_passages.text: Determining the number of occurrences of each unique element in a vector
negative_passages.docid: 64933
negative_passages.text: Algorithm to determine if array contains n...n+m?
negative_passages.docid: 37426
negative_passages.text: Select in union of sorted arrays: Already known?
negative_passages.docid: 93921
negative_passages.text: Select groups based on number of unique / distinct values
negative_passages.docid: 116251
negative_passages.text: Number of distinct total orders on a set
negative_passages.docid: 135672
negative_passages.text: duplicates in 2 dimensional array
negative_passages.docid: 152946
negative_passages.text: how many distinct values does it have?
negative_passages.docid: 2276
negative_passages.text: How to count duplicate elements in a Ruby array
negative_passages.docid: 105477
negative_passages.text: How to find the number of dimensions that an array has?
negative_passages.docid: 65271
negative_passages.text: Find the missing and duplicate elements in an array in linear time and constant space