Behaviour
-
- {
- // if autorun is set force re-run by updating files
- $runCode = $autoRun && !$isRunning;
- }} id="auto-run" />
-
-
diff --git a/src/routes/(app)/+layout.svelte b/src/routes/(app)/+layout.svelte
index 3613f1c..ce764e4 100644
--- a/src/routes/(app)/+layout.svelte
+++ b/src/routes/(app)/+layout.svelte
@@ -6,7 +6,7 @@
import { onMount } from 'svelte';
import { goto } from '$app/navigation';
- let description = 'JavaFiddle is an online, browser-based Java IDE. Create and share Swing applications for free!';
+ let description = 'StreamCode is fork of javafiddle powered by cheerpj';
function setFiddle() {
const fragmentURL: string = window.location.hash.slice(1);
@@ -35,8 +35,8 @@
-
-
-
-
diff --git a/static/questions/1/Main.java b/static/questions/1/Main.java
new file mode 100644
index 0000000..6b30651
--- /dev/null
+++ b/static/questions/1/Main.java
@@ -0,0 +1,5 @@
+class Main {
+ public static void main(String[] args) {
+ System.out.println("Hello, World from count!");
+ }
+}
diff --git a/static/questions/1/text.html b/static/questions/1/text.html
new file mode 100644
index 0000000..b84b588
--- /dev/null
+++ b/static/questions/1/text.html
@@ -0,0 +1,142 @@
+
+
+
+
+
+
-
-
-
-
- 
- 
- 
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- > Java output console-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/static/questions/2/Main.java b/static/questions/2/Main.java
new file mode 100644
index 0000000..6b30651
--- /dev/null
+++ b/static/questions/2/Main.java
@@ -0,0 +1,5 @@
+class Main {
+ public static void main(String[] args) {
+ System.out.println("Hello, World from count!");
+ }
+}
diff --git a/static/questions/2/text.html b/static/questions/2/text.html
new file mode 100644
index 0000000..a314a60
--- /dev/null
+++ b/static/questions/2/text.html
@@ -0,0 +1,130 @@
+
+
+
+
+
+
+
+ Filter Even Numbers from a List
+Problem
+ Given a list of integers numbers, return a new list that contains only the even numbers from the original list, preserving their original order. You must implement the solution using the Java Stream API.
Function Signature
+ public List<Integer> filterEvenNumbers(List<Integer> numbers)Constraints
+ -
+
1 <= numbers.size() <= 10^5
+ -10^9 <= numbers[i] <= 10^9
+ - Order of numbers must be preserved. +
Expected Time Complexity
+ O(n) — where n is the length of the input list.
+ +Hint
+ Use numbers.stream(), filter(), and collect(Collectors.toList()).
Examples
+
+
+
+ Example 1
+
+
+ Input:
+numbers = [1, 2, 3, 4, 5, 6]
+
+Output:
+[2, 4, 6]
+
+Explanation:
+All even numbers retained in original order.
+ Example 2
+
+
+ Input:
+numbers = [7, 9, 13, 15]
+
+Output:
+[]
+
+Explanation:
+No even numbers present.
+ Example 3
+
+
+ Input:
+numbers = [10, 21, 32, 43, 54]
+
+Output:
+[10, 32, 54]
+ Edge Example
+
+ Input:
+numbers = []
+
+Output:
+[]
+
+Explanation:
+Empty input list returns empty list.
+
+ Solution
+import java.util.*;
+import java.util.stream.Collectors;
+
+public class Solution {
+ public List<Integer> filterEvenNumbers(List<Integer> numbers) {
+ // Implement using Java Stream API
+ return numbers.stream()
+ .filter(n -> n % 2 == 0)
+ .collect(Collectors.toList());
+ }
+
+ public static void main(String[] args) {
+ Solution sol = new Solution();
+ List<Integer> nums = Arrays.asList(1,2,3,4,5,6);
+ System.out.println(sol.filterEvenNumbers(nums)); // [2, 4, 6]
+ }
+}
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/static/examples/hello-world-swing/Main.java b/static/questions/hello-world-swing/Main.java
similarity index 100%
rename from static/examples/hello-world-swing/Main.java
rename to static/questions/hello-world-swing/Main.java
diff --git a/static/examples/hello-world/Main.java b/static/questions/hello-world/Main.java
similarity index 100%
rename from static/examples/hello-world/Main.java
rename to static/questions/hello-world/Main.java
diff --git a/static/questions/hello-world/text.html b/static/questions/hello-world/text.html
new file mode 100644
index 0000000..25ac725
--- /dev/null
+++ b/static/questions/hello-world/text.html
@@ -0,0 +1 @@
+
+
+ Find Maximum in a List
+Problem
+ Given a list of integers numbers, return the maximum number in the list. You must implement the solution using the Java Stream API.
Function Signature
+ public int findMaximum(List<Integer> numbers)Constraints
+ -
+
1 <= numbers.size() <= 10^5
+ -10^9 <= numbers[i] <= 10^9
+
Expected Time Complexity
+ O(n) — where n is the length of the input list.
+ +Hint
+ Use numbers.stream().max(Comparator.naturalOrder()).
Examples
+
+
+
+ Example 1
+
+
+ Input:
+numbers = [3, 1, 4, 1, 5, 9]
+
+Output:
+9
+
+Explanation:
+The maximum number in the list is 9.
+ Example 2
+
+
+ Input:
+numbers = [-5, -2, -8, -1]
+
+Output:
+-1
+
+Explanation:
+The maximum number is -1, even though all numbers are negative.
+ Edge Example
+
+ Input:
+numbers = [7]
+
+Output:
+7
+
+Explanation:
+Single element list returns that element as maximum.
+
+ Solution
+import java.util.*;
+import java.util.stream.Collectors;
+
+public class Solution {
+ public int findMaximum(List<Integer> numbers) {
+ // Implement using Java Stream API
+ return numbers.stream()
+ .max(Comparator.naturalOrder())
+ .orElseThrow(() -> new NoSuchElementException("List is empty"));
+ }
+
+ public static void main(String[] args) {
+ Solution sol = new Solution();
+ List<Integer> nums = Arrays.asList(3,1,4,1,5,9);
+ System.out.println(sol.findMaximum(nums)); // 9
+ }
+}
+