# Java Exercises: Find the maximum sum of a contiguous subsequence from a given sequence of numbers

## Java Basic: Exercise-223 with Solution

Write a Java program to find the maximum sum of a contiguous subsequence from a given sequence of numbers a1, a2, a3, ... an. A subsequence of one element is also a continuous subsequence.

Input:
You can assume that 1 ≤ n ≤ 5000 and -100000 ≤ ai ≤ 100000.
Input numbers are separated by a space.
Input 0 to exit.

Pictorial Presentation: Sample Solution:

Java Code:

`````` import java.util.*;
public class Main {
public static void main(String [] args) {
Scanner s = new Scanner(System.in);
System.out.println("How many integers would you like to input?");
int n = s.nextInt();
int ans = -100000;
int acc = 0;
System.out.println("Input the integers:");
for (int i=0;i<n;i++) {
acc += s.nextInt();
ans = Math.max(ans, acc);
if (acc < 0) acc = 0;
}
System.out.println("Maximum sum of the said contiguous subsequence:");
System.out.println(ans);
}
}
```
```

Sample Output:

```How many integers would you like to input?
5
Input the integers:
25 61 35 42 66
Maximum sum of the said contiguous subsequence:
229
```

Flowchart: Java Code Editor:

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.

﻿

## Java: Tips of the Day

Java: Anagrams

Generates all anagrams of a string.

```public static List<String> anagrams(String input) {
if (input.length() <= 2) {
return input.length() == 2
? Arrays.asList(input, input.substring(1) + input.substring(0, 1))
: Collections.singletonList(input);
}
return IntStream.range(0, input.length())
.mapToObj(i -> new SimpleEntry<>(i, input.substring(i, i + 1)))
.flatMap(entry ->
anagrams(input.substring(0, entry.getKey()) + input.substring(entry.getKey() + 1))
.stream()
.map(s -> entry.getValue() + s))
.collect(Collectors.toList());
}
```