You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+1Lines changed: 1 addition & 0 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -506,6 +506,7 @@ The solutions are organized as follows:
506
506
| 2073 |[Time Needed to Buy Tickets](https://leetcode.com/problems/time-needed-to-buy-tickets/)|[Python](./2073-time-needed-to-buy-tickets/2073-time-needed-to-buy-tickets.py)|[Easy](./2073-time-needed-to-buy-tickets/README.md)|
507
507
| 2083 |[Substrings That Begin and End With the Same Letter](https://leetcode.com/problems/substrings-that-begin-and-end-with-the-same-letter/)|[Python](./2083-substrings-that-begin-and-end-with-the-same-letter/2083-substrings-that-begin-and-end-with-the-same-letter.py)|[Medium](./2083-substrings-that-begin-and-end-with-the-same-letter/README.md)|
508
508
| 2092 |[Find All People With Secret](https://leetcode.com/problems/find-all-people-with-secret/)|[Python](./2092-find-all-people-with-secret/2092-find-all-people-with-secret.py)|[Hard](./2092-find-all-people-with-secret/README.md)|
509
+
| 2096 |[Step-By-Step Directions From a Binary Tree Node to Another](https://leetcode.com/problems/step-by-step-directions-from-a-binary-tree-node-to-another/)|[Python](./2096-step-by-step-directions-from-a-binary-tree-node-to-another/2096-step-by-step-directions-from-a-binary-tree-node-to-another.py)|[Medium](./2096-step-by-step-directions-from-a-binary-tree-node-to-another/README.md)|
509
510
| 2108 |[Find First Palindromic String in the Array](https://leetcode.com/problems/find-first-palindromic-string-in-the-array/)|[Python](./2108-find-first-palindromic-string-in-the-array/2108-find-first-palindromic-string-in-the-array.py)|[Medium](./2108-find-first-palindromic-string-in-the-array/README.md)|
510
511
| 2125 |[Number of Laser Beams in a Bank](https://leetcode.com/problems/number-of-laser-beams-in-a-bank/)|[Python](./2125-number-of-laser-beams-in-a-bank/2125-number-of-laser-beams-in-a-bank.py)|[Medium](./2125-number-of-laser-beams-in-a-bank/README.md)|
511
512
| 2141 |[Maximum Running Time of N Computers](https://leetcode.com/problems/maximum-running-time-of-n-computers/)|[Python](./2141-maximum-running-time-of-n-computers/2141-maximum-running-time-of-n-computers.py)|[Hard](./2141-maximum-running-time-of-n-computers/README.md)|
0 commit comments