https://docs.google.com/forms/d/e/1FAIpQLSeAu5qysyQ28TSestFmsh7kRuQOisD8L2cgKtn44CRJUSCqqg/viewform?usp=send_form


https://hackerearth.applytojob.com/apply/cbscPZCqhw/Technical-Engineer-Problem-Setter-Programming--Internship


https://amazonadgaws.hirepro.in/registration/amazonadgaws/ad4ws/apply/?event=14706&job=58568&utm_source=sp_auto_dm&utm_referrer=sp_auto_dm&fbclid=PAQ0xDSwL9yD1leHRuA2FlbQIxMAABp-NYzPLu8TFFlBartV9Qfl8f638LA5fkklysnWN0rIyk04RgJz6mUq8T9jYJ_aem_JfwWrcdk04RJJ4TKNrrx9Q


Sending test confirm ✓

✅ HighRadius Hiring Tournament – VERY IMPORTANT DETAILS

📅 Date: Today, Aug 06 (Tuesday)
🕘 Time: 9:00 PM – 10:30 PM (90 minutes)
📩 Contest Link: Will be sent via WhatsApp DMs at 8:00 PM to your registered number.
🔗 Test Link:
👉 https://thejoboverflow.com/assessment/highradius-java-oa/

🚨 Instructions:

Sign in to the platform as soon as you receive the link!

Create your profile early to avoid last-minute issues.

Late sign-in = lost time ⏱️


🧠 Duration: 90 Minutes
💻 Platform: JobOverflow
📲 Tip: Be online by 7:50 PM to receive the link and onboard quickly.

🎯 Good luck! Give your best shot!

import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] A) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        int[] a = new int[n], l = new int[n], r = new int[n];
        StringTokenizer st = new StringTokenizer(br.readLine());
        for (int i = 0; i < n; i++) a[i] = Integer.parseInt(st.nextToken());

        Deque<Integer> d = new ArrayDeque<>();
        for (int i = 0; i < n; i++) {
            while (!d.isEmpty() && a[d.peek()] <= a[i]) d.pop();
            l[i] = d.isEmpty() ? -1 : d.peek();
            d.push(i);
        }

        d.clear();
        for (int i = n - 1; i >= 0; i--) {
            while (!d.isEmpty() && a[d.peek()] < a[i]) d.pop();
            r[i] = d.isEmpty() ? n : d.peek();
            d.push(i);
        }

        long res = 0;
        for (int i = 0; i < n; i++) res += (long) a[i] * (i - l[i]) * (r[i] - i);

        d.clear();
        for (int i = 0; i < n; i++) {
            while (!d.isEmpty() && a[d.peek()] >= a[i]) d.pop();
            l[i] = d.isEmpty() ? -1 : d.peek();
            d.push(i);
        }

        d.clear();
        for (int i = n - 1; i >= 0; i--) {
            while (!d.isEmpty() && a[d.peek()] > a[i]) d.pop();
            r[i] = d.isEmpty() ? n : d.peek();
            d.push(i);
        }

        for (int i = 0; i < n; i++) res -= (long) a[i] * (i - l[i]) * (r[i] - i);

        System.out.print(res);
    }
}

Unfair multiverse 👍 // high radius 👍

import java.io.*;
import java.util.*;

class Node {
String k;
long v;
Node n;

public Node(String k, long v) {
this.k = k;
this.v = v;
this.n = null;
}
}

class HashMap { // Removed 'public' modifier
private Node[] b;
private int c;
private int s;
private static final int INIT = 16;
private static final float LF = 0.75f;
private static final int P = 31;

public HashMap() {
this.c = INIT;
this.b = new Node[c];
this.s = 0;
}

private int h(String k) {
int h = 0;
for (int i = 0; i < k.length(); i++) {
h = (h * P + k.charAt(i)) & Integer.MAX_VALUE;
}
return h & (c - 1);
}

public void put(String k, long v) {
int i = h(k);
Node n = b[i];

while (n != null) {
if (n.k.equals(k)) {
n.v = v;
return;
}
n = n.n;
}

Node nn = new Node(k, v);
nn.n = b[i];
b[i] = nn;
s++;

if ((float)s / c > LF) {
resize();
}
}

private void resize() {
int nc = c * 2;
Node[] nb = new Node[nc];

for (int i = 0; i < c; i++) {
Node n = b[i];
while (n != null) {
Node next = n.n;
int ni = (h(n.k) * nc / c) & (nc - 1);
n.n = nb[ni];
nb[ni] = n;
n = next;
}
}

b = nb;
c = nc;
}

public Long get(String k) {
int i = h(k);
Node n = b[i];

while (n != null) {
if (n.k.equals(k)) {
return n.v;
}
n = n.n;
}

return null;
}

public Long remove(String k) {
int i = h(k);
Node n = b[i];
Node p = null;

while (n != null) {
if (n.k.equals(k)) {
if (p != null) {
p.n = n.n;
} else {
b[i] = n.n;
}
s--;
return n.v;
}
p = n;
n = n.n;
}

return null;
}

public static void main(String[] args) throws IOException {
HashMap m = new HashMap();
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int Q = Integer.parseInt(br.readLine());

for (int i = 0; i < Q; i++) {
String[] p = br.readLine().split(" ");
String op = p[0];

switch (op) {
case "PUT":
String k = p[1];
long v = Long.parseLong(p[2]);
m.put(k, v);
break;
case "GET":
k = p[1];
Long r = m.get(k);
System.out.println(r != null ? r : "null");
break;
case "REMOVE":
k = p[1];
Long rm = m.remove(k);
System.out.println(rm != null ? rm : "null");
break;
}
}
}
}

HighRadius Help done ✅

Test accomplished ❤️ || Offcampus

DM for any placement Help 🙂

@Mrtrueliving_ix ✓ @Mrtrueliving_ix ✓

Amex Slots are available ❤️

@Mrtrueliving_ix ✓

Batch: 2025/26

https://jobs.cisco.com/jobs/ProjectDetail/Software-Engineer-Network-Embedded-Application-Development-Intern-India-UHR/1421663

🚨 Uber is Hiring – Software Engineer I (SDE I) 🚨
Perfect for fresh graduates or those with up to 1 year of experience!

If you’re passionate about coding and ready to launch your career in tech, this could be your golden ticket! 🌟

📍 Location: Bangalore
🎓 Eligible Batches: 2024 & 2025
💼 Role: Software Engineer I (SDE I)

🗓 Application Deadline: 8th August 2025, 12:00 PM IST
🗓 Referral Deadline: 7th August 2025, 11:00 PM IST

🔗 Direct Apply Link:
👉 https://lnkd.in/gphDKGHF

🔗 Referral Form (Optional):
👉 https://lnkd.in/guaSRB_K

Given an array A of length N, you need to create a new array B by removing exactly 2N/3 elements from A without changing the order.
The score is defined as:
Score = (The sum of the elements in the first half of B) - (The sum of the elements in the second half of B)
Your task is to find the maximum possible score.
Note:
It is guaranteed that N is divisible by 3.
Any element from A can be removed such that the score is maximized.
Input Format:
The first line contains an integer N, denoting the number of elements in A.
Each of the N subsequent lines contains an integer describing A[i].
Constraints:
1 <= N <= 10^5
1 <= A[i] <= 10^9
Sample Test Cases:
Case 1:

Input 
3
1
2
3

Output 
1

Infosys // interview Q's 👍


Adding more Q's stay tuned

https://t.me/code_alphix

Refer your friends too ❤️

Accenture is hiring now

https://cuvette.tech/app/other-jobs/6893b345ac4855041d2edb81?referralCode=GEA52O

Decisions

https://cuvette.tech/app/other-jobs/6893b2cd988d9d69f2191a98?referralCode=GEA52O

Honeywell

https://cuvette.tech/app/other-jobs/6892d8d1e7dde9e4ddb8b1fd?referralCode=GEA52O

Visa

https://cuvette.tech/app/other-jobs/6892d826e7dde9e4ddb8b1fc?referralCode=GEA52O

Barclays

https://cuvette.tech/app/other-jobs/6892d7e88cd79cbe9a292207?referralCode=GEA52O

NIIT

https://cuvette.tech/app/other-jobs/68908c0c929803019552e769?referralCode=GEA52O

Hcl Slots are available...

@Mrtrueliving_ix

All Placement Exam's help available

@Mrtrueliving_ix ✓

Capgemini is hiring now

https://app.joinsuperset.com/join/#/signup/student/jobprofiles/7256d39d-278e-46ab-bd0b-aad0c98e4c06

Batch : 2025 Only

All Placement Exam's help available

@Mrtrueliving_ix ✓

Test Clearance guarantee 😊 💯