<?xml version="1.0" encoding="UTF-8"?>
<!-- 本文件由 scripts/gen-feed.mjs 在构建时自动生成，不要手动编辑。 -->
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Kevinn 的个人空间</title>
    <link>https://iskevin.xyz/notes</link>
    <description>LeetCode 题解与面经、Go / Vue 学习笔记、开源资源分享。</description>
    <language>zh-CN</language>
    <atom:link href="https://iskevin.xyz/rss.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Agents on Duty 项目完整体验</title>
      <link>https://iskevin.xyz/notes/agents-on-duty-project-intro</link>
      <guid>https://iskevin.xyz/notes/agents-on-duty-project-intro</guid>
      <description>从本地跑起 Agents on Duty，再实际走一遍订单、退款、转人工和知识库问答。</description>
      <pubDate>Wed, 04 Nov 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>两数相加</title>
      <link>https://iskevin.xyz/notes/add-two-numbers</link>
      <guid>https://iskevin.xyz/notes/add-two-numbers</guid>
      <description>链表逆序存储数字，逐位相加时把进位带到下一轮。</description>
      <pubDate>Mon, 02 Nov 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>第十七届蓝桥杯省赛 B 组：整数对计数与队伍分组</title>
      <link>https://iskevin.xyz/notes/lanqiaobei</link>
      <guid>https://iskevin.xyz/notes/lanqiaobei</guid>
      <description>一题从 x + y = N 推出整数对数量，另一题根据总人数和各位置人数判断能否分组。</description>
      <pubDate>Sun, 01 Nov 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>环形链表 Ⅰ &amp; Ⅱ</title>
      <link>https://iskevin.xyz/notes/linked-list-cycle</link>
      <guid>https://iskevin.xyz/notes/linked-list-cycle</guid>
      <description>一个是判断链表是否有环，一个是找到环的入口节点。</description>
      <pubDate>Wed, 28 Oct 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>Java 学习站：从基础语法开始，一边学一边练</title>
      <link>https://iskevin.xyz/notes/java-learning-station</link>
      <guid>https://iskevin.xyz/notes/java-learning-station</guid>
      <description>从 Java 基础语法到后端开发前的知识，结合 Go 对照、练习题和 IDEA 编码任务，一边学一边练。</description>
      <pubDate>Wed, 28 Oct 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>反转链表</title>
      <link>https://iskevin.xyz/notes/reverse-linked-list</link>
      <guid>https://iskevin.xyz/notes/reverse-linked-list</guid>
      <description>把节点依次压进栈，再从栈顶依次取出来——先进后出，正好就是从末尾走到开头。</description>
      <pubDate>Sat, 24 Oct 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>回文链表</title>
      <link>https://iskevin.xyz/notes/palindrome-linked-list</link>
      <guid>https://iskevin.xyz/notes/palindrome-linked-list</guid>
      <description>回文就是正着读和反着读一样——把节点全压进栈，从栈顶倒着读，和原链表顺着读比一遍。</description>
      <pubDate>Sat, 24 Oct 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>我做了个“项目快速梳理”的 skill</title>
      <link>https://iskevin.xyz/notes/onboard-skill</link>
      <guid>https://iskevin.xyz/notes/onboard-skill</guid>
      <description>能不能把这些资料直接交给 AI，让它先帮我把项目看出一个全貌，再按照我准备做的事情带我学？</description>
      <pubDate>Fri, 23 Oct 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>Harness 工程：通过 Pi Agent 认识 Agent 运行框架</title>
      <link>https://iskevin.xyz/notes/harness-engineering</link>
      <guid>https://iskevin.xyz/notes/harness-engineering</guid>
      <description>从 Agent Loop、上下文组装到安全控制和可观测性，用 Pi Agent 看 Harness 工程由什么组成。</description>
      <pubDate>Thu, 22 Oct 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>相交链表</title>
      <link>https://iskevin.xyz/notes/intersection-of-two-linked-lists</link>
      <guid>https://iskevin.xyz/notes/intersection-of-two-linked-lists</guid>
      <description>让两个指针分别走完 A+B 和 B+A，抵消两条链表的长度差，最终在相交节点相遇。</description>
      <pubDate>Sun, 11 Oct 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>Git 后悔药指南：从 restore 到 reflog</title>
      <link>https://iskevin.xyz/notes/git-recovery-guide</link>
      <guid>https://iskevin.xyz/notes/git-recovery-guide</guid>
      <description>只要 commit 过，基本都能救回来；真正危险的是没 commit 的改动。</description>
      <pubDate>Fri, 09 Oct 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>和为 K 的子数组</title>
      <link>https://iskevin.xyz/notes/subarray-sum-equals-k</link>
      <guid>https://iskevin.xyz/notes/subarray-sum-equals-k</guid>
      <description>当前前缀和 - 之前的前缀和 = 子数组的和。</description>
      <pubDate>Wed, 07 Oct 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>找到字符串中所有字母异位词：固定窗口，逐格滑动</title>
      <link>https://iskevin.xyz/notes/find-all-anagrams</link>
      <guid>https://iskevin.xyz/notes/find-all-anagrams</guid>
      <description>窗口长度固定为 p 的长度：移出左边字符，加入右边新字符，再比较两组字母出现次数。</description>
      <pubDate>Sun, 27 Sep 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>项目介绍：基于腾讯开源的 WeKnora 接入 Agent 系统中</title>
      <link>https://iskevin.xyz/notes/weknora-customer-service-agent</link>
      <guid>https://iskevin.xyz/notes/weknora-customer-service-agent</guid>
      <description>自己搭 RAG，每一环都是坑；我把知识库这一层交给腾讯开源的 WeKnora，做了一个可配置的客服 Agent。</description>
      <pubDate>Thu, 24 Sep 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>北京数码视讯科技股份有限公司 | 技术实习生 | 一面</title>
      <link>https://iskevin.xyz/notes/smsh-tech-intern-first</link>
      <guid>https://iskevin.xyz/notes/smsh-tech-intern-first</guid>
      <description>北京数码视讯科技股份有限公司 · 技术实习生 · 一面。</description>
      <pubDate>Wed, 23 Sep 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>Linux 实战：从 SSH 到上线</title>
      <link>https://iskevin.xyz/notes/linux-practice-demo</link>
      <guid>https://iskevin.xyz/notes/linux-practice-demo</guid>
      <description>以我部署服务器的例子作为一个 Linux 实战，将完整部署上线的流程分享给大家。</description>
      <pubDate>Tue, 22 Sep 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>Linux 基本操作指令</title>
      <link>https://iskevin.xyz/notes/linux-basic-commands</link>
      <guid>https://iskevin.xyz/notes/linux-basic-commands</guid>
      <description>整理自己刚开始接触 Linux 时用到的基础命令，再用几个实际操作把目录和文件管理走一遍。</description>
      <pubDate>Mon, 21 Sep 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>无重复字符的最长子串：用滑动窗口找出最长连续区间</title>
      <link>https://iskevin.xyz/notes/longest-substring-without-repeating</link>
      <guid>https://iskevin.xyz/notes/longest-substring-without-repeating</guid>
      <description>用两个指针维护一个没有重复字符的窗口：right 负责扩大，出现重复后 left 负责收缩。</description>
      <pubDate>Sun, 20 Sep 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>接雨水：每个位置能接多少，取决于较矮的那一边</title>
      <link>https://iskevin.xyz/notes/trapping-rain-water</link>
      <guid>https://iskevin.xyz/notes/trapping-rain-water</guid>
      <description>接水量 = min(左边最高, 右边最高) - 当前高度。双指针各管一边，谁矮处理谁。</description>
      <pubDate>Fri, 14 Aug 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>三数之和：排序 + 双指针 + 去重</title>
      <link>https://iskevin.xyz/notes/three-sum</link>
      <guid>https://iskevin.xyz/notes/three-sum</guid>
      <description>固定一个 i，left/right 从两端往中间夹击。这道题真正的难点不在找答案，而在去重。</description>
      <pubDate>Wed, 12 Aug 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>盛最多水的容器：移动矮的那一端</title>
      <link>https://iskevin.xyz/notes/container-with-most-water</link>
      <guid>https://iskevin.xyz/notes/container-with-most-water</guid>
      <description>面积 = 矮的一边 × 宽度。想变大只能动矮的——left 矮就右移，right 矮就左移。</description>
      <pubDate>Mon, 10 Aug 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>移动零：快慢指针各自干什么</title>
      <link>https://iskevin.xyz/notes/move-zeroes</link>
      <guid>https://iskevin.xyz/notes/move-zeroes</guid>
      <description>i 负责遍历、j 负责记账：非零的往前填，填完之后剩下的位置全是零。</description>
      <pubDate>Sun, 09 Aug 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>字母异位词分组：排序当特征，哈希做分组</title>
      <link>https://iskevin.xyz/notes/group-anagrams</link>
      <guid>https://iskevin.xyz/notes/group-anagrams</guid>
      <description>字母相同的一组词，排序后一定长得一样——拿这个特征当 key，一遍遍历把同组词挂进同一个哈希桶。</description>
      <pubDate>Sat, 08 Aug 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>最长连续序列：起点判断 + 哈希查询</title>
      <link>https://iskevin.xyz/notes/longest-consecutive-sequence</link>
      <guid>https://iskevin.xyz/notes/longest-consecutive-sequence</guid>
      <description>题目要求 O(n)，排序先排除。每个数都问一句&quot;你的前一个在吗？&quot;——不在，它就是一段连续序列的起点。</description>
      <pubDate>Sat, 08 Aug 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>两数之和：从暴力循环到哈希表</title>
      <link>https://iskevin.xyz/notes/two-sum-hash</link>
      <guid>https://iskevin.xyz/notes/two-sum-hash</guid>
      <description>不是找两个数，而是每个数都在找它需要的那个数——遍历一遍，问题从&quot;找配对&quot;变成&quot;查字典&quot;。</description>
      <pubDate>Wed, 05 Aug 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>通明星球数字科技公司 | Agent开发 | 一面</title>
      <link>https://iskevin.xyz/notes/tongming-agent-first-round</link>
      <guid>https://iskevin.xyz/notes/tongming-agent-first-round</guid>
      <description>第一次约到开发岗的面试，被面试官结合项目和 Agent 拷打，什么都答不上来。三个月过去，harness、自进化、graph 全都出来了。</description>
      <pubDate>Wed, 17 Jun 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>慧博云通 | GA测试实习生 | 已OC</title>
      <link>https://iskevin.xyz/notes/huibo-ga-testing-oc</link>
      <guid>https://iskevin.xyz/notes/huibo-ga-testing-oc</guid>
      <description>三星外包的测试实习，从投递到面试只隔一天，面完两小时就通过。最后还是拒了——想去做开发。</description>
      <pubDate>Sun, 07 Jun 2026 16:00:00 GMT</pubDate>
    </item>
    <item>
      <title>腾讯 WXG | 测试类 | 一面</title>
      <link>https://iskevin.xyz/notes/tencent-wxg-testing-first</link>
      <guid>https://iskevin.xyz/notes/tencent-wxg-testing-first</guid>
      <description>被测试岗捞了，二十分钟两道算法题一道都没写出来。挂了，但挺开心——至少见识到了大厂面试长什么样。</description>
      <pubDate>Thu, 02 Apr 2026 16:00:00 GMT</pubDate>
    </item>
  </channel>
</rss>
