going back to basic

binodcoder · binodcoder · commit e32de38f4377 · 2024-05-19T21:01:33.000+01:00
diff --git a/src/BinaryTreeYT.java b/src/BinaryTreeYT.java
@@ -1,5 +1,3 @@
-import java.util.Collection;
-import java.util.Iterator;
 import java.util.LinkedList;
 import java.util.Queue;
 public class BinaryTreeYT {
diff --git a/src/binod/CheckPrime.java b/src/binod/CheckPrime.java
@@ -0,0 +1,22 @@
+package binod;
+import java.util.Scanner;
+public class CheckPrime {
+    public static void main(String[] args) {
+        int flag=0;
+        Scanner scanner=new Scanner(System.in);
+        System.out.println("Input some number");
+        int inputNumber=scanner.nextInt();
+        for (int i=2;i<inputNumber;i++){
+            if(inputNumber%i==0){
+                flag=1;
+                break;
+            }
+        }
+        if(flag==0){
+            System.out.println("prime");
+
+        }else{
+            System.out.println("not prime");
+        }
+    }
+}
diff --git a/src/binod/MaxThreeNumber.java b/src/binod/MaxThreeNumber.java
@@ -0,0 +1,28 @@
+package binod;
+import java.util.Scanner;
+public class MaxThreeNumber {
+    public static void main(String[] args) {
+        Scanner scanner=new Scanner(System.in);
+        System.out.println("Input first number");
+        int firstNumber=scanner.nextInt();
+        System.out.println("Input second number");
+        int secondNumber=scanner.nextInt();
+        System.out.println("Input third number");
+        int thirdNumber=scanner.nextInt();
+
+        if(firstNumber>secondNumber){
+            if(firstNumber>thirdNumber){
+                System.out.println(firstNumber);
+            }else{
+                System.out.println(thirdNumber);
+            }
+
+        }else{
+            if(secondNumber>thirdNumber){
+                System.out.println(secondNumber);
+            }else{
+                System.out.println(thirdNumber);
+            }
+        }
+    }
+}
diff --git a/src/binod/SumTwoNumber.java b/src/binod/SumTwoNumber.java
@@ -0,0 +1,14 @@
+package binod;
+import java.util.Scanner;
+public class SumTwoNumber {
+    public static void main(String[] args) {
+        Scanner scanner=new Scanner(System.in);
+        System.out.println("Enter first number: ");
+        int firstNumber=scanner.nextInt();
+        System.out.println("Enter second number: ");
+        int secondNumber=scanner.nextInt();
+        int sum=firstNumber+secondNumber;
+        System.out.println(sum);
+
+    }
+}

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,3 @@`
`1`		`-import java.util.Collection;`
`2`		`-import java.util.Iterator;`
`3`	`1`	`import java.util.LinkedList;`
`4`	`2`	`import java.util.Queue;`
`5`	`3`	`public class BinaryTreeYT {`