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.
Determine if input is odd
Remove All elements less than 5
Rotate a matrix for 180 degree
Replace all odd numbers with NaN
Sum the rows
Where is the number that you want to find?
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office