leetcode

1 Random Problem

2 files changed, 5 insertions(+), 0 deletions(-)

diff --git a/ Problems/2769.cpp b/ Problems/2769.cpp

@@ -0,0 +1,4 @@

class Solution {

public:

int theMaximumAchievableX(int num, int t) const { return num + 2 * t; }

};

diff --git a/ README.md b/ README.md

@@ -1256,6 +1256,7 @@ for solving problems. | 2751 | Hard | [Robot Collisions](Problems/2751.cpp) | | 2766 | Medium | [Relocate Marbles](Problems/2766.cpp) | | 2767 | Medium | [Partition String Into Minimum Beautiful Substrings](Problems/2767.cpp) |

| 2769 | Easy | [Find the Maximum Achievable Number](Problems/2769.cpp) |

| 2780 | Medium | [Minimum Index of a Valid Split](Problems/2780.cpp) | | 2785 | Medium | [Sort Vowels in a String](Problems/2785.cpp) | | 2799 | Medium | [Count Complete Subarrays in an Array](Problems/2799.cpp) |