<?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: Rajan shukla</title>
    <description>The latest articles on DEV Community by Rajan shukla (@rajan_shukla_b4cde34c3c21).</description>
    <link>https://dev.to/rajan_shukla_b4cde34c3c21</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%2F3873702%2Fefb1b8f3-86a1-4e7c-9e65-0dfb24aadcf0.gif</url>
      <title>DEV Community: Rajan shukla</title>
      <link>https://dev.to/rajan_shukla_b4cde34c3c21</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/rajan_shukla_b4cde34c3c21"/>
    <language>en</language>
    <item>
      <title>I built a free LeetCode visualizer. Here's what I learned making 207 problems animate line by line.</title>
      <dc:creator>Rajan shukla</dc:creator>
      <pubDate>Sat, 11 Apr 2026 15:25:22 +0000</pubDate>
      <link>https://dev.to/rajan_shukla_b4cde34c3c21/i-built-a-free-leetcode-visualizer-heres-what-i-learned-making-207-problems-animate-line-by-line-5g7n</link>
      <guid>https://dev.to/rajan_shukla_b4cde34c3c21/i-built-a-free-leetcode-visualizer-heres-what-i-learned-making-207-problems-animate-line-by-line-5g7n</guid>
      <description>&lt;p&gt;I spent months grinding LeetCode. I could read solutions. I could even explain them out loud. But the moment I closed the tab, it all evaporated.&lt;br&gt;
The problem wasn't intelligence. It was that I was trying to understand movement through static text.&lt;br&gt;
So I built &lt;a href="https://codedive.in/" rel="noopener noreferrer"&gt;codedive.in&lt;/a&gt; a free tool that lets you step through LeetCode problems line by line, watching everything animate in real time.&lt;br&gt;
Here's what I learned building it.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;The problem with how we learn algorithms&lt;/strong&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%2Ft6no9g68f2035gx9r685.png" 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%2Ft6no9g68f2035gx9r685.png" alt="CodeDive Main Image"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;When you read a Two Sum solution, you see this:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;twoSum&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;nums&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;target&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
    &lt;span class="n"&gt;seen&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;{}&lt;/span&gt;
    &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;num&lt;/span&gt; &lt;span class="ow"&gt;in&lt;/span&gt; &lt;span class="nf"&gt;enumerate&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;nums&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
        &lt;span class="n"&gt;complement&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;target&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="n"&gt;num&lt;/span&gt;
        &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;complement&lt;/span&gt; &lt;span class="ow"&gt;in&lt;/span&gt; &lt;span class="n"&gt;seen&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
            &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="n"&gt;seen&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="n"&gt;complement&lt;/span&gt;&lt;span class="p"&gt;],&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;
        &lt;span class="n"&gt;seen&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="n"&gt;num&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;You can follow it. But do you see it?&lt;br&gt;
What you actually need to see is:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;The hash map building up in real time&lt;/li&gt;
&lt;li&gt;The complement being checked against what's already stored&lt;/li&gt;
&lt;li&gt;The exact moment the answer is found&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;That's the difference between reading about swimming and being in the water.&lt;/p&gt;

&lt;p&gt;*&lt;em&gt;What codedive actually does&lt;br&gt;
*&lt;/em&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%2Fygzh0zd4x31tjezhbqnk.png" 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%2Fygzh0zd4x31tjezhbqnk.png" alt="CordeDive Problem Page"&gt;&lt;/a&gt;&lt;br&gt;
Every problem has three parts running in sync:&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;The code panel — each line highlights as it executes. You can step forward, backward, or scrub through at any speed.&lt;/li&gt;
&lt;li&gt;The visualization panel — the actual data structure animates. Arrays shift. Tree nodes light up. Graph edges draw themselves.&lt;/li&gt;
&lt;li&gt;The variable inspector — every variable in memory is visible at every step. No more guessing what left, right, mid are at step 8.&lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;*&lt;em&gt;The problems that surprised me most&lt;br&gt;
*&lt;/em&gt;&lt;/p&gt;

&lt;p&gt;Trapping Rain Water was the most satisfying to build. The leftMax/rightMax two-pointer approach is notoriously hard to explain in text. But when you watch the pointers move and the water level update in real time — it clicks in seconds.&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%2F16zrxvp149so015vvp50.png" 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%2F16zrxvp149so015vvp50.png" alt="Trapping Rain water on codeDive"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;What's next&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Launching on Product Hunt on April 25th — &lt;a href="https://www.producthunt.com/products/codedive?launch=codedive" rel="noopener noreferrer"&gt;follow here&lt;/a&gt;&lt;br&gt;
Adding 100 more problems over the next 60 days&lt;br&gt;
Building progress tracking and user accounts&lt;br&gt;
A Pro plan for people who want the full library&lt;/p&gt;

&lt;p&gt;If you're learning DSA or prepping for interviews give it a try. It's completely free, no login needed.&lt;br&gt;
&lt;a href="https://codedive.in/" rel="noopener noreferrer"&gt;codedive.in&lt;/a&gt;&lt;br&gt;
And if any of this was useful, I'd love your support on Product Hunt on April 25th. For a solo indie developer it means everything. 🙏&lt;/p&gt;

</description>
      <category>leetcode</category>
      <category>algorithms</category>
      <category>programming</category>
      <category>showdev</category>
    </item>
  </channel>
</rss>
