
  <rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
    <channel>
      <title>michelpf.dev</title>
      <link>https://www.michelpf.dev/blog</link>
      <description>Blog de Michel Fernandes sobre arquitetura de software, inteligência artificial, livros, história e ciência, com análises de podcasts e estudos.</description>
      <language>pt-br</language>
      <managingEditor>undefined (Michel Fernandes)</managingEditor>
      <webMaster>undefined (Michel Fernandes)</webMaster>
      <lastBuildDate>Fri, 16 Oct 2026 00:00:00 GMT</lastBuildDate>
      <atom:link href="https://www.michelpf.dev/tags/python/feed.xml" rel="self" type="application/rss+xml"/>
      
  <item>
    <guid>https://www.michelpf.dev/blog/leetcode-1-two-sum-python</guid>
    <title>LeetCode Easy 1: Two Sum em Python, de O(n²) a O(n)</title>
    <link>https://www.michelpf.dev/blog/leetcode-1-two-sum-python</link>
    <description>Two Sum, o problema 1 do LeetCode, resolvido em Python de quatro formas, da força bruta O(n²) ao hash map O(n), com código testado e tempos medidos.</description>
    <pubDate>Fri, 16 Oct 2026 00:00:00 GMT</pubDate>
    <author>undefined (Michel Fernandes)</author>
    <category>leetcode-easy</category><category>leetcode</category><category>python</category><category>algoritmos</category><category>desenvolvimento-de-software</category>
  </item>

    </channel>
  </rss>
