### Communities

tag:snake search within a tag
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
created:<1w created < 1 week ago
post_type:xxxx type of post
Challenges

# Cumulative Counts

+11
−0

## Challenge

Given an array of numbers return the cumulative count of each item.

This is the number of times an item has occurred so far.

## Examples

[1,1,2,2,2,1,1,1,3,3] -> [1,2,1,2,3,3,4,5,1,2]
[3,7,5,4,9,2,3,2,6,6] -> [1,1,1,1,1,1,2,2,1,2]


Brownie points for beating my 7 byte APL answer.

Why does this post require moderator attention?
Why should this post be closed?

+3
−0

# Jelly, 4 bytes

¹Ƥċ"


Try it online!

   "    For each element of the input,
ċ     how many times does it occur in
¹Ƥ "    the corresponding prefix of the input?

Why does this post require moderator attention?

+3
−0

# APL (Dyalog Unicode), 11 bytes (SBCS)

1 1∘⍉+\∘.=⍨


Try it online!

This was a fun APL exercise. Working on figuring out how to get it down to 7 bytes.

Why does this post require moderator attention?

+3
−0

# BQN, 5 bytes

1+⊒


Try it here!

3 characters, but, as there's no SBCS codepage for BQN, it must be counted as UTF-8.

Two of the three characters are just adding one to the built-in that almost solves the challenge too.

Why does this post require moderator attention?

+2
−0

# Japt, 1411 8 bytes

£¯YÄ è¥X


Try it

-3 bytes thanks to @Shaggy

Why does this post require moderator attention?

+2
−0

# APL (Dyalog Unicode), 11 7 bytes (SBCS)

Razetime and rak1507 came up with 7 byte equivalents of my original dfn (this one's rak1507's). See their solutions below.

+/¨⊢=,\


Try it online!

+/¨⊢=,\
,\ ⍝ Prefixes of the list
=   ⍝ Compare every prefix
⊢   ⍝ to the corresponding element in the original list
+/     ⍝ Sum each to get a count of how many elements in each prefix match

Why does this post require moderator attention?

+1
−0

# Scala 3, 50 44 bytes

? => ?.indices zip?map(?take _+1 count _.==)


Try it in Scastie!

This is an annoying, stupid approach. The more elegant one using inits was much longer (x=>x.inits.toSeq.reverse.tail zip x map(_ count _.==)).

? =>   //The input
?.indices //The indices
zip ?   //Zip them with the elements of the input
.map(   //For every index i and the corresponding element x,
? take _+1   //Take the first i+1 elements of the input
count        //Count how many of them
_.==)        //Are equal to the element x

Why does this post require moderator attention?

+1
−0

# Jelly, 7 bytes

=þÄŒDḢ


Try it online!

Why does this post require moderator attention?

+1
−0

# Ruby, 36 bytes

->a{i=-1;a.map{a[0..i+=1].count _1}}


Try it online!

The code in the TIO link is 2 bytes longer because _n block parameter names are not supported on TIO's Ruby instance yet. It will work the same, however. The code is:

->a{i=-1;a.map{a[0..i+=1].count a[i]}}

Why does this post require moderator attention?

+1
−0

# Husk, 4 bytes

Sz#ḣ


Try it online!

## Explanation

Sz#ḣ
Sz   zip the input
ḣ with its prefixes
#  using the count function
Why does this post require moderator attention?

+1
−0

# JavaScript (Node.js), 3429 26 bytes

-5 bytes thanks to Shaggy's suggestion on a similar challenge

-3 bytes again thanks to Shaggy!

a=>a.map(d=v=>d[v]=-~d[v])


Try it online!

Why does this post require moderator attention?

+0
−0

# Python 3, 74 bytes

def f(a):
d={x:0 for x in a};r=[]
for x in a:d[x]+=1;r+=[d[x]]
return r


Try it online!

Why does this post require moderator attention?

+0
−0

# Vyxal, 4 bytes

KƛtO


Try it Online!

## Explained

KƛtO
Kƛ     # For each prefix of the input
tO   #   How many times does the tail occur in the prefix?

Why does this post require moderator attention?

+0
−0

# Ruby, 31 bytes

->a{a.map{$*[_1]=1.+$*[_1]||0}}


Try this online!

\$* is a global variable, so calling this lambda multiple times (in a single process) would give wrong result. A 32 bytes version that does not rely on a global state:

->a,*c{a.map{c[_1]=1.+c[_1]||0}}


If array consists of positive integers from a known range (lets say 0...1e3, then 30 bytes version is:

->a{b=[0]*1e3;a.map{b[_1]+=1}}

Why does this post require moderator attention?

+0
−0

# Python 3, 70 bytes

def f(a):
d={};r=[]
for x in a:d[x]=d.get(x,0)+1;r+=[d[x]]
return r


Try it online!

Why does this post require moderator attention?

+0
−0

# Factor, 122 bytes

USING: kernel sequences sequences.windowed ;
IN: c
: c ( s -- s ) dup length [ dup last [ = ] curry count ] rolling-map ;

Why does this post require moderator attention?

+0
−0

# Python 3.8 (pre-release), 69 bytes

def f(x,y={},z=[]):
for i in x:y[i]=y.get(i,0)+1;z+=[y[i]]
return z


Try it online!

Bonus: theoretical answer if python allowed named assignment with subscript (54 bytes)

lambda x,y={}:[y[i]:=y[i]+1if i in y else 1for i in x]

Why does this post require moderator attention?

+0
−0

# J, 24 char

([: +/ [: (* +/\ )"1 ~. ="0 1 ])

Sample Runs

   ([:+/[:(*+/\)"1~.="0 1]) 1 1 2 2 2 1 1 1 3 3
1 2 1 2 3 3 4 5 1 2

([:+/[:(*+/\)"1~.="0 1]) 3 7 5 4 9 2 3 2 6 6
1 1 1 1 1 1 2 2 1 2

Why does this post require moderator attention?

+0
−0

# J, 9 bytes

1#.]=&><\


This is the 7 byte APL solve but makes use of #. in place of +/"1. I came up with 1#.]=[\` first, but bubbler pointed out it breaks when non zeros are present.

Attempt it online!

Why does this post require moderator attention?