<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Observation on BeagleHQ</title>
    <link>https://beaglehq.netlify.app/tags/observation/</link>
    <description>Recent content in Observation on BeagleHQ</description>
    <generator>Hugo -- 0.127.0</generator>
    <language>en</language>
    <lastBuildDate>Mon, 30 Mar 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://beaglehq.netlify.app/tags/observation/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>2840. Check If Strings Can Be Made Equal With Operations 2</title>
      <link>https://beaglehq.netlify.app/posts/leetcode/2840-check-if-strings-can-be-made-equal-with-operations-2/</link>
      <pubDate>Mon, 30 Mar 2026 00:00:00 +0000</pubDate>
      <guid>https://beaglehq.netlify.app/posts/leetcode/2840-check-if-strings-can-be-made-equal-with-operations-2/</guid>
      <description>2840. Check If Strings Can Be Made Equal With Operations 2</description>
    </item>
    <item>
      <title>2839. Check If Strings Can Be Made Equal With Operations 1</title>
      <link>https://beaglehq.netlify.app/posts/leetcode/2839-check-if-strings-can-be-made-equal-with-operations-1/</link>
      <pubDate>Sun, 29 Mar 2026 00:00:00 +0000</pubDate>
      <guid>https://beaglehq.netlify.app/posts/leetcode/2839-check-if-strings-can-be-made-equal-with-operations-1/</guid>
      <description>2839. Check If Strings Can Be Made Equal With Operations 1</description>
    </item>
    <item>
      <title>1291. Sequential Digits</title>
      <link>https://beaglehq.netlify.app/posts/leetcode/1291-sequential-digits/</link>
      <pubDate>Thu, 05 Mar 2026 00:00:00 +0000</pubDate>
      <guid>https://beaglehq.netlify.app/posts/leetcode/1291-sequential-digits/</guid>
      <description>1291. Sequential Digits</description>
    </item>
    <item>
      <title>1758. Minimum Changes To Make Alternating Binary String</title>
      <link>https://beaglehq.netlify.app/posts/leetcode/1758-minimum-changes-to-make-alternating-binary-string/</link>
      <pubDate>Thu, 05 Mar 2026 00:00:00 +0000</pubDate>
      <guid>https://beaglehq.netlify.app/posts/leetcode/1758-minimum-changes-to-make-alternating-binary-string/</guid>
      <description>1758. Minimum Changes To Make Alternating Binary String</description>
    </item>
    <item>
      <title>1545. Find Nth Bit In Kth Binary String</title>
      <link>https://beaglehq.netlify.app/posts/leetcode/1545-find-nth-bit-in-kth-binary-string/</link>
      <pubDate>Tue, 03 Mar 2026 00:00:00 +0000</pubDate>
      <guid>https://beaglehq.netlify.app/posts/leetcode/1545-find-nth-bit-in-kth-binary-string/</guid>
      <description>1545. Find Nth Bit In Kth Binary String</description>
    </item>
    <item>
      <title>1689. Partitioning Into Maximum Number Of Deci Binary Numbers</title>
      <link>https://beaglehq.netlify.app/posts/leetcode/1689-partitioning-into-maximum-number-of-deci-binary-numbers/</link>
      <pubDate>Sun, 01 Mar 2026 00:00:00 +0000</pubDate>
      <guid>https://beaglehq.netlify.app/posts/leetcode/1689-partitioning-into-maximum-number-of-deci-binary-numbers/</guid>
      <description>1689. Partitioning Into Maximum Number Of Deci Binary Numbers</description>
    </item>
    <item>
      <title>761. Special Binary String</title>
      <link>https://beaglehq.netlify.app/posts/leetcode/761-special-binary-string/</link>
      <pubDate>Fri, 20 Feb 2026 00:00:00 +0000</pubDate>
      <guid>https://beaglehq.netlify.app/posts/leetcode/761-special-binary-string/</guid>
      <description>761. Special Binary String</description>
    </item>
    <item>
      <title>3010. Divide An Array Into Subarrays With Minimum Cost 1</title>
      <link>https://beaglehq.netlify.app/posts/leetcode/3010-divide-an-array-into-subarrays-with-minimum-cost-1/</link>
      <pubDate>Sun, 01 Feb 2026 00:00:00 +0000</pubDate>
      <guid>https://beaglehq.netlify.app/posts/leetcode/3010-divide-an-array-into-subarrays-with-minimum-cost-1/</guid>
      <description>3010. Divide An Array Into Subarrays With Minimum Cost 1</description>
    </item>
    <item>
      <title>2943. Maximize Area Of Square Hole In Grid</title>
      <link>https://beaglehq.netlify.app/posts/leetcode/2943-maximize-area-of-square-hole-in-grid/</link>
      <pubDate>Thu, 15 Jan 2026 00:00:00 +0000</pubDate>
      <guid>https://beaglehq.netlify.app/posts/leetcode/2943-maximize-area-of-square-hole-in-grid/</guid>
      <description>2943. Maximize Area Of Square Hole In Grid</description>
    </item>
    <item>
      <title>1975. Maximum Matrix Sum</title>
      <link>https://beaglehq.netlify.app/posts/leetcode/1975-maximum-matrix-sum/</link>
      <pubDate>Wed, 07 Jan 2026 00:00:00 +0000</pubDate>
      <guid>https://beaglehq.netlify.app/posts/leetcode/1975-maximum-matrix-sum/</guid>
      <description>1975. Maximum Matrix Sum</description>
    </item>
    <item>
      <title>3531. Count Covered Buildings</title>
      <link>https://beaglehq.netlify.app/posts/leetcode/3531-count-covered-buildings/</link>
      <pubDate>Thu, 11 Dec 2025 00:00:00 +0000</pubDate>
      <guid>https://beaglehq.netlify.app/posts/leetcode/3531-count-covered-buildings/</guid>
      <description>3531. Count Covered Buildings</description>
    </item>
    <item>
      <title>1262. Greatest Sum Divisible By 3</title>
      <link>https://beaglehq.netlify.app/posts/leetcode/1262-greatest-sum-divisible-by-3/</link>
      <pubDate>Sun, 23 Nov 2025 00:00:00 +0000</pubDate>
      <guid>https://beaglehq.netlify.app/posts/leetcode/1262-greatest-sum-divisible-by-3/</guid>
      <description>1262. Greatest Sum Divisible By 3</description>
    </item>
    <item>
      <title>1930. Unique Length 3 Palindromic Subsequences</title>
      <link>https://beaglehq.netlify.app/posts/leetcode/1930-unique-length-3-palindromic-subsequences/</link>
      <pubDate>Fri, 21 Nov 2025 00:00:00 +0000</pubDate>
      <guid>https://beaglehq.netlify.app/posts/leetcode/1930-unique-length-3-palindromic-subsequences/</guid>
      <description>1930. Unique Length 3 Palindromic Subsequences</description>
    </item>
    <item>
      <title>3228. Maximum Number Of Operations To Move Ones To End</title>
      <link>https://beaglehq.netlify.app/posts/leetcode/3228-maximum-number-of-operations-to-move-ones-to-end/</link>
      <pubDate>Thu, 13 Nov 2025 00:00:00 +0000</pubDate>
      <guid>https://beaglehq.netlify.app/posts/leetcode/3228-maximum-number-of-operations-to-move-ones-to-end/</guid>
      <description>3228. Maximum Number Of Operations To Move Ones To End</description>
    </item>
  </channel>
</rss>
