Zip uneven lists

Question

In this challenge you will take two lists as input and you will zip them. The zip can be defined with this recursive expression:

\$ \mathrm{zip}(a,b) = \begin{cases} \left[\,\,\right] & a = \left[\,\,\right] \\ [a_0]\mid\mid\mathrm{zip}(b, t) & a = [a_0] \mid\mid t \end{cases} \$

or this Haskell program if you would like:

zip [] _ = []
zip (x:xs) ys = x : zip ys xs

In simple terms you create a list which alternates between elements of the two input lists, starting with the first element of the first list, then the first element of the second list and so on, until one of the lists doesn't have the next element, then you stop.

For example if we zip [1,2,3,4,5] and [11,12,13] we get [1,11,2,12,3,13,4]. Every element appears in the output except 5, which is missing because the second list ran out before we reached it.

Task

As input you will take two lists of positive integers and output the result of zipping them as described above. I use the term "first" and "second" when referring to the inputs, but you may take the two lists in the opposite order (although this choice must be consistent, you cannot e.g. swap the order of the inputs depending on what they are).

This is code-golf so the goal is to minimize your source code as scored in bytes.

Test cases

[] [] -> []
[] [1,2,3] -> []
[1,2,3] [] -> [1]
[1,2] [3] -> [1,3,2]
[1,2,3,4,5] [11, 12, 13] -> [1,11,2,12,3,13,4]
[9,9,9] [8,8,8] -> [9,8,9,8,9,8]
[1,2,3] [4,5,6,7] -> [1,4,2,5,3,6]

As a word of advice if your language has a built-in which solves the task try and solve the task without the builtin and post both solutions as a single answer. It's more interesting to read solutions like that and it will almost certainly be more fun for you to golf.

@Adám "As input you will take two lists of positive integers". — Wheat Wizard, Mar 13, 2022 at 13:23

pxeger · Accepted Answer · 2022-03-13 11:40:16Z

9

Python 2, 32 bytes

def f(X,Y):print X.pop(0);f(Y,X)

Attempt This Online!

Ends with an error.

Python, 35 bytes

f=lambda X,Y:X and X[:1]+f(Y,X[1:])

Attempt This Online!

No error.

Whython, 33 bytes

f=lambda X,Y:[X.pop(0)]+f(Y,X)?[]

Attempt This Online!

edited Mar 13, 2022 at 11:40

answered Mar 13, 2022 at 10:45

pxeger

23.3k4 gold badges52 silver badges135 bronze badges

\$\begingroup\$ 35 bytes for the first one. \$\endgroup\$
– ophact
Mar 13, 2022 at 10:53

Add a comment |

Kevin Cruijssen · Accepted Answer · 2022-03-14 07:36:25Z

05AB1E, 6 5 bytes

ζ˜#R`

Input-lists in reversed order.

1 byte is added to deal with the edge case of two empty input-lists, which otherwise would result in an empty string. Otherwise the two trailing bytes could have been н (pop and push first inner list) instead.

Try it online or verify all test cases.

Explanation:

ζ      # Zip/transpose the two (implicit) input-lists, with space " " as filler
 ˜     # Flatten this list of pairs
  #    # Split it on spaces
   R   # Reverse the list of lists
    `  # Pop and push the lists to the stack
       # (after which the top list is output implicitly,
       # or the (implicit) input-list if both lists were empty)

pxeger · Accepted Answer · 2022-03-13 11:35:03Z

5

Haskell, 19 bytes

(a:x)#y=a:y#x
o#_=o

Attempt This Online!

edited Mar 13, 2022 at 11:35

answered Mar 13, 2022 at 10:54

pxeger

23.3k4 gold badges52 silver badges135 bronze badges

Add a comment |

Aiden Chow · Accepted Answer · 2022-09-03 08:06:53Z

5

+400

Prolog (SWI), 37 28 bytes

-9 bytes thanks to @DLosc

[H|T]+B+[H|Y]:-B+T+Y.
A+_+A.

Try it online!

Port of the Haskell solution.

edited Sep 3, 2022 at 8:06

answered Sep 3, 2022 at 5:44

Aiden Chow

12.7k1 gold badge14 silver badges53 bronze badges

Add a comment |

pajonk · Accepted Answer · 2022-03-13 19:53:14Z

4

R, 36 bytes

f=\(a,b)if(sum(a))c(a[1],f(b,a[-1]))

Attempt This Online!

Slightly longer, but without recursion:

R, 43 bytes

\(a,b,x=rbind(c(a,0),c(b,0)))x[!cumsum(!x)]

Attempt This Online!

edited Mar 13, 2022 at 19:53

answered Mar 13, 2022 at 12:31

pajonk

15.1k3 gold badges21 silver badges65 bronze badges

Add a comment |

Jonah · Accepted Answer · 2022-03-13 17:23:05Z

3

J, ^{19 18 17} 16 bytes

0(i.~{.]),@|:@,:

Try it online!

-1 thanks to ovs!

Consider 1 2 3 4 f 8 9:

,: Laminate with 0-fill:
```
1 2 3 4
8 9 0 0
```
|:@ Transpose:
```
1 8
2 9
3 0
4 0
```
,@ Flatten:
```
1 8 2 9 3 0 4 0
```
0(i.~{.[) Take everything up to the first 0:
```
1 8 2 9 3
```

edited Mar 13, 2022 at 17:23

answered Mar 13, 2022 at 17:01

Jonah

33k4 gold badges38 silver badges92 bronze badges

1

\$\begingroup\$ 16: 0(i.~{.]),@|:@,: \$\endgroup\$
– ovs
Mar 13, 2022 at 17:18
\$\begingroup\$ Very nice. Now we're tied with APL. \$\endgroup\$
– Jonah
Mar 13, 2022 at 17:23
\$\begingroup\$ For now ;) APL can be a bit shorter (I have 11) if it relies on no 0's in the input. \$\endgroup\$
– ovs
Mar 13, 2022 at 17:26

Add a comment |

Neil · Accepted Answer · 2022-03-13 10:52:23Z

Retina 0.8.2, 40 bytes

^
;
+`;(\d+),?(.*);(.*)
$1,;$3;$2
,?;.*

Try it online! Link includes test cases. Explanation:

^
;

Start with an empty output list.

+`

Until the first input list is empty, ...

;(\d+),?(.*);(.*)

... match the first element of the first input list, the rest of the first input list and the second input list, and...

$1,;$3;$2

... move the first element of the input list to the output list and swap the rest of the first input list with the second list.

,?;.*

Delete the input lists.

Adám · Accepted Answer · 2022-03-13 13:14:05Z

2

APL (Dyalog Unicode), 16 bytes

Anonymous tacit prefix function taking a list of two lists.

((>+2×⌊)/≢¨)⍴⍉∘↑

Try it online!

answered Mar 13, 2022 at 13:14

Adám

29.9k2 gold badges119 silver badges286 bronze badges

Add a comment |

Razetime · Accepted Answer · 2022-03-13 13:15:51Z

2

Perl 6, 51 bytes

sub f(@a,@b){if @a {@a[0],|f(@b,@a[1..*])}else{()}}

Try it online!

answered Mar 13, 2022 at 13:15

Razetime

27k3 gold badges26 silver badges71 bronze badges

Add a comment |

DLosc · Accepted Answer · 2022-03-13 21:33:01Z

HBL, 6.5 bytes

?.(211.'?,(2.

The branch macro isn't implemented in the online interpreter at the moment, so here's a 7.5-byte equivalent without it:

?.(1(1.)('?,(2.

Try it!

Explanation

The longer version implements the spec directly:

?.(1(1.)('?,(2.
?                If
 .               The first argument is truthy:
  (1               Cons
    (1.)           The head of the first argument to
        ('?        A recursive call with
           ,       The second argument and
            (2.    The tail of the first argument
                 Otherwise, return the first argument (empty list)

The branch macro (2, in golfed HBL) takes several expressions and restructures them into a function call with two arguments. With six expressions, it works like this:

(2 a b c d e f)  ->  (a (b c) (d e f))

In this case, we have:

2 1 1 . '? , (2.)  ->  (1 (1 .) ('? , (2.)))

G B · Accepted Answer · 2022-03-14 09:13:07Z

2

Ruby, 32 bytes

f=->a,b{r,*a=a;r ?[r,*f[b,a]]:a}

Try it online!

answered Mar 14, 2022 at 9:13

G B

21.3k1 gold badge19 silver badges51 bronze badges

Add a comment |

Aiden Chow · Accepted Answer · 2022-03-27 11:01:55Z

Desmos, 139 bytes

l=[1...a.length+b.length]
g(A)=join(A,0l)[ceil(l/2)]
L=\{\mod(l,2)=1:g(a),g(b)\}
f(a,b)=\{a.\length=0:a,L[1...\min(\{L=0:l,l.\max+1\})-1]\}

Holy crap, it took me forever for me to get an actually working solution for this challenge in Desmos. I don't know if I'm severely overcomplicating this or what, but I got it to work so...

¯\_(ツ)_/¯

I'll see if I can golf this some more later, too tired to think about this right now :P

Try It On Desmos!

Try It On Desmos! - Prettified

Wheat Wizard · Accepted Answer · 2022-04-05 12:42:05Z

2

Curry (PAKCS), 21 bytes

(a:b)#c=a:c#b
[]#_=[]

Try it online!

The Haskell answer almost works in Curry, but because of non-determinism it matches any prefix of the result. We can restrain it by adding two more bytes.

answered Apr 5, 2022 at 12:42

Wheat Wizard♦

96.5k19 gold badges276 silver badges638 bronze badges

Add a comment |

Graham · Accepted Answer · 2022-03-13 11:11:24Z

1

APL+WIN, 27 bytes

Prompts for two lists as a nested vector

(^\0≠v)/v←,⍉⊃(⌈/⍴¨v)↑¨v←,¨⎕

Try it online! Thanks to Dyalog APL Classic

answered Mar 13, 2022 at 11:11

Graham

5,43613 silver badges11 bronze badges

\$\begingroup\$ Fails on (0 0 0)(1 1 1) \$\endgroup\$
– Adám
Mar 13, 2022 at 13:17
\$\begingroup\$ @Adám Is zero a positive integer. You did not get a "positive" answer to you question of 2 minutes ago \$\endgroup\$
– Graham
Mar 13, 2022 at 13:29
\$\begingroup\$ Yeah, I'm "frantically" trying to get a precise answer from OP. \$\endgroup\$
– Adám
Mar 13, 2022 at 13:30

Add a comment |

Neil · Accepted Answer · 2022-03-13 11:32:09Z

1

Charcoal, 13 bytes

ＵＭθ⮌ιＷ§θⅉ⟦Ｉ⊟ι

Try it online! Takes input as a pair of lists. Explanation:

ＵＭθ⮌ι

Reverse each of the two lists.

Ｗ§θⅉ

Cyclically index the lists according to the number of values already output and repeat until that list is empty.

⟦Ｉ⊟ι

Output the "next" value from that list on its own line.

answered Mar 13, 2022 at 11:32

Neil

166k12 gold badges69 silver badges273 bronze badges

Add a comment |

Jonathan Allan · Accepted Answer · 2022-03-13 13:43:40Z

1

Jelly, 5 bytes

Uses Kevin Cruijssen's method from their 05AB1E answer.

z⁶FḲḢ

A monadic Link that accepts a pair of lists, [a, b], and yields a zipped list.

Try it online! Or see the test-suite.

How?

z⁶FḲḢ - Link: pair of lists [a,b]
 ⁶    - space character
z     - transpose [a,b] with space-filler
  F   - flatten
   Ḳ  - split at spaces
    Ḣ - head

edited Mar 13, 2022 at 13:43

answered Mar 13, 2022 at 13:35

Jonathan Allan

104k7 gold badges62 silver badges270 bronze badges

Add a comment |

chunes · Accepted Answer · 2022-03-13 14:55:03Z

1

Factor, 43 39 bytes

[ f pad-longest vmerge { f } split1 . ]

Try it online!

Explanation

                ! { 1 2 3 4 5 } { 11 12 13 }
f               ! { 1 2 3 4 5 } { 11 12 13 } f
pad-longest     ! { 1 2 3 4 5 } { 11 12 13 f f }
vmerge          ! { 1 11 2 12 3 13 4 f 5 f }
{ f }           ! { 1 11 2 12 3 13 4 f 5 f } { f }
split1          ! { 1 11 2 12 3 13 4 } { 5 f }
.               ! { 1 11 2 12 3 13 4 }

edited Mar 13, 2022 at 14:55

answered Mar 13, 2022 at 14:34

chunes

22.8k3 gold badges21 silver badges51 bronze badges

Add a comment |

Arnauld · Accepted Answer · 2022-03-13 15:07:34Z

1

JavaScript (ES6), 33 bytes

f=([v,...a],b)=>v?[v,...f(b,a)]:a

Try it online!

answered Mar 13, 2022 at 15:07

Arnauld

188k20 gold badges171 silver badges630 bronze badges

Add a comment |

Dominic van Essen · Accepted Answer · 2022-03-13 15:45:23Z

Husk, 5 bytes

↑_ΣT0

Try it online!

Input is list of the two lists.

Transposes using 0 to fill shorter rows, flattens (Σ) the result, and ↑ takes the longest prefix with all elements that are truthy using the function _ (=negate; it would have been more-intuitive to use the Identity function here, but for reasons that I don't understand this doesn't seem to work).

Pretty-much the same approach as Kevin Cruijssen's answer but independently found.

Note that the Husk interpreter will not accept input consisting of only empty lists, presumably since it's unable to infer their type. The TIO link above successfully runs all the test cases (including the first, only-empty-lists one), since these are grouped together and run side-by-side, allowing the interpreter to infer that all lists are of numbers; but it fails when given the first test case on its own. I can't currently see a way to avoid this.

xiver77 · Accepted Answer · 2022-03-13 16:36:25Z

x86 machine code (32-bit), 39 bytes

\x31\xC0\x89\xC5\x55\x87\x2C\x24\x39\xCD\x74\x19\xFF\x34\xAE\x8F\x04\x87
\x45\x40\x87\x2C\x24\x39\xD5\x74\x0A\xFF\x34\xAB\x8F\x04\x87\x45\x40\xEB
\xE0\x5D\xC3

Try it online!

The algorithm is quite straightforward, but 32-bit x86 really needs more registers. Some ugly stack hacks are used to cope with the lack of registers.

The test cases in TIO relies on a GCC extension supporting C arrays of length 0. ISO C and C++ forbid 0-length arrays.

Since OP didn't specify the upper bound of integers, I tried to find some clever way using an array of bytes, and interleaving them with pdep or some SSE shuffle instruction, but that ended up using too many bytes.

# edi: dst, esi: arr0, ecx: len0, ebx: arr1, edx: len1
# eax: return, ebp: clobber

0:  31 c0                   xor    eax,eax
2:  89 c5                   mov    ebp,eax
4:  55                      push   ebp
5:  87 2c 24                xchg   DWORD PTR [esp],ebp
8:  39 cd                   cmp    ebp,ecx
a:  74 19                   je     0x25
c:  ff 34 ae                push   DWORD PTR [esi+ebp*4]
f:  8f 04 87                pop    DWORD PTR [edi+eax*4]
12: 45                      inc    ebp
13: 40                      inc    eax
14: 87 2c 24                xchg   DWORD PTR [esp],ebp
17: 39 d5                   cmp    ebp,edx
19: 74 0a                   je     0x25
1b: ff 34 ab                push   DWORD PTR [ebx+ebp*4]
1e: 8f 04 87                pop    DWORD PTR [edi+eax*4]
21: 45                      inc    ebp
22: 40                      inc    eax
23: eb e0                   jmp    0x5
25: 5d                      pop    ebp
26: c3                      ret

alephalpha · Accepted Answer · 2022-03-14 01:00:09Z

1

PARI/GP, 38 bytes

f(a,b)=if(a,concat(a[1],f(b,a[^1])),a)

Attempt This Online!

a[^1] means skiping the first item in a.

answered Mar 14, 2022 at 1:00

alephalpha

46.5k7 gold badges61 silver badges172 bronze badges

Add a comment |

Jonah · Accepted Answer · 2022-03-14 02:06:36Z

1

Bash, 27 bytes

read x<$1&&echo $x&&f $2 $1

Try it online!

Port of pxeger's python solution to Bash.

Input lists are taken as files (one entry per line). Output is one entry per line. Output contains extra blanks, which may be illegal and could be fixed at the price of some bytes, but I liked the simplicity of the translation.

answered Mar 14, 2022 at 2:06

Jonah

33k4 gold badges38 silver badges92 bronze badges

Add a comment |

Julian · Accepted Answer · 2022-03-14 19:41:23Z

1

PowerShell Core, 45 bytes

param($a,$b)for(;$a){$h,$t=$a
$a,$b=$b,$t
$h}

Try it online!

One test case returns 1 instead of [1] as PowerShell tends to flatten arrays

-1 byte thanks to mazzy

edited Mar 14, 2022 at 19:41

answered Mar 13, 2022 at 20:56

Julian

2,6686 silver badges16 bronze badges

1

\$\begingroup\$ nice ConvertTo-Json \$\endgroup\$
– mazzy
Mar 14, 2022 at 8:07
1

\$\begingroup\$ non-recursive Try it online! \$\endgroup\$
– mazzy
Mar 14, 2022 at 8:16

Add a comment |

MarcMush · Accepted Answer · 2022-03-15 09:47:26Z

1

Julia 1.0, 25 bytes

a^b=@show(a[1])b^a[2:end]

Try it online!

prints the values and ends with an error

Julia 1.0, 30 bytes

>(b)=[]
>(b,a,A...)=[a;A>b...]

Try it online!

expects b>a..., returns an actual list

edited Mar 15, 2022 at 9:47

answered Mar 15, 2022 at 9:32

MarcMush

6,26511 silver badges16 bronze badges

Add a comment |

ErikF · Accepted Answer · 2022-03-17 03:15:38Z

1

C (gcc), 68 bytes

Takes 0-terminated arrays as input.

f(a,b)int*a,*b;{for(;*a;!*b?a=b:b++)printf("%d %d "+3*!*b,*a++,*b);}

Try it online!

answered Mar 17, 2022 at 3:15

ErikF

4,5877 silver badges11 bronze badges

Add a comment |

Seggan · Accepted Answer · 2022-03-21 15:59:20Z

Vyxal, 6 bytes

Zf0€÷^

Try it Online!

Looks like 05AB1E beats Vyxal this time. Takes input in reversed order.

Zf0€÷^ # Leaving out this comment makes the explanation kinda feel empty
Z      # Zip the lists
 f     # Flatten
  0€   # Split on 0
    ÷  # Push every item
     ^ # Reverse the stack

Vyxal, 6 bytes

Zf:0ḟẎ

Try it Online!

A slightly different approach. Still 6 bytes.

Zf:0ḟẎ # Leaving out this comment makes the explanation kinda feel empty
Z      # Zip the lists
 f     # Flatten
  :    # Duplicate the top of the stack
   0ḟ  # Index of the first 0
     Ẏ # Take everything up until that index

Vyxal, 5 bytes

Zf0€h

Try it Online!

Takes input in reversed order. Returns 0 for the case of 2 empty lists, so does not meet the spec.

Zf0€h # Leaving out this comment makes the explanation kinda feel empty
Z     # Zip the 2 lists
 f    # Flatten them
  0€  # Split on 0
    h # Get the first item

Shaggy · Accepted Answer · 2023-01-17 17:26:44Z

Japt `-g`, 7 bytes

íV c óÏ

Try it

íV c óÏ     :Implicit input of arrays U & V
íV          :Interleave U with V, padding V with null
   c        :Flatten
     ó      :Partition before elements
      Ï     :That are falsey
            :Implicit input of first element

5 bytes

By taking input as a 2D array, with the order reversed.

ÕcÔóÏ

Try it

ÕcÔóÏ     :Implicit input of 2D array
Õ         :Transpose, padding the first array with null
 c        :Flat map
  Ô       :Reverse
   óÏ     :As above
          :Implicit input of first element

chunes · Accepted Answer · 2023-01-17 07:21:50Z

0

Arturo, 42 bytes

f:$[a,b][([]=a)?->a->@[a\0]++f b drop a 1]

Try it

f:$[a,b][          ; a function f taking two lists a and b
  ([]=a)?          ; is a empty?
  ->a              ; if so, return a
  ->               ; otherwise,
    @[a\0]         ; the first element of a as a list
    ++             ; concatenated with
    f b drop a 1   ; the result of calling f with b and a without its first element
]                  ; end function

answered Jan 17 at 7:21

chunes

22.8k3 gold badges21 silver badges51 bronze badges

Add a comment |

Zip uneven lists

Task

Test cases

28 Answers 28

Python 2, 32 bytes

Python, 35 bytes

Whython, 33 bytes

05AB1E, 6 5 bytes

Haskell, 19 bytes

Prolog (SWI), 37 28 bytes

R, 36 bytes

R, 43 bytes

J, 19 18 17 16 bytes

Retina 0.8.2, 40 bytes

APL (Dyalog Unicode), 16 bytes

Perl 6, 51 bytes

HBL, 6.5 bytes

Explanation

Ruby, 32 bytes

Desmos, 139 bytes

Curry (PAKCS), 21 bytes

APL+WIN, 27 bytes

Charcoal, 13 bytes

Jelly, 5 bytes

How?

Factor, 43 39 bytes

Explanation

JavaScript (ES6), 33 bytes

Husk, 5 bytes

x86 machine code (32-bit), 39 bytes

PARI/GP, 38 bytes

Bash, 27 bytes

PowerShell Core, 45 bytes

Julia 1.0, 25 bytes

Julia 1.0, 30 bytes

C (gcc), 68 bytes

Vyxal, 6 bytes

Vyxal, 6 bytes

Vyxal, 5 bytes

Japt -g, 7 bytes

5 bytes

Arturo, 42 bytes

Your Answer

Sign up or log in

Post as a guest

Not the answer you're looking for? Browse other questions tagged code-golfarray or ask your own question.

Linked

Related

Hot Network Questions

J, ^{19 18 17} 16 bytes

Japt `-g`, 7 bytes

Not the answer you're looking for? Browse other questions tagged
code-golf
array
or ask your own question.