Meesho Off Campus Hiring:

Role: SDE Trainee

Graduation Year: 2024 / 2025

Salary: 20 LPA (Full Time)
Stipend: 1 Lakh per month

Location: Bengaluru

Apply Link: https://youtu.be/XHn1Y3XgOhU

Telegram: https://telegram.me/PLACEMENTLELO

Registration Deadline: 14th March 2025

Meesho Exam Answers will be uploaded here 👇🏻
https://telegram.me/+_hn3cBQVbGliYTI9

Meesho Exam Discussion Group 👇🏻
https://telegram.me/+oZ4x3k1RtXdkNWU1

Exam Details: https://youtu.be/XHn1Y3XgOhU

Share this with your friends ✅

Flipkart Grid Previous Year Questions and Answers 👇🏻

1. https://youtu.be/usCTPzm9TAY

2. https://youtu.be/DEfZ41m_leg

3. https://youtu.be/5rqQO2P8buE

4. https://youtu.be/3-Y90jPqoNw

Share this with your friends who are having Flipkart Grid Exam ✅

Flipkart Grid 7.0 Exam Answers will be uploaded here 👇
https://telegram.me/+_hn3cBQVbGliYTI9

Flipkart Grid 7.0 Discussion Group 👇
https://telegram.me/+oZ4x3k1RtXdkNWU1

All slots answers will be uploaded here - Must Join both groups ✅

Share this with your friends who have Flipkart Grid exam 😇

HackWithInfy Exam Answers will be uploaded here 👇🏻
https://telegram.me/+19mMyesoV7llODI1

HackWithInfy Discussion Group 👇🏻
https://telegram.me/+6bFEm4J03OVkNDFl

Juspay Hiring Challenge 2025:

Juspay Answers will be uploaded here 👇🏻
https://telegram.me/+_hn3cBQVbGliYTI9

Juspay Discussion Group 👇🏻
https://telegram.me/+8B154b769wk4ZjY9

Share with your friends ✅

Juspay Hiring Challenge 2025:

Juspay Answers are uploaded here 👇🏻
https://telegram.me/+_hn3cBQVbGliYTI9

Juspay Discussion Group 👇🏻
https://telegram.me/+8B154b769wk4ZjY9

Share with your friends ✅

We will be uploading a video for today's Juspay Hiring Challenge all 100% correct answers at 4:30 PM ✅

Only Subscribers can view the video ‼️

So SUBSCRIBE this YouTube Channel FAST 👇🏻
https://www.youtube.com/@placementlelo
https://www.youtube.com/@placementlelo

✅ Juspay Hiring Challenge all 100% Correct Answers uploaded 👇🏻
https://youtu.be/poAWUe2TYus
https://youtu.be/poAWUe2TYus

Share this with your friends 😇

Amazon ML School Exam Answers will be uploaded here 👇🏻
https://telegram.me/+_hn3cBQVbGliYTI9

Amazon ML School Discussion Group 👇🏻
https://telegram.me/+oZ4x3k1RtXdkNWU1

Share this with your friends and college groups ✅

A
Leetcode
C++
https://telegram.me/+Q_kf6B6EFexiNmU9

class Solution {
public boolean isTrionic(int[] nums) {
int n = nums.length;
if (n < 3) return false;

for (int p = 1; p < n - 2; p++) {
if (!isStrictlyIncreasing(nums, 0, p)) continue;
for (int q = p + 1; q < n - 1; q++) {
if (isStrictlyDecreasing(nums, p, q) && isStrictlyIncreasing(nums, q, n - 1)) {
return true;
}
}
}

return false;
}

private boolean isStrictlyIncreasing(int[] nums, int start, int end) {
for (int i = start; i < end; i++) {
if (nums[i] >= nums[i + 1]) return false;
}
return true;
}

private boolean isStrictlyDecreasing(int[] nums, int start, int end) {
for (int i = start; i < end; i++) {
if (nums[i] <= nums[i + 1]) return false;
}
return true;
}
}


A
Leetcode
C++
https://telegram.me/+Q_kf6B6EFexiNmU9

B
Leetcode
C++
https://telegram.me/+Q_kf6B6EFexiNmU9

class Solution {
public:
int maxBalancedShipments(vector<int>& weights) {
int n = weights.size();
if (n == 0) return 0;

int splits = 0;
int segmentMax = weights[0];

for (int i = 1; i < n; ++i) {

if (weights[i] < segmentMax) {
++splits;
segmentMax = (i + 1 < n) ? weights[i + 1] : 0;
++i;
} else {
segmentMax = max(segmentMax, weights[i]);
}
}

return splits;
}
};

B
Leetcode
C++
https://telegram.me/+Q_kf6B6EFexiNmU9