Add stub write-ups for the remaining non-premium JavaScript problems (#402)

These will be filled out in the near future!

Author: miorel

workspaces/javascript-leetcode-month/README.md

@@ -7,37 +7,37 @@ This directory contains the resources for the month of JavaScript on LeetCode, a
 1. [2703. Return Length of Arguments Passed](problems/2703-return-length-of-arguments-passed/)
 2. [2727. Is Object Empty](problems/2727-is-object-empty/)
 3. [2677. Chunk Array](problems/2677-chunk-array/)
-4. [2635. Apply Transform Over Each Element in Array](https://leetcode.com/problems/apply-transform-over-each-element-in-array/)
-5. [2634. Filter Elements from Array](https://leetcode.com/problems/filter-elements-from-array/)
-6. [2724. Sort By](https://leetcode.com/problems/sort-by/)
-7. [2626. Array Reduce Transformation](https://leetcode.com/problems/array-reduce-transformation/)
-8. [2726. Calculator with Method Chaining](https://leetcode.com/problems/calculator-with-method-chaining/)
-9. [2625. Flatten Deeply Nested Array](https://leetcode.com/problems/flatten-deeply-nested-array/)
-10. [2667. Create Hello World Function](https://leetcode.com/problems/create-hello-world-function/)
-11. [2620. Counter](https://leetcode.com/problems/counter/)
-12. [2665. Counter II](https://leetcode.com/problems/counter-ii/)
-13. [2666. Allow One Function Call](https://leetcode.com/problems/allow-one-function-call/)
-14. [2704. To Be Or Not To Be](https://leetcode.com/problems/to-be-or-not-to-be/)
-15. [2619. Array Prototype Last](https://leetcode.com/problems/array-prototype-last/)
-16. [2631. Group By](https://leetcode.com/problems/group-by/)
-17. [2624. Snail Traversal](https://leetcode.com/problems/snail-traversal/)
-18. [2722. Join Two Arrays by ID](https://leetcode.com/problems/join-two-arrays-by-id/)
-19. [2629. Function Composition](https://leetcode.com/problems/function-composition/)
-20. [2695. Array Wrapper](https://leetcode.com/problems/array-wrapper/)
-21. [2705. Compact Object](https://leetcode.com/problems/compact-object/)
-22. [2648. Generate Fibonacci Sequence](https://leetcode.com/problems/generate-fibonacci-sequence/)
-23. [2649. Nested Array Generator](https://leetcode.com/problems/nested-array-generator/)
-24. [2621. Sleep](https://leetcode.com/problems/sleep/)
-25. [2715. Timeout Cancellation](https://leetcode.com/problems/timeout-cancellation/)
-26. [2725. Interval Cancellation](https://leetcode.com/problems/interval-cancellation/)
-27. [2622. Cache With Time Limit](https://leetcode.com/problems/cache-with-time-limit/)
-28. [2627. Debounce](https://leetcode.com/problems/debounce/)
-29. [2623. Memoize](https://leetcode.com/problems/memoize/)
-30. [2694. Event Emitter](https://leetcode.com/problems/event-emitter/)
-31. [2723. Add Two Promises](https://leetcode.com/problems/add-two-promises/)
-32. [2637. Promise Time Limit](https://leetcode.com/problems/promise-time-limit/)
-33. [2721. Execute Asynchronous Functions in Parallel](https://leetcode.com/problems/execute-asynchronous-functions-in-parallel/)
-34. [2650. Design Cancellable Function](https://leetcode.com/problems/design-cancellable-function/)
-35. [2618. Check if Object Instance of Class](https://leetcode.com/problems/check-if-object-instance-of-class/)
-36. [2693. Call Function with Custom Context](https://leetcode.com/problems/call-function-with-custom-context/)
-37. [2630. Memoize II](https://leetcode.com/problems/memoize-ii/)
+4. [2635. Apply Transform Over Each Element in Array](problems/2635-apply-transform-over-each-element-in-array/)
+5. [2634. Filter Elements from Array](problems/2634-filter-elements-from-array/)
+6. [2724. Sort By](problems/2724-sort-by/)
+7. [2626. Array Reduce Transformation](problems/2626-array-reduce-transformation/)
+8. [2726. Calculator with Method Chaining](problems/2726-calculator-with-method-chaining/)
+9. [2625. Flatten Deeply Nested Array](problems/2625-flatten-deeply-nested-array/)
+10. [2667. Create Hello World Function](problems/2667-create-hello-world-function/)
+11. [2620. Counter](problems/2620-counter/)
+12. [2665. Counter II](problems/2665-counter-ii/)
+13. [2666. Allow One Function Call](problems/2666-allow-one-function-call/)
+14. [2704. To Be Or Not To Be](problems/2704-to-be-or-not-to-be/)
+15. [2619. Array Prototype Last](problems/2619-array-prototype-last/)
+16. [2631. Group By](problems/2631-group-by/)
+17. [2624. Snail Traversal](problems/2624-snail-traversal/)
+18. [2722. Join Two Arrays by ID](problems/2722-join-two-arrays-by-id/)
+19. [2629. Function Composition](problems/2629-function-composition/)
+20. [2695. Array Wrapper](problems/2695-array-wrapper/)
+21. [2705. Compact Object](problems/2705-compact-object/)
+22. [2648. Generate Fibonacci Sequence](problems/2648-generate-fibonacci-sequence/)
+23. [2649. Nested Array Generator](problems/2649-nested-array-generator/)
+24. [2621. Sleep](problems/2621-sleep/)
+25. [2715. Timeout Cancellation](problems/2715-timeout-cancellation/)
+26. [2725. Interval Cancellation](problems/2725-interval-cancellation/)
+27. [2622. Cache With Time Limit](problems/2622-cache-with-time-limit/)
+28. [2627. Debounce](problems/2627-debounce/)
+29. [2623. Memoize](problems/2623-memoize/)
+30. [2694. Event Emitter](problems/2694-event-emitter/)
+31. [2723. Add Two Promises](problems/2723-add-two-promises/)
+32. [2637. Promise Time Limit](problems/2637-promise-time-limit/)
+33. [2721. Execute Asynchronous Functions in Parallel](problems/2721-execute-asynchronous-functions-in-parallel/)
+34. [2650. Design Cancellable Function](problems/2650-design-cancellable-function/)
+35. [2618. Check if Object Instance of Class](problems/2618-check-if-object-instance-of-class/)
+36. [2693. Call Function with Custom Context](problems/2693-call-function-with-custom-context/)
+37. [2630. Memoize II](problems/2630-memoize-ii/)

workspaces/javascript-leetcode-month/problems/2618-check-if-object-instance-of-class/README.md

@@ -0,0 +1,5 @@
+# 2618. Check if Object Instance of Class
+
+[View Problem on LeetCode](https://leetcode.com/problems/check-if-object-instance-of-class/)
+
+Once you've worked on the problem, check out [the full write-up and solution](solution.md)!

workspaces/javascript-leetcode-month/problems/2618-check-if-object-instance-of-class/solution.md

@@ -0,0 +1,17 @@
+# 2618. Check if Object Instance of Class
+
+[View this Write-up on LeetCode TODO](https://leetcode.com/problems/check-if-object-instance-of-class/solutions/) | [View Problem on LeetCode](https://leetcode.com/problems/check-if-object-instance-of-class/)
+
+> [!WARNING]  
+> This page includes spoilers. For a spoiler-free introduction to the problem, see [the README file](README.md).
+
+## Summary
+
+## Background
+
+## Solutions
+
+## Answers to Bonus Questions
+
+> [!TIP]  
+> Thanks for reading! If you enjoyed this write-up, feel free to [up-vote it on LeetCode TODO](https://leetcode.com/problems/check-if-object-instance-of-class/solutions/)! 🙏

workspaces/javascript-leetcode-month/problems/2619-array-prototype-last/README.md

@@ -0,0 +1,5 @@
+# 2619. Array Prototype Last
+
+[View Problem on LeetCode](https://leetcode.com/problems/array-prototype-last/)
+
+Once you've worked on the problem, check out [the full write-up and solution](solution.md)!

workspaces/javascript-leetcode-month/problems/2619-array-prototype-last/solution.md

@@ -0,0 +1,17 @@
+# 2619. Array Prototype Last
+
+[View this Write-up on LeetCode TODO](https://leetcode.com/problems/array-prototype-last/solutions/) | [View Problem on LeetCode](https://leetcode.com/problems/array-prototype-last/)
+
+> [!WARNING]  
+> This page includes spoilers. For a spoiler-free introduction to the problem, see [the README file](README.md).
+
+## Summary
+
+## Background
+
+## Solutions
+
+## Answers to Bonus Questions
+
+> [!TIP]  
+> Thanks for reading! If you enjoyed this write-up, feel free to [up-vote it on LeetCode TODO](https://leetcode.com/problems/array-prototype-last/solutions/)! 🙏

workspaces/javascript-leetcode-month/problems/2620-counter/README.md

@@ -0,0 +1,5 @@
+# 2620. Counter
+
+[View Problem on LeetCode](https://leetcode.com/problems/counter/)
+
+Once you've worked on the problem, check out [the full write-up and solution](solution.md)!

workspaces/javascript-leetcode-month/problems/2620-counter/solution.md

@@ -0,0 +1,17 @@
+# 2620. Counter
+
+[View this Write-up on LeetCode TODO](https://leetcode.com/problems/counter/solutions/) | [View Problem on LeetCode](https://leetcode.com/problems/counter/)
+
+> [!WARNING]  
+> This page includes spoilers. For a spoiler-free introduction to the problem, see [the README file](README.md).
+
+## Summary
+
+## Background
+
+## Solutions
+
+## Answers to Bonus Questions
+
+> [!TIP]  
+> Thanks for reading! If you enjoyed this write-up, feel free to [up-vote it on LeetCode TODO](https://leetcode.com/problems/counter/solutions/)! 🙏

workspaces/javascript-leetcode-month/problems/2621-sleep/README.md

@@ -0,0 +1,5 @@
+# 2621. Sleep
+
+[View Problem on LeetCode](https://leetcode.com/problems/sleep/)
+
+Once you've worked on the problem, check out [the full write-up and solution](solution.md)!

workspaces/javascript-leetcode-month/problems/2621-sleep/solution.md

@@ -0,0 +1,17 @@
+# 2621. Sleep
+
+[View this Write-up on LeetCode TODO](https://leetcode.com/problems/sleep/solutions/) | [View Problem on LeetCode](https://leetcode.com/problems/sleep/)
+
+> [!WARNING]  
+> This page includes spoilers. For a spoiler-free introduction to the problem, see [the README file](README.md).
+
+## Summary
+
+## Background
+
+## Solutions
+
+## Answers to Bonus Questions
+
+> [!TIP]  
+> Thanks for reading! If you enjoyed this write-up, feel free to [up-vote it on LeetCode TODO](https://leetcode.com/problems/sleep/solutions/)! 🙏

workspaces/javascript-leetcode-month/problems/2622-cache-with-time-limit/README.md

@@ -0,0 +1,5 @@
+# 2622. Cache With Time Limit
+
+[View Problem on LeetCode](https://leetcode.com/problems/cache-with-time-limit/)
+
+Once you've worked on the problem, check out [the full write-up and solution](solution.md)!