<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Algoritmos on Scholion</title><link>https://scholion.thluiz.com/tags/algoritmos/</link><description>Recent content in Algoritmos on Scholion</description><generator>Hugo -- gohugo.io</generator><language>pt-BR</language><copyright>© 2026</copyright><lastBuildDate>Sun, 27 Apr 2025 21:19:22 +0000</lastBuildDate><atom:link href="https://scholion.thluiz.com/tags/algoritmos/index.xml" rel="self" type="application/rss+xml"/><item><title>Two types of coding challenges I deeply recommend understanding and being able to do (for anyone wanting to be a better programmer / software engineer): backtracking (e.g. combination sum) and dynamic programming (knapsack problem). Both concepts take effort to "get" at first!</title><link>https://scholion.thluiz.com/notes/gergely-orosz-backtracking-dynamic-programming/</link><pubDate>Sun, 27 Apr 2025 21:19:22 +0000</pubDate><guid>https://scholion.thluiz.com/notes/gergely-orosz-backtracking-dynamic-programming/</guid><description>Post de Gergely Orosz no Bluesky, 27 de abril de 2025, recomendando dominar dois tipos de desafio de programação, backtracking e programação dinâmica.</description></item></channel></rss>