For a given input n, make an n by n identity matrix that contains the elements 1:n along its diagonal. For example, if input=5:
output = [1 0 0 0 0;
0 2 0 0 0;
0 0 3 0 0;
0 0 0 4 0;
0 0 0 0 5]
This problem's title and description were cleaned up and additional test cases were added.
Find the longest sequence of 1's in a binary sequence.
2252 Solvers
16169 Solvers
5532 Solvers
Remove All elements less than 5
77 Solvers
Rotate a matrix for 180 degree
82 Solvers