This is the 50th 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.N-Queens II - Backtracking, conditional statements, loops.
2.3Sum Closest - Two pointer algorithm, Loops, conditional statements.
First question I did for today is "N-Queens 2". This question is quite similar to N-Queens 1. This also involved deep understanding of backtracking.
Secondly I did a question names "3 Sum closest". This sum was also quite similar to 3sum. This involved two pointer algorithm to solve this question effeciently.
Top comments (0)