| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2025-12-08 | refactor(2025,ocaml): use result type for answers to allow for returning errors | DJ O'Leary | |
| 2025-12-07 | feat(2025d3p1): started on alternative solution | DJ O'Leary | |
| 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 | |||
| 2025-12-06 | feat(2025d3p1): partial solution, getting the wrong answer | DJ O'Leary | |
| Manually did entire real input and codified into tests but even sum of manual answer is wrong. Code fails for some lines of real input and these failing lines have been reduced into regression tests. work-in-progress: true | |||
| 2025-12-04 | docs(2025d03p01): add implementation plan | DJ O'Leary | |
| 2025-12-04 | feat(2025d3p1): create skeleton | DJ O'Leary | |
 |
index : codex_shredder.git | |
| Unnamed repository; edit this file 'description' to name the repository. | D.J. O'Leary |
| summaryrefslogtreecommitdiff |