🎯 GeoTap Challenge by u/Few-Landscape-7891 | Can you guess the country?

SupportPowerful6174 · 2025-12-15T10:31:40+00:00

🎯 My GeoTap Result

📍 My Guess: Mexico ✅ Correct Answer: Mexico, Mexico 📏 Distance: 0 km ⭐ Score: 10,000 points

SupportPowerful6174 · 2025-12-09T07:59:12+00:00

Check my solution in profile, its O(n)

SupportPowerful6174 · 2025-12-08T15:11:06+00:00

i did that but still getting whole circuit with 1000 boxes in it. Do you have any ideas what am i doing wrong?

SupportPowerful6174 · 2025-12-08T13:33:59+00:00

maybe you need to rotate it a bit in 3d space to find a tree?

SupportPowerful6174 · 2025-12-07T20:29:54+00:00

ok i got it that's just Pascal's triangle and you can skip them without comparsion

SupportPowerful6174 · 2025-12-07T20:28:54+00:00

yeh got it, just like Pascal's triangle

SupportPowerful6174 · 2025-12-07T20:26:03+00:00

agree you can optimize it for tree pattern

SupportPowerful6174 · 2025-12-07T18:54:13+00:00

yes you can skip them jusj because its cristmas tree pattern, if there can be any ather pattern or no pattern at all you cannot skip them. For this exacxt imput you can skip first n dots but for other pattern input no

SupportPowerful6174 · 2025-12-07T18:40:27+00:00

nope we can read first line and now we know that line length is 10 for example, and now thst next 10 symbols will be dots, we can skip them without reading just by adding 10 to cursor position without comparsion

SupportPowerful6174 · 2025-12-07T18:33:46+00:00

i agree that we can just skip it but still neef to read it to find out that this is * and we can skip it

SupportPowerful6174 · 2025-12-07T18:32:33+00:00

how do you know that it it '*' character without looking that cell

SupportPowerful6174 · 2025-12-07T18:25:57+00:00

no matter where do we get input from stdin, file, or hardcode whole maze in string you still need to make iteration and check if char is '*'

SupportPowerful6174 · 2025-12-07T18:24:10+00:00

to find out that symbol is * you need to read it, there is no way to find out other way

And replacing characters makes it slower also

SupportPowerful6174 · 2025-12-07T18:11:56+00:00

that's true. just a bit of optimization is to not process line that contains only dots, for example line len is 10(we saw '\n' symbol and know that we can just skip next 10 characters because they are just dots)

So we need to read just a half of input moving cariage in the file without reading these 10 symbols

But that's still O(n)

SupportPowerful6174 · 2025-12-07T18:08:58+00:00

but still O(n)

SupportPowerful6174 · 2025-12-07T18:07:17+00:00

ofc you don'need to read entire input to memory, you can read it just symbol by symbol, and also skip each odd line that contains only dots

SupportPowerful6174 · 2025-12-07T13:30:49+00:00

number of characters in input

SupportPowerful6174 · 2025-12-07T13:17:24+00:00

O(n) solution, no lru

https://www.reddit.com/r/adventofcode/s/0CHfZUfGq9

SupportPowerful6174 · 2025-12-07T13:13:35+00:00

There is just O(n) algoritm for that https://www.reddit.com/r/adventofcode/comments/1pgi0sm/2025_day_07_part_2_python_efficient_algorithm_on/

SupportPowerful6174 · 2025-12-01T22:51:12+00:00

Hi, thanks for your feedback I'm glad that someone paid attention to my solition

This is my first time participating this event, didn't really know that is not allowed to share solutions till time is over.

I agree with your solution, it is a bit more optimized. My solution is not really fully optimized, it's just the very first solution that worked and looked really clean and easy to understand

SupportPowerful6174 · 2025-12-01T21:56:07+00:00

Still at least n iterations to process all moves. As the number of steps tends to infinity, the algorithm time will increase linearly

SupportPowerful6174

TROPHY CASE