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

int main ()
{
int n;
cin >> n;
vector<int64_t> min_cost(n+2, 0x3f3f3f3f3f3f3f3f);
min_cost[0] = 0;
vector<int> range(n+2), cost(n+2);
for (int i = 1; i <= n+1; i++) {
cin >> range[i];
}
for (int i = 1; i <= n+1; i++) {
cin >> cost[i];
}
for (int i = 1; i <= n+1; i++) {
if (range[i] == 0) continue;

int nxt = min(i + range[i], n+1);
int prev = max(i - range[i] - 1, 0);
int64_t cprev = cost[prev];
for (int j = prev+1; j <= nxt; j++) {
min_cost[j] = min(min_cost[j], min_cost[prev] + cost[i]);
}
}
cout << ((min_cost[n+1] < 0x3f3f3f3f3f3f3f3f) ? min_cost[n+1]: -1) << "\n";
}

Garden
Intuit ✅

Today Anyone give American Express OA?

Company Name: Anuta Network

Role: Software Engineer Intern

Batch eligible: 2022 and 2023 grads.

Apply: https://www.linkedin.com/jobs/view/3677244584

public static int find(int[] arr) {
// Sort the array in ascending order
Arrays.sort(arr);
HashSet<Double> hm=new HashSet<>();

int n = arr.length;
int count = 0;
int left = 0;
int right = n - 1;

while (left < right) {

double avgMaxMin = (arr[left] + arr[right]) / 2.0;

hm.add(avgMaxMin);

left++;
right--;
}

return hm.size();
}

Amazon OA✅

    public static String lexicographicallyMaxString(String inputStr) {
        char[] chars = inputStr.toCharArray();
        int n = chars.length;
        HashSet<Character> c=new HashSet<>();

    
        Map<Character, Integer> charCount = new HashMap<>();
        for (char ch : chars) {
            charCount.put(ch, charCount.getOrDefault(ch, 0) + 1);
        }

      
        PriorityQueue<Character> pq = new PriorityQueue<>((a, b) -> a-b);
        for (char ch : charCount.keySet()) {
            pq.add(ch);
            c.add(ch);
        }

      
        StringBuilder sb = new StringBuilder();
        while (!pq.isEmpty()) {
            char currentChar = pq.poll();
            if(c.contains(currentChar)){
            sb.append(currentChar);
            c.remove(currentChar);
            }
        }

        return sb.toString();
    }

Modify the string ✅

Company Name: Jade Global Software

Role: Associate Analyst

Batch eligible: 2023 grads only

Apply: https://myanatomy.in/events-and-hackathon/jade-global-software/jade-global-software-1970-01-01

P.S: Only apply if you don’t have any offers.

BOX ID Systems hiring software developer

Apply : https://www.showwcase.com/job/8243-software-developer

Company Name: American Express

Role: Software Engineer

Batch eligible: 2024 grads only.

Apply: https://aexp.eightfold.ai/careers/job/17212750

Note: M.Tech, B.Tech + M.Tech, MCA and M.Sc passing out in 2024 grads are eligible only. (Only Master degree)

Company Name: GE Healthcare

Role: Software Engineer Specialist

Batch eligible: 2022 and 2023 grads.

Apply: https://jobs.gecareers.com/healthcare/global/en/job/R3724264/Software-Engineering-Specialist

Cisco Interview Experience :

1)First introduction
2)Then she asked about course like i have done cisco ccna course that
3)Then about web dev internship
4)College Project Explain
5)About python
6)Why python
7)She gave a task like CAT BAT PAT DAT
output should be like

["CA", "BA", "PA", "DA"]
8)Then 2 questions about dependency
9)Global and local variables
10)The she gave me 2 strings and asked me how to print them in one line
11)Without using concat
12)OOPS
13)Different between python and java
14)Reverse of a number
15)Swapping
16)Why reactjs
17)API
18)Backend coding
19)If u are from ECE then they will ask logic of code
Any Questions

Ridecell hiring for various roles like Backend, iOS, Android, DevOps, and QA interns

Batch : 2024 / 2025

Apply : https://lnkd.in/dy3_VaNq

KoinBasket hiring Growth Product Management Intern

Batch ; 2025 / 2026

Apply : https://www.linkedin.com/jobs/view/3671860271

Ground truth exam help done ✅ those who will be give this exam send questions in group

Uber ✅

long long solve(int N,int M,vector<int>Arr){
    vector<int>v(N+1,INT_MAX);
    int n=N;
    for(int i=n-1;i>=0;i--){
        v[i]=min(v[i+1],Arr[i]);
    }
    long long ans=INT_MAX;
    for(int i=0;i<N;i++){
        if((i+M-1)<N){
            ans=min(ans,1ll*Arr[i]*v[i+M-1]);
        }
    }
    return ans;
}

Array transfer
Uber ✅

void dfs(int curr, int p, vector<int>* e, vector<int>& v, vector<int>& par, vector<int>& A){
    par[curr] = p;
    v[curr] = A[curr - 1];
    for(auto it : e[curr]){
        if(it == p) continue;
        dfs(it, curr, e, v, par, A);
        v[curr] += v[it];
    }
}
int solve(int N, vector<vector<int>> edges, vector<int> A){
    vector<int> e[N+1];
    map<vector<int>, int> mp;
    int c = 0;
    for(auto it : edges){
        e[it[0]].push_back(it[1]);
        e[it[1]].push_back(it[0]);
        mp[{it[0], it[1]}] = mp[{it[1], it[0]}] = c;
        c++;
    }
    int sum = 0;
    for(auto it : A) sum += it;
    vector<int> v(N+1, 0), par(N+1, 0);
    dfs(1, 0, e, v, par, A);
    int ans = sum;
    int id = edges.size();

    for(int i = 1; i <= N; i++){
        int a = sum - v[i];
        if(abs(a - v[i]) < ans){
            ans = abs(a - v[i]);
            id = mp[{par[i], i}] + 1;
        }
        else if(abs(a - v[i]) == ans){
            id = min(id, mp[{par[i], i}] + 1);
        }
    }
    return id;
}

Division Nodes ✅
Uber