LeetCode Weekly Solutions
前往频道在 Telegram
Latest Jobs and Internships are regularly uploaded here : https://t.me/placementlelo If you want any other exam answers for free : @exam_cheating_bot Collaborations: @growth_admin
显示更多
网络:7 053
订阅者
无数据24 小时
-67 天
-4430 天
数据加载中...
吸引订阅者
一月 '26
一月 '26
+15
在0个频道中
十二月 '25
+23
在0个频道中
Get PRO
十一月 '25
+26
在0个频道中
Get PRO
十月 '25
+33
在0个频道中
Get PRO
九月 '25
+46
在0个频道中
Get PRO
八月 '25
+102
在0个频道中
Get PRO
七月 '25
+120
在0个频道中
Get PRO
六月 '25
+83
在0个频道中
Get PRO
五月 '25
+63
在0个频道中
Get PRO
四月 '25
+58
在0个频道中
Get PRO
三月 '25
+92
在0个频道中
Get PRO
二月 '25
+109
在0个频道中
Get PRO
一月 '25
+162
在0个频道中
Get PRO
十二月 '24
+172
在0个频道中
Get PRO
十一月 '24
+125
在0个频道中
Get PRO
十月 '24
+432
在0个频道中
Get PRO
九月 '24
+3 890
在3个频道中
Get PRO
八月 '24
+279
在0个频道中
Get PRO
七月 '24
+2 907
在0个频道中
| 日期 | 订阅者增长 | 提及 | 频道 | |
| 28 一月 | +1 | |||
| 27 一月 | 0 | |||
| 26 一月 | +1 | |||
| 25 一月 | 0 | |||
| 24 一月 | +2 | |||
| 23 一月 | 0 | |||
| 22 一月 | +1 | |||
| 21 一月 | 0 | |||
| 20 一月 | +1 | |||
| 19 一月 | 0 | |||
| 18 一月 | 0 | |||
| 17 一月 | +1 | |||
| 16 一月 | 0 | |||
| 15 一月 | 0 | |||
| 14 一月 | 0 | |||
| 13 一月 | 0 | |||
| 12 一月 | +1 | |||
| 11 一月 | 0 | |||
| 10 一月 | 0 | |||
| 09 一月 | +1 | |||
| 08 一月 | 0 | |||
| 07 一月 | +1 | |||
| 06 一月 | +1 | |||
| 05 一月 | 0 | |||
| 04 一月 | +4 | |||
| 03 一月 | 0 | |||
| 02 一月 | 0 | |||
| 01 一月 | 0 |
频道帖子
TCS CodeVita Answers are uploaded here 👇🏻
https://telegram.me/+_hn3cBQVbGliYTI9
TCS CodeVita Discussion Group 👇🏻
https://telegram.me/+oZ4x3k1RtXdkNWU1
TCS CodeVita Answers Whatsapp Channel 👇🏻
https://whatsapp.com/channel/0029Vb67dZr4o7qMrkr3x70h
| 2 | ✅ TCS CodeVita Season 13 Complete Guide + Previous Year Questions with Solutions 🔥
Share this with your friends 😇 | 4 629 |
| 3 | Latest Off-Campus Jobs and Internships are Uploaded regularly here👇
1. https://telegram.me/PLACEMENTLELO
2. https://telegram.me/OFF_CAMPUS_JOBS_AND_INTERNSHIPS
✅ Must Join ✅ | 5 838 |
| 4 | TCS CodeVita Answers are uploaded here 👇🏻
https://telegram.me/+_hn3cBQVbGliYTI9
TCS CodeVita Discussion Group 👇🏻
https://telegram.me/+oZ4x3k1RtXdkNWU1
TCS CodeVita Answers Whatsapp Channel 👇🏻
https://whatsapp.com/channel/0029Vb67dZr4o7qMrkr3x70h | 1 |
| 5 | ✅ TCS CodeVita Season 13 Complete Guide + Previous Year Questions with Solutions 🔥
Share this with your friends 😇 | 6 134 |
| 6 | TCS CodeVita Answers will be uploaded here 👇🏻
https://telegram.me/+_hn3cBQVbGliYTI9
TCS CodeVita Discussion Group 👇🏻
https://telegram.me/+oZ4x3k1RtXdkNWU1
TCS CodeVita Answers Whatsapp Channel 👇🏻
https://whatsapp.com/channel/0029Vb67dZr4o7qMrkr3x70h | 5 506 |
| 7 | Only 30 minutes Left 🚨
Roadmap to become a Software Developer at Top Product Based Companies:
Register Now: https://www.placementlelo.in/pbc
Free Referral to everyone who registers 🚀 | 130 |
| 8 |  🚨 Only 1 Day Left ⚡
🎁 Get a Free Naukri Bag & Bottle
🚀 Enrol Now for Free👇
https://www.longtermcollab.com/naukri
https://www.longtermcollab.com/naukri
✅ 100% Genuine - Don’t Miss Out 😇 | 20 |
| 9 | ✅ TCS CodeVita Season 13 Complete Guide + Previous Year Questions with Solutions 🔥
Share this with your friends 😇 | 2 713 |
| 10 |  🎒 Free Bag + Sipper on Registration 😇
💼 250+ Companies Hiring Interns
🎓 Eligibility: Only 1st to 4th year college students are eligible for Free Bag and Internship Opportunities
Register Fast (FREE)👇
https://www.longtermcollab.com/naukri
https://www.longtermcollab.com/naukri | 1 418 |
| 11 | TCS CodeVita Answers will be uploaded here 👇🏻
https://telegram.me/+_hn3cBQVbGliYTI9
TCS CodeVita Discussion Group 👇🏻
https://telegram.me/+oZ4x3k1RtXdkNWU1
TCS CodeVita Answers Whatsapp Channel 👇🏻
https://whatsapp.com/channel/0029Vb67dZr4o7qMrkr3x70h | 1 596 |
| 12 | TCS CodeVita Complete Registration Process 👇🏻
https://youtu.be/kI_7EW7aM6g
TCS CodeVita Complete Guide, Preparation Material and PYQs 👇🏻
https://youtu.be/JCkPDaSDZsE | 1 470 |
| 13 | TCS CodeVita Season 13:
Graduation Year: 2026 / 2027 / 2028 / 2029
6 hours - 6 coding questions
-> Placement Opportunities
Apply Link: https://www.linkedin.com/posts/placementlelo_tcs-tcscodevita-career-activity-7368299683632332801-5Mo7
Last Date to Apply: 18th September 2025
Important Dates:
MockVita 1 - 29th August
MockVita 2 - 12th September
Round 1 Zone 1 - 10th October
Round 1 Zone 2 - 31st October
Round 2 - 14th November 2025
Telegram: https://telegram.me/PLACEMENTLELO
Zone 1 - Ahmedabad, Bangalore, Chennai, Delhi, Lucknow, Mumbai, Indore
Zone 2 - Pune, Nagpur, Kolkata, Hyderabad, Trivandrum
Join for more Jobs and Internships: https://whatsapp.com/channel/0029Va4bojk90x2rq1LgdD1a | 1 271 |
| 14 | Software Development Internship Mega Hiring:
Graduation Year: 2025 / 2026 / 2027 / 2028 / 2029
Stipend: upto 2 Lakh per month
Location: PAN India
Apply Link: https://www.placementlelo.in/mega-hiring
Telegram: https://telegram.me/PLACEMENTLELO
Must Apply ✅
Share with your friends 😇 | 5 351 |
| 15 | Companies Mass Hiring Software Engineering Intern through this contest:
Eligiblity: All college students and recent graduates
Stipend: 1 Lakh per month
Salary: 36 LPA
Location: PAN India
Apply Link: https://www.placementlelo.in/mass-hiring
Telegram: https://telegram.me/PLACEMENTLELO | 1 187 |
| 16 | ✅ Amazon ML School 12 PM 100% Correct Answers uploaded 👇🏻
https://youtu.be/YEPCH03HYkM
https://youtu.be/YEPCH03HYkM
Share this with your friends 😇 | 1 |
| 17 | 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 | 2 702 |
| 18 | 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 | 4 316 |
| 19 | Trionic Array II
Leetcode
C++
https://telegram.me/+Q_kf6B6EFexiNmU9
class Solution {
public:
bool isTrionic(vector<int>& nums) { int n = nums.size();
bool p = true; bool q = true; if( n < 4) return false;
bool last = false;
if(nums[0] >= nums[1]) return false;
for(int i = 1; i < nums.size(); i++)
{ if(nums[i-1] == nums[i]) return false;
if(p){ if( nums[i-1] > nums[i]) { p = false; i--; } }
else{
if( nums[i-1] < nums[i]){ q = false; if( i < n-2) last = true;;}
}
if( last ) if( nums[i-1] > nums[i]) return false;
}
if( nums[n-2] < nums[n-1] && !p && !q) return true;
else return false;
}
};
Trionic Array II
Leetcode
C++
https://telegram.me/+Q_kf6B6EFexiNmU9 | 70 |
| 20 | 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 ✅ | 4 202 |
