From 42b37752afe7f0678bda001670cf6ba0881b306f Mon Sep 17 00:00:00 2001 From: Bot-A0 <71089234+Ahmad-A0@users.noreply.github.com> Date: Fri, 1 Nov 2024 05:07:15 +0000 Subject: [PATCH] =?UTF-8?q?=F0=9F=93=9C=20Update=20README=20table=20(?= =?UTF-8?q?=F0=9F=9B=A0=EF=B8=8F=20from=20Github=20Actions)?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index 71fc9341d..d054cd6e4 100644 --- a/README.md +++ b/README.md @@ -165,7 +165,7 @@ If you would like to have collaborator permissions on the repo to merge your own [0374 - Guess Number Higher Or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/) |
|
[✔️](c%2F0374-guess-number-higher-or-lower.c)
|
[✔️](cpp%2F0374-guess-number-higher-or-lower.cpp)
|
[✔️](csharp%2F0374-guess-number-higher-or-lower.cs)
|
|
[✔️](go%2F0374-guess-number-higher-or-lower.go)
|
[✔️](java%2F0374-guess-number-higher-or-lower.java)
|
[✔️](javascript%2F0374-guess-number-higher-or-lower.js)
|
[✔️](kotlin%2F0374-guess-number-higher-or-lower.kt)
|
[✔️](python%2F0374-guess-number-higher-or-lower.py)
|
|
[✔️](rust%2F0374-guess-number-higher-or-lower.rs)
|
|
[✔️](swift%2F0374-guess-number-higher-or-lower.swift)
|
[0441 - Arranging Coins](https://leetcode.com/problems/arranging-coins/) |
|
|
[✔️](cpp%2F0441-arranging-coins.cpp)
|
|
|
|
[✔️](java%2F0441-arranging-coins.java)
|
[✔️](javascript%2F0441-arranging-coins.js)
|
[✔️](kotlin%2F0441-arranging-coins.kt)
|
[✔️](python%2F0441-arranging-coins.py)
|
|
[✔️](rust%2F0441-arranging-coins.rs)
|
|
|
[0977 - Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/) |
|
|
[✔️](cpp%2F0977-squares-of-a-sorted-array.cpp)
|
|
|
[✔️](go%2F0977-squares-of-a-sorted-array.go)
|
[✔️](java%2F0977-squares-of-a-sorted-array.java)
|
[✔️](javascript%2F0977-squares-of-a-sorted-array.js)
|
[✔️](kotlin%2F0977-squares-of-a-sorted-array.kt)
|
[✔️](python%2F0977-squares-of-a-sorted-array.py)
|
|
[✔️](rust%2F0977-squares-of-a-sorted-array.rs)
|
|
[✔️](swift%2F0977-squares-of-a-sorted-array.swift)
|
[✔️](typescript%2F0977-squares-of-a-sorted-array.ts)
-[0367 - Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/) |
|
[✔️](c%2F0367-valid-perfect-square.c)
|
[✔️](cpp%2F0367-valid-perfect-square.cpp)
|
|
|
|
[✔️](java%2F0367-valid-perfect-square.java)
|
[✔️](javascript%2F0367-valid-perfect-square.js)
|
[✔️](kotlin%2F0367-valid-perfect-square.kt)
|
[✔️](python%2F0367-valid-perfect-square.py)
|
|
|
|
[✔️](swift%2F0367-valid-perfect-square.swift)
|
+[0367 - Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/) |
|
[✔️](c%2F0367-valid-perfect-square.c)
|
[✔️](cpp%2F0367-valid-perfect-square.cpp)
|
|
|
[✔️](go%2F0367-valid-perfect-square.go)
|
[✔️](java%2F0367-valid-perfect-square.java)
|
[✔️](javascript%2F0367-valid-perfect-square.js)
|
[✔️](kotlin%2F0367-valid-perfect-square.kt)
|
[✔️](python%2F0367-valid-perfect-square.py)
|
|
|
|
[✔️](swift%2F0367-valid-perfect-square.swift)
|
[0069 - Sqrt(x) ](https://leetcode.com/problems/sqrtx/) |
|
[✔️](c%2F0069-sqrtx.c)
|
[✔️](cpp%2F0069-sqrtx.cpp)
|
|
|
|
[✔️](java%2F0069-sqrtx.java)
|
[✔️](javascript%2F0069-sqrtx.js)
|
[✔️](kotlin%2F0069-sqrtx.kt)
|
[✔️](python%2F0069-sqrtx.py)
|
|
|
|
|
[0540 - Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/) |
|
[✔️](c%2F0540-single-element-in-a-sorted-array.c)
|
[✔️](cpp%2F0540-single-element-in-a-sorted-array.cpp)
|
|
|
|
[✔️](java%2F0540-single-element-in-a-sorted-array.java)
|
[✔️](javascript%2F0540-single-element-in-a-sorted-array.js)
|
[✔️](kotlin%2F0540-single-element-in-a-sorted-array.kt)
|
[✔️](python%2F0540-single-element-in-a-sorted-array.py)
|
|
|
|
|
[✔️](typescript%2F0540-single-element-in-a-sorted-array.ts)
[1011 - Capacity to Ship Packages](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/) |
|
|
[✔️](cpp%2F1011-capacity-to-ship-packages-within-d-days.cpp)
|
|
|
|
[✔️](java%2F1011-capacity-to-ship-packages-within-d-days.java)
|
|
[✔️](kotlin%2F1011-capacity-to-ship-packages-within-d-days.kt)
|
[✔️](python%2F1011-capacity-to-ship-packages-within-d-days.py)
|
|
|
|
|
@@ -178,8 +178,8 @@ If you would like to have collaborator permissions on the repo to merge your own [0033 - Search In Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) |
|
[✔️](c%2F0033-search-in-rotated-sorted-array.c)
|
[✔️](cpp%2F0033-search-in-rotated-sorted-array.cpp)
|
[✔️](csharp%2F0033-search-in-rotated-sorted-array.cs)
|
|
[✔️](go%2F0033-search-in-rotated-sorted-array.go)
|
[✔️](java%2F0033-search-in-rotated-sorted-array.java)
|
[✔️](javascript%2F0033-search-in-rotated-sorted-array.js)
|
[✔️](kotlin%2F0033-search-in-rotated-sorted-array.kt)
|
[✔️](python%2F0033-search-in-rotated-sorted-array.py)
|
|
[✔️](rust%2F0033-search-in-rotated-sorted-array.rs)
|
[✔️](scala%2F0033-search-in-rotated-sorted-array.scala)
|
[✔️](swift%2F0033-search-in-rotated-sorted-array.swift)
|
[✔️](typescript%2F0033-search-in-rotated-sorted-array.ts)
[0081 - Search In Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/) |
|
|
|
|
|
|
[✔️](java%2F0081-search-in-rotated-sorted-array-ii.java)
|
|
[✔️](kotlin%2F0081-search-in-rotated-sorted-array-ii.kt)
|
|
|
|
|
|
[0981 - Time Based Key Value Store](https://leetcode.com/problems/time-based-key-value-store/) |
|
[✔️](c%2F0981-time-based-key-value-store.c)
|
[✔️](cpp%2F0981-time-based-key-value-store.cpp)
|
[✔️](csharp%2F0981-time-based-key-value-store.cs)
|
|
[✔️](go%2F0981-time-based-key-value-store.go)
|
[✔️](java%2F0981-time-based-key-value-store.java)
|
[✔️](javascript%2F0981-time-based-key-value-store.js)
|
[✔️](kotlin%2F0981-time-based-key-value-store.kt)
|
[✔️](python%2F0981-time-based-key-value-store.py)
|
[✔️](ruby%2F0981-Time-Based-Key-Value-Store.rb)
|
[✔️](rust%2F0981-time-based-key-value-store.rs)
|
|
[✔️](swift%2F0981-time-based-key-value-store.swift)
|
[✔️](typescript%2F0981-time-based-key-value-store.ts)
-[0034 - Find First And Last Position of Element In Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/) |
|
|
[✔️](cpp%2F0034-find-first-and-last-position-of-element-in-sorted-array.cpp)
|
[✔️](csharp%2F0034-find-first-and-last-position-of-element-in-sorted-array.cs)
|
|
|
[✔️](java%2F0034-find-first-and-last-position-of-element-in-sorted-array.java)
|
[✔️](javascript%2F0034-find-first-and-last-position-of-element-in-sorted-array.js)
|
[✔️](kotlin%2F0034-find-first-and-last-position-of-element-in-sorted-array.kt)
|
[✔️](python%2F0034-find-first-and-last-position-of-element-in-sorted-array.py)
|
|
|
|
[✔️](swift%2F0034-find-first-and-last-position-of-element-in-sorted-array.swift)
|
-[1898 - Maximum Number of Removable Characters](https://leetcode.com/problems/maximum-number-of-removable-characters/) |
|
|
|
|
|
|
[✔️](java%2F1898-maximum-number-of-removable-characters.java)
|
[✔️](javascript%2F1898-maximum-number-of-removable-characters.js)
|
[✔️](kotlin%2F1898-maximum-number-of-removable-characters.kt)
|
|
|
|
|
|
+[0034 - Find First And Last Position of Element In Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/) |
|
|
[✔️](cpp%2F0034-find-first-and-last-position-of-element-in-sorted-array.cpp)
|
[✔️](csharp%2F0034-find-first-and-last-position-of-element-in-sorted-array.cs)
|
|
[✔️](go%2F0034-find-first-and-last-position-of-element-in-sorted-array.go)
|
[✔️](java%2F0034-find-first-and-last-position-of-element-in-sorted-array.java)
|
[✔️](javascript%2F0034-find-first-and-last-position-of-element-in-sorted-array.js)
|
[✔️](kotlin%2F0034-find-first-and-last-position-of-element-in-sorted-array.kt)
|
[✔️](python%2F0034-find-first-and-last-position-of-element-in-sorted-array.py)
|
|
|
|
[✔️](swift%2F0034-find-first-and-last-position-of-element-in-sorted-array.swift)
|
+[1898 - Maximum Number of Removable Characters](https://leetcode.com/problems/maximum-number-of-removable-characters/) |
|
|
|
|
|
[✔️](go%2F1898-maximum-number-of-removable-characters.go)
|
[✔️](java%2F1898-maximum-number-of-removable-characters.java)
|
[✔️](javascript%2F1898-maximum-number-of-removable-characters.js)
|
[✔️](kotlin%2F1898-maximum-number-of-removable-characters.kt)
|
|
|
|
|
|
[0116 - Populating Next Right Pointers In Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) |
|
|
[✔️](cpp%2F0116-populating-next-right-pointers-in-each-node.cpp)
|
|
|
[✔️](go%2F0116-populating-next-right-pointers-in-each-node.go)
|
[✔️](java%2F0116-populating-next-right-pointers-in-each-node.java)
|
[✔️](javascript%2F0116-populating-next-right-pointers-in-each-node.js)
|
[✔️](kotlin%2F0116-populating-next-right-pointers-in-each-node.kt)
|
|
|
|
|
|
[1268 - Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/) |
|
|
|
|
|
|
[✔️](java%2F1268-search-suggestions-system.java)
|
[✔️](javascript%2F1268-search-suggestions-system.js)
|
[✔️](kotlin%2F1268-search-suggestions-system.kt)
|
|
|
|
|
|
[0410 - Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/) |
|
|
|
|
|
|
[✔️](java%2F0410-split-array-largest-sum.java)
|
[✔️](javascript%2F0410-split-array-largest-sum.js)
|
[✔️](kotlin%2F0410-split-array-largest-sum.kt)
|
[✔️](python%2F0410-split-array-largest-sum.py)
|
|
|
|
|