Python Beginner tutorial series using project Euler #18 - Maximum path sum 1

[@prayushdawda7807]

This was quite elegant!

[@LukeGarbuttGaming]

Thanks :D

[@Shelly888-s1r]

I didn't get it....they said that we have to go through the adjacent element of every row...not by the maximum element ......secondly....even if it is....so can u please tell on how to count rows so that I could iterate through every row and find the max element and add them up to get the max path...I mean the easy way. ....please....its hard for me to get through these Rowe logic....I hope u reply....😇😇😇

[@pragyan394]

You can put the triangle in string called "bad" then do this to make a list of list
a = bad.split("
")
new = [ ]
for i in a:
b = i.split(" ")
new.append(b)
for i in new:
print (i)

[@freyayao7100]

Thanks for the video ! it has been super helpful. :) This is an exercise for the ICS I am taking and the professor did not explain well. Do you think this can be done via recursion? Thanks!

[@LukeGarbuttGaming]

it definitely can but it isn't very efficient, I tried this initially but it took too long to run

[@canpppppp]

"beginner"

[@LukeGarbuttGaming]

Do you disagree?

[@canpppppp]

Luke Garbutt yes i disagree too much man.

[@canpppppp]

Luke Garbutt do you think this question is beginner ?

[@LukeGarbuttGaming]

I think this is pretty basic python to be learning 18 videos in, there's no OOP or complex branching going on, and the problem itself coming from project euler is simple to understand. Have you watched some of the earlier videos?

[@canpppppp]

@@LukeGarbuttGaming Do you have discord ? I want to explain something and i need your help about this.