<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>algorithms on Suriya's site</title><link>https://subygan.com/tech/algos/</link><description>Recent content in algorithms on Suriya's site</description><generator>Hugo</generator><language>en</language><copyright>This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.</copyright><item><title>prime number library for rust</title><link>https://subygan.com/tech/algos/prime/</link><pubDate>Wed, 16 Oct 2024 00:00:00 +0000</pubDate><guid>https://subygan.com/tech/algos/prime/</guid><description>&lt;p>&lt;a href="https://docs.rs/primes/latest/primes/">primes&lt;/a>
 does not handle numbers &amp;gt; 1000&lt;/p>
&lt;p>We need a nice cli that is able to take in arbitrary sized numbers and just chug away.&lt;/p></description></item><item><title>bloom filter</title><link>https://subygan.com/tech/algos/bloom_filter/</link><pubDate>Sat, 12 Nov 2022 00:00:00 +0000</pubDate><guid>https://subygan.com/tech/algos/bloom_filter/</guid><description>&lt;p>Bloom filters have nothing to do with flowers (despite the blog emoji 🥸). It was conceived by Burton howard Bloom. This is a &lt;em>Space-efficient probablistic data structure&lt;/em>. In Bloom filter false positives are very much possible, but false-negatives are not possible (i.e.) a query either returns, &amp;ldquo;possibly in set&amp;rdquo; or &amp;ldquo;definitely not&amp;rdquo;. So, when a bloom filter returns &amp;ldquo;no&amp;rdquo; you can believe it, if it returns &amp;ldquo;maybe&amp;rdquo; you cannot. And it is very very efficient.&lt;/p></description></item><item><title>todo</title><link>https://subygan.com/tech/algos/1_todo/</link><pubDate>Fri, 12 Nov 2010 00:00:00 +0000</pubDate><guid>https://subygan.com/tech/algos/1_todo/</guid><description>&lt;ul>
&lt;li>Levenshtein automaton&lt;/li>
&lt;li>paxos algorithm
&lt;ul>
&lt;li>&lt;a href="https://martinfowler.com/articles/patterns-of-distributed-systems/paxos.html">https://martinfowler.com/articles/patterns-of-distributed-systems/paxos.html&lt;/a>
&lt;/li>
&lt;/ul>
&lt;/li>
&lt;/ul></description></item><item><title/><link>https://subygan.com/tech/algos/README/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://subygan.com/tech/algos/README/</guid><description>&lt;h1 id="algorithms">algorithms&lt;/h1>
&lt;p>Safehouse to keep all the algorithms that I learn or come across.&lt;/p>
&lt;h2 id="project-epigram">project epigram&lt;/h2>
&lt;ul>
&lt;li>&lt;input checked="" disabled="" type="checkbox"> 11/22 &lt;a href="https://leetcode.com/problems/regular-expression-matching/">Regex matching&lt;/a>
 #dynamic_programming&lt;/li>
&lt;li>&lt;input checked="" disabled="" type="checkbox"> 11/23 &lt;a href="https://leetcode.com/problems/longest-valid-parentheses/">Longest Valid Parentheses&lt;/a>
 #dynamic_programming&lt;/li>
&lt;li>&lt;input checked="" disabled="" type="checkbox"> 11/24 &lt;a href="https://leetcode.com/problems/trapping-rain-water/">Trap Rain Water&lt;/a>
 #dynamic_programming&lt;/li>
&lt;li>&lt;input checked="" disabled="" type="checkbox"> 11/25 &lt;a href="https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/">Minimum in Rotated Sorted Array II&lt;/a>
 #binary_search&lt;/li>
&lt;li>&lt;input disabled="" type="checkbox"> 11/26 &lt;a href="https://leetcode.com/problems/count-of-smaller-numbers-after-self/">Count of Smaller Numbers After Self&lt;/a>
 #binary_search&lt;/li>
&lt;li>&lt;input disabled="" type="checkbox"> 11/27 &lt;a href="https://leetcode.com/problems/count-of-range-sum/">Count of Range Sum&lt;/a>
 #binary_search&lt;/li>
&lt;li>&lt;input disabled="" type="checkbox"> 11/28 &lt;a href="https://leetcode.com/problems/minimum-edge-reversals-so-every-node-is-reachable/">Minimum Edge Reversals So Every Node is reachable&lt;/a>
 #depth_first_search&lt;/li>
&lt;li>&lt;input disabled="" type="checkbox"> 11/29 &lt;a href="https://leetcode.com/problems/minimum-reverse-operations">Minimum Reverse Operations&lt;/a>
 #depth_first_search&lt;/li>
&lt;li>&lt;input disabled="" type="checkbox"> 11/30 &lt;a href="https://leetcode.com/problems/height-of-binary-tree-after-subtree-removal-queries">Height of binary tree after subtree removal queries&lt;/a>
 #depth_first_search&lt;/li>
&lt;li>&lt;input disabled="" type="checkbox"> 11/31 &lt;a href="https://leetcode.com/problems/frog-position-after-t-seconds">Frog after T seconds&lt;/a>
 #breadth_first_search&lt;/li>
&lt;li>&lt;input disabled="" type="checkbox"> 11/32 &lt;a href="https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups/">Divide nodes into the maximum number of groups&lt;/a>
 #breadth_first_search&lt;/li>
&lt;/ul></description></item></channel></rss>