collections

Author: BlcaKHat

Collection.class

@@ -0,0 +1,26 @@
+import java.util.ArrayList;  
+ import java.util.Collections;  
+ import java.util.List;  
+ import java.util.Scanner;  
+ /**  
+  * @author Dixit  
+  *   
+  */  
+ public class Collection {  
+      public static void main(String a[]) {  
+           Scanner sc = new Scanner(System.in);  
+           System.out.println("Enter the String:-");  
+           String str = sc.nextLine();  
+           System.out.println("Enter the length");  
+           int count = sc.nextInt();  
+           List<String> list = new ArrayList<String>();  
+           for (int i = 0; i < str.length(); i = i + 1) {  
+                if (str.length() - i >= count) {  
+                     list.add(str.substring(i, count + i));  
+                }  
+           }  
+           Collections.sort(list);  
+           System.out.println("Smallest subString:-" + list.get(0));  
+           System.out.println("Largest subString:-" + list.get(list.size() - 1));  
+      }  
+ }  

Collection.java

@@ -0,0 +1,61 @@
+/* Finding the difference of diagonals in a matrix.........
+........................................
+..........................................*/
+
+import java.util.Scanner;
+
+public class Matrix_diagonal
+
+{
+
+    public static void main(String[] args) 
+
+    {
+
+        int m, n;
+	    
+
+        Scanner s = new Scanner(System.in);
+
+	System.out.print("Enter matrix size:");
+
+        m= n  = s.nextInt(); //size of matrix..
+            int a[][] = new int[m][n];
+      
+            System.out.println("Enter all the elements of first matrix:");
+
+            for (int i = 0; i < m; i++) 
+
+           {
+
+                for (int j = 0; j < n; j++) 
+
+                {
+
+                    a[i][j] = s.nextInt();
+
+                }
+          }
+        int d1=0 , d2= 0;
+        for(int i=0; i<n;i++) {
+          d1+=a[i][i];      /*  diagonal first , 0,0,    1,1,  2,2 ......*/
+          d2+=a[i][n-i-1];  /*  diagonal first , 3,0,    2,1,  1,0 ......*/
+        }
+
+        System.out.println(d1);
+        System.out.println(d2);
+
+        int diff = d1-d2;
+	//  for(int i=0;i<n;i++)  //printing the array.
+	//  {
+	// 	for (int j=0;j<m;j++)
+	// 	 {
+	// 		System.out.print(a[i][j]+" ");
+	// 	 }
+ //    System.out.println("\n");
+	// }
+
+
+   }
+}
+

Matrix_diagonal.class

@@ -0,0 +1,19 @@
+
+public class NumLoop{
+	public static void main(String[] args) {
+		// for(float f=5; f<2000; f += 2.5)
+		// {
+		// 	if(f% 2.5 == 0)
+		// 	{
+		// 		System.out.println(f);	
+		// 	}
+			
+		// }
+		//double n= (7.5 % 2.5) ;
+		//System.out.println(n);
+		for(int i= 5; i< 2000;i+=5){
+		
+				System.out.println(i);
+		}
+	}
+}

Matrix_diagonal.java

@@ -0,0 +1,32 @@
+/* Printing the sub-string of an string*/
+
+
+import java.io.*;
+import java.util.*;
+import java.text.*;
+import java.math.*;
+import java.util.regex.*;
+
+public class Substr {
+
+    public static void main(String[] args) {
+       Scanner userInput = new Scanner(System.in);
+    String name = userInput.nextLine();
+    char[] nameArray = name.toCharArray();
+    	int len=name.length();
+    	//System.out.println(len);
+        int start = userInput.nextInt();
+        int end = userInput.nextInt();
+
+        if(start <len && end <=len){
+        	for(int i=start;i<end;i++)
+        	{
+        		System.out.print(nameArray[i]);
+        	}
+        }
+        else{
+        	System.out.println("incorrct length");
+        }
+        
+    }
+}

NumLoop.class

@@ -0,0 +1,25 @@
+import java.io.*;
+import java.util.*;
+import java.text.*;
+import java.math.*;
+import java.util.regex.*;
+
+public class Substr1{
+	public static void main(String[] args) {
+			Scanner sc = new Scanner(System.in);
+	String str = sc.nextLine();
+	int k = sc.nextInt();  // size of sub string
+
+	SortedSet<String> sets=new TreeSet<String>();
+	for(int i=0;i<str.length()-k+1;i++)
+	{
+		sets.add(str.substring(i,i+k));
+		System.out.println(sets);
+		// break;
+	}
+	System.out.println(sets.first());
+	System.out.println(sets.last());
+
+	}
+
+}