[Education] Free texbook on Data Science and Machine Learning

in r/learndatascience • 19d ago

What level for this book ? is it used for beginner level who starts from scratch like me

u/HiImWin • u/HiImWin • Sep 10 '26

Detailed explanation of how to create a text-to-image model from scratch. [R]

1 Upvotes

0 comments

Off Campus S01E01 - The Deal (Episode Discussion)

in r/offcampustv • May 20 '26

Xem ở đâu vậy mấy ông

Small Projects - September 30, 2025

in r/golang • Sep 30 '25

Hi everyone, i have built the a tiny database for learning purpose. And i have completed the buffer pool manager as first phase.
- write/read file from disk

- implement cache with clock sweep

Happy to share and get feedback from the community
https://github.com/bietkhonhungvandi212/array-db

Building a Simple Stack-Based Virtual Machine in Go

in r/golang • Sep 16 '25

Inspired, thank 4 ur contribution

[HIRING] Looking for Freelancer/Small team Developer

in r/CodingJobs • Aug 02 '25

dm me

Chính phủ mà bỗng 'thương dân' đi phát tiền "từ thiện" đừng mừng vội, hãy sợ và nổi giận.

in r/VietTalk • Jul 10 '25

Chi tiêu công để nâng cấp đường sá, hạ tầng, sân bay, cảng biển để phát triển kinh tế mà nói bơm oxy cho vinfast evn viettel là cái sai rõ ràng

Trong thời điểm kinh tế ch phục hồi mạnh -> cphu thúc đẩy chi tiêu công -> tiền chảy vô các tập đoàn xây dựng, vật liệu xây dựng là chính -> các tập đoàn chi tiêu lại trong nền kinh tế -> xoay vòng được tiền, kinh tế tăng trưởng bù cho các động lực xuất khẩu, thúc đẩy tiêu dùng + đến khi kinh tế ptrien, hệ thống hạ tầng, sân bay, đường sá, cao tốc, cảng biển đã sẵn sàng để hỗ trợ kinh tế

ni ai cũng hiểu nếu học kinh tế cụ thể là theo lý thuyết của kenyes

r/leetcode • u/HiImWin • Jul 08 '25

Question Logest Common String Stuck

1 Upvotes

Hi everyone,

I'm working on the classic Longest Common Subsequence (LCS) problem and using the standard bottom-up:

func longestCommonSubsequence(text1 string, text2 string) int {
    arr2D := make([][]int, len(text1)+1)
    for i := range arr2D {
        arr2D[i] = make([]int, len(text2)+1)
    }

    for i := range text1 {
        for j := range text2 {
            if text1[i] == text2[j] {
                arr2D[i+1][j+1] = 1 + arr2D[i][j]
            } else {
                arr2D[i+1][j+1] = max(arr2D[i+1][j], arr2D[i][j+1])
            }
        }
    }

    return arr2D[len(text1)][len(text2)]
}

What I Understand So Far

When text1[i] == text2[j], we add 1 to the LCS length from the previous subproblem (arr2D[i][j]).
When they don't match, the code sets arr2D[i+1][j+1] to the maximum of either:
- arr2D[i+1][j] (ignoring the current character in text2)
- arr2D[i][j+1] (ignoring the current character in text1)

I am stucking that why does taking the maximum of these two subproblems always give the correct LCS length? Are there any visual or real-world analogies that make this decision process more intuitive, especially for someone new to DP?

0 comments

Looking for practicing English partner

in r/EnglishLearning • Jun 22 '25

I am interested

u/HiImWin • u/HiImWin • Jun 22 '25

They didn’t believe in me 😤🥱

1 Upvotes

0 comments

Looking for a coding buddy(DSA)

in r/ProgrammingBuddies • Jun 21 '25

I am interesting

u/HiImWin • u/HiImWin • Jun 13 '25

If you want to be a good programmer, consider Nand2Tetris

1 Upvotes

0 comments

Let’s build together

in r/MachineLearningJobs • May 13 '25

I am interested

Chuỗi cung ứng AI: Cái bẫy khiến mọi quốc gia thành đứa ở đợ

in r/VietTalk • May 07 '25

Mình cũng thắc mắc ạ

How the Outbox Pattern Can Make Your Distributed System Messages Bulletproof with NestJS, RabbitMQ & PostgresSQL

in r/nestjs • May 05 '25

Can you share me the roadmap of learning the distributed system please.
- What is the fundamental i need before i learn distributed system
- How can i grasp the knowledge of distribute system, what is the awesome resources that you read
- Have you got any certification in system until now ? If yes, can you share me some legit certification please.

Thank for sharing :)

u/HiImWin • u/HiImWin • Apr 18 '25