ll solve(vector<int> &arr){
    int n=arr.size();
    vector<ll> pf(n),sf(n);
    pf[0]=arr[0];
    sf[n-1]=arr[n-1];
    for(int i=1;i<n;i++) pf[i]=arr[i]+pf[i-1];
    for(int i=n-2;i>=0;i--) sf[i]=arr[i]+sf[i+1];
    ll sm=0,mn=0;
    ll mx=-1e18;
    for(int i=0;i<n;i++){
        sm+=arr[i];
        if(sm>0) sm=0;
        mn=min(mn,sm);
        mx=max(mx,pf[i]-2*mn-(i<n-1?sf[i+1]:0));
    }
    return mx;
}

Subarray sums ✅

int n;
    cin>>n;
    int starts[n+1];
    for(int i=0;i<n;i++){
        cin>>starts[i];
    }
    int d;
    cin>>d;
    int l=0,r=100000;
    while(l<r){
        int mid=(l+r+1)>>1;
        int ans=1;
        int pr=0;
        for(int i=0;i<n;i++){
            if(pr>starts[i]+d){
                ans=0;
            }else{
                pr=max(pr+mid,starts[i]);
            }
        }
        if(ans){
            l=mid;
        }else{
            r=mid-1;
        }
    }
    cout<<l;

Range Selection ✅

Array Transformation ✅

#include <vector>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

vector<int> photoAlbum(vector<int>& index, vector<int>& identity) {
    int n = index.size();
    vector<int> album(n, -1);

    for (int i = 0; i < n; i++) {
        int idx = index[i];
        int id = identity[i];
        for (int j = n - 1; j > idx; j--) {
            album[j] = album[j - 1];
        }

        album[idx] = id;
    }

    return album;
}

int main() {
    int n;
    cin >> n;

    vector<int> index(n), identity(n);
    for (int i = 0; i < n; i++) {
        cin >> index[i];
    }
    for (int i = 0; i < n; i++) {
        cin >> identity[i];
    }

    vector<int> result = photoAlbum(index, identity);
    for (int id : result) {
        cout << id << " ";
    }
    cout << endl;

    return 0;
}

Photo Album
Cpp✅

Sypto is hiring for Frontend Developer Intern (2024 and 2025 grads can apply) [Only go if you have knowledge of ReactJS]

Apply: https://bit.ly/3sYE3J3

Secure Blink is hiring for Backend Developer Intern (2024 and 2025 grads)

Apply: https://bit.ly/44URJBN

Company Name: Merkle

Role: Associate Software Engineer

Batch eligible: 2022 and 2023 grads

Apply: https://www.merkle.com/content/merkle/en/careers/jobs/743999928332970.html

CometChat Hiring Trainee Engineer

location - Mumbai

Batch - 2023

Apply now
https://careers.cometchat.com/jobs/cHTX5h4Ik5_N/trainee-engineer-hybrid

Software Internship at Clearfeed

Link :
https://clearfeed.freshteam.com/jobs/Qc-tv46N596-/software-engineer-intern?ft_source=5000516891&ft_medium=5000462114

Epiq is hiring SDE Intern 😊

For 2023/2024 Grads

Link 🔗
https://epiqsystems.wd5.myworkdayjobs.com/Epiq_Careers/job/IND-Hyderabad-Sohini-Tech-Park-3rd-Floor-Financial-District/Software-Engineering-Intern_R0026243-1?

https://forms.office.com/Pages/ResponsePage.aspx?id=ijDXZen590ueqwl0o9CzAIrCTk2ctitKmr4KMcNHaQVUMkFaMFgyWTRFRENJVjI2U1VTU05FN1RPUC4u

Bikaner is providing job to the fresher with the package of 4.5 lakh to 6.2 lakh in #PAN INDIA LEVEL  kindly fill the form to get call back

#include <vector>
#include <algorithm>
#include <algorithm>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iostream>

int maxTickets(std::vector<int>& a) {
    if (a.size() == 0) return 0;

    std::sort(a.begin(), a.end());

    int m = 1;
    int c = 1;

    for (size_t i = 1; i < a.size(); ++i) {
        if (a[i] - a[i - 1] == 1 || a[i] == a[i - 1]) {
            c++;
            m = std::max(m, c);
        } else {
            c = 1;
        }
    }

    return m;
}

int main() {
    std::vector<int> a = {4, 13, 2, 3};
    int r = maxTickets(a);
    std::cout << r << std::endl;
    return 0;
}

Picking Ticket
CPP✅

Perfect pairs ✅

Maximum Distinct ✅

Max OR Array✅

static int[] commonFootSteps(int fatherPos, int martinPos, int velFather, int steps) {

int[] answer = new int[2];
int[] temp = new int[steps + 1];
for (int i = 0; i <= steps; i++)
  temp[i] = fatherPos + velFather * i - martinPos;
for (int i = 0; i <= steps; i++) {
  if (temp[i] <= 0)
   continue;
  int v2 = temp[i];
  int count = 0;
  for (int j = i; j <= steps; j++) {
   if (temp[j] % v2 == 0)
    count++;
  }

  if (answer[0] <= count) {
   answer[0] = count;
   answer[1] = v2;
  }
}

return answer;

}

Martin father ✅