<?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/public-private-and-protected-access-modifiers-in-c/</loc>
  <lastmod>2026-10-28T04:33:54Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Public, private and protected access modifiers in C++</news:title>
   <news:publication_date>2026-11-16T01:39:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/bitwise-xor-of-all-prime-numbers-present-in-an-array/</loc>
  <lastmod>2026-10-28T04:33:53Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Bitwise XOR of all prime numbers present in an array</news:title>
   <news:publication_date>2026-11-15T14:49:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/sum-of-first-n-integers-whose-digit-sum-is-divisible-by-10/</loc>
  <lastmod>2026-10-28T04:33:53Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Sum of first N integers whose digit sum is divisible by 10</news:title>
   <news:publication_date>2026-11-15T11:09:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/find-the-top-k-numbers-in-a-stream-by-frequency/</loc>
  <lastmod>2026-10-28T04:33:53Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Find the top k numbers in a stream by frequency</news:title>
   <news:publication_date>2026-11-15T08:20:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/convert-a-dictionary-of-lists-to-a-flat-dictionary-in-python/</loc>
  <lastmod>2026-10-28T04:33:53Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Convert a dictionary of lists to a flat dictionary in Python</news:title>
   <news:publication_date>2026-11-15T07:00:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/largest-distance-between-two-nodes-of-a-tree-using-lca/</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>Largest distance between two nodes of a tree using LCA</news:title>
   <news:publication_date>2026-11-15T04:28:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <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>
</urlset>
