<?xml version="1.0" encoding="UTF-8"?>
<urlset><url><loc>https://www.ritambhara.in/login</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/sign_up</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/login/forgot_password_request</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/courses</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/contact_us</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/about_us</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/privacy_policy</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/terms_and_condition</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/faq</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/refund_policy</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/rotate-image-square-matrix-by-90-deg/331</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/assign-mice-to-holes/330</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/greedy-algorithm-for-egyptian-fraction/329</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/greedy-solution-to-activity-selection-problem/328</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/job-sequencing-with-given-deadline/327</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/max-distance-between-any-two-occurrences-of-the-same-element/326</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/breadth-first-search-traversal-in-a-graph/325</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/find-maximum-points-that-lie-on-a-straigt-line/324</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/print-all-subsequences-of-an-array/323</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/optimized-solution-of-power-function/322</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/reverse-only-alphabets-in-a-string-having-special-characters/321</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/reverse-a-string/320</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/maximum-number-of-consecutive-integers-in-an-array/319</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/recursive-bubble-sort/318</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/string-matching-algorithms/317</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/add-two-numbers-given-in-the-form-of-linked-list/316</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/find-common-merge-point-of-two-linked-lists/315</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/find-a-pair-of-elements-with-given-sum-in-the-array/314</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/introduction-to-relational-databases-part-2/313</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/introduction-to-relational-databases-part-1/312</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/implementing-genric-queue-data-structure-in-java/311</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/search-in-a-sorted-multi-level-linked-list/310</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/printed-a-sorted-multi-level-linked-list/309</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/traverse-and-print-a-linked-list-in-forward-and-backward-order/308</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/find-numbers-with-more-than-k-set-bits-in-their-binary-representations/307</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/remove-all-white-spaces-from-a-string/306</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/difference-between-nodes-of-alternate-vertical-levels-in-a-tree/305</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/rearrange-the-nodes-of-a-linked-list/304</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/merge-alternate-nodes-of-the-two-lists/303</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/water-overflowing-from-glass-arranged-in-form-of-triangle/302</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/maximum-or-minimum-sum-of-subarray-of-size-k/301</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/consecutive-numbers-with-sum-equal-to-n/300</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/number-of-ways-to-arrange-tiles-on-a-board/299</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/dynamic-programming-concept/298</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/radix-sort/297</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/sum-of-all-the-nodes-in-a-tree/296</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/count-number-of-zeros-in-a-row-wise-col-wise-sorted-binary-matrix/295</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/iterative-pre-order-traversal-using-stack/294</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/right-view-of-a-binary-tree/293</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/left-view-of-a-binary-tree/292</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/sort-using-c-standard-template-library/291</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/feedback-for-engineering-colleges/290</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-a-tree-is-almost-complete-binary-tree/289</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/hashmap-performance-improvement-in-java-8/288</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/separate-chaining-hashing-collision-handling-technique/287</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/birthday-paradox-birthday-problem/286</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/hashing-introduction/285</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/medicine-tablet-pill-taking-puzzle/284</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-two-nodes-are-siblings-in-a-binary-tree/283</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-duplicate-parenthesis-in-an-expression/282</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/next-greater-element/281</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/introducing-graph-data-structure-with-adjacency-matrix-implementation/280</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/recursive-implementation-of-insertion-sort/279</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/count-frequency-of-a-number-in-a-sorted-array/278</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/counting-sort/277</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/generic-pointers-in-c-language/276</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/add-sum-of-all-previous-elements-in-array-dpfci-1-2/275</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/find-minimum-of-3-numbers-without-using-comparator-operator/274</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/merge-two-sorted-arrays/273</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/convert-binary-tree-to-a-doubly-linked-list/272</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/maximum-xor-value-of-two-elements-in-an-array/271</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/print-all-words-in-trie-data-structure/270</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/trie-data-structure/269</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/longest-consecutive-path-in-a-binary-tree/268</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/populate-empty-positions-in-a-matrix-to-form-rectangles/267</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/sum-of-rectangle-region-in-a-given-matrix/266</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/putting-blocks-at-longest-distance-from-each-other-in-a-row/265</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/nearest-number-with-non-decreasing-digits/264</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/n-queens-problem/263</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/flip-all-zeros-to-ones-pancake-flipper/262</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/sum-of-all-nodes-in-a-vertical-level/261</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/vertical-distance-vertical-level-of-a-node-from-root/260</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/max-value-node-between-two-elements-of-bst/259</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-a-subtree-exist-with-a-given-sum/258</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/reversing-a-linked-list-iteratively-using-only-2-pointers/257</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/how-to-prepare-for-dynamic-programming-questions/256</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/rotten-oranges-problem/255</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/add-a-number-to-alternate-nodes-of-the-linked-list/254</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/print-a-circular-linked-list/253</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/binary-heap/252</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/almost-complete-binary-tree/251</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/coin-heap-puzzle/250</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/minimum-edit-distance-between-two-strings/249</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-array-can-be-divided-in-two-parts-with-equal-sum/248</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/patterns-of-string-by-replacing-char-with-digits/247</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/return-the-terminating-number-in-a-string/246</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/convert-string-to-number/245</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-the-given-character-is-a-digit-or-not/244</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/reverse-a-number/243</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/print-all-diagonals-of-a-matrix-in-alternate-order/242</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/compare-two-strings-given-as-linked-list/241</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/find-minimum-and-maximum-value-in-a-tree/240</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/prisoners-and-the-lightbulb-puzzle/239</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/evaluate-an-expression-given-in-postfix-notation/238</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/covert-infix-to-postfix-notation/237</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/inverting-the-glasses/236</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/door-to-heaven-or-hell/235</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/upstream-downstream-relative-speed-question/234</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/minimum-number-of-platform-required-for-a-railway-station/233</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/reverse-a-doubly-linked-list/232</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/gold-bar-puzzle/231</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/points-on-globe/230</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/find-fastest-horse/229</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-two-arrays-are-permutation-of-each-other/228</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/count-the-nodes-which-are-left-childs-in-the-binary-tree/227</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/divide-1000-gold-coins-among-5-pirates/226</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/storing-binary-tree-in-a-file/225</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/find-popular-element-in-an-array/224</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/increment-a-number-given-in-the-form-of-linked-list/223</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/rearrange-array-into-alternate-positive-and-negative-numbers/222</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/fix-loop-in-a-sorted-linked-list/221</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/compute-x-n-x-to-the-power-n/220</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/maximum-distance-with-50-bikes-each-having-fuel-capacity-of-100-kms/219</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/implement-stack-using-2-queues/218</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/implement-a-queue-using-two-stacks/217</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/implementing-queue-using-array/216</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/implementing-queue-using-linked-list/215</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/inserting-in-a-linked-list/214</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/understanding-stack-data-structure/213</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/array-implementation-of-stack/212</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/linked-list-implementation-of-stack-in-c/211</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/count-number-of-rectangles-on-a-chess-board/210</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/insertion-sort/209</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/selection-sort/208</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/optimized-bubble-sort-algorithm/207</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/binary-search-or-half-interval-search/206</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/linear-search-in-detail/205</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-all-leaf-nodes-of-a-binary-tree-are-at-same-level/204</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-a-binary-tree-is-complete-binary-tree/203</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/printing-without-changing-main-function/202</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/swapping-two-strings-in-c-language/201</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/find-the-output-of-c-program/200</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/print-characters-coming-in-only-one-of-the-2-strings-and-not-in-both/199</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/which-of-the-two-comparison-is-better/198</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/disallow-object-creation-on-heap-in-c/197</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/allow-only-dynamic-object-creation-on-heap/196</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/build-binary-tree-from-ancestor-matrics/195</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/print-both-diagonals-of-a-matrix/194</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/print-elements-of-a-matrix-in-diagonal-order/193</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/islands-in-a-two-dimensional-binary-array/192</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/hamming-distance/191</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/using-delete-operator-on-this-in-c/190</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/printing-boundary-nodes-of-binary-tree-counter-clockwise/189</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/number-of-null-pointers-in-a-binary-tree/188</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/sorting-a-linked-list/187</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/next-greater-power-of-2/186</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/non-recursive-solution-to-tower-of-hanoi/185</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/tower-of-hanoi-code/184</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/array-of-products-of-elements-except-current-elements/183</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/find-size-of-a-struct-without-using-sizeof-operator/182</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/implement-two-stacks-in-one-array/181</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/what-is-fork-how-are-processes-created-using-fork/180</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/sorting-a-linked-list-of-0s-1s-and-2s/179</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/print-first-non-repeating-character-in-the-string/178</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/adapter-design-pattern-wrapper/177</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/number-of-possible-triangles-from-given-array-of-numbers/176</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/facade-design-pattern/175</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/transpose-of-a-non-symmetric-matrix/174</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/find-non-repeating-number-in-an-array/173</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/multiton-design-pattern/172</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/object-pool-design-pattern/171</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/prototype-design-pattern/170</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/builder-design-pattern/169</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/abstract-factory-design-pattern/168</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/honest-man-playing-card-puzzle/167</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/chess-board-puzzle-queen-attacking-all-squares/166</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/using-sizeof-to-get-size-of-an-array-or-pointer/165</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/sizeof-operator-in-c-cpp-language/164</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/factory-design-pattern/163</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/output-of-c-program/162</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/rotating-a-linked-list-around-a-pivot/161</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/add-the-digits-of-a-number-in-single-statement/160</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/comma-operator-in-c-c/159</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/ages-of-three-children/158</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/difference-between-malloc-calloc-free-and-realloc-functions-in-c-language/157</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/print-boundary-nodes-of-a-tree/156</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/singleton-class-with-public-constructor/155</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/big-and-little-endian/154</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/add-two-integers-without-using-arithmetic-operator/153</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/print-most-frequent-character-in-a-string/152</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/longest-substring-of-unique-characters/151</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/hand-shake-puzzle/150</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/cheating-husbands-puzzle/149</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/order-of-evaluation-of-operands-in-c-cpp/148</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/difference-between-struct-and-class-in-c/147</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/dropping-eggs-puzzle/146</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/open-closed-principle-in-solid/145</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/remove-duplicates-from-a-linked-list/144</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/merging-two-linked-lists/143</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/find-number-occurring-odd-number-of-times-in-an-array/142</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/print-all-nodes-at-distance-k-from-root-of-a-binary-tree/141</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-a-binary-tree-is-binary-search-tree/140</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/convert-a-binary-tree-to-binary-search-tree/139</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/speed-and-time-question/138</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/number-series-question/137</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/lowest-common-ancestor-in-binary-search-tree/136</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/print-all-possible-root-to-leaf-paths-in-a-binary-tree/135</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/count-the-number-of-nodes-in-a-binary-tree/134</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/kadane-039-s-algorithm-to-find-maximum-subarray-sum/133</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-every-nodes-of-a-tree-has-only-one-child/132</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/detecting-loop-in-a-linked-list/131</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/searching-in-a-linked-list/130</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/delete-a-node-in-a-linked-list-whose-pointer-is-given/129</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/comparison-of-sorting-algoritms/128</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/majority-element-of-an-array-moore-039-s-algorithm/127</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/print-array-in-the-forward-and-backward-direction-recursively/126</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/print-all-repeating-characters-in-a-string/125</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/print-the-first-repeating-character-in-string/124</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/blue-eyed-islanders-puzzle/123</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/recursive-function-to-reverse-a-string/122</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-one-string-is-rotation-of-another/121</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/find-height-of-the-binary-tree/120</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/level-of-a-node-in-the-given-binary-tree/119</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/node-with-maximum-value-in-a-binary-search-tree/118</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-two-binary-trees-are-similar/117</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/deleting-a-binary-tree/116</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/syntax-of-main-in-c-c-language/115</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/find-kth-element-in-union-of-two-arrays/114</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/error-in-c-language-code/113</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/splitting-a-linked-list/112</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/finding-middle-element-of-linked-list-using-one-loop/111</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/value-of-expression/110</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/missing-and-repeating-number-in-an-array/109</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/singleton-design-pattern/108</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/memory-leaks-and-dangling-pointers/107</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/minimum-stack-stack-returning-min-element-in-o-1-time/106</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/one-definition-rule-odr-in-c/105</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/continuous-sub-array-with-given-sum/104</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-two-strings-are-anagrams/103</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/remove-duplicates-from-a-string/102</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/merge-two-arrays-into-one/101</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/lambda-functions-and-expressions-in-c-11/100</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/separate-nullptr-in-c-11/99</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/range-based-for-loop-of-c-11-similar-to-039-for-each-039/98</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/uniform-initializer-lists-in-c-11/97</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/c-11-feature-automatic-type-detection-and-decltype/96</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/permutations-of-list-of-elements-with-repeated-values/95</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/function-templates-in-c/94</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/changing-node-passed-to-a-function-as-argument/93</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/recursive-function-to-traverse-linked-list-in-reverse-order/92</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/number-of-inversions-in-an-array/91</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/making-both-elements-of-an-array-zero/90</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/output-of-a-recursive-function/89</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/run-length-encoding/88</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/work-amp-time-question/87</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/memory-efficient-doubly-linked-list/86</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/find-error-in-the-c-code/85</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/c-language-mcq/84</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/compare-asymptotic-complexities/83</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/freeing-memory-allocated-to-n-dim-array-using-free/82</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/time-and-speed-puzzle/81</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/how-to-swap-2-variables-without-using-a-third-variable/80</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/allocating-memory-to-n-dim-array-on-heap-in-c/79</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/burning-rope-puzzle/78</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/k-039-th-node-from-end-of-a-linked-list/77</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/divide-amp-conquer-approach-to-find-power-of-a-number-a-n/76</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/n-doors-puzzle/75</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/should-we-use-user-defined-type-conversions/74</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/user-defined-type-conversions-in-c-single-argument-constructor-amp-implicit-type-conversion-operator-function/73</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/difference-between-reference-amp-pointers-in-c/72</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/out-of-memory-condition-in-c-for-new-operator/71</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/print-ancestors-of-a-node-in-a-binary-tree-node/70</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/reversing-words-in-a-string/69</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/level-wise-traversal-of-a-binary-tree/68</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/sorting-1-billion-numbers/67</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/camel-amp-banana-puzzle/66</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/output-of-a-c-function/65</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-number-is-a-power-of-2/64</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/search-in-a-matrix-sorted-on-rows-amp-columns/63</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/value-of-i-i-or-i-i/62</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/difference-between-return-amp-exit-0/61</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-number-is-a-power-of-4/60</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/turn-off-the-rightmost-bit-of-an-integer/59</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/traversing-a-matrix-in-spiral-order/58</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/volatile-keyword-in-c-c/57</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/number-series-questions/56</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/delete-a-linked-list/55</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/insert-in-a-sorted-linked-list/54</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/const-keyword-in-cpp/53</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/recursive-function-to-reverse-a-linked-list/52</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/reversing-a-singly-linked-list/51</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/c-program-output/50</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/pass-by-reference-v-s-pass-by-value/49</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/rotating-an-array-around-a-pivot/48</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/compute-max-and-min-without-branching/47</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/difference-between-pop-amp-imap/46</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/diameter-of-a-tree/45</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/number-of-nodes-in-a-binary-tree-of-height-h/44</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/permutations-of-a-string-or-array/43</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/maximum-path-sum-in-a-matrix/42</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/crossing-the-bridge-in-17-min-puzzle/41</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-a-linked-list-is-palindrome/40</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/mirror-of-a-binary-tree/39</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/non-leaf-nodes-of-a-binary-tree/38</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/difference-between-linked-list-and-arrays/37</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/compute-polynomial-cn-x-n-cn-1-x-n-1-c2-x-2-c1-x-c0/36</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-parenthesis-are-matched-or-not/35</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/output-of-c-language-code/34</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/making-tree-from-traversals/33</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/basic-tree-traversals-preorder-inorder-postorder/32</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/understanding-recursion/31</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/has-path-sum-binary-tree/30</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/counting-leaf-nodes-of-a-binary-tree/29</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/checking-if-a-number-is-fibonacci/28</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/difference-between-typpedef-and-define/27</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/difference-between-lvalue-and-rvalue-expressions/26</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/3-basket-puzzle-apple-orange-puzzle/25</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/man-in-the-middle-attack-on-data-being-transferred-over-network/24</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/how-much-byte-addressable-memory-you-can-use-with-12-bits-address-bus/23</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/effect-on-area-of-a-triangle-if-base-is-increased-and-height-reduced/22</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-a-binary-tree-is-sub-tree-of-another/21</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/invert-traingle-made-from-6-circles/20</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/dynamic-cast-in-c/19</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/infix-prefix-amp-postfix-notations-polish-notations/18</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/computing-average-of-running-stream-of-numbers/17</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/delete-alternate-node-of-the-linked-list/16</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/recursive-function-to-find-sum-of-digits-in-a-number/15</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/sorting-a-binary-array-which-has-only-0-039-s-and-1-039-s/14</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/shift-elements-in-the-array-forward-by-k-places/13</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/node-with-minimum-value-in-a-binary-search-tree/12</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/print-all-interleaving-of-two-strings/11</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-a-number-is-a-palindrome/10</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/how-many-ip-addresses-are-available-in-ipv6/9</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/check-if-a-binary-tree-is-a-sum-tree-or-not/8</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/reversing-a-doubly-linked-list/7</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/inorder-successor-of-node-in-a-binary-tree/6</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/difference-between-tcp-amp-udp-protocol/5</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/number-of-squares-on-a-chess-board/4</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/difference-between-mac-address-and-ip-address/3</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/number-of-network-address-in-class-c-of-ipv4/2</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blog/details/test-code/1</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=code</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=networking</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=data-structure</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=linked-list</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=binary-tree</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=binary-search-tree-bst</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=heap-data-structure</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=graphs</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=hashmap</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=searching-algorithms</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=sorting-algorithms</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=dynamic-programming</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=greedy-approach</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=back-tracking-algorithms</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=bitwise-operations</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=logic-building-and-puzzles</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=mathematical-logic</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=arrays</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=strings</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=algorithms</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=c</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=java</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=microprocessor-amp-compiler</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=divide-and-conquer</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=time-and-space-complexities</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=sliding-window</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=object-oriented-design</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=high-level-design</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=trie</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=probability-and-statistice</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=artificial-intelligence</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=machine-learning</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=llm-large-language-models</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=c-language</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=python</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=stack-data-structure</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=queue</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=merging</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=education-article</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=data-base</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/blogs?category=subsequences</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/courses?category=coding-interviews</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/courses?category=code-analysis</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/courses?category=algorithm-techniques</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/courses?category=system-design-interviews</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/courses?category=lld-interviews-oops</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/courses?category=programing-languages</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/courses?category=python</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/courses?category=ai-ml-tech-stack</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/courses?category=core-computer-science</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/courses?category=logic-and-mathematics</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/course/time-space-complexity-analysis/1</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/course/detailed-memory-model/2</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/course/object-oriented-programming-in-c-and-java/3</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/course/python-fundamentals/4</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/course/test-niet2601m/5</loc><changefreq>monthly</changefreq><priority>0.8</priority></url><url><loc>https://www.ritambhara.in/home/course/master-the-two-pointer-technique-in-problem-solving/6</loc><changefreq>monthly</changefreq><priority>0.8</priority></url></urlset>
