🎓 Top 15 Udemy Courses (80-90% Discount): My Udemy Courses - Ramesh Fadatare — All my Udemy courses are real-time and project oriented courses.
▶️ Subscribe to My YouTube Channel (178K+ subscribers): Java Guides on YouTube
▶️ For AI, ChatGPT, Web, Tech, and Generative AI, subscribe to another channel: Ramesh Fadatare on YouTube
1. Introduction
In this blog post, we'll explore a common problem in array processing - finding the maximum sum of a contiguous subarray of a fixed size. This problem is a variant of the sliding window technique, which is often used for array and string manipulation.
Problem
Given an array of positive integers and a positive number k, find the maximum sum of any contiguous subarray of size k.
2. Solution Steps
1. Use a sliding window of size k.
2. Slide the window across the array while keeping track of the sum of elements in the current window.
3. Update the maximum sum found so far.
4. Return the maximum sum after traversing the entire array.
3. Code Program
public class Solution {
// Main method for testing
public static void main(String[] args) {
int[] arr1 = {3, 5, 2, 1, 7};
System.out.println("Maximum sum of subarray of size 2: " + findMaxSumSubarray(arr1, 2));
int[] arr2 = {4, 2, 3, 5, 1, 2};
System.out.println("Maximum sum of subarray of size 3: " + findMaxSumSubarray(arr2, 3));
}
// Method to find the maximum sum of a subarray of size k
public static int findMaxSumSubarray(int[] arr, int k) {
int maxSum = 0, windowSum = 0;
int start = 0;
for (int end = 0; end < arr.length; end++) {
windowSum += arr[end]; // Add the next element into the window
// Slide the window when we hit the size k
if (end >= k - 1) {
maxSum = Math.max(maxSum, windowSum); // Update the maximum sum
windowSum -= arr[start]; // Remove the element going out of the window
start++; // Slide the window ahead
}
}
return maxSum;
}
}
Output:
Maximum sum of subarray of size 2: 8 Maximum sum of subarray of size 3: 10
Explanation:
The findMaxSumSubarray method implements the sliding window technique to find the subarray of size k with the maximum sum.
For example, for the input array [3, 5, 2, 1, 7] and k=2, it calculates the maximum sum as 8 from the subarray [1, 7].
Similarly, for the input [4, 2, 3, 5, 1, 2] and k=3, the maximum sum is 10 from the subarray [2, 3, 5].
My Top and Bestseller Udemy Courses. The sale is going on with a 70 - 80% discount. The discount coupon has been added to each course below:
Build REST APIs with Spring Boot 4, Spring Security 7, and JWT
![[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25](https://img-c.udemycdn.com/course/750x422/6852721_b512_2.jpg "[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25")
[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25
ChatGPT + Generative AI + Prompt Engineering for Beginners
Spring 7 and Spring Boot 4 for Beginners (Includes 8 Projects)
Available in Udemy for Business
Building Real-Time REST APIs with Spring Boot - Blog App
Available in Udemy for Business
Building Microservices with Spring Boot and Spring Cloud
Available in Udemy for Business
Java Full-Stack Developer Course with Spring Boot and React JS
Available in Udemy for Business
Build 5 Spring Boot Projects with Java: Line-by-Line Coding
Testing Spring Boot Application with JUnit and Mockito
Available in Udemy for Business
Spring Boot Thymeleaf Real-Time Web Application - Blog App
Available in Udemy for Business
Master Spring Data JPA with Hibernate
Available in Udemy for Business
Spring Boot + Apache Kafka Course - The Practical Guide
Available in Udemy for Business
Comments
Post a Comment
Leave Comment