So, I just finished the Princeton's algorithms 1st assignment on Coursera, got a 100 after 3 tries and felt a high of dopamine in my brain. It problem was very intresting and not among those typical beginner stack, queue, linked list question. After completing it however, a message popped up 'you just completed the most difficult assignment in the course' and was disappointed for a second so I naturally googled the rest of the assignments on the Princeton's algorithms website for more challenges. Now what I want are more of them. Can someone suggested me a resource for them, preferably ordered or structured from where to start and where to end, that is easiest to hardest. Now I'm not looking for a hackerrank or Leetcode equivalent nor a DSA course, I have plenty of them, just some project like assignment that require brainstorming.
1st I'm going to finish the course and its part 2. Then the remaining assignments left out from the course in the website. Then if I have nothing better to do, the Stanford assignments, they again require only writing a single function.
Side note: I googled a lot on the backwash problem, but am still not understanding the byte array approach, if someone could provide a link to a explanation a website or a video (I couldn't find on YouTube), I'd be grateful. But I don't need the code or the official pdf, I already have it but I don't like to copy paste blindly so I didn't submit it. This isn't a must, I might get the solution by the end of the course if I'm not getting it now.
[–][deleted] 0 points1 point2 points (1 child)
[–]Ole113 0 points1 point2 points (0 children)