Daily-Coding-DS-ALGO-Practice icon indicating copy to clipboard operation
Daily-Coding-DS-ALGO-Practice copied to clipboard

Published 20 hours ago • verified publisher icon Ayush7614

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

Open itsme-aparna opened this issue 3 years ago • 1 comments

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
  • [x] C++
  • [ ] Java
  • [ ] Python

itsme-aparna avatar Oct 01 '21 17:10 itsme-aparna

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

itsme-aparna avatar Oct 01 '21 17:10 itsme-aparna