advent-of-code-kotlin-2021 VS deno_aoc

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 ).

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.

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.

Kotlin solution. I converted them to numbers ( like round brackets would be 1 and -1 ), and then just used the numbers to work with.

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.

Here’s pretty much the same thing translated to TypeScript: https://github.com/N8Brooks/deno_aoc/blob/main/year_2021/day_22.ts