| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|1806|[Minimum Number of Operations to Reinitialize a Permutation](https://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1806.java)||Medium|Array, Greedy|

|1805|[Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1805.java)||Medium|String|

|1800|[Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1800.java)||Easy|Two Pointers|

|1797|[Design Authentication Manager](https://leetcode.com/problems/design-authentication-manager/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1797.java)||Medium|HashTable, Design|

packagecom.fishercoder.solutions;

importjava.util.Arrays;

publicclass_1806 {

publicstaticclassSolution1 {

publicintreinitializePermutation(intn) {

int[]initial =newint[n];

int[]perm =newint[n];

for (inti =0;i <n;i++) {

initial[i] =i;

perm[i] =i;

}

int[]arr =newint[n];

inttimes =0;

do {

for (inti =0;i <n;i++) {

if (i %2 ==0) {

arr[i] =perm[i /2];

}else {

arr[i] =perm[n /2 + (i -1) /2];

}

}

times++;

for (inti =0;i <n;i++) {

perm[i] =arr[i];

}

}while (!Arrays.equals(arr,initial));

returntimes;

}

}

}