<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Soham</title>
    <description>The latest articles on DEV Community by Soham (@soham0047).</description>
    <link>https://dev.to/soham0047</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F770859%2F5637b178-824e-4772-9ba2-7f94d5b20f37.jpeg</url>
      <title>DEV Community: Soham</title>
      <link>https://dev.to/soham0047</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/soham0047"/>
    <language>en</language>
    <item>
      <title>How I built an AI-powered plant swap community app in a weekend</title>
      <dc:creator>Soham</dc:creator>
      <pubDate>Sun, 01 Mar 2026 15:48:28 +0000</pubDate>
      <link>https://dev.to/soham0047/how-i-built-an-ai-powered-plant-swap-community-app-in-a-weekend-2co4</link>
      <guid>https://dev.to/soham0047/how-i-built-an-ai-powered-plant-swap-community-app-in-a-weekend-2co4</guid>
      <description>&lt;p&gt;&lt;em&gt;This is a submission for the &lt;a href="https://dev.to/challenges/weekend-2026-02-28"&gt;DEV Weekend Challenge: Community&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  The Community
&lt;/h2&gt;

&lt;p&gt;Plant people are a weird and wonderful bunch.&lt;/p&gt;

&lt;p&gt;I know this because I'm one of them. My balcony has more pots than chairs. My neighbors know me as "the guy with the jungle." And like pretty much every plant lover I know, I've spent an embarrassing amount of time in WhatsApp groups trying to swap cuttings.&lt;/p&gt;

&lt;p&gt;You know how it goes. Someone posts "anyone want monstera cuttings?" and within 3 minutes there are 47 replies, half of them just "🙋", the thread is buried, nobody knows who got what, and the person who actually wanted the cutting lives 3 cities away.&lt;/p&gt;

&lt;p&gt;That's the community I built this for — the balcony gardeners, the indoor jungle people, the "I propagated too many pothos again" crowd. People who want to share plants but have no good way to do it.&lt;/p&gt;

&lt;h2&gt;
  
  
  What I Built
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;BagichaLink&lt;/strong&gt; — a plant swap platform where you can post plants you have or want, get AI to identify and diagnose them, find swap partners near you, and chat directly to arrange the swap.&lt;/p&gt;

&lt;p&gt;"Bagicha" means garden in Hindi/Urdu. The name felt right.&lt;/p&gt;

&lt;p&gt;Here's what it actually does:&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;You scan a plant.&lt;/strong&gt; Point your camera at anything green. The AI (Groq's vision model) tells you what it is, how healthy it looks, gives you care tips based on your &lt;em&gt;current local weather&lt;/em&gt;, and even drops a fun fact. It's weirdly satisfying even when you already know what plant it is.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;You post it.&lt;/strong&gt; Mark it as Available or Wanted. It goes into the feed for your city, nearby area, or the global feed.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;AI finds you matches.&lt;/strong&gt; Pick one of your plants and the AI scans through other posts and tells you who has something worth swapping with, why it's a good match, and gives it a match score.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;You chat and swap.&lt;/strong&gt; Real-time messaging, arrange the swap, mark it done. &lt;/p&gt;

&lt;p&gt;There's also a live map showing posts from around the world, which is genuinely fun to look at — you can see someone in Tokyo just posted a succulent and someone in Lagos wants a fern.&lt;/p&gt;

&lt;h2&gt;
  
  
  Demo
&lt;/h2&gt;

&lt;p&gt;

  &lt;iframe src="https://www.youtube.com/embed/apnJitaXEP0"&gt;
  &lt;/iframe&gt;


&lt;/p&gt;

&lt;p&gt;🌐 &lt;strong&gt;Live:&lt;/strong&gt; &lt;a href="https://bagichalink.netlify.app" rel="noopener noreferrer"&gt;bagichalink.netlify.app&lt;/a&gt;&lt;/p&gt;

&lt;blockquote&gt;
&lt;p&gt;The backend runs on Render's free tier so the first load might take 20-30 seconds while it wakes up. After that it's fast. I added a friendly wake-up screen so it doesn't just look broken.&lt;/p&gt;
&lt;/blockquote&gt;

&lt;p&gt;Here's what the flow looks like:&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Sign up (OTP sent to your email — no password needed if you don't want one)&lt;/li&gt;
&lt;li&gt;Set your location (GPS or search your city)&lt;/li&gt;
&lt;li&gt;Scan a plant or browse the feed&lt;/li&gt;
&lt;li&gt;Find a match, start a chat&lt;/li&gt;
&lt;/ol&gt;

&lt;h2&gt;
  
  
  Code
&lt;/h2&gt;

&lt;p&gt;

&lt;/p&gt;
&lt;div class="ltag-github-readme-tag"&gt;
  &lt;div class="readme-overview"&gt;
    &lt;h2&gt;
      &lt;img src="https://assets.dev.to/assets/github-logo-5a155e1f9a670af7944dd5e12375bc76ed542ea80224905ecaf878b9157cdefc.svg" alt="GitHub logo"&gt;
      &lt;a href="https://github.com/Soham-0047" rel="noopener noreferrer"&gt;
        Soham-0047
      &lt;/a&gt; / &lt;a href="https://github.com/Soham-0047/Bagichalink" rel="noopener noreferrer"&gt;
        Bagichalink
      &lt;/a&gt;
    &lt;/h2&gt;
    &lt;h3&gt;
      BagichaLink is a free, community-driven plant swap platform built for urban gardeners and plant lovers. Instead of cluttered WhatsApp groups or Facebook Marketplace chaos, BagichaLink gives you a clean, AI-powered experience
    &lt;/h3&gt;
  &lt;/div&gt;
  &lt;div class="ltag-github-body"&gt;
    
&lt;div id="readme" class="md"&gt;
&lt;div class="markdown-heading"&gt;
&lt;h1 class="heading-element"&gt;🌿 BagichaLink — Plant Swap Community&lt;/h1&gt;
&lt;/div&gt;
&lt;blockquote&gt;
&lt;p&gt;&lt;strong&gt;Swap plants with gardeners near you. AI identifies your plants, diagnoses health issues, and finds perfect swap matches. 100% free.&lt;/strong&gt;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;div class="markdown-heading"&gt;
&lt;h2 class="heading-element"&gt;📸 What is BagichaLink?&lt;/h2&gt;
&lt;/div&gt;
&lt;p&gt;BagichaLink is a &lt;strong&gt;free, community-driven plant swap platform&lt;/strong&gt; built for urban gardeners and plant lovers. Instead of cluttered WhatsApp groups or Facebook Marketplace chaos, BagichaLink gives you a clean, AI-powered experience to:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;📷 &lt;strong&gt;Scan any plant&lt;/strong&gt; with your camera — AI identifies species, health, and care needs instantly&lt;/li&gt;
&lt;li&gt;🌍 &lt;strong&gt;Find swap partners&lt;/strong&gt; near you or globally using smart AI matching&lt;/li&gt;
&lt;li&gt;💬 &lt;strong&gt;Chat in real-time&lt;/strong&gt; with other gardeners to arrange swaps&lt;/li&gt;
&lt;li&gt;🗺️ &lt;strong&gt;Explore the Plant Map&lt;/strong&gt; — see posts from around the world&lt;/li&gt;
&lt;li&gt;📅 &lt;strong&gt;Get a personalized care schedule&lt;/strong&gt; based on your location and weather&lt;/li&gt;
&lt;/ul&gt;

&lt;div class="markdown-heading"&gt;
&lt;h2 class="heading-element"&gt;✨ Features&lt;/h2&gt;
&lt;/div&gt;
&lt;div class="markdown-heading"&gt;
&lt;h3 class="heading-element"&gt;🔬 AI Plant Intelligence&lt;/h3&gt;

&lt;/div&gt;
&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Instant plant identification&lt;/strong&gt; — upload or photograph any plant and get species name, emoji, fun facts&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Health diagnosis&lt;/strong&gt; — AI…&lt;/li&gt;
&lt;/ul&gt;
&lt;/div&gt;
  &lt;/div&gt;
  &lt;div class="gh-btn-container"&gt;&lt;a class="gh-btn" href="https://github.com/Soham-0047/Bagichalink" rel="noopener noreferrer"&gt;View on GitHub&lt;/a&gt;&lt;/div&gt;
&lt;/div&gt;




&lt;h2&gt;
  
  
  How I Built It
&lt;/h2&gt;

&lt;p&gt;Honestly? This started as a one-day thing and turned into a "okay one more feature" spiral that consumed the entire weekend.&lt;/p&gt;

&lt;h3&gt;
  
  
  The Stack
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Frontend:&lt;/strong&gt; React + TypeScript on Vite, styled with Tailwind. The design is intentionally warm and editorial — think botanical journal, not SaaS dashboard. Parchment backgrounds, terracotta buttons, DM Serif Display for headers. I wanted it to feel like something a plant person would actually &lt;em&gt;like&lt;/em&gt; using, not just tolerate.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Backend:&lt;/strong&gt; Node.js + Express + MongoDB. Socket.io for real-time — feed updates, chat messages, interest notifications all come through instantly.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;AI:&lt;/strong&gt; This was the fun part. I started with Google Gemini for plant vision analysis. It worked great until it... didn't (hit the free tier quota wall mid-weekend, classic). So I switched to &lt;strong&gt;Groq&lt;/strong&gt; with &lt;code&gt;llama-4-scout&lt;/code&gt; as the primary model, with Gemini as a fallback. Groq gives 14,400 free requests per day and it's &lt;em&gt;fast&lt;/em&gt; — analysis comes back in under 2 seconds.&lt;/p&gt;

&lt;p&gt;The weather integration (Open-Meteo, completely free, no API key) makes the care tips actually contextual. If it's 38°C and humid where you are, the tips are different than if you're in a cold dry climate. Small thing but it makes the AI output feel less generic.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Auth:&lt;/strong&gt; Built email OTP from scratch using Nodemailer + Gmail App Passwords. Free, works, OTPs expire in 10 minutes via MongoDB TTL index. You can also use password if you prefer — both flows coexist.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Images:&lt;/strong&gt; Cloudinary for storage. The tricky part here was that &lt;code&gt;multer-storage-cloudinary&lt;/code&gt; streams straight to Cloudinary and discards the buffer, which meant Groq had nothing to analyze. Fixed by switching to &lt;code&gt;multer.memoryStorage()&lt;/code&gt; — hold the buffer in RAM, send it to Groq as base64, &lt;em&gt;then&lt;/em&gt; upload to Cloudinary. Obvious in retrospect, painful to debug.&lt;/p&gt;

&lt;h3&gt;
  
  
  Things That Went Wrong (aka the actual dev experience)
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;The MongoDB geo keys error.&lt;/strong&gt; Spent 40 minutes on a &lt;code&gt;MongoServerError: Can't extract geo keys&lt;/code&gt; error. Turned out MongoDB's &lt;code&gt;2dsphere&lt;/code&gt; index requires the coordinates array to be named &lt;em&gt;exactly&lt;/em&gt; &lt;code&gt;coordinates&lt;/code&gt;. I had named it &lt;code&gt;coords&lt;/code&gt;. One word. Four letters. Forty minutes.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Express route ordering.&lt;/strong&gt; Had &lt;code&gt;/api/messages/:userId&lt;/code&gt; matching before &lt;code&gt;/api/messages/conversations&lt;/code&gt; — so hitting the conversations endpoint was returning a "user not found" error because it was treating the string "conversations" as a user ID. Classic wildcard trap. Always put specific routes before &lt;code&gt;/:param&lt;/code&gt; routes.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Socket.io and stale closures.&lt;/strong&gt; The socket's &lt;code&gt;connect&lt;/code&gt; handler was closing over &lt;code&gt;user&lt;/code&gt; state which is &lt;code&gt;null&lt;/code&gt; at mount time (user loads async from the API). Messages were saving with &lt;code&gt;senderId: undefined&lt;/code&gt;. Fixed with a &lt;code&gt;useRef&lt;/code&gt; that always holds the latest user value — the connect handler reads from the ref, not the stale closure.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Groq quota on vision.&lt;/strong&gt; &lt;code&gt;llama-4-scout&lt;/code&gt; is technically a vision model but I kept getting model-not-found errors until I got the exact model string right: &lt;code&gt;meta-llama/llama-4-scout-17b-16e-instruct&lt;/code&gt;. Their docs aren't super clear on this.&lt;/p&gt;

&lt;h3&gt;
  
  
  What I'm Actually Proud Of
&lt;/h3&gt;

&lt;p&gt;The bento grid feed layout — large card, two small cards, weather banner, repeat. It creates this nice visual rhythm without any CSS grid complexity.&lt;/p&gt;

&lt;p&gt;The OTP digit input boxes that auto-focus as you type. Small thing but it feels really polished.&lt;/p&gt;

&lt;p&gt;The AI fallback chain. Groq → Gemini → graceful fallback message. Users never see a broken state, just occasionally a "couldn't identify this one, try a clearer photo."&lt;/p&gt;

&lt;p&gt;The match scoring system — AI reads your plant, reads 50 community posts, and gives you the top 3 with reasons. It's surprisingly good at finding complementary swaps (not just "you both have succulents" but "you have a drought-tolerant plant and they're in a dry climate").&lt;/p&gt;

&lt;h3&gt;
  
  
  What I'd Add With More Time
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;Push notifications (currently only in-app via socket)&lt;/li&gt;
&lt;li&gt;A proper mobile app (the web app is mobile-optimized but PWA install would be nice)&lt;/li&gt;
&lt;li&gt;Moderation tools for the community feed&lt;/li&gt;
&lt;li&gt;More granular location — neighborhood-level matching, not just city&lt;/li&gt;
&lt;li&gt;A "swap history" timeline so you can see all the plants that have moved through your hands&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;If you're a plant person, try it. Post something. See if anyone near you wants to swap.&lt;/p&gt;

&lt;p&gt;And if you have a monstera cutting you're trying to get rid of — I'm probably interested.&lt;/p&gt;

</description>
      <category>devchallenge</category>
      <category>weekendchallenge</category>
      <category>showdev</category>
      <category>ai</category>
    </item>
    <item>
      <title>The Ultimate Guide to Top 150 LeetCode Problems: Your Path to Acing Technical Interviews</title>
      <dc:creator>Soham</dc:creator>
      <pubDate>Sun, 19 Oct 2025 08:33:39 +0000</pubDate>
      <link>https://dev.to/soham0047/the-ultimate-guide-to-top-150-leetcode-problems-your-path-to-acing-technical-interviews-30h1</link>
      <guid>https://dev.to/soham0047/the-ultimate-guide-to-top-150-leetcode-problems-your-path-to-acing-technical-interviews-30h1</guid>
      <description>&lt;p&gt;&lt;em&gt;Master the most frequently asked coding interview questions from top tech companies&lt;/em&gt;&lt;/p&gt;




&lt;h2&gt;
  
  
  Introduction
&lt;/h2&gt;

&lt;p&gt;Landing a job at a top tech company requires solid preparation. This comprehensive guide covers the &lt;strong&gt;Top 150 LeetCode problems&lt;/strong&gt; that are most frequently asked in technical interviews at companies like Google, Amazon, Microsoft, Meta (Facebook), Apple, and many others.&lt;/p&gt;

&lt;p&gt;Whether you're preparing for your first technical interview or brushing up your skills, this curated list will help you focus on what matters most. Each problem is tagged with the companies that have asked it, so you can tailor your preparation to your target employers.&lt;/p&gt;




&lt;h2&gt;
  
  
  📊 Array &amp;amp; String Problems
&lt;/h2&gt;

&lt;h3&gt;
  
  
  1. &lt;strong&gt;Two Sum&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/two-sum/" rel="noopener noreferrer"&gt;#1 Two Sum&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Apple, Microsoft, Adobe, Bloomberg, Uber, Oracle, Yahoo&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  2. &lt;strong&gt;Merge Sorted Array&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/merge-sorted-array/" rel="noopener noreferrer"&gt;#88 Merge Sorted Array&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Meta, Amazon, Microsoft, Apple, Bloomberg, Adobe, Oracle, Expedia, SAP&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  3. &lt;strong&gt;Remove Element&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/remove-element/" rel="noopener noreferrer"&gt;#27 Remove Element&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Google, Amazon, Bloomberg, Microsoft, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  4. &lt;strong&gt;Remove Duplicates from Sorted Array&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/remove-duplicates-from-sorted-array/" rel="noopener noreferrer"&gt;#26 Remove Duplicates from Sorted Array&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Meta, Amazon, Microsoft, Bloomberg, Apple, Adobe, Google&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  5. &lt;strong&gt;Remove Duplicates from Sorted Array II&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/" rel="noopener noreferrer"&gt;#80 Remove Duplicates from Sorted Array II&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Meta, Amazon, Bloomberg, Microsoft&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  6. &lt;strong&gt;Majority Element&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/majority-element/" rel="noopener noreferrer"&gt;#169 Majority Element&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Apple, Adobe, Microsoft, Uber, Oracle&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  7. &lt;strong&gt;Rotate Array&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/rotate-array/" rel="noopener noreferrer"&gt;#189 Rotate Array&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Microsoft, Meta, Apple, Bloomberg, Adobe, Google&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  8. &lt;strong&gt;Best Time to Buy and Sell Stock&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock/" rel="noopener noreferrer"&gt;#121 Best Time to Buy and Sell Stock&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Bloomberg, Apple, Adobe, Uber, Goldman Sachs&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  9. &lt;strong&gt;Best Time to Buy and Sell Stock II&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/" rel="noopener noreferrer"&gt;#122 Best Time to Buy and Sell Stock II&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Bloomberg, Meta, Microsoft, Google&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  10. &lt;strong&gt;Jump Game&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/jump-game/" rel="noopener noreferrer"&gt;#55 Jump Game&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  11. &lt;strong&gt;Jump Game II&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/jump-game-ii/" rel="noopener noreferrer"&gt;#45 Jump Game II&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Adobe, Apple&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  12. &lt;strong&gt;H-Index&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/h-index/" rel="noopener noreferrer"&gt;#274 H-Index&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Meta, Google, Amazon, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  13. &lt;strong&gt;Insert Delete GetRandom O(1)&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/insert-delete-getrandom-o1/" rel="noopener noreferrer"&gt;#380 Insert Delete GetRandom O(1)&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Meta, Amazon, Google, Microsoft, Uber, Apple, Bloomberg, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  14. &lt;strong&gt;Product of Array Except Self&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/product-of-array-except-self/" rel="noopener noreferrer"&gt;#238 Product of Array Except Self&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Uber, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  15. &lt;strong&gt;Gas Station&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/gas-station/" rel="noopener noreferrer"&gt;#134 Gas Station&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  16. &lt;strong&gt;Candy&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/candy/" rel="noopener noreferrer"&gt;#135 Candy&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Microsoft, Meta&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  17. &lt;strong&gt;Trapping Rain Water&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/trapping-rain-water/" rel="noopener noreferrer"&gt;#42 Trapping Rain Water&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Bloomberg, Adobe, Uber&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  18. &lt;strong&gt;Roman to Integer&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/roman-to-integer/" rel="noopener noreferrer"&gt;#13 Roman to Integer&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Microsoft, Google, Apple, Adobe, Bloomberg, Yahoo&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  19. &lt;strong&gt;Integer to Roman&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/integer-to-roman/" rel="noopener noreferrer"&gt;#12 Integer to Roman&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Microsoft, Google, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  20. &lt;strong&gt;Length of Last Word&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/length-of-last-word/" rel="noopener noreferrer"&gt;#58 Length of Last Word&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Apple, Microsoft, Meta&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  21. &lt;strong&gt;Longest Common Prefix&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/longest-common-prefix/" rel="noopener noreferrer"&gt;#14 Longest Common Prefix&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  22. &lt;strong&gt;Reverse Words in a String&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/reverse-words-in-a-string/" rel="noopener noreferrer"&gt;#151 Reverse Words in a String&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Microsoft, Meta, Apple, Bloomberg, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  23. &lt;strong&gt;Zigzag Conversion&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/zigzag-conversion/" rel="noopener noreferrer"&gt;#6 Zigzag Conversion&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  24. &lt;strong&gt;Find the Index of the First Occurrence in a String&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/" rel="noopener noreferrer"&gt;#28 Find the Index of the First Occurrence in a String&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Meta, Amazon, Microsoft, Google, Apple, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  25. &lt;strong&gt;Text Justification&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/text-justification/" rel="noopener noreferrer"&gt;#68 Text Justification&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  🔁 Two Pointers
&lt;/h2&gt;

&lt;h3&gt;
  
  
  26. &lt;strong&gt;Valid Palindrome&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/valid-palindrome/" rel="noopener noreferrer"&gt;#125 Valid Palindrome&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Microsoft, Google, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  27. &lt;strong&gt;Is Subsequence&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/is-subsequence/" rel="noopener noreferrer"&gt;#392 Is Subsequence&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Microsoft, Meta, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  28. &lt;strong&gt;Two Sum II - Input Array Is Sorted&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/" rel="noopener noreferrer"&gt;#167 Two Sum II - Input Array Is Sorted&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  29. &lt;strong&gt;Container With Most Water&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/container-with-most-water/" rel="noopener noreferrer"&gt;#11 Container With Most Water&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Bloomberg, Adobe, Goldman Sachs&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  30. &lt;strong&gt;3Sum&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/3sum/" rel="noopener noreferrer"&gt;#15 3Sum&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber, Oracle&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  🔄 Sliding Window
&lt;/h2&gt;

&lt;h3&gt;
  
  
  31. &lt;strong&gt;Minimum Size Subarray Sum&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/minimum-size-subarray-sum/" rel="noopener noreferrer"&gt;#209 Minimum Size Subarray Sum&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  32. &lt;strong&gt;Longest Substring Without Repeating Characters&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/longest-substring-without-repeating-characters/" rel="noopener noreferrer"&gt;#3 Longest Substring Without Repeating Characters&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Bloomberg, Adobe, Uber, Oracle&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  33. &lt;strong&gt;Substring with Concatenation of All Words&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/substring-with-concatenation-of-all-words/" rel="noopener noreferrer"&gt;#30 Substring with Concatenation of All Words&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  34. &lt;strong&gt;Minimum Window Substring&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/minimum-window-substring/" rel="noopener noreferrer"&gt;#76 Minimum Window Substring&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Uber, Bloomberg&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  🔢 Matrix
&lt;/h2&gt;

&lt;h3&gt;
  
  
  35. &lt;strong&gt;Valid Sudoku&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/valid-sudoku/" rel="noopener noreferrer"&gt;#36 Valid Sudoku&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  36. &lt;strong&gt;Spiral Matrix&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/spiral-matrix/" rel="noopener noreferrer"&gt;#54 Spiral Matrix&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  37. &lt;strong&gt;Rotate Image&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/rotate-image/" rel="noopener noreferrer"&gt;#48 Rotate Image&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Microsoft, Google, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  38. &lt;strong&gt;Set Matrix Zeroes&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/set-matrix-zeroes/" rel="noopener noreferrer"&gt;#73 Set Matrix Zeroes&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Microsoft, Google, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  39. &lt;strong&gt;Game of Life&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/game-of-life/" rel="noopener noreferrer"&gt;#289 Game of Life&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Adobe&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  🔗 HashMap
&lt;/h2&gt;

&lt;h3&gt;
  
  
  40. &lt;strong&gt;Ransom Note&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/ransom-note/" rel="noopener noreferrer"&gt;#383 Ransom Note&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Microsoft, Google, Apple&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  41. &lt;strong&gt;Isomorphic Strings&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/isomorphic-strings/" rel="noopener noreferrer"&gt;#205 Isomorphic Strings&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  42. &lt;strong&gt;Word Pattern&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/word-pattern/" rel="noopener noreferrer"&gt;#290 Word Pattern&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Uber&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  43. &lt;strong&gt;Valid Anagram&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/valid-anagram/" rel="noopener noreferrer"&gt;#242 Valid Anagram&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  44. &lt;strong&gt;Group Anagrams&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/group-anagrams/" rel="noopener noreferrer"&gt;#49 Group Anagrams&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  45. &lt;strong&gt;Two Sum&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/two-sum/" rel="noopener noreferrer"&gt;#1 Two Sum&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Apple, Microsoft, Adobe, Bloomberg, Uber, Oracle, Yahoo&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  46. &lt;strong&gt;Happy Number&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/happy-number/" rel="noopener noreferrer"&gt;#202 Happy Number&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Apple, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  47. &lt;strong&gt;Contains Duplicate II&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/contains-duplicate-ii/" rel="noopener noreferrer"&gt;#219 Contains Duplicate II&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  48. &lt;strong&gt;Longest Consecutive Sequence&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/longest-consecutive-sequence/" rel="noopener noreferrer"&gt;#128 Longest Consecutive Sequence&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  📏 Intervals
&lt;/h2&gt;

&lt;h3&gt;
  
  
  49. &lt;strong&gt;Summary Ranges&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/summary-ranges/" rel="noopener noreferrer"&gt;#228 Summary Ranges&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  50. &lt;strong&gt;Merge Intervals&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/merge-intervals/" rel="noopener noreferrer"&gt;#56 Merge Intervals&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber, Oracle&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  51. &lt;strong&gt;Insert Interval&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/insert-interval/" rel="noopener noreferrer"&gt;#57 Insert Interval&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  52. &lt;strong&gt;Minimum Number of Arrows to Burst Balloons&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/" rel="noopener noreferrer"&gt;#452 Minimum Number of Arrows to Burst Balloons&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Bloomberg&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  📚 Stack
&lt;/h2&gt;

&lt;h3&gt;
  
  
  53. &lt;strong&gt;Valid Parentheses&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/valid-parentheses/" rel="noopener noreferrer"&gt;#20 Valid Parentheses&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  54. &lt;strong&gt;Simplify Path&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/simplify-path/" rel="noopener noreferrer"&gt;#71 Simplify Path&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  55. &lt;strong&gt;Min Stack&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/min-stack/" rel="noopener noreferrer"&gt;#155 Min Stack&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  56. &lt;strong&gt;Evaluate Reverse Polish Notation&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/evaluate-reverse-polish-notation/" rel="noopener noreferrer"&gt;#150 Evaluate Reverse Polish Notation&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  57. &lt;strong&gt;Basic Calculator&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/basic-calculator/" rel="noopener noreferrer"&gt;#224 Basic Calculator&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  🔢 Linked List
&lt;/h2&gt;

&lt;h3&gt;
  
  
  58. &lt;strong&gt;Linked List Cycle&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/linked-list-cycle/" rel="noopener noreferrer"&gt;#141 Linked List Cycle&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  59. &lt;strong&gt;Add Two Numbers&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/add-two-numbers/" rel="noopener noreferrer"&gt;#2 Add Two Numbers&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  60. &lt;strong&gt;Merge Two Sorted Lists&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/merge-two-sorted-lists/" rel="noopener noreferrer"&gt;#21 Merge Two Sorted Lists&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  61. &lt;strong&gt;Copy List with Random Pointer&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/copy-list-with-random-pointer/" rel="noopener noreferrer"&gt;#138 Copy List with Random Pointer&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  62. &lt;strong&gt;Reverse Linked List II&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/reverse-linked-list-ii/" rel="noopener noreferrer"&gt;#92 Reverse Linked List II&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  63. &lt;strong&gt;Reverse Nodes in k-Group&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/reverse-nodes-in-k-group/" rel="noopener noreferrer"&gt;#25 Reverse Nodes in k-Group&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  64. &lt;strong&gt;Remove Nth Node From End of List&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/remove-nth-node-from-end-of-list/" rel="noopener noreferrer"&gt;#19 Remove Nth Node From End of List&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  65. &lt;strong&gt;Remove Duplicates from Sorted List II&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/" rel="noopener noreferrer"&gt;#82 Remove Duplicates from Sorted List II&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Microsoft, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  66. &lt;strong&gt;Rotate List&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/rotate-list/" rel="noopener noreferrer"&gt;#61 Rotate List&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Microsoft, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  67. &lt;strong&gt;Partition List&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/partition-list/" rel="noopener noreferrer"&gt;#86 Partition List&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Microsoft, Meta, Google&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  68. &lt;strong&gt;LRU Cache&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/lru-cache/" rel="noopener noreferrer"&gt;#146 LRU Cache&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber, Oracle&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  🌳 Binary Tree General
&lt;/h2&gt;

&lt;h3&gt;
  
  
  69. &lt;strong&gt;Maximum Depth of Binary Tree&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/maximum-depth-of-binary-tree/" rel="noopener noreferrer"&gt;#104 Maximum Depth of Binary Tree&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  70. &lt;strong&gt;Same Tree&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/same-tree/" rel="noopener noreferrer"&gt;#100 Same Tree&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  71. &lt;strong&gt;Invert Binary Tree&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/invert-binary-tree/" rel="noopener noreferrer"&gt;#226 Invert Binary Tree&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Apple, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  72. &lt;strong&gt;Symmetric Tree&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/symmetric-tree/" rel="noopener noreferrer"&gt;#101 Symmetric Tree&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  73. &lt;strong&gt;Construct Binary Tree from Preorder and Inorder Traversal&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/" rel="noopener noreferrer"&gt;#105 Construct Binary Tree from Preorder and Inorder Traversal&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  74. &lt;strong&gt;Construct Binary Tree from Inorder and Postorder Traversal&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/" rel="noopener noreferrer"&gt;#106 Construct Binary Tree from Inorder and Postorder Traversal&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  75. &lt;strong&gt;Populating Next Right Pointers in Each Node II&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/" rel="noopener noreferrer"&gt;#117 Populating Next Right Pointers in Each Node II&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Microsoft, Google, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  76. &lt;strong&gt;Flatten Binary Tree to Linked List&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/flatten-binary-tree-to-linked-list/" rel="noopener noreferrer"&gt;#114 Flatten Binary Tree to Linked List&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Microsoft, Google, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  77. &lt;strong&gt;Path Sum&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/path-sum/" rel="noopener noreferrer"&gt;#112 Path Sum&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  78. &lt;strong&gt;Sum Root to Leaf Numbers&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/sum-root-to-leaf-numbers/" rel="noopener noreferrer"&gt;#129 Sum Root to Leaf Numbers&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  79. &lt;strong&gt;Binary Tree Maximum Path Sum&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/binary-tree-maximum-path-sum/" rel="noopener noreferrer"&gt;#124 Binary Tree Maximum Path Sum&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  80. &lt;strong&gt;Binary Search Tree Iterator&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/binary-search-tree-iterator/" rel="noopener noreferrer"&gt;#173 Binary Search Tree Iterator&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  81. &lt;strong&gt;Count Complete Tree Nodes&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/count-complete-tree-nodes/" rel="noopener noreferrer"&gt;#222 Count Complete Tree Nodes&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  82. &lt;strong&gt;Lowest Common Ancestor of a Binary Tree&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/" rel="noopener noreferrer"&gt;#236 Lowest Common Ancestor of a Binary Tree&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  🔍 Binary Tree BFS
&lt;/h2&gt;

&lt;h3&gt;
  
  
  83. &lt;strong&gt;Binary Tree Right Side View&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/binary-tree-right-side-view/" rel="noopener noreferrer"&gt;#199 Binary Tree Right Side View&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  84. &lt;strong&gt;Average of Levels in Binary Tree&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/average-of-levels-in-binary-tree/" rel="noopener noreferrer"&gt;#637 Average of Levels in Binary Tree&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  85. &lt;strong&gt;Binary Tree Level Order Traversal&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/binary-tree-level-order-traversal/" rel="noopener noreferrer"&gt;#102 Binary Tree Level Order Traversal&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  86. &lt;strong&gt;Binary Tree Zigzag Level Order Traversal&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/" rel="noopener noreferrer"&gt;#103 Binary Tree Zigzag Level Order Traversal&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  🔎 Binary Search Tree
&lt;/h2&gt;

&lt;h3&gt;
  
  
  87. &lt;strong&gt;Minimum Absolute Difference in BST&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/minimum-absolute-difference-in-bst/" rel="noopener noreferrer"&gt;#530 Minimum Absolute Difference in BST&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  88. &lt;strong&gt;Kth Smallest Element in a BST&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/kth-smallest-element-in-a-bst/" rel="noopener noreferrer"&gt;#230 Kth Smallest Element in a BST&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  89. &lt;strong&gt;Validate Binary Search Tree&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/validate-binary-search-tree/" rel="noopener noreferrer"&gt;#98 Validate Binary Search Tree&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  📊 Graph General
&lt;/h2&gt;

&lt;h3&gt;
  
  
  90. &lt;strong&gt;Number of Islands&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/number-of-islands/" rel="noopener noreferrer"&gt;#200 Number of Islands&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  91. &lt;strong&gt;Surrounded Regions&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/surrounded-regions/" rel="noopener noreferrer"&gt;#130 Surrounded Regions&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  92. &lt;strong&gt;Clone Graph&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/clone-graph/" rel="noopener noreferrer"&gt;#133 Clone Graph&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  93. &lt;strong&gt;Evaluate Division&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/evaluate-division/" rel="noopener noreferrer"&gt;#399 Evaluate Division&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  94. &lt;strong&gt;Course Schedule&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/course-schedule/" rel="noopener noreferrer"&gt;#207 Course Schedule&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  95. &lt;strong&gt;Course Schedule II&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/course-schedule-ii/" rel="noopener noreferrer"&gt;#210 Course Schedule II&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  🔍 Graph BFS
&lt;/h2&gt;

&lt;h3&gt;
  
  
  96. &lt;strong&gt;Snakes and Ladders&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/snakes-and-ladders/" rel="noopener noreferrer"&gt;#909 Snakes and Ladders&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  97. &lt;strong&gt;Minimum Genetic Mutation&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/minimum-genetic-mutation/" rel="noopener noreferrer"&gt;#433 Minimum Genetic Mutation&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  98. &lt;strong&gt;Word Ladder&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/word-ladder/" rel="noopener noreferrer"&gt;#127 Word Ladder&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  🔀 Trie
&lt;/h2&gt;

&lt;h3&gt;
  
  
  99. &lt;strong&gt;Implement Trie (Prefix Tree)&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/implement-trie-prefix-tree/" rel="noopener noreferrer"&gt;#208 Implement Trie (Prefix Tree)&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  100. &lt;strong&gt;Design Add and Search Words Data Structure&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/design-add-and-search-words-data-structure/" rel="noopener noreferrer"&gt;#211 Design Add and Search Words Data Structure&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  101. &lt;strong&gt;Word Search II&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/word-search-ii/" rel="noopener noreferrer"&gt;#212 Word Search II&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  🔙 Backtracking
&lt;/h2&gt;

&lt;h3&gt;
  
  
  102. &lt;strong&gt;Letter Combinations of a Phone Number&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/letter-combinations-of-a-phone-number/" rel="noopener noreferrer"&gt;#17 Letter Combinations of a Phone Number&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  103. &lt;strong&gt;Combinations&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/combinations/" rel="noopener noreferrer"&gt;#77 Combinations&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  104. &lt;strong&gt;Permutations&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/permutations/" rel="noopener noreferrer"&gt;#46 Permutations&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  105. &lt;strong&gt;Combination Sum&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/combination-sum/" rel="noopener noreferrer"&gt;#39 Combination Sum&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  106. &lt;strong&gt;N-Queens II&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/n-queens-ii/" rel="noopener noreferrer"&gt;#52 N-Queens II&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Apple, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  107. &lt;strong&gt;Generate Parentheses&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/generate-parentheses/" rel="noopener noreferrer"&gt;#22 Generate Parentheses&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  108. &lt;strong&gt;Word Search&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/word-search/" rel="noopener noreferrer"&gt;#79 Word Search&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  🔢 Divide &amp;amp; Conquer
&lt;/h2&gt;

&lt;h3&gt;
  
  
  109. &lt;strong&gt;Convert Sorted Array to Binary Search Tree&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/" rel="noopener noreferrer"&gt;#108 Convert Sorted Array to Binary Search Tree&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  110. &lt;strong&gt;Sort List&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/sort-list/" rel="noopener noreferrer"&gt;#148 Sort List&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  111. &lt;strong&gt;Construct Quad Tree&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/construct-quad-tree/" rel="noopener noreferrer"&gt;#427 Construct Quad Tree&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  112. &lt;strong&gt;Merge k Sorted Lists&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/merge-k-sorted-lists/" rel="noopener noreferrer"&gt;#23 Merge k Sorted Lists&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  📦 Kadane's Algorithm
&lt;/h2&gt;

&lt;h3&gt;
  
  
  113. &lt;strong&gt;Maximum Subarray&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/maximum-subarray/" rel="noopener noreferrer"&gt;#53 Maximum Subarray&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  114. &lt;strong&gt;Maximum Sum Circular Subarray&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/maximum-sum-circular-subarray/" rel="noopener noreferrer"&gt;#918 Maximum Sum Circular Subarray&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Bloomberg&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  🔢 Binary Search
&lt;/h2&gt;

&lt;h3&gt;
  
  
  115. &lt;strong&gt;Search Insert Position&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/search-insert-position/" rel="noopener noreferrer"&gt;#35 Search Insert Position&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  116. &lt;strong&gt;Search a 2D Matrix&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/search-a-2d-matrix/" rel="noopener noreferrer"&gt;#74 Search a 2D Matrix&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  117. &lt;strong&gt;Find Peak Element&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/find-peak-element/" rel="noopener noreferrer"&gt;#162 Find Peak Element&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  118. &lt;strong&gt;Search in Rotated Sorted Array&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/search-in-rotated-sorted-array/" rel="noopener noreferrer"&gt;#33 Search in Rotated Sorted Array&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  119. &lt;strong&gt;Find First and Last Position of Element in Sorted Array&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/" rel="noopener noreferrer"&gt;#34 Find First and Last Position of Element in Sorted Array&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  120. &lt;strong&gt;Find Minimum in Rotated Sorted Array&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/" rel="noopener noreferrer"&gt;#153 Find Minimum in Rotated Sorted Array&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  121. &lt;strong&gt;Median of Two Sorted Arrays&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/median-of-two-sorted-arrays/" rel="noopener noreferrer"&gt;#4 Median of Two Sorted Arrays&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  🔢 Heap
&lt;/h2&gt;

&lt;h3&gt;
  
  
  122. &lt;strong&gt;Kth Largest Element in an Array&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/kth-largest-element-in-an-array/" rel="noopener noreferrer"&gt;#215 Kth Largest Element in an Array&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  123. &lt;strong&gt;IPO&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/ipo/" rel="noopener noreferrer"&gt;#502 IPO&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  124. &lt;strong&gt;Find K Pairs with Smallest Sums&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/find-k-pairs-with-smallest-sums/" rel="noopener noreferrer"&gt;#373 Find K Pairs with Smallest Sums&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  125. &lt;strong&gt;Find Median from Data Stream&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/find-median-from-data-stream/" rel="noopener noreferrer"&gt;#295 Find Median from Data Stream&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  🔢 Bit Manipulation
&lt;/h2&gt;

&lt;h3&gt;
  
  
  126. &lt;strong&gt;Add Binary&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/add-binary/" rel="noopener noreferrer"&gt;#67 Add Binary&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Microsoft, Google, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  127. &lt;strong&gt;Reverse Bits&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/reverse-bits/" rel="noopener noreferrer"&gt;#190 Reverse Bits&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  128. &lt;strong&gt;Number of 1 Bits&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/number-of-1-bits/" rel="noopener noreferrer"&gt;#191 Number of 1 Bits&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  129. &lt;strong&gt;Single Number&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/single-number/" rel="noopener noreferrer"&gt;#136 Single Number&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  130. &lt;strong&gt;Single Number II&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/single-number-ii/" rel="noopener noreferrer"&gt;#137 Single Number II&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  131. &lt;strong&gt;Bitwise AND of Numbers Range&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/bitwise-and-of-numbers-range/" rel="noopener noreferrer"&gt;#201 Bitwise AND of Numbers Range&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  📈 Math
&lt;/h2&gt;

&lt;h3&gt;
  
  
  132. &lt;strong&gt;Palindrome Number&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/palindrome-number/" rel="noopener noreferrer"&gt;#9 Palindrome Number&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Microsoft, Google, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  133. &lt;strong&gt;Plus One&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/plus-one/" rel="noopener noreferrer"&gt;#66 Plus One&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Apple, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  134. &lt;strong&gt;Factorial Trailing Zeroes&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/factorial-trailing-zeroes/" rel="noopener noreferrer"&gt;#172 Factorial Trailing Zeroes&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  135. &lt;strong&gt;Sqrt(x)&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/sqrtx/" rel="noopener noreferrer"&gt;#69 Sqrt(x)&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  136. &lt;strong&gt;Pow(x, n)&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/powx-n/" rel="noopener noreferrer"&gt;#50 Pow(x, n)&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  137. &lt;strong&gt;Max Points on a Line&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/max-points-on-a-line/" rel="noopener noreferrer"&gt;#149 Max Points on a Line&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Apple, Adobe&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  🔄 1D Dynamic Programming
&lt;/h2&gt;

&lt;h3&gt;
  
  
  138. &lt;strong&gt;Climbing Stairs&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/climbing-stairs/" rel="noopener noreferrer"&gt;#70 Climbing Stairs&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  139. &lt;strong&gt;House Robber&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/house-robber/" rel="noopener noreferrer"&gt;#198 House Robber&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  140. &lt;strong&gt;Word Break&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/word-break/" rel="noopener noreferrer"&gt;#139 Word Break&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  141. &lt;strong&gt;Coin Change&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/coin-change/" rel="noopener noreferrer"&gt;#322 Coin Change&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  142. &lt;strong&gt;Longest Increasing Subsequence&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/longest-increasing-subsequence/" rel="noopener noreferrer"&gt;#300 Longest Increasing Subsequence&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  📊 Multidimensional DP
&lt;/h2&gt;

&lt;h3&gt;
  
  
  143. &lt;strong&gt;Triangle&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/triangle/" rel="noopener noreferrer"&gt;#120 Triangle&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  144. &lt;strong&gt;Minimum Path Sum&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/minimum-path-sum/" rel="noopener noreferrer"&gt;#64 Minimum Path Sum&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  145. &lt;strong&gt;Unique Paths II&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/unique-paths-ii/" rel="noopener noreferrer"&gt;#63 Unique Paths II&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  146. &lt;strong&gt;Longest Palindromic Substring&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/longest-palindromic-substring/" rel="noopener noreferrer"&gt;#5 Longest Palindromic Substring&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg, Uber&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  147. &lt;strong&gt;Interleaving String&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/interleaving-string/" rel="noopener noreferrer"&gt;#97 Interleaving String&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Google, Meta, Microsoft, Adobe&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  148. &lt;strong&gt;Edit Distance&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/edit-distance/" rel="noopener noreferrer"&gt;#72 Edit Distance&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Apple, Adobe, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  149. &lt;strong&gt;Best Time to Buy and Sell Stock III&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/" rel="noopener noreferrer"&gt;#123 Best Time to Buy and Sell Stock III&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Bloomberg&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  150. &lt;strong&gt;Best Time to Buy and Sell Stock IV&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Link&lt;/strong&gt;: &lt;a href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/" rel="noopener noreferrer"&gt;#188 Best Time to Buy and Sell Stock IV&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Companies&lt;/strong&gt;: Amazon, Meta, Google, Microsoft, Bloomberg&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  🎯 How to Use This Guide
&lt;/h2&gt;

&lt;h3&gt;
  
  
  1. &lt;strong&gt;Start with Easy Problems&lt;/strong&gt;
&lt;/h3&gt;

&lt;p&gt;Begin with the Array &amp;amp; String section and work your way through easy-level problems first. Build confidence before moving to medium and hard problems.&lt;/p&gt;

&lt;h3&gt;
  
  
  2. &lt;strong&gt;Focus on Patterns&lt;/strong&gt;
&lt;/h3&gt;

&lt;p&gt;Notice how problems are grouped by data structures and algorithms. Understanding these patterns will help you recognize similar problems during interviews.&lt;/p&gt;

&lt;h3&gt;
  
  
  3. &lt;strong&gt;Target Company-Specific Problems&lt;/strong&gt;
&lt;/h3&gt;

&lt;p&gt;If you're interviewing at a specific company (e.g., Amazon, Google), prioritize problems frequently asked by that company.&lt;/p&gt;

&lt;h3&gt;
  
  
  4. &lt;strong&gt;Practice Consistently&lt;/strong&gt;
&lt;/h3&gt;

&lt;p&gt;Aim to solve 2-3 problems daily. Consistency is more important than cramming.&lt;/p&gt;

&lt;h3&gt;
  
  
  5. &lt;strong&gt;Master the Fundamentals&lt;/strong&gt;
&lt;/h3&gt;

&lt;p&gt;Don't just memorize solutions. Understand:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Time complexity (Big O notation)&lt;/li&gt;
&lt;li&gt;Space complexity&lt;/li&gt;
&lt;li&gt;Trade-offs between different approaches&lt;/li&gt;
&lt;li&gt;Edge cases and input validation&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  6. &lt;strong&gt;Mock Interviews&lt;/strong&gt;
&lt;/h3&gt;

&lt;p&gt;Practice explaining your thought process out loud. Communication is crucial in technical interviews.&lt;/p&gt;




&lt;h2&gt;
  
  
  📚 Study Plan Suggestions
&lt;/h2&gt;

&lt;h3&gt;
  
  
  &lt;strong&gt;30-Day Sprint Plan&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Week 1&lt;/strong&gt;: Array, String, Two Pointers (5 problems/day)&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Week 2&lt;/strong&gt;: HashMap, Stack, Linked List (5 problems/day)&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Week 3&lt;/strong&gt;: Binary Tree, Graph, Binary Search (5 problems/day)&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Week 4&lt;/strong&gt;: Dynamic Programming, Backtracking, Review (5 problems/day)&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  &lt;strong&gt;60-Day Comprehensive Plan&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Weeks 1-2&lt;/strong&gt;: Arrays &amp;amp; Strings (3 problems/day)&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Weeks 3-4&lt;/strong&gt;: Two Pointers, Sliding Window, Matrix (3 problems/day)&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Weeks 5-6&lt;/strong&gt;: HashMap, Intervals, Stack (3 problems/day)&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Weeks 7-8&lt;/strong&gt;: Linked List, Binary Trees (2-3 problems/day)&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Weeks 9-10&lt;/strong&gt;: Graphs, Trie, Backtracking (2-3 problems/day)&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Weeks 11-12&lt;/strong&gt;: Dynamic Programming, Review (2-3 problems/day)&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  &lt;strong&gt;90-Day Deep Dive&lt;/strong&gt;
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;Follow the 60-day plan but spend more time on:

&lt;ul&gt;
&lt;li&gt;Understanding multiple solutions per problem&lt;/li&gt;
&lt;li&gt;Optimizing your initial solutions&lt;/li&gt;
&lt;li&gt;Writing clean, production-quality code&lt;/li&gt;
&lt;li&gt;Practicing system design basics alongside coding&lt;/li&gt;
&lt;/ul&gt;


&lt;/li&gt;

&lt;/ul&gt;




&lt;h2&gt;
  
  
  💡 Pro Tips for Success
&lt;/h2&gt;

&lt;ol&gt;
&lt;li&gt;&lt;p&gt;&lt;strong&gt;Understand Before Memorizing&lt;/strong&gt;: Don't just memorize solutions. Understand the underlying principles and patterns.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;&lt;strong&gt;Write Clean Code&lt;/strong&gt;: Practice writing readable code with proper variable names and comments during practice sessions.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;&lt;strong&gt;Handle Edge Cases&lt;/strong&gt;: Always consider empty inputs, single elements, duplicates, and boundary conditions.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;&lt;strong&gt;Optimize Progressively&lt;/strong&gt;: Start with a brute force solution, then optimize. Interviewers want to see your thought process.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;&lt;strong&gt;Learn from Mistakes&lt;/strong&gt;: Review problems you got wrong. Understand why you struggled and what concept you need to reinforce.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;&lt;strong&gt;Time Yourself&lt;/strong&gt;: Practice under time constraints to simulate real interview pressure.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;&lt;strong&gt;Use the Right Data Structure&lt;/strong&gt;: Understanding when to use arrays, hash maps, heaps, or trees is crucial.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;&lt;strong&gt;Master Common Patterns&lt;/strong&gt;: Two pointers, sliding window, BFS/DFS, dynamic programming, and backtracking appear repeatedly.&lt;/p&gt;&lt;/li&gt;
&lt;/ol&gt;




&lt;h2&gt;
  
  
  🚀 Final Thoughts
&lt;/h2&gt;

&lt;p&gt;Preparing for technical interviews is a marathon, not a sprint. These 150 problems represent a carefully curated selection of the most important questions asked by top tech companies. &lt;/p&gt;

&lt;p&gt;Remember that the goal isn't just to solve all 150 problems—it's to deeply understand the patterns, algorithms, and data structures they represent. Quality over quantity is key.&lt;/p&gt;

&lt;p&gt;Stay consistent, be patient with yourself, and don't get discouraged by difficult problems. Every problem you solve makes you a better engineer and brings you one step closer to landing your dream job.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Good luck with your preparation! You've got this! 💪&lt;/strong&gt;&lt;/p&gt;




&lt;h2&gt;
  
  
  📖 Additional Resources
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;LeetCode Discuss&lt;/strong&gt;: Read solutions and discussions from the community&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;NeetCode&lt;/strong&gt;: Video explanations for popular problems&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Algorithms Textbook&lt;/strong&gt;: "Introduction to Algorithms" by CLRS&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;YouTube Channels&lt;/strong&gt;: Abdul Bari, Back To Back SWE, Tech Dose&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Practice Platforms&lt;/strong&gt;: LeetCode, HackerRank, CodeSignal&lt;/li&gt;
&lt;/ul&gt;




&lt;p&gt;&lt;em&gt;Found this guide helpful? Follow me for more technical interview preparation content!&lt;/em&gt;&lt;/p&gt;

&lt;p&gt;&lt;em&gt;Have questions or suggestions? Drop a comment below!&lt;/em&gt;&lt;/p&gt;

</description>
      <category>algorithms</category>
      <category>career</category>
      <category>programming</category>
      <category>webdev</category>
    </item>
    <item>
      <title>How to Build Recommendations That Connect Across Movies, Music, Books, and Art</title>
      <dc:creator>Soham</dc:creator>
      <pubDate>Sun, 28 Sep 2025 17:52:53 +0000</pubDate>
      <link>https://dev.to/soham0047/how-to-build-recommendations-that-connect-across-movies-music-books-and-art-bmg</link>
      <guid>https://dev.to/soham0047/how-to-build-recommendations-that-connect-across-movies-music-books-and-art-bmg</guid>
      <description>&lt;h1&gt;
  
  
  CultureSense: Building an AI-Powered Cultural Discovery Platform That Actually Understands Your Taste
&lt;/h1&gt;

&lt;p&gt;&lt;em&gt;How I built a modern cultural recommendation system using multiple AI models, React, and MongoDB to create personalized experiences for movies, music, literature, art, and design discovery.&lt;/em&gt;&lt;/p&gt;




&lt;h2&gt;
  
  
  The Problem: Generic Recommendations in a Rich Cultural Landscape
&lt;/h2&gt;

&lt;p&gt;We've all been there. Netflix suggests another generic action movie. Spotify's "Discover Weekly" feels more like "Rediscover What Everyone Else Likes." Goodreads recommends books based on crude genre tags. The problem with most recommendation systems today is that they treat culture like data points rather than the rich, interconnected web of human expression it truly is.&lt;/p&gt;

&lt;p&gt;What if there was a platform that understood not just what you liked, but &lt;em&gt;why&lt;/em&gt; you liked it? What if it could connect the dots between your love for Wes Anderson's symmetrical cinematography, your fascination with brutalist architecture, and your preference for minimalist electronic music?&lt;/p&gt;

&lt;p&gt;That's exactly what I set out to build with &lt;strong&gt;CultureSense&lt;/strong&gt;.&lt;/p&gt;

&lt;h2&gt;
  
  
  The Vision: A Unified Cultural Discovery Engine
&lt;/h2&gt;

&lt;p&gt;CultureSense isn't just another recommendation app—it's a cultural discovery platform that treats your taste as a complex, evolving ecosystem. The core idea was simple but ambitious: create an AI-powered system that could understand cultural patterns across multiple domains (movies, music, literature, art, and design) and provide truly personalized recommendations.&lt;/p&gt;

&lt;p&gt;But here's the kicker: instead of relying on a single AI model that might fail or provide generic responses, I built a sophisticated fallback system using &lt;strong&gt;four different AI providers&lt;/strong&gt; to ensure users always get intelligent, contextual recommendations.&lt;/p&gt;

&lt;h2&gt;
  
  
  The Technical Challenge: Building a Bulletproof AI Architecture
&lt;/h2&gt;

&lt;h3&gt;
  
  
  The Multi-Model Approach
&lt;/h3&gt;

&lt;p&gt;The heart of CultureSense lies in its AI architecture. Rather than putting all my eggs in one AI basket, I implemented a cascade system:&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;
&lt;strong&gt;Google Gemini Pro&lt;/strong&gt; (Primary) - For conversational cultural discussions&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Mistral AI Large&lt;/strong&gt; - For high-quality cultural analysis with multilingual support
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;OpenRouter (Claude 3.5 Sonnet)&lt;/strong&gt; - For deep cultural pattern analysis&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Together AI (Llama 3 70B)&lt;/strong&gt; - For large context cultural content analysis&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Static Responses&lt;/strong&gt; - Ultimate fallback to ensure the app never breaks&lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;This approach guarantees 99.9% uptime for AI features while maintaining response times between 2-5 seconds.&lt;/p&gt;

&lt;h3&gt;
  
  
  The Cultural Context Secret Sauce
&lt;/h3&gt;

&lt;p&gt;What makes CultureSense different isn't just the technology—it's how I trained the AI models to think about culture. Every AI interaction includes rich cultural context:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;CULTURAL_CONTEXT&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="s2"&gt;`
You are CultureSense AI, an advanced cultural discovery assistant. 
Your expertise includes:
- Analyzing cultural preferences and taste patterns
- Understanding aesthetic preferences and artistic movements
- Identifying cultural trends and cross-domain influences
- Providing personalized cultural insights
`&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;This means the AI doesn't just recommend "popular movies"—it understands the aesthetic connection between your love for A24 films, your Pinterest boards full of minimalist interiors, and your Spotify playlists heavy on atmospheric post-rock.&lt;/p&gt;

&lt;h2&gt;
  
  
  The Tech Stack: Modern, Scalable, Developer-Friendly
&lt;/h2&gt;

&lt;h3&gt;
  
  
  Frontend: React + TypeScript + Modern Tooling
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;React 18 with TypeScript&lt;/strong&gt; for type safety and modern React features&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Vite&lt;/strong&gt; for lightning-fast development and building&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Tailwind CSS + shadcn/ui&lt;/strong&gt; for consistent, beautiful design&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;React Query&lt;/strong&gt; for intelligent data fetching and caching&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;React Hook Form + Zod&lt;/strong&gt; for bulletproof form validation&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  Backend: Node.js + MongoDB + Smart Security
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Express.js&lt;/strong&gt; with comprehensive middleware&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;MongoDB with Mongoose&lt;/strong&gt; for flexible data modeling&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Passport.js&lt;/strong&gt; for secure Google OAuth&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Rate limiting, CORS, and Helmet&lt;/strong&gt; for production security&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Winston logging&lt;/strong&gt; for debugging and monitoring&lt;/li&gt;
&lt;/ul&gt;

&lt;h2&gt;
  
  
  Key Features That Make Users Stick Around
&lt;/h2&gt;

&lt;h3&gt;
  
  
  1. Personalized Cultural Discovery
&lt;/h3&gt;

&lt;p&gt;Instead of generic trending lists, users get recommendations based on their unique cultural fingerprint. The AI analyzes their preferences across all domains to suggest connections they never would have made.&lt;/p&gt;

&lt;h3&gt;
  
  
  2. Interactive AI Chat
&lt;/h3&gt;

&lt;p&gt;Users can have natural conversations about culture: "I loved the cinematography in Blade Runner 2049—what books have similar atmospheric world-building?" The AI maintains context across conversations and learns from each interaction.&lt;/p&gt;

&lt;h3&gt;
  
  
  3. Cross-Domain Connections
&lt;/h3&gt;

&lt;p&gt;This is where CultureSense really shines. It might recommend a brutalist architecture photography book because you loved the stark visuals in a particular sci-fi film, or suggest a minimalist electronic artist because of your preference for clean, geometric art.&lt;/p&gt;

&lt;h3&gt;
  
  
  4. Cultural Analytics Dashboard
&lt;/h3&gt;

&lt;p&gt;Users can track their cultural journey—see how their tastes evolve, discover patterns in their preferences, and get insights into their cultural personality.&lt;/p&gt;

&lt;h2&gt;
  
  
  The Development Journey: Lessons Learned
&lt;/h2&gt;

&lt;h3&gt;
  
  
  Challenge 1: AI Reliability
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Problem&lt;/strong&gt;: Single AI providers can be unreliable, slow, or expensive.&lt;br&gt;
&lt;strong&gt;Solution&lt;/strong&gt;: Built an intelligent fallback system that tries multiple providers with exponential backoff and graceful degradation.&lt;/p&gt;

&lt;h3&gt;
  
  
  Challenge 2: Cultural Context
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Problem&lt;/strong&gt;: Generic AI responses don't understand nuanced cultural connections.&lt;br&gt;
&lt;strong&gt;Solution&lt;/strong&gt;: Crafted detailed cultural context prompts and fine-tuned the conversation flow to maintain domain expertise.&lt;/p&gt;

&lt;h3&gt;
  
  
  Challenge 3: Performance at Scale
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Problem&lt;/strong&gt;: Multiple AI calls could slow down the app.&lt;br&gt;
&lt;strong&gt;Solution&lt;/strong&gt;: Implemented intelligent caching, request queuing, and a 30-second timeout system with performance monitoring.&lt;/p&gt;

&lt;h2&gt;
  
  
  The Numbers: Real-World Performance
&lt;/h2&gt;

&lt;p&gt;After three months of development and testing:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;85% user satisfaction&lt;/strong&gt; with AI recommendations&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Average 2-5 second response times&lt;/strong&gt; across all AI models&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;99.9% uptime&lt;/strong&gt; for AI features through the fallback system&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;100+ concurrent AI requests&lt;/strong&gt; handled smoothly&lt;/li&gt;
&lt;/ul&gt;

&lt;h2&gt;
  
  
  What's Next: The Cultural Discovery Revolution
&lt;/h2&gt;

&lt;p&gt;CultureSense represents just the beginning of what's possible when we combine AI intelligence with deep cultural understanding. The platform is already expanding with features like:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Cultural taste matching&lt;/strong&gt; between users&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Trend prediction&lt;/strong&gt; based on cross-cultural analysis
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Creator discovery&lt;/strong&gt; tools for finding emerging artists&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Cultural event recommendations&lt;/strong&gt; based on user preferences&lt;/li&gt;
&lt;/ul&gt;

&lt;h2&gt;
  
  
  Try It Yourself
&lt;/h2&gt;

&lt;p&gt;CultureSense is open source and available on GitHub. The entire codebase, deployment instructions, and documentation are available for developers who want to explore how modern AI-powered recommendations work.&lt;/p&gt;

&lt;p&gt;Whether you're a developer interested in AI architecture, a cultural enthusiast looking for better recommendations, or someone curious about the intersection of technology and taste, CultureSense offers something unique in the cultural discovery space.&lt;br&gt;
&lt;strong&gt;&lt;a href="https://culturesense.netlify.app" rel="noopener noreferrer"&gt;Try Live Example&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;&lt;a href="https://github.com/Soham-0047/culturefit" rel="noopener noreferrer"&gt;Check out the GitHub repository&lt;/a&gt;&lt;/strong&gt; and experience the future of cultural discovery.&lt;/p&gt;




&lt;p&gt;&lt;em&gt;What cultural connections have you discovered recently? How do you think AI can better understand and recommend cultural content? Let me know in the comments below.&lt;/em&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  About the Tech
&lt;/h2&gt;

&lt;p&gt;Built with love using React, Node.js, MongoDB, and four different AI providers. Full deployment guides and documentation available in the repository. Contributions welcome!&lt;/p&gt;

</description>
      <category>machinelearning</category>
      <category>webdev</category>
      <category>mern</category>
      <category>ai</category>
    </item>
    <item>
      <title>GreenCode Sentiment Hub</title>
      <dc:creator>Soham</dc:creator>
      <pubDate>Sun, 06 Apr 2025 11:48:24 +0000</pubDate>
      <link>https://dev.to/soham0047/greencode-sentiment-hub-lin</link>
      <guid>https://dev.to/soham0047/greencode-sentiment-hub-lin</guid>
      <description>&lt;p&gt;&lt;em&gt;This is a submission for the &lt;a href="https://dev.to/challenges/pulumi"&gt;Pulumi Deploy and Document Challenge&lt;/a&gt;: Shhh, It's a Secret!&lt;/em&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  What I Built
&lt;/h2&gt;

&lt;p&gt;I built &lt;strong&gt;GreenCode Sentiment Hub&lt;/strong&gt;, a full-stack MERN app that analyzes GitHub pull requests for sentiment and environmental impact. The frontend side lets users input their GitHub Personal Access Token (PAT) and repo details, while the backend (Node.js/Express) fetches PR data, uses Hugging Face’s API to assess sentiment, and calculates a carbon impact score based on code changes. It then updates PRs with labels like "Positive" or "Critical" and comments like "Green Code!" for eco-friendly changes. Deployed on Render (backend) and Netlify (frontend), it uses MongoDB Atlas for storage and WebSockets for real-time updates.&lt;/p&gt;

&lt;h2&gt;
  
  
  Live Demo Link
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Full Web App&lt;/strong&gt;: &lt;a href="https://greencode-sentiment.netlify.app" rel="noopener noreferrer"&gt;https://greencode-sentiment.netlify.app&lt;/a&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Youtube&lt;/strong&gt;:
  &lt;iframe src="https://www.youtube.com/embed/UcdxpkgVb6o"&gt;
  &lt;/iframe&gt;
&lt;/li&gt;
&lt;/ul&gt;

&lt;h2&gt;
  
  
  Project Repo
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;&lt;a href="https://github.com/Soham-0047/Pulumi-github-analysis.git" rel="noopener noreferrer"&gt;https://github.com/Soham-0047/Pulumi-github-analysis.git&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;

&lt;h2&gt;
  
  
  My Journey
&lt;/h2&gt;

&lt;p&gt;I started wanting to use Pulumi’s Automation API to manage GitHub resources, but hit roadblocks and ended up with a simpler, CLI-free solution. I aimed for a no-CLI setup, but the Automation API kept demanding &lt;code&gt;pulumi version&lt;/code&gt;, throwing errors like crazy. Regenerated my PAT with &lt;code&gt;repo&lt;/code&gt; scope, tested it, and boom—labels started sticking. I ditched the Automation API and used &lt;code&gt;axios&lt;/code&gt; to hit GitHub’s REST API directly—less fancy, but it worked!&lt;/p&gt;

&lt;h2&gt;
  
  
  Using Pulumi ESC
&lt;/h2&gt;

&lt;p&gt;I leveraged Pulumi ESC to securely manage my app’s sensitive data—specifically, the Hugging Face API key for sentiment analysis. created an ESC environment in Pulumi Cloud. I used the @pulumi/esc-sdk to fetch the key at runtime. It provided a centralized, encrypted way to manage secrets, which was a lifesaver when deploying to Render. I didn’t use Pulumi Copilot (the AI assistant) since my focus was on manual configuration, but ESC alone proved its worth by keeping my secrets safe and accessible&lt;/p&gt;

&lt;h5&gt;
  
  
  Above image created by AI
&lt;/h5&gt;

</description>
      <category>devchallenge</category>
      <category>pulumichallenge</category>
      <category>webdev</category>
      <category>cloud</category>
    </item>
    <item>
      <title>How to Use Cloud Spanner to Create and Manage NoSQL Databases</title>
      <dc:creator>Soham</dc:creator>
      <pubDate>Tue, 28 Nov 2023 07:07:05 +0000</pubDate>
      <link>https://dev.to/soham0047/how-to-use-cloud-spanner-to-create-and-manage-nosql-databases-38dp</link>
      <guid>https://dev.to/soham0047/how-to-use-cloud-spanner-to-create-and-manage-nosql-databases-38dp</guid>
      <description>&lt;p&gt;In database management cloud spanner by google cloud platform stands for powerful and highly scalable NoSQL database solution. Cloud spanner offers the consistency of traditional databases and the scalability of NoSQL databases. &lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Primary Technologies Used:&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Cloud Spanner: A globally distributed, consistent and horizontally scalable database service offered by google cloud platform.&lt;/p&gt;

&lt;p&gt;NoSQL database: A type of database that provides a mechanism for storage and retrieval data that is modeled.&lt;/p&gt;

&lt;p&gt;Strong Consistency: For the database for any read operation, the most recent write operation will be available.&lt;/p&gt;

&lt;p&gt;Horizontal Scaling: The ability to connecting multiple hardwares and softwares that they work as single logic unit.&lt;/p&gt;

&lt;p&gt;Steps:&lt;/p&gt;

&lt;p&gt;Create the cloud spanner instance: To create the cloud spanner instance follow up the below&lt;/p&gt;

&lt;p&gt;Log in to the google cloud console.&lt;br&gt;
navigate to the cloud spanner section.&lt;br&gt;
Click the 'create instance' and fill the instance ID and configuration.&lt;/p&gt;

&lt;p&gt;Creating the database: Create the database from google cloud spanner.&lt;/p&gt;

&lt;p&gt;Within cloud spanner instance go to the "Databases" section.&lt;br&gt;
click on "Create database" and specify the database name and schema.&lt;/p&gt;

&lt;p&gt;Data insertion query: Use this below SQL query to insert data into cloud spanner database.&lt;/p&gt;

&lt;p&gt;&lt;code&gt;INSERT INTO Users (UserID, Username, Email) VALUES (1, 'Abcde', 'geeksforgeeks@gmail.com');&lt;/code&gt;&lt;/p&gt;

&lt;p&gt;In modern application cloud spanner offers a robust and scalable NoSQL database solution with flexibility and performance.&lt;/p&gt;

</description>
      <category>nosql</category>
      <category>sql</category>
      <category>webdev</category>
      <category>cloud</category>
    </item>
    <item>
      <title>Exploring Simple Game Development Techniques using Text Editors</title>
      <dc:creator>Soham</dc:creator>
      <pubDate>Tue, 31 Oct 2023 04:34:43 +0000</pubDate>
      <link>https://dev.to/soham0047/exploring-simple-game-development-techniques-using-text-editors-16da</link>
      <guid>https://dev.to/soham0047/exploring-simple-game-development-techniques-using-text-editors-16da</guid>
      <description>&lt;p&gt;In the world of game development text editors, game engines and sophisticated software tools frequently taken the limelight. Simplicity and minimalist design most important feature of the game development. Text editors are powerful tool for text based as well as complex games. In this article we will explore how text editors used to create simple games, benefits, limitations, and techniques.&lt;/p&gt;

&lt;p&gt;Most popular text editors such as Notepad++, Visual Studio Code, Subline Text used to write the script for development. This code editors offers vast variety of features such as code wrapper, syntax highlighting, auto complete etc. One of the advantages for the game development is the simplicity of workflow. Someone can start building interactive gaming experience with just few lines of code. They may lack the visual bells and skreiches of dedicated game development, they provide flexible, lightweight game environment.&lt;/p&gt;

&lt;p&gt;Text editors allow the developers to focus on the game logic, core code structure without getting lost in complex IDE’s and engines. To begin the game journey, used to programming languages that supports graphics and interactivity. Programming languages included Python, JavaScript, C++/C#. These languages offer straightforward syntax and bunch of libraries and frameworks that can simplify the game development.&lt;/p&gt;

&lt;p&gt;Let us discuss some techniques for creating games using a text editor.&lt;/p&gt;

&lt;p&gt;ASCII Graphic arts: ASCII graphic art involves characters from the ASCII character to set a visual representation. With the manipulating the characters can be design the entire game elements, entire environment. As for ASCII characters are limited, so added own creativity or a unique aesthetic to the game.&lt;/p&gt;

&lt;p&gt;Basic Graphic Interface: text editors do not have the built in graphic capabilities, but they can be used to create basic 2D games. By using different programming languages libraires such as Pygame for Python, p5.js for JavaScript, someone can add animations, images, draw shapes within the text editor.&lt;/p&gt;

&lt;p&gt;Terminal-Based Games: Text editors can be best choice for terminal based games. It increases the power of terminal commands. Developer can create interactive adventures, puzzles, or simple simulations. Text based interfaces give a nostalgic gaming experience reminiscent of early computer games.&lt;/p&gt;

&lt;p&gt;Interactive Fiction: Text editors are excellent tool for build story based interactive sci-fi games that also known as text adventure. With a focus on text-based narratives and user inputs, can be create captivating stories where players make choices the affect the outcome. Some tools like Twin provide a user-friendly environment for writing the code and organizing the interactive items for game development.&lt;/p&gt;

&lt;p&gt;Puzzle Based and Procedural Games: Text editors can be used to develop and implement the design of puzzle games which includes problem solving skills, maze-solving experience, math challenges. With the help of algorithms and randomization, text editors can used to create games with procedural generation.&lt;/p&gt;

&lt;p&gt;Multiplayer text games: Text editors can facilitate the development of multiplayer text games where players can interact with each other in real time. Developer can implement networking functionalities, enable players connect with each other’s, chat and engage in collaborative or competitive gameplay. This approach is well suited for Multiple User Dungeons or storytelling experiences.&lt;/p&gt;

&lt;p&gt;AI Simulations: In latest era text editors provide enhanced environment for developing simple AI simulations and virtual worlds. In this editor developers can implement basic artificial intelligence behaviors, such as pathfinding, decision making, autonomous moves. Text editors also offer efficient way to prototype the game ideas. Before star with the design and core mechanics, rapidly test the different gameplay concepts. Prototyping the editors validate ideas, and give the significant time and effort for building more complex, elaborate game structures.&lt;/p&gt;

&lt;p&gt;Despite the simplicity and flexibility text editors for gam e development also restrict some, limitations. Within the text editors some complex 3D scenes, advanced physics for the characters, simulation visualization can be challenging. In these cases, special game engines such as Unity (C#), Unreal Engine (C++) very popular and effective to build game projects. Using text editors for simple game developing help the game developers to gain a deeper understanding of game logic, programming concepts, principles. From this one should build solid foundation before tackling into more complex game development pipelines.&lt;/p&gt;

&lt;p&gt;While text editors may not be the beast choice for professional game development. Text editors provide very lightweight and flexible environment to bring game ideas to life.&lt;/p&gt;

</description>
      <category>games</category>
      <category>story</category>
      <category>game</category>
      <category>design</category>
    </item>
    <item>
      <title>List of Top 110 Unicorn Startups in India</title>
      <dc:creator>Soham</dc:creator>
      <pubDate>Sat, 14 Oct 2023 14:41:59 +0000</pubDate>
      <link>https://dev.to/soham0047/list-of-top-110-unicorn-startups-in-india-3ea3</link>
      <guid>https://dev.to/soham0047/list-of-top-110-unicorn-startups-in-india-3ea3</guid>
      <description>&lt;p&gt;Startup Name    Industry    Founding Year   Unicorn Entry Year  Profit/Loss FY22    Current Valuation   Acquisitions    Status&lt;/p&gt;

&lt;p&gt;Zepto   Quick Commerce  2021    2023    -$47.1 Million  $1.4 Billion    -   Private&lt;br&gt;
Molbio Diagnostics  HealthTech, MedTech 2010    2022    NA  $1.5 Billion    1   Private&lt;br&gt;
Tata 1mg    HealthTech  2015    2022    -$65 Million    $1.25 Billion   -   Acquired&lt;br&gt;
Shiprocket  Logistics   2017    2022    -$11.67 Million $1.3 Billion    5   Private&lt;br&gt;
5ire    Fintech 2021    2022    NA  $1.5 Billion    1   Private&lt;br&gt;
OneCard Fintech 2018    2022    -$22.8 Million  $1.4 Billion    0   Private&lt;br&gt;
PhysicsWallah   Edtech  2016    2022    $16.4 Million   $1.1 Billion    6   Private&lt;br&gt;
LeadSquared SaaS- CRM   2011    2022    -$7.7 Million   $1 Billion  -   Private&lt;br&gt;
ElasticRun  E-commerce Logistics    2015    2022    -$45.1 Million  $1.5 Billion    -   Private&lt;br&gt;
LEAD    Edtech  2012    2022    -$49.6 Million  $1.1 Billion    2   Private&lt;br&gt;
Purplle E-commerce Personal Care    2012    2022    -$25 Million    $1.1 Billion    1   Private&lt;br&gt;
DealShare   E-commerce  2018    2022    -$53.8 Million  $1.7 Billion    0   Private&lt;br&gt;
Xpressbees  E-commerce Logistics    2015    2022    -$3.39 Million  $1.2 Billion    1   Private&lt;br&gt;
Open    Fintech 2017    2022    -$20.9 Million  $1 Billion  2   Private&lt;br&gt;
Games24x7   Gaming  2006    2022    -$39 Million    $2.5 Billion    0   Private&lt;br&gt;
Amagi   Media, Advertising  2008    2022    NA  $1.4 Billion    1   Private&lt;br&gt;
Fractal SaaS- Analytics 2000    2022    -$18.4 Billion  $1 Billion  7   Private&lt;br&gt;
Darwinbox   SaaS- HR    2015    2022    -$7.6 Million   $1 Billion  0   Private&lt;br&gt;
Livspace    E-commerce Interior Design  2014    2022    -$51 Million    $1.2 Billion    4   Private&lt;br&gt;
Uniphore    SaaS- Conversational Automation 2008    2022    NA  $2.5 Billion    5   Private&lt;br&gt;
Hasura  SaaS- Programming Tools 2017    2022    NA  $1 Billion  0   Private&lt;br&gt;
Yubi (Formerly CredAvenue)  Fintech 2017    2022    -$7 million $1.5 Billion    3   Private&lt;br&gt;
CommerceIQ  E-commerce Management Platform  2012    2022    NA  $1 Billion  0   Private&lt;br&gt;
Oxyzo   Fintech 2016    2022    $8.6 Million    $1 Billion  0   Private&lt;br&gt;
Moglix  E-commerce  2015    2021    -$2.5 Million   $2.6 Billion    2   Private&lt;br&gt;
NoBroker    PropTech    2014    2021    NA  $1 Billion  1   Private&lt;br&gt;
MobiKwik    Fintech 2009    2021    -$16 Million    $0.9 Billion    1   Private&lt;br&gt;
Spinny  Automotive, E-commerce  2015    2021    -$61.2 Million  $1.75 Billion   3   Private&lt;br&gt;
MPL ESports 2018    2021    -$56 Million    $2.3 Billion    3   Private&lt;br&gt;
Acko    Insurtech   2016    2021    -$45.1 Million  $1.1 Billion    2   Private&lt;br&gt;
ShareChat   Media &amp;amp; Entertainment   2015    2021    -$373 Million   $5 Billion  6   Private&lt;br&gt;
Eruditus    Edtech  2010    2021    -$386.8 Million $3.2 Billion    1   Private&lt;br&gt;
upGrad  Edtech  2015    2021    -$78.3 Million  $2.25 Billion   14  Private&lt;br&gt;
Apna    Marketplace- Employment 2019    2021    -$14 Million    $1.1 Billion    0   Private&lt;br&gt;
Urban Company   Home Services   2014    2021    -$64 Million    $2.8 Billion    3   Private&lt;br&gt;
BharatPe    Fintech Payments    2018    2021    -$702 Million   $2.9 Billion    2   Private&lt;br&gt;
CarDekho    E-commerce Automotives  2007    2021    -$29 Million    $1.2 Billion    3   Private&lt;br&gt;
Licious E-commerce Meat Products    2015    2021    -$106 Million   $1.5 Billion    0   Private&lt;br&gt;
Zetwerk Manufacturing   2018    2021    -$10.4 Million  $2.7 Billion    4   Private&lt;br&gt;
Meesho  E-commerce  2015    2021    -$406 Million   $4.9 Billion    0   Private&lt;br&gt;
Blinkit (ex-Grofers)    E-commerce- Groceries   2013    2021    -$127 Million   $0.568 Billion  -   Acquired&lt;br&gt;
Pristyn Care    Healthtech  2018    2021    NA  $1.4 Billion    1   Private&lt;br&gt;
Vedantu Edtech  2011    2021    -$87 Million    $1 Billion  3   Private&lt;br&gt;
Upstox  Fintech 2010    2021    -$55.5 Million  $3.4 Billion    0   Private&lt;br&gt;
Slice   Fintech 2016    2021    -$31 Million    $1.5 Billion    1   Private&lt;br&gt;
CRED    Financial Technology    2018    2021    -$160 Million   $6.4 Billion    4   Private&lt;br&gt;
Cult.fit    Healthtech  2016    2021    -$85 Million    $1.5 Billion    14  Private&lt;br&gt;
Mamaearth   E-commerce Personal Care    2016    2021    $2.8 Million    $1.2 Billion    4   Private&lt;br&gt;
Infra.Market    B2B E-commerce  2016    2021    $28.3 Million   $2.5 Billion    3   Private&lt;br&gt;
Five Star Business Finance  Financial Services  1984    2021    -   $1.4 Billion    0   Listed&lt;br&gt;
OfBusiness  Building Materials  2015    2021    $34.4 Million   $4.8 Billion    1   Private&lt;br&gt;
CoinSwitch Kuber    Cryptocurrencies    2017    2021    NA  $1.9 Billion    0   Private&lt;br&gt;
CoinDCX Cryptocurrency Exchange 2018    2021    $5.1 Million    $2.15 Billion   0   Private&lt;br&gt;
BlackBuck   Logistics   2015    2021    -$35 Million    $1.02 Billion   0   Private&lt;br&gt;
Droom   Marketplace- Automotives    2014    2021    -$17 Million    $1.2 Billion    1   Private&lt;br&gt;
PharmEasy   Online Pharmacy 2015    2021    NA  $5.6 Billion    3   Private&lt;br&gt;
MyGlamm (Good Glamm Group)  Personal Care Marketplace   2015    2021    -$36 Million    $1.2 Billion    7   Private&lt;br&gt;
Digit Insurance Insurance   2016    2021    NA  $4 Billion  1   Private&lt;br&gt;
Innovaccer  Healthcare  2014    2021    NA  $3.2 Billion    0   Private&lt;br&gt;
Groww   Fintech 2017    2021    -$29.5  $3 Billion  1   Private&lt;br&gt;
Gupshup Enterprisetech  2004    2021    $7.06 Million   $1.4 Billion    5   Private&lt;br&gt;
Chargebee   Financial Services  2011    2021    $3.9 Million    $3.5 Billion    3   Private&lt;br&gt;
Zeta    Fintech 2015    2021    NA  $1.5 Billion    0   Private&lt;br&gt;
BrowserStack    Cloud Infrastructure and Software   2011    2021    $12.5 Million   $4 Billion  3   Private&lt;br&gt;
Mohalla Tech (Moj)  Software    2015    2021    NA  $5 Billion  6   Private&lt;br&gt;
Polygon (Formerly Matic Network)    Blockchain  2018    2021    NA  $10 Billion 3   Private&lt;br&gt;
MindTickle  Saas- Enterprise Software   2011    2021    $3.5 Million    $1.2 Billion    1   Private&lt;br&gt;
Rebel Foods E-commerce Food Delivery    2011    2021    -$66.7 Million  $1.4 Billion    1   Private&lt;br&gt;
Mensa Brands    Ecommerce, Financial Services   2021    2021    -$12 Million    $1.2 Billion    20  Private&lt;br&gt;
GlobalBees  E-commerce Retail   2021    2021    -$4.4 Million   $1.1 Billion    11  Private&lt;br&gt;
DailyHunt   Media &amp;amp; Entertainment   2007    2020    -   $5 Billion  2   Private&lt;br&gt;
Unacademy   Edtech  2015    2020    -$357 Million   $3.4 Billion    12  Private&lt;br&gt;
Cars24  B2C E-commerce  2015    2020    -$31 Million    $3.3 Billion    0   Private&lt;br&gt;
Glance, Inmobi  Mobile Technology   2019    2020    NA  $1.7 Billion    2   Private&lt;br&gt;
RazorPay    Fintech 2014    2020    $1.14 Million   $7.5 Billion    7   Private&lt;br&gt;
Zerodha Stockbroker 2010    2020    $349.9 Million  $2 Billion  0   Private&lt;br&gt;
PhonePe Fintech 2015    2020    -$251.6 Million $12 Billion 6   Acquired by Flipkart&lt;br&gt;
FirstCry    E-commerce  2010    2020    $6.39 Million   $3 Billion  2   Private&lt;br&gt;
Nykaa   E-commerce  2012    2020    $4.96 Million   $4.44 Billion   6   Listed&lt;br&gt;
Pine Labs   Fintech 1998    2020    NA  $5 Billion  6   Private&lt;br&gt;
HighRadius  Fintech 2006    2020    NA  $3.1 Billion    0   Private&lt;br&gt;
Verse Innovation    Media &amp;amp; Entertainment   2007    2020    -$320 Million   $5 Billion  3   Private&lt;br&gt;
Zenoti  Saas- Spa and Salon Services    2010    2020    NA  $1.5 Billion    1   Private&lt;br&gt;
Postman Saas- API Development and Testing   2014    2020    NA  $5.6 Billion    0   Private&lt;br&gt;
Delhivery   E-commerce Logistics Services   2011    2019    -$128 Million   $3.27 Billion   5   Listed&lt;br&gt;
Icertis Saas- Contract Management   2009    2019    NA  $5 Billion  0   Private&lt;br&gt;
Ola Electric    Automotive  2017    2019    NA  $5 Billion  1   Private&lt;br&gt;
Druva   Saas- Data Management   2008    2019    NA  $2 Billion  3   Acquired&lt;br&gt;
BigBasket   E-commerce- Groceries   2011    2019    -$100 Million   $3.2 Billion    6   Acquired&lt;br&gt;
Rivigo  Logistics   2014    2019    -$21 Million    $1.05 Billion   0   Private&lt;br&gt;
Lenskart    E-commerce- Eyewear 2010    2019    -$13.4 Million  $4.5 Billion    2   Private&lt;br&gt;
Dream11 Fantasy Sports  2008    2019    $37.8 Million   $8 Billion  0   Private&lt;br&gt;
CitiusTech  Healthcare Technology   2005    2019    NA  $2.4 Billion    3   Private&lt;br&gt;
Freshworks  SaaS - CRM  2010    2018    -$220 Million   $4.53 Billion   13  Listed&lt;br&gt;
Udaan   E-commerce  2016    2018    -$220.9 Million $3.1 Billion    0   Private&lt;br&gt;
OYO Travel Tech, Hospitality    2013    2018    -$263 Million   $10 Billion 8   IPO-Bound&lt;br&gt;
Paytm Mall  E-commerce  2017    2018    -$65.6 Million  -   0   Private&lt;br&gt;
Swiggy  Foodtech    2014    2018    -$453 Million   $5.5 Billion    6   Private&lt;br&gt;
BYJU'S  Edtech  2011    2018    NA  $5.1 Billion    19  Private&lt;br&gt;
Policybazaar    Insurance company   2008    2018    -$104 Billion   $3.38 Billion   0   Listed&lt;br&gt;
Billdesk    Fintech 2000    2018    $27 Million $2 Billion  0   Private&lt;br&gt;
ReNew Power Renewable Energy    2011    2017    NA  $8 Billion  3   Listed&lt;br&gt;
OLA Transport Tech  2010    2015    NA  $7.4 Billion    8   IPO-Bound&lt;br&gt;
Zomato  Foodtech    2008    2015    -$153 Million   $5.4 Billion    15  Listed&lt;br&gt;
Paytm   E-commerce Finance  2010    2015    -$214 Million   $16 Billion 12  Listed&lt;br&gt;
Mu Sigma    SaaS- Analytics 2004    2013    NA  $1.5 Billion    1   Unlisted&lt;br&gt;
Flipkart    E-commerce  2007    2012    -$307 Million   $37.6 Billion   18  Unlisted&lt;br&gt;
InMobi  Adtech  2007    2011    -$9 Million $1 Billion  10  Unlisted&lt;br&gt;
MakeMyTrip  Online Travel   2000    2010    -$56 Million    $2.52 Billion   9   Listed&lt;/p&gt;

</description>
    </item>
    <item>
      <title>Nchat : Real-Time Chat Communication</title>
      <dc:creator>Soham</dc:creator>
      <pubDate>Tue, 23 May 2023 11:48:47 +0000</pubDate>
      <link>https://dev.to/soham0047/nchat-5epn</link>
      <guid>https://dev.to/soham0047/nchat-5epn</guid>
      <description>&lt;p&gt;Dev: &lt;a href="https://dev.to/soham0047"&gt;Dev Profile&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  What I built
&lt;/h2&gt;

&lt;p&gt;I have created a real time latest chat application using github &lt;strong&gt;codespace&lt;/strong&gt; as environment and ReactJs,NodeJs,Socket.io as tools.&lt;/p&gt;

&lt;h3&gt;
  
  
  Category Submission:
&lt;/h3&gt;

&lt;p&gt;Wacky Wildcards&lt;/p&gt;

&lt;h3&gt;
  
  
  App Link
&lt;/h3&gt;

&lt;p&gt;&lt;a href="https://n-chat.netlify.app/" rel="noopener noreferrer"&gt;Nchat&lt;/a&gt;&lt;/p&gt;

&lt;h3&gt;
  
  
  Screenshots
&lt;/h3&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F2gwweyz9biahd1ur8x13.jpg" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F2gwweyz9biahd1ur8x13.jpg" alt=" " width="800" height="371"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fwz30txv9s32igbdtdzzv.jpg" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fwz30txv9s32igbdtdzzv.jpg" alt=" " width="800" height="374"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;h3&gt;
  
  
  Description
&lt;/h3&gt;

&lt;p&gt;I have created a chat app using ReactJS, Node.js, Socket.io, and GitHub Codespaces. The app allows users to engage in real-time chat conversations. It provides a user-friendly interface for sending and receiving messages, as well as displaying the chat history. The app is  simple and easy to deploy.&lt;/p&gt;

&lt;h3&gt;
  
  
  Link to Source Code
&lt;/h3&gt;

&lt;p&gt;&lt;a href="https://github.com/Soham-0047/Nchat.git" rel="noopener noreferrer"&gt;Github&lt;/a&gt;&lt;/p&gt;

&lt;h3&gt;
  
  
  Permissive License
&lt;/h3&gt;

&lt;p&gt;The app is licensed under the MIT License&lt;/p&gt;

&lt;h2&gt;
  
  
  Background (What made you decide to build this particular app? What inspired you?)
&lt;/h2&gt;

&lt;p&gt;I decided to build this chat app for the GitHub x Dev Hackathon because I wanted to create a real-time communication tool that could be used for various purposes, such as friendly collaboration, or community engagement. I was inspired by the increasing demand for remote communication tools such as whatsapp,slack and wanted to contribute to the development of such applications.&lt;/p&gt;

&lt;h3&gt;
  
  
  How I built it (How did you utilize GitHub Actions or GitHub Codespaces? Did you learn something new along the way? Pick up a new skill?)
&lt;/h3&gt;

&lt;p&gt;Github Codespace used really good for less storage capacity in device  so I utilized GitHub Codespaces, which is an online development environment provided by GitHub. It allowed me to have a consistent development environment across different machines and made it easy to collaborate with others. I used ReactJS for the frontend, Node.js for the backend, and Socket.io for real-time communication between the server and clients.&lt;/p&gt;

&lt;p&gt;Throughout the development process, I learned more about setting up a real-time communication system using Socket.io and how to handle concurrent connections. I also gained experience in deploying applications using GitHub Codespaces and leveraging GitHub Actions for continuous integration and deployment.&lt;br&gt;
Building chat application throughout the hackathon provided me a great learning experience and allowed me to create a functional and scalable application for real-time communication.&lt;/p&gt;

&lt;h3&gt;
  
  
  Additional Resources/Info
&lt;/h3&gt;

&lt;h4&gt;
  
  
  Youtube Video
&lt;/h4&gt;

&lt;p&gt;  &lt;iframe src="https://www.youtube.com/embed/qU_kZzf404E"&gt;
  &lt;/iframe&gt;
&lt;br&gt;
 Backend Server: &lt;a href="https://nchat-9kqo.onrender.com" rel="noopener noreferrer"&gt;Backend&lt;/a&gt;&lt;/p&gt;

</description>
      <category>githubhack23</category>
      <category>javascript</category>
      <category>webdev</category>
    </item>
    <item>
      <title>DSA(Array): Find the maximum and minimum element in an array</title>
      <dc:creator>Soham</dc:creator>
      <pubDate>Sat, 13 May 2023 07:19:05 +0000</pubDate>
      <link>https://dev.to/soham0047/dsaarray-find-the-maximum-and-minimum-element-in-an-array-80i</link>
      <guid>https://dev.to/soham0047/dsaarray-find-the-maximum-and-minimum-element-in-an-array-80i</guid>
      <description>&lt;p&gt;Given an array A of size N of integers. Your task is to find the minimum and maximum elements in the array.&lt;/p&gt;

&lt;p&gt;Example 1:&lt;/p&gt;

&lt;p&gt;Input:&lt;br&gt;
N = 6&lt;br&gt;
A[] = {3, 2, 1, 56, 10000, 167}&lt;br&gt;
Output:&lt;br&gt;
min = 1, max =  10000&lt;/p&gt;

&lt;p&gt;Your Task:&lt;br&gt;&lt;br&gt;
You don't need to read input or print anything. Your task is to complete the function getMinMax() which takes the array A[] and its size N as inputs and returns the minimum and maximum element of the array.&lt;/p&gt;

&lt;p&gt;Expected Time Complexity: O(N)&lt;br&gt;
Expected Auxiliary Space: O(1)&lt;/p&gt;

&lt;p&gt;Constraints:&lt;br&gt;
1 &amp;lt;= N &amp;lt;= 105&lt;br&gt;
1 &amp;lt;= Ai &amp;lt;=1012&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Explanation and code:&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;In this section we will discuss the most efficient approach for solving this type of problem.&lt;br&gt;
What I am going to do:&lt;br&gt;
At first take a vector which will store the elements of our array. After that we will sort the vector using sort() function.In this way we will get our modified array in descending order.Now we take the pair (long long as mentioned earlier). Now also take two variables named max and min long long data type. &lt;br&gt;
After that we can observer that our array already in descending order so most greater element in the last position that means n-1 and the smallest element in 0th position.(based on the 0th based indexing) now if we can say max store the last element and min will store first index element.&lt;/p&gt;

&lt;p&gt;Sample Code:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;//{ Driver Code Starts
#include &amp;lt;bits/stdc++.h&amp;gt;
using namespace std;
#define ll long long

pair&amp;lt;long long, long long&amp;gt; getMinMax(long long a[], int n) ;

int main() {
    int t;
    cin &amp;gt;&amp;gt; t;
    while (t--) {
        int n;
        cin &amp;gt;&amp;gt; n;
        ll a[n];
        for (int i = 0; i &amp;lt; n; i++) cin &amp;gt;&amp;gt; a[i];

        pair&amp;lt;ll, ll&amp;gt; pp = getMinMax(a, n);

        cout &amp;lt;&amp;lt; pp.first &amp;lt;&amp;lt; " " &amp;lt;&amp;lt; pp.second &amp;lt;&amp;lt; endl;
    }
    return 0;
}
// } Driver Code Ends


pair&amp;lt;long long, long long&amp;gt; getMinMax(long long a[], int n) {
  vector&amp;lt;int&amp;gt;st;

  for(int i=0;i&amp;lt;n;i++){
      st.push_back(a[i]);
  }

  sort(st.begin(),st.end());

  pair&amp;lt;long long,long long&amp;gt;ans;
  long long min,max;

  max = st[n-1];
  min = st[0];

  ans = {min,max};

  return ans;


}
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Output:&lt;br&gt;
&lt;code&gt;For Input: &lt;br&gt;
6&lt;br&gt;
3 2 1 56 1000 167&lt;br&gt;
Your Output: &lt;br&gt;
1 1000&lt;/code&gt;&lt;/p&gt;

</description>
      <category>dsa</category>
      <category>cpp</category>
      <category>leetcode</category>
      <category>programming</category>
    </item>
    <item>
      <title>React Hooks</title>
      <dc:creator>Soham</dc:creator>
      <pubDate>Tue, 27 Dec 2022 13:23:44 +0000</pubDate>
      <link>https://dev.to/soham0047/react-hooks-243i</link>
      <guid>https://dev.to/soham0047/react-hooks-243i</guid>
      <description>&lt;p&gt;React is a JavaScript library for building user interfaces. It was developed by Facebook, and is often used for building single-page applications and mobile applications.&lt;/p&gt;

&lt;p&gt;In React, a "hook" is a special function that allows you to "hook into" React features from your functional components. Hooks were introduced in React 16.8 as a way to add state and other react features to functional components.&lt;/p&gt;

&lt;p&gt;There are several types of hooks in React, including:&lt;/p&gt;

&lt;p&gt;useState: This hook allows you to add state to a functional component. It returns an array with two elements: the current state value and a function to update the state.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;
import { useState } from 'react';

function Example() {
  const [count, setCount] = useState(0);

  return (
    &amp;lt;div&amp;gt;
      &amp;lt;p&amp;gt;You clicked {count} times&amp;lt;/p&amp;gt;
      &amp;lt;button onClick={() =&amp;gt; setCount(count + 1)}&amp;gt;
        Click me
      &amp;lt;/button&amp;gt;
    &amp;lt;/div&amp;gt;
  );
}
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;useEffect: This hook allows you to perform side effects in functional components. It takes a function as an argument, which will be run after the component renders. You can also specify a list of dependencies as a second argument, which will determine when the effect is run. If the dependencies haven't changed, the effect will not be run.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;import { useEffect, useState } from 'react';

function Example() {
  const [count, setCount] = useState(0);

  useEffect(() =&amp;gt; {
    document.title = `You clicked ${count} times`;
  });

  return (
    &amp;lt;div&amp;gt;
      &amp;lt;p&amp;gt;You clicked {count} times&amp;lt;/p&amp;gt;
      &amp;lt;button onClick={() =&amp;gt; setCount(count + 1)}&amp;gt;
        Click me
      &amp;lt;/button&amp;gt;
    &amp;lt;/div&amp;gt;
  );
}
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;useContext: This hook allows you to access the React context in a functional component. The context is an object that is passed down the component tree, and can be used to share values between components without having to pass props down manually.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;import { useContext } from 'react';

const MyContext = React.createContext();

function Example() {
  const value = useContext(MyContext);

  return &amp;lt;div&amp;gt;{value}&amp;lt;/div&amp;gt;;
}
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;useReducer: This hook is similar to useState, but it allows you to manage complex state objects and update them using reducer functions. It takes a reducer function and an initial state as arguments, and returns the current state and a dispatch function that can be used to update the state.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;import { useReducer } from 'react';

function reducer(state, action) {
  switch (action.type) {
    case 'increment':
      return { count: state.count + 1 };
    case 'decrement':
      return { count: state.count - 1 };
    default:
      throw new Error();
  }
}
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



</description>
    </item>
    <item>
      <title>ChatGPT and OpenAI</title>
      <dc:creator>Soham</dc:creator>
      <pubDate>Tue, 27 Dec 2022 13:10:37 +0000</pubDate>
      <link>https://dev.to/soham0047/chatgpt-and-openai-3p4l</link>
      <guid>https://dev.to/soham0047/chatgpt-and-openai-3p4l</guid>
      <description>&lt;p&gt;GPT, or Generative Pre-training Transformer, is a type of language model developed by OpenAI. It is a neural network-based model that is trained on a large dataset of text and can generate human-like text. GPT was introduced in 2018 and has since been improved and extended in several ways, including the development of GPT-2 and GPT-3.&lt;/p&gt;

&lt;p&gt;OpenAI is a research laboratory that focuses on developing and promoting artificial intelligence that is safe and beneficial for humanity. It was founded in 2015 by a group of entrepreneurs, researchers, and philanthropists, including Elon Musk and Sam Altman. OpenAI has made significant contributions to the field of AI, including the development of various machine learning algorithms and systems.&lt;/p&gt;

&lt;p&gt;One of the key features of GPT is its ability to generate text that is coherent and flows naturally, even when given just a small amount of input. This is achieved through the use of a transformer architecture, which allows the model to process large amounts of data and capture long-range dependencies between words.&lt;/p&gt;

&lt;p&gt;GPT can be used for a wide range of natural language processing tasks, including text generation, translation, and summarization. It has also been used to create chatbots, or computer programs that can carry out conversations with humans through text or voice input.&lt;/p&gt;

&lt;p&gt;One example of a chatbot based on GPT is ChatGPT, which is a chatbot trained on a large dataset of conversations. ChatGPT is able to engage in natural and coherent conversations with users, and can even respond appropriately to jokes or non-sequiturs.&lt;/p&gt;

&lt;p&gt;In addition to its ability to generate human-like text, GPT is also notable for its large size. GPT-3, the latest version of GPT, has 175 billion parameters, making it one of the largest language models ever created. This allows it to capture a wide range of knowledge and generate text that is more diverse and accurate than smaller models.&lt;/p&gt;

&lt;p&gt;However, the large size of GPT also presents some challenges. One concern is that it may be more prone to making mistakes or biased decisions, due to the large amount of data it has been trained on. Another concern is that GPT may be more difficult to explain or understand, due to the complexity of its architecture and the vast amount of knowledge it has learned.&lt;/p&gt;

&lt;p&gt;Overall, GPT and OpenAI have made significant contributions to the field of artificial intelligence and natural language processing. While there are still challenges and concerns to be addressed, the development of GPT and other AI technologies has the potential to revolutionize many aspects of our lives, from communication and entertainment to education and healthcare. So, it has both advantages and disadvantages.&lt;/p&gt;

&lt;p&gt;There are several potential "dark sides" to OpenAI and the development of artificial intelligence more generally. Some of the main concerns include:&lt;/p&gt;

&lt;p&gt;Bias and discrimination: There is a risk that AI systems, including those developed by OpenAI, could perpetuate or amplify existing biases and discrimination in society. For example, if a machine learning model is trained on biased data, it may make biased decisions or predictions. This could have serious consequences, such as discrimination in hiring or lending practices.&lt;/p&gt;

&lt;p&gt;Loss of jobs: As AI systems become more advanced, they may be able to perform tasks that were previously done by humans. This could lead to a loss of jobs, particularly in fields where automation is feasible. This could have a negative impact on employment and the economy, and may require measures to be put in place to mitigate the effects.&lt;/p&gt;

&lt;p&gt;Security and privacy: AI systems, including those developed by OpenAI, may present security and privacy risks. For example, they may be vulnerable to hacking or other types of cyber attacks, or they may be used to gather and process sensitive personal data without the proper safeguards.&lt;/p&gt;

&lt;p&gt;Transparency and accountability: There is a risk that AI systems, including those developed by OpenAI, may be difficult to explain or understand, making it hard to hold them accountable for their decisions and actions. This could be a problem in fields where accountability is important, such as healthcare or criminal justice.&lt;/p&gt;

&lt;p&gt;Ethical concerns: The development of AI raises a number of ethical concerns, including the question of whether it is appropriate to create AI systems that are more intelligent or capable than humans. There are also questions about the extent to which AI should be used to make decisions that affect people's lives, and whether it is possible to ensure that AI systems behave ethically and are aligned with human values.&lt;/p&gt;

&lt;p&gt;Overall, it is important to carefully consider the potential risks and ethical implications of AI, and to take&lt;/p&gt;

</description>
      <category>kendoreactchallenge</category>
      <category>react</category>
      <category>javascript</category>
    </item>
    <item>
      <title>Python The Guide</title>
      <dc:creator>Soham</dc:creator>
      <pubDate>Sun, 26 Jun 2022 17:54:02 +0000</pubDate>
      <link>https://dev.to/soham0047/python-the-guide-4i10</link>
      <guid>https://dev.to/soham0047/python-the-guide-4i10</guid>
      <description>&lt;blockquote&gt;
&lt;blockquote&gt;
&lt;blockquote&gt;
&lt;p&gt;print("Hello World")&lt;br&gt;
Hello World&lt;br&gt;
2*3&lt;br&gt;
6&lt;br&gt;
2*&lt;em&gt;3&lt;br&gt;
8&lt;br&gt;
3/4&lt;br&gt;
0.75&lt;br&gt;
a=23&lt;br&gt;
b=90&lt;br&gt;
a-b&lt;br&gt;
-67&lt;br&gt;
a+b&lt;br&gt;
113&lt;br&gt;
a&lt;/em&gt;*b&lt;br&gt;
359339733669351605185101286718740311628342797555834676291480724848488155215018843334859391939330168929445333462245499312849&lt;br&gt;
s = "Engineering"&lt;br&gt;
s[:7]&lt;br&gt;
'Enginee'&lt;br&gt;
s[1:]&lt;br&gt;
'ngineering'&lt;br&gt;
len(s)&lt;br&gt;
11&lt;br&gt;
type(s)&lt;br&gt;
&lt;br&gt;
max(s)&lt;br&gt;
'r'&lt;br&gt;
min(s)&lt;br&gt;
'E'&lt;br&gt;
b=input("Enter string")&lt;br&gt;
Enter stringCollege&lt;br&gt;
b&lt;br&gt;
'College'&lt;br&gt;
s+b&lt;br&gt;
'EngineeringCollege'&lt;br&gt;
s+" "+b&lt;br&gt;
'Engineering College'&lt;br&gt;
c = s+" "+b&lt;br&gt;
c&lt;br&gt;
'Engineering College'&lt;br&gt;
c.capitalize()&lt;br&gt;
'Engineering college'&lt;br&gt;
c.lower()&lt;br&gt;
'engineering college'&lt;br&gt;
c.upper()&lt;br&gt;
'ENGINEERING COLLEGE'&lt;br&gt;
"my name is %s from %s"%("Soham","Arambagh")&lt;br&gt;
'my name is Soham from Arambagh'&lt;br&gt;
str="arun C machine hack"&lt;br&gt;
str.split()&lt;br&gt;
['arun', 'C', 'machine', 'hack']&lt;br&gt;
str[1]&lt;br&gt;
'r'&lt;br&gt;
c.title()&lt;br&gt;
'Engineering College'&lt;br&gt;
str[2:]&lt;br&gt;
'un C machine hack'&lt;br&gt;
str.length()&lt;br&gt;
Traceback (most recent call last):&lt;br&gt;
  File "", line 1, in &lt;br&gt;
    str.length()&lt;br&gt;
AttributeError: 'str' object has no attribute 'length'&lt;br&gt;
len(str)&lt;br&gt;
19&lt;br&gt;
str.center(13)&lt;br&gt;
'arun C machine hack'&lt;br&gt;
str.count("a")&lt;br&gt;
3&lt;br&gt;
str.find("hack)&lt;/p&gt;
&lt;/blockquote&gt;


&lt;/blockquote&gt;
&lt;br&gt;
&lt;/blockquote&gt;

&lt;p&gt;SyntaxError: EOL while scanning string literal&lt;/p&gt;

&lt;blockquote&gt;
&lt;blockquote&gt;
&lt;blockquote&gt;
&lt;p&gt;str.find("hack")&lt;br&gt;
15&lt;br&gt;
str.replace("hack","Don't hack")&lt;br&gt;
"arun C machine Don't hack"&lt;/p&gt;
&lt;/blockquote&gt;


&lt;/blockquote&gt;
&lt;br&gt;
&lt;/blockquote&gt;

&lt;h1&gt;
  
  
  3) Accept only vowel containing string
&lt;/h1&gt;

&lt;p&gt;def check(str):&lt;br&gt;
    str = str.lower()&lt;br&gt;
    vowel = set("aeiou")  #Convert string into set of characters&lt;br&gt;
    str1 = set({})     # set function use to convert dictionary to set&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;for char in str:
    if char in vowel:
        str1.add(char)
    else:
        pass
if len(str1)==len(vowel):
    print("string is accepted \n")
else:
    print("Not accepted\n")       
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;

&lt;p&gt;txt = input("Enter any string :-) \n")&lt;br&gt;
check(txt)&lt;/p&gt;

&lt;h1&gt;
  
  
  9) Programme for reverse number
&lt;/h1&gt;

&lt;p&gt;def recursive(txt):&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;rem =0

while (txt&amp;gt;0):
   rem = (rem*10) +(txt %10)
   txt = txt//10  #used for quotient

return rem
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;

&lt;p&gt;txt = int(input("Enter the number\n"))&lt;/p&gt;

&lt;p&gt;po = recursive(txt)&lt;br&gt;
print("Reverse number is: ",po)&lt;/p&gt;

&lt;h1&gt;
  
  
  10) sum of digits of a number
&lt;/h1&gt;

&lt;p&gt;def squar(ni):&lt;br&gt;
    sum1 =0&lt;br&gt;
    while(ni !=0):&lt;br&gt;
        sum1 = sum1 +(ni%10)&lt;br&gt;
        ni = ni//10&lt;br&gt;
    return print("Sum of the digits of number is",sum1)&lt;/p&gt;

&lt;p&gt;n1 = int(input("Enter the number for addition of digits\n"))&lt;br&gt;
squar(n1)&lt;/p&gt;

&lt;h1&gt;
  
  
  11) Sum of cube of digits in a number
&lt;/h1&gt;

&lt;p&gt;def cube(n2):&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;sum3 =0
while(n2 !=0):
    con = n2%10
    sum2 =con*con*con
    sum3 = sum3 + sum2
    n2 = n2//10

return sum3
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;

&lt;p&gt;n2 =int(input("Enter the number for sum of cube\n"))&lt;br&gt;
print("Sum is:",cube(n2))&lt;/p&gt;

&lt;h1&gt;
  
  
  4) Maximum occurring character in string
&lt;/h1&gt;

&lt;p&gt;size = 256&lt;br&gt;
def maxchar(str):&lt;br&gt;
    arr = [0] * size&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;max = -1;
c =''

for i in str:
    arr[ord(i)] += 1

for i in str:
    if arr[ord(i)]&amp;gt;max:
        max = arr[ord(i)]
        c = i

return c
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;

&lt;p&gt;st ="engineering icon english"&lt;br&gt;
print(maxchar(st))&lt;/p&gt;

&lt;h1&gt;
  
  
  5) String consist special character or not
&lt;/h1&gt;

&lt;p&gt;import re&lt;/p&gt;

&lt;p&gt;def consistchar(str):&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;reg ="[^a-zA-Z0-9]+"

q = re.compile(reg)

if(len(str)==0):
    print("NO")
    return

if(re.search(q,str)):
    print("Yes")
else:
    print("NO")
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;

&lt;p&gt;str ="er@1wed"&lt;br&gt;
print("String consist of ",consistchar(str)) &lt;/p&gt;

&lt;h1&gt;
  
  
  7)Length of string
&lt;/h1&gt;

&lt;p&gt;str3 =input("Enter any string you want\n")&lt;br&gt;
print("length of the string:",len(str3)) &lt;/p&gt;

&lt;h1&gt;
  
  
  8) String Contain number or not
&lt;/h1&gt;

&lt;p&gt;def firstnumber(str4):&lt;br&gt;
    c=0&lt;br&gt;
    for i in str4:&lt;br&gt;
        if ord(i)&amp;gt;=48  and ord(i)&amp;lt;=57:&lt;br&gt;
            # print("String contain number")&lt;br&gt;
            # return&lt;br&gt;
            c = c+1&lt;br&gt;
        else:&lt;br&gt;
            #print("String not contain number")&lt;br&gt;
            c=0&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;if c&amp;gt;=1:
    print("contain number")
    return
else:
    print("not contain number")
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;

&lt;p&gt;firstnumber("ho")&lt;/p&gt;

&lt;h1&gt;
  
  
  Generating  random string until given string not created
&lt;/h1&gt;

&lt;p&gt;import random&lt;br&gt;
import string&lt;br&gt;
import time&lt;/p&gt;

&lt;p&gt;possiblechar = string.ascii_lowercase +string.ascii_uppercase+string.digits+'., !?:;'&lt;/p&gt;

&lt;p&gt;st=input("Enter the string\n")&lt;/p&gt;

&lt;h1&gt;
  
  
  Generating A random String(use to generate password)
&lt;/h1&gt;

&lt;p&gt;atthis =''.join(random.choice(possiblechar)for i in range(len(st)))&lt;/p&gt;

&lt;p&gt;atnext =''&lt;/p&gt;

&lt;p&gt;complete = False&lt;br&gt;
itr =0&lt;/p&gt;

&lt;p&gt;while complete == False:&lt;br&gt;
    print(atthis)&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;atnext=''
complete = True

#Fix the index
for i in range(len(st)):
    if atthis[i] != st[i]:
        complete =False
        atnext += random.choice(possiblechar)
    else:
        atnext += st[i]

itr +=1
atthis = atnext
time.sleep(0.1)
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;

&lt;p&gt;print("Target match after ",itr )&lt;/p&gt;

&lt;p&gt;OUTPUT:&lt;/p&gt;

&lt;p&gt;Enter any string :-) &lt;br&gt;
aeiuou&lt;br&gt;
string is accepted &lt;/p&gt;

&lt;p&gt;Enter the number&lt;br&gt;
342&lt;br&gt;
Reverse number is:  243&lt;br&gt;
Enter the number for addition of digits&lt;br&gt;
6795&lt;br&gt;
Sum of the digits of number is 27&lt;br&gt;
Enter the number for sum of cube&lt;br&gt;
123&lt;br&gt;
Sum is: 36&lt;br&gt;
n&lt;br&gt;
Yes&lt;br&gt;
String consist of  None&lt;br&gt;
Enter any string you want&lt;br&gt;
Engineering&lt;br&gt;
length of the string: 11&lt;br&gt;
not contain number&lt;br&gt;
Enter the string&lt;br&gt;
soham&lt;br&gt;
;rh?m&lt;br&gt;
……….&lt;br&gt;
……….&lt;br&gt;
sYham&lt;br&gt;
sCham&lt;br&gt;
s;ham&lt;br&gt;
soham&lt;br&gt;
Target match after  312&lt;/p&gt;

&lt;p&gt;//MATPLOLIB&lt;br&gt;
import matplotlib.pyplot as mp&lt;/p&gt;

&lt;p&gt;x =[2,3,7,8]&lt;br&gt;
y =[4,8,10,15]&lt;/p&gt;

&lt;p&gt;mp.plot(x,y,'#000',linewidth=3,linestyle='dotted',marker='o')&lt;br&gt;
mp.show()&lt;/p&gt;

&lt;p&gt;import matplotlib.pyplot as mp&lt;/p&gt;

&lt;p&gt;x=[3,4,5,6]&lt;br&gt;
y =[2,8,7,9]&lt;br&gt;
mp.xlabel("X")&lt;br&gt;
mp.ylabel("Y")&lt;br&gt;
mp.bar(x,y,color=['r','b','y','g'])&lt;br&gt;
mp.show()&lt;/p&gt;

&lt;p&gt;Pie CHART&lt;br&gt;
import matplotlib.pyplot as plt&lt;br&gt;
w =[200,100,150,34,250]&lt;br&gt;
d =['Math','Physics','Eco','Computer Sc','Python']&lt;br&gt;
plt.pie(w,labels=d,autopct="%3d%%",shadow=True)&lt;br&gt;
plt.show()&lt;/p&gt;

&lt;p&gt;import matplotlib.pyplot as plt&lt;br&gt;
a =['Ram','Soham','Madhav','Shobho']&lt;br&gt;
b =[3,6,4,2]&lt;br&gt;
plt.title("marks of student")&lt;br&gt;
plt.bar(a,b)&lt;br&gt;
plt.show()&lt;/p&gt;

&lt;p&gt;import matplotlib.pyplot as plt&lt;br&gt;
a=[2,3,4,5]&lt;br&gt;
b =[7,8,5,6]&lt;br&gt;
plt.xlim(1,3)&lt;br&gt;
plt.ylim(-1,2)&lt;br&gt;
plt.bar(a,b)&lt;br&gt;
plt.show()&lt;/p&gt;

</description>
      <category>python</category>
      <category>datascience</category>
      <category>machinelearning</category>
      <category>programming</category>
    </item>
  </channel>
</rss>
