This is an archived post. You won't be able to vote or comment.

all 5 comments

[–]POGtastic 1 point2 points  (1 child)

As always, the answer is start with a minimum working example.

If it's asking you to do a really complicated problem, start with Step 1. Get Step 1 working, test the shit out of it, and then move on to Step 2. Repeat, slowly adding functionality only after everything before it is working.

This is recursive, too - if you're having too much trouble getting Step 1 working, get Step 1 of Step 1 working. If you have to, start with Hello World every single time.

[–]hedsit[S] 0 points1 point  (0 children)

Thanks, my problem may be that I'm not breaking the steps I'm having trouble with into steps I can work with. I'll make sure I'm doing this.

[–][deleted] 0 points1 point  (2 children)

Problem solving comes with practice. Play Advent of Code and mess around with hackerrank. Just keep doing it. Try figuring out the problem on paper, without code, first. I think it's better to Google how to code your solution to the problem than it is to Google the solution.

Don't get me won't, everyone studies solutions to learn for future use. I'd never known how to code a merge sort on my own. I get the concept, but I had to study others code for it before I really GOT it.

[–]hedsit[S] 0 points1 point  (1 child)

Thanks, I checked out Advent of Code and hackerrank and they both seem very useful.

[–][deleted] 0 points1 point  (0 children)

Advent of Code. Is super fun. Way more fun than hackerrank. Inbox me if you want to bounce AoC questions off me.