Go
Go copied to clipboard
feat: add next permutation problem
A practice to find lexicographically next greater permutation of the given array of integers.
- If there does not exist any greater permutation, then print the lexicographically smallest permutation of the given array.
- The implementation below, finds the next permutation in linear time and constant memory and returns in place.
Codecov Report
All modified and coverable lines are covered by tests :white_check_mark:
Project coverage is 87.39%. Comparing base (
833a3e5
) to head (93c207e
).
Additional details and impacted files
@@ Coverage Diff @@
## master #720 +/- ##
==========================================
+ Coverage 87.36% 87.39% +0.03%
==========================================
Files 200 201 +1
Lines 5317 5333 +16
==========================================
+ Hits 4645 4661 +16
Misses 533 533
Partials 139 139
:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.
sounds odd! one of the tests is failing that haven't changed since years ago