Skip to content
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.

Sign up for GitHub

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

Jump to bottom

Add a gfg question: Maximum number produced by k adjacent swaps #2455

Open
1 of 4 tasks
itsme-aparna opened this issue Oct 1, 2021 · 1 comment
Open
1 of 4 tasks

Add a gfg question: Maximum number produced by k adjacent swaps #2455

itsme-aparna opened this issue Oct 1, 2021 · 1 comment

Comments

@itsme-aparna
Copy link

Aim

Given an array a[ ] and the number of adjacent swap operations allowed are K. The task is to find the max number that can be formed using these swap operations.

Details

Features of this script:

  1. Step by step explanation of the code
  2. Clean and concise code with time complexity analysis

Programming language

  • C
  • C++
  • Java
  • Python
@itsme-aparna
Copy link
Author

@Ayush7614 can you please assign this to me under Hacktoberfest?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@itsme-aparna