This is the 47th 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 experienced working with Strings, Linked list and many more data structures and algorithms. Today I have solved questions from Leetcode.
Concepts involved :-
Palindrome partitioning - Backtracking, conditional statements, loops.
Non-decreasing Subsequences - Backtracking, conditional statements, loops.
First question I did for today is "Palindrome partitioning". With this question, I worked with concepts like backtracking, loops and if-else statements. I felt this question quite challenging, but managed to make it out with the result.
Secondly, I did a question names "Non-decreasing Subsequences". This question and the approach for it was initially touch to think. Later after figuring what the stuff was about, I was able to come up with the approach using Backtracking.
This journey that I have started is keeping me motivated to progress upon in coding.
Top comments (0)