목록분류 전체보기 (147)
게으른개발너D
https://leetcode.com/problems/to-be-or-not-to-be/description/ To Be Or Not To Be - LeetCode Can you solve this real interview question? To Be Or Not To Be - Write a function expect that helps developers test their code. It should take in any value val and return an object with the following two functions. * toBe(val) accepts another value and leetcode.com Write a function expect that helps devel..
https://leetcode.com/problems/array-wrapper/description/ Array Wrapper - LeetCode Can you solve this real interview question? Array Wrapper - Create a class ArrayWrapper that accepts an array of integers in it's constructor. This class should have two features: * When two instances of this class are added together with the + operato leetcode.com Create a class ArrayWrapper that accepts an array ..
https://leetcode.com/problems/allow-one-function-call/description/ Allow One Function Call - LeetCode Can you solve this real interview question? Allow One Function Call - Given a function fn, return a new function that is identical to the original function except that it ensures fn is called at most once. * The first time the returned function is calle leetcode.com Given a function fn, return a..
https://leetcode.com/problems/counter-ii/description/ Counter II - LeetCode Can you solve this real interview question? Counter II - Write a function createCounter. It should accept an initial integer init. It should return an object with three functions. The three functions are: * increment() increases the current value by 1 leetcode.com Write a function createCounter. It should accept an initi..
https://leetcode.com/problems/generate-fibonacci-sequence/ Generate Fibonacci Sequence - LeetCode Can you solve this real interview question? Generate Fibonacci Sequence - Write a generator function that returns a generator object which yields the fibonacci sequence. The fibonacci sequence is defined by the relation Xn = Xn-1 + Xn-2. The first few leetcode.com Write a generator function that ret..
https://leetcode.com/problems/promise-time-limit/ Promise Time Limit - LeetCode Can you solve this real interview question? Promise Time Limit - Given an asynchronous function fn and a time t in milliseconds, return a new time limited version of the input function. fn takes arguments provided to the time limited function. The leetcode.com Given an asynchronous function fn and a time t in millise..
https://leetcode.com/problems/apply-transform-over-each-element-in-array/ Apply Transform Over Each Element in Array - LeetCode Can you solve this real interview question? Apply Transform Over Each Element in Array - Given an integer array arr and a mapping function fn, return a new array with a transformation applied to each element. The returned array should be created such t leetcode.com Give..
https://leetcode.com/problems/filter-elements-from-array/ Filter Elements from Array - LeetCode Can you solve this real interview question? Filter Elements from Array - Given an integer array arr and a filtering function fn, return a filtered array filteredArr. The fn function takes one or two arguments: * arr[i] - number from the arr * i - index leetcode.com Given an integer array arr and a fil..