leetcode

Solution to some Leetcode problems written in C++
git clone git://git.dimitrijedobrota.com/leetcode.git
Log | Files | Refs | README | LICENSE |
commit05833ad731709a38054c13ce73e2bb0ba1ebdb6a
parent6abcda5cb34c4f596139976b0cef0fd55d71144f
authorDimitrije Dobrota <mail@dimitrijedobrota.com>
dateFri, 2 Aug 2024 21:33:38 +0200

1 Random Problem

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

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

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

@@ -0,0 +1,12 @@

class Solution {
public:
vector<int> getConcatenation(vector<int> &nums) const {
const int n = size(nums);
for (int i = 0; i < n; i++) {
nums.push_back(nums[i]);
}
return nums;
}
};

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

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

| 1915 | Medium | [Number of Wonderful Substrings](Problems/1915.cpp) |
| 1921 | Medium | [Eliminate Maximum Number of Monsters](Problems/1921.cpp) |
| 1926 | Medium | [Nearest Exit from Entrance in Maze](Problems/1926.cpp) |
| 1929 | Easy | [Concatenation of Array](Problems/1929.cpp) |
| 1930 | Medium | [Unique Length-3 Palindromic Subsequences](Problems/1930.cpp) |
| 1934 | Medium | [Confirmation Rate](Problems/1934.cpp) |
| 1943 | Medium | [Describe the Painting](Problems/1943.cpp) |