<?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/minimum-deletions-to-make-two-strings-anagrams/</loc>
  <lastmod>2026-10-28T04:34:02Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Minimum deletions to make two strings anagrams</news:title>
   <news:publication_date>2026-11-20T15:20:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/find-all-monk-numbers-that-occur-once-in-an-array/</loc>
  <lastmod>2026-10-28T04:34:02Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Find all monk numbers that occur once in an array</news:title>
   <news:publication_date>2026-11-20T14:05:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/count-total-bit-flips-when-counting-from-0-to-n/</loc>
  <lastmod>2026-10-28T04:34:02Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Count total bit flips when counting from 0 to n</news:title>
   <news:publication_date>2026-11-20T11:51:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/count-even-length-strings-from-n-even-and-m-odd-length-strings/</loc>
  <lastmod>2026-10-28T04:34:02Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Count even length strings from N even and M odd length strings</news:title>
   <news:publication_date>2026-11-20T06:48:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/sequence-of-length-n-with-exactly-p-pairs-having-xor-equal-to-x/</loc>
  <lastmod>2026-10-28T04:34:01Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Sequence of length N with exactly P pairs having XOR equal to X</news:title>
   <news:publication_date>2026-11-20T05:21:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/maximum-number-of-pairs-with-equal-sum-in-an-array/</loc>
  <lastmod>2026-10-28T04:34:01Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Maximum number of pairs with equal sum in an array</news:title>
   <news:publication_date>2026-11-20T02:16:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/find-the-position-after-k-jumps-with-steps-x-and-y/</loc>
  <lastmod>2026-10-28T04:34:01Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Find the position after K jumps with steps X and Y</news:title>
   <news:publication_date>2026-11-19T15:08:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/sum-of-the-first-n-centered-nonadecagonal-numbers/</loc>
  <lastmod>2026-10-28T04:34:01Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Sum of the first N centered nonadecagonal numbers</news:title>
   <news:publication_date>2026-11-19T10:10:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/longest-subarray-with-sum-not-divisible-by-k/</loc>
  <lastmod>2026-10-28T04:34:00Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Longest subarray with sum not divisible by K</news:title>
   <news:publication_date>2026-11-19T08:23:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/check-if-a-number-whose-digits-follow-a-sum-rule-is-divisible-by-3/</loc>
  <lastmod>2026-10-28T04:34:00Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Check if a number whose digits follow a sum rule is divisible by 3</news:title>
   <news:publication_date>2026-11-19T06:37:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/reverse-path-forwarding-in-computer-networks/</loc>
  <lastmod>2026-10-28T04:33:59Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Reverse path forwarding in computer networks</news:title>
   <news:publication_date>2026-11-19T04:29:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/count-inversions-of-size-three-using-a-segment-tree/</loc>
  <lastmod>2026-10-28T04:33:59Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Count inversions of size three using a segment tree</news:title>
   <news:publication_date>2026-11-19T03:07:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/check-if-a-string-is-a-subsequence-of-another-string/</loc>
  <lastmod>2026-10-28T04:33:59Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Check if a string is a subsequence of another string</news:title>
   <news:publication_date>2026-11-18T16:04:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/local-and-global-variables-in-pl-sql-with-an-example/</loc>
  <lastmod>2026-10-28T04:33:59Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Local and global variables in PL/SQL with an example</news:title>
   <news:publication_date>2026-11-18T12:04:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/maximum-number-of-binary-strings-that-can-be-made-palindromes/</loc>
  <lastmod>2026-10-28T04:33:58Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Maximum number of binary strings that can be made palindromes</news:title>
   <news:publication_date>2026-11-18T10:33:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/print-all-palindromes-made-from-the-letters-of-a-palindrome/</loc>
  <lastmod>2026-10-28T04:33:58Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Print all palindromes made from the letters of a palindrome</news:title>
   <news:publication_date>2026-11-18T07:57:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/maximum-coins-by-removing-the-substrings-01-and-10/</loc>
  <lastmod>2026-10-28T04:33:58Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Maximum coins by removing the substrings 01 and 10</news:title>
   <news:publication_date>2026-11-18T06:35:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/find-eventually-safe-nodes-in-a-directed-graph/</loc>
  <lastmod>2026-10-28T04:33:58Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Find eventually safe nodes in a directed graph</news:title>
   <news:publication_date>2026-11-18T02:56:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
</urlset>
