Hasil untuk quest ini: https://www.hackerrank.com/challenges/cloudy-day/problem?isFullScreen=true

Cloudy Day(fail one).dart

import 'dart:math';

void main() {
//   case 0
//   final townPopulation = [8, 10, 100, 40];
//   final townLocation = [4, 5, 100, 120];
//   final couldLocation = [4];
//   final coludExtendCoverage = [1];
  
//   case 1
  final townPopulation = [10, 1, 8, 3];
  final townLocation = [4, 5, 7, 2];
  final couldLocation = [3, 9, 3, 5];
  final coludExtendCoverage = [11, 10, 8, 7];
  
  final getResult = maximumPeople(townPopulation, townLocation, couldLocation, coludExtendCoverage);
  print(getResult);
}

int maximumPeople(List<int> p, List<int> x, List<int> y, List<int> r) {
  final cloudCount = y.length == r.length ? y.length : 0;
  final townCount = p.length == x.length ? p.length : 0;
  final listIndexTown = List.generate(townCount, (i) => i);
  
  final blackZone = <int>[];
  
  for (var i = 0; i < cloudCount; i ++) {
    final leftCloud = y[i] - r[i];
    final rightCloud = y[i] + r[i];
    for (var j = 0; j < townCount; j ++) {
      if (leftCloud <= x[j] && rightCloud >= x[j]) {
        blackZone.add(j);
      }
    }
  }
  
  for (final blackIndex in blackZone) {
    listIndexTown.remove(blackIndex);
  }
  
  final whiteZone = listIndexTown.map((i) => p[i]).toList();
  final selectedList = blackZone.map((i) => p[i]).toList();
  
  final maxValue = selectedList.reduce(max);
  final result = whiteZone.reduce((a, b) => a + b) + maxValue;
  return result;
}