diff options
| author | DJ O'Leary <dijitol@proton.me> | 2025-12-07 02:26:13 +0100 |
|---|---|---|
| committer | DJ O'Leary <dijitol@proton.me> | 2025-12-07 02:26:13 +0100 |
| commit | 26799e3010ce58a268ae9d989f6e3a71b303c509 (patch) | |
| tree | 922df2f05272d87ddd858b0bf675cbd769ab99f5 /2024/ocaml/test/day_01_part_01.ml | |
| parent | 9ed30f54f5d73fcdc9a56613baed28c53659aba5 (diff) | |
feat(2025d3p1): started on alternative solution
Alternative solution is to scan each line once to find the index of the largest left-most and non-final digit.
Then getting a substring of the line [idx, len) and finding the largest digit in that substring.
These digits concatenated together should be the biggest 2 digit number that can be made from the line
Diffstat (limited to '2024/ocaml/test/day_01_part_01.ml')
0 files changed, 0 insertions, 0 deletions