Solution #31 - Neha Amin - 17/07/25 - #73
Merged
Merged
Conversation
NEHA-AMIN
changed the title
NEHA-AMIN
changed the title
NEHA-AMIN
force-pushed
the
feature/next-permutation
branch
from
July 18, 2025 12:45
05c8ebe to
44409fe
Compare
NEHA-AMIN
changed the title
NEHA-AMIN
force-pushed
the
feature/next-permutation
branch
from
July 19, 2025 08:54
44409fe to
246f0fa
Compare
NEHA-AMIN
changed the title
NEHA-AMIN
force-pushed
the
feature/next-permutation
branch
from
July 19, 2025 08:55
246f0fa to
2e73234
Compare
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This PR adds a solution for Leetcode Problem: Next Permutation.
The goal is to rearrange a given array of integers into the lexicographically next greater permutation of numbers.
If such an arrangement is not possible (i.e., the array is sorted in descending order), the array is rearranged to its lowest possible order (sorted in ascending order).
The implementation modifies the array in-place using an efficient O(N) algorithm that identifies the first decreasing element from the end.