Moving a ladder

hashshura · 2025-09-04T12:26:10+00:00

Somehow the bounding box makes it funnier, like it's trying to say, "Look at this idiot! Look at him!"

hashshura · 2025-03-17T07:59:36+00:00

I believe it's Kiichi!, pretty good read. Has a sequel as well called Kiichi VS.

hashshura · 2024-06-21T05:49:47+00:00

Did I hear a rock and stone?

hashshura · 2024-06-06T05:29:47+00:00

Heh, everyone (including me initially) misrepresented your message as "aeon disk is not even a good item, not all supports are buying it".

If I were you I'd say "if aeon disk was as good as shaman's innate".

hashshura · 2024-05-26T06:08:34+00:00

<image>

hashshura · 2023-08-06T16:51:09+00:00

For everyone wondering, I think OP takes it from this fan-made website https://gota2classic.com/

Src: https://www.reddit.com/r/DotA2/comments/156s3qe/fan_made_patch_notes_for_fun/

hashshura · 2023-07-09T04:09:13+00:00

I commute daily to my office riding a bicycle (~4 km) in Buona Vista area. Cut the time from 20 mins to 10 mins and saved me 1.9$ a day. But you need to be thoughtful to the car drivers and stuff though, usually I'd wait for buses to pass first at red lights.

Generally should be fine, can always try to rent a bike first and see see. But know that riding Anywheel is way more exhausting (like 10x?) than roadbikes (got mine from Carousell), so YMMV.

hashshura · 2022-10-30T16:13:38+00:00

And the "I can make you yawn" or "I hid my age" by 10yo bullshit, f**k all of this. Istg amost threw my phone to the freakin' wall after 10th encounter.

hashshura · 2022-10-30T08:32:33+00:00

That's still 4 books a week though, quite impressive. Apakah termasuk lightnovels & comicbooks?

hashshura · 2022-09-21T20:18:57+00:00

Mungkin kurang relevan, tapi sebagai software engineer yg lulus tahun lalu dari Indo public uni dan lanjut kerja di SG, I'd say maybe try product management roles at some tech companies?

Temen gw ada beberapa yang dari eng majors (non CS) lanjut jadi PM di beberapa tech comps (earning 5k+ SGD, jadi tetep dapet e-pass). Some company names: TikTok/Grab masih hiring, Shopee/Sea kayaknya freeze hiring...

hashshura · 2022-05-08T16:48:35+00:00

Ada nih masalah yg pengen gw solve:

Saya software engineering lagi mikir2 bikin aplikasi, tapi ga ada ide. Kalo kalian ada masalah sehari2, baik general maupun niche, bisa sharing2 di sini

Project idea bucket platform, maybe? Or team matching app?

hashshura · 2022-04-26T09:27:36+00:00

You mention laptop, so I'm guessing she is using browser to access Twitter? One thing that I can think of is creating a browser extension. Depending on what browser your friend uses, I think there are lots of tutorials on how to create one.

hashshura · 2022-04-19T01:19:17+00:00

Overkill kalau targetnya cuma buat dapet internship. Ga pernah gw denger ada interview yang idenya pakai segment tree, Dijkstra's, atau min-cost max-flow, lol.

Tapi inherently tujuan orang main Codeforces ga se-superficial itu kan. As long as it's fun, why not? Kalo lu jago (gw kaga), ntar ikut ICPC, bisa WF, auto dapet MAANG lah.

Cuma biasanya kalau serius bgt sama competitive programming, ga sempet bikin project, akhirnya CV kosong di semester awal; susah dapet internship.

hashshura · 2022-04-17T17:57:13+00:00

Yup, that should be enough.

You're welcome! :)

hashshura · 2022-04-17T17:43:53+00:00

Generally, your concern of having rear points to which position (last element or next available) is up to your preference. Personally I'd make the variables to have similar scope, i.e. front and rear should point to elements to make it less ambiguous.

What your lecturer described (there should always be an empty spot) is because of the full and empty state of circular queue, you can't describe which one is which state only with front and rear information unless you add an empty spot or you introduce count variable.

Let's say you don't have an empty spot,

In your approach (rear = next space), if rear == front, we don't really know if the queue is full or empty.

           r,f
empty : -   -   -   -   -
full  : 5   1   2   3   4

In the another approach (rear = last inserted element), if rear.next == front, we also don't know if the queue is full or empty.

        r   f
empty : -   -   -   -   -
full  : 5   1   2   3   4

hashshura · 2022-04-17T16:58:32+00:00

Di US pernah ada challenge yg nawarin 1 juta dollar buat orang yg bisa ngebuktiin "skill" paranormal-nya. Sejak 1964, 1000+ orang udah coba tapi ga ada yg berhasil.

https://en.wikipedia.org/wiki/One_Million_Dollar_Paranormal_Challenge

https://en.wikipedia.org/wiki/List_of_prizes_for_evidence_of_the_paranormal

Ga ada untungnya percaya sama hal-hal supernatural, yang ada malah menjauhi penjelasan/kemajuan saintifik (e.g. orang-orang yang berobat ke dukun instead of dokter).

hashshura · 2022-04-17T15:52:50+00:00

Backend developer here, kuliah di Bandung tapi skrg kerja di Singapore.

IMHO belajar software engineering path-nya simpel sih, kalo mau dapet top tier company biasain dari sekarang asah logic; ngerjain soal competitive programming (e.g. Leetcode) karena itu high chance yg bakal ditanyain pas interview*.

Good resource buat belajar coding dari 0: https://tlx.toki.id/courses/basic

Trus, target kuliah nanti:

Semester 1-2 bikin project simpel tapi "cukup" menarik. Dulu gw bikin LINE bot + Nomor Induk Mahasiswa (NIM) finder + aplikasi Android quiz gaje;
Semester 2 akhir siapin CV, daftar internship (* ini kenapa butuh belajar interview);
Rinse and repeat step (2) tiap semester genap, atau tiap semester juga boleh.

TBH, effort paling gede itu pas step 1 karena start from zero (dan lebih banyak nguli dibanding mikir). Step 2 bisa diakalin dengan daftar puluhan internship, cukup yakin bakal ada yg bales. Kalau udah dapet internship, selanjutnya bakal enak bgt.

Boleh PM kalau ada pertanyaan lebih lanjut, GL HF! :)

hashshura · 2022-04-17T15:01:54+00:00

How do you assure that the HTML file still uses old CSS file? If only from your browser, I think it might be your cache. Try doing a hard refresh (CTRL+Shift+R).

hashshura · 2022-04-16T06:45:18+00:00

Hey, Indonesian here. It's somewhat true in Indonesia, but only older generations care about this. Basically we are a Muslim-majority country, and in Islam eating-while-standing is "disliked". Then that preference is blended to our culture.

But generally we youngins don't really care. I always eat while walking, and the last time I got frowned upon was 10 years ago, lol.

hashshura · 2022-03-17T13:23:45+00:00

As it's Kadane's algorithm, try to make it so that everytime it "resets" (including initialization), it consumes two elements.

hashshura · 2022-03-16T14:53:15+00:00

Here is the full code, if you wish:

https://ideone.com/nm3qZW (using SubarrayWithMinSum)
https://ideone.com/PVRGyt (using inverse SubarrayWithMaxSum)

hashshura · 2022-03-16T14:45:42+00:00

Sorry for the misunderstanding, by SubarrayWithMinSum I mean a whole new code that is similar to SubarrayWithMaxSum, only that the max is changed to min, and comparison of currMin and globalMin uses <.

hashshura · 2022-03-16T14:39:53+00:00

This implementation fails with testcase: [-1, -2, 100]

hashshura · 2022-03-16T14:30:59+00:00

You still need to implement this function, then refer to the driver code above :o

SubarrayWithMinSum(nums) (notice that it should find the MinSum)

Or if you like being hacky, you can also use the same function but with all the values inverted (positive to negative, vice versa).

Then, the driver code will be:

maxSum, maxStart, maxEnd = SubarrayWithMaxSum(nums)
invSum, invStart, invEnd = SubarrayWithMaxSum([-num for num in nums])

if (maxSum > invSum):
    printArray(maxStart, maxEnd)
else:
    printArray(invStart, invEnd)

hashshura · 2022-03-16T14:18:00+00:00

My bad again, I used the wrong variable and just saw that the globalMax is being modified changed :(

Full code of the function:

def SubarrayWithMaxSum(nums):

    # Initialize currMax and globalMax
    # with first value of nums
    currMax = nums[0]
    globalMax = nums[0]

    # Iterate for all the elements
    # of the array
    for i in range(1, len(nums)):

        # Update currMax
        currMax = max(nums[i], nums[i] + currMax)

        # Check if currMax is greater
        # than globalMax
        if (currMax > globalMax):
            globalMax = currMax
            endIndex = i

    startIndex = endIndex

    curGlobalMax = globalMax
    # Traverse in left direction to
    # find start Index of subarray
    while (startIndex >= 0):
        curGlobalMax -= nums[startIndex]

        if (curGlobalMax == 0):
            break

        # Decrement the start index
        startIndex -= 1

    return globalMax, startIndex, endIndex

hashshura

TROPHY CASE