<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Gergely-Orosz on Scholion</title><link>https://scholion.thluiz.com/tags/gergely-orosz/</link><description>Recent content in Gergely-Orosz on Scholion</description><generator>Hugo -- gohugo.io</generator><language>pt-BR</language><copyright>© 2026</copyright><lastBuildDate>Wed, 18 Nov 2026 14:21:02 +0000</lastBuildDate><atom:link href="https://scholion.thluiz.com/tags/gergely-orosz/index.xml" rel="self" type="application/rss+xml"/><item><title>So so many gems in this book</title><link>https://scholion.thluiz.com/notes/so-so-many-gems-in-this-book-gergely-orosz/</link><pubDate>Thu, 08 May 2025 10:08:17 +0000</pubDate><guid>https://scholion.thluiz.com/notes/so-so-many-gems-in-this-book-gergely-orosz/</guid><description>Gergely Orosz&amp;rsquo;s Bluesky post with four photographed pages of a programming book: the Coding Horror icon, defensive programming, a sunken floating bridge, and variable live time.</description></item><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>