So I am not a coding expert, and they make it very clear on the site over at Project Euler that it's intended to open up a problem that you may run into in the real world of coding to overcome certain issues. If you haven't already answered them, I suggest you go over to their site, give it a shot, and then come back. Or I suppose if you don't ever intend to - maybe this is a good opportunity for you to get some insight into some of the problems you can run into when trying to iterate these questions.
So at first glance this question almost seems like it's workable in your head. It's pretty straight forward right? My first thought is immediately and IF statement. If it's divisible by 3 or 5, then....
Or perhaps you'd want to omit with an IF statement. If it's not divisible by 3 or 5 then...
Step 2 should be to maybe gather a list or collection of all the multiples so I can sum them up. Although before I even write any code at all I can already see an issue. 15 is evenly divisible by 3 and 5, so my list would contain 2 15's... Can't have that. So I start to think about how I would omit. My mind goes to a duplicate remover. using Pythons built in count(). Something like if count(index_of_the_list) >=2 then pop(). The reason I can pop it without having to worry about its position is because I can pair that with a for loop to iterate the list individually.
Step 3 - Sum them. I can do this with a simple print function. Print(total)
Let's look at my solution
So obviously this could have been done more gracefully, sure. I realize that now. It did however confirm for me at least that I have the skills to at least get the correct answer without any help. I wrote this all from my head, and that is pretty cool! It also did give me insight later down the road to a few more things I can do with my code to make it even more efficient. So yeah it's pretty self explanatory and it's nice and clean to look at which helps me when I have to go back and reference my own code. I am happy with how it turned out and I got the write answer first try