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.
Maximum size of subarray that satisfy the conditions is 1 because : it is the minimum possible subset of any array & (1+2) / 1, (1+3) / 1, (1+4) / 1, (1+5) / 1 ..... are all factors of 1.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Non-Divisible Subset
You are viewing a single comment's thread. Return to all comments →
Maximum size of subarray that satisfy the conditions is 1 because : it is the minimum possible subset of any array & (1+2) / 1, (1+3) / 1, (1+4) / 1, (1+5) / 1 ..... are all factors of 1.