tgindex

LeetCode Weekly Solutions

описание

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

← к каналу@leetcode_weekly
6 510
подписчиков
Охват к подписчикам
148,1%
ERR
Реакции к просмотрам
0,05%
106 на 20 постов
Пересылки к просмотрам
0,04%
82
Постов в день
0,0
всего 20

Где отзываются чаще

доля реакций к просмотрам
  • 28 февр.TCS NQT Placement Resources 👇🏻 https://drive.google.com/drive/folders/1Hcg4Nv-plE4i-MysXDAlXBLE6tBXr6Ok TCS NQT Detailed Syllabus 👇🏻 https://drive.google.com/file/d/1AengePrk06O7RyFtEk_-WYxljVn87h-3/view TCS NQT Discussion Group 👇🏻 https://telegram.me/+PIVbtXnoJf5lOWQ1 TCS NQT 2026 Channel 👇🏻 https://telegram.me/+kKqtt46QMtU2MDJl TCS NQT Official Group 👇🏻 https://telegram.me/+oZ4x3k1RtXdkNWU10,46%
  • 3 авг. 2025 г.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_kf6B6EFexiNmU90,19%
  • 28 февр.TCS FREE NQT - Biggest Mass Hiring: Graduation Year: 2024 / 2025 / 2026 Eligibility: BTech / BE / MTech / ME / MCA / MSc / MS Salary: Ninja - 3.36 LPA Digital - 7 LPA Prime - 9 LPA for UG and 11.5 LPA for PG Location: PAN India Apply Link: https://www.tcs.com/careers/india/tcs-all-india-nqt-hiring Complete Application Process: https://youtu.be/YEjMevJe9wc Telegram: https://telegram.me/PLACEMENTLELO Registration End Date: 20 March 2026 Test Date: 10 March 2026 Onwards ✅ Share this with your friends 😇0,18%
  • 1 сент. 2025 г.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/0029Va4bojk90x2rq1LgdD1a0,15%
  • 1 сент. 2025 г.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/0029Vb67dZr4o7qMrkr3x70h0,15%
  • 17 сент. 2025 г.✅ TCS CodeVita Season 13 Complete Guide + Previous Year Questions with Solutions 🔥 Share this with your friends 😇0,14%
  • 1 сент. 2025 г.TCS CodeVita Complete Registration Process 👇🏻 https://youtu.be/kI_7EW7aM6g TCS CodeVita Complete Guide, Preparation Material and PYQs 👇🏻 https://youtu.be/JCkPDaSDZsE0,13%
  • 28 февр.Best Competitive Programming and Coding Groups: Leetcode Group👇 https://t.me/leetcode_answers CodeChef Group 👇 https://t.me/codechef_answers Codeforces Group 👇 https://t.me/codeforces_answers Coding Ninjas Group 👇 https://t.me/+y6lKe5QXT1w2ODhl Geeks For Geeks Group👇 https://t.me/gfg_answers0,11%
  • 17 июл. 2025 г.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/@placementlelo0,09%
  • 3 авг. 2025 г.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_kf6B6EFexiNmU90,08%
  • 16 июл. 2025 г.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 ✅0,08%
  • 17 июл. 2025 г.✅ Juspay Hiring Challenge all 100% Correct Answers uploaded 👇🏻 https://youtu.be/poAWUe2TYus https://youtu.be/poAWUe2TYus Share this with your friends 😇0,07%