Feedback about OneIT ❤️

Join our Page more upcoming updates ❤️

https://t.me/code_alphix

I need your support 🙏

⁉️miniOrange strictly follows paligariam.there is high chance ?❓❓

Don't depend free codes...
If you decide write ✍️ free codes...
Make sure write plag free codes only ..

All the best from our page 📄

3 codes ✅ - 90 min timing

miniOrange 12.00 pm slot available


Ping me who want Help


#paid help ❤️

#include <iostream>
#include <vector>
using namespace std;

int giveChocolates(vector<int>& childrenRatings) {
int n = childrenRatings.size();
vector<int> ch(n, 1);

for (int i = 1; i < n; ++i) {
if (childrenRatings[i] > childrenRatings[i - 1]) {
ch[i] = ch[i - 1] + 1;
}
}

for (int i = n - 2; i >= 0; --i) {
if (childrenRatings[i] > childrenRatings[i + 1]) {
ch[i] = max(ch[i], ch[i + 1] + 1);
}
}

int sumChocolates = 0;
for (int chocolates : ch) {
sumChocolates += chocolates;
}

return sumChocolates;
}

int main() {
vector<int> ratings = {1, 3, 4, 3, 2, 1};
cout << "Total chocolates: " << giveChocolates(ratings) << endl;
return 0;
}


Chocolate -cpp✅💯

Login time is changed


Mostly 2.20 pm we will start ❤️

def largestComponent(pcbGrid):
if not pcbGrid:
return 0

m = len(pcbGrid)
n = len(pcbGrid[0])
max_size = 0

def codealpha(i, j):
if i < 0 or i >= m or j < 0 or j >= n or pcbGrid[i][j] == 0:
return 0



size = 1


size += codealpha(i+1, j)
size += codealpha(i-1, j)
size += codealpha(i, j+1)
size += codealpha(i, j-1)
size += codealpha(i+1, j+1)
size += codealpha(i+1, j-1)
size += codealpha(i-1, j+1)
size += codealpha(i-1, j-1)

return size


for i in range(m):
for j in range(n):
if pcbGrid[i][j] == 1:
component_size = codealpha(i, j)
max_size = max(max_size, component_size)

return max_size

10/10 miniOrange 💯