<?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 Jayshree Rathi on Medium]]></title>
        <description><![CDATA[Stories by Jayshree Rathi on Medium]]></description>
        <link>https://medium.com/@jsrathi17?source=rss-54c17c906070------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*cFYclaIx1VOTYQ5GpQzryg@2x.jpeg</url>
            <title>Stories by Jayshree Rathi on Medium</title>
            <link>https://medium.com/@jsrathi17?source=rss-54c17c906070------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Fri, 20 Nov 2026 14:56:56 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@jsrathi17/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[You Are Not Alone]]></title>
            <link>https://medium.com/@jsrathi17/you-are-not-alone-cd72d94fc5c8?source=rss-54c17c906070------2</link>
            <guid isPermaLink="false">https://medium.com/p/cd72d94fc5c8</guid>
            <dc:creator><![CDATA[Jayshree Rathi]]></dc:creator>
            <pubDate>Thu, 30 Dec 2021 23:33:49 GMT</pubDate>
            <atom:updated>2021-12-30T23:33:49.882Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*MHfuSKW7lxt_C019Hhf9dQ.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/@sashafreemind?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Sasha Freemind</a> on <a href="https://medium.com/s/photos/lonely-sad?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Unsplash</a></figcaption></figure><p><em>This blog is simply an accumulation of my thoughts.</em></p><p>How often have you tried to commit suicide? Or let me put it this way, how often have you thought of suicide and considered it an option, or an alternative? Have you lost someone, a close one, a person you admired, someone you knew because he/she couldn’t hold it anymore and decide to end their life? Ever contemplated what could possibly have happened?</p><blockquote><em>World Health Organization (WHO) statistics say that close to 800,000 people commit suicide every year. For each adult who died by suicide there may have been more than 20 others attempting suicide. And that suicide is the second leading cause of death among 15–29 year olds globally.</em></blockquote><p>When we come across someone who committed suicide for reasons which were never a problem for us like dealing with heartbreak, academic failure, financial problems, we proudly acclaim that the person was a coward. How committing suicide should never be an option. Then why, why does it become one? We claim the person to be a coward, but in reality, it does take guts to end one’s life. A life we nurtured, cared for and fought for. A life full of hard work, sacrifices, and hope. Then why?</p><p>Honestly, I don’t know. I have been around different kinds of people in life. Some, who left no stone unturned to make others&#39; life hell, backbiting, bullying, cornering others, and whatnot. I know most of us have fallen prey to bullies at some point in our life, have been a victim of Nepotism and dirty politics, been lonely, failed, rejected cried alone. Hard times hit everyone. Some grow through it, some drown with it.</p><p>Life can be hell and unliveable at times. The simple idea of death and all of this being over can be so comforting that most of us get deceived. Obviously, if we are to die someday, then what is the point of going through all of this?</p><p><strong><em>People will choose unhappiness over uncertainty.” ― Timothy Ferriss</em></strong></p><p>The world every day is battling through a lot of problems — poverty, hunger, unemployment, war, safety, corruption. And a single human or a community cannot eradicate these problems from society. But often when considering these important third-world issues, we tend to forget that people are fighting a different battle too, our inner battle.</p><p>We believe that we need to do something revolutionary to make someone’s life better. Doing charity and social work is one part. But not all of us are capable of doing charity. Not all of us are privileged enough. Some of us are bounded by commitments we cannot forego. But in reality, one smile, one compliment, a simple gesture that takes little or no effort can make someone’s day.</p><p>It is these small actions that affect people.</p><p>I hope soon we live in a world filled with affection, love and warmth towards other human. I hope no one has to end their life because life at one point gets to difficult to live in.</p><p>I hope for a better 2022.</p><p>&lt;wrote this back in 2020, when someone covid hit, people I knew and care about were going through deep emotional pain, and wanted to end their life. It was difficult to watch and I felt helpless. I heard so many suicide stories that left my heart numb.</p><p>but never really posted it. Posting it today, the last day of 2021&gt;</p><p>References:</p><ol><li><a href="https://www.who.int/mental_health/prevention/suicide/suicideprevent/en/">https://www.who.int/mental_health/prevention/suicide/suicideprevent/en/</a></li></ol><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=cd72d94fc5c8" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Dynamic Programming — Part 1]]></title>
            <link>https://medium.com/@jsrathi17/dynamic-programming-part-1-bb883e4848f8?source=rss-54c17c906070------2</link>
            <guid isPermaLink="false">https://medium.com/p/bb883e4848f8</guid>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[dynamic-programming]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[python]]></category>
            <category><![CDATA[programming]]></category>
            <dc:creator><![CDATA[Jayshree Rathi]]></dc:creator>
            <pubDate>Thu, 16 Apr 2020 11:10:33 GMT</pubDate>
            <atom:updated>2020-04-16T11:10:33.055Z</atom:updated>
            <content:encoded><![CDATA[<h3>Dynamic Programming — Part 1</h3><p><strong>Dynamic Programming </strong>is a method to solve a complex problem by combining the solution to its <strong>overlapping</strong> sub-problems just like divide-and-conquer algorithms.<em> In </em><strong><em>divide and conquer</em></strong><em>, the problems are broken down into smaller </em><strong><em>independent</em></strong><em> sub-problems, the sub-problems are then solved recursively and finally, their solutions are combined to solve the original problem.</em></p><p>For dynamic programming, however, the subproblems aren’t independent but rather overlapping i.e. they share common sub-subproblems. The solutions to the subproblems can be saved in a tabular form and can be reused later, avoiding the need for recomputation.</p><p>The necessity of Dynamic Programming arises when the solution to the problem using other traditional approaches is time-consuming, inefficient and tedious, and given that the problem can be divided into similar sub-problems. For example, problems like Matrix Chain Multiplication, Knapsack Problem, Longest Common SubSequence are often solved using Dynamic Programming.</p><h3>Longest common subsequence (LCS):</h3><p>A subsequence of a sequence is derived by deleting some or no elements from the sequence. For instance, given sequence S1 = ABCDA. Its subsequences include A, AB, ABC, ABD, ABA, ADA, ABCD and more. <em><br>The subsequence needs to be sequential but not necessarily continuous.</em></p><p>In the LCS problem, we are given two strings: S1 &amp; S2 and wish to find the maximum-length common subsequence from both.</p><p><strong>Brute Force Approach:</strong></p><blockquote>As a wise man would suggest, “Always initiate a problem with its “Brute force” solution and optimize it iteratively along the way. “</blockquote><p><em>*Assume the length of S1 is n and S2 is m.</em></p><ul><li>Generate every subsequence of S1 — Time Complexity: (O (2^n))</li><li>Check if the generated subsequence is a subsequence of Y — Time Complexity O(m)</li><li>Find the longest subsequence amongst the common subsequence — O(1)</li></ul><p>The time complexity of the Brute force approach is <strong>O(m * 2^n)</strong>. That’s exponential and huge!</p><p><strong>Recursion Approach:</strong></p><p>The recursive approach of the LCS problem is to generate all subsequences of S1 and S2 and find the longest matching subsequence. The recursive definition of LCS(S1[1..n], S2[1..m]) is as -</p><ul><li>If S1(n) == S2(m) then LCS(S1[1..n], S2[1..m]) = LCS(S1[1..n-1], s2[1..m-1])</li><li>Else if above condition is false then, LCS(S1[1..n], S2[1..m]) = max( LCS(S1[1..n-1], S2[1..m]), LCS(S1[1..n], S2[1..m-1]) )</li></ul><p>Let’s assume, S1 = ABCD and S2 = ABC</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/839/1*vUURQpHCEnJJbgU_u15TJQ.png" /><figcaption>Partial Recursion tree for S1 and S1 — showing how recursion calls are made</figcaption></figure><p>From the above tree, we can derive that the call for LCS(“ABC”,”ABD”) is made twice. There could be many such scenarios, in problems with longer strings when a full recursion tree is drawn. It can be solved if we had the result for the given call stored in memory. This technique of storing the result of recursion is called <strong>Memoization.</strong></p><p><strong>Dynamic Programming Approach:</strong></p><p>In the Dynamic Programming solution, a table <em>(say L)</em> is maintained to simplify the construction of an optimal subproblem. Each entry in L points to the optimal subproblem solution chosen while performing the computation.</p><p>Dynamic programming computes the solution bottom-up approach i.e. it first looks at the “smaller” subproblems and then solves the larger subproblems using the solution to the previously solved smaller subproblems.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/588/1*YqFI7BRI97w3yPE65HlGBQ.png" /><figcaption>Table — L storing optimal solution</figcaption></figure><p><strong>Implementation of Dynamic Programming solution for Longest Common Subsequence using Python —</strong></p><pre>def lcs(S1,S2):<br>    n=len(S1)<br>    m=len(S2)</pre><pre>L=[[None]*(m+1) for i in range(n+1)]</pre><pre>for i in range(n+1):<br>        for j in range(m+1):<br>        <br>            if i == 0 or j == 0:<br>                L[i][j]=0<br>     <br>            elif x[i-1] == y[j-1]:<br>                L[i][j] = L[i-1][j-1]+1<br>       <br>            else:<br>                L[i][j] = max(L[i-1][j],L[i][j-1])</pre><pre>return L[m][n]</pre><pre>x=input(&quot;First string : &quot;)<br>y=input(&quot;Second string: &quot;)<br>print(&quot;The length of LCS is : &quot;,lcs(x,y))</pre><p>Time Complexity for this approach is — O(nm), as each table entry takes O(1) time to compute.</p><p><strong>Application of Longest Common Subsequence:</strong></p><p>In biological applications, when comparing the DNA of two organisms. DNA are compared to determine how “similar” two organisms are. A strand of DNA can be represented as a string over the finite set {A, C, G, T}. For instance, DNA of one being is something like S1= ACCGGTCGAGTGCGCG, while the DNA of another being maybe S2 = GTCGTTCGGAATGCCGTT. A method to measure the similarity is finding a third strand S3, which is the longest common subsequence of both S1 and S2s. The longer the strand S3, the more similar S1, and S2 are. <br>LCS problems also have applications in the field of Computational Linguistics.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=bb883e4848f8" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Google WTM Scholarship Application : A Nepalese Scholar Perspective]]></title>
            <link>https://medium.com/@jsrathi17/google-wtm-scholarship-application-a-nepalese-scholar-perspective-f4e3ddd3626?source=rss-54c17c906070------2</link>
            <guid isPermaLink="false">https://medium.com/p/f4e3ddd3626</guid>
            <dc:creator><![CDATA[Jayshree Rathi]]></dc:creator>
            <pubDate>Sat, 21 Mar 2020 17:14:50 GMT</pubDate>
            <atom:updated>2020-03-21T17:14:50.954Z</atom:updated>
            <content:encoded><![CDATA[<h3>Google WTM Scholarship Application : A Nepalese Scholar Perspective</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*cAujnmReLlHc9Ut4FhSxAQ.jpeg" /><figcaption>Mandatory Google Picture</figcaption></figure><p><em>Months of procrastination come to an end now! I have been hesitant for a couple of months now on writing out this blog and actually posting it on Medium, partly because I am not a very good writer and mostly because I was being “lazy”.</em></p><h3>About Google Women Techmakers Scholarship</h3><p><em>Through the Women Techmakers Scholars Programme — formerly the Google Anita Borg Memorial Scholarship Programme — Google is furthering Dr. Anita Borg’s vision of creating gender equality in the field of computer science by encouraging women to excel in computing and technology and become active leaders and role models in the field.</em></p><p>I was selected as a Google Women Techmakers Scholar in 2019, along with 74 other wonderful and talented females from an applicant pool of 25000 students from 14 different countries. As a Scholar, I was provided with:</p><ol><li>Scholarship Amount</li><li>A fully funded Retreat at a Google Asia Pacific Office (<em>Google Australia in 2019</em>)</li><li>Community, and Support for outreach activities</li></ol><h4>How I Applied for Google WTM?</h4><p>It was one random day, around the month of March, when I clicked a random link that popped up on my Facebook news feed, which changed my life drastically. It was a link to Google WTM Scholarship for Asia Pacific region. The first thing I did was find out about the eligible countries and google what the scholarship was about. Though Nepal fell in APAC region, there were no prior scholars under Nepal’s name yet. <em>Later I found out, there was a scholar before me from Nepal but since she was studying in China, her name was listed with Chinese scholars.</em></p><p>With no one to seek advice from, I started out by reading blogs on Google WTM Scholarship on Medium by previous scholars. I researched, googled and procrastinated with my application like every other person. It was only few hours before the deadline I actually started writing and compiling my application essays, getting together my CV and preparing a well-documented research project report.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*c_DQXk2fOJp_cYWeMnH8PQ.jpeg" /><figcaption>A random Google Selfie</figcaption></figure><h3><strong>Application Process:</strong></h3><h4>Essays —</h4><p>For Application essays, we were asked to answer few questions. Google, made it clear that grammar and language didn’t matter for essays. So, I wrote what came in my heart with pure honesty and integrity. I tried to be as honest as I could be, gave facts and figures which I had evidence to support with and described everything I was in those 2 questions asked.</p><p>Most of my juniors and friends from Nepal are skeptical while writing out Application Essays. Few points I would like to suggest is:</p><ol><li>Stay True to your essays. Whatever you write, make sure you inculcate your passion, goals and ambition and make your essay reviewer feel every word you wrote.</li><li>If you can, try including your personal stories — that could be a moment of doubt, fear or even a moment of proud achievement of being a Women in Computer Science.</li><li>Don’t feel that you need to have made some ground breaking discoveries, or have done enormous activities. Every simple act matters. I personally, am a huge believer of Long Term Impact even to small scale over Short Term Events, that are mostly seasonal.</li><li>Be Honest. Be yourself.</li></ol><h4>Academic Transcripts —</h4><p>I have seen many of my juniors being concerned with the Academic Transcript section. Most of them had questions on whether having somewhat low grades in one or two subjects could affect their chances of getting selected. Here’s what I think — Though I am an academically sound student, I do not believe that Transcripts solely act as a determining factor for your application to stand out from others. Application for Google WTM is comprised of numerous fields including projects, essays, leadership activities, coding experiences, research experiences along with academics. All of them combined, and your goals, ambitions and work in computer science is what makes you stand out among thousand other applicants. <br>I remember some of my fellow WTM Scholars also asked this questions in retreat, to which our regional specialist replied with:</p><blockquote>Don’t worry if you screw up a subject or two, we do understand!</blockquote><h4>Resume —</h4><p>Certain things I believe you should include in your CV/Resume:</p><ol><li>Education</li><li>Work/Research Experience (If Any)</li><li>Course Work</li><li>Skills (Technical, Non-Technical)</li><li>Projects</li><li>Leadership Experience (Position of Responsibility, Societies involvement)</li><li>Achievements</li><li>Relevant Links (Linkedin, Github, Stack Overflow, Blog etc.)</li></ol><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*QxbhATf-rDyUzKPi_O8gIg.jpeg" /><figcaption>Resume/CV workshop in Google WTM Retreat</figcaption></figure><h4>Academic Project Report/Research Paper —</h4><p>Include a project or research work, in which you personally worked on and are most proud of. This section is pretty straight-forward. I wrote on my project on NLP and for documentation, I used LaTex. For you, this could be completely different.</p><h4>Coding Experience —</h4><p>I was not much active on online competitive coding competition during the time of application, but had participated on few codejams happening around my Campus. Again, this is pretty straight-forward too. Include the relevant experience you have under this category.</p><p>Also, if you don&#39;t have some, this section is not mandatory. However, I would suggest to get acquainted with Competitive Coding, if you haven’t yet. <a href="https://codingcompetitions.withgoogle.com/kickstart">Google Kickstart</a> could be a good start. This would not only enhance your application, but also help you get better at coding and problem-solving.</p><blockquote>Lastly, I’d suggest to apply <strong>No matter what</strong>. I know you’d have your doubts, as I had mine too. You may or may not get it, which is a completely different story, but the application will still be worth it. And you never know what the future holds!</blockquote><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*F7JJqoDYK0IRP88gsYTm9w.jpeg" /><figcaption>WTM Scholars Retreat 2019</figcaption></figure><p><em>Feel free to reach out to me on: jayshreerathi111@gmail.com</em></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=f4e3ddd3626" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>