Given a vector v, return a vector s containting the sum of every two adjacent elements in the vector.
Every element s(i) contains the sum of v(i) and v(i+1).
Example:
v = [1, 2, 4, 4, 5, 8] s = [3, 6, 8, 9, 13]
sorry mate, this is unfair for those who actually came up with a compact solution
No need to be sorry.
Personally I think the regexp should be always forbidden.
I used it (and I had never thought about it before) because it seems that everyone is using it.
Find the two most distant points
1160 Solvers
559 Solvers
MATCH THE STRINGS (2 CHAR) very easy
185 Solvers
307 Solvers
200 Solvers
Solution 1799547
why this code is not correct?
s = summ(v)
>> b=s
>> s(1)=[]
>> c=[[s],0]
>> s=[b+c]
>> s(end)=[]