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 encounter problems that are solved recursively with caching: at first, I write code to perform a complete sweep of all possible solutions step by step, and then add each result to a HashMap so that on the second visit to the same step, the answer is returned instantly instead of recalculating it. An example of such an approach is on my screenshot.
I remember trying to solve coding problems in school using Turbo Pascal. Of course, there was no HashMap in the standard library back then, and even if there had been one, I wouldn't have known about it. Now I use the Map class from JavaScript.
::Digital Drawing::
Last week, I spent approximately 13 hours completing a drawing. On Sunday, I worked on this task for a long time to finish it before Monday and post it. It was intense. Next week, I'll check how many likes my new drawing gets ⭐
This week's summary: good that I was able to complete the drawing 🥵 but there was little time for coding due to this 😤 Next week, I plan to solve more LeetCode problems and reach problem number 140.