Ayush7614 / Daily-Coding-DS-ALGO-Practice

A open source project🚀 for bringing all interview💥💥 and competative📘 programming💥💥 question under one repo📐📐

https://daily-ds-algo.github.io/DS-Algo-Website/

MIT License

320 stars 475 forks source link

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

Open itsme-aparna opened 3 years ago

itsme-aparna commented 3 years ago

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 commented 3 years ago

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