leetcode

Solution to some Leetcode problems written in C++
git clone git://git.dimitrijedobrota.com/leetcode.git
Log | Files | Refs | README | LICENSE

commit d0cb66a4645312979c03b4b2bedbf564bae324fe
parent 79a71b7fa31283cf5540f058578422ca2c48e0f5
Author: Dimitrije Dobrota <mail@dimitrijedobrota.com>
Date:   Mon, 15 May 2023 21:16:28 +0200

JavaScript Challenge: Day 11

Diffstat:
AProblems/2621.js | 9+++++++++
MREADME.md | 1+
2 files changed, 10 insertions(+), 0 deletions(-)

diff --git a/Problems/2621.js b/Problems/2621.js @@ -0,0 +1,9 @@ +/** + * @param {number} millis + */ + +async function sleep(millis) { + return new Promise(resolve => { + setTimeout(resolve, millis); + }); +} diff --git a/README.md b/README.md @@ -541,6 +541,7 @@ for solving problems. | 2492 | Medium | [Minimum Score of a Path Between Two Cities](Problems/2492.cpp) | | 2497 | Medium | [Maximum Star Sum of a Graph](Problems/2497.cpp) | | 2620 | Easy | [Counter](Problems/2620.js) | +| 2621 | Easy | [Sleep](Problems/2621.js) | | 2623 | Medium | [Memoize](Problems/2623.js) | | 2626 | Easy | [Array Reduce Transformation](Problems/2626.js) | | 2629 | Easy | [Function Composition](Problems/2629.js) |