I've listened to about half of it now, and I think it's very helpful. It's not just a lecture that teaches algorithms/data structures; it explains in detail how to approach problems, various solution methods, and how to calculate time complexity to understand why certain approaches result in time-outs. I also like that there are many diverse problems. I'll keep working hard at it! haha

I'm listening with great satisfaction. Thank you for creating such a good lecture.

I'll take a good look at it, thank you!

When I first started preparing for coding tests, I struggled with algorithms and problem-solving approaches. When I first took the coding test course, there were difficult parts, but through multiple reviews, I was able to approach it with understanding and memorization. The well-organized materials and code were especially helpful when studying. Thank you.

I've seen a lot of posts saying that self-studying algorithms is enough, so I hesitated to take a lecture, but I'm so satisfied with the lecture that I regret the time I hesitated. In particular, I liked the part where the problem was approached from various angles and the thought process was well revealed in the solution. There are actually many good materials on the Internet about the conceptual parts of algorithms and how to solve problems to improve your skills. However, through the lecture, I was able to properly understand what it meant to see, understand, and follow the actual application of the contents while solving problems. Just listening to the lecture and understanding the contents of the lecture will not make it easy to solve problems right away, but I think you can definitely learn how to solve problems properly. If you have any concerns that your skills are not improving even though you have solved some algorithm problems, as I did, it would be good to check whether you have been solving problems properly through the lecture. In addition, the lecture content is good, but the composition and order are also good. It was really good to learn the algorithms corresponding to the approaches mentioned in the lecture (recursive, brute force, greedy, dp) from the beginning. Lastly, the answers to the questions were so detailed that I read all the answers even though they were not the questions I wrote.