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

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

|1561|[Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1561.java)||Sort|Medium|

|1560|[Most Visited Sector in a Circular Track](https://leetcode.com/problems/most-visited-sector-in-a-circular-track/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1560.java)||Array|Easy|

|1558|[Minimum Numbers of Function Calls to Make Target Array](https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1558.java)||Medium|Greedy|

|1557|[Minimum Number of Vertices to Reach All Nodes](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1557.java)||Medium|Graph|

packagecom.fishercoder.solutions;

importjava.util.Arrays;

publicclass_1561 {

publicstaticclassSolution1 {

publicintmaxCoins(int[]piles) {

Arrays.sort(piles);

intj =0;

intcoins =0;

for (inti =piles.length -2;i >0;i -=2) {

coins +=piles[i];

if (++j ==piles.length /3) {

returncoins;

}

}

returncoins;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1561;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_1561Test {

privatestatic_1561.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1561.Solution1();

}

publicvoidtest1() {

assertEquals(9,solution1.maxCoins(newint[]{2,4,1,2,7,8}));

}

publicvoidtest2() {

assertEquals(4,solution1.maxCoins(newint[]{2,4,5}));

}

publicvoidtest3() {

assertEquals(18,solution1.maxCoins(newint[]{9,8,7,6,5,1,2,3,4}));

}

}