#include<bits/stdc++.h>
using namespace std;
using ll = Long Long;

int mod = 1e9 + 7;
int dp[1000001][2][2][2];

int F(int i, int reqdParity, int currparity, int ended, vector<int> &A) {
    if (i < 0) return ended;

    if (dp[i][reqdParity][currparity][ended] != -1) 
        return dp[i][reqdParity][currparity][ended];

    int newParity = (currparity + A[i]) % 2;

    ll Continue = F(i - 1, reqdParity, newParity, 0, A);
    ll EndHere = reqdParity == newParity ? F(i - 1, 1 - newParity, 0, 1, A) : 0;

    return dp[i][reqdParity][currparity][ended] = (Continue + EndHere) % mod;
}

int findNumberOfPartitions(int N, vector<int> A) {
    memset(dp, -1, sizeof(dp));
    return (F(N - 1, 0, 0, 0, A) + F(N - 1, 1, 0, 1, A)) % mod;
}

Number of partitions ✅
Oracle

#include <iostream>
#include <vector>
#include <algorithm>
using ll = long long;
using namespace std;
int getMinimumUniqueSum(vector<int> &arr) {
    sort(arr.begin(), arr.end());
    ll sum = arr[0];  
    for (int i = 1; i < arr.size(); i++) {
        if (arr[i] <= arr[i - 1]) {
            arr[i] = arr[i - 1] + 1;
        }
        sum += arr[i];
    }
    
    return sum;
}

PayPal ✅

Google is hiring SWE

For 2022, 2023, 2024 grads
Location: Bangalore

https://www.linkedin.com/posts/hidayat-khan-b188b1155_software-engineer-mobile-android-activity-7244969562650116097-WHmv

Company Name : Expedia
Role : SDE 1
Batch : 2023/2024 passouts

💻Apply Link : https://careers.expediagroup.com/jobs/job/?Software+Development+Engineer+I-Gurgaon-Haryana-j-R-90893

https://careers.lamresearch.com/job/Bangalore-ProgrammerAnalyst-1-IN-B/1217484700/?feedId=157600&utm_source=LinkedInJobPostings&utm_campaign=Lam_Linkedin

2024 batch required

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

#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

#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

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

Binary Storage ✅

Shopping Data ✅

Shopping Data ✅
Zscaler

Zscalar all 4 pin ✅

https://www.linkedin.com/jobs/view/4034938651

Snapmint hiring Data Analytics - IIT/NIT/BITS (Fresher)