diff options
| author | Lubos Kolouch <lubos@kolouch.net> | 2025-09-09 14:37:49 +0200 |
|---|---|---|
| committer | Lubos Kolouch <lubos@kolouch.net> | 2025-09-09 14:37:49 +0200 |
| commit | 8dcec24896df9c47fc2934654c1d772429e7ec19 (patch) | |
| tree | 3cd7ae54e79abc222489528c369db73727a25cd4 /challenge-337/deadmarshal/java/Ch1.java | |
| parent | 2ad4f7e564632a7401f2c3976412aaaa564b298f (diff) | |
| download | perlweeklychallenge-club-8dcec24896df9c47fc2934654c1d772429e7ec19.tar.gz perlweeklychallenge-club-8dcec24896df9c47fc2934654c1d772429e7ec19.tar.bz2 perlweeklychallenge-club-8dcec24896df9c47fc2934654c1d772429e7ec19.zip | |
Add solutions for Perl Weekly Challenge 334.
Task 1 (Range Sum): Computes the sum of integers between given indices
(inclusive) using array slicing in Perl and Python, with input
validation.
Task 2 (Nearest Valid Point): Finds the index of the valid point
(sharing x or y coordinate) with the smallest Manhattan distance,
returning -1 if none exist, using iteration and distance comparison.
Diffstat (limited to 'challenge-337/deadmarshal/java/Ch1.java')
0 files changed, 0 insertions, 0 deletions