<?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 Rahul Das on Medium]]></title>
        <description><![CDATA[Stories by Rahul Das on Medium]]></description>
        <link>https://medium.com/@rahuldas_84942?source=rss-f6825620a10c------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*YUa11QAVsk1pHnzIWIGDrg.jpeg</url>
            <title>Stories by Rahul Das on Medium</title>
            <link>https://medium.com/@rahuldas_84942?source=rss-f6825620a10c------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Mon, 16 Nov 2026 22:25:18 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@rahuldas_84942/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[Day 2]]></title>
            <link>https://medium.com/@rahuldas_84942/day-2-df7f6b7d1e16?source=rss-f6825620a10c------2</link>
            <guid isPermaLink="false">https://medium.com/p/df7f6b7d1e16</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[practice]]></category>
            <category><![CDATA[singly-linked-list]]></category>
            <category><![CDATA[java]]></category>
            <dc:creator><![CDATA[Rahul Das]]></dc:creator>
            <pubDate>Sat, 20 Jun 2020 19:18:49 GMT</pubDate>
            <atom:updated>2020-06-20T19:18:49.537Z</atom:updated>
            <content:encoded><![CDATA[<p>Day 2</p><p>You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.</p><p>You may assume the two numbers do not contain any leading zero, except the number 0 itself.</p><p>Example:</p><p>Input: (2 -&gt; 4 -&gt; 3) + (5 -&gt; 6 -&gt; 4)<br>Output: 7 -&gt; 0 -&gt; 8<br>Explanation: 342 + 465 = 807.</p><p>/**<br> * Definition for singly-linked list.<br> * public class ListNode {<br> * int val;<br> * ListNode next;<br> * ListNode() {}<br> * ListNode(int val) { this.val = val; }<br> * ListNode(int val, ListNode next) { this.val = val; this.next = next; }<br> * }<br> */<br>class Solution {<br> public ListNode addTwoNumbers(ListNode l1, ListNode l2) {<br> ListNode res = null;<br> ListNode prev = null;<br> ListNode temp = null;<br> int carry = 0 , sum;<br> <br> //Till both the LL is not to NULL<br> while (l1 != null || l2 != null ){<br> <br> //check the node has value or not if not assign as zero<br> sum = carry + (l1 != null ? l1.val : 0)<br> + (l2 != null ? l2.val : 0);<br> <br> //getting the remainder<br> carry = (sum &gt;= 10) ? 1: 0;<br> <br> //value which we are going to put in new node<br> sum = sum % 10;<br> <br> //create new node assign the value<br> temp = new ListNode(sum);<br> <br> //getting the pointer address<br> if (res == null){<br> res = temp;<br> } else {<br> //connect new node with rest of the node<br> prev.next = temp;<br> }<br> <br> //move current node as previous<br> prev = temp;<br> <br> <br> //move forward if not null<br> if (l1 != null){<br> l1 = l1.next;<br> }<br> <br> //move forward if not null<br> if (l2 != null){<br> l2 = l2.next;<br> }<br> <br> }<br> <br> //if at the end we got remainder left<br> // create a newnode and linked it.<br> if (carry &gt; 0){<br> temp.next = new ListNode(carry);<br> }<br> <br> return res;<br> }<br>}</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=df7f6b7d1e16" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[It’ never too late to start.]]></title>
            <link>https://medium.com/@rahuldas_84942/it-never-too-late-to-start-a91c60629be6?source=rss-f6825620a10c------2</link>
            <guid isPermaLink="false">https://medium.com/p/a91c60629be6</guid>
            <category><![CDATA[learn]]></category>
            <category><![CDATA[learning-to-code]]></category>
            <category><![CDATA[code-newbie]]></category>
            <dc:creator><![CDATA[Rahul Das]]></dc:creator>
            <pubDate>Thu, 18 Jun 2020 17:54:23 GMT</pubDate>
            <atom:updated>2020-06-18T17:54:23.934Z</atom:updated>
            <content:encoded><![CDATA[<p>After done with my graduation now i can feel the importance of education. So again to practice the learning process.</p><p>Given an array of integers, return indices of the two numbers such that they add up to a specific target.Start with basic</p><p>class Solution {<br> public int[] twoSum(int[] nums, int target) {<br> <br> //int l = 0;<br> //int r = nums.length — 1;<br> <br> for (int i = 0; i &lt; nums.length; i++) {<br> for (int j = i + 1; j &lt; nums.length; j++) {<br> if (nums[i] + nums[j] == target) {<br> return new int[] { i, j };<br> }<br> }<br> }<br> return new int[] {};<br> }<br>}</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=a91c60629be6" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>