Fraudulent Activity Notifications
Problem Statement :
HackerLand National Bank has a simple policy for warning clients about possible fraudulent account activity. If the amount spent by a client on a particular day is greater than or equal to 2 x the client's median spending for a trailing number of days, they send the client a notification about potential fraud. The bank doesn't send the client any notifications until they have at least that trailing number of prior days' transaction data. Given the number of trailing days d and a client's total daily expenditures for a period of n days, find and print the number of times the client will receive a notification over all days. Note: The median of a list of numbers can be found by arranging all the numbers from smallest to greatest. If there is an odd number of numbers, the middle one is picked. If there is an even number of numbers, median is then defined to be the average of the two middle values. (Wikipedia) Function Description Complete the function activityNotifications in the editor below. It must return an integer representing the number of client notifications. activityNotifications has the following parameter(s): expenditure: an array of integers representing daily expenditures d: an integer, the lookback days for median spending Input Format The first line contains two space-separated integers n and d, the number of days of transaction data, and the number of trailing days' data used to calculate median spending. The second line contains n space-separated non-negative integers where each integer i denotes expenditure[ i ]. Constraints 1 <= n <= 2* 10^5 1 <= d <= n 0 <= expenditure[ i ] <= 200 Output Format Print an integer denoting the total number of times the client receives a notification over a period of n days.
Solution :
Solution in C :
In C ++ ;
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
using namespace std;
#define MAXE 210
int A[200010];
int F[MAXE];
int median2(int D) {
int p = 0;
for (int i = 0; i < MAXE; i++) {
p += F[i];
if (p * 2 > D) {
return 2 * i;
} else if (p * 2 == D) {
for (int j = i + 1; ; j++) {
if (F[j]) {
return i + j;
}
}
}
}
return -1;
}
int main() {
int N, D;
cin >> N >> D;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int result = 0;
for (int i = 0; i < N; i++) {
if (i >= D) {
if (A[i] >= median2(D)) {
++result;
}
F[A[i - D]]--;
}
F[A[i]]++;
}
cout << result << endl;
return 0;
}
In Java :
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static double median(int[]b){
int mid=(int)b.length/2;
if(b.length%2==1){
return b[mid];
}
else{
return (b[mid-1]+b[mid])/2.0;
}
}
public static int BS(int[] arr,int in, int start,int end){
if(start>end){
return -1;
}
int mid=start+(end-start)/2;
if(arr[mid]==in){
return mid;
}
else if(arr[mid]<in){
return BS(arr,in,mid+1,end);
}
else {
return BS(arr,in,start,mid-1);
}
}
public static void replace(int[]b,int x, int y){
//for(int i=0;i<b.length;i++)
//System.out.print(b[i]);
int ind=BS(b,x,0,b.length-1);
//System.out.println(x);
b[ind]=y;
if((ind==0&&b[ind]<=b[ind+1])||(ind==b.length-1&&b[ind]>=b[ind-1])){
return;
}
else if(b[ind]>b[ind+1]){
int temp=0;
while(b[ind]>b[ind+1]){
temp=b[ind];
b[ind]=b[ind+1];
b[ind+1]=temp;
if(ind==b.length-2){
break;
}
ind++;
}
}
else if(b[ind]<b[ind-1]){
int temp=0;
while(b[ind]<b[ind-1]){
if(ind==1){
break;
}
temp=b[ind];
b[ind]=b[ind-1];
b[ind-1]=temp;
if(ind==1){
break;
}
ind--;
}
}
}
public static void main(String[] args) throws IOException {
Scanner scan=new Scanner(System.in);
int n=scan.nextInt();
int d=scan.nextInt();
int a[]=new int[n];
for(int i=0;i<n;i++){
a[i]=scan.nextInt();
}
int b[]=new int[d];
int not=0;
for(int i=0;i<d;i++){
b[i]=a[i];
}
Arrays.sort(b);
for(int i=d;i<n;i++){
if(a[i]>=2*median(b)){
not=not+1;
}
replace(b,a[i-d],a[i]);
}
System.out.println(not);
}
}
In C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int GetMedian(int f[], int d);
int main() {
int n, d;
scanf("%d %d", &n, &d);
int s[n];
int i;
for(i = 0; i < n; i++) {
scanf("%d", &s[i]);
}
int frequency[201];
for(i = 0; i < 201; i++) {
frequency[i] = 0;
}
for(i = 0; i < d; i++) {
frequency[s[i]]++;
}
int m[n];
m[d] = GetMedian(frequency, d);
for(i = d + 1; i < n; i++) {
frequency[s[i-1]]++;
frequency[s[i-d-1]]--;
m[i] = GetMedian(frequency, d);
}
int not = 0;
for(i = d; i < n; i++) {
if(s[i] >= m[i]){
not++;
}
}
printf("%d", not);
return 0;
}
int GetMedian(int f[], int d) {
int Median;
if(d % 2 == 0) {
int mid = d/2;
int cF = 0;
for(int i = 0; i < 201; i ++) {
cF += f[i];
if(cF > mid) {
Median = 2*i;
break;
}
else if(cF == mid) {
for(int j = i + 1; j < 201; j++) {
if(f[j] != 0) {
//printf("\n%d %d\n", i, j);
Median = i + j;
break;
}
}
break;
}
}
}
else {
int mid = d/2 + 1;
int cF = 0;
for(int i = 0; i < 201; i++) {
cF += f[i];
if(cF >= mid) {
Median = 2*i;
break;
}
}
}
//printf("%d", Median);
return Median;
}
In Python3 :
n,d = map(int,input().strip().split())
exp = list(map(int, input().strip().split()))
count = {}
i = 0
while i<d:
x = exp[i]
if x not in count:
count[x] = 0
count[x] += 1
i+=1
def median():
global count
cnt,midval = 0,0
for i in range(201):
if i in count:
cnt += count[i]
if cnt >= d//2:
midval = i
break
secondval = midval
if cnt == d//2:
x = midval + 1
while x not in count or count[x] == 0:
x+=1
secondval = x
if d%2==1:
return secondval
return (midval + secondval)/2
ans = 0
i-=1
while i<n-1:
md = median()
if exp[i+1] >= 2*md:
ans += 1
count[exp[i+1-d]]-=1
x = exp[i+1]
if x not in count:
count[x] = 0
count[x]+=1
i+=1
print (ans)
View More Similar Problems
Pair Sums
Given an array, we define its value to be the value obtained by following these instructions: Write down all pairs of numbers from this array. Compute the product of each pair. Find the sum of all the products. For example, for a given array, for a given array [7,2 ,-1 ,2 ] Note that ( 7 , 2 ) is listed twice, one for each occurrence of 2. Given an array of integers, find the largest v
View Solution →Lazy White Falcon
White Falcon just solved the data structure problem below using heavy-light decomposition. Can you help her find a new solution that doesn't require implementing any fancy techniques? There are 2 types of query operations that can be performed on a tree: 1 u x: Assign x as the value of node u. 2 u v: Print the sum of the node values in the unique path from node u to node v. Given a tree wi
View Solution →Ticket to Ride
Simon received the board game Ticket to Ride as a birthday present. After playing it with his friends, he decides to come up with a strategy for the game. There are n cities on the map and n - 1 road plans. Each road plan consists of the following: Two cities which can be directly connected by a road. The length of the proposed road. The entire road plan is designed in such a way that if o
View Solution →Heavy Light White Falcon
Our lazy white falcon finally decided to learn heavy-light decomposition. Her teacher gave an assignment for her to practice this new technique. Please help her by solving this problem. You are given a tree with N nodes and each node's value is initially 0. The problem asks you to operate the following two types of queries: "1 u x" assign x to the value of the node . "2 u v" print the maxim
View Solution →Number Game on a Tree
Andy and Lily love playing games with numbers and trees. Today they have a tree consisting of n nodes and n -1 edges. Each edge i has an integer weight, wi. Before the game starts, Andy chooses an unordered pair of distinct nodes, ( u , v ), and uses all the edge weights present on the unique path from node u to node v to construct a list of numbers. For example, in the diagram below, Andy
View Solution →Heavy Light 2 White Falcon
White Falcon was amazed by what she can do with heavy-light decomposition on trees. As a resut, she wants to improve her expertise on heavy-light decomposition. Her teacher gave her an another assignment which requires path updates. As always, White Falcon needs your help with the assignment. You are given a tree with N nodes and each node's value Vi is initially 0. Let's denote the path fr
View Solution →