This is the 49th 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.Maximum Length of a Concatenated String with Unique Characters - DP and bit manipulationn.
2.N-Queens - Backtracking, conditional statements, loops.
First question I did for today is "Maximum Length of a Concatenated String with Unique Characters". This question is something that introduced me to some new concepts like Bit-manipulation and basic Dynamic programming. I did this with the guidance of my mentor.
Secondly I did a question named "N-Queens". This is the toughest question that I have done using backtracking. It took a lot of time to do this question as this one was challenging. It involves advance backtracking concepts.
Top comments (0)