Curry — LeetCode 2632 Python Solution

MediumLeetCode PremiumJavaScript
Problem
#2632
Reading time
2 min

The problem

Given a function fn, return a curried version of that function. A curried function is a function that accepts fewer or an equal number of parameters as the original function and returns either another curried function or the same value the original function would have returned.

Example

Input
fn = function sum(a, b, c) { return a + b + c; }
Output
6
Explanation
The code being executed is:

Complexity

MeasureComplexity
TimeO(n)
SpaceO(1) to O(n) auxiliary

Related problems

Frequently asked questions

How hard is LeetCode 2632. Curry?
LeetCode 2632. Curry is rated Medium on LeetCode.
What topics does LeetCode 2632. Curry cover?
LeetCode 2632. Curry is tagged JavaScript on LeetCode.
Is LeetCode 2632. Curry a premium problem?
Yes. LeetCode 2632. Curry is a LeetCode Premium problem, so the full statement and test cases require a paid LeetCode subscription.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity — invisible to screen sharing.

Get Stealth Interview