<?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 Jaeseung Ko on Medium]]></title>
        <description><![CDATA[Stories by Jaeseung Ko on Medium]]></description>
        <link>https://medium.com/@Jason7ko?source=rss-8aa59dbc12b------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/proxy/1*TGH72Nnw24QL3iV9IOm4VA.png</url>
            <title>Stories by Jaeseung Ko on Medium</title>
            <link>https://medium.com/@Jason7ko?source=rss-8aa59dbc12b------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Wed, 18 Nov 2026 00:35:27 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@Jason7ko/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[leetCode Problem — TwoSum]]></title>
            <link>https://medium.com/@Jason7ko/leetcode-problem-twosum-15d3c04b1933?source=rss-8aa59dbc12b------2</link>
            <guid isPermaLink="false">https://medium.com/p/15d3c04b1933</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[swift]]></category>
            <category><![CDATA[leetcode]]></category>
            <dc:creator><![CDATA[Jaeseung Ko]]></dc:creator>
            <pubDate>Wed, 06 Apr 2016 13:36:44 GMT</pubDate>
            <atom:updated>2016-04-06T13:36:44.947Z</atom:updated>
            <content:encoded><![CDATA[<p><strong>Issue Description :</strong><br>Given an array of integers, return indices of the two numbers such that they add up to a specific target. <br>You may assume that each input would have exactly one solution.</p><p><strong>Example :</strong><br>Given nums = [2, 7, 11, 15], target = 9,<br>Because nums[0] + nums[1] = 2 + 7 = 9,<br>return [0, 1].</p><p><strong>My Solution :</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Pri3s2nG64_Hf0Gz5lxhwA.png" /></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=15d3c04b1933" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>