<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[Suraj]]></title><description><![CDATA[Suraj]]></description><link>https://suraj3290.hashnode.dev</link><generator>RSS for Node</generator><lastBuildDate>Fri, 13 Nov 2026 19:46:54 GMT</lastBuildDate><atom:link href="https://suraj3290.hashnode.dev/rss.xml" rel="self" type="application/rss+xml"/><language><![CDATA[en]]></language><ttl>60</ttl><item><title><![CDATA[I got tired of typing random words, so I built a typing test specifically for developers 🐒]]></title><description><![CDATA[If you want to improve your typing speed, you usually go to sites like Monkeytype or 10FastFingers. They are great, but as developers, we don't spend our…]]></description><link>https://suraj3290.hashnode.dev/i-got-tired-of-typing-random-words-so-i-built-a-typing-test-specifically-for-developers</link><guid isPermaLink="true">https://suraj3290.hashnode.dev/i-got-tired-of-typing-random-words-so-i-built-a-typing-test-specifically-for-developers</guid><category><![CDATA[monkeytype]]></category><category><![CDATA[syntaxmonkey]]></category><category><![CDATA[typing speed]]></category><category><![CDATA[development]]></category><category><![CDATA[Developer Tools]]></category><category><![CDATA[Typing test, test, typing, online computer typing test, ]]></category><category><![CDATA[typing test]]></category><dc:creator><![CDATA[Suraj Maurya]]></dc:creator><pubDate>Sat, 07 Nov 2026 01:13:23 GMT</pubDate><content:encoded><![CDATA[<p>If you want to improve your typing speed, you usually go to sites like Monkeytype or 10FastFingers. They are great, but as developers, we don't spend our days typing standard dictionary words. We type brackets, semicolons, camelCase variables, and weird indentation.</p>
<p>Practicing the word "because" for the 100th time doesn't help you type a nested <code>for</code> loop any faster.</p>
<p>So, I built <a href="https://www.syntaxmonkey.online/"><strong>SyntaxMonkey</strong></a>.</p>
<h2>What is SyntaxMonkey?</h2>
<p>It is a minimalistic, distraction-free typing benchmark and practice tool engineered specifically for coders. Instead of typing plain English, you type real, language-specific code snippets.</p>
<p><strong>Currently supported languages:</strong></p>
<ul>
<li>Python</li>
<li>JavaScript</li>
<li>C++</li>
<li>C</li>
<li>Java</li>
<li>HTML</li>
<li>CSS</li>
</ul>
<h2>How it works</h2>
<p>The core idea is to help you build muscle memory for special characters and master programming syntax.</p>
<ul>
<li><strong>Real-time Analytics:</strong> It tracks your Words Per Minute (WPM), accuracy percentage, and highlights your syntax mistakes live as you type.</li>
<li><strong>Progressive Difficulty:</strong> Each language has 50 levels.</li>
<li><strong>Unlock System:</strong> You can't just mash the keyboard. To unlock the next snippet, you have to hit a minimum accuracy threshold (95%) and a minimum WPM (20).</li>
</ul>
<h2>The Tech Stack</h2>
<p>I wanted to keep this extremely lightweight and fast.</p>
<ul>
<li><strong>Frontend:</strong> Pure HTML, CSS, and Vanilla JavaScript. No heavy frameworks.</li>
<li><strong>Data:</strong> The code snippets are stored locally in JSON files and loaded asynchronously.</li>
<li><strong>Hosting:</strong> Deployed on Vercel.</li>
</ul>
<h2>Try it out and try to beat my score!</h2>
<p>I'd love for you to try it out and let me know what you think. What language should I add next? Are the unlock thresholds too easy or too hard?</p>
<p>👉 <strong>Live Demo:</strong> <a href="http://www.syntaxmonkey.online">www.syntaxmonkey.online</a></p>
<p>Let me know your highest WPM in the comments below!</p>
]]></content:encoded></item><item><title><![CDATA[Linear Search Using Vector (DSA)]]></title><description><![CDATA[Linear search is one of the most fundamental and straightforward searching algorithms. It works by sequentially checking each element in a data structure…]]></description><link>https://suraj3290.hashnode.dev/linear-search-using-vector-dsa</link><guid isPermaLink="true">https://suraj3290.hashnode.dev/linear-search-using-vector-dsa</guid><dc:creator><![CDATA[Suraj Maurya]]></dc:creator><pubDate>Sat, 15 Aug 2026 07:59:18 GMT</pubDate><content:encoded><![CDATA[<p>Linear search is one of the most fundamental and straightforward searching algorithms. It works by sequentially checking each element in a data structure from start to finish until it finds a match for the target value</p>
<h3>Pre assigned values of Vector</h3>
<pre><code class="language-cpp">#include &lt;iostream&gt;
#include &lt;vector&gt;
using namespace std;

int ret(vector&lt;int&gt; vec, int tar);
int main() {
    vector&lt;int&gt; arr = {23,4,3,42,23,22,42,848};
    int tar = 848;
    cout&lt;&lt;ret(arr,tar);
}

int ret(vector&lt;int&gt; vec , int tar){
    int index = 0;
    for(int ele : vec){
        if(ele == tar){
            return index;
        }
        index++;
    }
    return -1;
}
</code></pre>
<h3>Element from User Input:</h3>
<pre><code class="language-cpp">#include &lt;iostream&gt;
#include &lt;vector&gt;
using namespace std;

int ret(vector&lt;int&gt; vec, int tar);
int main() {
    int size;
    cout&lt;&lt;"Enter the Size of vector: ";
    cin&gt;&gt;size;
    vector&lt;int&gt; arr;
    for(int i  =0 ; i&lt; size; i++){
        cout&lt;&lt;"Enter "&lt;&lt;i+1&lt;&lt;" element of Vector: ";
        int num;
        cin&gt;&gt;num;
        arr.push_back(num);
    }
    int tar;
    cout&lt;&lt;"Enter target Element: ";
    cin&gt;&gt;tar;


    int res = ret(arr,tar);
    if(res &lt; 0){
        cout&lt;&lt;"Element Not found!!";
    }else{
        cout&lt;&lt;"Element found at index: "&lt;&lt;res;
    }
}

int ret(vector&lt;int&gt; vec , int tar){
    int index = 0;
    for(int ele : vec){
        if(ele == tar){
            return index;
        }
        index++;
    }
    return -1;
}
</code></pre>
]]></content:encoded></item></channel></rss>