Between Two Sets HackerRank Solution

[@ulyses1018]

Great approach to solve the challange! One doubt, how do you know that max value of list *a* is lesser than min value of list *b* ?

[@marcelocortezdev]

Great explanation on the 'thought' process

[@KindsonTheTechPro]

Glad it was helpful!

[@readbhagwatgeeta3810]

Thank you so much for very easy solution😇...without any complex terminologies🙏🙏

[@anniamatthews6803]

thank you!! this was a great explanation.

[@paktric]

Nice video, Kindson 👍

[@79-surajyadav26]

great but we can even reduce no of comparison by 👇👇 def getTotalX(a, b): count = 0 for number in range (max(a), min(b)+1) : factor = True for element in a : if number % element != 0 : factor = False break if factor : multiple = True for element in b : if element % number != 0 : multiple = False break if multiple : count += 1 return count

[@srikanthganti9449]

what is the time complexity?

[@cgd1602]

worst case O(n^2)

[@maxz999]

O((a+b)d) where d is min(b) - max(a)

[@davidobodo3605]

nice

[@KindsonTheTechPro]

😊

[@mahmoudelsayed8830]

thx u sir

[@binayapatel]

This logic is not passing all the test case of HankerRank

[@Bharath-h1u]

For a it is i%ele And for b it is ele%i

[@KindsonTheTechPro]

Could you get it pass now?