Merge pull request #30 from fartem/3516-Find-Closest-Person

2025-04-30 v. 1.0.1: added "3516. Find Closest Person"

Author: fartem

.github/workflows/dart.yml

@@ -13,8 +13,8 @@ jobs:
       - uses: actions/checkout@v2
       - uses: dart-lang/setup-dart@v1.0
         with:
-          sdk: 2.18.0
+          sdk: 3.7.2
       - name: Install dependencies
         run: dart pub get
       - name: Run tests
-        run: dart test
+        run: dart test -c source

Makefile

@@ -0,0 +1,2 @@
+checks:
+	fvm dart test -c source

README.md

@@ -13,7 +13,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 ### Easy
 
 | Name                                            | Link to LeetCode                                                                  | Link to solution                                                   |
-|-------------------------------------------------|-----------------------------------------------------------------------------------|--------------------------------------------------------------------|
+| ----------------------------------------------- | --------------------------------------------------------------------------------- | ------------------------------------------------------------------ |
 | 1. Two Sum                                      | [Link](https://leetcode.com/problems/two-sum/)                                    | [Link](./lib/easy/two_sum.dart)                                    |
 | 9. Palindrome Number                            | [Link](https://leetcode.com/problems/palindrome-number/)                          | [Link](./lib/easy/palindrome_number.dart)                          |
 | 13. Roman to Integer                            | [Link](https://leetcode.com/problems/roman-to-integer/)                           | [Link](./lib/easy/roman_to_integer.dart)                           |
@@ -38,3 +38,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 111. Minimum Depth of Binary Tree               | [Link](https://leetcode.com/problems/minimum-depth-of-binary-tree/)               | [Link](./lib/easy/minimum_depth_of_binary_tree.dart)               |
 | 112. Path Sum                                   | [Link](https://leetcode.com/problems/path-sum/)                                   | [Link](./lib/easy/path_sum.dart)                                   |
 | 118. Pascal's Triangle                          | [Link](https://leetcode.com/problems/pascals-triangle/)                           | [Link](./lib/easy/pascals_triangle.dart)                           |
+| 3516. Find Closest Person                       | [Link](https://leetcode.com/problems/find-closest-person/)                        | [Link](./lib/easy/find_closest_person.dart)                        |

analysis_options.yaml

@@ -1,30 +1 @@
-# This file configures the static analysis results for your project (errors,
-# warnings, and lints).
-#
-# This enables the 'recommended' set of lints from `package:lints`.
-# This set helps identify many issues that may lead to problems when running
-# or consuming Dart code, and enforces writing Dart using a single, idiomatic
-# style and format.
-#
-# If you want a smaller set of lints you can change this to specify
-# 'package:lints/core.yaml'. These are just the most critical lints
-# (the recommended set includes the core lints).
-# The core lints are also what is used by pub.dev for scoring packages.
-
-include: package:lints/recommended.yaml
-
-# Uncomment the following section to specify additional rules.
-
-# linter:
-#   rules:
-#     - camel_case_types
-
-# analyzer:
-#   exclude:
-#     - path/to/excluded/files/**
-
-# For more information about the core and recommended set of lints, see
-# https://dart.dev/go/core-lints
-
-# For additional information about configuring this file, see
-# https://dart.dev/guides/language/analysis-options
+include: package:lints/core.yaml

lib/easy/find_closest_person.dart

@@ -0,0 +1,12 @@
+class Solution {
+  int findClosest(int x, int y, int z) {
+    final xDiff = (z - x).abs();
+    final yDiff = (z - y).abs();
+
+    if (xDiff == yDiff) {
+      return 0;
+    }
+
+    return xDiff < yDiff ? 1 : 2;
+  }
+}