<?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" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Santhiya Periyasamy on Medium]]></title>
        <description><![CDATA[Stories by Santhiya Periyasamy on Medium]]></description>
        <link>https://medium.com/@santhiyaperiyasamy03?source=rss-1f86a6ee30d7------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*37m7QzjOg3lBzwnulR0CJQ.jpeg</url>
            <title>Stories by Santhiya Periyasamy on Medium</title>
            <link>https://medium.com/@santhiyaperiyasamy03?source=rss-1f86a6ee30d7------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Fri, 20 Nov 2026 04:58:39 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@santhiyaperiyasamy03/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[The Battles We Never See]]></title>
            <link>https://medium.com/@santhiyaperiyasamy03/the-battles-we-never-see-58024c8c9f01?source=rss-1f86a6ee30d7------2</link>
            <guid isPermaLink="false">https://medium.com/p/58024c8c9f01</guid>
            <category><![CDATA[kindness]]></category>
            <category><![CDATA[personal-growth]]></category>
            <category><![CDATA[healing]]></category>
            <category><![CDATA[mental-health]]></category>
            <category><![CDATA[self-improvement]]></category>
            <dc:creator><![CDATA[Santhiya Periyasamy]]></dc:creator>
            <pubDate>Sat, 13 Jun 2026 12:54:40 GMT</pubDate>
            <atom:updated>2026-06-13T12:54:40.071Z</atom:updated>
            <content:encoded><![CDATA[<p>Everyone we meet is carrying something we cannot see.</p><p>Some are fighting battles they never talk about.<br>Some are smiling through pain.<br>Some are trying their best just to make it through the day.</p><p>It’s easy to forget this when we’re caught up in our own lives. We see people’s actions, but rarely the struggles behind them. A moment of patience, understanding, or kindness can mean more than we realize because we never truly know what someone else is carrying.</p><p>But there is another side to this idea.</p><p>When life hurts us, it can be tempting to let that pain spill onto others. Stress becomes impatience. Disappointment becomes bitterness. Hurt becomes hurtful words. Without realizing it, we can pass our wounds forward.</p><p>Real strength is not found in pretending we are unaffected by pain. It is found in choosing what we do with that pain. We may not control every hardship that comes our way, but we can control whether we allow it to harm others.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*mdw3Ll46PK6Aek9JtnV83w.jpeg" /></figure><p>Kindness is not only about how we treat people when they are struggling. It is also about how we treat people when we are struggling.</p><p>So let’s remember both truths:</p><p>Be kind, because you never know what battles someone is fighting.</p><p>And when life fights you, don’t pass the wounds forward — heal them instead.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=58024c8c9f01" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Merge Two Sorted Array — Leetcode 88]]></title>
            <link>https://medium.com/@santhiyaperiyasamy03/merge-two-sorted-array-leetcode-88-9e81e376cd4c?source=rss-1f86a6ee30d7------2</link>
            <guid isPermaLink="false">https://medium.com/p/9e81e376cd4c</guid>
            <category><![CDATA[arrays]]></category>
            <category><![CDATA[problem-solving]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[java]]></category>
            <dc:creator><![CDATA[Santhiya Periyasamy]]></dc:creator>
            <pubDate>Mon, 06 Apr 2026 15:04:42 GMT</pubDate>
            <atom:updated>2026-04-06T15:04:42.200Z</atom:updated>
            <content:encoded><![CDATA[<h3><strong>Problem :</strong></h3><p>You are given two integer arrays nums1 and nums2, sorted in <strong>non-decreasing order</strong>, and two integers m and n, representing the number of elements in nums1 and nums2 respectively.</p><p><strong>Merge</strong> nums1 and nums2 into a single array sorted in <strong>non-decreasing order</strong>.</p><p>The final sorted array should not be returned by the function, but instead be <em>stored inside the array </em>nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n</p><p><strong>Example 1:</strong></p><pre>Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3<br>Output: [1,2,2,3,5,6]<br>Explanation: The arrays we are merging are [1,2,3] and [2,5,6].<br>The result of the merge is [1,2,2,3,5,6] with the underlined elements coming from nums1</pre><p><strong>Example 2:</strong></p><pre>Input: nums1 = [0], m = 0, nums2 = [1], n = 1<br>Output: [1]<br>Explanation: The arrays we are merging are [] and [1].<br>The result of the merge is [1].<br>Note that because m = 0, there are no elements in nums1. The 0 is only there to ensure the merge result can fit in nums1.</pre><h3><strong>Approach to solve this problem :</strong></h3><h3>Core Idea :</h3><p>In this problem, m represents the number of valid elements in the nums1 array (excluding the extra zeros at the end).</p><p>Since both arrays are already sorted, we can efficiently merge them by starting from the <strong>end</strong>.</p><ul><li>We compare the last valid element of nums1 (m - 1) and the last element of nums2 (n - 1)</li><li>The larger element is placed at the last position of nums1, which is index m + n - 1</li><li>We continue this process, moving backwards, until all elements from nums2 are placed into nums1</li></ul><h3>Edge Case :</h3><p>What if m = 0?</p><ul><li>This means nums1 has no valid elements, only empty space (zeros)</li><li>In this case, we cannot compare elements from nums1</li><li>So, we directly copy all elements from nums2 into nums1</li></ul><p>To handle this safely, we always check:</p><pre>i &gt;= 0</pre><p>before accessing nums1[i]</p><ul><li>Time Complexity: <strong>O(m + n)</strong></li><li>Space Complexity: <strong>O(1)</strong></li></ul><h3><strong>Code (Java) :</strong></h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/943/1*06g1WxuE8peB8p3JQzcUHg.png" /></figure><p>This problem teaches an important concept:<br> Instead of using extra space, we can optimize by working from the <strong>end of the array</strong>.</p><p>By using three pointers, we efficiently merge both arrays in-place with <strong>O(m + n)</strong> time complexity and <strong>O(1)</strong> space.</p><p>I hope this explanation made the logic clear and easy to understand.<br> If you found this helpful, feel free to share it and connect!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=9e81e376cd4c" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Launching My YouTube Channel: SheCodes and Grows]]></title>
            <link>https://medium.com/@santhiyaperiyasamy03/launching-my-youtube-channel-shecodes-and-grows-583c27b5f4b1?source=rss-1f86a6ee30d7------2</link>
            <guid isPermaLink="false">https://medium.com/p/583c27b5f4b1</guid>
            <category><![CDATA[youtuber]]></category>
            <category><![CDATA[education]]></category>
            <category><![CDATA[youtube]]></category>
            <category><![CDATA[coding]]></category>
            <category><![CDATA[aptitude]]></category>
            <dc:creator><![CDATA[Santhiya Periyasamy]]></dc:creator>
            <pubDate>Sat, 07 Mar 2026 15:36:33 GMT</pubDate>
            <atom:updated>2026-03-07T15:36:33.944Z</atom:updated>
            <content:encoded><![CDATA[<p>I’m thrilled to announce the launch of my YouTube channel, where I share Cocnepts to clear servicenow csa examination and <strong>coding questions</strong> explained in a clear, step-by-step manner. My mission is to make technical learning accessible, practical, and engaging for students, job seekers, and professionals preparing for certifications or interviews.</p><p>Beyond CSA and coding challenges, I’ll be expanding into a wide range of <strong>educational content</strong> — from technical tutorials to problem-solving strategies — all designed to help learners grow with confidence.</p><p><a href="http://www.youtube.com/@CgGirlJourney">www.youtube.com/@CgGirlJourney</a></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*K8NnSDIKNra2zQ8e0635ZA.png" /></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=583c27b5f4b1" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Next Greater Element (NGE) — From Brute Force to Smart Stack Solution (Java)]]></title>
            <link>https://medium.com/@santhiyaperiyasamy03/next-greater-element-nge-from-brute-force-to-smart-stack-solution-java-7a3de5299496?source=rss-1f86a6ee30d7------2</link>
            <guid isPermaLink="false">https://medium.com/p/7a3de5299496</guid>
            <category><![CDATA[stack]]></category>
            <category><![CDATA[arrays]]></category>
            <category><![CDATA[problem-solving]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[java]]></category>
            <dc:creator><![CDATA[Santhiya Periyasamy]]></dc:creator>
            <pubDate>Fri, 13 Feb 2026 12:47:59 GMT</pubDate>
            <atom:updated>2026-02-13T12:47:59.841Z</atom:updated>
            <content:encoded><![CDATA[<h3>Problem Statement (In Simple Words)</h3><p>You are given an array.</p><p>For every element, find the <strong>first greater element on its right side</strong>.</p><p>If there is no greater element → return <strong>-1</strong>.</p><p>Input: [7, 12, 1, 20]<br>Output: [12, 20, 20, -1]</p><p>Why?</p><ul><li>7 → next greater is <strong>12</strong></li><li>12 → next greater is <strong>20</strong></li><li>1 → next greater is <strong>20</strong></li><li>20 → nothing greater → <strong>-1</strong></li></ul><h3>First Thought — Brute Force Approach</h3><p>When we read the problem, the natural idea is:</p><ul><li>Pick an element.</li><li>Move to the right.</li><li>Find the first element greater than it.</li><li>If found → store it.</li><li>If not → store -1.</li></ul><p><strong>Java Code (Brute Force) :</strong></p><p><strong>public static int[] nextGreaterElementBrute(int[] arr, int n) {<br> int[] ans = new int[n];</strong></p><p><strong>for (int i = 0; i &lt; n; i++) {<br> ans[i] = -1; // default if no greater element found</strong></p><p><strong>for (int j = i + 1; j &lt; n; j++) {<br> if (arr[j] &gt; arr[i]) {<br> ans[i] = arr[j];<br> break;<br> }<br> }<br> }<br> return ans;<br>}</strong></p><p>Time complexity is O(n²) .</p><p>Why?</p><p>Because for every element we scan again.</p><p>Works fine for small inputs<br> Fails for large inputs (n up to 100000).</p><p><strong>Instead of checking repeatedly, we remember useful elements using a stack.</strong></p><h3>Key Idea Behind Stack Solution</h3><p>We process the array <strong>from right to left</strong>.</p><p>Why?</p><p>Because we want to know:</p><p><em>“What greater elements exist on the right side?”</em></p><p>If we move backward, we already know the future</p><p><strong>What Do We Store in Stack?</strong></p><p>Top of stack always contains the <strong>next possible greater element</strong>.</p><h3>Algorithm Steps</h3><p>For each element (starting from right):</p><h3>Step 1:</h3><p>Remove all elements from stack that are <strong>≤ current element</strong></p><p>Because they can never be the answer.</p><p><strong>while(stack.peek() &lt;= arr[i])<br> pop()</strong></p><h3>Step 2:</h3><p>If stack becomes empty → no greater element → answer = -1</p><p>Else → top of stack is the next greater element.</p><h3>Step 3:</h3><p>Push current element into stack.</p><p><strong>Java Code (Optimized Stack Solution) :</strong></p><p><strong>import java.util.*;</strong></p><p><strong>public class NextGreaterElement {</strong></p><p><strong>public static int[] nextGreaterElement(int[] arr, int n) {<br> int[] answer = new int[n];<br> Stack&lt;Integer&gt; stack = new Stack&lt;&gt;();</strong></p><p><strong>for (int i = n — 1; i &gt;= 0; i — ) {</strong></p><p><strong>// Remove smaller elements<br> while (!stack.isEmpty() &amp;&amp; stack.peek() &lt;= arr[i]) {<br> stack.pop();<br> }</strong></p><p><strong>// If stack empty → no greater element<br> answer[i] = stack.isEmpty() ? -1 : stack.peek();</strong></p><p><strong>// Push current element for future use<br> stack.push(arr[i]);<br> }</strong></p><p><strong>return answer;<br> }<br>}</strong></p><p>Time complexity is O(n).</p><h3>Final Thoughts</h3><p>At first, I solved this using two loops.</p><p>But learning the <strong>stack approach changed how I see array problems</strong>.</p><p>Instead of re-checking elements, we:<br> ✔ Store useful information<br> ✔ Remove useless comparisons<br> ✔ Solve in linear time</p><p>That’s the difference between:</p><p><em>Writing code that works vs Writing code that scales</em></p><p>Thanks for reading , have a nice day !!!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=7a3de5299496" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Maximum Subarray Problem Explained: From Brute Force to Kadane’s Algorithm]]></title>
            <link>https://medium.com/@santhiyaperiyasamy03/maximum-subarray-problem-explained-from-brute-force-to-kadanes-algorithm-926399bb5b87?source=rss-1f86a6ee30d7------2</link>
            <guid isPermaLink="false">https://medium.com/p/926399bb5b87</guid>
            <category><![CDATA[java-dsa]]></category>
            <category><![CDATA[problem-solving]]></category>
            <category><![CDATA[coding]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[java]]></category>
            <dc:creator><![CDATA[Santhiya Periyasamy]]></dc:creator>
            <pubDate>Tue, 27 Jan 2026 08:30:07 GMT</pubDate>
            <atom:updated>2026-01-27T08:32:56.564Z</atom:updated>
            <content:encoded><![CDATA[<p>Introduction</p><p>The Maximum Subarray Problem is a classic interview question asked by companies like Amazon, Swiggy, and Zoho.<br>Given an integer array, the task is to find the contiguous subarray with the largest sum and return that sum.</p><p>Problem Statement</p><ul><li>Input: An array of integers nums.</li><li>Output: The maximum possible sum of a contiguous subarray.</li></ul><p>Example 1:<br> Input: [-2,1,-3,4,-1,2,1,-5,4]<br> Output: 6<br> Explanation: The subarray [4,-1,2,1] has the largest sum 6.</p><p>Brute Force Approach</p><p>The simplest way is to check all possible subarrays and calculate their sums.<br> For an array of length n, there are O(n^2) subarrays, and calculating each sum takes O(n).<br> So the brute force solution runs in O(n^3) time — far too slow for large inputs.</p><p>Example:<br> For arr = [1, 2, 3, -1, -4], possible subarrays are:<br> [1], [1,2], [1,2,3], [1,2,3,-1], [2], [3], [-1], [-4] etc.<br> We compute each sum and track the maximum.</p><p>Code(Java):</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/685/1*UGFEaLbw_k_1VXDaizBScQ.png" /></figure><p>Optimized Approach: Kadane’s Algorithm</p><p>Instead of recalculating sums for every subarray, we can use a clever trick:</p><ol><li>Keep a running sum (currSum).</li><li>If currSum becomes negative, reset it to 0 (because a negative prefix will only reduce future sums).</li><li>Track the maximum sum (maxSum) seen so far.</li></ol><p>This reduces the time complexity to O(n).</p><p>Example Walkthrough</p><p>Input: [-2,1,-3,4,-1,2,1,-5,4]</p><ul><li>Start with currSum = 0, maxSum = -∞.</li><li>Add -2 → currSum = -2 → reset to 0.</li><li>Add 1 → currSum = 1 → maxSum = 1.</li><li>Add -3 → currSum = -2 → reset to 0.</li><li>Add 4 → currSum = 4 → maxSum = 4.</li><li>Add -1 → currSum = 3.</li><li>Add 2 → currSum = 5 → maxSum = 5.</li><li>Add 1 → currSum = 6 → maxSum = 6.</li></ul><p>Final Answer: 6.</p><p>Code (Java):</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/723/1*ThWAfR41Qvsb7AcQ1C6UbA.png" /></figure><p>The Maximum Subarray problem is a classic interview question that teaches us how to move from brute force thinking to optimized solutions like Kadane’s Algorithm. With this approach, we can solve the problem in linear time and handle large inputs efficiently.</p><p>Thanks for reading — I hope this explanation helps you understand the problem better and prepares you for your next interview!</p><p>Try :</p><p><a href="https://leetcode.com/problems/maximum-subarray/">1 . https://leetcode.com/problems/maximum-subarray/</a></p><p>2.<a href="https://www.naukri.com/code360/problems/maximum-subarray_893296?leftPanelTabValue=PROBLEM">https://www.naukri.com/code360/problems/maximum-subarray_893296?leftPanelTabValue=PROBLEM</a></p><p>3.<a href="https://www.geeksforgeeks.org/problems/kadanes-algorithm-1587115620/1?page=1&amp;company=Zoho&amp;sortBy=submissions">https://www.geeksforgeeks.org/problems/kadanes-algorithm-1587115620/1?page=1&amp;company=Zoho&amp;sortBy=submissions</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=926399bb5b87" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Greater On Right Side -Leetcode Problem]]></title>
            <link>https://medium.com/@santhiyaperiyasamy03/greater-on-right-side-leetcode-problem-c5ab3e9dbdac?source=rss-1f86a6ee30d7------2</link>
            <guid isPermaLink="false">https://medium.com/p/c5ab3e9dbdac</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[problem-solving-skills]]></category>
            <category><![CDATA[java]]></category>
            <category><![CDATA[problem-solving]]></category>
            <category><![CDATA[leetcode-easy]]></category>
            <dc:creator><![CDATA[Santhiya Periyasamy]]></dc:creator>
            <pubDate>Sun, 16 Nov 2025 12:08:24 GMT</pubDate>
            <atom:updated>2025-11-16T12:08:24.818Z</atom:updated>
            <content:encoded><![CDATA[<h3>Probelm : Greater on right side</h3><p>Difficulty: <strong>Easy</strong>Accuracy: <strong>58.34%</strong>Submissions: <strong>47K+</strong>Points: <strong>2</strong></p><p>You are given an array <strong>arr</strong>. Replace every element with the <strong>next greatest element</strong> (the greatest element on its right side) in the array. Note: There is no element next to the last element, so replace it with <strong>-1</strong>.</p><p><strong>Example:</strong></p><pre>Input: arr[] = [16, 17, 4, 3, 5, 2]<br>Output: [17, 5, 5, 5, 2, -1]<br>Explanation: For 16 the greatest element <br>on its right is 17. For 17 it&#39;s 5. <br>For 4 it&#39;s 5. For 3 it&#39;s 5. For 5 it&#39;s 2. <br>For 2 it&#39;s -1(no element to its right).</pre><pre>Input: arr[] = [2, 3, 1, 9]<br>Output: [9, 9, 9, -1]<br>Explanation: For each element except 9 the<br>greatest element on its right is 9.</pre><p><strong>Constraints:</strong><br>1 &lt;= arr.size() &lt;= 105<br>1 &lt;= arr[i]&lt;= 106</p><h3><strong>Idea :</strong></h3><p>To solve this efficiently, we traverse the array <strong>from right to left</strong>, because we need to know the greatest value that appears <strong>after</strong> each element.</p><p>We use a variable max to keep track of the <strong>maximum element seen so far</strong> during the traversal. Here&#39;s how it works:</p><ul><li>If the current element is <strong>greater than </strong>max, we’ve found a new maximum.</li><li>But before updating max, we need to:</li><li><strong>Store the current element in a temporary variable</strong> (let’s call it temp), because it will become the new max.</li><li><strong>Replace the current element (</strong><strong>arr[i]) with the existing </strong><strong>max</strong>, which was the greatest element to its right before this update.</li><li><strong>Update </strong><strong>max = temp</strong>, so that future elements to the left can use this new maximum.</li></ul><p><strong>If no new maximum is found, the existing </strong><strong>max continues to be the correct replacement for every element we encounter.</strong></p><p>Code (Java) :</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/959/1*tJAcNnM1N-hrSa5Q1ibZSg.png" /></figure><p>Time Complexity : O(N) and Space Complexity : O(N).</p><p>Try :</p><p>Leetcode : <a href="https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/description/">https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/description/</a></p><p>GFG : <a href="https://www.geeksforgeeks.org/problems/greater-on-right-side4305/1">https://www.geeksforgeeks.org/problems/greater-on-right-side4305/1</a></p><p>Thanks for reading! I hope this explanation was helpful. Wishing you a productive and joyful day!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=c5ab3e9dbdac" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[ My Zoho Interview Experience — A Journey Through Five Rounds]]></title>
            <link>https://blog.stackademic.com/my-zoho-interview-experience-a-journey-through-five-rounds-6119cad40304?source=rss-1f86a6ee30d7------2</link>
            <guid isPermaLink="false">https://medium.com/p/6119cad40304</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[coding-round]]></category>
            <category><![CDATA[zoho]]></category>
            <category><![CDATA[interview]]></category>
            <category><![CDATA[aptitude-test]]></category>
            <dc:creator><![CDATA[Santhiya Periyasamy]]></dc:creator>
            <pubDate>Tue, 16 Sep 2025 05:37:43 GMT</pubDate>
            <atom:updated>2026-01-24T12:48:05.472Z</atom:updated>
            <content:encoded><![CDATA[<h3><strong>💻 My Zoho Interview Experience — A Journey Through Five Rounds</strong></h3><p>Recently, I had the opportunity to attend the <strong>Zoho interview process</strong>, and I’d love to share my experience with you all. It was a rollercoaster of logic, coding, and resilience. Here’s how it unfolded:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/1*lQvFw26XHeYQL0yZ3n0hrQ.png" /></figure><p>🧠 Round 1: Aptitude + Output-Based Coding</p><p>As expected, the first round was a mix of <strong>aptitude questions</strong> and <strong>output-based coding problems</strong>. After a week, I received the exciting news — I was shortlisted for the second round!</p><p>💡 Round 2: Morning Coding Marathon</p><p>This round had <strong>5 coding questions</strong>, each testing different problem-solving skills:</p><ol><li>🔄 <a href="https://leetcode.com/problems/rotate-image/solutions/1449492/rotate-matrix-clockwise-or-anti-clockwise-100-faster-c/">Rotate a 2D Matrix Anti-Clockwise</a></li><li>📉 <a href="https://www.geeksforgeeks.org/problems/floor-in-a-sorted-array-1587115620/1">Find Floor of a Value in a Sorted Array</a></li><li>➡️ <a href="https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/">Next Greatest Element from the Right</a></li><li>🔤 Insert Vowels and Generate All Combinations<br><em> Given a string, insert vowels (a, e, i, o, u) and generate all possible combinations.</em></li><li>📊 <a href="https://www.geeksforgeeks.org/dsa/sort-elements-by-frequency/">Sort Array by Frequency (Smallest Value First if Equal)</a></li></ol><p>After lunch, they announced the names for the next round — and I was in!</p><p>🔁 Round 3: More Coding Challenges</p><p>This round had <strong>4 coding questions</strong>:</p><ol><li>🔁 <a href="https://leetcode.com/problems/minimum-number-of-flips-to-make-the-binary-string-alternating/">Minimum Flips to Make Binary String Alternating</a></li><li>🧮 <a href="https://leetcode.com/problems/generate-parentheses/">Generate All Valid Bracket Combinations</a></li><li>🔀 <a href="https://leetcode.com/problems/wiggle-sort-ii/description/">Wiggle Sort</a></li></ol><p>They said they’d mail me if i was selected for the next round.</p><p>🍬 Round 4: Final Coding Round</p><p>After a couple of weeks, I got the mail. Another coding round awaited me with <strong>6 questions</strong>:</p><ol><li>🍪 <a href="https://leetcode.com/problems/candy/">Candy Distribution Problem</a></li><li>📐 <a href="https://leetcode.com/problems/rectangle-overlap/">Overlapping Rectangles</a></li><li>➕ <a href="https://leetcode.com/problems/squares-of-a-sorted-array/description/">square the elements in an array and sort.</a></li><li>🧮 <a href="https://leetcode.com/problems/set-matrix-zeroes/">Set Matrix Zero</a></li><li>🔄 <a href="https://leetcode.com/problems/reverse-vowels-of-a-string/">Reverse Vowels in a String</a></li></ol><p>Only two of us were shortlisted for the final round.</p><p>🛠️ Round 5: Designing Round</p><p>We were given <strong>5 requirements</strong> to build a Stock Management System.I completed 4 out of 5 and orally explained the last one.</p><p>❌ The Final Verdict</p><p>After another week or two, I received a rejection mail. I wasn’t selected.</p><p>This experience taught me a lot — not just about coding, but about patience, persistence, and self-reflection. If you’re preparing for interviews, I highly recommend practicing the problems I’ve linked above. They’re real, challenging, and incredibly insightful.</p><p>Thanks for reading. Wishing you all the best in your journey!</p><h3>A message from our Founder</h3><p><strong>Hey, </strong><a href="https://linkedin.com/in/sunilsandhu"><strong>Sunil</strong></a><strong> here.</strong> I wanted to take a moment to thank you for reading until the end and for being a part of this community.</p><p>Did you know that our team run these publications as a volunteer effort to over 3.5m monthly readers? <strong>We don’t receive any funding, we do this to support the community. ❤️</strong></p><p>If you want to show some love, please take a moment to <strong>follow me on </strong><a href="https://linkedin.com/in/sunilsandhu"><strong>LinkedIn</strong></a><strong>, </strong><a href="https://tiktok.com/@messyfounder"><strong>TikTok</strong></a>, <a href="https://instagram.com/sunilsandhu"><strong>Instagram</strong></a>. You can also subscribe to our <a href="https://newsletter.plainenglish.io/"><strong>weekly newsletter</strong></a>.</p><p>And before you go, don’t forget to <strong>clap</strong> and <strong>follow</strong> the writer️!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=6119cad40304" width="1" height="1" alt=""><hr><p><a href="https://blog.stackademic.com/my-zoho-interview-experience-a-journey-through-five-rounds-6119cad40304">💻 My Zoho Interview Experience — A Journey Through Five Rounds</a> was originally published in <a href="https://blog.stackademic.com/">Stackademic</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Mastering the Move Zeroes Problem — A Simple Two-Pointer Trick]]></title>
            <link>https://blog.stackademic.com/mastering-the-move-zeroes-problem-a-simple-two-pointer-trick-24a560c463d5?source=rss-1f86a6ee30d7------2</link>
            <guid isPermaLink="false">https://medium.com/p/24a560c463d5</guid>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[sad]]></category>
            <category><![CDATA[problem-solving]]></category>
            <category><![CDATA[arrays]]></category>
            <category><![CDATA[java]]></category>
            <dc:creator><![CDATA[Santhiya Periyasamy]]></dc:creator>
            <pubDate>Sun, 14 Sep 2025 17:01:58 GMT</pubDate>
            <atom:updated>2025-09-14T17:01:58.458Z</atom:updated>
            <content:encoded><![CDATA[<h3>Mastering the Move Zeroes Problem — A Simple Two-Pointer Trick</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/918/1*damAtiGhKbhNrpR3BwcrdQ.png" /></figure><p>🧠 Intuition</p><p>We want to push all zeroes to the end while keeping the relative order of non-zero elements intact. A simple and efficient way to do this is by using <strong>two pointers</strong>.</p><p>🔧 Approach: Two-Pointer Technique</p><p>Let’s take an example:<br> arr = [0, 1, 0, 3, 12]</p><ul><li>p1 = 0 → Tracks the position to place the next non-zero element</li><li>p2 = 0 → Traverses the array</li></ul><p>🔄 Step-by-Step Execution</p><ol><li>Traverse the array with p2.</li><li>Whenever you find a non-zero element at p2, place it at p1 and increment p1.</li><li>After the traversal, all non-zero elements are at the beginning of the array.</li><li>Fill the remaining positions (from p1 to end) with zeroes.</li></ol><p><strong>Solution (Java):</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/915/1*90Zhg2LFjWxoGCCtCA3NGQ.png" /></figure><p>💬 Closing Thoughts</p><p>This method ensures:</p><ul><li>No extra space used ✅</li><li>Order of non-zero elements preserved ✅</li><li>Efficient and beginner-friendly ✅</li><li><strong>Time Complexity : O(n) , Space Complexity : 0(1)</strong></li></ul><p>Thanks for reading! Hope this helped you understand the logic better. Wishing you a wonderful day ahead 🌟</p><h3>A message from our Founder</h3><p><strong>Hey, </strong><a href="https://linkedin.com/in/sunilsandhu"><strong>Sunil</strong></a><strong> here.</strong> I wanted to take a moment to thank you for reading until the end and for being a part of this community.</p><p>Did you know that our team run these publications as a volunteer effort to over 3.5m monthly readers? <strong>We don’t receive any funding, we do this to support the community. ❤️</strong></p><p>If you want to show some love, please take a moment to <strong>follow me on </strong><a href="https://linkedin.com/in/sunilsandhu"><strong>LinkedIn</strong></a><strong>, </strong><a href="https://tiktok.com/@messyfounder"><strong>TikTok</strong></a>, <a href="https://instagram.com/sunilsandhu"><strong>Instagram</strong></a>. You can also subscribe to our <a href="https://newsletter.plainenglish.io/"><strong>weekly newsletter</strong></a>.</p><p>And before you go, don’t forget to <strong>clap</strong> and <strong>follow</strong> the writer️!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=24a560c463d5" width="1" height="1" alt=""><hr><p><a href="https://blog.stackademic.com/mastering-the-move-zeroes-problem-a-simple-two-pointer-trick-24a560c463d5">Mastering the Move Zeroes Problem — A Simple Two-Pointer Trick</a> was originally published in <a href="https://blog.stackademic.com/">Stackademic</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[ Understanding Java Thread Lifecycle with a Simple Analogy]]></title>
            <link>https://blog.stackademic.com/understanding-java-thread-lifecycle-with-a-simple-analogy-77dc5c0a3adb?source=rss-1f86a6ee30d7------2</link>
            <guid isPermaLink="false">https://medium.com/p/77dc5c0a3adb</guid>
            <category><![CDATA[threads]]></category>
            <category><![CDATA[thread-life-cycle]]></category>
            <category><![CDATA[new-learning]]></category>
            <category><![CDATA[java]]></category>
            <category><![CDATA[threads-in-java]]></category>
            <dc:creator><![CDATA[Santhiya Periyasamy]]></dc:creator>
            <pubDate>Tue, 19 Aug 2025 06:58:48 GMT</pubDate>
            <atom:updated>2025-08-19T06:58:48.814Z</atom:updated>
            <content:encoded><![CDATA[<p>Multithreading in Java can feel intimidating at first — especially when you’re trying to wrap your head around the different thread states. But what if we explained it using something more relatable?</p><p>Let’s imagine a thread as a person trying to use a printer in an office. This analogy will help us understand the six core states in the Java thread lifecycle: NEW, RUNNABLE, BLOCKED, WAITING, TIMED_WAITING, and TERMINATED.</p><p>🔄 The Six Thread States (with Real-Life Parallels)</p><p>1. <strong>NEW</strong></p><ul><li><strong>Java</strong>: A thread is created but not started.</li><li><strong>Analogy</strong>: The person is hired and assigned a task but hasn’t begun working.</li></ul><p><strong>Code</strong>:</p><ul><li><strong>Thread t = new Thread(() -&gt; System.out.println(“Printing document”));</strong></li></ul><p>2. <strong>RUNNABLE</strong></p><ul><li><strong>Java</strong>: The thread is ready to run or is running.</li><li><strong>Analogy</strong>: The person is waiting for the printer to be free.</li><li><strong>Code</strong>:</li><li><strong>t.start(); // Now the thread is RUNNABLE</strong></li></ul><p>3. <strong>BLOCKED</strong></p><ul><li><strong>Java</strong>: Waiting to acquire a lock to enter a synchronized block.</li><li><strong>Analogy</strong>: The person tries to enter the printer room, but someone else is already inside with the key.</li><li><strong>Code</strong>:</li><li><strong>synchronized (printer) { // Thread A is inside // Thread B tries to enter and gets BLOCKED }</strong></li></ul><p>4. <strong>WAITING</strong></p><ul><li><strong>Java</strong>: Waiting indefinitely for another thread to perform an action.</li><li><strong>Analogy</strong>: The person is waiting for a colleague to hand over a document, with no deadline.</li><li><strong>Code</strong>:</li><li><strong>synchronized (lock) {<br> lock.wait(); // Thread waits indefinitely<br>}</strong></li></ul><p>5. <strong>TIMED_WAITING</strong></p><ul><li><strong>Java</strong>: Waiting for a specified time.</li><li><strong>Analogy</strong>: The person sets a timer and waits for a colleague to respond within 5 seconds.</li><li><strong>Code</strong>:</li></ul><p><strong>Thread.sleep(5000); // Waits for 5 seconds</strong></p><p>6. <strong>TERMINATED</strong></p><ul><li><strong>Java</strong>: The thread has completed execution.</li><li><strong>Analogy</strong>: The person finishes printing and leaves the office.</li><li><strong>Code</strong>:</li><li><strong>System.out.println(“Task done”);</strong></li></ul><p><strong>code (java) :</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*1g4BLR1BQvixdKrvE1Vduw.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/951/1*KzwWAdJ_dHWXrSrVQBnfVQ.png" /></figure><p>I hope this is helpful thanks for reading have a nice day !!!</p><h3>A message from our Founder</h3><p><strong>Hey, </strong><a href="https://linkedin.com/in/sunilsandhu"><strong>Sunil</strong></a><strong> here.</strong> I wanted to take a moment to thank you for reading until the end and for being a part of this community.</p><p>Did you know that our team run these publications as a volunteer effort to over 3.5m monthly readers? <strong>We don’t receive any funding, we do this to support the community. ❤️</strong></p><p>If you want to show some love, please take a moment to <strong>follow me on </strong><a href="https://linkedin.com/in/sunilsandhu"><strong>LinkedIn</strong></a><strong>, </strong><a href="https://tiktok.com/@messyfounder"><strong>TikTok</strong></a>, <a href="https://instagram.com/sunilsandhu"><strong>Instagram</strong></a>. You can also subscribe to our <a href="https://newsletter.plainenglish.io/"><strong>weekly newsletter</strong></a>.</p><p>And before you go, don’t forget to <strong>clap</strong> and <strong>follow</strong> the writer️!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=77dc5c0a3adb" width="1" height="1" alt=""><hr><p><a href="https://blog.stackademic.com/understanding-java-thread-lifecycle-with-a-simple-analogy-77dc5c0a3adb">🧵 Understanding Java Thread Lifecycle with a Simple Analogy</a> was originally published in <a href="https://blog.stackademic.com/">Stackademic</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[ Spring vs Spring Boot: A Beginner-Friendly “Hello World” Walkthrough]]></title>
            <link>https://blog.stackademic.com/spring-vs-spring-boot-a-beginner-friendly-hello-world-walkthrough-f1301b023423?source=rss-1f86a6ee30d7------2</link>
            <guid isPermaLink="false">https://medium.com/p/f1301b023423</guid>
            <category><![CDATA[spring-framework]]></category>
            <category><![CDATA[java]]></category>
            <category><![CDATA[spring-boot]]></category>
            <category><![CDATA[tomcat]]></category>
            <category><![CDATA[spring]]></category>
            <dc:creator><![CDATA[Santhiya Periyasamy]]></dc:creator>
            <pubDate>Tue, 12 Aug 2025 08:27:45 GMT</pubDate>
            <atom:updated>2025-08-12T08:27:45.979Z</atom:updated>
            <content:encoded><![CDATA[<p>Let’s understand the difference between <strong>Spring</strong> and <strong>Spring Boot</strong> with a simple example — yes, the classic “Hello World”! (Just kidding, but not really 😄</p><p>🧩 Building a Basic Spring Application</p><p>Spring requires a bit of setup before you can see anything on the screen. Here’s how to get started:</p><p>1. <strong>Create a Maven Project</strong></p><ul><li>Use the Maven archetype: webapp</li><li>Select catalog as <strong>Internal</strong></li><li>Click <strong>Create</strong></li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*xspcWCd2JrTjL7J1Qu1tUg.png" /></figure><p>2. <strong>Set Up Your Controller</strong></p><ul><li>Create a package and a controller class</li><li>Add a simple @GetMapping method to return &quot;Hello World&quot;</li></ul><p>⚠️ If you encounter annotations in red in your controller class, it typically indicates that the required Spring dependencies are not yet included in your project configuration</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*h66qm1j05aGIhYoTLFVvaw.png" /></figure><p>3. <strong>Add Required Dependencies</strong></p><p>Include the following in your pom.xml:</p><ul><li>spring-core</li><li>spring-webmvc</li></ul><p>This enables annotations like @Controller, @GetMapping, etc.</p><p>4. <strong>Configure Tomcat Server</strong></p><p>Download Tomcat from <a href="https://tomcat.apache.org/">tomcat.apache.org</a> and integrate it with your project.</p><p>To verify installation:</p><ul><li>Visit localhost:8080 in your browser</li><li>You should see the Tomcat welcome page</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*jMHfg30bn49nM8sDowdDqQ.png" /><figcaption>localhost:8080(port you have given during download).</figcaption></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Gq8DfBlD273LXthc-tf2SQ.png" /></figure><p>5. <strong>Set Up Dispatcher Servlet</strong></p><p>🧭 <strong>Understanding DispatcherServlet</strong></p><p>In a traditional Spring MVC application, the <strong>DispatcherServlet</strong> plays a central role in handling HTTP requests and coordinating the flow between controllers, views, and models. Here’s how it works and how to configure it properly.</p><p>🚦 What Is DispatcherServlet?</p><p>The DispatcherServlet is the <strong>front controller</strong> in Spring MVC. It intercepts all incoming requests and delegates them to appropriate handler methods (like those in your controller classes).</p><p>Key responsibilities:</p><ul><li>Scans specified packages for annotated components (@Controller, @Service, etc.)</li><li>Instantiates beans and registers them in the <strong>Spring IoC container</strong></li><li>Maps incoming requests to handler methods using annotations like @RequestMapping or @GetMapping.</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*E3vFoOuIAsrUsdu_VrNV9Q.png" /><figcaption><strong>Selinium Express youtube channel explanation picture.</strong></figcaption></figure><p>🛠️ How to Configure DispatcherServlet</p><p>🛠️ How to Configure DispatcherServlet</p><p>To set up DispatcherServlet manually, you create a class that extends AbstractAnnotationConfigDispatcherServletInitializer. This class replaces the traditional web.xml configuration.</p><p>🧪 Final Touch: Servlet Dependency</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*XP-ivKoDxT2jf4rLNMnO1g.png" /></figure><p>6. <strong>Create Configuration Class</strong></p><p>Use @ComponentScan to specify which packages Spring should scan:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/880/1*5uQFouN0KcowavQdRlPTVg.png" /></figure><p>🎁 Bonus Tip: Deploying a WAR File to Tomcat</p><p>If you already have a .war file:</p><ul><li>Go to localhost:8080</li><li>Click <strong>Server Status</strong></li><li>Under <strong>List Applications</strong>, use the <strong>Deploy</strong> option</li><li>Upload your WAR file and run it directl</li></ul><h3><strong>🚀 Why Spring Boot Is Easier</strong></h3><p>Now imagine doing all of the above with just a few lines of code. That’s <strong>Spring Boot</strong>. you can create a springboot application in <a href="http://start.spring.io/"><strong>start.spring.io</strong> </a>by including necessary dependencies.</p><p>Spring Boot:</p><ul><li>Auto-configures DispatcherServlet</li><li>Embeds Tomcat (no need to download separately)</li><li>Requires minimal setup</li><li>Lets you run your app with just main() method</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*PPcpiUjs5Y0qJ2y0-KNd9A.png" /><figcaption><strong>Initialising springboot project</strong></figcaption></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/925/1*x-foQ6X_MwR0OclzR-nMhg.png" /><figcaption><strong>Controller class</strong></figcaption></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*AsZrEA5s3N67XufTJ4TZdQ.png" /><figcaption><strong>Default setup when we download springboot application</strong></figcaption></figure><p>📺<strong> Want to Learn More?</strong></p><p>Check out the <strong>Selenium Express</strong> YouTube channel — they explain Spring concepts with great visuals and analogies.</p><p>Thanks for reading! Hope this helped clarify the difference between Spring and Spring Boot. Have a lovely day 🌼.</p><h3>A message from our Founder</h3><p><strong>Hey, </strong><a href="https://linkedin.com/in/sunilsandhu"><strong>Sunil</strong></a><strong> here.</strong> I wanted to take a moment to thank you for reading until the end and for being a part of this community.</p><p>Did you know that our team run these publications as a volunteer effort to over 3.5m monthly readers? <strong>We don’t receive any funding, we do this to support the community. ❤️</strong></p><p>If you want to show some love, please take a moment to <strong>follow me on </strong><a href="https://linkedin.com/in/sunilsandhu"><strong>LinkedIn</strong></a><strong>, </strong><a href="https://tiktok.com/@messyfounder"><strong>TikTok</strong></a>, <a href="https://instagram.com/sunilsandhu"><strong>Instagram</strong></a>. You can also subscribe to our <a href="https://newsletter.plainenglish.io/"><strong>weekly newsletter</strong></a>.</p><p>And before you go, don’t forget to <strong>clap</strong> and <strong>follow</strong> the writer️!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=f1301b023423" width="1" height="1" alt=""><hr><p><a href="https://blog.stackademic.com/spring-vs-spring-boot-a-beginner-friendly-hello-world-walkthrough-f1301b023423">🌱 Spring vs Spring Boot: A Beginner-Friendly “Hello World” Walkthrough</a> was originally published in <a href="https://blog.stackademic.com/">Stackademic</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
    </channel>
</rss>