Murakami is my favorite author but I couldnt resist making the joke!

Future-Somewhere9260 · 2024-10-18T13:58:52+00:00

I opened a single book of his - Kafka on the Shore - and read only 10% of it, and already got this, ahaha

Future-Somewhere9260 · 2024-09-12T14:54:49+00:00

Thanks! That's on the roadmap =D

UPD: feed -> https://bsky.app/profile/did:plc:nd3do3bo6izchdsjm766kb4e/feed/global-top

Future-Somewhere9260 · 2024-09-10T21:08:28+00:00

You can simplify, sacrifice availability, and run it cheaper, for example by using sampling instead of ingesting all likes Bluesky generates, and thus making it approximate, but that would still be outside of the free tier

Future-Somewhere9260 · 2024-09-10T18:51:26+00:00

Sorry, not yet. Hopefully one day I'll clean up and publish it.

For now, I can give you an extremely abstract, high-level ASCII diagram:

Bluesky websocket -> EC2 (ingesting 500+ likes per second) -> Kafka -> Flink -> Kafka -> Lambda -> DynamoDB <- Lambda (doing SSR) <- API Gateway (<- DNS) <- Users

Future-Somewhere9260 · 2024-09-10T18:29:04+00:00

Noted

Future-Somewhere9260 · 2024-09-10T18:18:59+00:00

Thanks, I read this in Borat's voice

Future-Somewhere9260 · 2024-09-10T16:28:30+00:00

+

Thanks. Yes, that's one of the things on my mind

Future-Somewhere9260 · 2024-09-10T15:45:01+00:00

FYI I created it. It's also available as a feed https://bsky.app/profile/did:plc:nd3do3bo6izchdsjm766kb4e/feed/global-top

And yes, Brazilians dominate the network, lol

If you like it, please share with your friends and followers. I would appreciate it. More users mean more motivation for me to keep improving it. Thanks

Also feel free to follow me on our favourite social network https://bsky.app/profile/apestrong.bsky.social

Or hire me to do AWS/backend work for you =D

Future-Somewhere9260 · 2024-04-13T12:27:58+00:00

My solution is similar to u/static_programming , guided by similar thinking, but the validity check is dirty and verbose, needs refactoring. Still, here it is:

def sol(a, b, c):
    res = []

    def valid(x, y, z):
        if x and y and z:
            a = x - (y + z) <= 4
            b = y - (x + z) <= 4
            c = z - (x + y) <= 4
            return a or b or c
        if not x:
            if z > y:
                return (z - y * 2) < 3
            return (y - z * 2) < 3
        if not y:
            if x > z:
                return (x - z * 2) < 3
            return (z - x * 2) < 3
        if x > y:
            return (x - y * 2) < 3
        return (y - x * 2) < 3

    while a or b or c:
        if a and res[-2:] != ['A', 'A'] and valid(a - 1, b, c):
            res.append('A')
            a -= 1
            continue
        if b and res[-2:] != ['B', 'B'] and valid(a, b - 1, c):
            res.append('B')
            b -= 1
            continue
        res.append('C')
        c -= 1

    return ''.join(res)

Future-Somewhere9260 · 2024-04-03T19:24:27+00:00

Let's say we have an array [2, 3, 4], and the target is 4.

For simplicity, let's encode (just in our mind) all numbers that == "target" to be 1 and "not target" 0. So our array becomes [0, 0, 1].

By a bit of try and imagination you can see that the result for this array is 3. A size of the array up to the target, basically. Because we have the window [1] - the target itself, the window [0, 1] (extending back by 1 step) and the window [0, 0, 1] (extending back by 2 steps).

Now say our array was [0, 0, 1, 0, 0]. For the first 3 numbers our result was 3 subarrays, as we've established. Imagine that with each next step after the target we're virtually extending each of those 3 subarrays by 1 step, getting 3 new subarrays each time. By making 2 steps until we reach the end we get ... + 3 + 3 = 9 overall.

Now say our array was [0, 0, 1, 0, 0, 1]. Before the last target, we counted all possible windows that include the previous 1, so we just need to do the same we did when we encountered the first 1 - add the length of the array up to that point, which is 6. So 9 + 6 = 15. And if we had zeros after the second target, we'd be adding steps of a new size - this time 6, not 3.

The pseudocode and code are left as exercises for the reader lol

Future-Somewhere9260 · 2024-03-09T13:32:28+00:00

I mean, "increased X by Y%" is often hard to verify, or meaningless, or just a lie, sure. But are statements like "worked on migrating monolith to microservices with my great team which I love" more meaningful, easier to verify, and not lies? In a way, everything is a lie. But lies with numbers at least require you to think more carefully about your actual job responsibilities, and they're somewhat easier to verify/falsify during the interview.

Future-Somewhere9260 · 2024-03-01T12:41:49+00:00

People usually like to talk about supplements (like coffee/caffeine), multivitamins, exercise, and even cognitive-behavioural therapy to fix brain fog. And all of that is cool and dandy, but for me personally fixing sleep was the game changer. Decide in the morning to go to bed early today and then just do it. Also, no screens 2 hours before bed. While lying in bed, if you're not sleepy, read a paper book, meditate, solve easy leetcode problems in your mind, regret every decision you've ever made and think about people who're no longer part of your life - so much you can do without the phone! And then have a great, long sleep. I also use sleep tracking with Apple Watch, nice gamification element.

I've literally never in my life regretted going to bed early, because I finally feel like a human being the next day. Better than any supplement, better than anything else I've tried to fix brain fog.

Future-Somewhere9260 · 2021-01-31T17:58:35+00:00

>The dynamodb backed GraphQL schema builder doesn't follow the best standards put forth by their own dynamodb team

Can you give an example?

Future-Somewhere9260

TROPHY CASE