import static java.util.stream.IntStream.of;

public class Average {
   public static int averageFinder(int[] arr) {
     return (int)of(arr).average().orElse(0);
   }
}

import java.util.stream.*;

public class Average {
   public static int averageFinder(int[] arr) {
     return (int)IntStream.of(arr).average().orElse(0);
   }
}

import java.util.*;

class Solution {
  	   
    public static int retSmallestPositiveInteger() {       
      for (int i=1; ; i++) {
        final char[] d = digits(i);
        if (hasSameDigits(d,i*2) && hasSameDigits(d,i*3) && hasSameDigits(d,i*4) && hasSameDigits(d,i*5) && hasSameDigits(d,i*6)) {
          return i; 
        }
      }
    }
     
    private static char[] digits(final int x) {
      final char[] d = (""+x).toCharArray();
      Arrays.sort(d);
      return d;
    }
  
    private static boolean hasSameDigits(final char[] xdigits, final int y) {
		  return Arrays.equals(xdigits, digits(y));
    }
}

public class Dinglemouse {

  // Use CSS to display a pretty version of the flap display
  // From: https://www.codewars.com/kata/airport-arrivals-slash-departures-number-1/java
  public static String[] prettyPrint(final String[] lines) {
    String s = "";
    for (int y = 0; y < lines.length; y++) {
      s += "<div style=\"height:23px\">";
      for (int x = 0; x < lines[y].length(); x++) {
        s += "<span style=\"font-size:10px;color:yellow;padding:5px;border:1px solid gray;background:black\">"+lines[y].charAt(x)+"</span>";
      }
      s += "</div>";
    }
    System.out.println(s);
    return lines;
  }

}

package com.mystuff.juststuff;

import java.text.*;
import java.util.*;

public class Palindrome {

	private static final SimpleDateFormat sdf = new SimpleDateFormat("MMddyyyy");

	public Set<Date> countDatePalindromes(final Date startDate, final Date endDate) {
		final Set<Date> set = new TreeSet<>();
		final GregorianCalendar startCal = new GregorianCalendar();
		final GregorianCalendar endCal = new GregorianCalendar();

    // If end date is before start date, flip them.
    startCal.setTime(startDate.before(endDate) ? startDate : endDate);
    endCal.setTime(startDate.after(endDate) ? startDate : endDate);
    
		for (; startCal.before(endCal) || startCal.equals(endCal); startCal.add(Calendar.DAY_OF_MONTH, 1)) {   
			final String forward = sdf.format(startCal.getTime());
      final String back = new StringBuilder(forward).reverse().toString();            
			if (forward.equals(back)) {
        set.add(startCal.getTime()); // Date string looks same both ways	
      }
		}	
    
		return set;
	}
	
}

function getFactors (n) {
  if (!Number.isInteger(n) || n < 1) return [];
  
  var divisors = new Set(); 
  var step = n % 2 == 0 ? 1 : 2;
  for (let i = 1; i <= Math.sqrt(n); i += step) {
    if (n % i == 0) divisors.add(i).add(n/i)
  }
  return Array.from(divisors).sort((a,b)=>a-b)
}

function getFactors (n) {
  if (!Number.isInteger(n) || n < 1) return [];
  
  var divisors = new Set();  
  for (let i = 1; i <= Math.sqrt(n); i++) {
    if (n % i == 0) divisors.add(i).add(n/i)
  }
  return Array.from(divisors)
}

import java.util.*;

public class MatchingBrackets {

  static final Map<Character, Character> brackets = new HashMap<Character, Character>() {{
    put(')','(');
    put('}','{');
    put(']','[');
  }};
  
  public static boolean isBalanced(final String braces) {
    final Stack<Character> stack = new Stack<>();
    for (final char brace : braces.toCharArray()) {  
      if (!stack.isEmpty() && stack.peek() == brackets.get(brace)) {
        stack.pop();
      } else {
        stack.push(brace);
      }
    }
    return stack.isEmpty();
  }
}

import java.util.stream.*;

class Solution {

  public static String largestNumber(final Integer[] nums) {
    return Stream.of(nums)
      .sorted((a,b)->(""+b+a).compareTo(""+a+b))
      .map(n->""+n)
      .collect(Collectors.joining());
  }
}

import java.util.*;

class Solution {

  public static String largestNumber(final Integer[] nums) {
  
    Arrays.sort(nums, new Comparator<Integer>() {
      
      @Override
      public int compare(final Integer a, final Integer b) {        
        return (""+b+a).compareTo(""+a+b);
      }
      
    });
    
    String result = "";
    for (final Integer num : nums) {
      result += num;
    }
    
    return result;
  }
}