<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="wordpress.com" -->
<urlset xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:image="http://www.google.com/schemas/sitemap-image/1.1" xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9 http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd"><url><loc>https://codewhiletrue.code.blog/2021/01/08/check-permutations-of-a-string-for-palindromes/</loc><lastmod>2021-01-08T00:36:16+00:00</lastmod><changefreq>monthly</changefreq></url><url><loc>https://codewhiletrue.code.blog/2020/11/24/calculate-angle-between-clock-hands/</loc><lastmod>2020-11-24T00:57:30+00:00</lastmod><changefreq>monthly</changefreq></url><url><loc>https://codewhiletrue.code.blog/2020/11/12/implement-a-queue-using-stacks/</loc><lastmod>2020-11-12T23:58:23+00:00</lastmod><changefreq>monthly</changefreq></url><url><loc>https://codewhiletrue.code.blog/2020/11/12/60/</loc><lastmod>2020-11-12T23:41:54+00:00</lastmod><changefreq>monthly</changefreq></url><url><loc>https://codewhiletrue.code.blog/2020/01/17/get-height-of-binary-tree/</loc><lastmod>2020-01-13T03:59:41+00:00</lastmod><changefreq>monthly</changefreq></url><url><loc>https://codewhiletrue.code.blog/2020/01/14/traverse-binary-tree-depth-first/</loc><lastmod>2020-01-13T03:36:32+00:00</lastmod><changefreq>monthly</changefreq></url><url><loc>https://codewhiletrue.code.blog/2020/01/13/traverse-binary-tree-breadth-first/</loc><lastmod>2020-01-13T03:25:50+00:00</lastmod><changefreq>monthly</changefreq></url><url><loc>https://codewhiletrue.code.blog/blog-feed/</loc><lastmod>2020-01-13T02:26:05+00:00</lastmod><changefreq>weekly</changefreq><priority>0.6</priority></url><url><loc>https://codewhiletrue.code.blog</loc><changefreq>daily</changefreq><priority>1.0</priority><lastmod>2021-01-08T00:36:16+00:00</lastmod></url></urlset>
