<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Path: Patterns on Tech Interview Prep</title>
    <link>https://pankajpipada.com/tech-interview-prep/patterns/</link>
    <description>Recent content in Path: Patterns on Tech Interview Prep</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <copyright>Copyright © 2016-Present Pankaj Pipada. All Rights Reserved.</copyright>
    <atom:link href="https://pankajpipada.com/tech-interview-prep/patterns/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Problems</title>
      <link>https://pankajpipada.com/tech-interview-prep/patterns/problems/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://pankajpipada.com/tech-interview-prep/patterns/problems/</guid>
      <description>&lt;h1 id=&#34;patterns-problems&#34;&gt;Patterns: Problems&lt;a class=&#34;anchor&#34; href=&#34;#patterns-problems&#34;&gt;#&lt;/a&gt;&lt;/h1&gt;&#xA;&lt;p&gt;Patterns cut across data structures and show up frequently in interviews.&lt;/p&gt;&#xA;&#xA;  &lt;ul&gt;&lt;li&gt;&#xA;        &lt;a href=&#34;#backtracking&#34;&gt;Backtracking&lt;/a&gt;&#xA;        (3)&#xA;      &lt;/li&gt;&lt;li&gt;&#xA;        &lt;a href=&#34;#bfs&#34;&gt;Bfs&lt;/a&gt;&#xA;        (1)&#xA;      &lt;/li&gt;&lt;li&gt;&#xA;        &lt;a href=&#34;#dynamic-programming&#34;&gt;Dynamic Programming&lt;/a&gt;&#xA;        (1)&#xA;      &lt;/li&gt;&lt;li&gt;&#xA;        &lt;a href=&#34;#hashing&#34;&gt;Hashing&lt;/a&gt;&#xA;        (3)&#xA;      &lt;/li&gt;&lt;li&gt;&#xA;        &lt;a href=&#34;#intervals&#34;&gt;Intervals&lt;/a&gt;&#xA;        (5)&#xA;      &lt;/li&gt;&lt;li&gt;&#xA;        &lt;a href=&#34;#mark-and-sweep&#34;&gt;Mark and Sweep&lt;/a&gt;&#xA;        (2)&#xA;      &lt;/li&gt;&lt;li&gt;&#xA;        &lt;a href=&#34;#sliding-window&#34;&gt;Sliding Window&lt;/a&gt;&#xA;        (3)&#xA;      &lt;/li&gt;&lt;li&gt;&#xA;        &lt;a href=&#34;#two-pointers&#34;&gt;Two Pointers&lt;/a&gt;&#xA;        (1)&#xA;      &lt;/li&gt;&lt;li&gt;&#xA;        &lt;a href=&#34;#union-find&#34;&gt;Union Find&lt;/a&gt;&#xA;        (2)&#xA;      &lt;/li&gt;&lt;/ul&gt;&#xA;&#xA;  &lt;h2 id=&#34;backtracking&#34;&gt;Backtracking&lt;/h2&gt;&#xA;&#xA;    &lt;ul&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/add-and-search-word/&#34;&gt;Add and search word - data structure design&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/word-search/&#34;&gt;Word search&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/word-search-ii/&#34;&gt;Word search II&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;h2 id=&#34;bfs&#34;&gt;Bfs&lt;/h2&gt;&#xA;&#xA;    &lt;ul&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/level-order-binary-tree-insert/&#34;&gt;Insert Into Complete Binary Tree (Level-Order)&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;h2 id=&#34;dynamic-programming&#34;&gt;Dynamic Programming&lt;/h2&gt;&#xA;&#xA;    &lt;ul&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/count-distinct-subsequences/&#34;&gt;Count Distinct Subsequences&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;h2 id=&#34;hashing&#34;&gt;Hashing&lt;/h2&gt;&#xA;&#xA;    &lt;ul&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/bigram-model-next-word-prediction/&#34;&gt;Bigram Model - Next Word Prediction&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/set-card-game-validate-find/&#34;&gt;SET Card Game - Validate Set And Find Set&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/verify-lexicographic-sort-custom/&#34;&gt;Verify Lexicographic Sort With Custom Alphabet&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;h2 id=&#34;intervals&#34;&gt;Intervals&lt;/h2&gt;&#xA;&#xA;    &lt;ul&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/insert-interval/&#34;&gt;Insert interval&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/meeting-rooms/&#34;&gt;Meeting rooms&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/meeting-rooms-ii/&#34;&gt;Meeting rooms II&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/merge-intervals/&#34;&gt;Merge intervals&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/non-overlapping-intervals/&#34;&gt;Non overlapping intervals&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;h2 id=&#34;mark-and-sweep&#34;&gt;Mark and Sweep&lt;/h2&gt;&#xA;&#xA;    &lt;ul&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/eval-precedence-expression/&#34;&gt;Evaluate Precedence Expression With &amp;#43; And *&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/make-parentheses-valid/&#34;&gt;Minimum Remove To Make Parentheses Valid&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;h2 id=&#34;sliding-window&#34;&gt;Sliding Window&lt;/h2&gt;&#xA;&#xA;    &lt;ul&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/longest-repeating-character-replacement/&#34;&gt;Longest repeating character replacement&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/longest-substring-without-repeating-characters/&#34;&gt;Longest substring without repeating characters&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/minimum-window-substring/&#34;&gt;Minimum window substring&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;h2 id=&#34;two-pointers&#34;&gt;Two Pointers&lt;/h2&gt;&#xA;&#xA;    &lt;ul&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/string-is-subsequence/&#34;&gt;Is Subsequence&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;h2 id=&#34;union-find&#34;&gt;Union Find&lt;/h2&gt;&#xA;&#xA;    &lt;ul&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/longest-consecutive-sequence/&#34;&gt;Longest consecutive sequence&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href=&#34;https://pankajpipada.com/tech-interview-prep/problems/number-of-islands/&#34;&gt;Number of islands&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;</description>
    </item>
  </channel>
</rss>
