diff --git a/Array-Sorting-Without-Function/jaychhatrola/BubbleSort.java b/Array-Sorting-Without-Function/jaychhatrola/BubbleSort.java
new file mode 100644
index 0000000..c5ebda5
--- /dev/null
+++ b/Array-Sorting-Without-Function/jaychhatrola/BubbleSort.java
@@ -0,0 +1,46 @@
+package Ajava;
+
+import java.util.Scanner;
+
+public class BubbleSort {
+
+	static void Sorting(int bubblesort[]) {
+		int a = bubblesort.length;
+
+		for (int i = 0; i < a - 1; i++) {
+			for (int j = 0; j < a - i - 1; j++) {
+				if (bubblesort[j] > bubblesort[j + 1]) {
+					int temp = bubblesort[j];
+					bubblesort[j] = bubblesort[j + 1];
+					bubblesort[j + 1] = temp;
+				}
+			}
+
+		}
+
+		System.out.println("Sorted Array :-");
+		for (int i = 0; i < a; i++) {
+			System.out.print(" " + bubblesort[i]);
+		}
+
+	}
+
+	public static void main(String[] args) {
+
+		int n = 0;
+		Scanner sc = new Scanner(System.in);
+
+		System.out.println("Enter Array Size");
+		n = sc.nextInt();
+
+		int array[] = new int[n];
+
+		for (int i = 0; i < n; i++) {
+			array[i] = sc.nextInt();
+		}
+
+		Sorting(array);
+
+	}
+
+}
diff --git a/Find-Char-Occurrence/jaychhatrola/Subsequence.java b/Find-Char-Occurrence/jaychhatrola/Subsequence.java
new file mode 100644
index 0000000..a1ef6a0
--- /dev/null
+++ b/Find-Char-Occurrence/jaychhatrola/Subsequence.java
@@ -0,0 +1,51 @@
+package Ajava;
+
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class Subsequence { 
+   
+	 public static void find (char[] str, String str1)
+	    {
+	       
+	        if (str1.length() == str.length)
+	        {
+	        
+	            System.out.print(str1 + " ");
+	            return;
+	        }
+
+	        
+	        for (int i = 0; i < str.length; i++)
+	        {
+	        
+	            while (i + 1 < str.length && str[i] == str[i+1]) {
+	            	i++;
+	            	
+	            }
+
+	            find (str, str1 + str[i]);
+	        }
+	    }
+
+
+ public static void main(String[] args) 
+ { 
+	 
+	 Scanner sc = new Scanner(System.in);
+	 
+	 System.out.println("Enter String");
+	 
+	 
+	 String str = sc.nextLine();
+
+     String str1 = "";
+
+     str = str.toLowerCase();
+     
+     char[] c = str.toCharArray();
+     Arrays.sort(c);
+
+     find(c, str1);
+ 	} 
+} 
\ No newline at end of file
diff --git a/String-Operation/JayChhatrola/Stringoperation.java b/String-Operation/JayChhatrola/Stringoperation.java
new file mode 100644
index 0000000..27c5396
--- /dev/null
+++ b/String-Operation/JayChhatrola/Stringoperation.java
@@ -0,0 +1,51 @@
+import java.util.Scanner;
+
+public class Stringoperation {
+	
+	
+	static final int TotalChar = 256; 
+    
+   
+    static void findDuplicate(String str, int[] c) 
+    { 
+       for (int i = 0; i < str.length();  i++) 
+          c[str.charAt(i)]++; 
+    } 
+       
+     static void printDuplicate(String str) 
+    { 
+       int count[] = new int[TotalChar]; 
+       findDuplicate(str, count); 
+      
+      for (int i = 0; i < TotalChar; i++) 
+        if(count[i] > 1) 
+            System.out.printf("%c,  Number Of Count = %d \n", i,  count[i]); 
+       
+    } 
+       
+	
+	public static void main(String[] args) {
+		
+		 String input = "";
+		 
+		 Scanner sc = new Scanner(System.in);
+		 
+		 System.out.println("Enter String");
+		 input = sc.nextLine();
+		 
+	
+		 printDuplicate(input); 
+		
+		
+		
+		
+		
+		
+		
+		
+		
+		
+	}
+	
+
+}