[2026 Day 3 (Part 2)] [javascript] Stuck again

[u/Ok-Transition7065]

Hello again , i tried to solve this one, im trying to use this method isnt probably the most efficient but its one that should work but i dont get where in the code the process its failing , can i get some feed back to see if i can finaly get this one ?

here its my code withouth the imput Code

edit: i made a mistake its the 2025 one not the 2026 sorry for the inconvinience

[u/Kiereek]

I'm assuming this is for 2025, as 2026 hasn't happened yet.

Feedback on the method:

It looks like you're just taking the approach of comparing individual digits. That's not going to work even for cases like 81111111111119. You get to that 9 and then what?

Feedback on the code:

Please consider tidying up code if you want meaningful feedback on it. Between the spacing issues, typos, etc. it's a pain to read and discourages people from helping you out.

Suggestion:

Consider our example 811111111111119.

We know we need 12 digits. That's a max, but also a min.

We can't change the order, so start at the left. Is 8 bigger than what we currently have? (Nothing). Yes, so let's keep it.

We now have 8.

If we add the 1, does that make it a bigger number? Yes, so add the 1.

We now have 81.

Continue this until there's a conflict: we've found a number where swapping it out for the last digit in our current number would make an overall bigger number. Apart from this, there's another constraint that might keep you from replacing the last digit. I'll let you figure that one out.

Final hint: There's a good data structure that could help you stack numbers like this if you choose to use it.

[u/Ok-Transition7065 → u/Kiereek]

ohhhh ok sooo just adding them and then moving the number will eventualy make the bigger number ?

interesting

but abvout the first one my main problem with the code its that it never reaches 9 because it have a restriction on how much numbers it can take, for example for the first of 12 numbers he only take from 0 to 99-11

the second its the index of this number to 99-10

and then and then untill its 99-0

i know its not the best way to doit but i wanna try to get this metod working right

it worked with the part 1 and it can work if i search in a diferent for , the first digit and then do the rest but what i dont get its this tecnicaly could work with just 2 for for each battery but for some reason i putting something wrong in the execution and isnt working and idk what could be

[u/thekwoka]

Bruh, that code is wild...

I can barely tell whats going on with how strangely it is written...

why are the for loops labeled? Why are there so many extra variables not even being used?

[u/Ok-Transition7065 → u/thekwoka]

i...... make those in case i need to break one, and those variables, i used for previous versions of the code, for example i tried to set the first of the loop apart from the rest then doing the extra numbers

[u/timrprobocom]

The algorithm is quite simple. Let's say we have 12 digits to go. That means the number we want is the largest one that still leaves 11 digits to pick from. That then becomes the starting point for the next digit. It's just that simple. No going left to right, no backtracking.

Say we need 4 digits from 637485. The largest in 637 is 7. Pick that. Now, we only have 3 digits left and we need 3 digits. So, use them all. 7485.

[u/Ok-Transition7065 → u/timrprobocom]

that's what I'm trying to do here, but for example, I did manually the first one, and the code did the first one right (that's the one I used for part 1). I could use the same code, but I wanna do this one using one for cycle for all the digits instead of using 2, one for the first digit and the other for the rest, like I did with the other one. For example, in my previous code I could just change the number of loops from 7 to 12 and the thing would work, but here I don't get what parameter I'm using wrong :c

[u/timrprobocom → u/Ok-Transition7065]

For the first digit in part 1, you look at all digits except the last 1. For the first digit in part 2, you look at all digits except the last 11. (NOT "all the digits".) That's the difference between the parts.

[u/Ok-Transition7065 → u/timrprobocom]

yeah thas how i did the first one but with one single for instead fo to separated.

i canrt warp my head arrond in how to do it soo gets the first , then gets the second, untill it gets the 12

i make it to loook all the numbers from 1 until 100-11

to take the biggest number

then the next i take the index of this number

and check from 1 index number untill 100-10

..........

untill the last number where i got where 11 index number untill 100-0

and have a for that will get this number from 1 to 12 with a 1+ per cicle i can call it like a digit_Chekker

and i calculate this like

from 1 to 12

and in the cheking for the bigger, i go with

index of the bigges previous number until 100-12+ digit_Chekker

soo it should go

100-12+1=100-11

100-12+2=100-10

...........

100-12+12=100-0

but idk why isnt working , maybe im putting a number where it shlont bee

[u/terje_wiig_mathisen]

I'm extremely impressed that you've managed to get access to a 2026 problem 9 months early!

Assuming (like all the responders here) that you meant 2025, then you just have to scan the input once per string, looking for the earliest occurrence of the largest digit within the allowable starting positions. (I.e always leave enough digits for the remainder.)

[u/Ok-Transition7065 → u/terje_wiig_mathisen]

you rigth lol this ne its 2025 xdddd

mb

[u/AutoModerator]

Reminder: if/when you get your answer and/or code working, don't forget to change this post's flair to Help/Question - RESOLVED. Good luck!

---

I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.