| Age | Commit message (Collapse) | Author |
|---|
|
Changelog:
- pattern match on list with one element instead of checking is_end variable
- pattern match on c_gt_? variables instead of using if statements to ensure all possiblities are covered
- reuse swap_if_higher when we have (Some _, None) instead of inserting to second slot, as this was screwing with the promotion logic
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
just use Logs directly for now
|
|
|
|
solution: 8254
|
|
|
|
|
|
|
|
solution: 1320
|
|
|
|
fixes: pp_matrix
|
|
|
|
test fails as of now as matrix is rotated
|
|
breaks: pp_matrix
|
|
|
|
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
|
|
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
|
|
|
|
still needs to be injected somehow
|
|
|
|
|
|
still need to figure out how I can inject this into the application layer however
|
|
|
|
|
|
transformed one at a time
this reduces allocation overhead
|
|
of AND
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
