leetcode

Solution to some Leetcode problems written in C++
git clone git://git.dimitrijedobrota.com/leetcode.git
Log | Files | Refs | README | LICENSE |
commitbf93593e129152e442cf33535fa4342d81f3eb43
parent8a6f09d0f4ac26b58d1a0779de9d54a243f1964f
authorDimitrije Dobrota <mail@dimitrijedobrota.com>
dateTue, 13 Aug 2024 19:37:04 +0200

1 Random Problem

Diffstat:
AProblems/3190.cpp|+++++++++++
MREADME.md|+

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

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

@@ -0,0 +1,11 @@

class Solution {
public:
int minimumOperations(const vector<int> &nums) const {
int res = 0;
for (const int n : nums)
res += (n % 3 != 0);
return res;
}
};

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

@@ -1311,6 +1311,7 @@ for solving problems.

| 3110 | Easy | [Score of a String](Problems/3110.cpp) |
| 3111 | Medium | [Minimum Rectangles to Cover Points](Problems/3111.cpp) |
| 3159 | Medium | [Find Occurrences of an Element in an Array](Problems/3159.cpp) |
| 3190 | Easy | [Find Minimum Operations to Make All Elements Divisible by Three](Problems/3190.cpp) |
| 3192 | Medium | [Minimum Operations to Make Binary Array Elements Equal to One II](Problems/3192.cpp) |
| 3195 | Medium | [Find the Minimum Area to Cover All Ones I](Problems/3195.cpp) |
| 3211 | Medium | [Generate Binary Strings Without Adjacent Zeros](Problems/3211.cpp) |