Thomas
Followers: 0 Following: 0
Statistiques
RANG
5 802
of 301 620
RÉPUTATION
4
CONTRIBUTIONS
15 Questions
0 Réponses
ACCEPTATION DE VOS RÉPONSES
26.67%
VOTES REÇUS
4
RANG
7 785 of 21 362
RÉPUTATION
122
CLASSEMENT MOYEN
2.00
CONTRIBUTIONS
1 Fichier
TÉLÉCHARGEMENTS
1
ALL TIME TÉLÉCHARGEMENTS
1227
CONTRIBUTIONS
0 Publications
CONTRIBUTIONS
0 Public Chaîne
CLASSEMENT MOYEN
CONTRIBUTIONS
0 Point fort
NOMBRE MOYEN DE LIKES
Feeds
A résolu
Extract leading non-zero digit
<http://en.wikipedia.org/wiki/Benford%27s_law Benford's Law> states that the distribution of leading digits is not random. This...
presque 13 ans il y a
A résolu
Make a Palindrome Number
Some numbers like 323 are palindromes. Other numbers like 124 are not. But look what happens when we add that number to a revers...
presque 13 ans il y a
A résolu
Which doors are open?
There are n doors in an alley. Initially they are all shut. You have been tasked to go down the alley n times, and open/shut the...
presque 13 ans il y a
A résolu
Trimming Spaces
Given a string, remove all leading and trailing spaces (where space is defined as ASCII 32). Input a = ' singular value deco...
presque 13 ans il y a
A résolu
Return a list sorted by number of occurrences
Given a vector x, return a vector y of the unique values in x sorted by the number of occurrences in x. Ties are resolved by a ...
presque 13 ans il y a
A résolu
Balanced number
Given a positive integer find whether it is a balanced number. For a balanced number the sum of first half of digits is equal to...
presque 13 ans il y a
A résolu
Replace NaNs with the number that appears to its left in the row.
Replace NaNs with the number that appears to its left in the row. If there are more than one consecutive NaNs, they should all ...
presque 13 ans il y a
A résolu
Find the longest sequence of 1's in a binary sequence.
Given a string such as s = '011110010000000100010111' find the length of the longest string of consecutive 1's. In this examp...
presque 13 ans il y a
A résolu
Make a checkerboard matrix
Given an integer n, make an n-by-n matrix made up of alternating ones and zeros as shown below. The a(1,1) should be 1. Example...
presque 13 ans il y a
A résolu
Find all elements less than 0 or greater than 10 and replace them with NaN
Given an input vector x, find all elements of x less than 0 or greater than 10 and replace them with NaN. Example: Input ...
presque 13 ans il y a
A résolu
Target sorting
Sort the given list of numbers |a| according to how far away each element is from the target value |t|. The result should return...
presque 13 ans il y a
A résolu
Summing digits
Given n, find the sum of the digits that make up 2^n. Example: Input n = 7 Output b = 11 since 2^7 = 128, and 1 + ...
presque 13 ans il y a
A résolu
Make the vector [1 2 3 4 5 6 7 8 9 10]
In MATLAB, you create a vector by enclosing the elements in square brackets like so: x = [1 2 3 4] Commas are optional, s...
presque 13 ans il y a
A résolu
Remove any row in which a NaN appears
Given the matrix A, return B in which all the rows that have one or more <http://www.mathworks.com/help/techdoc/ref/nan.html NaN...
presque 13 ans il y a
A résolu
Fibonacci sequence
Calculate the nth Fibonacci number. Given n, return f where f = fib(n) and f(1) = 1, f(2) = 1, f(3) = 2, ... Examples: Inpu...
presque 13 ans il y a
A résolu
Determine whether a vector is monotonically increasing
Return true if the elements of the input vector increase monotonically (i.e. each element is larger than the previous). Return f...
presque 13 ans il y a
A résolu
Triangle Numbers
Triangle numbers are the sums of successive integers. So 6 is a triangle number because 6 = 1 + 2 + 3 which can be displa...
presque 13 ans il y a
A résolu
Select every other element of a vector
Write a function which returns every other element of the vector passed in. That is, it returns the all odd-numbered elements, s...
presque 13 ans il y a
A résolu
Times 2 - START HERE
Try out this test problem first. Given the variable x as your input, multiply it by two and put the result in y. Examples:...
presque 13 ans il y a





