notes_2025.md

Need review

• Problem 3. 无重复字符的最长字串(sliding window, hash)

Hash

    // check existence
    map<char, int> counter;
    if(counter.find(ch) == counter.end())
        // not found
    
    // erase
    counter.erase(ch)