<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9 http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd" xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://talktechie.com/posts/post1-n-plus-one-problem/</loc>
<lastmod>2026-05-26T00:02:22+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-arrays-best-time-to-buy-sell-stock/</loc>
<lastmod>2026-06-08T06:53:04+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-arrays-contains-duplicate/</loc>
<lastmod>2026-06-08T06:53:04+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-arrays-two-sum/</loc>
<lastmod>2026-06-08T06:50:32+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-series-index/</loc>
<lastmod>2026-06-19T09:37:56+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-arrays-maximum-subarray/</loc>
<lastmod>2026-06-08T06:53:04+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-arrays-product-except-self/</loc>
<lastmod>2026-06-08T06:53:04+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-linkedlist-linked-list-cycle/</loc>
<lastmod>2026-06-10T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-linkedlist-merge-two-sorted-lists/</loc>
<lastmod>2026-06-10T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-linkedlist-reverse-linked-list/</loc>
<lastmod>2026-06-10T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-dp-climbing-stairs/</loc>
<lastmod>2026-06-12T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-dp-coin-change/</loc>
<lastmod>2026-06-12T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-dp-house-robber/</loc>
<lastmod>2026-06-12T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-graphs-clone-graph/</loc>
<lastmod>2026-06-12T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-graphs-number-of-islands/</loc>
<lastmod>2026-06-12T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-trees-invert-binary-tree/</loc>
<lastmod>2026-06-12T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-trees-maximum-depth-binary-tree/</loc>
<lastmod>2026-06-12T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-trees-validate-bst/</loc>
<lastmod>2026-06-12T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-arrays-valid-anagram/</loc>
<lastmod>2026-06-15T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-arrays-encode-decode-strings/</loc>
<lastmod>2026-06-16T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-arrays-group-anagrams/</loc>
<lastmod>2026-06-16T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-arrays-longest-consecutive-sequence/</loc>
<lastmod>2026-06-16T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-arrays-top-k-frequent-elements/</loc>
<lastmod>2026-06-16T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-arrays-valid-sudoku/</loc>
<lastmod>2026-06-16T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-two-pointers-3sum/</loc>
<lastmod>2026-06-16T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-two-pointers-container-with-most-water/</loc>
<lastmod>2026-06-16T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-two-pointers-trapping-rain-water/</loc>
<lastmod>2026-06-16T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-two-pointers-two-sum-ii/</loc>
<lastmod>2026-06-16T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-two-pointers-valid-palindrome/</loc>
<lastmod>2026-06-16T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-stack-car-fleet/</loc>
<lastmod>2026-06-17T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-stack-daily-temperatures/</loc>
<lastmod>2026-06-17T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-stack-evaluate-reverse-polish-notation/</loc>
<lastmod>2026-06-17T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-stack-largest-rectangle-in-histogram/</loc>
<lastmod>2026-06-17T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-stack-min-stack/</loc>
<lastmod>2026-06-17T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-stack-valid-parentheses/</loc>
<lastmod>2026-06-17T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-binary-search-binary-search/</loc>
<lastmod>2026-06-18T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-binary-search-find-minimum-in-rotated-sorted-array/</loc>
<lastmod>2026-06-18T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-binary-search-koko-eating-bananas/</loc>
<lastmod>2026-06-18T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-binary-search-median-of-two-sorted-arrays/</loc>
<lastmod>2026-06-18T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-binary-search-search-a-2d-matrix/</loc>
<lastmod>2026-06-18T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-binary-search-search-in-rotated-sorted-array/</loc>
<lastmod>2026-06-18T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/posts/kotlin-dsa-binary-search-time-based-key-value-store/</loc>
<lastmod>2026-06-18T00:00:00+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/categories/</loc>
<lastmod>2026-06-19T09:42:10+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/tags/</loc>
<lastmod>2026-06-19T09:42:10+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/archives/</loc>
<lastmod>2026-06-19T09:42:10+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/about/</loc>
<lastmod>2026-06-19T09:42:10+05:30</lastmod>
</url>
<url>
<loc>https://talktechie.com/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/jpa/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/kotlin/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/spring-boot/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/n-1/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/hibernate/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/best-time-to-buy-sell-stock/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/sliding-window/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/easy/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-121/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/arrays/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/greedy/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/contains-duplicate/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/hashset/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-217/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/two-sum/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/hashmap/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-1/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/dsa/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/series/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/index/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/maximum-subarray/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/kadane/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/dynamic-programming/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/medium/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-53/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/product-of-array-except-self/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/prefix-product/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-238/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/linked-list-cycle/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/floyd/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/fast-slow-pointer/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/two-pointer/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-141/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/merge-two-sorted-lists/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/linked-list/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/recursion/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-21/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/reverse-linked-list/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-206/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/climbing-stairs/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/fibonacci/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-70/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/coin-change/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/bfs/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-322/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/house-robber/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-198/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/clone-graph/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/graph/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/dfs/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-133/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/number-of-islands/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-200/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/invert-binary-tree/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/binary-tree/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-226/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/maximum-depth-binary-tree/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-104/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/validate-binary-search-tree/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/bst/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/inorder/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-98/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/valid-anagram/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/array/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/frequency-count/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-242/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/encode-decode-strings/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/string/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/design/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/length-prefix/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-271/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/group-anagrams/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/sorting/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-49/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/longest-consecutive-sequence/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-128/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/top-k-frequent-elements/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/bucket-sort/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/heap/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-347/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/valid-sudoku/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/matrix/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-36/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/3sum/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/two-pointers/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-15/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/container-with-most-water/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-11/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/trapping-rain-water/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/hard/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-42/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/two-sum-ii/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/binary-search/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/sorted-array/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-167/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/valid-palindrome/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-125/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/car-fleet/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/stack/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/monotonic-stack/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-853/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/daily-temperatures/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-739/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/evaluate-reverse-polish-notation/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/math/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-150/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/largest-rectangle-in-histogram/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-84/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/min-stack/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-155/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/valid-parentheses/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-20/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-704/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/find-minimum-rotated-sorted-array/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-153/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/koko-eating-bananas/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/binary-search-on-answer/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-875/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/median-of-two-sorted-arrays/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/partition/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-4/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/search-a-2d-matrix/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-74/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/search-rotated-sorted-array/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-33/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/time-based-key-value-store/</loc>
</url>
<url>
<loc>https://talktechie.com/tags/leetcode-981/</loc>
</url>
<url>
<loc>https://talktechie.com/categories/spring-data-jpa/</loc>
</url>
<url>
<loc>https://talktechie.com/categories/kotlin/</loc>
</url>
<url>
<loc>https://talktechie.com/categories/kotlin-dsa/</loc>
</url>
<url>
<loc>https://talktechie.com/categories/arrays/</loc>
</url>
<url>
<loc>https://talktechie.com/categories/index/</loc>
</url>
<url>
<loc>https://talktechie.com/categories/linked-list/</loc>
</url>
<url>
<loc>https://talktechie.com/categories/dynamic-programming/</loc>
</url>
<url>
<loc>https://talktechie.com/categories/graphs/</loc>
</url>
<url>
<loc>https://talktechie.com/categories/trees/</loc>
</url>
<url>
<loc>https://talktechie.com/categories/two-pointers/</loc>
</url>
<url>
<loc>https://talktechie.com/categories/stack/</loc>
</url>
<url>
<loc>https://talktechie.com/categories/binary-search/</loc>
</url>
</urlset>
