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 list in which one of them is array. Two were difficult while the third one is okay.
First and foremost i would like to start of with my dojo belt test which i took today to be frank i though that i will be able to clear the belt but unfortunately i was able to do two question and after that i did all the next three but their is error in compiler because of the issue i lost the belt .And for learning more about linked list i was following an youtube channel. It helped me a lot with the proper guidance that i need to solve the questions.
For the first question, I did Find the sub-array which has largest sum and return its sum. In which we were provided with a list their we have to take the largest sub-array then we have to sum the array and return the value. For next question i did merge two sorted linked list where we were given two sorted linked list and we have to merge them and print the output i used the concept merge sort in sorting algorithms. it was the most difficult question for today. I felt it to be easy compare to the first one and i was improving every day and it felt good to see myself better than yesterday.
Last but not least, I did flattering of linked list. The idea is to traverse the linked list and push values of all the nodes in an array. Now, we can sort the array in ascending order, and create a new linked list by traversing the sorted array. While creating the new linked list, we will append the nodes using the bottom pointer of flattened linked list.. That all for the day. Overall, the day was great and productive.
Top comments (0)