add 2614

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -28,6 +28,7 @@
 | 2643 | [Row With Maximum Ones](https://leetcode.com/problems/row-with-maximum-ones/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2643.java)                                       |                                      | Easy                           |
 | 2641 | [Cousins in Binary Tree II](https://leetcode.com/problems/cousins-in-binary-tree-ii/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2641.java)                                       |                                      | Medium                         |Tree, BFS, HashTable
 | 2639 | [Find the Width of Columns of a Grid](https://leetcode.com/problems/find-the-width-of-columns-of-a-grid/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2639.java)                                       |                                      | Easy                           |
+| 2614 | [Prime In Diagonal](https://leetcode.com/problems/prime-in-diagonal/)                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2614.java)                                       |                                      | Easy                           |
 | 2605 | [Form Smallest Number From Two Digit Arrays](https://leetcode.com/problems/form-smallest-number-from-two-digit-arrays/)                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2605.java)                                       |                                      | Easy                           |
 | 2609 | [Find the Longest Balanced Substring of a Binary String](https://leetcode.com/problems/find-the-longest-balanced-substring-of-a-binary-string/)                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2609.java)                                       |                                      | Easy                           |
 | 2600 | [K Items With the Maximum Sum](https://leetcode.com/problems/k-items-with-the-maximum-sum/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2600.java)                                       |                                      | Easy                           |

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2614.java

@@ -0,0 +1,35 @@
+package com.fishercoder.solutions.thirdthousand;
+
+public class _2614 {
+    public static class Solution1 {
+        public int diagonalPrime(int[][] nums) {
+            int ans = 0;
+            boolean[] nonPrimes = generatePrimes((int) (Math.pow(10, 6) * 4));
+            for (int i = 0; i < nums.length; i++) {
+                for (int j = 0; j < nums[0].length; j++) {
+                    if (i == j || i == nums.length - j - 1) {
+                        if (!nonPrimes[nums[i][j]]) {
+                            ans = Math.max(ans, nums[i][j]);
+                        }
+                    }
+                }
+            }
+            return ans;
+        }
+
+        private boolean[] generatePrimes(int n) {
+            boolean[] nonPrimes = new boolean[n];
+            //1 is not a prime number
+            nonPrimes[1] = true;
+            for (int i = 2; i < n; i++) {
+                if (!nonPrimes[i]) {
+                    for (int j = 2; i * j < n; j++) {
+                        nonPrimes[i * j] = true;
+                    }
+                }
+            }
+            return nonPrimes;
+        }
+
+    }
+}