<pre class="shiki github-dark shaku"><code>// This is a JavaScript coding problem from BFE.dev /** * @param { (...args: any[]) =&gt; any } fn * @returns { (...args: any[]) =&gt; any } */function curry(fn){ return function curriedFunction(...arg){ if(arg.length &gt;= fn.length){ return fn(...arg); } else{ return function (...next){ return curriedFunction(...arg,...next); } } }}const join = (a, b, c) =&gt; { return `${a}_${b}_${c}`}const curriedJoin = curry(join)curriedJoin(1, 2, 3) // '1_2_3'curriedJoin(1)(2, 3) // '1_2_3'curriedJoin(1, 2)(3) // '1_2_3'</code></pre>

time and space complexity both are O(N*N)

Amazon

Flipkart

Yandex

xiaomi

Vimeo

Gojek

Currying is a useful technique used in JavaScript applications. Please implement a curry() function, which accepts a function and return a curried one…

lodash

2. implement curry() with placeholder support

1. implement curry()