Maximum Perimeter Triangle Hackerrank Solution - java For Explanation watch video : Code: import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.function.*; import java.util.regex.*; import java.util.stream.*; import static java.util.stream.Collectors.joining; import static java.util.stream.Collectors.toList; class Result { /* * Complete the 'maximumPerimeterTriangle' function below. * * The function is expected to return an INTEGER_ARRAY. * The function accepts INTEGER_ARRAY sticks as parameter. */ public static List<Integer> maximumPerimeterTriangle(List<Integer> sticks) { Collections.sort(sticks); ArrayList<Integer> al = new ArrayList<>(); int i = sticks.size()- 3 ; while (i>= 0 ){ if (sticks.get(i)+sticks.get(i+ 1 )>sticks.get(i+ 2 )){