We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
No description provided.
The text was updated successfully, but these errors were encountered:
Hello maintainer please assign me this issue @abhishek2s
Sorry, something went wrong.
This is the solution of binary search problem
class Solution { public List prefixesDivBy5(int[] nums) { ArrayList res=new ArrayList<> (); int num=0; int n = nums.length;
for(int i=0;i<n;i++){ num=(num*2+nums[i])%5; if(num%5==0){ res.add(true); }else{ res.add(false); } } return res; }
}
No branches or pull requests
No description provided.
The text was updated successfully, but these errors were encountered: