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

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

|1925|[Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1925.java)||Easy|Array, Greedy|

|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|

packagecom.fishercoder.solutions;

publicclass_1925 {

publicstaticclassSolution1 {

publicintcountTriples(intn) {

intcount =0;

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

for (intj =1;j <n;j++) {

intproduct =i *i +j *j;

doublesq =Math.sqrt(product);

if (sq <=n && (sq -Math.floor(sq) ==0)) {

count++;

}

}

}

returncount;

}

}

}