Hm! I'm pretty sure I've seen this problem in a book....the name "Zumbania" included. How now, brown cow?
Wouldn't have been able to do it without the hint.
My code is not at all "beautiful", "efficient", or "elegant", but for those who have no idea how to do it, here's my solution. my code
Again, I wish there was an answer somewhere....else, how do I learn from these exercises?
But....with only one loop? I'd really like to know how to do that.
Actually it should have been clarified - the one loop solution uses another data structure such as a hash map.
Can anyone possibly rephrase the Challenge for me? I seem to be misunderstanding the concept.
It's just asking if you can split a given list of numbers into two parts with the same sum in each part, without changing the order.
Ah, gotcha! Thanks.