<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Hitesh Patel · Full-Stack Software Developer: Koshly, Dayglass, EMI Loan Calculator on Hitesh Patel</title><link>https://hiteshbuilds.com/</link><description>Recent content in Hitesh Patel · Full-Stack Software Developer: Koshly, Dayglass, EMI Loan Calculator on Hitesh Patel</description><image><title>Hitesh Patel</title><url>https://hiteshbuilds.com/og-image.png</url><link>https://hiteshbuilds.com/og-image.png</link></image><generator>Hugo -- 0.161.1</generator><language>en-us</language><lastBuildDate>Fri, 13 Nov 2026 00:00:00 +0530</lastBuildDate><atom:link href="https://hiteshbuilds.com/index.xml" rel="self" type="application/rss+xml"/><item><title>How Do Authenticator Apps Work Without Internet? (TOTP Explained)</title><link>https://hiteshbuilds.com/blog/how-authenticator-apps-work-offline/</link><pubDate>Fri, 13 Nov 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blog/how-authenticator-apps-work-offline/</guid><description>Yes, authenticator apps work offline. Here&amp;#39;s how TOTP turns a shared secret and the current time into the same 6-digit code on your phone and the server.</description></item><item><title>Tic-Tac-Toe Minimax Algorithm in Java</title><link>https://hiteshbuilds.com/system-design/tic-tac-toe-minimax/</link><pubDate>Thu, 12 Nov 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/system-design/tic-tac-toe-minimax/</guid><description>Last time it took me 7 rules to make a bot I couldn&amp;#39;t beat. This time I deleted them all and used the minimax algorithm: one recursive function, in Java.</description></item><item><title>Unbeatable Tic-Tac-Toe AI: 7 Rules in Java</title><link>https://hiteshbuilds.com/system-design/tic-tac-toe-bot-strategy/</link><pubDate>Tue, 10 Nov 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/system-design/tic-tac-toe-bot-strategy/</guid><description>My first bot played like a blind swordsman. Every time I beat it, it learned a new rule - until I couldn&amp;#39;t beat it anymore.</description></item><item><title>Designing a Better SIP Reminder Experience</title><link>https://hiteshbuilds.com/blog/designing-a-better-sip-reminder-experience/</link><pubDate>Mon, 25 May 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blog/designing-a-better-sip-reminder-experience/</guid><description>A small product improvement focused on helping users better understand upcoming SIP debits and monthly investment activity.</description></item><item><title>Building Scalable Flutter Apps With Modules</title><link>https://hiteshbuilds.com/blog/building-scalable-flutter-apps-with-modules/</link><pubDate>Fri, 22 May 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blog/building-scalable-flutter-apps-with-modules/</guid><description>How modularization in Flutter helped to structure reusable, scalable, and maintainable features.</description></item><item><title>Introducing Portfolio Top Up for Mutual Fund Investments</title><link>https://hiteshbuilds.com/blog/top-up-your-mutual-fund-portfolio/</link><pubDate>Thu, 14 May 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blog/top-up-your-mutual-fund-portfolio/</guid><description>How we built Portfolio Top Up — a portfolio-level mutual fund investing experience with auto allocation, manual adjustments, and bulk order execution.</description></item><item><title>Parking Lot LLD — What I Learned Building It</title><link>https://hiteshbuilds.com/system-design/parking-lot-system-design-lld/</link><pubDate>Sun, 10 May 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/system-design/parking-lot-system-design-lld/</guid><description>Building a Parking Lot Low Level Design system taught me much more than object-oriented programming. Here are the mistakes, improvements, and design decisions I learned along the way.</description></item><item><title>Elevator System Design LLD - Active &amp; Shadow Queue</title><link>https://hiteshbuilds.com/system-design/elevator-system-design-lld-active-shadow-queue/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/system-design/elevator-system-design-lld-active-shadow-queue/</guid><description>A practical walkthrough of designing a single elevator system using active and shadow queue strategy.</description></item><item><title>Elevator System Design (LLD): Single Lift Scheduling Explained</title><link>https://hiteshbuilds.com/system-design/elevator-system-design-lld/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/system-design/elevator-system-design-lld/</guid><description>A practical walkthrough of designing a single elevator system using queues, state machines, and SCAN-like scheduling.</description></item><item><title>How to check if a string is a Valid Palindrome: O(n) two pointer solution explained</title><link>https://hiteshbuilds.com/blind-75/valid-palindrome/</link><pubDate>Tue, 17 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/valid-palindrome/</guid><description>Explanation with intuitions of how to check if a string is a palindrome by ignoring non-alphanumeric characters with two-pointer approach.</description></item><item><title>How to check Valid Parentheses: O(n) Stack solution explained</title><link>https://hiteshbuilds.com/blind-75/valid-parentheses/</link><pubDate>Mon, 16 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/valid-parentheses/</guid><description>Step by step explanation of how to validate bracket sequences using a stack, with dry run and C++ code</description></item><item><title>How to Group Anagrams: O(n · m log m) Solution Explained</title><link>https://hiteshbuilds.com/blind-75/group-anagrams/</link><pubDate>Fri, 13 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/group-anagrams/</guid><description>Step by step explanation of how to group anagrams together using sorting and hashmaps, with brute force and optimized solutions</description></item><item><title>How to find if string is Valid Anagram: O(n) solution explained</title><link>https://hiteshbuilds.com/blind-75/valid-anagram/</link><pubDate>Thu, 12 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/valid-anagram/</guid><description>Step by step explanation with how we found two string are anagrams or not with optimization</description></item><item><title>Minimum Window Substring: Sliding Window Explained</title><link>https://hiteshbuilds.com/blind-75/minimum-window-substring/</link><pubDate>Wed, 11 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/minimum-window-substring/</guid><description>Step by step explanation with how we reach the solution of how to find the minimum window substring using Brute Force and Sliding Window</description></item><item><title>Longest Repeating Character Replacement: Sliding Window Explained</title><link>https://hiteshbuilds.com/blind-75/longest-repeating-character-replacement/</link><pubDate>Tue, 10 Mar 2026 12:12:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/longest-repeating-character-replacement/</guid><description>Step by step explanation of how to find the longest repeating character replacement using Brute Force and Sliding Window using hashtable</description></item><item><title>Longest Substring Without Repeating Characters: Sliding Window Explained</title><link>https://hiteshbuilds.com/blind-75/longest-substring-without-repeating-characters/</link><pubDate>Mon, 09 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/longest-substring-without-repeating-characters/</guid><description>Step by step explanation of how to find the longest substring without repeating characters using Brute Force and Sliding Window, including optimization techniques.</description></item><item><title>Remove Nth Node from the End of the Linked List (Blind 75)</title><link>https://hiteshbuilds.com/blind-75/remove-nth-node-from-end-of-list/</link><pubDate>Fri, 06 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/remove-nth-node-from-end-of-list/</guid><description>Learn how to remove the Nth node from the end of a linked list in a single pass using the two-pointer (Tortoise and Hare) technique.</description></item><item><title>Merge two sorted linked list (Blind 75)</title><link>https://hiteshbuilds.com/blind-75/merge-two-sorted-list/</link><pubDate>Wed, 04 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/merge-two-sorted-list/</guid><description>Step-by-step guide to merge two sorted linked lists efficiently. Compare nodes one by one, handle edge cases, and build a single sorted list.</description></item><item><title>How to Detect a Cycle in a Linked List (Blind 75)</title><link>https://hiteshbuilds.com/blind-75/linked-list-cycle/</link><pubDate>Mon, 02 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/linked-list-cycle/</guid><description>Explanation how to efficiently detect a cycle in a linked list using Floyd’s Cycle Detection algorithm.</description></item><item><title>How to Reverse a Linked List (Blind 75)</title><link>https://hiteshbuilds.com/blind-75/reverse-linked-list/</link><pubDate>Sat, 28 Feb 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/reverse-linked-list/</guid><description>Detailed guide to reversing a linked list using the three-pointer approach, both recursively and iteratively.</description></item><item><title>Word Search (Blind 75): DFS + Backtracking Explained</title><link>https://hiteshbuilds.com/blind-75/word-search/</link><pubDate>Thu, 26 Feb 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/word-search/</guid><description>Step by step explanation of how to find a given word in a grid using DFS and backtracking, including optimization techniques.</description></item><item><title>Rotate Image (Blind 75): 90° Matrix Rotation Explained</title><link>https://hiteshbuilds.com/blind-75/rotate-image/</link><pubDate>Tue, 24 Feb 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/rotate-image/</guid><description>How to rotate a matrix 90 degrees clockwise in-place using transpose and reverse. without using extra space</description></item><item><title>Spiral Matrix (Blind 75): Matrix traversal in spiral order</title><link>https://hiteshbuilds.com/blind-75/spiral-matrix/</link><pubDate>Sun, 22 Feb 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/spiral-matrix/</guid><description>Explanation of how to traverse a matrix in spiral order with a clean and efficient approach.</description></item><item><title>Set Matrix Zeroes (Blind 75): O(1) Space Solution</title><link>https://hiteshbuilds.com/blind-75/set-matrix-zeroes/</link><pubDate>Fri, 20 Feb 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/set-matrix-zeroes/</guid><description>If an matrix element contains zero we need to set its entire row and column to zero without using any extra space</description></item><item><title>Find the container with most water (Blind 75) — O(n) Solution</title><link>https://hiteshbuilds.com/blind-75/container-most-water/</link><pubDate>Tue, 17 Feb 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/container-most-water/</guid><description>Step by step thought process for how to find the two lines such that they contain most water using two pointer approach</description></item><item><title>Three Sum (Blind 75) — O(n²) Solution</title><link>https://hiteshbuilds.com/blind-75/three-sum/</link><pubDate>Sun, 15 Feb 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/three-sum/</guid><description>A complete breakdown of finding unique triplets that sum to zero — from the brute force approach to reducing Three Sum into a Two Sum problem for an optimal O(n²) solution.</description></item><item><title>Search in Rotated Sorted Array (Blind 75) — O(log n) Solution</title><link>https://hiteshbuilds.com/blind-75/search-in-rotated-sorted-array/</link><pubDate>Fri, 13 Feb 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/search-in-rotated-sorted-array/</guid><description>A complete breakdown of searching an element from an rotated sorted array. Starting from brute force to using binary search for optimal solution.</description></item><item><title>Blind 75: Find Minimum in Rotated Sorted Array — Understanding Binary Search Deeper</title><link>https://hiteshbuilds.com/blind-75/find-minimum-in-rotated-sorted-array/</link><pubDate>Wed, 11 Feb 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/find-minimum-in-rotated-sorted-array/</guid><description>A complete breakdown of finding the minimum element from an roated sorted array from Blind 75 List. Starting from brute force to using binary search for optimal solution.</description></item><item><title>Blind 75: Best Time to Buy and Sell Stock — One Pass Solution Explained</title><link>https://hiteshbuilds.com/blind-75/best-time-to-buy-and-sell-stock/</link><pubDate>Fri, 06 Feb 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/best-time-to-buy-and-sell-stock/</guid><description>A complete breakdown of the Best Time to Buy and Sell Stock problem from the Blind 75 list, starting with brute force, analyzing failed approaches, and arriving at the optimal one-pass solution.</description></item><item><title>Blind 75: Two Sum — From Brute Force to Hash Map</title><link>https://hiteshbuilds.com/blind-75/two-sum/</link><pubDate>Mon, 26 Jan 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/two-sum/</guid><description>A step-by-step breakdown of how I approached the Two Sum problem in the Blind 75 list, starting from brute force, rejecting incorrect optimizations, and arriving at the optimal hash map solution.</description></item><item><title>Stop Nesting If Statements. Use Guard Clauses</title><link>https://hiteshbuilds.com/blog/stop-nesting-if-statements/</link><pubDate>Mon, 26 Jan 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blog/stop-nesting-if-statements/</guid><description>Nested if statement works, but they are not readable and make debugging a nightmare. There are better ways to handle things — use guard clauses.</description></item><item><title>9 Dart Syntactic Sugar Features That Make My Codebase Happier</title><link>https://hiteshbuilds.com/blog/9-dart-syntactic-sugar-features/</link><pubDate>Thu, 15 Jan 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blog/9-dart-syntactic-sugar-features/</guid><description>9 Dart Syntactic Sugar I Can’t Live Without – Features That Make My Flutter Development Easier</description></item><item><title>Queues — The Backbone of Modern Architecture</title><link>https://hiteshbuilds.com/blog/queues-backbone-of-modern-architecture/</link><pubDate>Thu, 23 Oct 2025 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blog/queues-backbone-of-modern-architecture/</guid><description>Understand how message queues form the backbone of modern distributed systems — enabling scalability, fault tolerance, and smooth communication between services.</description></item><item><title>Securely Accessing Private RDS Databases Using SSH Tunneling and a Bastion Host</title><link>https://hiteshbuilds.com/blog/secure-access-private-rds-ssh-tunneling-bastion-host/</link><pubDate>Sun, 05 Oct 2025 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blog/secure-access-private-rds-ssh-tunneling-bastion-host/</guid><description>Learn how to securely access a private AWS RDS database using SSH tunneling through a bastion host — a secure, cost-effective setup that avoids Elastic IP charges.</description></item><item><title>How We Streamlined Support Replies Using LLMs and RAG</title><link>https://hiteshbuilds.com/blog/how-we-streamlined-support-replies-using-llms-and-rag/</link><pubDate>Tue, 05 Aug 2025 23:23:48 +0530</pubDate><guid>https://hiteshbuilds.com/blog/how-we-streamlined-support-replies-using-llms-and-rag/</guid><description>&lt;p&gt;While helping our support team to resolve a client query, and joking about how AI will replace developers, and the support team no longer needs us. I found out that they also use ChatGPT to draft replies, making them more professional and formal.&lt;/p&gt;
&lt;p&gt;On diving deep, I found out a few problems they face consistently&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;repetitive replies&lt;/li&gt;
&lt;li&gt;Time wasted on formatting the response&lt;/li&gt;
&lt;li&gt;Inconsistency in tone and writing style in the response&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;We decided to make this streamlined so that they don’t have to leave the support panel, and build a chat assistance for the team&lt;/p&gt;</description></item><item><title>How did I host my own blog Ghost CMS + AWS</title><link>https://hiteshbuilds.com/blog/how-did-i-host-my-own-blog-ghost-cms-aws/</link><pubDate>Sun, 06 Jul 2025 22:09:00 +0530</pubDate><guid>https://hiteshbuilds.com/blog/how-did-i-host-my-own-blog-ghost-cms-aws/</guid><description>&lt;p&gt;After exploring Hashnode, Dev.to, and Medium, I decided to self-host my blog, not for performance, but for control. Here&amp;rsquo;s how I did it with AWS, Ghost, and a minimal budget.&lt;/p&gt;
&lt;p&gt;🧰 TL;DR: Self-hosted my Ghost blog on AWS EC2 (t2.micro) using a custom Nginx setup with /blog routed. Faced installation challenges due to CPU limits, solved it with a t2.large temp instance.&lt;/p&gt;
&lt;p&gt;How It All Started&lt;/p&gt;
&lt;p&gt;It all started when I was in college and watched a video by Quincy Larson, creator of FreeCodeCamp, about why developers must have a blog. So I started geekaid.in. After writing on it for a while, I dropped it a year ago as it stopped aligning with what I originally thought of.&lt;/p&gt;</description></item><item><title>Android's Shift to 16Kb Page Size - What It Means for Developers</title><link>https://hiteshbuilds.com/blog/androids-shift-to-16kb-page-size/</link><pubDate>Mon, 22 Jul 2024 11:02:06 +0530</pubDate><guid>https://hiteshbuilds.com/blog/androids-shift-to-16kb-page-size/</guid><description>&lt;p&gt;Recently, i opened my linked in and everyone is talking about the update by AOSP (Android Open Source Project) is transitioning from using 4KB memory pages to 16KB. While reading many posts i got learned this will lead to performance boosts, To know more i dive a littler deeper.&lt;/p&gt;
&lt;p&gt;After reading the official post, here’s what I found:&lt;/p&gt;
&lt;p&gt;What’s Changing?&lt;/p&gt;
&lt;p&gt;The 16KB page size is supported only on ARM64 architecture and device running Android 15 and above.&lt;/p&gt;</description></item></channel></rss>