𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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

835 views17:52

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

lnkd.in

This link will take you to a page that’s not on LinkedIn

829 views05:12

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

I want to get such messages from you all.

All the best guys, Weekend aa chuka hai...keep hustling ♥️🚀

1.1K views05:53

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

#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

1.0K views08:10

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

#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

985 viewsedited 08:13

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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

1.1K viewsedited 08:26