<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>Forem: DPC </title>
    <description>The latest articles on Forem by DPC  (@dpc).</description>
    <link>https://forem.com/dpc</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F2488802%2F41f37128-98c4-4c18-a30a-daa00225f14c.png</url>
      <title>Forem: DPC </title>
      <link>https://forem.com/dpc</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://forem.com/feed/dpc"/>
    <language>en</language>
    <item>
      <title>Daily JavaScript Challenge #JS-273: Generate Spiral Order from Matrix</title>
      <dc:creator>DPC </dc:creator>
      <pubDate>Sun, 07 Sep 2025 00:00:54 +0000</pubDate>
      <link>https://forem.com/dpc/daily-javascript-challenge-js-273-generate-spiral-order-from-matrix-3cb8</link>
      <guid>https://forem.com/dpc/daily-javascript-challenge-js-273-generate-spiral-order-from-matrix-3cb8</guid>
      <description>&lt;h1&gt;
  
  
  Daily JavaScript Challenge: Generate Spiral Order from Matrix
&lt;/h1&gt;

&lt;p&gt;Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp! &lt;/p&gt;

&lt;h2&gt;
  
  
  The Challenge
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Difficulty&lt;/strong&gt;: Medium&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Topic&lt;/strong&gt;: Array Manipulation&lt;/p&gt;

&lt;h3&gt;
  
  
  Description
&lt;/h3&gt;

&lt;p&gt;Given an m x n matrix, return all elements of the matrix in spiral order.&lt;/p&gt;

&lt;h2&gt;
  
  
  Ready to Begin?
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://www.dpcdev.com/" rel="noopener noreferrer"&gt;https://www.dpcdev.com/&lt;/a&gt;&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Fork this challenge&lt;/li&gt;
&lt;li&gt;Write your solution&lt;/li&gt;
&lt;li&gt;Test it against the provided test cases&lt;/li&gt;
&lt;li&gt;Share your approach in the comments below!&lt;/li&gt;
&lt;/ol&gt;

&lt;h3&gt;
  
  
  Want to Learn More?
&lt;/h3&gt;

&lt;p&gt;Check out the documentation about this topic here: &lt;a href="https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array" rel="noopener noreferrer"&gt;https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Join the Discussion!
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;How did you approach this problem?&lt;/li&gt;
&lt;li&gt;Did you find any interesting edge cases?&lt;/li&gt;
&lt;li&gt;What was your biggest learning from this challenge?&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Let's learn together! Drop your thoughts and questions in the comments below. 👇&lt;/p&gt;




&lt;p&gt;&lt;em&gt;This is part of our Daily JavaScript Challenge series. Follow me for daily programming challenges and let's grow together! 🚀&lt;/em&gt;&lt;/p&gt;

&lt;h1&gt;
  
  
  javascript #programming #coding #dailycodingchallenge #webdev
&lt;/h1&gt;

</description>
      <category>javascript</category>
      <category>devchallenge</category>
      <category>programming</category>
      <category>webdev</category>
    </item>
    <item>
      <title>Daily JavaScript Challenge #JS-272: Convert Roman Numerals to Integers</title>
      <dc:creator>DPC </dc:creator>
      <pubDate>Sat, 06 Sep 2025 00:00:26 +0000</pubDate>
      <link>https://forem.com/dpc/daily-javascript-challenge-js-272-convert-roman-numerals-to-integers-2ba8</link>
      <guid>https://forem.com/dpc/daily-javascript-challenge-js-272-convert-roman-numerals-to-integers-2ba8</guid>
      <description>&lt;h1&gt;
  
  
  Daily JavaScript Challenge: Convert Roman Numerals to Integers
&lt;/h1&gt;

&lt;p&gt;Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp! &lt;/p&gt;

&lt;h2&gt;
  
  
  The Challenge
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Difficulty&lt;/strong&gt;: Medium&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Topic&lt;/strong&gt;: String Manipulation&lt;/p&gt;

&lt;h3&gt;
  
  
  Description
&lt;/h3&gt;

&lt;p&gt;Write a function that converts a Roman numeral string into its integer equivalent. The function should handle valid Roman numerals from 1 to 3999 inclusive. Roman numeral symbols include I, V, X, L, C, D, and M.&lt;/p&gt;

&lt;h2&gt;
  
  
  Ready to Begin?
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://www.dpcdev.com/" rel="noopener noreferrer"&gt;https://www.dpcdev.com/&lt;/a&gt;&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Fork this challenge&lt;/li&gt;
&lt;li&gt;Write your solution&lt;/li&gt;
&lt;li&gt;Test it against the provided test cases&lt;/li&gt;
&lt;li&gt;Share your approach in the comments below!&lt;/li&gt;
&lt;/ol&gt;

&lt;h3&gt;
  
  
  Want to Learn More?
&lt;/h3&gt;

&lt;p&gt;Check out the documentation about this topic here: &lt;a href="https://en.wikipedia.org/wiki/Roman_numerals" rel="noopener noreferrer"&gt;https://en.wikipedia.org/wiki/Roman_numerals&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Join the Discussion!
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;How did you approach this problem?&lt;/li&gt;
&lt;li&gt;Did you find any interesting edge cases?&lt;/li&gt;
&lt;li&gt;What was your biggest learning from this challenge?&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Let's learn together! Drop your thoughts and questions in the comments below. 👇&lt;/p&gt;




&lt;p&gt;&lt;em&gt;This is part of our Daily JavaScript Challenge series. Follow me for daily programming challenges and let's grow together! 🚀&lt;/em&gt;&lt;/p&gt;

&lt;h1&gt;
  
  
  javascript #programming #coding #dailycodingchallenge #webdev
&lt;/h1&gt;

</description>
      <category>javascript</category>
      <category>devchallenge</category>
      <category>programming</category>
      <category>webdev</category>
    </item>
    <item>
      <title>Daily JavaScript Challenge #JS-271: Calculate the Number of Unique Elements in an Array</title>
      <dc:creator>DPC </dc:creator>
      <pubDate>Fri, 05 Sep 2025 00:00:36 +0000</pubDate>
      <link>https://forem.com/dpc/daily-javascript-challenge-js-271-calculate-the-number-of-unique-elements-in-an-array-mlc</link>
      <guid>https://forem.com/dpc/daily-javascript-challenge-js-271-calculate-the-number-of-unique-elements-in-an-array-mlc</guid>
      <description>&lt;h1&gt;
  
  
  Daily JavaScript Challenge: Calculate the Number of Unique Elements in an Array
&lt;/h1&gt;

&lt;p&gt;Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp! &lt;/p&gt;

&lt;h2&gt;
  
  
  The Challenge
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Difficulty&lt;/strong&gt;: Easy&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Topic&lt;/strong&gt;: Arrays&lt;/p&gt;

&lt;h3&gt;
  
  
  Description
&lt;/h3&gt;

&lt;p&gt;Write a function that takes an array of integers and returns the count of unique elements in the array.&lt;/p&gt;

&lt;h2&gt;
  
  
  Ready to Begin?
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://www.dpcdev.com/" rel="noopener noreferrer"&gt;https://www.dpcdev.com/&lt;/a&gt;&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Fork this challenge&lt;/li&gt;
&lt;li&gt;Write your solution&lt;/li&gt;
&lt;li&gt;Test it against the provided test cases&lt;/li&gt;
&lt;li&gt;Share your approach in the comments below!&lt;/li&gt;
&lt;/ol&gt;

&lt;h3&gt;
  
  
  Want to Learn More?
&lt;/h3&gt;

&lt;p&gt;Check out the documentation about this topic here: &lt;a href="https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set" rel="noopener noreferrer"&gt;https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Join the Discussion!
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;How did you approach this problem?&lt;/li&gt;
&lt;li&gt;Did you find any interesting edge cases?&lt;/li&gt;
&lt;li&gt;What was your biggest learning from this challenge?&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Let's learn together! Drop your thoughts and questions in the comments below. 👇&lt;/p&gt;




&lt;p&gt;&lt;em&gt;This is part of our Daily JavaScript Challenge series. Follow me for daily programming challenges and let's grow together! 🚀&lt;/em&gt;&lt;/p&gt;

&lt;h1&gt;
  
  
  javascript #programming #coding #dailycodingchallenge #webdev
&lt;/h1&gt;

</description>
      <category>javascript</category>
      <category>devchallenge</category>
      <category>programming</category>
      <category>webdev</category>
    </item>
    <item>
      <title>Daily JavaScript Challenge #JS-270: Find the Smallest Missing Positive Integer</title>
      <dc:creator>DPC </dc:creator>
      <pubDate>Thu, 04 Sep 2025 00:00:54 +0000</pubDate>
      <link>https://forem.com/dpc/daily-javascript-challenge-js-270-find-the-smallest-missing-positive-integer-4ija</link>
      <guid>https://forem.com/dpc/daily-javascript-challenge-js-270-find-the-smallest-missing-positive-integer-4ija</guid>
      <description>&lt;h1&gt;
  
  
  Daily JavaScript Challenge: Find the Smallest Missing Positive Integer
&lt;/h1&gt;

&lt;p&gt;Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp! &lt;/p&gt;

&lt;h2&gt;
  
  
  The Challenge
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Difficulty&lt;/strong&gt;: Medium&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Topic&lt;/strong&gt;: Arrays&lt;/p&gt;

&lt;h3&gt;
  
  
  Description
&lt;/h3&gt;

&lt;p&gt;Write a function that takes an unsorted array of integers and finds the smallest missing positive integer.&lt;/p&gt;

&lt;h2&gt;
  
  
  Ready to Begin?
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://www.dpcdev.com/" rel="noopener noreferrer"&gt;https://www.dpcdev.com/&lt;/a&gt;&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Fork this challenge&lt;/li&gt;
&lt;li&gt;Write your solution&lt;/li&gt;
&lt;li&gt;Test it against the provided test cases&lt;/li&gt;
&lt;li&gt;Share your approach in the comments below!&lt;/li&gt;
&lt;/ol&gt;

&lt;h3&gt;
  
  
  Want to Learn More?
&lt;/h3&gt;

&lt;p&gt;Check out the documentation about this topic here: &lt;a href="https://leetcode.com/problems/first-missing-positive/" rel="noopener noreferrer"&gt;https://leetcode.com/problems/first-missing-positive/&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Join the Discussion!
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;How did you approach this problem?&lt;/li&gt;
&lt;li&gt;Did you find any interesting edge cases?&lt;/li&gt;
&lt;li&gt;What was your biggest learning from this challenge?&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Let's learn together! Drop your thoughts and questions in the comments below. 👇&lt;/p&gt;




&lt;p&gt;&lt;em&gt;This is part of our Daily JavaScript Challenge series. Follow me for daily programming challenges and let's grow together! 🚀&lt;/em&gt;&lt;/p&gt;

&lt;h1&gt;
  
  
  javascript #programming #coding #dailycodingchallenge #webdev
&lt;/h1&gt;

</description>
      <category>javascript</category>
      <category>devchallenge</category>
      <category>programming</category>
      <category>webdev</category>
    </item>
    <item>
      <title>Daily JavaScript Challenge #JS-269: Calculate Sum of Odd-indexed Elements</title>
      <dc:creator>DPC </dc:creator>
      <pubDate>Wed, 03 Sep 2025 00:00:56 +0000</pubDate>
      <link>https://forem.com/dpc/daily-javascript-challenge-js-269-calculate-sum-of-odd-indexed-elements-21li</link>
      <guid>https://forem.com/dpc/daily-javascript-challenge-js-269-calculate-sum-of-odd-indexed-elements-21li</guid>
      <description>&lt;h1&gt;
  
  
  Daily JavaScript Challenge: Calculate Sum of Odd-indexed Elements
&lt;/h1&gt;

&lt;p&gt;Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp! &lt;/p&gt;

&lt;h2&gt;
  
  
  The Challenge
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Difficulty&lt;/strong&gt;: Easy&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Topic&lt;/strong&gt;: Array Manipulation&lt;/p&gt;

&lt;h3&gt;
  
  
  Description
&lt;/h3&gt;

&lt;p&gt;Given an array of integers, write a function to calculate the sum of all elements that are placed at odd indices in the array.&lt;/p&gt;

&lt;h2&gt;
  
  
  Ready to Begin?
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://www.dpcdev.com/" rel="noopener noreferrer"&gt;https://www.dpcdev.com/&lt;/a&gt;&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Fork this challenge&lt;/li&gt;
&lt;li&gt;Write your solution&lt;/li&gt;
&lt;li&gt;Test it against the provided test cases&lt;/li&gt;
&lt;li&gt;Share your approach in the comments below!&lt;/li&gt;
&lt;/ol&gt;

&lt;h3&gt;
  
  
  Want to Learn More?
&lt;/h3&gt;

&lt;p&gt;Check out the documentation about this topic here: &lt;a href="https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array" rel="noopener noreferrer"&gt;https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Join the Discussion!
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;How did you approach this problem?&lt;/li&gt;
&lt;li&gt;Did you find any interesting edge cases?&lt;/li&gt;
&lt;li&gt;What was your biggest learning from this challenge?&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Let's learn together! Drop your thoughts and questions in the comments below. 👇&lt;/p&gt;




&lt;p&gt;&lt;em&gt;This is part of our Daily JavaScript Challenge series. Follow me for daily programming challenges and let's grow together! 🚀&lt;/em&gt;&lt;/p&gt;

&lt;h1&gt;
  
  
  javascript #programming #coding #dailycodingchallenge #webdev
&lt;/h1&gt;

</description>
      <category>javascript</category>
      <category>devchallenge</category>
      <category>programming</category>
      <category>webdev</category>
    </item>
    <item>
      <title>Daily JavaScript Challenge #JS-268: Longest Palindromic Substring</title>
      <dc:creator>DPC </dc:creator>
      <pubDate>Tue, 02 Sep 2025 00:00:33 +0000</pubDate>
      <link>https://forem.com/dpc/daily-javascript-challenge-js-268-longest-palindromic-substring-3m31</link>
      <guid>https://forem.com/dpc/daily-javascript-challenge-js-268-longest-palindromic-substring-3m31</guid>
      <description>&lt;h1&gt;
  
  
  Daily JavaScript Challenge: Longest Palindromic Substring
&lt;/h1&gt;

&lt;p&gt;Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp! &lt;/p&gt;

&lt;h2&gt;
  
  
  The Challenge
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Difficulty&lt;/strong&gt;: Medium&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Topic&lt;/strong&gt;: String Manipulation&lt;/p&gt;

&lt;h3&gt;
  
  
  Description
&lt;/h3&gt;

&lt;p&gt;Find the longest palindromic substring in a given string. A substring is palindromic if it reads the same backward as forward. If there are multiple palindromic substrings of the same length, you can return any one of them.&lt;/p&gt;

&lt;h2&gt;
  
  
  Ready to Begin?
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://www.dpcdev.com/" rel="noopener noreferrer"&gt;https://www.dpcdev.com/&lt;/a&gt;&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Fork this challenge&lt;/li&gt;
&lt;li&gt;Write your solution&lt;/li&gt;
&lt;li&gt;Test it against the provided test cases&lt;/li&gt;
&lt;li&gt;Share your approach in the comments below!&lt;/li&gt;
&lt;/ol&gt;

&lt;h3&gt;
  
  
  Want to Learn More?
&lt;/h3&gt;

&lt;p&gt;Check out the documentation about this topic here: &lt;a href="https://en.wikipedia.org/wiki/Longest_palindromic_substring" rel="noopener noreferrer"&gt;https://en.wikipedia.org/wiki/Longest_palindromic_substring&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Join the Discussion!
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;How did you approach this problem?&lt;/li&gt;
&lt;li&gt;Did you find any interesting edge cases?&lt;/li&gt;
&lt;li&gt;What was your biggest learning from this challenge?&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Let's learn together! Drop your thoughts and questions in the comments below. 👇&lt;/p&gt;




&lt;p&gt;&lt;em&gt;This is part of our Daily JavaScript Challenge series. Follow me for daily programming challenges and let's grow together! 🚀&lt;/em&gt;&lt;/p&gt;

&lt;h1&gt;
  
  
  javascript #programming #coding #dailycodingchallenge #webdev
&lt;/h1&gt;

</description>
      <category>javascript</category>
      <category>devchallenge</category>
      <category>programming</category>
      <category>webdev</category>
    </item>
    <item>
      <title>Daily JavaScript Challenge #JS-267: Transform a String into a Numeric Code</title>
      <dc:creator>DPC </dc:creator>
      <pubDate>Sat, 30 Aug 2025 00:00:53 +0000</pubDate>
      <link>https://forem.com/dpc/daily-javascript-challenge-js-267-transform-a-string-into-a-numeric-code-53bo</link>
      <guid>https://forem.com/dpc/daily-javascript-challenge-js-267-transform-a-string-into-a-numeric-code-53bo</guid>
      <description>&lt;h1&gt;
  
  
  Daily JavaScript Challenge: Transform a String into a Numeric Code
&lt;/h1&gt;

&lt;p&gt;Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp! &lt;/p&gt;

&lt;h2&gt;
  
  
  The Challenge
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Difficulty&lt;/strong&gt;: Medium&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Topic&lt;/strong&gt;: String Manipulation&lt;/p&gt;

&lt;h3&gt;
  
  
  Description
&lt;/h3&gt;

&lt;p&gt;Create a function that transforms a given string into a numeric code by replacing each letter with its position in the English alphabet. For example, 'A' becomes 1, 'B' becomes 2, etc. The function should ignore non-alphabetic characters and return the numeric code as a space-separated string of numbers.&lt;/p&gt;

&lt;h2&gt;
  
  
  Ready to Begin?
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://www.dpcdev.com/" rel="noopener noreferrer"&gt;https://www.dpcdev.com/&lt;/a&gt;&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Fork this challenge&lt;/li&gt;
&lt;li&gt;Write your solution&lt;/li&gt;
&lt;li&gt;Test it against the provided test cases&lt;/li&gt;
&lt;li&gt;Share your approach in the comments below!&lt;/li&gt;
&lt;/ol&gt;

&lt;h3&gt;
  
  
  Want to Learn More?
&lt;/h3&gt;

&lt;p&gt;Check out the documentation about this topic here: &lt;a href="https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/charCodeAt" rel="noopener noreferrer"&gt;https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/charCodeAt&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Join the Discussion!
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;How did you approach this problem?&lt;/li&gt;
&lt;li&gt;Did you find any interesting edge cases?&lt;/li&gt;
&lt;li&gt;What was your biggest learning from this challenge?&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Let's learn together! Drop your thoughts and questions in the comments below. 👇&lt;/p&gt;




&lt;p&gt;&lt;em&gt;This is part of our Daily JavaScript Challenge series. Follow me for daily programming challenges and let's grow together! 🚀&lt;/em&gt;&lt;/p&gt;

&lt;h1&gt;
  
  
  javascript #programming #coding #dailycodingchallenge #webdev
&lt;/h1&gt;

</description>
      <category>javascript</category>
      <category>devchallenge</category>
      <category>programming</category>
      <category>webdev</category>
    </item>
    <item>
      <title>Daily JavaScript Challenge #JS-266: Array Element Product Finder</title>
      <dc:creator>DPC </dc:creator>
      <pubDate>Fri, 29 Aug 2025 00:01:00 +0000</pubDate>
      <link>https://forem.com/dpc/daily-javascript-challenge-js-266-array-element-product-finder-15mf</link>
      <guid>https://forem.com/dpc/daily-javascript-challenge-js-266-array-element-product-finder-15mf</guid>
      <description>&lt;h1&gt;
  
  
  Daily JavaScript Challenge: Array Element Product Finder
&lt;/h1&gt;

&lt;p&gt;Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp! &lt;/p&gt;

&lt;h2&gt;
  
  
  The Challenge
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Difficulty&lt;/strong&gt;: Medium&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Topic&lt;/strong&gt;: Array Manipulation&lt;/p&gt;

&lt;h3&gt;
  
  
  Description
&lt;/h3&gt;

&lt;p&gt;Given an array of integers, determine the highest product that can be obtained by multiplying any three distinct elements.&lt;/p&gt;

&lt;h2&gt;
  
  
  Ready to Begin?
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://www.dpcdev.com/" rel="noopener noreferrer"&gt;https://www.dpcdev.com/&lt;/a&gt;&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Fork this challenge&lt;/li&gt;
&lt;li&gt;Write your solution&lt;/li&gt;
&lt;li&gt;Test it against the provided test cases&lt;/li&gt;
&lt;li&gt;Share your approach in the comments below!&lt;/li&gt;
&lt;/ol&gt;

&lt;h3&gt;
  
  
  Want to Learn More?
&lt;/h3&gt;

&lt;p&gt;Check out the documentation about this topic here: &lt;a href="https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/sort" rel="noopener noreferrer"&gt;https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/sort&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Join the Discussion!
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;How did you approach this problem?&lt;/li&gt;
&lt;li&gt;Did you find any interesting edge cases?&lt;/li&gt;
&lt;li&gt;What was your biggest learning from this challenge?&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Let's learn together! Drop your thoughts and questions in the comments below. 👇&lt;/p&gt;




&lt;p&gt;&lt;em&gt;This is part of our Daily JavaScript Challenge series. Follow me for daily programming challenges and let's grow together! 🚀&lt;/em&gt;&lt;/p&gt;

&lt;h1&gt;
  
  
  javascript #programming #coding #dailycodingchallenge #webdev
&lt;/h1&gt;

</description>
      <category>javascript</category>
      <category>devchallenge</category>
      <category>programming</category>
      <category>webdev</category>
    </item>
    <item>
      <title>Daily JavaScript Challenge #JS-265: Last Stone Weight</title>
      <dc:creator>DPC </dc:creator>
      <pubDate>Thu, 28 Aug 2025 00:00:43 +0000</pubDate>
      <link>https://forem.com/dpc/daily-javascript-challenge-js-265-last-stone-weight-1446</link>
      <guid>https://forem.com/dpc/daily-javascript-challenge-js-265-last-stone-weight-1446</guid>
      <description>&lt;h1&gt;
  
  
  Daily JavaScript Challenge: Last Stone Weight
&lt;/h1&gt;

&lt;p&gt;Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp! &lt;/p&gt;

&lt;h2&gt;
  
  
  The Challenge
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Difficulty&lt;/strong&gt;: Medium&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Topic&lt;/strong&gt;: Simulation&lt;/p&gt;

&lt;h3&gt;
  
  
  Description
&lt;/h3&gt;

&lt;p&gt;Simulate the collision of stones to find the weight of the last remaining stone.&lt;/p&gt;

&lt;h2&gt;
  
  
  Ready to Begin?
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://www.dpcdev.com/" rel="noopener noreferrer"&gt;https://www.dpcdev.com/&lt;/a&gt;&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Fork this challenge&lt;/li&gt;
&lt;li&gt;Write your solution&lt;/li&gt;
&lt;li&gt;Test it against the provided test cases&lt;/li&gt;
&lt;li&gt;Share your approach in the comments below!&lt;/li&gt;
&lt;/ol&gt;

&lt;h3&gt;
  
  
  Want to Learn More?
&lt;/h3&gt;

&lt;p&gt;Check out the documentation about this topic here: &lt;a href="https://en.wikipedia.org/wiki/Heapsort" rel="noopener noreferrer"&gt;https://en.wikipedia.org/wiki/Heapsort&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Join the Discussion!
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;How did you approach this problem?&lt;/li&gt;
&lt;li&gt;Did you find any interesting edge cases?&lt;/li&gt;
&lt;li&gt;What was your biggest learning from this challenge?&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Let's learn together! Drop your thoughts and questions in the comments below. 👇&lt;/p&gt;




&lt;p&gt;&lt;em&gt;This is part of our Daily JavaScript Challenge series. Follow me for daily programming challenges and let's grow together! 🚀&lt;/em&gt;&lt;/p&gt;

&lt;h1&gt;
  
  
  javascript #programming #coding #dailycodingchallenge #webdev
&lt;/h1&gt;

</description>
      <category>javascript</category>
      <category>devchallenge</category>
      <category>programming</category>
      <category>webdev</category>
    </item>
    <item>
      <title>Daily JavaScript Challenge #JS-264: Unique Anagrams Generator</title>
      <dc:creator>DPC </dc:creator>
      <pubDate>Wed, 27 Aug 2025 00:00:50 +0000</pubDate>
      <link>https://forem.com/dpc/daily-javascript-challenge-js-264-unique-anagrams-generator-dip</link>
      <guid>https://forem.com/dpc/daily-javascript-challenge-js-264-unique-anagrams-generator-dip</guid>
      <description>&lt;h1&gt;
  
  
  Daily JavaScript Challenge: Unique Anagrams Generator
&lt;/h1&gt;

&lt;p&gt;Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp! &lt;/p&gt;

&lt;h2&gt;
  
  
  The Challenge
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Difficulty&lt;/strong&gt;: Medium&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Topic&lt;/strong&gt;: String Manipulation&lt;/p&gt;

&lt;h3&gt;
  
  
  Description
&lt;/h3&gt;

&lt;p&gt;Write a function that takes a string as input and returns all unique anagrams of that string. An anagram is a rearrangement of the characters of the string to form a new word or phrase. The function should return an array of strings containing each unique anagram.&lt;/p&gt;

&lt;h2&gt;
  
  
  Ready to Begin?
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://www.dpcdev.com/" rel="noopener noreferrer"&gt;https://www.dpcdev.com/&lt;/a&gt;&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Fork this challenge&lt;/li&gt;
&lt;li&gt;Write your solution&lt;/li&gt;
&lt;li&gt;Test it against the provided test cases&lt;/li&gt;
&lt;li&gt;Share your approach in the comments below!&lt;/li&gt;
&lt;/ol&gt;

&lt;h3&gt;
  
  
  Want to Learn More?
&lt;/h3&gt;

&lt;p&gt;Check out the documentation about this topic here: &lt;a href="https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Keyed_collections" rel="noopener noreferrer"&gt;https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Keyed_collections&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Join the Discussion!
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;How did you approach this problem?&lt;/li&gt;
&lt;li&gt;Did you find any interesting edge cases?&lt;/li&gt;
&lt;li&gt;What was your biggest learning from this challenge?&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Let's learn together! Drop your thoughts and questions in the comments below. 👇&lt;/p&gt;




&lt;p&gt;&lt;em&gt;This is part of our Daily JavaScript Challenge series. Follow me for daily programming challenges and let's grow together! 🚀&lt;/em&gt;&lt;/p&gt;

&lt;h1&gt;
  
  
  javascript #programming #coding #dailycodingchallenge #webdev
&lt;/h1&gt;

</description>
      <category>javascript</category>
      <category>devchallenge</category>
      <category>programming</category>
      <category>webdev</category>
    </item>
    <item>
      <title>Daily JavaScript Challenge #JS-263: Determine If Array is Monotonic</title>
      <dc:creator>DPC </dc:creator>
      <pubDate>Tue, 26 Aug 2025 00:00:49 +0000</pubDate>
      <link>https://forem.com/dpc/daily-javascript-challenge-js-263-determine-if-array-is-monotonic-44be</link>
      <guid>https://forem.com/dpc/daily-javascript-challenge-js-263-determine-if-array-is-monotonic-44be</guid>
      <description>&lt;h1&gt;
  
  
  Daily JavaScript Challenge: Determine If Array is Monotonic
&lt;/h1&gt;

&lt;p&gt;Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp! &lt;/p&gt;

&lt;h2&gt;
  
  
  The Challenge
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Difficulty&lt;/strong&gt;: Medium&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Topic&lt;/strong&gt;: Array Manipulation&lt;/p&gt;

&lt;h3&gt;
  
  
  Description
&lt;/h3&gt;

&lt;p&gt;Create a function that checks if a given array of numbers is monotonic - either entirely non-increasing or non-decreasing.&lt;/p&gt;

&lt;h2&gt;
  
  
  Ready to Begin?
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://www.dpcdev.com/" rel="noopener noreferrer"&gt;https://www.dpcdev.com/&lt;/a&gt;&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Fork this challenge&lt;/li&gt;
&lt;li&gt;Write your solution&lt;/li&gt;
&lt;li&gt;Test it against the provided test cases&lt;/li&gt;
&lt;li&gt;Share your approach in the comments below!&lt;/li&gt;
&lt;/ol&gt;

&lt;h3&gt;
  
  
  Want to Learn More?
&lt;/h3&gt;

&lt;p&gt;Check out the documentation about this topic here: &lt;a href="https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array" rel="noopener noreferrer"&gt;https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Join the Discussion!
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;How did you approach this problem?&lt;/li&gt;
&lt;li&gt;Did you find any interesting edge cases?&lt;/li&gt;
&lt;li&gt;What was your biggest learning from this challenge?&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Let's learn together! Drop your thoughts and questions in the comments below. 👇&lt;/p&gt;




&lt;p&gt;&lt;em&gt;This is part of our Daily JavaScript Challenge series. Follow me for daily programming challenges and let's grow together! 🚀&lt;/em&gt;&lt;/p&gt;

&lt;h1&gt;
  
  
  javascript #programming #coding #dailycodingchallenge #webdev
&lt;/h1&gt;

</description>
      <category>javascript</category>
      <category>devchallenge</category>
      <category>programming</category>
      <category>webdev</category>
    </item>
    <item>
      <title>Daily JavaScript Challenge #JS-262: Find the Middle Character(s) of a String</title>
      <dc:creator>DPC </dc:creator>
      <pubDate>Mon, 25 Aug 2025 00:00:45 +0000</pubDate>
      <link>https://forem.com/dpc/daily-javascript-challenge-js-262-find-the-middle-characters-of-a-string-1m1a</link>
      <guid>https://forem.com/dpc/daily-javascript-challenge-js-262-find-the-middle-characters-of-a-string-1m1a</guid>
      <description>&lt;h1&gt;
  
  
  Daily JavaScript Challenge: Find the Middle Character(s) of a String
&lt;/h1&gt;

&lt;p&gt;Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp! &lt;/p&gt;

&lt;h2&gt;
  
  
  The Challenge
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Difficulty&lt;/strong&gt;: Easy&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Topic&lt;/strong&gt;: String Manipulation&lt;/p&gt;

&lt;h3&gt;
  
  
  Description
&lt;/h3&gt;

&lt;p&gt;Write a function that takes a string as input and returns the middle character(s) of the string. If the string length is odd, return the middle character. If the string length is even, return the two middle characters.&lt;/p&gt;

&lt;h2&gt;
  
  
  Ready to Begin?
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://www.dpcdev.com/" rel="noopener noreferrer"&gt;https://www.dpcdev.com/&lt;/a&gt;&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Fork this challenge&lt;/li&gt;
&lt;li&gt;Write your solution&lt;/li&gt;
&lt;li&gt;Test it against the provided test cases&lt;/li&gt;
&lt;li&gt;Share your approach in the comments below!&lt;/li&gt;
&lt;/ol&gt;

&lt;h3&gt;
  
  
  Want to Learn More?
&lt;/h3&gt;

&lt;p&gt;Check out the documentation about this topic here: &lt;a href="https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String" rel="noopener noreferrer"&gt;https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Join the Discussion!
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;How did you approach this problem?&lt;/li&gt;
&lt;li&gt;Did you find any interesting edge cases?&lt;/li&gt;
&lt;li&gt;What was your biggest learning from this challenge?&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Let's learn together! Drop your thoughts and questions in the comments below. 👇&lt;/p&gt;




&lt;p&gt;&lt;em&gt;This is part of our Daily JavaScript Challenge series. Follow me for daily programming challenges and let's grow together! 🚀&lt;/em&gt;&lt;/p&gt;

&lt;h1&gt;
  
  
  javascript #programming #coding #dailycodingchallenge #webdev
&lt;/h1&gt;

</description>
      <category>javascript</category>
      <category>devchallenge</category>
      <category>programming</category>
      <category>webdev</category>
    </item>
  </channel>
</rss>
