Sync LeetCode submission Runtime - 107 ms (12.95%), Memory - 111.8 MB (7.57%)

Author: koralkulacoglu

LeetCode/3373-maximum-prime-difference/README.md

@@ -0,0 +1,33 @@
+<p>You are given an integer array <code>nums</code>.</p>
+
+<p>Return an integer that is the <strong>maximum</strong> distance between the <strong>indices</strong> of two (not necessarily different) prime numbers in <code>nums</code><em>.</em></p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [4,2,9,5,3]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">3</span></p>
+
+<p><strong>Explanation:</strong> <code>nums[1]</code>, <code>nums[3]</code>, and <code>nums[4]</code> are prime. So the answer is <code>|4 - 1| = 3</code>.</p>
+</div>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [4,8,2,8]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">0</span></p>
+
+<p><strong>Explanation:</strong> <code>nums[2]</code> is prime. Because there is just one prime number, the answer is <code>|2 - 2| = 0</code>.</p>
+</div>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 3 * 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
+	<li>The input is generated such that the number of prime numbers in the <code>nums</code> is at least one.</li>
+</ul>

LeetCode/3373-maximum-prime-difference/solution.cpp

@@ -0,0 +1,18 @@
+class Solution {
+    bool isPrime(int n) {
+        if (n == 1) return false;
+        for (int i=2; i*i<=n; i++) {
+            if (n % i == 0) return false;
+        }
+        return true;
+    }
+public:
+    int maximumPrimeDifference(vector<int>& nums) {
+        int n = nums.size();
+        vector<int> primes;
+        for (int i=0; i<n; i++) {
+            if (isPrime(nums[i])) primes.push_back(i);
+        }
+        return primes[primes.size()-1] - primes[0];
+    }
+};