Urgently required Freshers for Foxconn💥💥💥💥💥

Qualification: BCom, BA, BSc, Diploma, BE, BTech
Trade- EEE/ ECE/ EIE/ Mechanical/ Mechatronics

Year of Passing: 2022- 2023

Male & Female eligible.

Date of Interview: 6th September.
Venue: Impact College of Engineering and Applied Sciences.

Fill the form here: https://forms.gle/Jyy3Lnm3JwxtCAVy6

Hurry Up !!!!

Hello Everyone

Open position at Forgeahead

Python Developer - Fresher (Python, SQL)



Send your resume
tanmay.kashettiwar@forgeahead.io

Fleetx is hiring for Frontend Developer role

Fresh grads can apply

Send resume to : yesha.verma@fleetx.io

Send your Resume at: ajavutech@gmail.com

WhatsApp: 9093333888

Email: hr@briskminds.com

Send your Updated Resume at: abhishek.gupta@chauwk.com

Send your Resume: yesha.verma@fleetx.io

🎯Walk-IN Drive at AMAR UJALA
Role: Data Science Traniee

Stipend: 20k
Location: Amar Ujala Limited C-21, Sector-59, Noida

💻Apply: https://docs.google.com/forms/d/e/1FAIpQLSf0tSZA-nsosDJ-ZIx8326iD1FkvHcpmheZ48Cj6LLx1Ga2vA/viewform

📌Lepide  is Hiring QA Freshers
Location: Noida! 🚀

Are you a talented QA looking to take your career to the next level?

If you’re passionate about QA and ready to make an impact

Send your resume to
nisha.rajput@lepide.com
ayushi.sharma@lepide.com

SELECT
  c.name AS name,
  COUNT(w.customer_id) AS warehouses,
  MIN(w.volume) AS min_volume,
  MAX(w.volume) AS max_volume,
  SUM(w.volume) AS total_volume
FROM
  customers c
INNER JOIN
  warehouses w ON c.id = w.customer_id
WHERE
  w.is_active = 1
GROUP BY
  c.name
ORDER BY
  c.name ASC;

IBM ✅

def getBitDistances(n):
    binary = bin(n)[2:]
    return max(len(binary) - 1 - i for i, bit in enumerate(binary) if bit == '1')

def getTopKBitDistances(numbers, k):
    bit_distances = [(num, getBitDistances(num)) for num in numbers]
    sorted_numbers = sorted(bit_distances, key=lambda x: (-x[1], -x[0]))
    return [num for num, _ in sorted_numbers[:k]]

IBM✅

Intern Hiring
15-20K Stipend

For 2026 Batch who want Referral in Google send me resume

class Solution {
    public int solution(int[][] peanuts, int[][] carrots) {
        int N = peanuts.length;
        int M = peanuts[0].length;

        int[][] dp = new int[N][M];

        dp[0][0] = peanuts[0][0] - carrots[0][0];

        for (int j = 1; j < M; j++) {
            dp[0][j] = dp[0][j - 1] + peanuts[0][j] - carrots[0][j];
        }

        for (int i = 1; i < N; i++) {
            dp[i][0] = dp[i - 1][0] + peanuts[i][0] - carrots[i][0];
        }

        for (int i = 1; i < N; i++) {
            for (int j = 1; j < M; j++) {
                dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]) + peanuts[i][j] - carrots[i][j];
            }
        }

        return dp[N - 1][M - 1];
    }

Atlan fellowship ✅

https://www.linkedin.com/posts/shankar-kumar-yadav-817a0a165_vlsi-internship-qualifications-activity-7237492353161125888-5pov?utm_source=share&utm_medium=member_desktop

Send your resume to
cajay@synopsys.com

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

int quadruple(vector<int> arr, int n) {
    int ans = 0;
    vector<int> left(n), right(n);
    left[0] = 0;
    right[n - 1] = 0;
    for (int i = 1; i < n; i++) {
        left[i] = 0;
        for (int j = 0; j < i; j++) {
            if (arr[j] < arr[i]) {
                left[i]++;
            }
        }
    }
    for (int i = n - 2; i >= 0; i--) {
        right[i] = 0;
        for (int j = n - 1; j > i; j--) {
            if (arr[j] > arr[i]) {
                right[i]++;
            }
        }
    }
    for (int i = 1; i < n - 1; i++) {
        for (int j = i + 1; j < n - 1; j++) {
            ans += left[i] * right[j];
        }
    }
    return ans;
}

int32_t main() {
   int t;
    cin >> t;
    while(t--){
         int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    int ans = quadruple(a, n);
    cout << ans << endl;
    }



}

DB ✅