🌟 Alight is Hiring for 2024! 🌟

🙌 Role: Financial Analyst I

📍 Job Location: Gurgaon, Haryana

🔍 Experience: 0 - 2 years

🎓 Qualification: B.Com, M.Com, BBA, MBA, CA/CS/ICWA

🔗 Link- https://careers.alight.com/us/en/job/ALIGUSR28009EXTERNALENUS/Financial-Analyst-I


All the best 👍👍

def squaredSum(arr):
    max_sum = float('-inf')
    current_sum = 0
    for num in arr:
        current_sum = max(0, current_sum + num) 
        max_sum = max(max_sum, current_sum ** 2)
    return max_sum

Squared Sum ✅

long maxSpanRelation(int idx, vector<int>& arr1, long mini, vector<int>& arr2, long sum, int k, vector<vector<long>>& dp) {
    if(idx == arr1.size()) {
        if(k == 0) {
            return mini * sum;
        }
        return 0;
    }
   
    if(dp[idx][k] != -1) return dp[idx][k];
   
    long pick = maxSpanRelation(idx + 1, arr1, min(mini, (long)arr1[idx]), arr2, sum + arr2[idx], k - 1, dp);
    long notPick = maxSpanRelation(idx + 1, arr1, mini, arr2, sum, k, dp);
   
    return dp[idx][k] = max(pick, notPick);
}

long getMaxSpanRelation(vector<int>& arr1, vector<int>& arr2, int k) {
    int n = arr1.size();
    vector<vector<long>> dp(n, vector<long>(k + 1, -1));
   
    return maxSpanRelation(0, arr1, 5001, arr2, 0, k, dp);
}

int main() {
    vector<int> arr1 = {1, 2, 3};
    vector<int> arr2 = {4, 5, 6};
    int k = 2;
   
    cout << getMaxSpanRelation(arr1, arr2, k) << endl;
   
    return 0;
}

Maximum Span Relation ✅

Company Name: Zocket

🛄 Job Title: Frontend Intern

✍🏻 YOE: 2024 and 2025 grads

➡️ Apply: https://zocket.keka.com/careers/jobdetails/50627

Please do share in your college grps and in case you are applying please react on this post:) 😇❤️

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

int f(int n) {
    int ans = 1;
    while (n != 1) {
        if (n % 2 == 0) {
            n /= 2;
        } else {
            n = 3 * n + 1;
        }
        ans++;
    }
    return ans;
}

int solve(int M) {
    int maxi = 0;
    int ans= 1;
    for (int i = 1; i <= M; i++) {
        int len = f(i);
        if (len > maxi) {
            maxi = len;
            ans = i;
        }
    }
    return ans;
}

int main() {
    int m;
    cin >> m;
    cout << solve(m) << endl;
    return 0;
}

Lost in the forest ✅

public static List<Integer> solution(int[] forest, int bird) {
        List<Integer> result = new ArrayList<>();
        int length = 0;
        boolean flyRight = true;

        while (length < 100) {
            int pos = bird;
            int stickLength = 0;

            if (flyRight) {
                while (pos < forest.length && forest[pos] == 0) {
                    pos++;
                }
            } else {
                while (pos >= 0 && forest[pos] == 0) {
                    pos--;
                }
            }

            if (pos >= 0 && pos < forest.length) {
                stickLength = forest[pos];
                bird = pos;
                result.add(pos);
                forest[pos] = 0;
                length += stickLength;
            }

            flyRight = !flyRight;
        }

        return result;
    }.

Coinbase ✅

#include <stdio.h>
#include <stdlib.h>

int compare(const void *a, const void *b) {
    return (*(int *)a - *(int *)b);
}

void findSegmentsAfterDestruction(int* houses, int housesSize, int* queries, int queriesSize, int* result) {
    qsort(houses, housesSize, sizeof(int), compare);
    int pos[100001] = {0};
    for (int i = 0; i < housesSize; i++) {
        pos[houses[i]] = 1;
    }
   
    int segments = 1;
    for (int i = 1; i < housesSize; i++) {
        if (houses[i] != houses[i-1] + 1) segments++;
    }
   
    for (int i = 0; i < queriesSize; i++) {
        int house = queries[i];
        pos[house] = 0;
       
        int hasLeftNeighbor = house > 0 ? pos[house - 1] : 0;
        int hasRightNeighbor = pos[house + 1];
       
        if (hasLeftNeighbor && hasRightNeighbor) {
            segments++;
        } else if (!hasLeftNeighbor && !hasRightNeighbor) {
            segments--;
        }
        result[i] = segments;
    }
}

Coinbase ✅