https://bacarotech.github.io/tags/python/Recent content in Python onHugoitWed, 25 Feb 2026 14:00:41 +0000https://bacarotech.github.io/blog/2026/codingleetcode---2399---check-distances-between-same-letters/Wed, 25 Feb 2026 14:00:41 +0000https://bacarotech.github.io/blog/2026/codingleetcode---2399---check-distances-between-same-letters/<p>Oggi vediamo il seguente esercizio di LeetCode:</p> <blockquote> <p>You are given a string s consisting of lowercase English letters and an integer array distance of length 26. For every letter from &lsquo;a&rsquo; to &lsquo;z&rsquo;, if it appears twice in s, the distance between its two occurrences must be equal to distance[i]. Return true if all distances match, otherwise return false.</p> </blockquote> <p>Possiamo risolvere questo problema calcolando la distanza tra le due occorrenze di ogni carattere, come nei due codici proposti.</p>https://bacarotech.github.io/blog/2026/codingleetcode---121---best-time-to-buy-and-sell-stock/Wed, 25 Feb 2026 14:00:23 +0000https://bacarotech.github.io/blog/2026/codingleetcode---121---best-time-to-buy-and-sell-stock/<p>Oggi vediamo il seguente esercizio di LeetCode:</p> <blockquote> <p>You are given an array prices where prices[i] is the price of a given stock on the i-th day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.</p>