search

CodeHarborHub / codeharborhub.github.io

Welcome to CodeHarborHub! Our mission is to provide accessible and comprehensive educational resources to learners of all levels, from beginners to advanced professionals. Whether you're looking to kickstart your career in web development, master a new programming language, or stay updated on the latest tech trends, we've got you covered.
https://codeharborhub.github.io/
MIT License
80 stars 165 forks source link

[Feature Request]: Missing Leetcode solution 1111 #3226

Closed kashvi7440 closed 1 month ago

kashvi7440 commented 1 month ago

Is there an existing issue for this?

Feature Description

I am requesting the addition of a solution for LeetCode Problem No. 1111, "Maximum Nesting Depth of Two Valid Parentheses Strings". This problem involves finding two disjoint valid parentheses subsequences from a given string such that the maximum depth of the parentheses is minimized.

Use Case

This feature would enhance the project's collection of LeetCode solutions, providing users with an efficient and easy-to-understand solution for this specific problem. It would be particularly useful for users preparing for coding interviews or practicing their algorithm skills.

Benefits

Increased Utility: Adds a valuable resource for users practicing LeetCode problems. Efficiency: Provides an efficient solution to a common algorithmic problem.

Add ScreenShots

No response

Priority

High

Record

github-actions[bot] commented 1 month ago

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[bot] commented 1 month ago

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