From 22c272559a869ce967faeba719bff30c902e0a00 Mon Sep 17 00:00:00 2001 From: Sinehye Park Date: Thu, 16 Jun 2022 17:58:50 +0900 Subject: [PATCH] fix: typo (#11736) --- questions/05423-hard-intersection/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/questions/05423-hard-intersection/README.md b/questions/05423-hard-intersection/README.md index b44cc4c31..8013ffc02 100644 --- a/questions/05423-hard-intersection/README.md +++ b/questions/05423-hard-intersection/README.md @@ -1,6 +1,6 @@

Intersection hard #union #array

by Pineapple @Pineapple0919

Take the Challenge

-Implement the type version of Lodash.intersection, but there is a little different, Intersection takes an Array T containing several arrays or any type element that includes the union type, returns a new array containing all incoming array intersection elements. +Implement the type version of Lodash.intersection with a little difference. Intersection takes an Array T containing several arrays or any type element including the union type, and returns a new union containing all intersection elements. ```ts type Res = Intersection<[[1, 2], [2, 3], [2, 2]]>; // expected to be 2