<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Javascript on</title><link>https://bacarotech.github.io/tags/javascript/</link><description>Recent content in Javascript on</description><generator>Hugo</generator><language>it</language><lastBuildDate>Wed, 25 Feb 2026 14:00:23 +0000</lastBuildDate><atom:link href="https://bacarotech.github.io/tags/javascript/index.xml" rel="self" type="application/rss+xml"/><item><title>CodingLeetCode - 121 - Best Time to Buy and Sell Stock</title><link>https://bacarotech.github.io/blog/2026/codingleetcode---121---best-time-to-buy-and-sell-stock/</link><pubDate>Wed, 25 Feb 2026 14:00:23 +0000</pubDate><guid>https://bacarotech.github.io/blog/2026/codingleetcode---121---best-time-to-buy-and-sell-stock/</guid><description>&lt;p&gt;Oggi vediamo il seguente esercizio di LeetCode:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;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.&lt;/p&gt;</description></item></channel></rss>