<?xml version="1.0" encoding="UTF-8"?>
<!--generator='jetpack-16.4'-->
<!--Jetpack_Sitemap_Buffer_News_XMLWriter-->
<?xml-stylesheet type="text/xsl" href="//w3colleges.org/news-sitemap.xsl"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:news="http://www.google.com/schemas/sitemap-news/0.9" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9 http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd">
 <url>
  <loc>https://w3colleges.org/longest-increasing-subsequence-using-a-segment-tree/</loc>
  <lastmod>2026-10-28T04:33:52Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Longest increasing subsequence using a segment tree</news:title>
   <news:publication_date>2026-11-15T01:30:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/find-the-nth-icosachiliagon-number-with-a-formula/</loc>
  <lastmod>2026-10-28T04:33:52Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Find the Nth icosachiliagon number with a formula</news:title>
   <news:publication_date>2026-11-14T14:25:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/check-if-a-number-is-a-k-persistent-number/</loc>
  <lastmod>2026-10-28T04:33:52Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Check if a number is a K-persistent number</news:title>
   <news:publication_date>2026-11-14T12:20:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/sum-and-product-of-smallest-and-largest-elements-in-a-linked-list/</loc>
  <lastmod>2026-10-28T04:33:51Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Sum and product of smallest and largest elements in a linked list</news:title>
   <news:publication_date>2026-11-14T10:40:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/last-digit-of-n-factorial-divided-by-m-factorial/</loc>
  <lastmod>2026-10-28T04:33:51Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Last digit of n factorial divided by m factorial</news:title>
   <news:publication_date>2026-11-14T09:03:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/count-the-ways-to-complete-n-jobs-in-sequence/</loc>
  <lastmod>2026-10-28T04:33:51Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Count the ways to complete N jobs in sequence</news:title>
   <news:publication_date>2026-11-14T06:31:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/largest-square-with-a-single-distinct-digit-in-a-matrix/</loc>
  <lastmod>2026-10-28T04:33:51Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Largest square with a single distinct digit in a matrix</news:title>
   <news:publication_date>2026-11-14T02:28:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/check-if-x-elements-of-an-array-can-have-an-odd-sum/</loc>
  <lastmod>2026-10-28T04:33:50Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Check if X elements of an array can have an odd sum</news:title>
   <news:publication_date>2026-11-13T16:00:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/count-permutations-that-avoid-original-adjacent-pairs/</loc>
  <lastmod>2026-10-28T04:33:50Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Count permutations that avoid original adjacent pairs</news:title>
   <news:publication_date>2026-11-13T12:26:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/smallest-number-with-maximum-difference-of-bitwise-or-and-xor/</loc>
  <lastmod>2026-10-28T04:33:50Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Smallest number with maximum difference of bitwise OR and XOR</news:title>
   <news:publication_date>2026-11-13T10:14:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/sum-of-unique-characters-of-all-substrings-of-a-string/</loc>
  <lastmod>2026-10-28T04:33:49Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Sum of unique characters of all substrings of a string</news:title>
   <news:publication_date>2026-11-13T07:56:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/superior-character-in-a-string-using-moores-voting-algorithm/</loc>
  <lastmod>2026-10-28T04:33:49Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Superior character in a string using Moore&amp;#039;s voting algorithm</news:title>
   <news:publication_date>2026-11-13T05:19:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/l1-l2-and-max-vector-norms-in-python-with-numpy/</loc>
  <lastmod>2026-10-28T04:33:49Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>L1, L2 and max vector norms in Python with NumPy</news:title>
   <news:publication_date>2026-11-13T01:30:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
</urlset>
