<?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 Scholion</title><link>https://scholion.thluiz.com/tags/algorithms/</link><description>Recent content in Algorithms on Scholion</description><generator>Hugo -- gohugo.io</generator><language>pt-BR</language><copyright>© 2026</copyright><lastBuildDate>Wed, 23 Sep 2026 20:10:34 +0100</lastBuildDate><atom:link href="https://scholion.thluiz.com/tags/algorithms/index.xml" rel="self" type="application/rss+xml"/><item><title>O(n) Solution to the Multiply Others Problem in F#</title><link>https://scholion.thluiz.com/notes/o-n-solution-multiply-others-problem-fsharp/</link><pubDate>Wed, 23 Sep 2026 17:11:13 +0100</pubDate><guid>https://scholion.thluiz.com/notes/o-n-solution-multiply-others-problem-fsharp/</guid><description>Yan Cui walks through a division-free, O(n) F# solution to the classic interview question of multiplying every array element except itself.</description></item><item><title>Functionally Solving Problems</title><link>https://scholion.thluiz.com/notes/functionally-solving-problems/</link><pubDate>Wed, 23 Sep 2026 16:53:13 +0100</pubDate><guid>https://scholion.thluiz.com/notes/functionally-solving-problems/</guid><description>A Learn You Some Erlang chapter that solves an RPN calculator and a shortest-path puzzle with folds and pattern matching instead of hand-rolled recursion.</description></item></channel></rss>