This is the 12th day of the Competitive programming journey. I am happy to have started this. Through this journey I have discovered many platforms and their workings. In this journey I had come accross working with Strings, Arrays and many more data structures. Today I have solved questions from Leetcode.
Concepts involved :-
1.Asteroid Collision - Loops, conditional statments, arrays.
2.Reverse nodes in k-group - linked list, functions, loops.
First question I did for today is "Asteroid Collision". This question made me get a good grip over Arrays in python and conditional statements.
Secondly I worked with a problem called "Reverse nodes in k-group". This is one hard problem in leetcode where I deepened my grop over linked list. As soon as I conpleted, I realised that the approach is quite easy.
Top comments (0)