CodeWithYash

 class Compute {          public void rotate(long arr[], long n)     {        int end=(int)n-1; for(end=(int)n-1;end>0;end--){ long temp=0L;//to initialize an element of long to 0(0L in long)  temp=arr[end]; arr[end]=arr[end-1]; arr[end-1]=temp; }               //if you want to print result here then use below two lines also /*for(int i=0;i<(int)n;i++){ System.out.print(arr[i]+" "); }*/     } } Time: O(n) Space: O(1) Concept: Arithmetic Shift Left  //Please comment and like.  //Thanks 😀.

 class Solution {     public int[] intersection(int[] arr1, int[] arr2) {         int n1=arr1.length;         int n2=arr2.length;         HashSet<Integer> set=new HashSet<Integer>(); for(int i=0;i<n1;i++){ set.add(arr1[i]); } //System.out.println("Set 1 elements are: "); //set.forEach(System.out::println); HashSet<Integer> set2=new HashSet<Integer>(); HashSet<Integer> set3=new HashSet<Integer>(); for(int i=0;i<n2;i++){ set2.add(arr2[i]); } //System.out.println("Set 2 elements are: "); //set2.forEach(System.out::println); int inter=0; int index=0; for(int x : set2){ if(set.contains(x)){ inter++; set3.add(x); } } int aa[]=new int[set3.size()]; //System.out.print("Intersection elements are: "); //System.out.println(inter); for(int x:set3){ aa[index++]=x; } //for(int i=0;i<aa.length;i++){ //System.out.print(aa[i]+&quo

 import java.util.Scanner; import java.util.ArrayList; import java.util.*; class LBArrayNegOneSide{ public static void main(String arg[]){ Scanner sc=new Scanner(System.in); System.out.println("Enter the number of elements in array : "); int n=sc.nextInt(); int arr[]=new int[n]; System.out.println("Enter elements of array : "); for(int i=0;i<n;i++){ arr[i]=sc.nextInt(); } int start=0; int end=n-1; while(start<end){ if(arr[start]>0 && arr[end]<0){ int temp=0; temp=arr[start]; arr[start]=arr[end]; arr[end]=temp; start++; end--; } else if(arr[start]<0 && arr[end]>0){ start++; } else if(arr[start]>0 && arr[end]>0){ end--; } else{ start++; } } System.out.println("New Modified array is : "); for(int i=0;i<n;i++){ System.out.print(arr[i]+" "); } } }

import java.util.Scanner; import java.util.ArrayList; import java.util.*; class LBArrayPosRightSide{ public static void main(String arg[]){ Scanner sc=new Scanner(System.in); System.out.println("Enter the number of elements in array : "); int n=sc.nextInt(); int arr[]=new int[n]; System.out.println("Enter elements in array : "); for(int i=0;i<n;i++){ arr[i]=sc.nextInt(); } int start=0; int end=n-1; while(start<end){ if(arr[start]>0 && arr[end]<0){ end--; } else if(arr[start]<0 && arr[end]>0){ int temp=0; temp=arr[start]; arr[start]=arr[end]; arr[end]=temp; start++; end--; } else if(arr[start]>0 && arr[end]>0){ start++; } else{ end--; } } System.out.println("New Modified array is : "); for(int i=0;i<n;i++){ System.out.print(arr[i]+" "); }

 Clear------ 0.40 sec Approach 1 : O(n) O(n) taking additional array public static void main(String arg[]){ Scanner sc=new Scanner(System.in);                        int t=sc.nextInt();                while(t -->0){ System.out.println("Enter size of Array : "); int n=sc.nextInt(); int arr[]=new int[n]; System.out.println("Enter Elements : "); for(int i=0;i<n;i++){ arr[i]=sc.nextInt(); } System.out.println("Actual Array is : "); for(int i=0;i<n;i++){ System.out.print(arr[i]+" "); } System.out.println(); int index=0; int arr1[]=new int[n]; for(int i=n-1;i>-1;i--){ arr1[index]=arr[i]; index++; } System.out.println("Reversed Array is : "); for(int i=0;i<n;i++){ System.out.print(arr1[i]+" "); }               System.out.println(); } } <--------------------------------------------------------------------------------------------

  import  java.io.*; import  java.util.*; public   class  Solution {      public   static   void  main(String[] args)  throws  Exception{        InputStreamReader r= new  InputStreamReader(System.in);        BufferedReader br= new  BufferedReader(r);        String str =  "" ;         int  count= 0 ;          while  ((str = br.readLine()) != null) {            count++;             System.out.println(count+ " " +str);         }         br.close();     } }

  //Complete this code or write your own from scratch import  java.util.*; import  java.io.*; class  Solution{      public   static   void  main(String []argh){         Scanner in =  new  Scanner(System.in);          int  n = in.nextInt();         HashMap<String,Integer> map= new  HashMap<String, Integer>();          for ( int  i =  0 ; i < n; i++){             String name = in.next();              int  phone = in.nextInt();             map.put(name,phone);         }          while (in.hasNext()){             String s = in.next();              if (map.containsKey(s)){                 System.out.println(s+ "=" +map.get(s));             }              else                 System.out.println( "Not found" );         }         in.close();     } }