<?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[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>http://direct.ecency.com</link><image><url>http://direct.ecency.com/logo512.png</url><title>RSS Feed</title><link>http://direct.ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Wed, 15 Apr 2026 17:03:52 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/@elsyr/rss" rel="self" type="application/rss+xml"/><item><title><![CDATA[LeetCode 1. Two Sum: CPP Solution]]></title><description><![CDATA[Problem Statement Given an integer array of size N, return indices of the two numbers such that they add up to a specific target. Function Signature: C++ vector<int> twoSum(vector<int> input,]]></description><link>http://direct.ecency.com/leetcode/@elsyr/leetcode-1-two-sum-cpp-solution</link><guid isPermaLink="true">http://direct.ecency.com/leetcode/@elsyr/leetcode-1-two-sum-cpp-solution</guid><category><![CDATA[leetcode]]></category><dc:creator><![CDATA[elsyr]]></dc:creator><pubDate>Fri, 22 Dec 2017 00:46:39 GMT</pubDate></item></channel></rss>