leetcode

Solution to some Leetcode problems written in C++
git clone git://git.dimitrijedobrota.com/leetcode.git
Log | Files | Refs | README | LICENSE
commit df582d25708469baba523a9770c3a4704c145e78
parent 986a9d99f8a15599817a3fc25a19ff9c092276e1
author Dimitrije Dobrota < mail@dimitrijedobrota.com >
date Fri, 4 Aug 2023 21:53:42 +0200

Random Problem

Diffstat:
A Problems/1689.cpp | ++++++
M README.md | +

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

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

@@ -0,0 +1,6 @@

class Solution {
public:
int minPartitions(const string &n) {
return *max_element(n.begin(), n.end()) & 0xF;
}
};

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

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

| 1669 | Medium | [Merge In Between Linked Lists](Problems/1669.cpp) |
| 1672 | Easy | [Richest Customer Wealth](Problems/1672.cpp) |
| 1675 | Hard | [Minimize Deviation in Array](Problems/1675.cpp) |
| 1689 | Medium | [Partitioning Into Minimum Number Of Deci-Binary Numbers](Problems/1689.cpp) |
| 1696 | Medium | [Jump Game VI](Problems/1696.cpp) |
| 1697 | Hard | [Checking Existence of Edge Length Limited Paths](Problems/1697.cpp) |
| 1700 | Easy | [Number of Students Unable to Eat Lunch](Problems/1700.cpp) |