LG I hiring

Eligibility Criteria:

• Education: B.E/B.Tech (IT/CS/ECE/EEE)
• Passout Year: 2023/2024 / 2025
•Passing Score: 65% and above throughout academics
• Location: Bangalore
• Mandate: Based out of Bangalore
• CTC: 4.90 LPA

Apply Link:

https://chat.whatsapp.com/D2OGKtVfaHZ7XcAyzeBXMg

https://t.me/jobUpdatesclub/505

https://chat.whatsapp.com/K5I2JqrGT500M3Nt0rM6As



Test mail confirm

SELECT
d.Driver_ID,
d.First_Name,
d.Last_Name,
d.Rating
FROM
driver d
WHERE
LOWER(d.First_Name) LIKE '%o%'
AND d.Rating >= 4.5
ORDER BY
d.Rating ASC;

Share with your friends too

https://t.me/code_alphix


Follow us for more codes

SELECT Vehicle_ID, Model, Capacity
FROM vehicle
WHERE Status = 'Available'
AND Vehicle_ID >= 2003
AND Vehicle_ID <= 2008;


https://t.me/code_alphix

import java.util.*;

class UserMainCode {
public int findCommonSubstrings(int input1, String input2, String input3) {
int k = input1;
if (input2.length() < k || input3.length() < k) return 0;

Set<String> substrings1 = new HashSet<>();
Set<String> substrings2 = new HashSet<>();

for (int i = 0; i <= input2.length() - k; i++) {
substrings1.add(input2.substring(i, i + k));
}

for (int i = 0; i <= input3.length() - k; i++) {
substrings2.add(input3.substring(i, i + k));
}

substrings1.retainAll(substrings2);
return substrings1.size();
}
}

Mahindra Rise Help available

DM @Mrtrueliving_ix for test clearance

📣 MEGA INTERNSHIP by Internshala 📣
Any Graduation 🎓
Batch Eligible : 22/23/24/2025/2026/2027

▪️ Stipend : 80k/month
▪️ 85000+ Intership Opportunities

Register Link 🖇️
https://internshala.com/mega-internship-sprint?utm_source=refer_copylink&utm_medium=29265073

Apply Before : 31st May ✅

Amazon HackON help available

DM @Mrtrueliving_ix

Book your slot now 👌

No doubt for clearance 💯

Edgeverve Help available

DM @Mrtrueliving_ix

💯 Test clearance 💯

Mahindra Rise || Amazon HackON Help available

DM @Mrtrueliving_ix

Those who need 💯 test Clearance ❤️

Amazon Hackthon Codes available

Dm @Mrtrueliving_ix

def gcd(a, b):
while b:
a, b = b, a % b
return a

def min_weight_range(N, A, B, C):
G = gcd(A, B)
min_weight = min(C)
max_weight = max(C)
if min_weight == max_weight:
return 0
residues = [c % G for c in C]
residues.sort()
max_gap = 0
for i in range(1, N):
max_gap = max(max_gap, residues[i] - residues[i - 1])
max_gap = max(max_gap, G - (residues[N - 1] - residues[0]))
return G - max_gap

N, A, B = map(int, input().split())
C = list(map(int, input().split()))
print(min_weight_range(N, A, B, C))