Below is a snapshot + comments of every day I have attempted. Note that I am NOT going for leaderboards, therefore I am behind. I also blame NS reservist for causing me to miss a whole week :(
- Day 1
- 1-1: Simple warmup
- 1-2: Naive solution. O(n^2)
- Day 2
- 2-1: Actually took awhile to solve...
- 2-2: Not done yet.
- Day 3
- 3-1: Scan through, use regex.
- 3-2: Again, usage of regex. Enable or disable whenever needed
- Day 4
- 4-1: Took awhile to figure out verification method.
- 4-2: Easier then part one. Both have no "greedy choice" it seems...
- Day 5
- 5-1: Relatively hard. Got it in the end though
- 5-2: Not done yet.
- Day 6
- 6-1: Pretty fun! Managed to get it in the end.
- 6-2: Not done yet. This actually seems pretty hard.
- Day 7
- 7-1: Really easy. Just "brute force" and check all possible permutations. (Terminate early whenever needed)
- 7-2: Same as part two, just an additional concat operation to consider. Runtime is slow though.
- Day 8 (Will need a hint for this, not sure how to approach)
- 8-1: Not done yet.
- 8-2: Not done yet.
- Day 9
- 9-1: This oddly took awhile, original solution did not work... So I had to do it this way...
- 9-2: Not done yet.
- Day 10
- 10-1: Took awhile to code it out. Easy in theory, harder to implement
- 10-2: Not done yet. Should be easy but somehow struggling...
- Day 11
- 11-1: Simple Naive Solution. Runtime: 1.3s
- 11-2: Needed a hint. Idea is simple, use dictionary instead of list! Runtime: 0.09s (Memoization could work to, avoiding repeated computation...)
- Day 12
- 12-1: Theory was fine, but did not know how to implement. Needed hint on how to do DFS and keep track of cc. (defaultdict/dictionary works wonders)
- 12-2: Not done yet.
- Day 13
- 13-1: Theory wise, easy. Implementation was buggy, took 1 hour to debug... (2D list not working?). O(n^2) solution, technically O(1) since n <= 100?
- 13-2: Not done yet.
- Day 14
- Day 15
- Day 16
- Day 17
- Day 18
- Day 19
- Day 20
- Day 21
- Day 22
- Day 23
- Day 24
- Day 25