- D1: Both
- D2: Both
- D3: Both
- D1: Both.
- D2: Both
- D3: Both°
- D4: Both
°joel
- D1: Both
- D2: Both
- D3: Both°
°joel
- D1: Both
- D2: Both
- D3: Both°
- D4: Both
°joel
- D1: Both
- D2: Both
- D3: Both
- D4: Both°1
- D5: Both°2
- D6: Both°3
- D7: Both
- D8: Both°4
- D9: Both°5
- D10: Both
- D11: Both°6
- D12: Both°7
- D13: Both°8
- D14: Both°9
- D15: Both°10
- D16: Both°11
- D17: Both
- D18: Both°12
- D19: Both°19
- D20: Both°14
- D21: Both°13
- D22: Both°16
- D23: Both°18
- D24: Both°17
- D25: Both°15
°1: code for the first part was really ugly, but worked, could not manage to solve the second. got help from Ilia.
°2: first done. for the second - joel's code did not work (it is not complete, gave up). ilia's worked.
°3: first done, complexity was too high for the second. got implicit hints from ilia, still had to see his solution to understand it fully.
°4: first done, understood how the 2nd should be done, help from ilia.
°5: first done, second was somewhat more complex. checked joel's solution - much, much smarted.
°6: first day - help for both from joel's video. at least had an idea and made an attemp!
°7: no idea how to do it. at all. - help for both.
°8: own code works with example input. need help for real input.
°9: got it working for the first part, the second part wanted really big computation and my solution didn't work. found a really good one on reddit.
°10%11: joel
°12: jonathan paulson, because joel's code wasn't completed
°13: had the right idea, but got it wrong somewhere. I was trying to solve it by more complicated way than needed
°14: this was a hard one
°15: actually the task was easier than it looked
°16: first: understood why I wasn't able to get the answer. the second part was too hard
°17: this one was really hard to understand. the couple videos I've watched were really hard to follow
°18: got the first part on piece of paper. got the code for the second, haven't checked it how it works
°19: have to check and try to understand this one, it was hard
- D1: Both
- D2: Both
- D3: Both
- D4: Both
- D5: Both
- D6: Both°1
- D7: Both°2
- D8: Both°3
- D9: P1. P2°4
- D10: Both
- D11: P1. P2°5
- D12: Both°7
- D13: Both°6
- D14: Both°9
- D15:
- D16:
- D17:
- D18:
- D19:
- D20: Both°8
- D21:
- D22:
- D23:
- D24:
- D25:
°1 - I got the examples with recursion, after that it did not work. J.Paulson with the smart solution. Joel with deque idea.
°2 - got the example. after that could not understand why I was getting my error. J.Paulson again with the nice solution. Joel with more verbose solution.
°3 - could not think how to go deeper in either direction.
°4 - got only the first part. J.Paulson helped again.
°5 - got the first. Couldn't think out the modulo logic (beforehand) to make it faster.
°6 - could not think of anything. I would not have been able to solve P2. joel used match-case from Python 3.10
°7 - after seeing the solution, some of my ideas we in the right direction, but could not combine them
°8 - partially understood the solution by J.Paulson
°9 - interesting task
- D1: Both°1
- D2: Both°2
- D3:
- D4: Both
- D5:
- D6: Both°
- D7: Part1
- D8:
- D9:
- D10:
- D11:
- D12:
- D13:
- D14:
- D15:
- D16:
- D17:
- D18:
- D19:
- D20:
- D21:
- D22:
- D23:
- D24:
- D25:
°1 J. Paulson's solutions was cool. Managed to get the 1st + 2nd parts with regex.
°2 J. Paulson's solutions were cool. In Part 2, I managed to replace the switch-case with Math.max() operation.
°3 somehow for the 2nd part I was using the example numbers the whole time and not the input. smh :/