This is the 48th 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.Beautiful Arrangement - Backtracking, conditional statements, loops.
2.Path with Maximum Gold - Backtracking, conditional statements, loops.
First question I did for today is "Beautiful Arrangement". With this question, I worked with concepts like backtracking, loops and if-else statements.
Secondly, I did a question names "Path with Maximum Gold". This question was challenging. With the question, I was able to get a grip on how much we can backtrack in a recurrsion tree. This also gave me a confidence in solving further backtracking sums.
Top comments (0)