404 Peace Not Found

Sign in Subscribe

Latest

[Leetcode] JS 30 Interval Cancellation

[Leetcode] JS 30 Interval Cancellation

Question Given a function fn, an array of arguments args, and an interval time t, return a cancel function cancelFn. After a delay of cancelTimeMs, the returned cancel function cancelFn will be invoked. setTimeout(cancelFn, cancelTimeMs) The function fn should be called with args immediately and then called again every

[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 =>

[JS] What are reference types?

[JS] What are reference types?

Key Learnings of This Post * Understand what reference types are in javascript and their characteristics. What are reference types? In JavaScript, reference types (also called non-primitive types) are values that are stored in memory by reference, rather than directly containing their value. When you assign or compare a reference type,

[Leetcode] Blind75 Contain duplicate

[Leetcode] Blind75 Contain duplicate

Question 217 hash table Question Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct. Example 1: Input: nums = [1,2,3,1] Output: true Explanation: The element 1 occurs at the indices 0 and

[Leetcode] Blind75 Best time to buy and sell stocks

[Leetcode] Blind75 Best time to buy and sell stocks

Question 121 sliding window/greedy algorithm Question You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future

[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.