<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/overview</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/memory-optimization-cache-aware-algorithms/what-are-cache-oblivious-algorithms-and-how-do-they-optimize-performance-in-modern-architectures-provide-examples-of-related-data-structures-and-algorithms</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/testing-and-debugging-algorithms/how-do-you-test-and-verify-algorithm-and-data-structure-correctness-especially-in-complex-or-concurrent-scenarios</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/performance-tuning-and-profiling/how-can-self-tuning-algorithms-adjust-parameters-based-on-input-data-and-hardware-simplifying-development-and-improving-performance</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/computational-geometry/what-are-advanced-geometric-algorithms-and-how-are-they-applied-in-computer-graphics-robotics-and-geographic-information-systems</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/advanced-algorithm-design-and-system-optimization/how-do-you-design-algorithms-and-data-structures-for-handling-datasets-larger-than-memory-explore-external-memory-streaming-and-distributed-processing-techniques</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/advanced-distributed-computing-and-blockchain/what-is-the-byzantine-generals-problem-and-how-do-byzantine-fault-tolerance-algorithms-like-practical-byzantine-fault-tolerance-and-tendermint-address-it-in-blockchain-what-are-their-scalability-and-complexity-limitations</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/sorting-algorithms/bubble-sort</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/sorting-algorithms/selection-sort</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/sorting-algorithms/insertion-sort</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/sorting-algorithms/merge-sort</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/sorting-algorithms/quick-sort</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/sorting-algorithms/heap-sort</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/sorting-algorithms/counting-sort</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/sorting-algorithms/radix-sort</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/searching-algorithms/linear-search</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/searching-algorithms/binary-search</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/searching-algorithm/ternary-search</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/searching-algorithms/jump-search</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/searching-algorithms/interpolation-search</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/searching-algorithms/exponential-search</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/searching-algorithms/hashing-based-search</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/searching-algorithms/trie-prefix-tree</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/searching-algorithms/b-trees</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dynamic-programming/fibonacci-series</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dynamic-programming/knapsack-problem</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dynamic-programming/longest-common-subsequences</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dynamic-programming/longest-increasing-subsequences</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dynamic-programming/matrix-chain-multiplication</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dynamic-programming/coin-change-problem</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dynamic-programming/rod-cutting-problem</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dynamic-programming/edit-distance</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/arrays-linked-list/Arrays</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/arrays-linked-list/dynamic-array</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/arrays-linked-list/linked-list</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/arrays-linked-list/singly-linked-list</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/arrays-linked-list/doubly-link-list</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/arrays-linked-list/circular-linked-list</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/stacks-and-queues/stack</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/stacks-and-queues/queue</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/stacks-and-queues/deque</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/stacks-and-queues/priority-queue</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/graph-algorithms/breadth-first-search-bfs</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/graph-algorithms/depth-first-search-dfs</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/graph-algorithms/dijkstras-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/graph-algorithms/page-rank-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/graph-algorithms/floydWarshall-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/graph-algorithms/bellman-ford-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/graph-algorithms/prims-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/graph-algorithms/kruskals-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/graph-algorithms/topological-sorting</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/graph-algorithms/a-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/graph-algorithms/disjoint-set</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/hashing/hash-table</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/hashing/hash-function</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/hashing/hash-collision</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/hashing/hash-maps</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/hashing/hash-set</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/hashing/perfect-hashing-algorithms</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/hashing/robinhood-hashing-algorithms</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/hashing/hopscotch-hashing-algorithms</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/hashing/cuckoo-hashing-algorithms</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/hashing/two-level-hashing</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/hashing/string-hashing</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/greedy-algorithms/activity-selection-problem</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/greedy-algorithms/huffman-encoding</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/greedy-algorithms/fractional-knapsack-problem</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/greedy-algorithms/job-sequencing-problem</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/greedy-algorithms/prims-and-kruskals-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/greedy-algorithms/egyptian-fraction-representation</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/greedy-algorithms/interval-scheduling-maximization</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/backtracking/n-queens-problem</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/backtracking/suduko-solver</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/backtracking/rats-in-a-maze</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/backtracking/word-search</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/backtracking/hamiltonian-cycle</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/tree-bst-algorithms/inorder-preorder-postorder-traversal</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/tree-bst-algorithms/level-order-traversal</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/tree-bst-algorithms/lowest-common-ancestor</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/tree-bst-algorithms/diameter-of-a-tree</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/tree-bst-algorithms/balanced-binary-tree-check</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/tree-bst-algorithms/binary-search-tree-bst-operations</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/tree-bst-algorithms/trie-data-structure</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/tree-bst-algorithms/segment-and-fenwick-tree</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/bloom-filter</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/bloomier-filter</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/counting-bloom-filter</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/stable-bloom-filter</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/skip-bloom-filter</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/bloom-clock</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/xor-filter</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/quotient-filter</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/cuckoo-filter</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/hyper-log-log</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/bjkst-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/count-min-sketch</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/skip-list</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/graph-sketching</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/graph-sketch</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/space-saving-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/t-digest</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/count-sketch</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/wavelet-tree</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/exponential-histogram</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/probabilistics-data-structures-algorithms/succinct-range-filter</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/bit-manipulations/count-set-bits-in-an-integer-brian-kernighans-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/bit-manipulations/find-the-only-non-repeating-number-in-an-array</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/bit-manipulations/find-xor-from-1-to-n</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/bit-manipulations/count-the-number-of-bits-needed-to-flip-to-convert-a-to-b</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/bit-manipulations/find-the-missing-number-in-an-array-1-to-n</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/bit-manipulations/check-if-a-number-is-power-of-2</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/bit-manipulations/reverse-bits-of-a-number</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/bit-manipulations/find-the-position-of-the-only-set-bit</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/bit-manipulations/xor-swap-technique</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/string-algorithms/aho-corasick-algorithm-multi-pattern-matching-using-trie-bfs</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/string-algorithms/boyer-moore-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/string-algorithms/knuth-morris-pratt-kmp-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/string-algorithms/longest-common-prefix-lcp-using-binary-search</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/string-algorithms/manachers-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/string-algorithms/rabin-karp-algorithm-rolling-hashing</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/string-algorithms/z-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/heap-algorithms/kth-largest-or-smallest-elements-or-element-in-an-array</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/heap-algorithms/max-heap-and-min-heap-implementation</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/heap-algorithms/median-in-a-stream-of-integers</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/heap-algorithms/merge-k-sorted-lists-using-heap</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/heap-algorithms/priority-queue-using-heap</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/blockchain/directed-acyclic-graph</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/blockchain/merkle-tree</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/blockchain/patricia-trie</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/blockchain/utree-xo</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/cryptography/elliptic-curve-cryptography-ecc</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/cryptography/verkle-tree</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/cryptography/commitment</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/nfts/directed-graph</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/nfts/ipfs-merkle-DAG</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/nfts/sparse-merkle-trie</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/defi-smart-contracts/heap-priority-queue</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/defi-smart-contracts/red-black-tree-avl-tree</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/defi-smart-contracts/sparse-merkle-tree</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/consensus-algorithms/directed-acyclic-graph-DAG-based-consensus</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/consensus-algorithms/delegated-proof-of-stake-DPoS</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/consensus-algorithms/hybrid-PoW-PoS</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/consensus-algorithms/practical-byzantine-fault-tolerance-PBFT</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/consensus-algorithms/proof-of-authority-PoA</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/consensus-algorithms/proof-of-burn-PoB</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/consensus-algorithms/proof-of-elapsed-time-PoET</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/consensus-algorithms/proof-of-history-PoH</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/consensus-algorithms/proof-of-humanity-PoH</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/consensus-algorithms/proof-of-space-and-proof-of-time-PoST-Pot</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/consensus-algorithms/proof-of-stake-PoS</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/consensus-algorithms/proof-of-work-PoW</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/nft-specific-algorithms/minting-and-ownership-algorithms</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/nft-specific-algorithms/NFT-trading-and-marketplace-algorithms</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/nft-specific-algorithms/NFT-interoperability-and-cross-chain-bridges</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/nft-specific-algorithms/NFT-privacy-and-security-algorithms</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/defi-algorithms/automated-market-maker-amm-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/defi-algorithms/bonding-curves</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/defi-algorithms/cross-chain-and-interoperability-algorithms</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/defi-algorithms/flash-loan-algorithms-for-instant-no-collateral-borrowing</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/defi-algorithms/governance-algorithms-for-DAO-based-decision-making</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/defi-algorithms/insurance-and-risk-management-algorithms</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/defi-algorithms/lending-protocol-interest-rate-algorithms</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/defi-algorithms/liquidity-management-algorithms</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/defi-algorithms/mev-miner-extractable-value-algorithms</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/defi-algorithms/oracle-algorithms</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/defi-algorithms/yield-farming-and-staking-algorithms</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/cryptographic-algorithms/hashing-algorithms-one-way-encryption</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/cryptographic-algorithms/key-exchange-protocols-for-secure-communication</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/cryptographic-algorithms/post-quantum-cryptography-future-proof-security</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/cryptographic-algorithms/public-key-cryptography-asymmetric-encryption</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/cryptographic-algorithms/symmetric-encryption-for-data-privacy-and-secure-storage</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/cryptographic-algorithms/zero-knowledge-proofs-ZKPs</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/cache-eviction-strategies/least-recently-used</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/cache-eviction-strategies/least-frequently-used</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/cache-eviction-strategies/first-in-first-out</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/cache-eviction-strategies/random-replacement</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/cache-eviction-strategies/most-recently-used</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/cache-eviction-strategies/time-to-live</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/cache-eviction-strategies/two-tiered-caching</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/system-design-algorithms/bloom-filter</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/system-design-algorithms/geohash</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/system-design-algorithms/hyperloglog</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/system-design-algorithms/consistent-hashing</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/system-design-algorithms/merkle-tree</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/system-design-algorithms/raft-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/system-design-algorithms/lossy-count</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/system-design-algorithms/quadTree</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/system-design-algorithms/operational-transformation</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/system-design-algorithms/leaky-bucket</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/system-design-algorithms/rsync</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/system-design-algorithms/ray-casting</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/terminologies/time-and-space-complexity-analysis</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/terminologies/big-o-mega-and-theta-notations</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/indexing-a-of-i</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/pointer-notation</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/big-o-notation</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/little-o-notation</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/little-omega-notation</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/omega-notation</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/theta-notation</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/adjacency-list</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/adjacency-matrix</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/degree-deg-v</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/graph-representation</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/factorial</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/logarithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/summation</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/master-theorem-notation</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/binary-tree</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/height-of-a-tree</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dsa-notation/pre-order-in-order-post-order</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/static-load-balancing-algorithms/round-robin-technique</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/static-load-balancing-algorithms/weighted-round-robin-technique</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/static-load-balancing-algorithms/ip-hashing-technique</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/static-load-balancing-algorithms/least-connections-technique</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/static-load-balancing-algorithms/weighted-least-connections-technique</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dynamic-load-balancing-algorithms/least-response-time-technique</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dynamic-load-balancing-algorithms/adaptive-load-balancing-technique</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dynamic-load-balancing-algorithms/resource-based-boad-balancing-technique</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dynamic-load-balancing-algorithms/consistent-hashing-technique</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dynamic-load-balancing-algorithms/ai-ml-based-load-balancing-technique</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dynamic-load-balancing-algorithms/chandy-lamport-snapshot-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/dynamic-load-balancing-algorithms/tanenbaums-token-ring-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/distributed-systems-consensus-algorithms/paxos-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/distributed-systems-consensus-algorithms/raft-algorithm</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/distributed-systems-consensus-algorithms/byzantine-fault-tolerance</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/distributed-systems-consensus-algorithms/gossip-protocol</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
  <url>
     <loc>https://nellutlalnrao.com/tech/dsa/distributed-systems-consensus-algorithms/vector-clocks-and-lamport-timestamps</loc>
     <lastmod>2025-07-31</lastmod>
     <changefreq>daily</changefreq>
     <priority>1.0</priority>
  </url>
</urlset>