WhiteHat Coding
Открыть в Telegram
650
Подписчики
Нет данных24 часа
-27 дней
-330 день
Архив постов
Keep Sharing guys!! ❤️😊
For Free Solutions.
More Members -> More Solutions!!
Share @Whitehatcoding ❤️
Guys Fast share our channel
Make 👉1k
And share ur questions i will help Free only...✅✅
Accenture Coding Help Free
Share our channel @Whitehatcoding ❤️
Make 1k 🎯
Share ur questions here...😊
👇👇
https://t.me/accenture_ans1
Accenture Coding Help Free
Share our channel @Whitehatcoding ❤️
Make 1k 🎯
Share ur questions here...😊
👇👇
https://t.me/accenture_ans1
Repost from WhiteHat Coding
Accenture Coding Help Free
Share our channel @Whitehatcoding ❤️
Make 1k 🎯
Share ur questions here...😊
👇👇
https://t.me/accenture_ans1
Accenture Coding Help Free
Share our channel @Whitehatcoding ❤️
Make 1k 🎯
Share ur questions here...😊
vector<long long> solution(int t, vector<vector<long long>> carPrices) {
vector<long long> ans;
for (int i = 0; i < t; i++) {
vector<long long> arr = carPrices[i];
long long result = 0;
long long maxDiff = INT_MIN;
int N = arr.size();
for (int j = 0; j < N; j++) {
long long current = arr[j];
maxDiff = max(maxDiff, current);
result = max(result, maxDiff - current);
}
long long res = 0;
while ((1LL << res) - 1 < result) {
++res;
}
cout << res << endl;
ans.push_back(res);
}
return ans;
}
Uber Car ✅
Telegram group link : @whitehatcoding ❤️
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(c) c.begin(), c.end()
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
int32_t main()
{
fast
int t = 1;
cin >> t;
while (t--)
{
int n, k;
cin >> n >> k;
string s;
cin >> s;
sort(all(s));
int dp[27][k + 1];
memset(dp, 0, sizeof(dp));
char cur = s[0];
for (auto ch : s)
{
dp[ch - 'a'][1]++;
for (int j = 2; j <= k; j++)
{
for (char c = 'a'; c < ch; c++)
{
dp[ch - 'a'][j] += dp[c - 'a'][j - 1];
}
}
}
int ans = 0;
for (int i = 0; i < 26; i++)
ans += dp[i][k];
cout << ans << "\n";
}
return 0;
}
Google code✅
share @whitehatcoding❤️
Friends Please All Do Like This 👆
Please Unmute Our Channel 😔
Please Keep This Button Like Mute 🙏
Please Support US 😌 @Whitehatcoding❤️
#include <bits/stdc++.h>
using namespace std;
// Function to find the maximum
// number of regions on a plane
void maxRegions(int n)
{
int num;
num = n * (n + 1) / 2 + 1;
// print the maximum number of regions
cout << num;
}
// Driver code
int main()
{
int n = 10;
maxRegions(n);
return 0;
}
Tech Mahindra ❤️
Regions on the plane code ✅
📍📍 Telegram :
