404 Peace Not Found

Sign in Subscribe

Leetcode

[Leetcode] JS 30 Debounce

[Leetcode] JS 30 Debounce

Question Given a function fn and a time in milliseconds t, return a debounced version of that function. A debounced function is a function whose execution is delayed by t milliseconds and whose execution is cancelled if it is called again within that window of time. The debounced function should

[Leetcode] JS 30 Cache With Time Limit

[Leetcode] JS 30 Cache With Time Limit

Question Write a class that allows getting and setting key-value pairs, however a time until expiration is associated with each key. The class has three public methods: set(key, value, duration): accepts an integer key, an integer value, and a duration in milliseconds. Once the duration has elapsed, the key

[Leetcode] JS 30 Promise Time Limit

[Leetcode] JS 30 Promise Time Limit

Question 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 time limited function should follow these rules: * If the fn completes within the time limit of t milliseconds,

[Leetcode] JS 30 Sleep

[Leetcode] JS 30 Sleep

Question Given a positive integer millis, write an asynchronous function that sleeps for millis milliseconds. It can resolve any value. Example 1: Input: millis = 100 Output: 100 Explanation: It should return a promise that resolves after 100ms. let t = Date.now(); sleep(100).then(() => { console.log(Date.now() -

[Leetcode] JS 30 Add two promises

[Leetcode] JS 30 Add two promises

Question Given two promises promise1 and promise2, return a new promise. promise1 and promise2 will both resolve with a number. The returned promise should resolve with the sum of the two numbers. Example 1: Input: promise1 = new Promise(resolve => setTimeout(() => resolve(2), 20)), promise2 = new Promise(resolve =>

[Leetcode] Blind75 twoSum

[Leetcode] Blind75 twoSum

Question 1 Create a hash table Question Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice.

[Leetcode] JS 30 Array Reduce Transformation

[Leetcode] JS 30 Array Reduce Transformation

Question 2626 for...of loop / reduce function Question Given an integer array nums, a reducer function fn, and an initial value init, return the final result obtained by executing the fn function on each element of the array, sequentially, passing in the return value from the calculation on the preceding