diff --git a/README.md b/README.md
index a278cc591..56c0e26dc 100644
--- a/README.md
+++ b/README.md
@@ -180,7 +180,6 @@ If you would like to have collaborator permissions on the repo to merge your own
[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)
| ❌
| ❌
| [✔️](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)
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
-[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)
| ❌
| ❌
| ❌
| ❌
| ❌
[0004 - Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [✔️](c%2F0004-median-of-two-sorted-arrays.c)
| [✔️](cpp%2F0004-median-of-two-sorted-arrays.cpp)
| [✔️](csharp%2F0004-median-of-two-sorted-arrays.cs)
| ❌
| [✔️](go%2F0004-median-of-two-sorted-arrays.go)
| [✔️](java%2F0004-median-of-two-sorted-arrays.java)
| [✔️](javascript%2F0004-median-of-two-sorted-arrays.js)
| [✔️](kotlin%2F0004-median-of-two-sorted-arrays.kt)
| [✔️](python%2F0004-median-of-two-sorted-arrays.py)
| ❌
| [✔️](rust%2F0004-median-of-two-sorted-arrays.rs)
| ❌
| ❌
| [✔️](typescript%2F0004-median-of-two-sorted-arrays.ts)
@@ -249,6 +248,7 @@ If you would like to have collaborator permissions on the repo to merge your own
[0652 - Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees/) | ❌
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
| [✔️](kotlin%2F0652-find-duplicate-subtrees.kt)
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
[0958 - Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree/) | ❌
| [✔️](cpp%2F0958-check-completeness-of-a-binary-tree.cpp)
| ❌
| ❌
| ❌
| ❌
| ❌
| [✔️](kotlin%2F0958-check-completeness-of-a-binary-tree.kt)
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
[0106 - Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | ❌
| ❌
| ❌
| ❌
| ❌
| [✔️](java%2F0106-construct-binary-tree-from-inorder-and-postorder-traversal.java)
| ❌
| [✔️](kotlin%2F0106-construct-binary-tree-from-inorder-and-postorder-traversal.kt)
| [✔️](python%2F0106-construct-binary-tree-from-inorder-and-postorder-traversal.py)
| ❌
| ❌
| ❌
| ❌
| ❌
+[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)
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
[0662 - Maximum Width of Binary Tree ](https://leetcode.com/problems/maximum-width-of-binary-tree/) | ❌
| ❌
| ❌
| ❌
| ❌
| [✔️](java%2F0662-maximum-width-of-binary-tree.java)
| ❌
| [✔️](kotlin%2F0662-maximum-width-of-binary-tree.kt)
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
[1376 - Time Needed to Inform All Employees ](https://leetcode.com/problems/time-needed-to-inform-all-employees/) | ❌
| ❌
| ❌
| ❌
| ❌
| [✔️](java%2F1376-time-needed-to-inform-all-employees.java)
| ❌
| [✔️](kotlin%2F1376-time-needed-to-inform-all-employees.kt)
| ❌
| ❌
| ❌
| ❌
| ❌
| ❌
[1448 - Count Good Nodes In Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/) | [✔️](c%2F1448-Count-Good-Nodes-in-Binary-Tree.c)
| [✔️](cpp%2F1448-Count-Good-Nodes-In-Binary-Tree.cpp)
| [✔️](csharp%2F1448-Count-Good-Nodes-in-Binary-Tree.cs)
| ❌
| [✔️](go%2F1448-count-good-nodes-in-binary-tree.go)
| [✔️](java%2F1448-Count-Good-Nodes-in-Binary-Tree.java)
| [✔️](javascript%2F1448-Count-Good-Nodes-in-Binary-Tree.js)
| [✔️](kotlin%2F1448-Count-Good-Nodes-In-Binary-Tree.kt)
| [✔️](python%2F1448-count-good-nodes-in-binary-tree.py)
| ❌
| [✔️](rust%2F1448-count-good-nodes-in-binary-tree.rs)
| ❌
| [✔️](swift%2F1448-count-good-nodes-in-binary-tree.swift)
| [✔️](typescript%2F1448-Count-Good-Nodes-in-Binary-Tree.ts)