my approach of finding long problems in java

 // Online Java Compiler

// Use this editor to write, compile and run your Java code online

  

class Main {

    public static void main(String[] args) {

       int [] arr={1,2,3,4,4,5,5,5};

      // because one element is already present

       int [] freq=new int [arr.length];

       boolean [] visit=new boolean[arr.length];

       int index=0;

       //finding elemets with their frequency:

       for(int i=0;i<arr.length;i++){

              if(visit[i]){

                  continue;

              }

               int count=1;

           for(int j=i+1;j<arr.length;j++){

               if(arr[i]==arr[j]){

                   visit[j]=true;

                   count++;


               }

               freq[i]=count;

           }

       

              // System.out.println(arr[i]+":"+freq[i]);

       }

       //finding maximum frequency:

        int max=Integer.MIN_VALUE;

       for(int i=0;i<freq.length;i++){

            //System.out.println(freq[i]);

            if(freq[i]>max){

                max=freq[i];

            }

       }

        for(int i=0;i<arr.length;i++){

              if(visit[i]){

                  continue;

              }

               int count1=1;

           for(int j=i+1;j<arr.length;j++){

               if(arr[i]==arr[j]){

                  count1++;

               }

        

           }

           if(max==count1){

             System.out.println(arr[i]);  

           }

       

         

       }

       

       System.out.println(max);

        

    }

}


//majority element:

// Online Java Compiler

// Use this editor to write, compile and run your Java code online


class Main {

    public static void main(String[] args) {

       int [] arr={1,2,1,1};

       int [] freq=new int [arr.length];

       boolean [] visit=new boolean[arr.length];

       int n=arr.length/2;

       for(int i=0;i<arr.length;i++){

           if(visit[i]) {

               continue;

           }

           int count=1;

           for(int j=i+1;j<arr.length;j++){

               if(arr[i]==arr[j]){

                   visit[j]=true;

                   count++;

               }

           }

           freq[i]=count;

       }

       int max=Integer.MIN_VALUE;

       for(int i=0;i<arr.length;i++){

           if(freq[i]>max){

       max=freq[i];

       }

    }

    for(int i=0;i<arr.length;i++){

        if(!visit[i]  && max>n && freq[i]==max){

            System.out.println("majority element:"+arr[i]);

        }

    }

    

}

}

//buy and sell the stocks:

// Online Java Compiler

// Use this editor to write, compile and run your Java code online


class Main {

    public static void main(String[] args) {

        int [] price={8,2,1,5,4,6};

        int [] temp=new int [price.length];

        int index=0,min_index=0;

        int min=Integer.MAX_VALUE;

       for(int i=0;i<price.length;i++){

        if(price[i]<min){

            min=price[i];

            min_index=i;

        }

       }

       int max=Integer.MIN_VALUE;

       for(int i=min_index;i<price.length;i++){

          temp[index++]= price[i]-min;

       }

       for(int i=0;i<temp.length;i++){

           if(temp[i]>max){

               max=temp[i];

           }

       }

       System.out.println("Buy:"+min);

       System.out.println("sell:"+max);

       

    }

}


Comments

Post a Comment

Popular posts from this blog

optimsed apporach

//For finding buying and seeling the stock:  class Main {     public static void main(String[] args) {         int[] price = {8, 2, 1, 5, 4, 6};         int min = Integer.MAX_VALUE;         int max = 0;         for(int i=0;i<price.length;i++){             if(price[i]<min){                 min=price[i];             }             else if(price[i]-min>max){                 max=price[i]-min;             }         }         System.out.println("Buy:"+min);                 System.out.println("sell:"+max);     } } //finiding leader in an array: // Online Java Compiler // Use this editor to write, compile and...
Read more

what i learn

  Great question, R — and I love that you're thinking critically about how indexing works in loops. Let's clarify this with precision. 🧠 Why neg[i++] Starts at Index 0 When you write neg[i++] , you're accessing the current value of i , then incrementing it. So if i = 0 , this line: combine[k++] = neg[i++]; means: Use neg[0] (the first element). Then increment i to 1. So you're not saying i++ = 1 — you're saying: "Use i = 0 now, and after this line, i becomes 1." This is called post-increment , and it's a common pattern in Java when you want to use the current index before moving to the next. 🔍 Quick Illustration int i = 0; System.out.println(neg[i++]); // prints neg[0], then i becomes 1 System.out.println(neg[i]); // now prints neg[1] So the loop starts at index 0 because arrays in Java are zero-indexed — meaning the first element is at position 0, not 1. ✅ Summary i++ means "use current i , then increment....
Read more

creative codes

 //finding An equilibrium index is a position in the array where the sum of elements to the left = sum of elements to the right . // Online Java Compiler // Use this editor to write, compile and run your Java code online class Main {     public static void main(String[] args) {         int[] arr = {3, 4, 8, -9, 20, 6};         int n = arr.length;         int sum=0;         boolean found=false;          for(int i=0; i<n;i++)  sum+=arr[i];          int left_sum=0;                    for(int i=0;i<n;i++){              int right_sum=sum-left_sum-arr[i];              if(left_sum==right_sum){                  found=true;                 ...
Read more