This problem is about counting groups.
Example
If you have x:
x = [0.8 0.8 0.8 0.3 0.3 0.4 0.5 0.6 0.6 0.9]
then all 0.8's being first in line, get a value of 1, all 0.3's get a value of 2, all 0.4's a value of 3 and so on, till the output y is:
y = [1 1 1 2 2 3 4 5 5 6]
That's it!
Please note, to make it easier, the list will be "pre-sorted".
Given an unsigned integer x, find the largest y by rearranging the bits in x
478 Solvers
Permute diagonal and antidiagonal
165 Solvers
155 Solvers
141 Solvers
Back to basics - mean of corner elements of a matrix
214 Solvers
Tags