📜 Update README table (🛠️ from Github Actions)

Author: Ahmad-A0

Diff for: README.md

@@ -81,7 +81,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0041 - First Missing Positive](https://leetcode.com/problems/first-missing-positive/)</sub> | <sub><div align='center'>[✔️](c%2F0041-first-missing-positive.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0041-first-missing-positive.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0041-first-missing-positive.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0041-first-missing-positive.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0041-first-missing-positive.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0041-first-missing-positive.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0041-first-missing-positive.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0041-first-missing-positive.ts)</div></sub>
 <sub>[1822 - Sign of An Array](https://leetcode.com/problems/sign-of-the-product-of-an-array/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F1822-sign-of-the-product-of-an-array.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1822-sign-of-the-product-of-an-array.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1822-sign-of-the-product-of-an-array.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1822-sign-of-the-product-of-an-array.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F1822-sign-of-the-product-of-an-array.ts)</div></sub>
 <sub>[2215 - Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F2215-find-the-difference-of-two-arrays.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F2215-find-the-difference-of-two-arrays.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F2215-find-the-difference-of-two-arrays.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F2215-find-the-difference-of-two-arrays.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F2215-find-the-difference-of-two-arrays.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F2215-find-the-difference-of-two-arrays.ts)</div></sub>
-<sub>[1603 - Design Parking System](https://leetcode.com/problems/design-parking-system/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F1603-design-parking-system.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1603-design-parking-system.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1603-design-parking-system.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
+<sub>[1603 - Design Parking System](https://leetcode.com/problems/design-parking-system/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F1603-design-parking-system.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1603-design-parking-system.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1603-design-parking-system.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1603-design-parking-system.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[2348 - Number of Zero-Filled Subarrays](https://leetcode.com/problems/number-of-zero-filled-subarrays/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F2348-number-of-zero-filled-subarrays.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F2348-number-of-zero-filled-subarrays.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F2348-number-of-zero-filled-subarrays.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F2348-number-of-zero-filled-subarrays.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[2405 - Optimal Partition of String](https://leetcode.com/problems/optimal-partition-of-string/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F2405-optimal-partition-of-string.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F2405-optimal-partition-of-string.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[1396 - Design Underground System](https://leetcode.com/problems/design-underground-system/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F1396-design-underground-system.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1396-design-underground-system.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1396-design-underground-system.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
@@ -192,7 +192,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0876 - Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)</sub> | <sub><div align='center'>[✔️](c%2F0876-middle-of-the-linked-list.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0876-middle-of-the-linked-list.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0876-middle-of-the-linked-list.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0876-middle-of-the-linked-list.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0876-middle-of-the-linked-list.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0876-middle-of-the-linked-list.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0876-middle-of-the-linked-list.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0876-middle-of-the-linked-list.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0876-middle-of-the-linked-list.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0876-middle-of-the-linked-list.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0876-middle-of-the-linked-list.ts)</div></sub>
 <sub>[0160 - Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/)</sub> | <sub><div align='center'>[✔️](c%2F0160-intersection-of-two-linked-lists.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0160-intersection-of-two-linked-lists.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0160-intersection-of-two-linked-lists.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0160-intersection-of-two-linked-lists.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0160-intersection-of-two-linked-lists.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0160-intersection-of-two-linked-lists.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0160-intersection-of-two-linked-lists.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0143 - Reorder List](https://leetcode.com/problems/reorder-list/)</sub> | <sub><div align='center'>[✔️](c%2F0143-reorder-list.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0143-reorder-list.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0143-reorder-list.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0143-reorder-list.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0143-reorder-list.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0143-reorder-list.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0143-reorder-list.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0143-reorder-list.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0143-reorder-list.ts)</div></sub>
-<sub>[2130 - Maximum Twin Sum Of A Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F2130-maximum-twin-sum-of-a-linked-list.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F2130-maximum-twin-sum-of-a-linked-list.go)</div></sub> | <sub><div align='center'>[✔️](java%2F2130-maximum-twin-sum-of-a-linked-list.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F2130-maximum-twin-sum-of-a-linked-list.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F2130-maximum-twin-sum-of-a-linked-list.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
+<sub>[2130 - Maximum Twin Sum Of A Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F2130-maximum-twin-sum-of-a-linked-list.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F2130-maximum-twin-sum-of-a-linked-list.go)</div></sub> | <sub><div align='center'>[✔️](java%2F2130-maximum-twin-sum-of-a-linked-list.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F2130-maximum-twin-sum-of-a-linked-list.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F2130-maximum-twin-sum-of-a-linked-list.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F2130-maximum-twin-sum-of-a-linked-list.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0019 - Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)</sub> | <sub><div align='center'>[✔️](c%2F0019-remove-nth-node-from-end-of-list.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0019-remove-nth-node-from-end-of-list.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0019-remove-nth-node-from-end-of-list.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0019-remove-nth-node-from-end-of-list.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0019-remove-nth-node-from-end-of-list.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0019-remove-nth-node-from-end-of-list.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0019-remove-nth-node-from-end-of-list.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0019-remove-nth-node-from-end-of-list.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0019-remove-nth-node-from-end-of-list.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0019-remove-nth-node-from-end-of-list.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0019-remove-nth-node-from-end-of-list.ts)</div></sub>
 <sub>[1721 - Swapping Nodes in a Linked List](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F1721-swapping-nodes-in-a-linked-list.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F1721-swapping-nodes-in-a-linked-list.go)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1721-swapping-nodes-in-a-linked-list.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1721-swapping-nodes-in-a-linked-list.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0460 - LFU Cache](https://leetcode.com/problems/lfu-cache/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](javascript%2F0460-lfu-cache.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>