updated

Author: programmerraja

Images/Pasted-image-20250331091108.png

@@ -6,11 +6,17 @@
       <description>Last 10 notes on 🧠 Second Brain</description>
       <generator>Quartz -- quartz.jzhao.xyz</generator>
       <item>
-    <title>How we Accidentally delete the production elastic search</title>
-    <link>https://programmerraja.github.io/post/2025/How-we-Accidentally-delete-the-production-elastic-search</link>
-    <guid>https://programmerraja.github.io/post/2025/How-we-Accidentally-delete-the-production-elastic-search</guid>
-    <description>Hey Hai everyOne i am back with another interseting story and gli.</description>
-    <pubDate>Sat, 08 Mar 2025 13:16:34 GMT</pubDate>
+    <title>From Heroku to Kubernetes Lessons Learned in Our Migration Journey</title>
+    <link>https://programmerraja.github.io/post/2025/From-Heroku-to-Kubernetes-Lessons-Learned-in-Our-Migration-Journey</link>
+    <guid>https://programmerraja.github.io/post/2025/From-Heroku-to-Kubernetes-Lessons-Learned-in-Our-Migration-Journey</guid>
+    <description>Migrating from Heroku to Kubernetes is no small feat. While Heroku provided a straightforward Platform-as-a-Service (PaaS) environment that handled many operational aspects for us, Kubernetes offers greater flexibility, scalability, and control.</description>
+    <pubDate>Sun, 23 Mar 2025 10:07:39 GMT</pubDate>
+  </item><item>
+    <title>DSA</title>
+    <link>https://programmerraja.github.io/notes/2025/DSA</link>
+    <guid>https://programmerraja.github.io/notes/2025/DSA</guid>
+    <description>Patterns sliding window pattern subset pattern → no reptttion and repetttion Modified binary search top k elements → use heap binary tree dfs toplogical sort two pointer two moving ...</description>
+    <pubDate>Mon, 17 Mar 2025 14:54:19 GMT</pubDate>
   </item><item>
     <title>Sherlock Holmes: The Case of the Invalid HeloHost Error</title>
     <link>https://programmerraja.github.io/post/2025/Sherlock-Holmes-The-Case-of-the-Invalid-HeloHost-Error</link>
@@ -48,9 +54,9 @@
     <description>PROJECT ARISTOTLE Google conducted one of the best-known studies on effective software engineer- ing teams, known as Project Aristotle. The project aimed to identify the factors that make some teams more successful than others.</description>
     <pubDate>Mon, 13 Jan 2025 13:21:01 GMT</pubDate>
   </item><item>
-    <title>Lessons from 2 Years of PR Reviews: 9 Costly Coding Mistakes</title>
-    <link>https://programmerraja.github.io/post/2025/Lessons-from-2-Years-of-PR-Reviews--9-Costly-Coding-Mistakes</link>
-    <guid>https://programmerraja.github.io/post/2025/Lessons-from-2-Years-of-PR-Reviews--9-Costly-Coding-Mistakes</guid>
+    <title>Lessons from 2 Years of PR Reviews: 8 Costly Coding Mistakes</title>
+    <link>https://programmerraja.github.io/post/2025/Lessons-from-2-Years-of-PR-Reviews-8-Costly-Coding-Mistakes</link>
+    <guid>https://programmerraja.github.io/post/2025/Lessons-from-2-Years-of-PR-Reviews-8-Costly-Coding-Mistakes</guid>
     <description>Hey everyone! If you’re a regular follower, you might already know a bit about me. But if not, let me quickly introduce myself: I’m a full-stack developer, and I’ve been working at a startup for the past two years.</description>
     <pubDate>Sun, 12 Jan 2025 12:09:14 GMT</pubDate>
   </item><item>
@@ -59,12 +65,6 @@
     <guid>https://programmerraja.github.io/post/2025/Sherlock-Holmes-and-The-Case-Redis-Overload-During-a-DDoS-Attack</guid>
     <description>It was a calm day until disaster struck. We received alerts about DDoS and brute-force attacks originating from random bot IPs. Our team quickly mobilized to mitigate the attacks.</description>
     <pubDate>Sun, 05 Jan 2025 01:12:19 GMT</pubDate>
-  </item><item>
-    <title>Generative AI: A Personal Deep Dive  My Notes and Insights Part -2</title>
-    <link>https://programmerraja.github.io/post/2024/Generative-AI--A-Personal-Deep-Dive--My-Notes-and-Insights-Part--2</link>
-    <guid>https://programmerraja.github.io/post/2024/Generative-AI--A-Personal-Deep-Dive--My-Notes-and-Insights-Part--2</guid>
-    <description>Welcome back to part 2 of my series, Personal Deep Dive: My Notes and Insights. If you found the first post useful, you’re in for more today. If you missed it, don’t worry — you can catch up here.</description>
-    <pubDate>Wed, 18 Dec 2024 00:57:31 GMT</pubDate>
   </item>
     </channel>
   </rss>

Images/Pasted-image-20250331091303.png

@@ -91,13 +91,11 @@ <h4 id="optimizing-network-round-trips">Optimizing Network Round Trips<a role="a
 <figure data-rehype-pretty-code-figure><pre tabindex="0" data-language="js" data-theme="github-light github-dark"><code data-language="js" data-theme="github-light github-dark" style="display:grid;"><span data-line><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">db.millions.</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;">find</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">({},{n:</span><span style="--shiki-light:#005CC5;--shiki-dark:#79B8FF;">1</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">,_id:</span><span style="--shiki-light:#005CC5;--shiki-dark:#79B8FF;">0</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">}).</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;">batchSize</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">(batchsize);</span></span></code></pre></figure>
 <h4 id="overriding-the-optimizer-with-hints">Overriding the Optimizer with Hints<a role="anchor" aria-hidden="true" tabindex="-1" data-no-popover="true" href="#overriding-the-optimizer-with-hints" class="internal"><svg width="18" height="18" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"></path><path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"></path></svg></a></h4>
 <p>We can change force this query to use a collection scan by adding a hint. If we
-append .<code>hint({$natural:1})</code>, we instruct MongoDB to perform a collection scan to
-resolve the query:</p>
+append .<code>hint({$natural:1})</code>, we instruct MongoDB to perform a collection scan to resolve the query:</p>
 <h4 id="optimizing-sort-operations">Optimizing Sort Operations<a role="anchor" aria-hidden="true" tabindex="-1" data-no-popover="true" href="#optimizing-sort-operations" class="internal"><svg width="18" height="18" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"></path><path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"></path></svg></a></h4>
 <p><strong>Blocking sort</strong></p>
 <p>The sorting that doing without using any index is called blocking sort because the it need fetch all doc to memory and need to do sorting and return the doc to the user</p>
-<p>if you are going to to do a blocking sort on a large amount of data, you may need to
-allocate more memory for the sort. You can do this by adjusting the internal parameter
+<p>if you are going to to do a blocking sort on a large amount of data, you may need to allocate more memory for the sort. You can do this by adjusting the internal parameter
 <code>internalQueryExecMaxBlockingSortBytes</code>.</p>
 <figure data-rehype-pretty-code-figure><pre tabindex="0" data-language="js" data-theme="github-light github-dark"><code data-language="js" data-theme="github-light github-dark" style="display:grid;"><span data-line><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">db.</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;">getSiblingDB</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">(</span><span style="--shiki-light:#032F62;--shiki-dark:#9ECBFF;">&quot;admin&quot;</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">).</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;">runCommand</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">(</span></span>
 <span data-line><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">{ setParameter: </span><span style="--shiki-light:#005CC5;--shiki-dark:#79B8FF;">1</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">, </span></span>
@@ -121,6 +119,7 @@ <h4 id="automatic-pipeline-optimizations">Automatic Pipeline Optimizations<a rol
 <h4 id="indexed-aggregation-sorts">Indexed Aggregation Sorts<a role="anchor" aria-hidden="true" tabindex="-1" data-no-popover="true" href="#indexed-aggregation-sorts" class="internal"><svg width="18" height="18" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"></path><path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"></path></svg></a></h4>
 <ul>
 <li><code>$sort</code> can be utilized the index only if it in early enough the pipeline to be rolled into the initial data access operation.</li>
+<li></li>
 </ul>
 <figure data-rehype-pretty-code-figure><pre tabindex="0" data-language="js" data-theme="github-light github-dark"><code data-language="js" data-theme="github-light github-dark" style="display:grid;"><span data-line><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;">aggregate</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">([</span></span>
 <span data-line><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">{ $sort:{  d:</span><span style="--shiki-light:#005CC5;--shiki-dark:#79B8FF;">1</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;"> }},</span></span>

Images/Screenshot-from-2024-12-12-06-47-23.png

@@ -307,7 +307,16 @@ <h2 id="structural-design-patterns"><strong>Structural Design Patterns:</strong>
 </code></pre>
 <h2 id="design-pattern-from-project">Design pattern from project<a role="anchor" aria-hidden="true" tabindex="-1" data-no-popover="true" href="#design-pattern-from-project" class="internal"><svg width="18" height="18" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"></path><path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"></path></svg></a></h2>
 <h3 id="pipeline-flow-from-pipecat">Pipeline flow from (pipecat)<a role="anchor" aria-hidden="true" tabindex="-1" data-no-popover="true" href="#pipeline-flow-from-pipecat" class="internal"><svg width="18" height="18" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"></path><path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"></path></svg></a></h3>
-<p>Where used how the router in networking works</p>
+<p>Where used how the router in networking works where they have frame with type and each router will pass the frame to next one and check the type if they have type handle in there processor they handle and push to next one where they have direction also</p>
+<p>Where they push to queue
+sample frame</p>
+<figure data-rehype-pretty-code-figure><pre tabindex="0" data-language="js" data-theme="github-light github-dark"><code data-language="js" data-theme="github-light github-dark" style="display:grid;"><span data-line><span style="--shiki-light:#D73A49;--shiki-dark:#F97583;">class</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> Frame</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;"> {</span></span>
+<span data-line> </span>
+<span data-line><span style="--shiki-light:#E36209;--shiki-dark:#FFAB70;">TYPE</span><span style="--shiki-light:#D73A49;--shiki-dark:#F97583;">:</span><span style="--shiki-light:#032F62;--shiki-dark:#9ECBFF;">&quot;LLM_CALL&quot;</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;"> -> </span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;">each</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> router</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> will</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> check</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> and</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> if</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> they</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> have</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> handler</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> for</span><span style="--shiki-light:#005CC5;--shiki-dark:#79B8FF;"> this</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> they</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> will</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> else</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> push</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> to</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> next</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> one</span></span>
+<span data-line><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">}</span></span>
+<span data-line> </span>
+<span data-line> </span></code></pre></figure>
+<p><img src="../.././../Images/Screenshot-from-2025-03-20-08-21-11.png" alt/></p>
 <figure data-rehype-pretty-code-figure><pre tabindex="0" data-language="js" data-theme="github-light github-dark"><code data-language="js" data-theme="github-light github-dark" style="display:grid;"><span data-line><span style="--shiki-light:#D73A49;--shiki-dark:#F97583;">class</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;"> Step</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;"> {</span></span>
 <span data-line><span style="--shiki-light:#D73A49;--shiki-dark:#F97583;">  constructor</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">(</span><span style="--shiki-light:#E36209;--shiki-dark:#FFAB70;">fn</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">) {</span></span>
 <span data-line><span style="--shiki-light:#005CC5;--shiki-dark:#79B8FF;">    this</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">.fn </span><span style="--shiki-light:#D73A49;--shiki-dark:#F97583;">=</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;"> fn; </span><span style="--shiki-light:#6A737D;--shiki-dark:#6A737D;">// Function to apply at this step</span></span>