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
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
👍2
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
👍1
Java Hyd Team
🚀 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…
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
👍2
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
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
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
public static long maximumSubarraySum(int[] nums, int k) { 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;
}Do you guys want me to schedule one easy level coding test on leetcode tom?
Anonymous Poll
100%
YES
0%
NO
Java Hyd Team
https://docs.google.com/document/d/1nyA7afccGnX0m-jJ0YudsinKOoysh70haLCA1sphYVY/edit?usp=sharing
Will teach this content So be ready with the notes and keep doing code together