leetcode

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

commit 9dd307dca2a18a16e9a75d5ee511b20d021bff94
parent b217fbac194589a7e335e0fd4a3f5af91bee7f7d
Author: Dimitrije Dobrota <mail@dimitrijedobrota.com>
Date:   Fri,  5 May 2023 11:35:04 +0200

JavaScript Challenge: Day 1

Diffstat:
AProblems/2667.js | 11+++++++++++
MREADME.md | 3++-
2 files changed, 13 insertions(+), 1 deletion(-)

diff --git a/Problems/2667.js b/Problems/2667.js @@ -0,0 +1,11 @@ +var createHelloWorld = function() { + return function(...args) { + return "Hello World"; + } +}; + +var createHelloWorld = function() { + return () => "Hello World"; +}; + +var createHelloWorld = () => () => "Hello World"; diff --git a/README.md b/README.md @@ -514,7 +514,7 @@ for solving problems. | 2316 | Medium | [Count Unreachable Pairs of Nodes in an Undirected Graph](Problems/2316.cpp) | | 2326 | Medium | [Spiral Matrix IV](Problems/2326.cpp) | | 2331 | Easy | [Evaluate Boolean Binary Tree](Problems/2331.cpp) | -| 2336 | Medium | [Smallest Number in Infinite Set](Problems/2336.cpp) | +| 2336 | Medium | [Smallest Number in Infinite Set](Problems/2336.cpp) | | 2343 | Medium | [Query Kth Smallest Trimmed Number](Problems/2343.cpp) | | 2348 | Medium | [Number of Zero-Filled Subarrays](Problems/2348.cpp) | | 2359 | Medium | [Find Closest Node to Given Two Nodes](Problems/2359.cpp) | @@ -533,3 +533,4 @@ for solving problems. | 2477 | Medium | [Minimum Fuel Cost to Report to the Capital](Problems/2477.cpp) | | 2492 | Medium | [Minimum Score of a Path Between Two Cities](Problems/2492.cpp) | | 2497 | Medium | [Maximum Star Sum of a Graph](Problems/2497.cpp) | +| 2667 | Easy | [Create Hello World Function](Problems/2667.js) |