<?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/c-program-to-calculate-centripetal-force/</loc>
  <lastmod>2026-10-27T08:17:44Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>C++ program to calculate centripetal force</news:title>
   <news:publication_date>2026-11-10T13:56:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/count-subarrays-whose-sum-equals-their-length/</loc>
  <lastmod>2026-10-27T08:17:44Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Count subarrays whose sum equals their length</news:title>
   <news:publication_date>2026-11-10T12:16:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/difference-between-couchdb-and-ibm-db2-databases/</loc>
  <lastmod>2026-10-27T08:17:44Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Difference between CouchDB and IBM Db2 databases</news:title>
   <news:publication_date>2026-11-10T10:49:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/maximum-partitions-of-a-number-into-unique-integers-in-java/</loc>
  <lastmod>2026-10-27T08:17:44Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Maximum partitions of a number into unique integers in Java</news:title>
   <news:publication_date>2026-11-10T08:11:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/check-if-bike-racer-a-can-reach-racer-b-with-k-jumps/</loc>
  <lastmod>2026-10-27T08:17:43Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Check if bike racer A can reach racer B with K jumps</news:title>
   <news:publication_date>2026-11-10T06:51:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/number-of-divisors-of-a-large-number-in-cube-root-time/</loc>
  <lastmod>2026-10-27T08:17:43Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Number of divisors of a large number in cube root time</news:title>
   <news:publication_date>2026-11-10T02:30:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/total-kilometers-you-can-write-with-n-pencils/</loc>
  <lastmod>2026-10-27T08:17:42Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Total kilometers you can write with N pencils</news:title>
   <news:publication_date>2026-11-09T15:32:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/urlsearchparams-append-method-in-node-js/</loc>
  <lastmod>2026-10-27T08:17:42Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>URLSearchParams.append() method in Node.js</news:title>
   <news:publication_date>2026-11-09T12:06:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/minimum-operations-to-make-x-non-positive-using-a-max-heap/</loc>
  <lastmod>2026-10-28T04:34:26Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Minimum operations to make X non-positive using a max heap</news:title>
   <news:publication_date>2026-11-09T10:46:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/urban-company-interview-experience-for-campus-hiring/</loc>
  <lastmod>2026-10-27T08:17:42Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Urban Company interview experience for campus hiring</news:title>
   <news:publication_date>2026-11-09T06:58:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/probability-of-maximum-points-on-a-random-path-in-a-matrix/</loc>
  <lastmod>2026-10-27T08:17:41Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Probability of maximum points on a random path in a matrix</news:title>
   <news:publication_date>2026-11-09T04:55:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/minimum-flips-to-match-target-values-in-a-rooted-tree/</loc>
  <lastmod>2026-10-27T08:17:41Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Minimum flips to match target values in a rooted tree</news:title>
   <news:publication_date>2026-11-09T02:25:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/total-set-bits-from-1-to-n-1-when-n-is-a-power-of-2/</loc>
  <lastmod>2026-10-27T08:17:41Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Total set bits from 1 to N-1 when N is a power of 2</news:title>
   <news:publication_date>2026-11-08T16:04:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/kotlin-math-truncate-function-with-examples/</loc>
  <lastmod>2026-10-27T08:17:41Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Kotlin math truncate() function with examples</news:title>
   <news:publication_date>2026-11-08T11:43:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/time-complexity-analysis-by-tracing-the-code-in-c/</loc>
  <lastmod>2026-10-27T08:17:40Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Time complexity analysis by tracing the code in C++</news:title>
   <news:publication_date>2026-11-08T08:54:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/maximum-x-with-subtracted-sum-at-least-k-using-binary-search/</loc>
  <lastmod>2026-10-27T08:17:40Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Maximum X with subtracted sum at least K using binary search</news:title>
   <news:publication_date>2026-11-08T06:16:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/advantages-and-disadvantages-of-the-internet-of-things/</loc>
  <lastmod>2026-10-27T08:17:40Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Advantages and disadvantages of the Internet of Things</news:title>
   <news:publication_date>2026-11-08T04:55:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
 <url>
  <loc>https://w3colleges.org/call-by-value-call-by-address-and-call-by-reference-in-c/</loc>
  <lastmod>2026-10-27T08:17:40Z</lastmod>
  <news:news>
   <news:publication>
    <news:name>W3Colleges</news:name>
    <news:language>en</news:language>
   </news:publication>
   <news:title>Call by value, call by address and call by reference in C++</news:title>
   <news:publication_date>2026-11-08T02:49:00Z</news:publication_date>
   <news:genres>Blog</news:genres>
  </news:news>
 </url>
</urlset>
