<feed xmlns="http://www.w3.org/2005/Atom"> <id>https://talktechie.com/</id><title>TalkTechie</title><subtitle>TalkTechie is a tech blog covering Spring Boot, Kotlin, AI/ML concepts and practical tech tips for engineers.</subtitle> <updated>2026-05-31T14:27:42+05:30</updated> <author> <name>TalkTechie</name> <uri>https://talktechie.com/</uri> </author><link rel="self" type="application/atom+xml" href="https://talktechie.com/feed.xml"/><link rel="alternate" type="text/html" hreflang="en" href="https://talktechie.com/"/> <generator uri="https://jekyllrb.com/" version="4.4.1">Jekyll</generator> <rights> © 2026 TalkTechie </rights> <icon>/assets/img/favicons/favicon.ico</icon> <logo>/assets/img/favicons/favicon-96x96.png</logo> <entry><title>Kotlin DSA Series — Complete Index</title><link href="https://talktechie.com/posts/kotlin-dsa-series-index/" rel="alternate" type="text/html" title="Kotlin DSA Series — Complete Index" /><published>2026-05-30T00:00:00+05:30</published> <updated>2026-05-30T10:16:08+05:30</updated> <id>https://talktechie.com/posts/kotlin-dsa-series-index/</id> <content type="text/html" src="https://talktechie.com/posts/kotlin-dsa-series-index/" /> <author> <name>TalkTechie</name> </author> <category term="Kotlin DSA" /> <category term="Index" /> <summary>A complete Data Structures &amp;amp; Algorithms series written in idiomatic Kotlin. Not Java translated to .kt — real Kotlin the way it’s meant to be written. 🟢 Phase 1 — Arrays LC # Problem Difficulty Post #1 Two Sum Easy Read → #121 Best Time to Buy and Sell Stock Easy Read → ...</summary> </entry> <entry><title>Arrays: Two Sum — Kotlin Solution</title><link href="https://talktechie.com/posts/kotlin-dsa-arrays-two-sum/" rel="alternate" type="text/html" title="Arrays: Two Sum — Kotlin Solution" /><published>2026-05-30T00:00:00+05:30</published> <updated>2026-05-30T10:16:08+05:30</updated> <id>https://talktechie.com/posts/kotlin-dsa-arrays-two-sum/</id> <content type="text/html" src="https://talktechie.com/posts/kotlin-dsa-arrays-two-sum/" /> <author> <name>TalkTechie</name> </author> <category term="Kotlin DSA" /> <category term="Arrays" /> <summary>Problem Info     LeetCode # 1 — Two Sum Difficulty Easy Topic Arrays, HashMap Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. Example: Input: nums = [2, 7, 11, 15], target = 9 Output: [0, 1] // nums[0] + nums[1] = 2 + ...</summary> </entry> <entry><title>Arrays: Contains Duplicate — Kotlin Solution</title><link href="https://talktechie.com/posts/kotlin-dsa-arrays-contains-duplicate/" rel="alternate" type="text/html" title="Arrays: Contains Duplicate — Kotlin Solution" /><published>2026-05-30T00:00:00+05:30</published> <updated>2026-05-30T00:00:00+05:30</updated> <id>https://talktechie.com/posts/kotlin-dsa-arrays-contains-duplicate/</id> <content type="text/html" src="https://talktechie.com/posts/kotlin-dsa-arrays-contains-duplicate/" /> <author> <name>TalkTechie</name> </author> <category term="Kotlin DSA" /> <category term="Arrays" /> <summary>Problem Info     LeetCode # 217 — Contains Duplicate Difficulty Easy Topic Arrays, HashSet Given an integer array nums, return true if any value appears at least twice. Example: Input: nums = [1, 2, 3, 1] Output: true Input: nums = [1, 2, 3, 4] Output: false Approach Use a HashSe...</summary> </entry> <entry><title>Arrays: Best Time to Buy and Sell Stock — Kotlin Solution</title><link href="https://talktechie.com/posts/kotlin-dsa-arrays-best-time-to-buy-sell-stock/" rel="alternate" type="text/html" title="Arrays: Best Time to Buy and Sell Stock — Kotlin Solution" /><published>2026-05-30T00:00:00+05:30</published> <updated>2026-05-30T00:00:00+05:30</updated> <id>https://talktechie.com/posts/kotlin-dsa-arrays-best-time-to-buy-sell-stock/</id> <content type="text/html" src="https://talktechie.com/posts/kotlin-dsa-arrays-best-time-to-buy-sell-stock/" /> <author> <name>TalkTechie</name> </author> <category term="Kotlin DSA" /> <category term="Arrays" /> <summary>Problem Info     LeetCode # 121 — Best Time to Buy and Sell Stock Difficulty Easy Topic Arrays, Greedy, Sliding Window Given an array prices where prices[i] is the price on day i, return the maximum profit from a single buy-sell transaction. Example: Input: prices = [7, 1, 5, 3, 6, 4] O...</summary> </entry> <entry><title>I Wrote Raw SQL for Years. Then JPA Surprised Me.</title><link href="https://talktechie.com/posts/post1-n-plus-one-problem/" rel="alternate" type="text/html" title="I Wrote Raw SQL for Years. Then JPA Surprised Me." /><published>2026-05-25T00:00:00+05:30</published> <updated>2026-05-26T00:02:22+05:30</updated> <id>https://talktechie.com/posts/post1-n-plus-one-problem/</id> <content type="text/html" src="https://talktechie.com/posts/post1-n-plus-one-problem/" /> <author> <name>talktechie</name> </author> <category term="Spring Data JPA" /> <category term="Kotlin" /> <summary>For most of my career, I wrote raw SQL. Not because I was stubborn about it — I just understood it. I knew exactly what was hitting the database. I could read the query, predict the result, and tune it when something was slow. There was no mystery. Then I moved to a project using Spring Data JPA. And I discovered that when you hand query control to a framework, the surprises come fast — espec...</summary> </entry> </feed>
