public int findJudge(int N, int[][] trust) {
  int score[] = new int[N+1];
  for(int tr[] : trust){
      score[tr[0]] -= 1;
      score[tr[1]] += 1;
  }

  for(int i=1; i<N+1; i++){
      if(score[i]==N-1){
          return i;
      }
  }
  return -1;
}