Incorrect editorial - 1980. Find Unique Binary String

[przemek3d88]

LeetCode Username

przemysaw2

Problem Number, Title, and Link

1980. Find Unique Binary String https://leetcode.com/problems/find-unique-binary-string

Bug Category

Editorial

Bug Description

The space complexity of the first approach is incorrect. It should be $O(n^2)$, not $O(n)$ as you store the strings of length $n$.

The same applies to this sentence: "Additionally, we will convertnumsto a hash set prior to starting the recursion, so we can have checks in $O(1)$ time complexity in the base case."

It is also incorrect as the check takes $O(n)$ due to the size of the string. And the whole algorithm also take $O(n^2)$ as you check each of $n$ strings and every check is $O(n)$. However, the time complexity is correct, just parts of the explanation are incorrect.

Language Used for Code

None

Code used for Submit/Run operation

Expected behavior

Correct space complexity and explanations in approach 1.

Screenshots

No response

Additional context

No response

[exalate-issue-sync]

LeetCode Support 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

[exalate-issue-sync]

Epiphania_Ekenimoh commented: Thank you for your time.

Your feedback has been used to enhance the problem. As a token of our appreciation, your LeetCode account has been credited with 100 LeetCoins.

If you have any more questions or additional feedback, please don't hesitate to let us know. Your continued support is invaluable to us!

Best regards,
The LeetCode Team