<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Shoeb Ahmed</title>
    <description>The latest articles on DEV Community by Shoeb Ahmed (@shoeb_ahmed).</description>
    <link>https://dev.to/shoeb_ahmed</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F1688971%2F611580d2-5c8e-4694-b7d5-8350e22e3d58.jpg</url>
      <title>DEV Community: Shoeb Ahmed</title>
      <link>https://dev.to/shoeb_ahmed</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/shoeb_ahmed"/>
    <language>en</language>
    <item>
      <title>Kth smallest elements find from a matrix</title>
      <dc:creator>Shoeb Ahmed</dc:creator>
      <pubDate>Mon, 01 Jul 2024 14:00:53 +0000</pubDate>
      <link>https://dev.to/shoeb_ahmed/kth-smallest-elements-find-from-a-matrix-1924</link>
      <guid>https://dev.to/shoeb_ahmed/kth-smallest-elements-find-from-a-matrix-1924</guid>
      <description>&lt;p&gt;&lt;a href="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fj9k2ujmo6hh8fji3f4nn.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fj9k2ujmo6hh8fji3f4nn.png" alt="Image description" width="800" height="449"&gt;&lt;/a&gt;&lt;/p&gt;

</description>
    </item>
    <item>
      <title>Maximum depth of a binary tree</title>
      <dc:creator>Shoeb Ahmed</dc:creator>
      <pubDate>Fri, 28 Jun 2024 15:34:49 +0000</pubDate>
      <link>https://dev.to/shoeb_ahmed/maximum-depth-of-a-binary-tree-ahe</link>
      <guid>https://dev.to/shoeb_ahmed/maximum-depth-of-a-binary-tree-ahe</guid>
      <description>&lt;p&gt;&lt;a href="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkfj5ijnsnkezg4ltbxug.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkfj5ijnsnkezg4ltbxug.png" alt="Image description" width="800" height="449"&gt;&lt;/a&gt;&lt;/p&gt;

</description>
    </item>
    <item>
      <title>A minimal array length of a subarray grater than or equal target value</title>
      <dc:creator>Shoeb Ahmed</dc:creator>
      <pubDate>Fri, 28 Jun 2024 10:17:09 +0000</pubDate>
      <link>https://dev.to/shoeb_ahmed/here-is-a-minimal-array-lenth-of-a-subarray-grater-than-or-equal-target-value-4lo0</link>
      <guid>https://dev.to/shoeb_ahmed/here-is-a-minimal-array-lenth-of-a-subarray-grater-than-or-equal-target-value-4lo0</guid>
      <description>&lt;p&gt;&lt;a href="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgx877fduv1bc2bcu0e31.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgx877fduv1bc2bcu0e31.png" alt="Image description" width="800" height="449"&gt;&lt;/a&gt;&lt;/p&gt;

</description>
    </item>
  </channel>
</rss>
