Hey, I am so delighted to say that I was able to take the next step in my competitive programming journey. I started with no knowledge of linked lists and have now begun learning some of the tougher concepts. After covering the basics, I moved on to more complicated topics. I’ve learned about linked lists and tackled a few related questions over the past few days. Today, I focused on Dojo-related questions, as I need them for my upcoming dojo this week. I made a plan with that in mind. So, today, I worked on three different questions that were from linked lists. One was difficult which is also based on linked list, while the other two were moderately challenging.
I did the same questions that i did in last week because i was still trying for the same belt. For the first question i did reverse linked list while i stored all in one element and another one was empty while running i added the modified data to the empty element and returned it was pretty easy as i already did it. Same goes to the second question i did middle node where i used two pointers technic which i felt comfortable and then i assigned a new value to the head of two pointers and returned the first pointer. It is also easy as it felt like the first question.
Last but not least,I did delete node from the head in this question we will delete the first index from the head and return the modified value.It was bit difficult compare to the other two questions. That all for the day. Overall, the day was great and productive.
Top comments (0)