Interval algorithm - code review - review the peer's code and gave out the hint to analyze the advancement of interval.

IntervalAlgorithm_codereview.java

import java.io.*;
import java.util.*;

class Solution {

  static int[] meetingPlanner(int[][] slotsA, int[][] slotsB, int dur) {
    // your code goes here
    
    int i=0;
    int j=0;
    while(i<slotsA.length && j<slotsB.length){
      int[] a = slotsA[i];
      int[] b = slotsB[j];
      
      if(isThereAnyOverlap(a,b) && isFreeDurationExists(a,b,dur)){
        // check is duration can exist in both
          int start = Math.max(a[0],b[0]);
          int end = start+dur;
          return new int[] {start,end};
      }
        
      if(a[1]<b[1]){
        i++;
      }
      else{
        j++;
      }
    }
     return new int[] {};
  }
  
  static boolean isFreeDurationExists(int[]a,int[]b, int dur){
    int maxStart = Math.max(a[0],b[0]);
    int minEnd = Math.min(a[1],b[1]);
    
    int bandOfFree = minEnd-maxStart;
    return bandOfFree>=dur;
  }
    
  static boolean isThereAnyOverlap(int[]a, int[]b){
    
    // check of no overlap case
    // either startb>enda || starta>endb .   10,50   0,9
    /*
    if(b[0]>a[1]||a[0]>b[1]){
      return false;
    }
    return true;
    */
    return !(b[0]>a[1]||a[0]>b[1]);
  }  
  
  public static void main(String[] args) {

  }  
  
  //[[7,12]], 
  //[[2,11]], 
  //5    
  
  // slotsA =  {60-120}
  // slotsB  = {60-70}
  // dur 8 
}