short or buy ? take the opportunity
you had already calculated a theoretical stock value, now you checked in bloomberg the quoted price of that stock and you have t...
5年弱 前
解決済み
Counting Squares
An algorithm starts with a single square and on each of its next iterations adds new squares all around the outside as shown bel...
Say type of roots in quadratic equation
Given the coefficients of a quadratic equation, write a function that gives the output y='RealDifferent' if the roots are real a...
5年弱 前
解決済み
Alternating 1´s and 0´s in a matrix
Given an odd number n, write a function that creates a matrix y with dimension nxn alternating 1's and 0's, and starting with 1 ...
5年弱 前
解決済み
Get the mean digit
Write a function that gives the mean digit (round towards nearest integer) of an input and positive number. For example:
x ...
5年弱 前
解決済み
Alternate list of elements
Write a function that combines two lists by alternating the elements, e.g. ['a','b','c'], ['1','2','3'] → 'a1b2c3'.
5年弱 前
解決済み
Find argmax of a function
You are given vectors x and y (=f(x)).
Return the element of x for which f(x) is maximized.
5年弱 前
解決済み
Calculate the volume of a cone
Calculate the volume of a cone given an array containing one column of radii and one column of the height of the cone.
* Reme...
5年弱 前
解決済み
Find The Difference
Vector x is given.calculate the difference between the biggest and the smallest number that we can create from elements of x.
f...
5年弱 前
解決済み
Distance Between Points
Being n the number of points (If n = 3 there would be 3 points: A, B and C).
The distance between each pair of points increases...
Minimum jumps to reach end of the array
Given an array of integers where each element represents the max number of steps that can be made forward from that element. Ste...
5年弱 前
解決済み
Queen's move - 02
In continuation with the problem-45236 ...
In the previous problem, it was assumed that there were no other chess pieces on th...
5年弱 前
解決済み
Queen's move
given a number of consecutive moves of queen, check for their validity based on their previous position....
but remember if u g...
5年弱 前
解決済み
Josephus Survivor
The <http://en.wikipedia.org/wiki/Josephus_problem Josephus Challenge> is to find the position that is the last remaining when e...