[ASSIGNMENT] 🔶👉🔷CHALLENGE ::: TETRAHEDRON [2] 🔺🔡🔺

Question

//link to previous challenge ,
https://www.sololearn.com/Discuss/1142841/?ref=app

👉👉👉the only difference in this challenge is that , now we have to find no. of paths of n steps possible for reaching from pt. A to pt. B
//1 step means 1 jump

//give it a try , be simple 👍

//WARNING : forget U know some basic math 😅
.
.

Answer 1

Python code to answer Tetrahedron challenge 1 and 2 (settable start and end vertices).
It's not a formula, only creating the possible paths and counting them.

https://code.sololearn.com/c8J80meIo682/#py

Thank you Gaurav for the challenges !

Answer 2

I think this is still working...

https://code.sololearn.com/cuTRzFbe9j0b/?ref=app

Answer 3

3 answers included##(2 & 3 are from same derivation)
https://code.sololearn.com/c7xslC93CMpu/?ref=app

Answer 4

My solution :
https://code.sololearn.com/cThA3656QImi/?ref=app