<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[Blog – Paul Coroneos]]></title><description><![CDATA[Personal blog and portfolio for Paul Coroneos.]]></description><link>https://pcoroneos.com</link><generator>RSS for Node</generator><lastBuildDate>Fri, 13 Mar 2026 17:48:06 GMT</lastBuildDate><atom:link href="https://pcoroneos.com/rss.xml" rel="self" type="application/rss+xml"/><copyright><![CDATA[©2026 Paul Coroneos]]></copyright><language><![CDATA[en]]></language><item><title><![CDATA[Solving Leetcode 8 - String to Integer (atoi) (JavaScript)]]></title><description><![CDATA[My solution and explanation of leetcode number 8 - String to Integer (atoi()) using JavaScript.]]></description><link>https://pcoroneos.com/blog/atoi</link><guid isPermaLink="false">./blog/atoi</guid><category><![CDATA[leetcode]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Wed, 29 Jul 2020 00:00:00 GMT</pubDate></item><item><title><![CDATA[Cracking the Code Interview - Is Unique]]></title><description><![CDATA[A nice warmup to understanding algorithms in JavaScript by solving Cracking the Code Interview's question 1.1 isUnique.]]></description><link>https://pcoroneos.com/blog/cracking-the-code-interview/1-1-is-unique</link><guid isPermaLink="false">./blog/cracking-the-code-interview/1-1-is-unique</guid><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Fri, 24 Jan 2020 00:00:00 GMT</pubDate></item><item><title><![CDATA[Cracking the Code Interview 1-2 Check Permutations (JavaScript)]]></title><description><![CDATA[My solution and explanation of Cracking the Code Interview 1-2 - Check Permutations. (JavaScript)]]></description><link>https://pcoroneos.com/blog/cracking-the-code-interview/1-2-check-permutations</link><guid isPermaLink="false">./blog/cracking-the-code-interview/1-2-check-permutations</guid><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Wed, 05 Aug 2020 00:00:00 GMT</pubDate></item><item><title><![CDATA[Cracking the Code Interview 1-3 Urlify (JavaScript)]]></title><description><![CDATA[My solution and explanation of Cracking the Code Interview 1-3 - Urlify. (JavaScript)]]></description><link>https://pcoroneos.com/blog/cracking-the-code-interview/1-3-urlify</link><guid isPermaLink="false">./blog/cracking-the-code-interview/1-3-urlify</guid><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Thu, 06 Aug 2020 00:00:00 GMT</pubDate></item><item><title><![CDATA[Cracking the Code Interview 1-8 Zero Matrix (JavaScript)]]></title><description><![CDATA[My solution and explanation of Cracking the Code Interview 1-8 - Zero Matrix. (JavaScript)]]></description><link>https://pcoroneos.com/blog/cracking-the-code-interview/1-8-zero-matrix</link><guid isPermaLink="false">./blog/cracking-the-code-interview/1-8-zero-matrix</guid><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Thu, 13 Aug 2020 00:00:00 GMT</pubDate></item><item><title><![CDATA[Cracking the Code Interview 1-9 String Rotation (JavaScript)]]></title><description><![CDATA[My solution and explanation of Cracking the Code Interview 1-9 String Rotation. (JavaScript)]]></description><link>https://pcoroneos.com/blog/cracking-the-code-interview/1-9-string-rotation</link><guid isPermaLink="false">./blog/cracking-the-code-interview/1-9-string-rotation</guid><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Wed, 12 Aug 2020 00:00:00 GMT</pubDate></item><item><title><![CDATA[Free Code Camp (FCC) - No Repeats Please (Heap's algorithm)]]></title><description><![CDATA[A solution to Free Code Camp's (FCC) No Repeats Please through the use of Heap's algorithm to calculate all combinations of a list.]]></description><link>https://pcoroneos.com/blog/free-code-camp/no-repeats-please</link><guid isPermaLink="false">./blog/free-code-camp/no-repeats-please</guid><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Thu, 01 Oct 2020 00:00:00 GMT</pubDate></item><item><title><![CDATA[Free Code Camp (FCC) - Pairwise]]></title><description><![CDATA[Solving Free Code Camp's pairwise algorithm.]]></description><link>https://pcoroneos.com/blog/free-code-camp/pairwise</link><guid isPermaLink="false">./blog/free-code-camp/pairwise</guid><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Fri, 02 Oct 2020 00:00:00 GMT</pubDate></item><item><title><![CDATA[Free Code Camp (FCC) - Symmetric Difference]]></title><description><![CDATA[Solving Free Code Camp's symmetric difference algorithm.]]></description><link>https://pcoroneos.com/blog/free-code-camp/symmetric-difference</link><guid isPermaLink="false">./blog/free-code-camp/symmetric-difference</guid><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Sat, 03 Oct 2020 00:00:00 GMT</pubDate></item><item><title><![CDATA[Hello World!]]></title><description><![CDATA[My hello world post for my blog.]]></description><link>https://pcoroneos.com/blog/hello-world</link><guid isPermaLink="false">./blog/hello-world</guid><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Mon, 19 Aug 2019 00:00:00 GMT</pubDate></item><item><title><![CDATA[Using Jest toHaveBeenCalledWith() with expect.anything() to test a subset of parameters]]></title><description><![CDATA[Using Jest toHaveBeenCalledWith() with expect.anything() to test a subset of parameters]]></description><link>https://pcoroneos.com/blog/jest/tohavebeencalledwith-partial-expect-anything</link><guid isPermaLink="false">./blog/jest/tohavebeencalledwith-partial-expect-anything</guid><category><![CDATA[jest]]></category><category><![CDATA[testing]]></category><category><![CDATA[javascript]]></category><category><![CDATA[testing-library]]></category><category><![CDATA[react]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Thu, 15 Jun 2023 00:00:00 GMT</pubDate></item><item><title><![CDATA[Solving Leetcode 1 - Two Sum (JavaScript)]]></title><description><![CDATA[My solution and explanation of leetcode number 1 - Two Sum using JavaScript.]]></description><link>https://pcoroneos.com/blog/leetcode/1-two-sum</link><guid isPermaLink="false">./blog/leetcode/1-two-sum</guid><category><![CDATA[leetcode]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Tue, 28 Jul 2020 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 1004. Max Consecutive Ones III (Typescript)]]></title><description><![CDATA[Solution to Leetcode 1004 - Maximum Consecutive Ones III (Typescript)]]></description><link>https://pcoroneos.com/blog/leetcode/1004-max-consecutive-ones-iii</link><guid isPermaLink="false">./blog/leetcode/1004-max-consecutive-ones-iii</guid><category><![CDATA[leetcode]]></category><category><![CDATA[algorithms]]></category><category><![CDATA[typescript]]></category><category><![CDATA[sliding window]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Tue, 06 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 103. Binary Tree Zigzag Level Order Traversal (JavaScript)]]></title><description><![CDATA[Solution to Leetcode 103 - Binary Tree Zigzag Level Order Traversal  (JavaScript)]]></description><link>https://pcoroneos.com/blog/leetcode/103-binary-tree-zigzag-level-order-traversal</link><guid isPermaLink="false">./blog/leetcode/103-binary-tree-zigzag-level-order-traversal</guid><category><![CDATA[leetcode]]></category><category><![CDATA[bst]]></category><category><![CDATA[bfs]]></category><category><![CDATA[medium]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Tue, 06 Jun 2023 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 111. Minimum Depth of Binary Tree]]></title><description><![CDATA[Solution to Minimum Depth of Binary Tree]]></description><link>https://pcoroneos.com/blog/leetcode/111-minimum-depth-of-binary-tree</link><guid isPermaLink="false">./blog/leetcode/111-minimum-depth-of-binary-tree</guid><category><![CDATA[leetcode]]></category><category><![CDATA[trees]]></category><category><![CDATA[depth-first-search]]></category><category><![CDATA[javascript]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Sat, 03 Jun 2023 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 1133 - Largest Unique Number (Typescript)]]></title><description><![CDATA[Leetcode 1133 - Solution to Largest Unique Number using Typescript.]]></description><link>https://pcoroneos.com/blog/leetcode/1133-largest-unique-number</link><guid isPermaLink="false">./blog/leetcode/1133-largest-unique-number</guid><category><![CDATA[leetcode]]></category><category><![CDATA[hash table]]></category><category><![CDATA[typescript]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Thu, 15 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 1189 - Maximum Number of Balloons (Typescript)]]></title><description><![CDATA[Leetcode 1189 - Solution to Maximum Number of Balloons using Typescript.]]></description><link>https://pcoroneos.com/blog/leetcode/1189-maximum-number-of-balloons</link><guid isPermaLink="false">./blog/leetcode/1189-maximum-number-of-balloons</guid><category><![CDATA[leetcode]]></category><category><![CDATA[hash table]]></category><category><![CDATA[typescript]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Thu, 15 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 121. Best Time to Buy and Sell Stock (JavaScript)]]></title><description><![CDATA[Solution to Leetcode 121 - Best Time to Buy and Sell Stock  (JavaScript)]]></description><link>https://pcoroneos.com/blog/leetcode/121-best-time-to-buy-and-sell-stock</link><guid isPermaLink="false">./blog/leetcode/121-best-time-to-buy-and-sell-stock</guid><category><![CDATA[leetcode]]></category><category><![CDATA[array]]></category><category><![CDATA[dynamic-programming]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Mon, 26 Jul 2021 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 125 - Valid Palindrome (JavaScript)]]></title><description><![CDATA[My solution and explanation of Leetcode number 125 - Valid Palindrome.]]></description><link>https://pcoroneos.com/blog/leetcode/125-valid-palindrome</link><guid isPermaLink="false">./blog/leetcode/125-valid-palindrome</guid><category><![CDATA[leetcode]]></category><category><![CDATA[palindrome]]></category><category><![CDATA[two-pointer]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Sat, 16 Nov 2024 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 1295. Find Numbers with Even Number of Digits (JavaScript)]]></title><description><![CDATA[Solution to Leetcode 1295 - Find Numbers with Even Number of Digits  (JavaScript)]]></description><link>https://pcoroneos.com/blog/leetcode/1295-find-numbers-with-even-number-of-digits</link><guid isPermaLink="false">./blog/leetcode/1295-find-numbers-with-even-number-of-digits</guid><category><![CDATA[leetcode]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Sat, 20 Mar 2021 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 141 - Linked List Cycle]]></title><description><![CDATA[Leetcode 141 -  Linked list cycle anaylsis and solution.]]></description><link>https://pcoroneos.com/blog/leetcode/141-linked-list-cycle</link><guid isPermaLink="false">./blog/leetcode/141-linked-list-cycle</guid><category><![CDATA[leetcode]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Sun, 28 Mar 2021 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 1413. Minimum Value to Get Positive Step by Step Sum (Typescript)]]></title><description><![CDATA[Solution to Leetcode 1413 - Minimum Value to Get Positive Step by Step Sum (Typescript)]]></description><link>https://pcoroneos.com/blog/leetcode/1413-minimum-value-to-get-positive-step-by-step-sum</link><guid isPermaLink="false">./blog/leetcode/1413-minimum-value-to-get-positive-step-by-step-sum</guid><category><![CDATA[leetcode]]></category><category><![CDATA[algorithms]]></category><category><![CDATA[typescript]]></category><category><![CDATA[prefix sum]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Wed, 07 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 1426. Counting Elements (Typescript)]]></title><description><![CDATA[Solution to Leetcode 1426 - Counting Elements (Typescript)]]></description><link>https://pcoroneos.com/blog/leetcode/1426-counting-elements</link><guid isPermaLink="false">./blog/leetcode/1426-counting-elements</guid><category><![CDATA[leetcode]]></category><category><![CDATA[algorithms]]></category><category><![CDATA[typescript]]></category><category><![CDATA[hash table]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Mon, 12 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 1480. Running Sum of 1d Array (Typescript)]]></title><description><![CDATA[Solution to Leetcode 1480 - Running Sum of 1d Array (Typescript)]]></description><link>https://pcoroneos.com/blog/leetcode/1480-running-sum-of-1d-array</link><guid isPermaLink="false">./blog/leetcode/1480-running-sum-of-1d-array</guid><category><![CDATA[leetcode]]></category><category><![CDATA[algorithms]]></category><category><![CDATA[typescript]]></category><category><![CDATA[prefix sum]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Wed, 07 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 1832. Check if the Sentence Is Pangram (Typescript)]]></title><description><![CDATA[Solution to Leetcode 1832 - Check if the Sentence Is Pangram (Typescript)]]></description><link>https://pcoroneos.com/blog/leetcode/1832-check-if-the-sentence-is-pangram</link><guid isPermaLink="false">./blog/leetcode/1832-check-if-the-sentence-is-pangram</guid><category><![CDATA[leetcode]]></category><category><![CDATA[algorithms]]></category><category><![CDATA[typescript]]></category><category><![CDATA[hash table]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Sat, 10 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 20. Valid Parentheses (JavaScript)]]></title><description><![CDATA[Solution to Leetcode 27 - Remove Element  (JavaScript)]]></description><link>https://pcoroneos.com/blog/leetcode/20-valid-parentheses</link><guid isPermaLink="false">./blog/leetcode/20-valid-parentheses</guid><category><![CDATA[leetcode]]></category><category><![CDATA[array]]></category><category><![CDATA[stack]]></category><category><![CDATA[easy]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Tue, 29 Oct 2024 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 203 - Remove Linked List Elements]]></title><description><![CDATA[Leetcode 203 -  Remove Linked List Elements analysis and solution.]]></description><link>https://pcoroneos.com/blog/leetcode/203-remove-linked-list-element</link><guid isPermaLink="false">./blog/leetcode/203-remove-linked-list-element</guid><category><![CDATA[leetcode]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Wed, 31 Mar 2021 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 206 - Reverse Linked List]]></title><description><![CDATA[Leetcode 206 -  Reverse Linked List anaylsis and solution.]]></description><link>https://pcoroneos.com/blog/leetcode/206-reverse-link-list</link><guid isPermaLink="false">./blog/leetcode/206-reverse-link-list</guid><category><![CDATA[leetcode]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Mon, 29 Mar 2021 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 2090. K Radius Subarray Averages (Typescript)]]></title><description><![CDATA[Solution to Leetcode 2090 - K Radius Subarray Averages (Typescript)]]></description><link>https://pcoroneos.com/blog/leetcode/2090-k-radius-subarray-averages</link><guid isPermaLink="false">./blog/leetcode/2090-k-radius-subarray-averages</guid><category><![CDATA[leetcode]]></category><category><![CDATA[algorithms]]></category><category><![CDATA[typescript]]></category><category><![CDATA[prefix sum]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Fri, 09 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 2225. Find Players With Zero or One Losses (Typescript)]]></title><description><![CDATA[Solution to Leetcode 2225 - Find Players With Zero or One Losses (Typescript)]]></description><link>https://pcoroneos.com/blog/leetcode/2225-find-players-with-zero-or-one-losses</link><guid isPermaLink="false">./blog/leetcode/2225-find-players-with-zero-or-one-losses</guid><category><![CDATA[leetcode]]></category><category><![CDATA[algorithms]]></category><category><![CDATA[typescript]]></category><category><![CDATA[hash table]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Tue, 13 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 242 - Valid Anagram (JavaScript)]]></title><description><![CDATA[My solution and explanation of Leetcode number 242 - Valid Anagram.]]></description><link>https://pcoroneos.com/blog/leetcode/242-valid-anagram</link><guid isPermaLink="false">./blog/leetcode/242-valid-anagram</guid><category><![CDATA[leetcode]]></category><category><![CDATA[anagram]]></category><category><![CDATA[hashmap]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Sun, 17 Nov 2024 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 268 - Missing Number (Typescript)]]></title><description><![CDATA[Solving Leetcode 268 - Missing Number (Typescript)]]></description><link>https://pcoroneos.com/blog/leetcode/268-missing-number</link><guid isPermaLink="false">./blog/leetcode/268-missing-number</guid><category><![CDATA[leetcode]]></category><category><![CDATA[algorithms]]></category><category><![CDATA[typescript]]></category><category><![CDATA[hash table]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Sun, 11 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 27. Remove Element (JavaScript)]]></title><description><![CDATA[Solution to Leetcode 27 - Remove Element  (JavaScript)]]></description><link>https://pcoroneos.com/blog/leetcode/27-remove-element</link><guid isPermaLink="false">./blog/leetcode/27-remove-element</guid><category><![CDATA[leetcode]]></category><category><![CDATA[array]]></category><category><![CDATA[two-pointer]]></category><category><![CDATA[easy]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Tue, 27 Jul 2021 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 3 - Longest Substring Without Repeating Characters (Typescript)]]></title><description><![CDATA[Solution to Leetcode 3 - Longest Substring Without Repeating Characters (Typescript)]]></description><link>https://pcoroneos.com/blog/leetcode/3-longest-substring-without-repeating-characters</link><guid isPermaLink="false">./blog/leetcode/3-longest-substring-without-repeating-characters</guid><category><![CDATA[leetcode]]></category><category><![CDATA[algorithms]]></category><category><![CDATA[typescript]]></category><category><![CDATA[hash table]]></category><category><![CDATA[two pointer]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Mon, 19 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 344 - Reverse String]]></title><description><![CDATA[Leetcode 344 - Reverse string using Typescript.]]></description><link>https://pcoroneos.com/blog/leetcode/344-reverse-string</link><guid isPermaLink="false">./blog/leetcode/344-reverse-string</guid><category><![CDATA[leetcode]]></category><category><![CDATA[two pointer]]></category><category><![CDATA[string]]></category><category><![CDATA[typescript]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Sat, 03 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 383 - Ransom Note (Typescript)]]></title><description><![CDATA[Solution to Leetcode 383 - RansomNote (Typescript)]]></description><link>https://pcoroneos.com/blog/leetcode/383-ransom-note</link><guid isPermaLink="false">./blog/leetcode/383-ransom-note</guid><category><![CDATA[leetcode]]></category><category><![CDATA[algorithms]]></category><category><![CDATA[typescript]]></category><category><![CDATA[hash table]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Sun, 18 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 485. Max Consecutive Ones (JavaScript)]]></title><description><![CDATA[Solution to Leetcode 485 - Max Consecutive Ones (JavaScript)]]></description><link>https://pcoroneos.com/blog/leetcode/485-max-consecutive-ones</link><guid isPermaLink="false">./blog/leetcode/485-max-consecutive-ones</guid><category><![CDATA[leetcode]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Fri, 19 Mar 2021 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 525. Contiguous Array (Typescript)]]></title><description><![CDATA[Solution to Leetcode 525 - Contiguous Array (Typescript)]]></description><link>https://pcoroneos.com/blog/leetcode/525-contiguous-array</link><guid isPermaLink="false">./blog/leetcode/525-contiguous-array</guid><category><![CDATA[leetcode]]></category><category><![CDATA[algorithms]]></category><category><![CDATA[typescript]]></category><category><![CDATA[hash table]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Sat, 17 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 643. Maximum Average Subarray I (Typescript)]]></title><description><![CDATA[Solution to Leetcode 643 - Maximum Average Subarray I (Typescript)]]></description><link>https://pcoroneos.com/blog/leetcode/643-maximum-average-subarray-i</link><guid isPermaLink="false">./blog/leetcode/643-maximum-average-subarray-i</guid><category><![CDATA[leetcode]]></category><category><![CDATA[algorithms]]></category><category><![CDATA[typescript]]></category><category><![CDATA[sliding window]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Mon, 05 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Solving Leetcode 70 - Climbing Stairs (JavaScript) (Fibonacci sequence)]]></title><description><![CDATA[My solution and explanation of leetcode number 70 - Climbing stairs using JavaScript and Fibonacci sequence.]]></description><link>https://pcoroneos.com/blog/leetcode/70-climbing-stairs</link><guid isPermaLink="false">./blog/leetcode/70-climbing-stairs</guid><category><![CDATA[leetcode]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Thu, 30 Jul 2020 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 701. Insert into a binary search tree]]></title><description><![CDATA[Solution to Leetcode 701 insert into a binary search tree]]></description><link>https://pcoroneos.com/blog/leetcode/701-insert-into-a-binary-tree</link><guid isPermaLink="false">./blog/leetcode/701-insert-into-a-binary-tree</guid><category><![CDATA[leetcode]]></category><category><![CDATA[trees]]></category><category><![CDATA[depth-first-search]]></category><category><![CDATA[javascript]]></category><category><![CDATA[binary-search-tree]]></category><category><![CDATA[recursion]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Tue, 06 Jun 2023 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 71 - Simplify Path (Typescript)]]></title><description><![CDATA[Leetcode 71 - Simplify Path using Typescript.]]></description><link>https://pcoroneos.com/blog/leetcode/71-simplify-path</link><guid isPermaLink="false">./blog/leetcode/71-simplify-path</guid><category><![CDATA[leetcode]]></category><category><![CDATA[linked list]]></category><category><![CDATA[typescript]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Mon, 26 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 771. Jewels and Stones (Typescript)]]></title><description><![CDATA[Solution to Leetcode 771 - Jewels and Stones (Typescript)]]></description><link>https://pcoroneos.com/blog/leetcode/771-jewels-and-stones</link><guid isPermaLink="false">./blog/leetcode/771-jewels-and-stones</guid><category><![CDATA[leetcode]]></category><category><![CDATA[array]]></category><category><![CDATA[hashtable]]></category><category><![CDATA[easy]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Mon, 19 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 83. Remove Duplicates From Sorted List (Typescript)]]></title><description><![CDATA[Solution to Leetcode 83 - Remove Duplicates From Sorted List (Typescript)]]></description><link>https://pcoroneos.com/blog/leetcode/83-remove-duplicates-from-sorted-list</link><guid isPermaLink="false">./blog/leetcode/83-remove-duplicates-from-sorted-list</guid><category><![CDATA[leetcode]]></category><category><![CDATA[algorithms]]></category><category><![CDATA[typescript]]></category><category><![CDATA[linked list]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Wed, 21 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 876 - Middle of the Linked List (Typescript)]]></title><description><![CDATA[Solution to Leetcode 876 - Middle of the Linked List (Typescript)]]></description><link>https://pcoroneos.com/blog/leetcode/876-middle-of-the-linked-list</link><guid isPermaLink="false">./blog/leetcode/876-middle-of-the-linked-list</guid><category><![CDATA[leetcode]]></category><category><![CDATA[algorithms]]></category><category><![CDATA[typescript]]></category><category><![CDATA[linked list]]></category><category><![CDATA[two pointers]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Tue, 20 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 88. Merge Sorted Array (JavaScript)]]></title><description><![CDATA[Solution to Leetcode 88 - Merge Sorted Array  (JavaScript)]]></description><link>https://pcoroneos.com/blog/leetcode/88-merge-sorted-array</link><guid isPermaLink="false">./blog/leetcode/88-merge-sorted-array</guid><category><![CDATA[leetcode]]></category><category><![CDATA[array]]></category><category><![CDATA[two-pointer]]></category><category><![CDATA[easy]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Wed, 28 Jul 2021 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 92 - Reverse Linked List II (Typescript)]]></title><description><![CDATA[Leetcode 92 - Reverse Linked List II using Typescript.]]></description><link>https://pcoroneos.com/blog/leetcode/92-reverse-linked-list-ii</link><guid isPermaLink="false">./blog/leetcode/92-reverse-linked-list-ii</guid><category><![CDATA[leetcode]]></category><category><![CDATA[linked list]]></category><category><![CDATA[typescript]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Mon, 26 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Leetcode 977 - Squared of a Sorted Array]]></title><description><![CDATA[Leetcode 977 - Squares of a sorted array using Typescript.]]></description><link>https://pcoroneos.com/blog/leetcode/977-squares-of-sorted-array</link><guid isPermaLink="false">./blog/leetcode/977-squares-of-sorted-array</guid><category><![CDATA[leetcode]]></category><category><![CDATA[two pointer]]></category><category><![CDATA[array]]></category><category><![CDATA[typescript]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Sat, 03 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[Migrating to AstroJS from NextJS]]></title><description><![CDATA[Migrating my personal blog from AstroJS from NextJS]]></description><link>https://pcoroneos.com/blog/migrating-to-astro</link><guid isPermaLink="false">./blog/migrating-to-astro</guid><category><![CDATA[astrojs]]></category><category><![CDATA[nextjs]]></category><category><![CDATA[copilot]]></category><category><![CDATA[llm]]></category><category><![CDATA[ai]]></category><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Sun, 25 May 2025 00:00:00 GMT</pubDate></item><item><title><![CDATA[The Next Best Time]]></title><description><![CDATA[My hello world post for my blog.]]></description><link>https://pcoroneos.com/blog/next-best-time</link><guid isPermaLink="false">./blog/next-best-time</guid><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Wed, 22 Jan 2020 00:00:00 GMT</pubDate></item><item><title><![CDATA[Big trouble with parseInt()]]></title><description><![CDATA[My hello world post for my blog.]]></description><link>https://pcoroneos.com/blog/parse-int</link><guid isPermaLink="false">./blog/parse-int</guid><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Thu, 28 Nov 2019 00:00:00 GMT</pubDate></item><item><title><![CDATA[Role Tab]]></title><description><![CDATA[My hello world post for my blog.]]></description><link>https://pcoroneos.com/blog/role-tab</link><guid isPermaLink="false">./blog/role-tab</guid><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Fri, 06 Dec 2019 00:00:00 GMT</pubDate></item><item><title><![CDATA[Stack]]></title><description><![CDATA[An introduction to the stack data structure.]]></description><link>https://pcoroneos.com/blog/stack</link><guid isPermaLink="false">./blog/stack</guid><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Wed, 15 Jan 2020 00:00:00 GMT</pubDate></item><item><title><![CDATA[Updating Bootcamp project for npm security updates]]></title><description><![CDATA[How I have handled updating bootcamp projects over time.]]></description><link>https://pcoroneos.com/blog/updating-bootcamp</link><guid isPermaLink="false">./blog/updating-bootcamp</guid><dc:creator><![CDATA[Paul Coroneos]]></dc:creator><pubDate>Tue, 14 Jan 2020 00:00:00 GMT</pubDate></item></channel></rss>