advent-of-code-kotlin-2021

Advent of Code 2021 Challenge (by PhenixFine)

Advent-of-code-kotlin-2021 Alternatives

Similar projects and alternatives to advent-of-code-kotlin-2021

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better advent-of-code-kotlin-2021 alternative or higher similarity.

advent-of-code-kotlin-2021 reviews and mentions

Posts with mentions or reviews of advent-of-code-kotlin-2021. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-12-17.
  • -🎄- 2021 Day 18 Solutions -🎄-
    144 projects | /r/adventofcode | 17 Dec 2021
    Kotlin - I went with solving it in place ( sort of, I had to replace [ ] with ( ) because of the way I stored the numbers ). My first day attempt of it I tried to do it with binary tree, but I'm just not familiar enough with the subject to do it that way and I failed miserably ( I'm studying the subject now, as I think it will be helpful with future code challenges ). So my next day attempt I figured I'd try solving it in place and everything worked out really well ( solved it yesterday, but wanted today to review my code before submitting it ).
  • -🎄- 2021 Day 15 Solutions -🎄-
    127 projects | /r/adventofcode | 14 Dec 2021
    Kotlin - it's probably a bit of a memory hog compared to other solutions, but I didn't want to have to deal with index numbers anymore than I had to.
  • -🎄- 2021 Day 12 Solutions -🎄-
    145 projects | /r/adventofcode | 11 Dec 2021
    Kotlin - I didn't finish it until three in the morning and just now got around to cleaning up the code. I really struggled with part 2 ( path finding was one of my least favorite subject in computer science ). Though it probably wouldn't have taken so long if I had just scrapped part 2 when it became a mess, instead of wasting time trying to fix it.
  • -🎄- 2021 Day 10 Solutions -🎄-
    171 projects | /r/adventofcode | 9 Dec 2021
    Kotlin solution. I converted them to numbers ( like round brackets would be 1 and -1 ), and then just used the numbers to work with.
  • [2021 Day 7] I'm just happy my gigantic list comprehension worked
    3 projects | /r/adventofcode | 7 Dec 2021
    I think my solution is a binary search. I originally went with a brute force implementation, but when I started the second part it occurred to me that I could do a binary search that would reduce the number of indexes I had to check the cost of moving to.
  • A note from our sponsor - SaaSHub
    www.saashub.com | 18 Apr 2024
    SaaSHub helps you find the best software and product alternatives Learn more →

Stats

Basic advent-of-code-kotlin-2021 repo stats
5
1
0.0
over 2 years ago
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com