Reorganize The Array | GFG POTD 11 Oct 2024 | JAVA | C++

[@ajinkyajain2302]

C++ Code : vector rearrange(const vector& arr) { // Code here int n = arr.size(); int i = 0; vector cloned = arr; while (i < n) { int correct = cloned[i]; if (cloned[i] != -1 && cloned[i] != cloned[correct]) { swap(cloned[i], cloned[correct]); } else { i++; } } return cloned; }

[@ajinkyajain2302]

JAVA Code : public List rearrange(List arr) { // Code here int n = arr.size(); int i = 0; while(i < n){ int correct = arr.get(i); if(correct != -1 && arr.get(i) != arr.get(correct)){ arr.set(i, arr.get(correct)); arr.set(correct, correct); } else{ ++i; } } return arr; }