commit 64049a209a92c1e5921a261bffefdcb6dbcea74d
parent 71a3e588c3521c734449cd7da78bf462c5c8e65d
Author: Dimitrije Dobrota <mail@dimitrijedobrota.com>
Date: Fri, 11 Aug 2023 11:27:16 +0200
5 Random Problems
Diffstat:
6 files changed, 81 insertions(+), 0 deletions(-)
diff --git a/Problems/1282.cpp b/Problems/1282.cpp
@@ -0,0 +1,22 @@
+class Solution {
+public:
+ vector<vector<int>> groupThePeople(const vector<int> &groupSizes) {
+ unordered_map<int, vector<int>> um;
+ vector<vector<int>> res;
+
+ for (int i = 0; i < groupSizes.size(); i++) {
+ if (groupSizes[i] == 1)
+ res.push_back({i});
+ else {
+ int size = groupSizes[i];
+ um[size].push_back(i);
+ if (um[size].size() == size) {
+ res.push_back({});
+ swap(res.back(), um[size]);
+ }
+ }
+ }
+
+ return res;
+ }
+};
diff --git a/Problems/1769.cpp b/Problems/1769.cpp
@@ -0,0 +1,18 @@
+class Solution {
+public:
+ vector<int> minOperations(const string &boxes) {
+ vector<int> res(boxes.size(), 0);
+
+ for (int i = 0, ops = 0, cnt = 0; i < boxes.size(); i++) {
+ res[i] += ops;
+ ops += cnt += (boxes[i] == '1');
+ }
+
+ for (int i = boxes.size() - 1, ops = 0, cnt = 0; i >= 0; i--) {
+ res[i] += ops;
+ ops += cnt += (boxes[i] == '1');
+ }
+
+ return res;
+ }
+};
diff --git a/Problems/2433.cpp b/Problems/2433.cpp
@@ -0,0 +1,11 @@
+class Solution {
+public:
+ vector<int> findArray(vector<int> &pref) {
+ int mask = 0;
+ for (int &n : pref) {
+ n ^= mask;
+ mask ^= n;
+ }
+ return pref;
+ }
+};
diff --git a/Problems/2545.cpp b/Problems/2545.cpp
@@ -0,0 +1,10 @@
+class Solution {
+public:
+ vector<vector<int>> sortTheStudents(vector<vector<int>> &score, int k) {
+ sort(score.begin(), score.end(),
+ [k](const vector<int> &a, const vector<int> &b) {
+ return a[k] >= b[k];
+ });
+ return score;
+ }
+};
diff --git a/Problems/2610.cpp b/Problems/2610.cpp
@@ -0,0 +1,15 @@
+class Solution {
+public:
+ vector<vector<int>> findMatrix(const vector<int> &nums) {
+ int count[201] = {0};
+ vector<vector<int>> res;
+ for (int n : nums) {
+ if (count[n] >= res.size())
+ res.push_back({n});
+ else
+ res[count[n]].push_back(n);
+ count[n]++;
+ }
+ return res;
+ }
+};
diff --git a/README.md b/README.md
@@ -459,6 +459,7 @@ for solving problems.
| 1232 | Easy | [Check If It Is a Straight Line](Problems/1232.cpp) |
| 1249 | Medium | [Minimum Remove to Make Valid Parentheses](Problems/1249.cpp) |
| 1254 | Medium | [Number of Closed Islands](Problems/1254.cpp) |
+| 1282 | Medium | [Group the People Given the Group Size They Belong To](Problems/1282.cpp) |
| 1290 | Easy | [Convert Binary Number in a Linked List to Integer](Problems/1290.cpp) |
| 1302 | Medium | [Deepest Leaves Sum](Problems/1302.cpp) |
| 1305 | Medium | [All Elements in Two Binary Search Trees](Problems/1305.cpp) |
@@ -539,6 +540,7 @@ for solving problems.
| 1732 | Easy | [Find the Highest Altitude](Problems/1732.cpp) |
| 1751 | Hard | [Maximum Number of Events That Can Be Attended II](Problems/1751.cpp) |
| 1768 | Easy | [Merge Strings Alternately](Problems/1768.cpp) |
+| 1769 | Medium | [Minimum Number of Operations to Move All Balls to Each Box](Problems/1769.cpp) |
| 1786 | Medium | [Number of Restricted Paths From First to Last Node](Problems/1786.cpp) |
| 1791 | Easy | [Find Center of Star Graph](Problems/1791.cpp) |
| 1799 | Medium | [Maximize Score After N Operations](Problems/1799.cpp) |
@@ -603,6 +605,7 @@ for solving problems.
| 2396 | Medium | [Strictly Palindromic Number](Problems/2396.cpp) |
| 2405 | Medium | [Optimal Partition of String](Problems/2405.cpp) |
| 2421 | Medium | [Number of Good Paths](Problems/2421.cpp) |
+| 2433 | Medium | [Find The Original Array of Prefix Xor](Problems/2433.cpp) |
| 2439 | Medium | [Minimize Maximum of Array](Problems/2439.cpp) |
| 2444 | Hard | [Count Subarrays With Fixed Bounds](Problems/2444.cpp) |
| 2448 | Hard | [Minimum Cost to Make Array Equal](Problems/2448.cpp) |
@@ -615,7 +618,9 @@ for solving problems.
| 2492 | Medium | [Minimum Score of a Path Between Two Cities](Problems/2492.cpp) |
| 2497 | Medium | [Maximum Star Sum of a Graph](Problems/2497.cpp) |
| 2542 | Medium | [Maximum Subsequence Score](Problems/2542.cpp) |
+| 2545 | Medium | [Sort the Students by Their Kth Score](Problems/2545.cpp) |
| 2551 | Hard | [Put Marbles in Bags](Problems/2551.cpp) |
+| 2610 | Medium | [Convert an Array Into a 2D Array With Conditions](Problems/2610.cpp) |
| 2616 | Medium | [Minimize the Maximum Difference of Pairs](Problems/2616.cpp) |
| 2620 | Easy | [Counter](Problems/2620.js) |
| 2621 | Easy | [Sleep](Problems/2621.js) |
