🚀 Dive into Code Mastery: Spring & Spring Boot Extravaganza! 🌐

Dear Future Code Maestros! 🧑‍💻

Are you ready to embark on a coding odyssey through the enchanting realms of Spring and Spring Boot? Join our immersive 2-week program designed to elevate your coding prowess to new heights. This is your chance to delve into the magic of coding, learn real-world skills, and craft your own coding legacy!

Program Highlights:

🌱 Weeks of Wisdom:

Duration: 2 thrilling weeks
Commitment: Devote 2 hours daily to the quest
🛠️ Forge Your Skills with:

Spring Symphony: Master Spring 6 and Spring Boot 3
Hibernate Harmony: Attune your skills with Hibernate 5
Cloud Chronicles: Conquer Azure DevOps and GitHub
Pipeline Prowess: Navigate the art of seamless deployments
💻 Daily Itinerary:

Time Magic: 2 dedicated hours each day
🔍 Technological Alchemy - Unlock the Secrets Of:

Docker Dynamics
Swagger Sorcery
Spring Security Enchantment
AOP Wizardry
🔧 Tools & Platforms – Your Arsenal of Power:

Azure DevOps: The Citadel of Coordination
GitHub: The Repository Realm
Pipeline Setup Potency
🌟 Grand Finale: The Project Odyssey!
Apply your newly acquired skills to a live project, crafting a portfolio that reflects your coding odyssey.

Ready to Script Your Destiny?

To join this coding adventure, fill out the invitation form https://forms.gle/zjHVjetA9PgyrYGS9 . Classes commence this Sunday, and we can't wait to see you there!

🚨 Note:

Your magical journey may hold surprises, but beware of sharing personal contact information recklessly. Always adhere to the coding kingdom's etiquette.
Let the coding odyssey begin! 🚀🌐✨

You can fillout this form till sunday

will send links to your dedicated email address by sunday evening

We are ready with our DSA setup also those who want to be strong in DSA can message to join who wanna learn the concepts

Why it's free ??


It's not free,

It takes your time + my time

We are trying to place around 300 guy's by end of this year so it needs to have a strong foundation before you start building your house 🏡

We have talked for your placements with one us based startup and they have started hiring few got the offer letter too and they want someone who has good command on spring, spring boot, javascript and related tech stacks so we will help you get placed once you guy's get placed you will get the salary around 45-55k/ month min then do refer us to more and so on

We have tied up with almost 5 companies till now and their requirements are DSA and spring boot,

So we will make you proficient soon we will send you for interviews at citco and Oracle Zomato and many more such companies

out of 73 views we have recieved 11 responses and there are 387 people in channel

guys we are covering realtime project in this so personally I will say don't missout anything here

see the acceptance rate

No of submissions done to solve 1 question

seems to be small but biggest hurdle to solve

You are given an array nums of length n and a positive integer k.

A
subarray
of nums is called good if the absolute difference between its first and last element is exactly k, in other words, the subarray nums[i..j] is good if |nums[i] - nums[j]| == k.

Return the maximum sum of a good subarray of nums. If there are no good subarrays, return 0.



Example 1:

Input: nums = [1,2,3,4,5,6], k = 1
Output: 11
Explanation: The absolute difference between the first and last element must be 1 for a good subarray. All the good subarrays are: [1,2], [2,3], [3,4], [4,5], and [5,6]. The maximum subarray sum is 11 for the subarray [5,6].
Example 2:

Input: nums = [-1,3,2,4,5], k = 3
Output: 11
Explanation: The absolute difference between the first and last element must be 3 for a good subarray. All the good subarrays are: [-1,3,2], and [2,4,5]. The maximum subarray sum is 11 for the subarray [2,4,5].
Example 3:

Input: nums = [-1,-2,-3,-4], k = 2
Output: -6
Explanation: The absolute difference between the first and last element must be 2 for a good subarray. All the good subarrays are: [-1,-2,-3], and [-2,-3,-4]. The maximum subarray sum is -6 for the subarray [-1,-2,-3].


Constraints:

2 <= nums.length <= 105
-109 <= nums[i] <= 109
1 <= k <= 109

try solving this

long maxSum = Long.MIN_VALUE;for (int i = 0; i < nums.length; i++) {
long sum = 0; for (int j = i; j < nums.length; j++) {
sum += nums[j]; if (Math.abs(nums[i] - nums[j]) == k) {
maxSum = Math.max(maxSum, sum); }
}}
return (maxSum == Long.MIN_VALUE) ? 0 : maxSum;



// correct but you will get TLE here

too much time to execute this code

Some prizes will also be there if we get most participants