DEV Community

Prasanna Venketesh
Prasanna Venketesh

Posted on

48th day of my CP journey

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.

Image description

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.

Image description

Image of Datadog

The Future of AI, LLMs, and Observability on Google Cloud

Datadog sat down with Google’s Director of AI to discuss the current and future states of AI, ML, and LLMs on Google Cloud. Discover 7 key insights for technical leaders, covering everything from upskilling teams to observability best practices

Learn More

Top comments (0)

Image of Docusign

🛠️ Bring your solution into Docusign. Reach over 1.6M customers.

Docusign is now extensible. Overcome challenges with disconnected products and inaccessible data by bringing your solutions into Docusign and publishing to 1.6M customers in the App Center.

Learn more