Working on JavaScript in 30

Author: Zanger67

README.md

@@ -1,4 +1,4 @@
-# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (406 solved)
+# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (412 solved)
 
 > My LeetCode Profile: [Zanger](https://leetcode.com/u/Zanger/)
 
@@ -403,9 +403,15 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 | 2570 | [Merge Two 2D Arrays by Summing Values](<https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values>)                                                                           | Easy    |                | [solution](<markdowns/_2570. Merge Two 2D Arrays by Summing Values.md>)                                      | c                                |
 | 2582 | [Pass the Pillow](<https://leetcode.com/problems/pass-the-pillow>)                                                                                                                       | Easy    | Daily          | [solution](<markdowns/_2582. Pass the Pillow.md>)                                                            | c, cpp, cs, java, js, py         |
 | 2610 | [Convert an Array Into a 2D Array With Conditions](<https://leetcode.com/problems/convert-an-array-into-a-2d-array-with-conditions>)                                                     | Medium  |                | [solution](<markdowns/_2610. Convert an Array Into a 2D Array With Conditions.md>)                           | py                               |
+| 2620 | [Counter](<https://leetcode.com/problems/counter>)                                                                                                                                       | Easy    |                | [solution](<markdowns/_2620. Counter.md>)                                                                    | js                               |
+| 2634 | [Filter Elements from Array](<https://leetcode.com/problems/filter-elements-from-array>)                                                                                                 | Easy    |                | [solution](<markdowns/_2634. Filter Elements from Array.md>)                                                 | js                               |
+| 2635 | [Apply Transform Over Each Element in Array](<https://leetcode.com/problems/apply-transform-over-each-element-in-array>)                                                                 | Easy    |                | [solution](<markdowns/_2635. Apply Transform Over Each Element in Array.md>)                                 | js                               |
+| 2665 | [Counter II](<https://leetcode.com/problems/counter-ii>)                                                                                                                                 | Easy    |                | [solution](<markdowns/_2665. Counter II.md>)                                                                 | js                               |
+| 2667 | [Create Hello World Function](<https://leetcode.com/problems/create-hello-world-function>)                                                                                               | Easy    |                | [solution](<markdowns/_2667. Create Hello World Function.md>)                                                | js                               |
 | 2671 | [Frequency Tracker](<https://leetcode.com/problems/frequency-tracker>)                                                                                                                   | Medium  |                | [solution](<markdowns/_2671. Frequency Tracker.md>)                                                          | py                               |
 | 2678 | [Number of Senior Citizens](<https://leetcode.com/problems/number-of-senior-citizens>)                                                                                                   | Easy    |                | [solution](<markdowns/_2678. Number of Senior Citizens.md>)                                                  | java                             |
 | 2679 | [Sum in a Matrix](<https://leetcode.com/problems/sum-in-a-matrix>)                                                                                                                       | Medium  |                | [solution](<markdowns/_2679. Sum in a Matrix.md>)                                                            | java                             |
+| 2704 | [To Be Or Not To Be](<https://leetcode.com/problems/to-be-or-not-to-be>)                                                                                                                 | Easy    |                | [solution](<markdowns/_2704. To Be Or Not To Be.md>)                                                         | js                               |
 | 2734 | [Lexicographically Smallest String After Substring Operation](<https://leetcode.com/problems/lexicographically-smallest-string-after-substring-operation>)                               | Medium  |                | [solution](<markdowns/_2734. Lexicographically Smallest String After Substring Operation.md>)                | py                               |
 | 2743 | [Count Substrings Without Repeating Character](<https://leetcode.com/problems/count-substrings-without-repeating-character>)                                                             | Medium  | Weekly Premium | [solution](<markdowns/_2743. Count Substrings Without Repeating Character.md>)                               | java, py                         |
 | 2807 | [Insert Greatest Common Divisors in Linked List](<https://leetcode.com/problems/insert-greatest-common-divisors-in-linked-list>)                                                         | Medium  |                | [solution](<markdowns/_2807. Insert Greatest Common Divisors in Linked List.md>)                             | py                               |