This is the 20th 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, arrays,loops.
2.Greed Factor - Arrays, loops, conditional statements.

First question I did for today is "Beautiful Arrangement". This question solution requires backtracking to solve it. Through this question I deepened my understanding towards backtracking.

Secondly I did a question called "Greed Factor".This dealt with Arrays and their traversal.Here we have to find the maximum sum of sub array. Through this question I stregnthen dealing with loops and conditional statements.