My new project built with #llm #codex #gpt-5.5 xhigh: #bot for #telegram - to search and listen to #youtube

https://gitlab.com/vitaly-zdanevich/bot_telegram_youtube

#mem limited by the technology of my time
#llm
#depleated

What a time - multiple #llm doing multiple projects, in parallel...

--- /home/vitaly/.gemini/tmp/prime-world/chats -------------------------------------------------------------------------------------------------------------------------------------------------------------------------
                                             /..
    9.7 GiB [##############################]  session-2026-05-07T23-09-4fd3b828.jsonl  
    1.6 GiB [####                          ]  session-2026-05-16T20-57-da3d0d98.jsonl
   34.7 MiB [                              ]  session-2026-04-30T08-34-bb3adf87.json  
    1.3 MiB [                              ] /da3d0d98-dc88-4b74-b46e-398b62a13f7c
    4.0 KiB [                              ]  session-2026-05-14T13-37-1c22149c.jsonl

#gemini
#llm

failed

#llm
#quote

#travel
#philippines
#trash
#asia
#video

From https://www.bilibili.com/video/BV1YH6aYJEwj

#bilibili verification with 100 questions - to be able to leave comments

#music
#sunboy

Остров в океане

From https://www.youtube.com/watch?v=rjvImL06_1k

Про исполнителя https://ru.wikipedia.org/wiki/Пророк_Санбой

#error
#gitlab
#contradiction

#лекция про мой #telegram #бот для #evernote

Репозиторий проекта: https://gitlab.com/vitaly-zdanevich/bot_telegram_evernote
Создано через #llm Codex gpt-5.5 xhigh, часов за 10. Сначала на Питоне - а потом попросил переписать на Расте - для скорости.

Упоминались:
evernote.com
evernote.com/api/DeveloperToken.action
help.evernote.com/hc/en-us/articles/209005347-Save-emails-into-Evernote
notesnook.com FOSS альтернатива
obsidian.md проприетарный софт для заметок в markdown
logseq.com свободные заметки в markdown
github.com/boo-yee/nixnote2 FOSS клиент для Evernote на C++ и Qt
github.com/vitaly-zdanevich/reeknote мой CLI на Rust
github.com/syncthing/syncthing FOSS синхронизация данных через ваши устройства

Бесплатный хостинг для ваших проектов:
aws.amazon.com/lambda

Про стили - чтобы сайты выгляди как надо вам а не дизайнеру:
github.com/openstyles/stylus
userstyles.world/user/vitaly-zdanevich
gitlab.com/vitaly-zdanevich-styles/evernote

css-tricks.com/css-keylogger

https://youtu.be/IUXU2for6KI

❤‍🔥 2

I love #ci so much that for the first time I depleted free 400 minutes per month, on #gitlab, on my FOSS non-commercial projects.

https://gitlab.com/-/profile/usage_quotas#pipelines-quota-tab

Fix my #style for #mdn, #screenshot before and after

Sad that UI customization is rare.

https://gitlab.com/vitaly-zdanevich-styles/mdn

👍 1

Wow my #reeknote (#evernote #cli) can now play audio and show images, in a terminal

https://github.com/vitaly-zdanevich/reeknote

#code
#russian
#yandex
#language

From https://t.me/Yandex4Developers/1513

#screenshot from https://alice.yandex.ru/

🤔 1 · 😢 1

#heap
#lt

Wow in #leetcode we can #patch classes:

ListNode.__lt__ = lambda self, other: self.val < other.val

This is good for simpler support of heap - by providing the object only - without the index and value.

Full:

import heapq

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next

ListNode.__lt__ = lambda self, other: self.val < other.val

class Solution:
    def mergeKLists(self, lists: List[Optional[ListNode]]) -> Optional[ListNode]:
        heap = []

        for node in lists:
            if node:
                heapq.heappush(heap, node)

        head: List[ListNode] = ListNode()
        tail = head

        while heap:
            node = heapq.heappop(heap)
            tail.next = node
            tail = node

            if node.next:
                heapq.heappush(heap, node.next)

        return head.next

23. Merge k Sorted Lists

👍 1

#scream
#metal

Source

This is how in #go we remove an element from a collection

func rm(i int, lists[]*ListNode) []*ListNode {
    return append(lists[:i], lists[i+1:]...)
}

Usually its a library call.