Closed sekerez closed 1 week ago
Epiphania_Ekenimoh commented: Hello,
Your reported issue has been relayed to our team for thorough investigation. We appreciate your patience as we work to address and resolve this matter. We will reach out to you when we have updates regarding the issue.
If you have any further questions or concerns in the meantime, please feel free to let us know.
Best regards, LeetCode Support Team
Epiphania_Ekenimoh commented: Hello there,
Thank you so much for your thoughtful feedback and for taking the time to share your solution!
We truly appreciate users like you who help improve the LeetCode experience for everyone. While your approach is indeed valuable, the current editorial solution is well-known and widely embraced by many users, thanks to its simplicity and effectiveness with the recurrent single approach. As a result, we won't be adding new solutions to this editorial at this time. However, your contribution is still greatly appreciated. Thank you again for your input!
Best, LeetCode Support Team
LeetCode Username
sekerez
Problem Number, Title, and Link
Bug Category
Editorial
Bug Description
Not an actual bug, I just think that the editorial should include an additional solution which, while presenting a slightly worse complexity for the problem (O(n+e) instead of (O(e*ack(n))), still passes all testcases and I think is very simple! See my solution: https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/solutions/5398143/simple-linear-time-solution-no-union-find
Language Used for Code
Python/Python3
Code used for Submit/Run operation
Expected behavior
expect a second valid solution in the editorial, modeled after mine (basically, 3 dfs in a row)
Screenshots
No response
Additional context
No response