Two Swaps | GFG POTD 16 Oct 2024 | JAVA | C++

[@ajinkyajain2302]

JAVA Code : public boolean checkSorted(List arr) { // code here int n = arr.size(); int swapCnt = 0; for(int i = 0; i < n; ++i){ if(arr.get(i) == i + 1){ continue; } while(arr.get(i) != i + 1){ int temp = arr.get(arr.get(i) - 1); arr.set(arr.get(i) - 1, arr.get(i)); arr.set(i, temp); ++swapCnt; } } return swapCnt == 2 || swapCnt == 0; }

[@ajinkyajain2302]

C++ Code : bool checkSorted(vector &arr) { // code here. int n = arr.size(); int swapCnt = 0; for(int i=0;i