LastMonopoly

// ignore_for_file: avoid_print
// Copyright 2022 LastMonopoly@outlook.com. All rights reserved.
// Solution to https://adventofcode.com/2018/day/10

void main() => solve(getInput());

void solve(List<String> input) {
  List<Point> points = parsePoints(input);

  // Find out when the area size is the smallest within the first 100,000 seconds

LastMonopoly

// ignore_for_file: avoid_print
// Copyright 2022 LastMonopoly@outlook.com. All rights reserved.
// Solution to https://adventofcode.com/2021/day/10

void main() => solveSecondHalf(getInput());

void solveSecondHalf(List<String> input) {
  List<int> scores = [];
  List<String> completions = [];
  for (String line in input) {