This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 5;
y_correct = 3;
assert(isequal(your_fcn_name(x),y_correct))
|
2 | Pass |
x = 10;
y_correct = 8;
assert(isequal(your_fcn_name(x),y_correct))
|
Find the longest sequence of 1's in a binary sequence.
2439 Solvers
1913 Solvers
Given an unsigned integer x, find the largest y by rearranging the bits in x
524 Solvers
1123 Solvers
241 Solvers