Challenge overview
Hello and welcome to the next live coding challenge!
Write a function, which returns the flatten version of the Pascal's Triangle of the depth n. What is the Pascal's Triangle, you can read here.
Examples
n=3 -> 1 1 1 1 2 1-
n=4 ->1 1 1 1 211 3 3 1
Input
-
n- triangle's depth
Output
- string including the flatten version of the Pascal's Triangle of the depth
nwith values separated with spaces
Constraints
0 <= n <= 30
You can solve this programming contest in Java, JavaScript, Python, C++ and many more languages. If you want, you can also take part in other Challenges. Below you can find some of them:
Have fun and good luck! :)
Did you like this challenge and would like to try your hand at some interesting big programming competitions? Check what’s all over the news in tech world in April 2019 in our article with upcoming IT Conferences, Hackathons and Online Challenges.