www.societegenerale.com / Siège social: Paris, FR
207 entretiens à Paris (sur 992)
Combien y a-t-il de possibilités de monter des escaliers jusqu'au sommet avec n marches, si on on peut monter une ou deux marches à la fois ?
Took me a while to finally just put the first answers and infer Fibonnaci... but I tried to prove it first but it seems to be a bit too complicated (I think with a binary tree we can do that - with level n-1 and n-2)
This problem can be solve by dynamic programming. use V(i) to denote the way to go from the current i stair to n stair, we have V(n) = 1 and V(j) = 0 for all the j >n. We have the recurrence V(i) = V(i+1) + V(i + 2), The result is V(0). Time complexity is O(n)
I proposed them a recursive solution but they didn't accept it and ask me for a formula.
Thanks in advance to prepare a design proposal and present to us the approach and the UX methodology you used to work on the following task: Brief : deliverable - Homepage redesign by bringing a Community and social dimension to the experience - Version iOS or Android - Inspiration from our Design system ( as enclosed to this mail)