<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0">
    <channel>
      <title>stuff i learn</title>
      <link>https://notes.kenf.dev</link>
      <description>Last 10 notes on stuff i learn</description>
      <generator>Quartz -- quartz.jzhao.xyz</generator>
      <item>
    <title>graph traversal</title>
    <link>https://notes.kenf.dev/data-structures--and--algorithms/algorithms/graph-traversal</link>
    <guid>https://notes.kenf.dev/data-structures--and--algorithms/algorithms/graph-traversal</guid>
    <description><![CDATA[ bfs → use queue dfs → use stack dijkstra → bfs with min-heap works with cycles (non-negative) longest path → topo sort + iterate only works for directed acyclic graphs (DAGs) dsa algo. ]]></description>
    <pubDate>Mon, 23 Mar 2026 03:49:08 GMT</pubDate>
  </item><item>
    <title>bitwise operations</title>
    <link>https://notes.kenf.dev/data-structures--and--algorithms/bitwise-operations</link>
    <guid>https://notes.kenf.dev/data-structures--and--algorithms/bitwise-operations</guid>
    <description><![CDATA[  dsa. ]]></description>
    <pubDate>Mon, 23 Mar 2026 03:49:08 GMT</pubDate>
  </item><item>
    <title>fenwick tree</title>
    <link>https://notes.kenf.dev/data-structures--and--algorithms/fenwick-tree</link>
    <guid>https://notes.kenf.dev/data-structures--and--algorithms/fenwick-tree</guid>
    <description><![CDATA[ dsa. ]]></description>
    <pubDate>Mon, 23 Mar 2026 03:49:08 GMT</pubDate>
  </item><item>
    <title>c++ leetcode stuff</title>
    <link>https://notes.kenf.dev/languages/c++/interesting-c++/c++-leetcode-stuff</link>
    <guid>https://notes.kenf.dev/languages/c++/interesting-c++/c++-leetcode-stuff</guid>
    <description><![CDATA[ STL Headers &amp; Declarations Data Structure / ConceptC++ STL HeaderStandard DeclarationArray&lt;vector&gt;vector&lt;int&gt; v;String&lt;string&gt;string s;Hash Table&lt;unordered_map&gt;unordered_map&lt;int, int&gt; m;Stack&lt;stack&gt;stack&lt;int&gt; st;Queue&lt;queue&gt;queue&lt;int&gt; q;Min-H... ]]></description>
    <pubDate>Mon, 23 Mar 2026 03:49:08 GMT</pubDate>
  </item><item>
    <title>set vs unordered_set</title>
    <link>https://notes.kenf.dev/languages/c++/interesting-c++/set-vs-unordered_set</link>
    <guid>https://notes.kenf.dev/languages/c++/interesting-c++/set-vs-unordered_set</guid>
    <description><![CDATA[  a little birdie once told me that set.begin() gives me the min element how’s that possible if retrieval from a set is O(1) ← ⚠️ misconception ⚠️ that’s because retrieval is actually O(log(n)) (in C++) std::set in c++ is implemented with a binary search tree (usually red-black) std::unordered_set in... ]]></description>
    <pubDate>Mon, 23 Mar 2026 03:49:08 GMT</pubDate>
  </item><item>
    <title>z. interesting stuff</title>
    <link>https://notes.kenf.dev/z.-interesting-stuff</link>
    <guid>https://notes.kenf.dev/z.-interesting-stuff</guid>
    <description><![CDATA[ Fast C++: www.youtube.com/watch Distributed Systems: github.com/donnemartin/system-design-primer#system-design-topics-start-here planetscale.com/blog/sharding-vs-partitioning-whats-the-difference#what-is-partitioning learn.microsoft.com/en-us/office/troubleshoot/access/database-normalization-descrip... ]]></description>
    <pubDate>Mon, 23 Mar 2026 03:49:08 GMT</pubDate>
  </item><item>
    <title>algorithm and cs concepts</title>
    <link>https://notes.kenf.dev/languages/c++/interesting-c++/algorithm-and-cs-concepts</link>
    <guid>https://notes.kenf.dev/languages/c++/interesting-c++/algorithm-and-cs-concepts</guid>
    <description><![CDATA[ Big-O Notation &amp; Amortized Analysis Big-O: Represents the upper bound (worst-case). ]]></description>
    <pubDate>Fri, 13 Mar 2026 15:39:19 GMT</pubDate>
  </item><item>
    <title>gdb</title>
    <link>https://notes.kenf.dev/languages/c++/gdb</link>
    <guid>https://notes.kenf.dev/languages/c++/gdb</guid>
    <description><![CDATA[  rmb to compile with the -g flag for debugging symbols! use gdb ./your_program to start it up Basic Controls run (r): start the program run arg1 arg2: start with arguments quit (q): exit GDB Breakpoints &amp; Navigation break main (b): set a breakpoint at main break file.cpp:42: set at a specific li... ]]></description>
    <pubDate>Fri, 13 Mar 2026 15:18:40 GMT</pubDate>
  </item><item>
    <title>XMLHttpRequest (XHR)</title>
    <link>https://notes.kenf.dev/browser/XMLHttpRequest-(XHR)</link>
    <guid>https://notes.kenf.dev/browser/XMLHttpRequest-(XHR)</guid>
    <description><![CDATA[ Background enables the client to script data transfers via JS one of the key technologies behind the Asynchronus JS &amp; XML (AJAX) revolution prior to XHR, the web page had to be refreshed to send or fetch and state updates between the client and the server - XHR enables interactive web apps in th... ]]></description>
    <pubDate>Fri, 13 Mar 2026 07:59:55 GMT</pubDate>
  </item><item>
    <title>browser networking</title>
    <link>https://notes.kenf.dev/browser/browser-networking</link>
    <guid>https://notes.kenf.dev/browser/browser-networking</guid>
    <description><![CDATA[ browser Background the networking stack of a modern browser is much more than a simple socket manager features its own optimization criteria, APIs, and services Connection Management &amp; Optimization sockets are organized in pools, which are grouped by origin - each pool enforces its own connectio... ]]></description>
    <pubDate>Fri, 13 Mar 2026 07:59:55 GMT</pubDate>
  </item>
    </channel>
  </rss>