Good day ☁️ It’s time to write my weekly report for last week.
::LeetCode::
Completed two problems:
- 131. Palindrome Partitioning 🟡 Medium
- 132. Palindrome Partitioning II 🔴 Hard
I often come across problems that are solved using recursive memoization: first, I write the code to perform an exhaustive search of all possible solutions step-by-step, and then I add each result to a HashMap so that if the same step is encountered again, it immediately returns the answer instead of recalculating it. An example of this approach is in my screenshot.
I remember how I tried to solve problems during programming classes at school using Turbo Pascal. Of course, there was no HashMap in the standard library back then 🤯 and even if there were one, I had no idea it existed. Now I use the Map class from JavaScript.
::Digital Drawing::
Last week, I spent about 13 hours finishing a drawing. On Sunday, I sat over this task for a very long time to finish it before Monday and post it. It was exhausting. At the end of next week, I’ll check how many likes I manage to collect for the new drawing ⭐
Summary of the week: it’s good that I managed to finish the drawing 🥵 but there was very little time left for coding because of it 😤 Next week, I plan to complete more problems on LeetCode and reach problem number 140.
