Interview Question :PrimeSum

Signed-off-by: jatin107 <jatingoyal100@gmail.com>

Author: jating4you

src/codingInterview/Games/CountTheFinger.java

@@ -0,0 +1,43 @@
+package codingInterview.Games;
+
+/*package whatever //do not write package name here */
+
+import java.util.Scanner;
+
+//Problem Statement link https://practice.geeksforgeeks.org/problems/finger-game/0
+//Solution
+class CountTheFinger {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+
+        int t = sc.nextInt();
+        while (t-- > 0) {
+            int v = sc.nextInt();
+            //System.out.println(v);
+            switch (v % 8) {
+                case 1:
+                    System.out.println("1");
+                    break;
+                case 2:
+                case 0:
+                    System.out.println("2");
+                    break;
+                case 3:
+                case 7:
+                    System.out.println("3");
+                    break;
+                case 4:
+                case 6:
+                    System.out.println("4");
+                    break;
+                case 5:
+                    System.out.println("5");
+                    break;
+
+            }
+        }
+//Space O(1) Time O(1)
+        sc.close();
+    }
+
+}

src/codingInterview/bitManupulation/PrimeSum.java

@@ -0,0 +1,44 @@
+package codingInterview.bitManupulation;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+
+public class PrimeSum {
+    //link : https://www.interviewbit.com/problems/prime-sum/
+    static private ArrayList<Integer> primesum(int n) {
+        boolean isPrime[] = new boolean[n + 1];
+        Arrays.fill(isPrime, Boolean.TRUE);
+        ArrayList<Integer> numL = new ArrayList<>();
+        isPrime[0] = false;
+        isPrime[1] = false;
+
+        for (int i = 2; i * i <= n; i++) {
+            if (isPrime[i]) {
+                // Update all multiples of p
+                for (int j = i * 2; j <= n; j += i)
+                    isPrime[j] = false;
+            }
+        }
+
+        for (int i = 2; i <= n; i++) {
+            if (isPrime[i] && isPrime[n - i]) {
+                numL.add(i);
+                numL.add(n - i);
+                return numL;
+            }
+        }
+        //   System.out.println(numL);
+        return numL;
+//space O(n) time O(n)
+
+    }
+
+    public static void main(String[] args) {
+        System.out.println(primesum(1048574));
+        System.out.println(primesum(378));
+        //System.out.println(primeSum(4));
+    }
+
+}
+
+