Skip to content

Commit b14a651

Browse files
committed
πŸ“œ Update README table (πŸ› οΈ from Github Actions)
1 parent 6880ead commit b14a651

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

β€ŽREADME.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -197,7 +197,7 @@ If you would like to have collaborator permissions on the repo to merge your own
197197
<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>
198198
<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>
199199
<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>
200-
<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>
200+
<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'>[βœ”οΈ](swift%2F2130-maximum-twin-sum-of-a-linked-list.swift)</div></sub> | <sub><div align='center'>❌</div></sub>
201201
<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>
202202
<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'>[βœ”οΈ](java%2F1721-swapping-nodes-in-a-linked-list.java)</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>
203203
<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'>[βœ”οΈ](kotlin%2F0460-lfu-cache.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>

0 commit comments

Comments
Β (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy