<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Java on Jim Diroff II</title><link>https://www.jimdiroffii.com/tags/java/</link><description>Recent content in Java on Jim Diroff II</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Wed, 11 Feb 2026 00:00:01 -0500</lastBuildDate><atom:link href="https://www.jimdiroffii.com/tags/java/index.xml" rel="self" type="application/rss+xml"/><item><title>365 Days of Code - Day 022</title><link>https://www.jimdiroffii.com/posts/2026/02/365-days-of-code-day-022-2026/</link><pubDate>Wed, 11 Feb 2026 00:00:01 -0500</pubDate><guid>https://www.jimdiroffii.com/posts/2026/02/365-days-of-code-day-022-2026/</guid><description>&lt;p&gt;I finished up 
&lt;a href="https://projecteuler.net/problem=20"target="_blank" rel="nofollow noopener noreferrer"&gt;Problem 20&lt;span class="sr-only"&gt; (opens in a new tab)&lt;/span&gt;&lt;/a&gt; this morning. I went well beyond what was needed to find the solution, but this is all just practice. I tried to be as defensive as possible, validate everything, and provide options for alternative numbers. The program can run for factorial values well beyond 100!. Although, the program gets quite slow once you are into the really large factorials.&lt;/p&gt;</description></item></channel></rss>