Lesson 5 - CountDiv | Codility for Programmers | Prefix Sums | Problem Solving Java

Published: 19 September 2020
on channel: Coding With Shihab

790

Write a function:

class Solution { public int solution(int A, int B, int K); }

that, given three integers A, B and K, returns the number of integers within the range [A..B] that are divisible by K, i.e.:

{ i : A ≤ i ≤ B, i mod K = 0 }

For example, for A = 6, B = 11 and K = 2, your function should return 3, because there are three numbers divisible by 2 within the range [6..11], namely 6, 8 and 10.

Write an efficient algorithm for the following assumptions:

A and B are integers within the range [0..2,000,000,000];
K is an integer within the range [1..2,000,000,000];
A ≤ B.

#PrefixSums #Codility #CountDiv

On this page of the site you can watch the video online Lesson 5 - CountDiv | Codility for Programmers | Prefix Sums | Problem Solving Java with a duration of hours minute second in good quality, which was uploaded by the user Coding With Shihab 19 September 2020, share the link with friends and acquaintances, this video has already been watched 790 times on youtube and it was liked by 7 viewers. Enjoy your viewing!

549