coding prompt

[apoyusiken]

give me a project prompt i will code it (probably vibecode the ui if ui is necessary, python is my main lang i know client side js but no nodejs and typescript )

 

[whispous]

Hot damn dude, not only do you ask AI to make your software for you, but you can't even come up with your own PROMPTS?

 

The human race is falling at terminal velocity towards sludgebrain.

 

Become a farmer, last profession with a shred of respect. I'm going to go downstairs and watch youtube shorts for seven hours. Make me an app that gives me a painful electric shock when i do this.

[apoyusiken]

21 minutes ago, whispous said:

Hot damn dude, not only do you ask AI to make your software for you, but you can't even come up with your own PROMPTS?

 

The human race is falling at terminal velocity towards sludgebrain.

 

Become a farmer, last profession with a shred of respect. I'm going to go downstairs and watch youtube shorts for seven hours. Make me an app that gives me a painful electric shock when i do this.

you never heard of writing prompts? now i get to say google it

[mariushm]

write a single file compressor / decompressor) using lzss / lz77  without using built in python compression functions ( no deflate, gzip, zlib etc)

[apoyusiken]

On 3/4/2026 at 8:35 AM, mariushm said:

write a single file compressor / decompressor) using lzss / lz77  without using built in python compression functions ( no deflate, gzip, zlib etc)

thx very cool idea, been trying to utilize gemini but its too dumb. ive writtent his code can you tell if its accurate?

def find_longest_match(self, current_pos):
        matches = {}
        data=self.data
        # Ensure we don't look past the end of the data
        end_pos = min(current_pos + self.WINDOW_SIZE, self.file_size)
        for i in range(current_pos, end_pos):
            if data[i:i+2] in matches:
                matches[data[i:i+2]].append(i)
            else:
                matches[data[i:i+2]] = [i]
        for j in range(3,self.LOOKAHEAD_MAX):
            for match in matches:
                m=True #no match
                x=[]
                f=[]
                for i in matches[match]: # byte : 1 2 3
                    if i + j < self.file_size:
                        n=match + data[i+j:i+j+1]# Slice to keep as bytes
                        if n in x:
                            m=False
                            f.append(i)
                        x.append(n) 
            if m:
                matches.pop(match)
            else:
                matches[match]=f
        #return longest f element

edit : i realize i cant just delete if there is no match until we have a longer match but apart from that i dont get that we are supposed to search backwards, cant i jsut do this?