We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  1. Practice
  2. Algorithms
  3. Implementation
  4. Between Two Sets
  5. Discussions

Between Two Sets

  • sumit371996 + 2 comments

    copy paste maar dia bhai

    • rajat_yadav + 1 comment

      aur kya kar sakta hai tu apni university ka naam hi dubaayega kuch seekh le in iit main padne walon se jo 50-50 lakh ka package kaise le jaate hain copy paste maarkar nahin kabhi hackerrank par unki profile check karna pata cjal jaayega

      • vivek4296 + 0 comments

        sahi bola, tera jaisa kahan hi h...yahan koi only u will get 50 lakh i know!!

    • rajat_yadav + 6 comments

      ye le solution samajh maine khudne banaya hai 2 ghante baith kar tu bhi bana saktaa hai agar hai himmat

      static int getTotalX(int[] a, int[] b) {
        int x=1,r=0,j=0,count=0;
        int[] d = new int[101];
        for(x=1;x<101;x++){
        	int c=0;
        		for(int i=0;i<a.length;i++) {
        			if(x%a[i]==0&&x>=a[i]){
        				c++;
        			}
        			}
        		if(c==a.length){
        			d[j]=x;
    				r++;
    				j++;
        		}
        		}
        for(j=0;j<r;j++){
        	int c=0;
            for(int i=0;i<b.length;i++){
         	   if(b[i]%d[j]==0){
         		   c++;
         	   }
            }
            if(c==b.length){
         	   count++;
            }
        }
        return count;
    }
      • shubhamchaudha11 + 0 comments

        Hi Rajat, can you please tell me about significance of "j"?

      • vivek4296 + 0 comments
        [deleted]
      • vivek4296 + 0 comments
        [deleted]
      • vivek4296 + 0 comments

        @rajat_yadav ye le.. tere wale se thoda easy hai

        static int gcd(int l,int e)
 {
     if(e==0)
     {
         return l;
     }
     else
     {
         return gcd(e,l%e);
     }
 }
 static int lcm(int[] e)
 {  
     int ans=1;
     for(int i:e)
     {
         ans=(ans*i)/gcd(ans,i);
     }
     return ans;
 }
static int getTotalX(int[] a, int[] b) {
    /*
     * Write your code here.
     */

     int count=0;
     int g=b[0];
     int l=lcm(a);
     for(int i=1;i<b.length;i++)
     {
         g=gcd(g,b[i]);
     }
     int m=l;
     int i=1;
     while(m<=g)
     {

         m=l*i;
         if(g%m==0)
         {
             count++;
         }
         i++;

     }

return count;

}
      • dsgarg71 + 0 comments

        ugly code

      • Ashutosh_Awasthi + 1 comment

        public static int getTotalX(List a, List b) {

            int counter = 0;
    if (a.Count>=1 && a.Count <= 10 && b.Count>=1 && b.Count <= 10)
    {
        int max1 = a.Max(x => x);
        int max2 = b.Max(x => x);
        int min1 = a.Min(x => x);
        int min2 = b.Min(x => x);
        int MaxCondition = max1 > max2 ? max1 : max2;
        int minCondition = min1 > min2 ? min2 : min1;


        for (int i = minCondition; i <=MaxCondition && i<=100; i++)
        {
            if (a.All(x => i % x == 0) && b.All(y => y % i == 0))
            {
                counter++;

            }
        }
    }
    return counter;
}
        • sk4641230 + 0 comments

          hi, your code is really nice and optimized. Can you check my code. It passed all testcases but i want to know is it possible to optimize it?

                  def getTotalX(a, b):

                        x=a[len(a)-1]
              y=b[0]
              count=0

              for p in range(x,y+1):
                      chk=0
                      for i in b:
                              if i%p!=0:
                                      chk=1
                                      break
                      chk1=0
                      for i in a:
                              if p%i!=0:
                                      chk1=1
                                      break
                      if chk==0 and chk1==0:
                              count+=1
              return count