<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel>
<title>Snipplr - ariellephan</title>
<link>http://snipplr.com/users/ariellephan</link>
<description>Recent snippets posted on Snipplr.com</description>
<language>en-us</language>
<pubDate>Sat, 18 May 2013 20:43:52 GMT</pubDate>
<item>
<title>(C) Standard Input in different languages</title>
<link>http://snipplr.com/view/61941/standard-input-in-different-languages/</link>
<description><![CDATA[ <p>Other languages are included as well</p> ]]></description>
<pubDate>Sat, 17 Dec 2011 10:21:30 GMT</pubDate>
<guid>http://snipplr.com/view/61941/standard-input-in-different-languages/</guid>
</item>
<item>
<title>(Ruby) Function as Procedure in Method called on Hashes</title>
<link>http://snipplr.com/view/61875/function-as-procedure-in-method-called-on-hashes/</link>
<description><![CDATA[ <p>Learn Ruby the Hard Way</p> ]]></description>
<pubDate>Wed, 14 Dec 2011 09:40:41 GMT</pubDate>
<guid>http://snipplr.com/view/61875/function-as-procedure-in-method-called-on-hashes/</guid>
</item>
<item>
<title>(SQL) Select Zipcodes group by the first 3 digits and Export in Set</title>
<link>http://snipplr.com/view/57169/select-zipcodes-group-by-the-first-3-digits-and-export-in-set/</link>
<description><![CDATA[ <p></p> ]]></description>
<pubDate>Wed, 27 Jul 2011 02:40:11 GMT</pubDate>
<guid>http://snipplr.com/view/57169/select-zipcodes-group-by-the-first-3-digits-and-export-in-set/</guid>
</item>
<item>
<title>(PHP) FizzBuzz with input from user</title>
<link>http://snipplr.com/view/57069/fizzbuzz-with-input-from-user/</link>
<description><![CDATA[ <p></p> ]]></description>
<pubDate>Sat, 23 Jul 2011 11:32:24 GMT</pubDate>
<guid>http://snipplr.com/view/57069/fizzbuzz-with-input-from-user/</guid>
</item>
<item>
<title>(PHP) FizzBuzz</title>
<link>http://snipplr.com/view/57021/fizzbuzz/</link>
<description><![CDATA[ <p>2 ways to go about this problem</p> ]]></description>
<pubDate>Fri, 22 Jul 2011 11:07:53 GMT</pubDate>
<guid>http://snipplr.com/view/57021/fizzbuzz/</guid>
</item>
<item>
<title>(JavaScript) Tumblr Tag Cloud</title>
<link>http://snipplr.com/view/55705/tumblr-tag-cloud/</link>
<description><![CDATA[ <p></p> ]]></description>
<pubDate>Sat, 25 Jun 2011 21:05:26 GMT</pubDate>
<guid>http://snipplr.com/view/55705/tumblr-tag-cloud/</guid>
</item>
<item>
<title>(CSS) Pure CSS hover</title>
<link>http://snipplr.com/view/55021/pure-css-hover/</link>
<description><![CDATA[ <p></p> ]]></description>
<pubDate>Wed, 08 Jun 2011 21:25:56 GMT</pubDate>
<guid>http://snipplr.com/view/55021/pure-css-hover/</guid>
</item>
<item>
<title>(Python) Determine whether a triangle can be built from a given set of edges</title>
<link>http://snipplr.com/view/43036/determine-whether-a-triangle-can-be-built-from-a-given-set-of-edges/</link>
<description><![CDATA[ <p>Task description:

Write a function
int triangle(int[] A);
which given a zero-indexed array A of n integers returns 1 if there exists triple i,j,k (, ) such that:

A[i] + A[j] > A[k] 

A[i] + A[k] > A[j] 

A[j] + A[k] > A[i] 
or returns 0 otherwise.
Examples: 
For:

A[0]=10, A[1]=2, A[2]=5, A[3]=1, A[4]=8, A[5]=20 
your function should return 1, since for i=0,j=2,k=4 all conditions are fullfiled (i.e. A[2]+A[4]>A[0]).
For:

A[0]=10, A[1]=50, A[2]=5, A[3]=1 
your function should return 0.</p> ]]></description>
<pubDate>Wed, 27 Oct 2010 20:46:11 GMT</pubDate>
<guid>http://snipplr.com/view/43036/determine-whether-a-triangle-can-be-built-from-a-given-set-of-edges/</guid>
</item>
<item>
<title>(Java) Equilibrium index</title>
<link>http://snipplr.com/view/43030/equilibrium-index/</link>
<description><![CDATA[ <p>Given an array A of N integers, equi(A) is any index i for which:
(1)  i is a valid index into A, i.e. 0 </p> ]]></description>
<pubDate>Wed, 27 Oct 2010 20:02:02 GMT</pubDate>
<guid>http://snipplr.com/view/43030/equilibrium-index/</guid>
</item>
</channel>
</rss>