import java.util.Scanner;

public class Solution {

    public static int countSundays(int startYear, int endYear) {
        int answer = 0;
        int day = 1;

        for (int year = 1900; year < startYear; year++) {
            for (int month = 1; month <= 12; month++) {
                day = (day + daysInMonth(month, year)) % 7;
            }
        }

        for (int year = startYear; year <= endYear; year++) {
            for (int month = 1; month <= 12; month++) {
                if (day == 0) {
                    answer++;
                }
                day = (day + daysInMonth(month, year)) % 7;
            }
        }

        return answer;
    }

    private static int daysInMonth(int month, int year) {
        switch (month) {
            case 4:
            case 6:
            case 9:
            case 11:
                return 30;
            case 2:
                if (isLeapYear(year)) {
                    return 29;
                } else {
                    return 28;
                }
            default:
                return 31;
        }
    }

    private static boolean isLeapYear(int year) {
        if (year % 4 != 0) {
            return false;
        } else if (year % 100 != 0) {
            return true;
        } else if (year % 400 != 0) {
            return false;
        } else {
            return true;
        }
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        int startYear = in.nextInt();
        int endYear = in.nextInt();

        int result = countSundays(startYear, endYear);
        System.out.print(result);
    }
}

Well fargo |java✅

Scanner scanner = new Scanner(System.in);
        int numOfProducts = scanner.nextInt();
        int[] orders = new int[numOfProducts];

        for (int i = 0; i < numOfProducts; i++) {
            orders[i] = Math.abs(scanner.nextInt());
        }

        int disAmount = scanner.nextInt();
        int count = 0;

        for (int order : orders) {
            if (disAmount % order == 0) {
                count++;
            }
        }

        System.out.println(count);  

Wells Fargo Java✅

Baker Hughes is Hiring !!

Role: Specialist - Software Engineering- Fresher

Batch: 2023, 2022

Expected CTC: 8-15 Lpa

Location: Mumbai

Apply Now: https://unstop.com/jobs/specialist-software-engineering-baker-hughes-759124

Pagoda is Hiring !!

Role: Full-Stack Software Engineer

Batch: 2024, 2023, 2022

CTC: $148,750 - $195,000

Location: Remote - North America, South America

Apply here- https://boards.greenhouse.io/pagoda/jobs/6888659002?gh_jid=6888659002&gh_src=2c6c34b02us

❗️Norlox Solutions Off Campus Freshers Recruitment As Candidate Counsellor | 40K/M❗️

👨‍💻Job Role : US Candidate Counsellor
🎓Qualification : Any Graduate
🎖Experience : Fresher
💰Salary : Up To 40K/M

⭕️ Apply Fast :  

https://www.norloxsolutions.com/career/

Anyone Give Samsung exam OA

Company Name: Ziplr

Role: Internships and Full time roles

Batch eligible: 2022 and 2023 grads

Apply: https://ziplr.hire.trakstar.com/

Referral at Nucleus Software

https://www.linkedin.com/posts/rishabhhmishra_freshershiring-activity-7106956983710195712--eod

def minimumCost(price):
    n = len(price)
    price.append(0)
    ans = float('inf')
    last = {price[0]: 0}
    for i in range(1, n):
        v = price[i]
        price[i] += price[i - 1]
        if last.get(v) != None:
            ans = min(ans, price[i] - price[last[v]] + v)
        last[v] = i
    return ans if ans != float('inf') else -1

n = int(input())
price = list(map(int,input().split(' ')))
print(minimumCost(price))

Python 3✅
Amazon