[Feature Request]: Add the LP solution for 1121

[kashvi7440]

Is there an existing issue for this?

• I have searched the existing issues

Feature Description

I am requesting the addition of LeetCode problem number "1121. Divide Array Into Increasing Sequences". This problem involves determining the earliest time at which all individuals in a network become friends, given a series of friendship events over time. The problem can be modeled using graph theory, specifically focusing on union-find data structures or other methods to track connected components in the graph

Use Case

Adding this problem would provide users with a new problem to solve, which can help in practicing and enhancing their problem-solving skills in graph theory and union-find techniques. This problem is a good example of real-world scenarios where connectivity and network analysis are important.

Benefits

Implementing this feature would expand the variety of problems available in the repository, thus catering to a wider range of interests and skill levels. It will also help users practice and improve their understanding of advanced algorithms and data structures. Providing solutions and discussions for such problems can foster a more engaged and knowledgeable community.

Add ScreenShots

No response

Priority

High

Record

• I have read the Contributing Guidelines
• I'm a GSSOC'24 contributor
• I have starred the repository

[github-actions]

Hi @kashvi7440! Thanks for opening this issue. We appreciate your contribution to this open-source project. Your input is valuable and we aim to respond or assign your issue as soon as possible. Thanks again!

[github-actions]

Hello @kashvi7440! Your issue #4093 has been closed. Thank you for your contribution!