Solution: Minimum Number of Platforms Required for TrainStation

class MinPlatforms {
 public static int findPlatform(int[] arrival, int[] departure) {
  int n = arrival.length;
  int result = 0;
  int count = 0;
  for (int index = 0; index < n; index++) {
   count = 0;
   for (int i = 1; i < n; i++) {
    if (arrival[i] >= arrival[index] && arrival[i] <= departure[index]) {
     count++;
    }
   }
   if (result < count)
    result = count;
  }
  return result;
 }
}
class Main{
  public static void main(String[] args){
    
    //Example 1
    int arrival[] = {900, 940, 950, 1100, 1500, 1800};
    int departure[] = {910, 1200, 1120, 1130, 1900, 2000};
    int answer  = MinPlatforms.findPlatform(arrival, departure);
    System.out.println("Minimum Number of Platforms Required for Plan1 = " + answer);
    
    System.out.println();
    // Example 2
    int arrival1[] = {200, 210, 300, 320, 350, 500};
    int departure1[] = {230, 240, 320, 430, 400, 520};
    int answer2 = MinPlatforms.findPlatform(arrival1, departure1);
    System.out.println("Minimum Number of Platforms Required for Plan2 = " + answer2); 
    
  }
}