Data analysts at Amazon are analyzing time-series data. It was concluded that the data of the nth item was dependent on the data of some xth day if there is a positive integer k such that floor(n / k) = x where floor() represents the largest integer less than or equal to z.
Given n, find the sum of all the days' numbers on which the data of the xth (0 ≤ x < n) will be dependent.
Complete the function getDataDependenceSum in the editor below.
getDataDependenceSum takes the following arguments:
long int n: the day to analyze the data dependency for
Returns
long int: the sum of days on which the data is dependent
Input Format For Custom Testing
The first line contains a long integer, n.
🌷, As always, a supa huge TY to tomtom, spike and aikay! You three da best 4ever!! 🐡 🐡 🐡
n = 13 return = 29
n = 13th day is dependent on [0, 1, 2, 3, 4, 6, 13] obtained for k = [14, 13, 6, 4, 3, 2, 1].n = 1 return = 1
1.n = 5 return = 8
n ≤ 10^10- Count Promotional PeriodsOA · Seen Jun 2026
- Find Maximum Total Amount (SDE I, Fungible :)Seen Jun 2026
- Get Minimum AmountOA · Seen Jun 2026
- Find Minimum CostOA · Seen Jun 2026
- Get Smallest Base SegmentOA · Seen Jun 2026
- Select Least Resource TasksOA · Seen Jun 2026
- Product Category Group SizesPHONE SCREEN · Seen May 2026
- Count Connected ComponentsPHONE SCREEN · Seen May 2026
public long getDataDependenceSum(long n) {
// write your code here
}