<?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>Interview-Prep on Hitesh Patel</title><link>https://hiteshbuilds.com/tags/interview-prep/</link><description>Recent content in Interview-Prep on Hitesh Patel</description><generator>Hugo -- 0.155.3</generator><language>en-us</language><lastBuildDate>Tue, 17 Mar 2026 00:00:00 +0530</lastBuildDate><atom:link href="https://hiteshbuilds.com/tags/interview-prep/index.xml" rel="self" type="application/rss+xml"/><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></channel></rss>