This is an ok problem. Now, add more test cases.
Find the longest sequence of 1's in a binary sequence.
Compute a dot product of two vectors x and y
Create a vector
Write a code that will follow the equation y = x * (x + x) * x.
first element of matrix
find a specific element from an matrix
Determine whether the input is divisible by 3 as well as 5
Find the last digit
modulus of a number
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