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

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

|1920|[Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1920.java)||Easy||

|1913|[Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1913.java)||Easy|Sort|

|1910|[Remove All Occurrences of a Substring](https://leetcode.com/problems/remove-all-occurrences-of-a-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1904.java)||Medium|String|

|1909|[Remove One Element to Make the Array Strictly Increasing](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1909.java)||Easy|Array|

packagecom.fishercoder.solutions;

publicclass_1920 {

publicstaticclassSolution1 {

publicint[]buildArray(int[]nums) {

int[]ans =newint[nums.length];

for (inti =0;i <nums.length;i++) {

ans[i] =nums[nums[i]];

}

returnans;

}

}

}