diff --git a/Palindrome Number Check/PalindromeCheck.java b/Palindrome Number Check/PalindromeCheck.java
new file mode 100644
index 0000000..76c64c9
--- /dev/null
+++ b/Palindrome Number Check/PalindromeCheck.java	
@@ -0,0 +1,22 @@
+import java.util.*;
+class PalindromeCheck
+{
+public static void main (String[] args)
+{
+Scanner sc = new Scanner (System.in);
+int n, r = 0, d;
+n = sc.nextInt();
+int m = n;
+while (n > 0)
+{
+d = n % 10;
+n = n / 10;
+r = n * 10 + d;
+}
+if (r == m)
+	System.out.println("Number is palindrome");
+else
+	System.out.println("Number is not palindrome");
+
+}
+}
diff --git a/Pangram String/pangramString.java b/Pangram String/pangramString.java
new file mode 100644
index 0000000..1c6d72c
--- /dev/null
+++ b/Pangram String/pangramString.java	
@@ -0,0 +1,27 @@
+import java.util.*;
+class pangramString
+{
+public static void main(String[] args)
+{
+Scanner sc = new Scanner(System.in);
+String a = sc.nextLine();
+a = a.toLowerCase();
+int i, index = 0;
+int arr [] = new int [26];
+for (i = 0; i < a.length(); i++)
+{
+if (a.charAt(i) >= 'a' && a.charAt(i) <= 'z')
+	index = str.charAt(i) - 'a';
+arr[index] = 1;
+}
+
+for (i = 0; i < arr.length; i++)
+{
+if (arr[i] == 0){
+	System.out.println("String is not pangram");
+	break;
+}
+}
+System.out.println("String is pangram");
+}
+}
diff --git a/Prime-Numbers-in-an-interval/primeNumbersInterval.java b/Prime-Numbers-in-an-interval/primeNumbersInterval.java
new file mode 100644
index 0000000..f162421
--- /dev/null
+++ b/Prime-Numbers-in-an-interval/primeNumbersInterval.java
@@ -0,0 +1,23 @@
+import java.util.*;
+class primeNumbersInterval
+{
+public static void main (String[] args)
+{
+Scanner sc = new Scanner(System.in);
+int a, b, ctr = 0, i, j, primes = 0; 
+a = sc.nextInt();
+b = sc.nextInt();
+for (i = a; i <= b; i++)
+{
+for (j = 1; j <= i; j++)
+{
+if (i % j == 0) {
+	ctr++;
+}
+}
+if (ctr >= 2) 
+	primes++;
+}
+System.out.println("Number of primes = " + primes);
+}
+}
\ No newline at end of file