class UserMainCode(object):
    @classmethod
    def solve(cls, input1, input2):
        maxi = float('-inf')
        total_sum = sum(input1)
       
        for it in input1:
            maxi = max(maxi, total_sum - it)
       
        return maxi

frog in the pond ✅

int maxLcmOfPairs(int arr[], int n){ 
  int maxLCM = -1;

  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {

      maxLCM  = max(maxLCM, (arr[i] * arr[j]) / __gcd(arr[i], arr[j]));
    }
  }

  return maxLCM;
}

Pair problem ✅

class UserMainCode(object):
    @classmethod
    def reduceTheBill(cls, input1):
        binary_input = bin(input1)[2:]
        res = []
        for i in range(len(binary_input)):
            flipped_bit = '1' if binary_input[i] == '0' else '0'
            flipped_binary = binary_input[:i] + flipped_bit + binary_input[i+1:]
            res.append(int(flipped_binary, 2))
        return min(res)

Reduce the Bill ✅

public static int countBountyNumbers(int N) {
        int MOD = 10007;

        long totalNDigitNumbers = 9 * (long) Math.pow(10, N - 1);
        long noZeros = (long) Math.pow(9, N);
        long oneZero = (N - 1) * 9 * (long) Math.pow(9, N - 2);
        long validNumbers = (totalNDigitNumbers - noZeros - oneZero) % MOD;

        if (validNumbers < 0) {
            validNumbers += MOD;
        }

        return (int) validNumbers;
    }

Bounty ✅

def lineUp(commands):
    size = len(commands)
    deg = 0
    temp = 0
    for i in range(0,size):
        if commands[i] == 'L':
            deg += -90
        elif commands[i] == 'R':
            deg += 90
        elif commands[i] == 'A':
            deg += 180
        if deg%180==0:
            temp += 1
            deg = 0
    return temp

Catagrowth Technologies | 0-2 yrs | Intern and FTE opportunity | Golang / Reactjs/ NextJS/ Posture

Reach out - akshat@fealtyx.com

Intern stipend - 20k -30k with PPO opportunity

For full-time - 6-9 LPA CTC

Amber is hiring Associate Software Engineer

For 2023, 2022 grads

Location - Pune

Check out this job at Amber: https://www.linkedin.com/jobs/view/3945238191

Plivo is hiring SDET-1 (Full Time)

For 2023, 2022 grads

https://www.linkedin.com/posts/vipultiwari_plivo-2020531-software-development-engineer-activity-7205093765923921922-88Ny

Cross Number puzzle ✅
Wiley Edge

🚨JOB OPENING UPDATES🚨

Company – Frost & Sullivan
Role – Intern - Data Science & AI Engineer
Exp. – Fresher
Apply Here – https://www.linkedin.com/jobs/view/3941301549

Company – Cloud Elevate Technologies Pvt Ltd
Role – Data Science Intern
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/work-from-home-part-time-data-science-internship-at-cloud-elevate-technologies-pvt-ltd1717729574?utm_source=cp_link&referral=web_share

Company – ProAnalyst
Role – Data Analyst Interns
Exp. – Fresher
Apply Here – https://www.linkedin.com/jobs/view/3940876535

Uni Cards is #hiring for Growth Analyst.

Location: Bangalore
Experience: 0-2 yrs
Job Description: https://www.iimjobs.com/j/uni-club-growth-analyst-0-2-yrs-1420423?

Onmobile Hiring for Software Engineer - 2023/24 - 10LPA - Bangalore

https://app.joinsuperset.com/students/jobprofiles/fac0cd2a-3c1e-4fa0-af1a-5583fc0391b8

#include <iostream>
#include <vector>
using namespace std;
int andyTrucker(int N, int K, vector<int>& A) {
    int maxWeight = 0;
    for (int i = 0; i <= N - K; ++i) {
        int currentWeight = 0;
        for (int j = i; j < i + K; ++j) {
            currentWeight += A[j];
        }
        maxWeight = max(maxWeight, currentWeight);
    }

    return maxWeight;
}

def selectBox(M, N, C):
    x = 1
    while True:
        cost = M * x + N * len(str(x))
        if cost > C:
            return x - 1 
        x += 1

#include <vector>
#include <iostream>

using namespace std;

int maxProfit(int N, int K, vector<int>& cost, vector<int>& sell) {
    int maxProfit = 0;
    int currentMoney = K;

    for (int i = 0; i < N; ++i) {
        int profit = sell[i] - cost[i];
        if (profit > 0) {
            maxProfit += profit;
            currentMoney += profit;
        }
    }

    return maxProfit;
}

Profits ✅

#include <bits/stdc++.h>
using namespace std;
vector<int> distinctOrder(int g_nodes, vector<int> g_from, vector<int> g_to) {
    vector<vector<int>> adj(g_nodes + 1);
    for (int i = 0; i < g_from.size(); ++i)
    {
        adj[g_from[i]].push_back(g_to[i]);
        adj[g_to[i]].push_back(g_from[i]);
    }

    for (int i = 1; i <= g_nodes; ++i)
    {
        sort(adj[i].rbegin(), adj[i].rend());
    }

    vector<int> A;
    vector<bool> visited(g_nodes + 1, false);
    priority_queue<int> pq;
    pq.push(g_nodes); 

    while (!pq.empty())
    {
        int node = pq.top();
        pq.pop();

        if (visited[node]) continue;
        visited[node] = true;
        A.push_back(node);

        for (int neighbor : adj[node])
        {
            if (!visited[neighbor])
            {
                pq.push(neighbor);
            }
        }
    }

    return A;
}

Distinct order Traversal ✅

https://unstop.com/hackathons/novago-sde-hiring-challenge-unlock-your-future-with-a-hybrid-opportunity-novago-1024978?rstatus=1


  Position: Software Development Engineer (SDE)
  CTC: 8.5 LPA
  Bond: None
  Work Mode: Hybrid (combination of remote and in-office work)