def raisingPower(arr):
    x = (10 ** 9) + 7
    s = [(arr[i] ** arr[i+1]) % x for i in range(len(arr)-1)]
    return s.index(max(s)) + 1

Analyzing Arrays✅
Saks

Company Name : Uber
Role : SDE 1
Batch : 2024/2023/2022 passouts

Link : https://www.uber.com/global/en/careers/list/137776/

Associate Software Engineer Role at iSign Tech
https://docs.google.com/forms/d/e/1FAIpQLSdtj-fmGQxITulW_qAYRYkugjCWH--NAZW0U9YxfolocQb3ZQ/viewform

Hiring freshers for the role of Back-end Developer Internship.

Role: Software Developer Intern (Back-end Developer)
Company: UXDLAB Software Pvt. Ltd.
Location: Sector 62, Noida (On-site)
Working Days: 5 (Mon-Fri)
Duration of Internship: 6 months

Requirements:
Technical Skills - NodeJs, HTML, CSS, Javascript etc.
Education - B.Tech with Computer Science or MCA
Joining Availability - Immediate Joiner

Interested candidates can share their resume at naina@uxdlab.us

📌Are you ready to kickstart your career in the tech world?

We're actively looking for passionate and talented individuals to join our team in the following roles:

💻 AI/ML 𝗗𝗲𝘃𝗲𝗹𝗼𝗽𝗲𝗿 (0-6 months experience)
🖥️ Python 𝗗𝗲𝘃𝗲𝗹𝗼𝗽𝗲𝗿 (0-6 months experience)
🌐 𝗪𝗼𝗿𝗱𝗣𝗿𝗲𝘀𝘀 𝗗𝗲𝘃𝗲𝗹𝗼𝗽𝗲𝗿 (0-6 months experience)
🎨 𝗪𝗲𝗯 𝗗𝗲𝘀𝗶𝗴𝗻𝗲𝗿 (0-6 months experience)

📍 𝗟𝗼𝗰𝗮𝘁𝗶𝗼𝗻: Indore

👨💻 𝗘𝗹𝗶𝗴𝗶𝗯𝗶𝗹𝗶𝘁𝘆: Freshers or candidates with up to 6 months of experience are welcome.

If you have the skills and enthusiasm to grow in a dynamic environment, we’d love to hear from you!

📩 𝗛𝗼𝘄 𝘁𝗼 𝗔𝗽𝗽𝗹𝘆: Send your resume to shikha.stevesai@gmail.com

📌HSBC Hiring
Role : Trainee Software Engineer

Eligibility : BE/B.Tech(2025) in CS / IT (with/without additional specialisation), CCE, AI ML, AI DS, Cybersecurity, Cloud

Salary : 6-10 LPA

Location : Pune

💻Apply here : https://mycareer.hsbc.com/en_GB/external/PipelineDetail/Trainee-Software-Engineer/243852

typedef long long ll;

void solve() {

  ll n = N;
  vector<vector<ll>>arr(n, vector<ll>(3));
  for (int i = 0; i < n; i++) {
    arr[i] = {[0] = people[i] , [1] = starting[i] , [2] = ending[i]};
  }
  sort(arr.begin() , arr.end() , [&](vector<ll>& a , vector<ll>& b) {
    if (a[1] == b[1]) return a[2] < b[2];
    return a[1] < b[1];
  });

  ll sum = 0;
  for (auto& x : arr) sum += x[0];

  vector<ll>dp(n, -1);
  auto recurr = [&](ll i , auto && recurr)->ll{
    if (i >= n) return 0;

    ll& ans = dp[i];
    if (ans != -1) return ans; ans = 0;

    ans = recurr(i + 1 , recurr);
    ll low = i , high = n , val = arr[i][2];
    while (high - low > 1) {
      ll mid = (low + high) >> 1;
      if (val >=  arr[mid][1]) low = mid;
      else high = mid;
    }

    ans = max(ans, arr[i][0] + recurr( low + 1 , recurr) );

    return ans;
  };



  return sum - recurr(0, recurr);

}

Meeting Room ✅

from collections import defaultdict, deque
def maxEqualGroups(a, b, c):
    d = defaultdict(list)
    for e, f in c:
        e -= 1
        f -= 1
        d[e].append(f)
        d[f].append(e)
    g = [-1] * a
    h = 0
    def bfs(i):
        j = deque([i])
        g[i] = 0
        k = [0, 0]
        k[0] += 1
        while j:
            l = j.popleft()
            m = g[l]
            for n in d[l]:
                if g[n] == -1:
                    g[n] = 1 - m
                    k[g[n]] += 1
                    j.append(n)
                elif g[n] == m:
                    return None
        return k
    for o in range(a):
        if g[o] == -1:
            p = bfs(o)
            if p is None:
                return 0
            h += min(p) * 2
    return h // 2

Two groups ✅

vector<int>freq(1000002,0);
    int n = start.size();
    for(int i=0; i<n; i++) {
        freq[start[i]]++;
        freq[end[i]+1]--;
    }
    for(int i=1; i<=1000001; i++) freq[i] += freq[i-1];
    vector<int>temp;
    for(int i=1; i<=1000000; i++) {
        if(freq[i] >= k) temp.push_back(i);
    }
    vector<int>ans;
    int p = q_start.size();
    for(int i=0; i<p; i++) {
        auto x = lower_bound(temp.begin(),temp.end(),q_start[i])-temp.begin();
        auto y = upper_bound(temp.begin(),temp.end(),q_end[i])-temp.begin();
        ans.push_back(y-x);
    }
    return ans;

Valid Number ✅

int findLowestPrice(vector<vector<string>> products, vector<vector<string>> discounts) {
    int cost = 0;
    map<string, int> mp;
    for (vector<string> &d : discounts) {
        string id = d[0];
        int gg = d[1][0] - '0';
        int disc = stoi(d[2]);
        if (gg == 0) {
            if (mp[id].find(0) == mp[id].end()) {
                mp[id][0] = disc;
            }
        }
        else {
            mp[id][0] = min(mp[id][0], disc);
        }
        else mp[id][gg]=max(mp[id][gg],disc);
    }
    for (vector<string> &p : products) {
        int price = stoi(p[0]), no_gravity12 = price;
        for (int i = 1; i < m; i++) {
            if (p[i] != "EMPTY") {
                string id = p[i];
                int d1 = mp[id][1];
                int d2 = mp[id][2];
                int price0 = mp[id].find(0) != mp[id].end() ? mp[id][0] : 0;
                int price1 = max(0, price - (d1 * price + 99)/100);
                int price2 = max(0, price - d2);
                gg = min(gg, price0, price1, price2);
            }
        }
        cost += gg;
    }
    return cost;
}

Shopping Cart Billing ✅

SELECT ID, NAME
FROM CUSTOMER
ORDER BY NAME DESC, ID ASC;

Order management system ✅
Zscaler

vector<string> processLogs(vector<string> logs, int threshold) {
  unordered_map<string, int> transaction_count;

    for (const string& log : logs) {
        istringstream iss(log);
        string sender, recipient;
        int amount;
        iss >> sender >> recipient >> amount;

      
        transaction_count[sender]++;
      
        if (sender != recipient) {
            transaction_count[recipient]++;
      }
    }

    vector<string> suspicious_users;
    for (const auto& entry : transaction_count) {
        if (entry.second >= threshold) {
            suspicious_users.push_back(entry.first);
      }
    }


  sort(suspicious_users.begin(), suspicious_users.end());

    return suspicious_users;
}

Suspicious activity from logs ✅

#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int findMinWeight(vector<int> weights, int d) {

    priority_queue<int> maxHeap(weights.begin(), weights.end());

    for (int i = 0; i < d; ++i) {
        int maxWeight = maxHeap.top();
        maxHeap.pop();
        int remainingWeight = maxWeight / 2;
      maxHeap.push(maxWeight - remainingWeight);
    }

    int totalWeight = 0;
    while (!maxHeap.empty()) {
        totalWeight += maxHeap.top();
        maxHeap.pop();
    }
   
    return totalWeight;
}

Minimum total weight ✅

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

class Solution {
public:
    int maximumInvitations(vector<int>& favourite) {
        int n = favourite.size();
        vector<bool> duoNode(n, false);
        vector<int> indegree(n, 0);
        vector<int> maxPathAt(n, 1);
       
        for (int i = 0; i < n; i++) {
            indegree[favourite[i]]++;
            if (favourite[favourite[i]] == i) {
                duoNode[i] = true;
                duoNode[favourite[i]] = true;
            }
        }
       
        int ans = 0;
        vector<bool> visited(n, false);
       
        for (int i = 0; i < n; i++) {
            if (!indegree[i]) {
                int cur = i;
                while (!duoNode[cur] && !visited[cur] && !indegree[cur]) {
                    visited[cur] = true;
                    maxPathAt[favourite[cur]] = max(maxPathAt[favourite[cur]], maxPathAt[cur] + 1);
                    cur = favourite[cur];
                    indegree[cur]--;
                }
            }
        }
       
        for (int i = 0; i < n; i++) {
            if (duoNode[i]) {
                ans += maxPathAt[i];
            }
        }
       
        int offset = 1;
        fill(maxPathAt.begin(), maxPathAt.end(), 0);
        fill(visited.begin(), visited.end(), false);
       
        for (int i = 0; i < n; i++) {
            if (!visited[i]) {
                int prev, cur = i;
                while (!maxPathAt[cur]) {
                    maxPathAt[cur] = offset++;
                    prev = cur;
                    cur = favourite[cur];
                }
                if (!visited[cur]) {
                    ans = max(ans, maxPathAt[prev] - maxPathAt[cur] + 1);
                }
                cur = i;
                while (!visited[cur]) {
                    visited[cur] = true;
                    cur = favourite[cur];
                }
            }
        }

        return ans;
    }
};

int main() {
    Solution solution;
    int N;
    cin >> N;
    vector<int> favourite(N);
   
    for (int i = 0; i < N; i++) {
        cin >> favourite[i];
        favourite[i]--;
    }

    int result = solution.maximumInvitations(favourite);
    cout << result << endl;

    return 0;
}

Barclays ✅