-
Notifications
You must be signed in to change notification settings - Fork 1k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Need to correct the example test case output written in the down of the NextPermutation problelm. #7537
Comments
Hello @KmrAnish04, |
/assign |
This issue has been assigned to @KmrAnish04! |
is this issue closed? |
here is the PR id = #7539 for this issue. @Ash-KODES |
@KmrAnish04, this issue hasn't had any activity in 5 days. It will become unassigned in 7 days to make room for someone else to contribute. |
Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Telegram or ping one of the reviewers. Thank you for your contributions! |
💥 Proposal
Need to correct the example test case output written in the down of the question file named NextPermutation having path "C-Plus-Plus/cp/NextPermutation.cpp"
(Write your answer here.)
Currently written test case in the file is:
/**
Input :
6
5 3 4 9 7 6
Output :
6
5 3 4 9 7 6
Time Complexity : O(nlogn)
Space Complexity : O(n)
**/
Changes need to be done:
/**
Input :
6
5 3 4 9 7 6
Output :
5 3 6 4 7 9
Time Complexity : O(nlogn)
Space Complexity : O(n)
**/
Explanation:
Test case: According to the algorithm written in the file,
for the test case:
6
5 3 4 9 7 6
The correct output is:
5 3 6 4 7 9
Here the space complexity is already correct. No need to change space complexity.
The text was updated successfully, but these errors were encountered: