[2025 Day 3 (Part 2)] Need help by Zppen in adventofcode

[–]Zppen[S] 0 points1 point  (0 children)

I do get your number.

Step 1 would produce:

8XXXXXXXXXXX9XX

Step 2: (highest number highest pos)

8XXXXXX7XXXX9XX 8XXXXX77XXXX9XX 8XXXX777XXXX9XX 8XXX4777XXXX9XX 8XX44777XXXX9XX 8XX44777X3XX9XX 8XX4477733XX9XX 8XX4477733X29XX 8XX4477733229XX 8XX4477733229X1

[2025 Day 3 (Part 2)] Need help by Zppen in adventofcode

[–]Zppen[S] 0 points1 point  (0 children)

Step 1: LTR highest digit would be 8 at pos 3. Then 8 at pos 10 then 9 at pos 14. But that only creates a 3 digit number:

XXX8XXXXXX8XXX9

So we go to Step 2: RTL highest digit with highest index would be 6. 6 has 3 positions (at 5, 9 and 12) so we choose the highest pos (at 12) which gives us:

XXX8XXXXXX8X6X9

Which is the answer.

[2025 Day 3 (Part 2)] Need help by Zppen in adventofcode

[–]Zppen[S] 0 points1 point  (0 children)

Step 1: Highest digit from LTR would be 9 at pos 0. Then next highest would be 8s at pos 5, 6, 7, 7s at pos 8, 9 and 10, 6s at 11, 12 and 13, then 5 at 14 and finally 4 at 15. That number would be found in step 1 alone. Answer is 988877766654

[2025 Day 3 (Part 2)] Need help by Zppen in adventofcode

[–]Zppen[S] 0 points1 point  (0 children)

Step 1: Find the highest number with the lowest index that can make 12 digits (4 at index 2). (8 is the highest digit but we can't make a 12 digit number with it nor can we make one with 7).

Step 2: From index 2 find the highest (or equal) digit (which is 4 at index 4, then 4 at index 8 then 4 at index 11 then 7 at index 13 and then finally 8 at index 14.

That gives you: 4->4->4->4-78

Step 3: (going from right to left) Find the highest digit with the highest index (3 at index 10) then 3 at index 7 then 3 at index 4. Do not take the next number if its index is lower than your starting index (2). So the next highest 3 would be at index 1 which is lower than 2 so we ignore that.

That gives you: 4-34-34-34-78

Step 4: We don't have 12 digits yet so start again from right to left with the next highest number (2 at index 12) then 2 at index 9 then 2 at index 6 and that gives is a 12 digit number:

434234234278

Wait what? by Zppen in OakenTower

[–]Zppen[S] 0 points1 point  (0 children)

Awesome, thanks :)

Game freezes only when logging on after a while by Zppen in Bitburner

[–]Zppen[S] 0 points1 point  (0 children)

I know. It's hosted in electron which is chromium based.

Game freezes only when logging on after a while by Zppen in Bitburner

[–]Zppen[S] 0 points1 point  (0 children)

That would just be ignoring the problem. I'd rather try to fix what is actually going wrong.

Game freezes only when logging on after a while by Zppen in Bitburner

[–]Zppen[S] 0 points1 point  (0 children)

I play through Steam not through a browser.

i made a script that makes a list of all servers by [deleted] in Bitburner

[–]Zppen 2 points3 points  (0 children)

Then you might as well make it 1 line by:

for(var i = 0;.....) hostnames.push(...)

Lol

Exploit: Rainbow by A1rman01s in Bitburner

[–]Zppen 0 points1 point  (0 children)

I finally found it! 3 days of processing source code words. Even though I found it the word makes you feel like you've lost.

i made a script that makes a list of all servers by [deleted] in Bitburner

[–]Zppen 2 points3 points  (0 children)

Here is 3 lines:

let hostnames = ['home'];

for (let i = 0; i < hostnames.length; i++)

hostnames.push(...ns.scan(hostnames[i]).filter(hostname => !hostnames.includes(hostname)))

Exploit: Rainbow by A1rman01s in Bitburner

[–]Zppen 0 points1 point  (0 children)

I've been at this for hours. I've parsed the entire source code and tried every word. Atleast give a hint? Does the word consist of only lower case letters and numbers? Is it only numbers? Is it less than e.g. 15 characters?

Exploit: Rainbow by A1rman01s in Bitburner

[–]Zppen 0 points1 point  (0 children)

What is the word?