This week, delving deeper into Java with Coding Bat challenges has been quite a journey. It's been about revisiting the basics and exploring new ways to tackle problems using Java's tools. Each challenge felt like solving a puzzle—I started by carefully reading through the problem, considering different strategies, and jotting down ideas before writing any code. Planning things out helped a lot; it clarified my thoughts and made the coding part smoother. What worked best was breaking down the tasks into smaller steps and testing as I went along. However, there were times when I got stuck in overthinking or missed simpler solutions, which required going back and refining my approach. On average, I needed a couple of tries per challenge to get it right, but each attempt taught me something new about Java. Overall, these challenges have been a great way to warm up to Java again, boosting my confidence and skills bit by bit.
This week I focused a lot on understanding time complexity and recursive analysis. It was challenging at first to figure out how to break down recursive functions and write the correct recurrence relations. Applying the Master Theorem was especially tough because I had to carefully identify each part of the formula and decide which case applied. I also spent time reviewing the difference between Big O, Big Omega, and Big Theta, which helped me better understand how to describe the efficiency of an algorithm. These concepts took time to click but working through examples really helped.
Comments
Post a Comment