Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Lam Research is hiring for Software Engineer
Experience: 0 - 1 year's
Expected Salary: 10-14 LPA
Apply here: https://careers.lamresearch.com/job/Bangalore-Software-Engineer-1-IN-B/1217484900/?feedId=157600
Experience: 0 - 1 year's
Expected Salary: 10-14 LPA
Apply here: https://careers.lamresearch.com/job/Bangalore-Software-Engineer-1-IN-B/1217484900/?feedId=157600
โค1๐1
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name : HCL Tech
Title: Graduate Trainee (Global Service Desk)
Type: Full Time
Location: Nagpur & Lucknow
Graduation Year: 2022/2023/2024
Qualification: Graduate
Apply at HCLTech's Fresher's Portal: https://lnkd.in/g6HUG_JP
Title: Graduate Trainee (Global Service Desk)
Type: Full Time
Location: Nagpur & Lucknow
Graduation Year: 2022/2023/2024
Qualification: Graduate
Apply at HCLTech's Fresher's Portal: https://lnkd.in/g6HUG_JP
lnkd.in
LinkedIn
This link will take you to a page thatโs not on LinkedIn
I want to get such messages from you all.
All the best guys, Weekend aa chuka hai...keep hustling โฅ๏ธ๐
All the best guys, Weekend aa chuka hai...keep hustling โฅ๏ธ๐
๐ข3
#include <iostream>
#include <vector>
int countbalancingElements(vector<int>& arr) {
int n = arr.size();
int sumEven = 0, sumOdd = 0;
for (int i = 0; i < n; ++i) {
if (i % 2 == 0) {
sumEven += arr[i];
} else {
sumOdd += arr[i];
}
}
int count = 0;
int aa = 0, bb = 0;
for (int i = 0; i < n; ++i) {
if (i % 2 == 0) {
sumEven -= arr[i];
} else {
sumOdd -= arr[i];
}
if (aa + sumOdd == bb + sumEven) {
count++;
}
if (i % 2 == 0) {
aa += arr[i];
} else {
bb += arr[i];
}
}
return count;
}
Balancing Elementsโ
Zscaler
#include <vector>
int countbalancingElements(vector<int>& arr) {
int n = arr.size();
int sumEven = 0, sumOdd = 0;
for (int i = 0; i < n; ++i) {
if (i % 2 == 0) {
sumEven += arr[i];
} else {
sumOdd += arr[i];
}
}
int count = 0;
int aa = 0, bb = 0;
for (int i = 0; i < n; ++i) {
if (i % 2 == 0) {
sumEven -= arr[i];
} else {
sumOdd -= arr[i];
}
if (aa + sumOdd == bb + sumEven) {
count++;
}
if (i % 2 == 0) {
aa += arr[i];
} else {
bb += arr[i];
}
}
return count;
}
Balancing Elementsโ
Zscaler
๐1
#define pll pair<long long,long long>
#define vll vector<long long>
#define ll long long
#define vvll vector<vector<long long>>
#define vpll vector<pair<long long,long long>>
class Solution {
public:
bool isRobotBounded(string s) {
ll x=0,y=0;
ll d=0;
vvll dir={{0,1},{1,0},{0,-1},{-1,0}};
for(auto it:s)
{
if(it=='R') d=(d+1)%4;
else if(it=='L') d=(d+3)%4;
else x+=dir[d][0],y+=dir[d][1];
}
if(x==0 and y==0 or d>0) return 1;
return 0;
}
};
Encircular โ
Zscaler
#define vll vector<long long>
#define ll long long
#define vvll vector<vector<long long>>
#define vpll vector<pair<long long,long long>>
class Solution {
public:
bool isRobotBounded(string s) {
ll x=0,y=0;
ll d=0;
vvll dir={{0,1},{1,0},{0,-1},{-1,0}};
for(auto it:s)
{
if(it=='R') d=(d+1)%4;
else if(it=='L') d=(d+3)%4;
else x+=dir[d][0],y+=dir[d][1];
}
if(x==0 and y==0 or d>0) return 1;
return 0;
}
};
Encircular โ
Zscaler
โค1
vector<int> sortBinaryNumbers(vector<vector<int>>bitArrray)
{
int n = bitArrray.size();
for (int i = 0; i < n; ++i)
{
sort(bitArrray[i].begin(), bitArrray[i].end(), greater<int>());
}
int m = bitArrray[0].size();
vector<pair<vector<int>, int>>temp(n);
for (int i = 0; i < n; ++i)
{
temp[i] = {bitArrray[i], i};
}
sort(temp.begin(), temp.end(), greater < pair<vector<int>, int>>());
vector<int>res;
for (int i = 0; i < n; ++i)
{
res.push_back(temp[i].second);
}
return res;
}
Binary Storage โ
Zscaler
{
int n = bitArrray.size();
for (int i = 0; i < n; ++i)
{
sort(bitArrray[i].begin(), bitArrray[i].end(), greater<int>());
}
int m = bitArrray[0].size();
vector<pair<vector<int>, int>>temp(n);
for (int i = 0; i < n; ++i)
{
temp[i] = {bitArrray[i], i};
}
sort(temp.begin(), temp.end(), greater < pair<vector<int>, int>>());
vector<int>res;
for (int i = 0; i < n; ++i)
{
res.push_back(temp[i].second);
}
return res;
}
Binary Storage โ
Zscaler
โค1๐1
Zscalar all 4 pin โ
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
https://www.linkedin.com/jobs/view/4034938651
Snapmint hiring Data Analytics - IIT/NIT/BITS (Fresher)
Snapmint hiring Data Analytics - IIT/NIT/BITS (Fresher)
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Linkedin
#hiring #analyst #wfh #startup | Shubham Singh | 16 comments
We at EATCLUB Brands (Formerly BOX8) are hiring 2024 engineering graduates for the Business Analyst role. Do apply if you think you are a good fit!!
#hiringโฆ | 16 comments on LinkedIn
#hiringโฆ | 16 comments on LinkedIn
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Fynd is hiring for Machine Learning Researcher Intern
Apply here: https://fynd.keka.com/careers/jobdetails/68662?source=linkedin
Apply here: https://fynd.keka.com/careers/jobdetails/68662?source=linkedin
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: Anthology
Role: Associate Software Developer
YOE: 0-2 years
Apply: https://jobs.jobvite.com/anthology/job/oNuxufw2
Role: Associate Software Developer
YOE: 0-2 years
Apply: https://jobs.jobvite.com/anthology/job/oNuxufw2