Attached is a VI to do the search that you requested.
A key aspect of this VI is that it does all the comparisons for each row in parallel by creating two copies of each row. One copy has the last element removed, the other has the first element removed. Comparing the two arrays produces an array of boolean flags that indicate the equality of adjacent values in the row.
Next, if all the bits in a row are off (OR of all the bits = false) the code does nothing. If at least one of the bits is true, it searches through the boolean array and inserts a index record into a results array for each bit it finds set.
Finally, the code increments all index values by one to produce the 1-based indexing requested.
Mike...