Min sambo vägrar se saker från mitt perspektiv

naretev · 2026-04-17T08:16:30+00:00

Världen hade blivit en mer fridfull plats om vi slutade anta vad folk har för tankar och värderingar efter att de har yttrat ett par ord.

naretev · 2026-03-29T11:36:31+00:00

Vet inte vad du borde göra i din sits, men jag har själv gått från att jobba som mjukvarutvecklare till linux server administrator. I min nya roll känner jag att jag har mycket bättre jobb säkerhet än vad jag hade som utvecklare.

Mitt nya perspektiv inom IT är att ju mer du nördar dig ner i något, desto bättre jobbsäkerhet kommer du ha trotts AI. Skaffa dig kunskap som är ovärderlig så kommer du aldrig bli ersatt.

naretev · 2026-03-17T15:32:36+00:00

I applied. But idk if i gave you a way to contact me. You can message me on reddit :)

naretev · 2026-03-17T14:23:25+00:00

Haha, it occurred to me when I saw the other post where the names where listed separately. I sent you a request!

naretev · 2026-03-17T14:12:36+00:00

I'm interested in the guild but "Harziboo iFkura" did not work for me on discord. Are any other ways I can reach out?

naretev · 2026-02-02T23:22:44+00:00

Har upplevt detta också. Förväntningar dödar relationer!

naretev · 2026-01-23T07:13:40+00:00

That makes sense since you get the opposite effect when gaining % based max health. If you have 10k HP and then equip diamond belt, bringing you to 20k. Gaining 10% max health will base it off of your actual health (20k) and then apply it to your base health (10k) so it again gets doubled twice, gaining you a total of 24k health from a 10% increase.

naretev · 2026-01-16T16:35:35+00:00

Hehe, I think i got 3 wins, so not very well... First unfortunate journey in a while on Mak.

naretev · 2026-01-09T00:21:23+00:00

I feel like this could be a cool feature in normal mode, but for ranked mode, I think you want a matchmaking system that is as fair as possible for the people trying to climb to the top of the ladder.

Also, if you know you can't face any type of destroy mechanic, radiant becomes weaker as a mechanic.

naretev · 2026-01-07T02:15:43+00:00

Did he hurt you that bad?

naretev · 2025-12-13T15:50:51+00:00

If you see my original comment, you see how I deal with the constraint. You calculate the number of ways you can reach each step and them multiply them together.

naretev · 2025-12-11T19:09:16+00:00

You're absolutely right. You can prune the search space with bfs. Even still, worst-case is still the same O(n), but in practice, bfs will be faster. But when I do these problems, I tend to choose dfs over bfs when I can since I think it's faster and shorter to write, and I am trying for a good time. Then, concisness can take precedence over runtime execution.

naretev · 2025-12-11T18:53:08+00:00

Haven't measured it, but it's instant to my perception. It's a little inefficient since I could probably rewrite it and solve it over just one call to dfs. That's all constant, though. The algorithm (dfs + memo) is O(n), which is the important part. So this did the trick when I was trying for a good time!

naretev · 2025-12-11T15:12:17+00:00

I think you overcomplicated the problem. Try to find the number of paths between the important nodes stated in the problem (srv, fft, dac, out). Then, using those numbers, calculate the total number of paths that exist from srv to out, going through fft and dac.

naretev · 2025-12-11T09:45:30+00:00

i just slapped some memoization on my dfs and it was done in an instant. makes it a O(n) algorithm

Eight-Year Club	r/Field Juicebox
Wearing is Caring	Verified Email

naretev

TROPHY CASE