COMPARE TWO LINKED LIST HACKKERANK

-

 static boolean compareLists(SinglyLinkedListNode head1, SinglyLinkedListNode head2) {

       SinglyLinkedListNode temp1=head1;
       SinglyLinkedListNode temp2=head2;
       int count1=0;
       int count2=0;
       int m=0;
       int count3=0;
       
       while(temp1!=null){
           
           count1++;
           temp1=temp1.next;
       }
        /*while(temp2!=null){
           
           count2++;
           temp2=temp2.next;
       }*/
       
       
       /*if(count1!=count2){
           return false;
       }
       else{*/
         temp1=head1;
         temp2=head2;
         while(temp1!=null && temp2!=null){
                if(temp1.data==temp2.data){
                    
                    count3++;
                    temp1=temp1.next;
                    temp2=temp2.next;
                }
                else {
                    count3=0;
                    break;
                }
               
                   
            }
            if(count3==count1){
                return true;
               
            }
            else
            return false;
           
       //}
       
       /*if(m==1){
           return true;
       }
       else
        return false;*/
       
       

    }

/*FOR better time complexity don't traverse both linked lists so as to find the
length of both linked lists. Instead, just traverse one linked list in order to match
the length with the count3 ie the total number of values same in both lists. */


Comments

Post a Comment

Popular posts from this blog

Java Date And Time HackerRank

-
CODE:   public   static  String findDay( int  month,  int  day,  int  year) {         String finalday= " " ;          try {             String d1= day+ "/" +month+ "/" +year;             SimpleDateFormat sdf= new  SimpleDateFormat( "dd/MM/yyyy" );             Date date1=sdf.parse(d1);             DateFormat format1= new  SimpleDateFormat( "EEEE" );            finalday=format1.format(date1);              // return finalday;      ...
Read more

Recursive Sequence Geeks For Geeks Problem Of The Day 12-02-2024

-
Problem Link: https://www.geeksforgeeks.org/problems/recursive-sequence1611/1 Code: class Solution{     static long sequence(int n){                 long sum=0;         int pointer=0;                  int mod=1000000007;         int pointer2=1;                  for(int i=1;i<n+1;i++){            pointer=i;            long val=1;            int mul=pointer2;            for(int j=0;j<pointer;j++){                val=(val*mul)%mod;                mul++;            }            pointer2=mul;            sum=(sum+val)%mod; ...
Read more

Minimum Indices HackerEarth

-
  import java . util .*;     class TestClass { public static void main ( String args [] ) throws Exception { Scanner sc = new Scanner ( System . in ); int n = sc . nextInt (); int q = sc . nextInt (); int arr []= new int [ n ]; for ( int i = 0 ; i < n ; i ++){ arr [ i ]= sc . nextInt (); } ArrayList < Integer > aa = new ArrayList < Integer >(); ArrayList < Integer > ab = new ArrayList < Integer >(); int sum = 0 ; for ( int i = 0 ; i < n ; i ++){ String s = String . valueOf ( arr [ i ]); for ( int j = 0 ; j < s . length (); j ++){ sum = sum + Integer . valueOf ( String . valueOf ( s . charAt ( j ))); } aa . add ( sum ); sum = 0 ; } //System.out.println(aa+" "); int count = 0 ; for ( int i = 0 ; i < q ; i ++){ int a = sc . nextInt (); int b =...
Read more