|1763|[Longest Nice Substring](https://leetcode.com/problems/longest-nice-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1763.java)||Easy|String|

|1759|[Count Number of Homogenous Substrings](https://leetcode.com/problems/count-number-of-homogenous-substrings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1758.java)||Medium|String ,Greedy|

|1758|[Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1758.java)||Easy|Greedy, Array|

|1756|[Design Most Recently Used Queue](https://leetcode.com/problems/design-most-recently-used-queue/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1756.java)||Medium|Array, Design, Dequeue|

|1754|[Largest Merge Of Two Strings](https://leetcode.com/problems/largest-merge-of-two-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1753.java)||Medium|Greedy, Suffix Array|

|1753|[Maximum Score From Removing Stones](https://leetcode.com/problems/maximum-score-from-removing-stones/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1753.java)||Medium|Math, Heap|

|1752|[Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1752.java)||Easy|Array|

packagecom.fishercoder.solutions;

importjava.util.ArrayList;

importjava.util.List;

publicclass_1756 {

publicstaticclassSolution1 {

classMRUQueue {

List<Integer>list;

publicMRUQueue(intn) {

list =newArrayList(n);

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

list.add(i);

}

}

publicintfetch(intk) {

intfetched =list.remove(k -1);

list.add(fetched);

returnfetched;

}

}

}

}