From d36207cdadf4d22f8d1fe6dec081d752a6c27cf7 Mon Sep 17 00:00:00 2001
From: Bot-A0 <71089234+Ahmad-A0@users.noreply.github.com>
Date: Sun, 29 Oct 2023 12:30:25 +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 | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/README.md b/README.md
index 059d89511..259a03275 100644
--- a/README.md
+++ b/README.md
@@ -252,7 +252,7 @@ If you would like to have collaborator permissions on the repo to merge your own
[0096 - Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/) | [✔️](c%2F0096-unique-binary-search-trees.c)
| ❌
| ❌
| ❌
| ❌
| [✔️](java%2F0096-unique-binary-search-trees.java)
| ❌
| [✔️](kotlin%2F0096-unique-binary-search-trees.kt)
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
[0129 - Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/) | [✔️](c%2F0129-sum-root-to-leaf-numbers.c)
| [✔️](cpp%2F0129-sum-root-to-leaf-numbers.cpp)
| ❌
| ❌
| ❌
| [✔️](java%2F0129-sum-root-to-leaf-numbers.java)
| ❌
| [✔️](kotlin%2F0129-sum-root-to-leaf-numbers.kt)
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
[0337 - House Robber III](https://leetcode.com/problems/house-robber-iii/) | ❌
| ❌
| ❌
| ❌
| ❌
| [✔️](java%2F0337-house-robber-iii.java)
| ❌
| [✔️](kotlin%2F0337-house-robber-iii.kt)
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
-[0951 - Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees/) | ❌
| ❌
| ❌
| ❌
| ❌
| [✔️](java%2F0951-flip-equivalent-binary-trees.java)
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
+[0951 - Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees/) | ❌
| ❌
| ❌
| ❌
| ❌
| [✔️](java%2F0951-flip-equivalent-binary-trees.java)
| ❌
| [✔️](kotlin%2F0951-flip-equivalent-binary-trees.kt)
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
[1993 - Operations On Tree](https://leetcode.com/problems/operations-on-tree/) | ❌
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
[0894 - All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees/) | ❌
| ❌
| ❌
| ❌
| ❌
| [✔️](java%2F0894-all-possible-full-binary-trees.java)
| ❌
| [✔️](kotlin%2F0894-all-possible-full-binary-trees.kt)
| [✔️](python%2F0894-all-possible-full-binary-trees.py)
| ❌
| ❌
| ❌
| ❌
| ❌
[0513 - Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/) | ❌
| ❌
| ❌
| ❌
| ❌
| [✔️](java%2F0513-find-bottom-left-tree-value.java)
| ❌
| [✔️](kotlin%2F0513-find-bottom-left-tree-value.kt)
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
@@ -331,7 +331,7 @@ If you would like to have collaborator permissions on the repo to merge your own
[1466 - Reorder Routes to Make All Paths Lead to The City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/) | ❌
| [✔️](cpp%2F1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.cpp)
| [✔️](csharp%2F1466-Reorder-Routes-to-Make-All-Paths-Lead-To-The-City-Zero.cs)
| ❌
| ❌
| [✔️](java%2F1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.java)
| ❌
| [✔️](kotlin%2F1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.kt)
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
[0994 - Rotting Oranges](https://leetcode.com/problems/rotting-oranges/) | [✔️](c%2F0994-rotting-oranges.c)
| [✔️](cpp%2F0994-rotting-oranges.cpp)
| [✔️](csharp%2F0994-rotting-oranges.cs)
| ❌
| [✔️](go%2F0994-rotting-oranges.go)
| [✔️](java%2F0994-rotting-oranges.java)
| [✔️](javascript%2F0994-rotting-oranges.js)
| [✔️](kotlin%2F0994-rotting-oranges.kt)
| [✔️](python%2F0994-rotting-oranges.py)
| ❌
| ❌
| ❌
| ❌
| [✔️](typescript%2F0994-rotting-oranges.ts)
[0286 - Walls And Gates](https://leetcode.com/problems/walls-and-gates/) | ❌
| [✔️](cpp%2F0286-walls-and-gates.cpp)
| [✔️](csharp%2F0286-walls-and-gates.cs)
| ❌
| ❌
| [✔️](java%2F0286-walls-and-gates.java)
| [✔️](javascript%2F0286-walls-and-gates.js)
| ❌
| [✔️](python%2F0286-walls-and-gates.py)
| ❌
| ❌
| ❌
| ❌
| ❌
-[0909 - Snakes And Ladders](https://leetcode.com/problems/snakes-and-ladders/) | ❌
| ❌
| [✔️](csharp%2F0909-snakes-and-ladders.cs)
| ❌
| ❌
| [✔️](java%2F0909-snakes-and-ladders.java)
| ❌
| ❌
| [✔️](python%2F0909-snakes-and-ladders.py)
| ❌
| ❌
| ❌
| ❌
| ❌
+[0909 - Snakes And Ladders](https://leetcode.com/problems/snakes-and-ladders/) | ❌
| ❌
| [✔️](csharp%2F0909-snakes-and-ladders.cs)
| ❌
| ❌
| [✔️](java%2F0909-snakes-and-ladders.java)
| ❌
| [✔️](kotlin%2F0909-snakes-and-ladders.kt)
| [✔️](python%2F0909-snakes-and-ladders.py)
| ❌
| ❌
| ❌
| ❌
| ❌
[0752 - Open The Lock](https://leetcode.com/problems/open-the-lock/) | ❌
| ❌
| [✔️](csharp%2F0752-open-the-lock.cs)
| ❌
| ❌
| [✔️](java%2F0752-open-the-lock.java)
| ❌
| [✔️](kotlin%2F0752-open-the-lock.kt)
| [✔️](python%2F0752-open-the-lock.py)
| ❌
| ❌
| ❌
| ❌
| ❌
[0802 - Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states/) | ❌
| ❌
| ❌
| ❌
| ❌
| [✔️](java%2F0802-find-eventual-safe-states.java)
| ❌
| [✔️](kotlin%2F0802-find-eventual-safe-states.kt)
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
[0207 - Course Schedule](https://leetcode.com/problems/course-schedule/) | [✔️](c%2F0207-course-schedule.c)
| [✔️](cpp%2F0207-course-schedule.cpp)
| [✔️](csharp%2F0207-course-schedule.cs)
| ❌
| [✔️](go%2F0207-course-schedule.go)
| [✔️](java%2F0207-course-schedule.java)
| [✔️](javascript%2F0207-course-schedule.js)
| [✔️](kotlin%2F0207-course-schedule.kt)
| [✔️](python%2F0207-course-schedule.py)
| ❌
| ❌
| ❌
| [✔️](swift%2F0207-course-schedule.swift)
| [✔️](typescript%2F0207-course-schedule.ts)