Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Delhivery is urgently hiring for Associate/ Senior Associate - Inside Sales role based in Goa. Interested candidates, please share your resume to sanjana.suresh@delhivery.com ASAP.
Mention subject line as : Resume for Inside Sales role - Goa.
Requisites:
- Min 0 to 5yrs of exp in Inside sales
- Excellent communication skills
- Good with sales pitch, negotiations and cold calling
Note: we will get in touch only with the shortlisted profiles.
Mention subject line as : Resume for Inside Sales role - Goa.
Requisites:
- Min 0 to 5yrs of exp in Inside sales
- Excellent communication skills
- Good with sales pitch, negotiations and cold calling
Note: we will get in touch only with the shortlisted profiles.
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> tmp(n);
for(int i=0; i<n; i++)
{
cin>>tmp[i];
}
int k;
cin>>k;
vector<int> prefMax(n), suffMin(n);
int mx = 0;
for(int i=0; i<n; i++)
{
mx = max(tmp[i], mx);
prefMax[i] = mx;
}
int mn = INT_MAX;
for(int i=n-1; i>=0; i--)
{
mn = min(mn, tmp[i]);
suffMin[i] = mn;
}
int res = 0;
for(int i=0; i<n-1; i++)
{
if(prefMax[i] + suffMin[i+1] >= k)
res++;
}
cout<<res<<endl;
return 0;
}
Organisation Flipkart OAโ
using namespace std;
int main(){
int n;
cin>>n;
vector<int> tmp(n);
for(int i=0; i<n; i++)
{
cin>>tmp[i];
}
int k;
cin>>k;
vector<int> prefMax(n), suffMin(n);
int mx = 0;
for(int i=0; i<n; i++)
{
mx = max(tmp[i], mx);
prefMax[i] = mx;
}
int mn = INT_MAX;
for(int i=n-1; i>=0; i--)
{
mn = min(mn, tmp[i]);
suffMin[i] = mn;
}
int res = 0;
for(int i=0; i<n-1; i++)
{
if(prefMax[i] + suffMin[i+1] >= k)
res++;
}
cout<<res<<endl;
return 0;
}
Organisation Flipkart OAโ
๐1
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
int n, m;
cin >> n >> m;
vector<vector<int>> v(n, vector<int>(m));
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
cin >> v[i][j];
}
}
map<int, int> mp;
for (int j = 0; j < m; j++)
{
int mx = 0;
for (int i = 0; i < n; i++)
{
mx = max(mx, v[i][j]);
}
for (int i = 0; i < n; i++)
{
if (v[i][j] == mx)
mp[i]++;
}
}
vector<vector<int>> dp;
for (auto it : mp)
{
dp.push_back({it.second, it.first});
}
sort(dp.rbegin(), dp.rend());
double ans = 0;
int id = -1, count = 0;
for (int i = 0; i < dp.size(); i++)
{
if (dp[i][0] == dp[0][0])
{
double sum = 0.0;
int ind = dp[i][1];
for (int j = 0; j < m; j++)
{
sum += v[ind][j];
}
double avg = sum / m;
if (ans < avg)
{
ans = avg;
id = ind, count = dp[i][0];
}
}
else
{
break;
}
}
cout << id << " " << count << endl;
}
Network code flipkart โ
using namespace std;
#define int long long
signed main()
{
int n, m;
cin >> n >> m;
vector<vector<int>> v(n, vector<int>(m));
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
cin >> v[i][j];
}
}
map<int, int> mp;
for (int j = 0; j < m; j++)
{
int mx = 0;
for (int i = 0; i < n; i++)
{
mx = max(mx, v[i][j]);
}
for (int i = 0; i < n; i++)
{
if (v[i][j] == mx)
mp[i]++;
}
}
vector<vector<int>> dp;
for (auto it : mp)
{
dp.push_back({it.second, it.first});
}
sort(dp.rbegin(), dp.rend());
double ans = 0;
int id = -1, count = 0;
for (int i = 0; i < dp.size(); i++)
{
if (dp[i][0] == dp[0][0])
{
double sum = 0.0;
int ind = dp[i][1];
for (int j = 0; j < m; j++)
{
sum += v[ind][j];
}
double avg = sum / m;
if (ans < avg)
{
ans = avg;
id = ind, count = dp[i][0];
}
}
else
{
break;
}
}
cout << id << " " << count << endl;
}
Network code flipkart โ
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
AVEVA is Hiring !!
Role: Software Developer Graduate- Fresher
Experience: 0-3 year's
CTC: 8-12 Lpa
Location: Bangalore, Hyderabad
Apply here- https://aveva.wd3.myworkdayjobs.com/AVEVA_careers/job/Bangalore-India/Software-Developer-Graduate--India_R006217
Role: Software Developer Graduate- Fresher
Experience: 0-3 year's
CTC: 8-12 Lpa
Location: Bangalore, Hyderabad
Apply here- https://aveva.wd3.myworkdayjobs.com/AVEVA_careers/job/Bangalore-India/Software-Developer-Graduate--India_R006217
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
American Express is hiring for a Fresher Analyst - Data Science!
Experience - 0-2 years
https://lnkd.in/gj6aVHGY
Experience - 0-2 years
https://lnkd.in/gj6aVHGY
lnkd.in
LinkedIn
This link will take you to a page thatโs not on LinkedIn
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Mikuni India Neemrana Require GET [Mechanical/Electronic & Communication] for their Plant based at Neemrana, Rajshatan
Qualification - BE/B.Tech
Year of passing : 2023/2022/2021
TPO & candidates are requested to get in touch!
We require Instant Joiner!
Intrested candidates can directly get in touch at virendra_shekhawat@mikuni.co.in
Qualification - BE/B.Tech
Year of passing : 2023/2022/2021
TPO & candidates are requested to get in touch!
We require Instant Joiner!
Intrested candidates can directly get in touch at virendra_shekhawat@mikuni.co.in
def get_char_with_kth_highest_freq(s, k):
freq = {}
for char in s:
freq[char] = freq.get(char, 0) + 1
grouped = {}
for char, f in freq.items():
if f not in grouped:
grouped[f] = []
grouped[f].append(char)
sorted_groups = sorted(grouped.items(), key=lambda x: (-x[0], x[1]))
if k > len(sorted_groups):
return -1
return sorted(sorted_groups[k-1][1])[0]
T = int(input())
for _ in range(T):
s = input().strip()
k = int(input().strip())
print(get_char_with_kth_highest_freq(s, k))
K frequency โ
freq = {}
for char in s:
freq[char] = freq.get(char, 0) + 1
grouped = {}
for char, f in freq.items():
if f not in grouped:
grouped[f] = []
grouped[f].append(char)
sorted_groups = sorted(grouped.items(), key=lambda x: (-x[0], x[1]))
if k > len(sorted_groups):
return -1
return sorted(sorted_groups[k-1][1])[0]
T = int(input())
for _ in range(T):
s = input().strip()
k = int(input().strip())
print(get_char_with_kth_highest_freq(s, k))
K frequency โ
#include <iostream>
using namespace std;
int calculateDigitSum(int number) {
int digitSum = 0;
while (number > 0 || digitSum > 9) {
if (number == 0) {
number = digitSum;
digitSum = 0;
}
digitSum += number % 10;
number /= 10;
}
return digitSum;
}
int main() {
long long int inputNumber;
cin >> inputNumber;
cout << 1LL * inputNumber * calculateDigitSum(inputNumber);
return 0;
}
Elia and Number
Amazon โ
using namespace std;
int calculateDigitSum(int number) {
int digitSum = 0;
while (number > 0 || digitSum > 9) {
if (number == 0) {
number = digitSum;
digitSum = 0;
}
digitSum += number % 10;
number /= 10;
}
return digitSum;
}
int main() {
long long int inputNumber;
cin >> inputNumber;
cout << 1LL * inputNumber * calculateDigitSum(inputNumber);
return 0;
}
Elia and Number
Amazon โ
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
bool isPrime(int n)
{
if (n <= 1)
return false;
for (int i = 2; i <= sqrt(n); i++)
if (n % i == 0)
return false;
return true;
}
int main() {
int n;
cin >> n;
vector<int> numbers(n);
for (int i = 0; i < n; i++) {
cin >> numbers[i];
}
int firstPrimeIndex = -1;
int lastPrimeIndex = -1;
for (int i = 0; i < n; i++) {
if (isPrime(numbers[i])) {
firstPrimeIndex = i;
break;
}
}
for (int i = n - 1; i >= 0; i--) {
if (isPrime(numbers[i])) {
lastPrimeIndex = i;
break;
}
}
if (firstPrimeIndex == -1) {
cout << -1;
} else {
cout << lastPrimeIndex - firstPrimeIndex;
}
return 0;
}
Maximum Prime index
Amazon โ
#include <vector>
#include <cmath>
using namespace std;
bool isPrime(int n)
{
if (n <= 1)
return false;
for (int i = 2; i <= sqrt(n); i++)
if (n % i == 0)
return false;
return true;
}
int main() {
int n;
cin >> n;
vector<int> numbers(n);
for (int i = 0; i < n; i++) {
cin >> numbers[i];
}
int firstPrimeIndex = -1;
int lastPrimeIndex = -1;
for (int i = 0; i < n; i++) {
if (isPrime(numbers[i])) {
firstPrimeIndex = i;
break;
}
}
for (int i = n - 1; i >= 0; i--) {
if (isPrime(numbers[i])) {
lastPrimeIndex = i;
break;
}
}
if (firstPrimeIndex == -1) {
cout << -1;
} else {
cout << lastPrimeIndex - firstPrimeIndex;
}
return 0;
}
Maximum Prime index
Amazon โ
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> numbers(n);
map<int, int> frequency;
for (int i = 0; i < n; i++) {
cin >> numbers[i];
frequency[numbers[i]]++;
}
bool isBalanced = true;
for (auto &entry : frequency) {
int a = entry.first;
int b = -entry.first;
if (frequency[a] != frequency[b]) {
isBalanced = false;
break;
}
}
if (isBalanced) {
cout << 1;
} else {
cout << 0;
}
return 0;
}
Balance Array
Amazon โ
#include <vector>
#include <map>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> numbers(n);
map<int, int> frequency;
for (int i = 0; i < n; i++) {
cin >> numbers[i];
frequency[numbers[i]]++;
}
bool isBalanced = true;
for (auto &entry : frequency) {
int a = entry.first;
int b = -entry.first;
if (frequency[a] != frequency[b]) {
isBalanced = false;
break;
}
}
if (isBalanced) {
cout << 1;
} else {
cout << 0;
}
return 0;
}
Balance Array
Amazon โ
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: Siemens-Healthineers
Role: Graduate Engineer Trainee
Batch eligible: 2022 and 2023 grads
Apply: https://bit.ly/3RBuEB9
Role: Graduate Engineer Trainee
Batch eligible: 2022 and 2023 grads
Apply: https://bit.ly/3RBuEB9
Harry Quest โ
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int dp[100001];
int solve(int n,vector<int>& ar,int ci){
if(ci>=n) return INT_MAX;
if(ci==n-1){
return 0;
}
if(dp[ci]!=-1) return dp[ci];
int a=INT_MAX,b=INT_MAX,c=INT_MAX;
if(ci+1<n){
int a1=0;
a1+=abs(ar[ci]-ar[ci+1])+solve(n,ar,ci+1);
a=min(a1,a);
}
if(ci+2<n){
int b1=0;
b1+=abs(ar[ci]-ar[ci+2])+solve(n,ar,ci+2);
b=min(b1,b);
}
if(ci+3<n){
int c1=0;
c1+=abs(ar[ci]-ar[ci+3])+solve(n,ar,ci+3);
c=min(c1,c);
}
return dp[ci]=min(a,min(b,c));
}
int main(){
int n;
cin>>n;
vector<int>ar;
for(int i=0;i<n;i++){
int a;
cin>>a;
ar.push_back(a);
}
if(n==1) return ar[0];
memset(dp,-1,sizeof(dp));
cout<<solve(n,ar,0);
}
Jump 3
Amazon โ
using namespace std;
#define ll long long
int dp[100001];
int solve(int n,vector<int>& ar,int ci){
if(ci>=n) return INT_MAX;
if(ci==n-1){
return 0;
}
if(dp[ci]!=-1) return dp[ci];
int a=INT_MAX,b=INT_MAX,c=INT_MAX;
if(ci+1<n){
int a1=0;
a1+=abs(ar[ci]-ar[ci+1])+solve(n,ar,ci+1);
a=min(a1,a);
}
if(ci+2<n){
int b1=0;
b1+=abs(ar[ci]-ar[ci+2])+solve(n,ar,ci+2);
b=min(b1,b);
}
if(ci+3<n){
int c1=0;
c1+=abs(ar[ci]-ar[ci+3])+solve(n,ar,ci+3);
c=min(c1,c);
}
return dp[ci]=min(a,min(b,c));
}
int main(){
int n;
cin>>n;
vector<int>ar;
for(int i=0;i<n;i++){
int a;
cin>>a;
ar.push_back(a);
}
if(n==1) return ar[0];
memset(dp,-1,sizeof(dp));
cout<<solve(n,ar,0);
}
Jump 3
Amazon โ
int main(){
int n;
cin>>n;
vector<int>ar;
for(int i=0;i<n;i++){
int a;
cin>>a;
ar.push_back(a);
}
int ans=0;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
int x=__gcd(ar[i],ar[j]);
int y=(ar[i]*ar[j])/x;
if((y-x)==0) ans++;
}
}
cout<<ans;
}
Null GL pairsโ
int n;
cin>>n;
vector<int>ar;
for(int i=0;i<n;i++){
int a;
cin>>a;
ar.push_back(a);
}
int ans=0;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
int x=__gcd(ar[i],ar[j]);
int y=(ar[i]*ar[j])/x;
if((y-x)==0) ans++;
}
}
cout<<ans;
}
Null GL pairsโ
#include <iostream>
using namespace std;
int calculateCombinations(int totalSum, int maxNumber) {
int count = 0;
for (int i = 1; i <= maxNumber; i++) {
for (int j = 1; j <= maxNumber; j++) {
int thirdNumber = totalSum - i - j;
if (thirdNumber <= maxNumber && thirdNumber > 0 && thirdNumber <= maxNumber) {
count++;
}
}
}
return count;
}
int main() {
int sum, maxNum;
cin >> sum >> maxNum;
cout << calculateCombinations(sum, maxNum);
return 0;
}
Distributed Car toy โ
using namespace std;
int calculateCombinations(int totalSum, int maxNumber) {
int count = 0;
for (int i = 1; i <= maxNumber; i++) {
for (int j = 1; j <= maxNumber; j++) {
int thirdNumber = totalSum - i - j;
if (thirdNumber <= maxNumber && thirdNumber > 0 && thirdNumber <= maxNumber) {
count++;
}
}
}
return count;
}
int main() {
int sum, maxNum;
cin >> sum >> maxNum;
cout << calculateCombinations(sum, maxNum);
return 0;
}
Distributed Car toy โ
Tomorrow anyone give Google OA will share codes
Also Share this group with college mates
Also Share this group with college mates
New Shelf Amazon solution
#include <iostream>
#include <vector>
using namespace std;
long long int calculateInverse(long long int number, long long int modulus) {
long long int modulus0 = modulus;
long long int resultY = 0, resultX = 1;
if (modulus == 1)
return 0;
while (number > 1) {
long long int quotient = number / modulus;
long long int temp = modulus;
modulus = number % modulus;
number = temp;
temp = resultY;
resultY = resultX - quotient * resultY;
resultX = temp;
}
if (resultX < 0)
resultX += modulus0;
return resultX;
}
long long calculateUniqueCount(vector<long long> &numbers) {
vector<long long> uniqueNumbers;
for (auto &num : numbers) {
auto it = lower_bound(uniqueNumbers.begin(), uniqueNumbers.end(), num);
if (it == uniqueNumbers.end())
uniqueNumbers.push_back(num);
else
*it = num;
}
return uniqueNumbers.size();
}
int main() {
long long int numElements;
cin >> numElements;
vector<long long> inputNumbers(numElements);
for (int i = 0; i < numElements; i++)
cin >> inputNumbers[i];
long long uniqueCount = calculateUniqueCount(inputNumbers);
int modulusM = (int)(1e6 + 7);
cout << calculateInverse(uniqueCount, modulusM);
return 0;
}
#include <iostream>
#include <vector>
using namespace std;
long long int calculateInverse(long long int number, long long int modulus) {
long long int modulus0 = modulus;
long long int resultY = 0, resultX = 1;
if (modulus == 1)
return 0;
while (number > 1) {
long long int quotient = number / modulus;
long long int temp = modulus;
modulus = number % modulus;
number = temp;
temp = resultY;
resultY = resultX - quotient * resultY;
resultX = temp;
}
if (resultX < 0)
resultX += modulus0;
return resultX;
}
long long calculateUniqueCount(vector<long long> &numbers) {
vector<long long> uniqueNumbers;
for (auto &num : numbers) {
auto it = lower_bound(uniqueNumbers.begin(), uniqueNumbers.end(), num);
if (it == uniqueNumbers.end())
uniqueNumbers.push_back(num);
else
*it = num;
}
return uniqueNumbers.size();
}
int main() {
long long int numElements;
cin >> numElements;
vector<long long> inputNumbers(numElements);
for (int i = 0; i < numElements; i++)
cin >> inputNumbers[i];
long long uniqueCount = calculateUniqueCount(inputNumbers);
int modulusM = (int)(1e6 + 7);
cout << calculateInverse(uniqueCount, modulusM);
return 0;
}
#include <iostream>
using namespace std;
int calculateDigitSum(int number) {
int digitSum = 0;
while (number > 0 || digitSum > 9) {
if (number == 0) {
number = digitSum;
digitSum = 0;
}
digitSum += number % 10;
number /= 10;
}
return digitSum;
}
int main() {
long long int inputNumber;
cin >> inputNumber;
cout << 1LL * inputNumber * calculateDigitSum(inputNumber);
return 0;
}
Elia and number
using namespace std;
int calculateDigitSum(int number) {
int digitSum = 0;
while (number > 0 || digitSum > 9) {
if (number == 0) {
number = digitSum;
digitSum = 0;
}
digitSum += number % 10;
number /= 10;
}
return digitSum;
}
int main() {
long long int inputNumber;
cin >> inputNumber;
cout << 1LL * inputNumber * calculateDigitSum(inputNumber);
return 0;
}
Elia and number