Adds 5 POTD questions

Author: PacemakerX

solutions_leetCode/1475_final-prices-with-a-special-discount-in-a-shop/README.md

@@ -0,0 +1,32 @@
+# Final Prices With a Special Discount in a Shop
+
+**Question ID**: 1475 
+**Language**: C++ 
+**Status**: Accepted 
+**Runtime**: 0 ms
+**Memory**: 13.94 MB
+
+## Solution Code
+
+```cpp
+class Solution {
+public:
+ vector<int> finalPrices(vector<int>& prices) {
+
+
+
+  for(int i=0;i<prices.size();i++){
+  for(int j=i+1;j<prices.size();j++){
+  if(prices[j]<=prices[i]){
+  prices[i]-=prices[j];
+  break;
+  }
+ }
+ }
+
+
+ return prices;
+ }
+};
+//https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop
+```

solutions_leetCode/1475_final-prices-with-a-special-discount-in-a-shop/metadata.json

@@ -0,0 +1,17 @@
+{
+ "id": 1482239245,
+ "question_id": 1475,
+ "lang": "cpp",
+ "lang_name": "C++",
+ "timestamp": 1734616130,
+ "status": 10,
+ "status_display": "Accepted",
+ "runtime": "0 ms",
+ "url": "https://leetcode.com/submissions/detail/1482239245/",
+ "is_pending": "Not Pending",
+ "title": "Final Prices With a Special Discount in a Shop",
+ "memory": "13.94 MB",
+ "title_slug": "final-prices-with-a-special-discount-in-a-shop",
+ "has_notes": false,
+ "flag_type": 1
+}

solutions_leetCode/1475_final-prices-with-a-special-discount-in-a-shop/solution.cpp

@@ -0,0 +1,26 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+// https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop
+
+class Solution
+{
+public:
+ vector<int> finalPrices(vector<int> &prices)
+ {
+
+ for (int i = 0; i < prices.size(); i++)
+ {
+ for (int j = i + 1; j < prices.size(); j++)
+ {
+ if (prices[j] <= prices[i])
+ {
+ prices[i] -= prices[j];
+ break;
+ }
+ }
+ }
+
+ return prices;
+ }
+};

solutions_leetCode/1792_maximum-average-pass-ratio/README.md

@@ -0,0 +1,51 @@
+# Maximum Average Pass Ratio
+
+**Question ID**: 1792 
+**Language**: C++ 
+**Status**: Accepted 
+**Runtime**: 307 ms 
+**Memory**: 97.8 MB
+
+## Solution Code
+```cpp
+//https://leetcode.com/problems/maximum-average-pass-ratio
+class Solution {
+public:
+ double maxAverageRatio(vector<vector<int>>& classes, int extraStudents) {
+ // Lambda to calculate the gain of adding an extra student
+ 
+ auto calculateGain = [](int passes, int totalStudents) {
+ return (double)(passes + 1) / (totalStudents + 1) -
+ (double)passes / totalStudents;
+ };
+
+
+  priority_queue<pair<double, pair<int, int>>> maxHeap;
+  for (const auto& singleClass : classes) {
+  maxHeap.push({calculateGain(singleClass[0], singleClass[1]),
+  {singleClass[0], singleClass[1]}});
+  }
+
+ // Distribute extra students
+
+ while (extraStudents--) {
+  auto [currentGain, classInfo] = maxHeap.top();
+  maxHeap.pop();
+  int passes = classInfo.first;
+  int totalStudents = classInfo.second;
+  maxHeap.push({calculateGain(passes + 1, totalStudents + 1),
+  {passes + 1, totalStudents + 1}});
+  }
+
+  // Calculate the final average pass ratio
+  double totalPassRatio = 0;
+  while (!maxHeap.empty()) {
+  auto [_, classInfo] = maxHeap.top();
+  maxHeap.pop();
+  totalPassRatio += (double)classInfo.first / classInfo.second;
+  }
+
+  return totalPassRatio / classes.size();
+ }
+};
+```

solutions_leetCode/1792_maximum-average-pass-ratio/metadata.json

@@ -0,0 +1,17 @@
+{
+ "id": 1479691576,
+ "question_id": 1792,
+ "lang": "cpp",
+ "lang_name": "C++",
+ "timestamp": 1734615754,
+ "status": 10,
+ "status_display": "Accepted",
+ "runtime": "307 ms",
+ "url": "https://leetcode.com/submissions/detail/1479691576/",
+ "is_pending": "Not Pending",
+ "title": "Maximum Average Pass Ratio",
+ "memory": "97.8 MB",
+ "title_slug": "maximum-average-pass-ratio",
+ "has_notes": false,
+ "flag_type": 1
+}

solutions_leetCode/1792_maximum-average-pass-ratio/solution.cpp

@@ -0,0 +1,49 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+// https://leetcode.com/problems/maximum-average-pass-ratio
+
+class Solution
+{
+public:
+ double maxAverageRatio(vector<vector<int>> &classes, int extraStudents)
+ {
+ // Lambda to calculate the gain of adding an extra student
+
+ auto calculateGain = [](int passes, int totalStudents)
+ {
+ return (double)(passes + 1) / (totalStudents + 1) -
+ (double)passes / totalStudents;
+ };
+
+ priority_queue<pair<double, pair<int, int>>> maxHeap;
+ for (const auto &singleClass : classes)
+ {
+ maxHeap.push({calculateGain(singleClass[0], singleClass[1]),
+ {singleClass[0], singleClass[1]}});
+ }
+
+ // Distribute extra students
+
+ while (extraStudents--)
+ {
+ auto [currentGain, classInfo] = maxHeap.top();
+ maxHeap.pop();
+ int passes = classInfo.first;
+ int totalStudents = classInfo.second;
+ maxHeap.push({calculateGain(passes + 1, totalStudents + 1),
+ {passes + 1, totalStudents + 1}});
+ }
+
+ // Calculate the final average pass ratio
+ double totalPassRatio = 0;
+ while (!maxHeap.empty())
+ {
+ auto [_, classInfo] = maxHeap.top();
+ maxHeap.pop();
+ totalPassRatio += (double)classInfo.first / classInfo.second;
+ }
+
+ return totalPassRatio / classes.size();
+ }
+};

solutions_leetCode/2182_construct-string-with-repeat-limit/README.md

@@ -0,0 +1,56 @@
+# Construct String With Repeat Limit
+
+**Question ID**: 2182 
+**Language**: C++ 
+**Status**: Accepted 
+**Runtime**: 52 ms
+**Memory**: 28.24 MB
+
+## Solution Code
+
+```cpp
+//https://leetcode.com/problems/construct-string-with-repeat-limit
+class Solution {
+public:
+ string repeatLimitedString(string s, int repeatLimit) {
+ unordered_map<char, int> freq;
+ for (char ch : s) {
+ freq[ch]++;
+ }
+
+  priority_queue<char> maxHeap;
+  for (auto& [ch, count] : freq) {
+  maxHeap.push(ch);
+  }
+
+ string result;
+
+ while (!maxHeap.empty()) {
+  char ch = maxHeap.top();
+  maxHeap.pop();
+  int count = freq[ch];
+
+  int use = min(count, repeatLimit);
+  result.append(use, ch);
+
+  freq[ch] -= use;
+
+  if (freq[ch] > 0 && !maxHeap.empty()) {
+  char nextCh = maxHeap.top();
+  maxHeap.pop();
+
+  result.push_back(nextCh);
+  freq[nextCh]--;
+
+  if (freq[nextCh] > 0) {
+  maxHeap.push(nextCh);
+  }
+
+  maxHeap.push(ch);
+  }
+  }
+
+  return result;
+ }
+};
+```

solutions_leetCode/2182_construct-string-with-repeat-limit/metadata.json

@@ -0,0 +1,17 @@
+{
+ "id": 1481462255,
+ "question_id": 2182,
+ "lang": "cpp",
+ "lang_name": "C++",
+ "timestamp": 1734616040,
+ "status": 10,
+ "status_display": "Accepted",
+ "runtime": "52 ms",
+ "url": "https://leetcode.com/submissions/detail/1481462255/",
+ "is_pending": "Not Pending",
+ "title": "Construct String With Repeat Limit",
+ "memory": "28.24 MB",
+ "title_slug": "construct-string-with-repeat-limit",
+ "has_notes": false,
+ "flag_type": 1
+}

solutions_leetCode/2182_construct-string-with-repeat-limit/solution.cpp

@@ -0,0 +1,47 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+//https://leetcode.com/problems/construct-string-with-repeat-limit
+class Solution {
+public:
+ string repeatLimitedString(string s, int repeatLimit) {
+ unordered_map<char, int> freq;
+ for (char ch : s) {
+ freq[ch]++;
+ }
+
+ priority_queue<char> maxHeap;
+ for (auto& [ch, count] : freq) {
+ maxHeap.push(ch);
+ }
+
+ string result;
+
+ while (!maxHeap.empty()) {
+ char ch = maxHeap.top();
+ maxHeap.pop();
+ int count = freq[ch];
+
+ int use = min(count, repeatLimit);
+ result.append(use, ch);
+
+ freq[ch] -= use;
+
+ if (freq[ch] > 0 && !maxHeap.empty()) {
+ char nextCh = maxHeap.top();
+ maxHeap.pop();
+
+ result.push_back(nextCh);
+ freq[nextCh]--;
+
+ if (freq[nextCh] > 0) {
+ maxHeap.push(nextCh);
+ }
+
+ maxHeap.push(ch);
+ }
+ }
+
+ return result;
+ }
+};

solutions_leetCode/2778_sum-of-squares-of-special-elements/README.md

@@ -0,0 +1,30 @@
+# Sum of Squares of Special Elements
+
+**Question ID**: 2778 
+**Language**: C++ 
+**Status**: Accepted 
+**Runtime**: 0 ms
+**Memory**: 40.07 MB
+
+## Solution Code
+
+```cpp
+//https://leetcode.com/problems/sum-of-squares-of-special-elements
+class Solution {
+public:
+ int sumOfSquares(vector<int>& nums) {
+
+  int sum=0;
+
+  int n=nums.size();
+  for(int i=0;i<nums.size();i++){
+  if(n%(i+1)==0){
+
+  sum+= (nums[i]*nums[i]);
+  }
+ }
+
+ return sum;
+ }
+};
+```