import math
from collections import Counter
def solve(n, chars):
    if n == 1:
        return 1
    ans = Counter(chars)
    a = [freq for freq in ans.values() if freq > 0]
    if len(a) == 1:
        return a[0]
    sum_gcd = 0
    len_freqs = len(a)
    for i in range(len_freqs):
        for j in range(i + 1, len_freqs):
            sum_gcd += math.gcd(a[i], a[j])
    return sum_gcd

Phone pe ✅

def ok(n, arr):
    acha = sum(arr)
    theekhai = 0
    for i in range(n):
        acha = acha - theekhai - arr[i]
        if theekhai == acha:
            return i
        theekhai += arr[i]
    return -1

Phonepe ✅

def solve(n, plants, k):
    uff = 0
    a = k
    for i in range(n):
        if plants[i] <= a:
            a -= plants[i]
            uff += 1
        else:
            steps += 2 * i + 1
            a = k - plants[i]
    return uff

Phone pe ✅

Split it up ✅

Pitney Bowes is hiring QA Interns

2025/2024/2023 passouts can apply

https://careers.pitneybowes.com/global/en/job/R18422/Intern-QA?rx_job=R18422&rx_medium=post&rx_paid=0&rx_r=none&rx_source=linkedinll&rx_ts=20240718T021606Z&rx_viewer=f31609e0b41311ee90450bb95a3380bef7666ebed64d4e95aade908439480d1d

intern at take you forward https://www.linkedin.com/posts/takeuforward_internship-drive-tomorrow-at-8-pm-if-you-activity-7220012171378798592-zXqN?utm_source=share&utm_medium=member_desktop

NoScrubs is hiring Full-Stack Engineer Intern (previous intern experience is must)

For 2024, 2025, 2026 grads

Location: Remote

Stipend - 40K per month

Apply - https://wellfound.com/jobs/3062383-full-stack-engineer-intern

https://forms.office.com/pages/responsepage.aspx?id=W8FT8jyv2EaRBTCyeq83uQqH6OaTWbdFvQLgqAudlD5URE1JVExNWE1QUjhDSjdOWUdUU0xFTEEwQy4u

iMocha Hiring Prompt Engineering Intern

Students pursuing or completed B.Sc/BCA/MCA/BE/B.Tech.
- Only freshers can apply.
- Proficiency in programming languages and technical skills.
- Excellent written and verbal communication skills.
- Ability to collaborate effectively within a team and across departments.
- Eagerness to learn and contribute to the development of AI-driven solutions.

Pay range: 7K-12K INR per month

Walmart | Sparkathon

Eligibility: 2025 and 2026 grads

Chance to get a software development internship at Walmart.

https://walmart.converge.tech/content/converge/en_in/sparkathon.html

Amazon is hiring for SDE l and SDE ll roles

SDE l : 2023/2022/2021 batches and below

SDE ll : 3+ year experience

Send resume : shivg7706@gmail.com

Subject Format of mail : Name | Company | Experience | Preferred Location | SDE l / SDE ll

Resume file name : YOURFULLNAME.pdf

Always dreamed of studying at IIT? 🎓

Now you can, without JEE!

IIT Guwahati presents a unique Credit Linked Program in Computer Science where you can earn 24 program credits (equivalent to a minor degree) with live modules and rigorous assessments by IIT professors. 🖥️📊

Gain in-depth knowledge in Programming, Math for CS, Data Structures, Algorithms, and more.

This is your second chance to experience IIT-quality education! 🎓

Enrol now and join the prestigious IIT ecosystem without the stress of an entrance exam 🌐

Apply now, Limited Seats Available:  https://epcw.short.gy/AC_IITG_TG

Urgent hiring Bulk Fresher and Interns- PAN -2024
Post Name - Multiple Positions and HR
non IT Freshers & Experience.

Interested Apply here:-https://lnkd.in/gerxxYci


Remote and WFH both options are available.
( Preferably Experience)
- Laptop and welcome kit will provided.
-5 Days working
Qualification - Any Degree and 12 th passout .
Salary - 3.5 LPA to 6 LPA

#include <iostream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;
const vector<pair<int, int>> directions = {{0, -1}, {0, 1}, {-1, 0}, {1, 0}};
const vector<char> dirChar = {'L', 'R', 'U', 'D'};
int minCostToReachDestination(int N, vector<vector<char>>& Dir, int Sx, int Sy, int Dx, int Dy) {
    priority_queue<pair<int, pair<int, int>>, vector<pair<int, pair<int, int>>>, greater<>> pq;
    vector<vector<int>> cost(N, vector<int>(N, INT_MAX));
    pq.push({0, {Sx, Sy}});
    cost[Sx][Sy] = 0;
   
    while (!pq.empty()) {
        auto [curCost, pos] = pq.top();
        pq.pop();
       
        int x = pos.first;
        int y = pos.second;
                if (x == Dx && y == Dy) {
            return curCost;
        }
            for (int i = 0; i < 4; ++i) {
            int nx = x + directions[i].first;
            int ny = y + directions[i].second;
           
            if (nx >= 0 && nx < N && ny >= 0 && ny < N) {
                int newCost = curCost + (Dir[x][y] == dirChar[i] ? 0 : 1);
                if (newCost < cost[nx][ny]) {
                    cost[nx][ny] = newCost;
                    pq.push({newCost, {nx, ny}});
                }
            }
        }
    }
   
    return -1;
}

Cost optimization
Google ✅