Hey everyone! I have my final exam in algorithmic problem-solving coming up in a few days, and I'm feeling a bit anxious. I've done well so far in the course thanks to my previous experience with Python — I even completed a Python programming course on mooc.fi in 2025. However, I've heard that the final exam is particularly challenging and doesn't align well with the practice questions we've done in class.
Some of the types of questions that have been asked in the past include the PayPal zigzag conversion problem and applying the sundog effect to words, as well as working with nested dictionaries for search queries. The course has mainly covered nested lists, dictionaries, and recursion, but I often find the implementation of these concepts in the exam questions confusing.
Can anyone recommend websites or practice problems that are similar or slightly harder than those mentioned but don't require knowledge beyond what's in the syllabus? Any help would be greatly appreciated! It seems like most of the relevant practice is on LeetCode, so if anyone has specific links or questions to suggest, that would be awesome!
3 Answers
You're definitely not alone in seeking help! A lot of us come here when other resources don't cut it. Just remember, practice is key, and focusing on recursion might actually help you understand some of the trickier problems!
Consider trying out the minesweeper algorithm! It involves working with a 2D array and requires you to determine how many mines touch each cell. It’s not too challenging but is a good exercise for organizing your code. Bonus points if you dive into the flood fill algorithm when clicking a zero cell—it’s a fun twist!
Have you checked if your course has a textbook? Typically, there are sections in textbooks that align with what you'll face in exams. It might have some practice problems that can help you out!
Unfortunately, there isn't a textbook for this course. We get worksheets, but the final exam questions are tougher than those. If you have any specific textbooks in mind, that would be great!