Hackerrank || Hackerearth ||Codeforces || Geeksforgeek || Leetcode
前往频道在 Telegram
Welcome to Coding Solution Hub! 🚀 Are you preparing for coding interviews or competitive programming challenges? Look no further! This is the perfect channel for you.
显示更多未指定国家技术与应用52 882
1 143
订阅者
无数据24 小时
无数据7 天
无数据30 天
数据加载中...
吸引订阅者
八月 '24
八月 '24
+7
在0个频道中
七月 '24
+59
在0个频道中
Get PRO
六月 '24
+31
在0个频道中
Get PRO
五月 '24
+45
在0个频道中
Get PRO
四月 '24
+41
在0个频道中
Get PRO
三月 '24
+36
在0个频道中
Get PRO
二月 '24
+148
在0个频道中
Get PRO
一月 '24
+329
在0个频道中
Get PRO
十二月 '23
+208
在0个频道中
Get PRO
十一月 '23
+33
在0个频道中
Get PRO
十月 '23
+366
在0个频道中
| 日期 | 订阅者增长 | 提及 | 频道 | |
| 08 八月 | +1 | |||
| 07 八月 | 0 | |||
| 06 八月 | 0 | |||
| 05 八月 | +1 | |||
| 04 八月 | 0 | |||
| 03 八月 | +1 | |||
| 02 八月 | +3 | |||
| 01 八月 | +1 |
频道帖子
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
using namespace std;
vector<int> convertArraytoVector(size_t sz, int *arr) {
int N = sz;
vector<int> v;
for (int i = 0; i < N; i++)
v.push_back(arr[i]);
return v;
}
int maxProfit(vector<int>& prices) {
long long int res = 0;
prices.insert(prices.begin(), 0);
for(int i = 1; i < prices.size(); i++) {
res += max(prices[i] - prices[i - 1], 0);
}
res = res % 1000000000;
return res;
}
Bentley ✅
| 2 | Fresher's Hiring at Unijob Solution for Reputed Client at Pune
Exp. Level: 0 to 2 year
Qualification: BE - IT/Comp, B.tech, MCA, MSC, BSC, BCA - 2020 to 2023 passout.
Location: Hadapsar, Pune
Package: 3.5 to 4.5 LPA
Skills:
1. html, css, javascript,react
2. Node
3. Java
Excellent communication skills required.
Interested candidates can share cv at saurabh@unijobsolution.com | 0 |
| 3 | Fresher's Hiring at Unijob Solution for Reputed Client at Pune
Exp. Level: 0 to 2 year
Qualification: BE - IT/Comp, B.tech, MCA, MSC, BSC, BCA - 2020 to 2023 passout.
Location: Hadapsar, Pune
Package: 3.5 to 4.5 LPA
Skills:
1. html, css, javascript,react
2. Node
3. Java
Excellent communication skills required.
Interested candidates can share cv at saurabh@unijobsolution.com | 0 |
| 4 | 🌟 Exciting Internship Opportunity at EY! 🌟
Are you a motivated student looking to gain valuable experience in recruitment? Join EY as a pro-bono Intern and be part of our dynamic recruitment team!
Criteria:
- Must be from a reputed college
- Achieved 75% and above in 10th, 12th, and UG/PG (aggregate excluding last semester)
- No backlogs
- Willing to work from EY Noida office
- Available to start immediately
Please note that this is a pro-bono internship and does not guarantee any work opportunity. It's a chance to gain hands-on experience in recruitment at one of the world's leading firms.
If you meet the criteria and are ready to kickstart your career journey with EY, share your resume at payal.nagpal@in.ey.com. Don't miss out on this fantastic opportunity to learn and grow with us! | 0 |
| 5 | 🌟 Exciting Opportunity at Xceedance! 🌟
Are you a fresh postgraduate looking to kickstart your career in underwriting? Xceedance is hiring Underwriting Analysts in Gurgaon/Noida!
Required Skill Sets:
- Fresh postgraduates are welcome to apply
- Postgraduates in Economics, Mathematics, and Statistics domain are preferred
If you're ready to embark on a rewarding journey in underwriting and have the required skills, don't miss out on this opportunity!
Feel free to connect or WhatsApp your resume to 7289907457 / 7678424115.
Join us at Xceedance and take the first step towards a successful career in underwriting | 0 |
| 6 | Anakin is hiring SDE [Full Time]
For 2024, 2023, 2022 grads
Startup opportunity
https://www.ycombinator.com/companies/anakin/jobs/Xd7qkhq-software-development-engineer | 0 |
| 7 |  +1Roomba Shaped Robots ✅
Python 3(Amazon) | 0 |
| 8 |  +1#include <iostream>
#include <vector>
using namespace std;
long long totalProduction(const string& numberEmbossed) {
int n = numberEmbossed.length();
vector<long long> dp(n + 1, 0);
for (int i = 1; i <= n; ++i) {
dp[i] = dp[i - 1] * 10 + (numberEmbossed[i - 1] - '0') * i;
}
long long totalSweets = 0;
for (int i = 1; i <= n; ++i) {
totalSweets += dp[i];
}
return totalSweets;
}
DE Shaw ✅ | 0 |
| 9 | #include <iostream>
#include <vector>
#include <climits>
using namespace std;
string countSignals(const vector<int>& frequencies, const vector<vector<int>>& filterRanges) {
int ans = 0;
int l = INT_MIN;
int r = INT_MAX;
for (const auto& filter : filterRanges) {
l = max(l, filter[0]);
r = min(r, filter[1]);
}
for (int frequency : frequencies) {
if (l <= frequency && frequency <= r) {
ans += 1;
}
}
return to_string(ans);
}
Signal Filter ✅ | 0 |
| 10 | def get_potential_of_winner(potential, k):
curr = 1
winner = 0
while curr < k:
if potential[0] > potential[1]:
n = potential.pop(1)
curr += 1
potential.append(n)
else:
potential.pop(0)
potential.append(winner)
winner = 0
curr = 1
return potential[0]
IBM✅ | 0 |
| 11 | def find_different_evenness_index(n, numbers):
odd_count = even_count = 0
odd_index = even_index = 0
for i, num in enumerate(numbers):
if num % 2 == 0:
even_count += 1
even_index = i + 1
else:
odd_count += 1
odd_index = i + 1
return odd_index if even_count > odd_count else even_index
n = int(input())
numbers = list(map(int, input().split()))
result = find_different_evenness_index(n, numbers)
print(result)
Accenture ✅ | 0 |
| 12 | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <climits>
using namespace std;
int countMinimumOperations(string password) {
int v = 0, c = 0;
vector<int> cost(26, 26), choices;
for (char ch = 'a'; ch <= 'z'; ch++) {
for (char vowel : "aeiou") {
cost[ch - 'a'] = min(cost[ch - 'a'], abs(ch - vowel));
}
}
for (char ch : password) {
if (cost[ch - 'a'] == 0) {
v++;
} else {
c++;
choices.push_back(cost[ch - 'a']);
}
}
if (v > c) {
return (v - c) / 2;
}
sort(choices.begin(), choices.end());
return accumulate(choices.begin(), choices.begin() + (c - v) / 2, 0);
}
IBM✅ | 0 |
| 13 | #include <stdio.h>
struct Triangle {
int side1;
int side2;
int side3;
};
int IdentifyTriangle(struct Triangle list[], int n) {
if (list == NULL) {
return -1;
}
int scaleneCount = 0;
int isoscelesCount = 0;
int notTriangleCount = 0;
for (int i = 0; i < n; i++) {
int s1 = list[i].side1;
int s2 = list[i].side2;
int s3 = list[i].side3;
if ((s1 + s2 > s3) && (s1 + s3 > s2) && (s2 + s3 > s1)) {
if (s1 != s2 && s2 != s3 && s1 != s3) {
scaleneCount++;
}
else if (s1 == s2 s2 == s3 s1 == s3) {
isoscelesCount++;
}
} else {
notTriangleCount++;
}
}
return (3 * scaleneCount) - (isoscelesCount + notTriangleCount);
}
Identify triangles ✅ | 0 |
| 14 | m, n = map(int, input(). split ())
print(n,m)
Deloitte ✅ | 0 |
| 15 | n = int(input())
arr = list(map(int, input().split()))
even = 1
for i in arr:
if i&1 == 0:
even *= i
print(even)
Deloitte ✅ | 0 |
| 16 | #include <bits/stdc++.h>
using namespace std;
int getMinimumMoves(string word) {
unordered_map<char, int> freq;
int moves = 0;
for (char c : word) {
freq[c]++;
}
for (auto& entry : freq) {
moves += entry.second / 2;
}
return moves;
}
Minimum length word ✅ | 0 |
| 17 | static int getAnagramPeriod(String input_str) {
int n = input_str.length();
for (int period = 1; period <= n; period++) {
if (n % period == 0) {
String subString = input_str.substring(0, period);
boolean valid = true;
for (int i = 0; i < n; i += period) {
if (!isAnagram(subString, input_str.substring(i, i + period))) {
valid = false;
break;
}
}
if (valid) {
return period;
}
}
}
return -1;
}
static boolean isAnagram(String str1, String str2) {
char[] charArray1 = str1.toCharArray();
char[] charArray2 = str2.toCharArray();
Arrays.sort(charArray1);
Arrays.sort(charArray2);
return Arrays.equals(charArray1, charArray2);
}
Anagram Period ✅ | 0 |
| 18 | #include <iostream>
#include <vector>
#include <unordered_map>
#include <sstream>
using namespace std;
vector<string> computeParameterValue(vector<vector<string>>& sources) {
unordered_map<string, string> final_parameters;
vector<string> order_of_keys;
for (auto& source : sources) {
for (auto& pair : source) {
stringstream ss(pair);
string key, value;
getline(ss, key, ':');
getline(ss, value, ':');
if (final_parameters.find(key) == final_parameters.end()) {
order_of_keys.push_back(key);
}
final_parameters[key] = value;
}
}
vector<string> final_parameters_list;
for (auto& key : order_of_keys) {
final_parameters_list.push_back(final_parameters[key]);
}
return final_parameters_list;
}
Stock Analysis ✅ | 0 |
| 19 | public static String swapString(String inputString) {
char[] charArray = inputString.toCharArray();
int i = 0;
int j = inputString.length() - 1;
while (i < j) {
char temp = charArray[i];
charArray[i] = charArray[j];
charArray[j] = temp;
i++;
j--;
}
return new String(charArray);
}
Program to Swap words in string ✅ | 0 |
| 20 | Scuba Driving Code
Python 3✅ | 0 |
