Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
22 changes: 22 additions & 0 deletions submissions/BhoomiJaiswal/FibonacciSeries/solution.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
// solution.java
import java.util.Scanner;

public class FibonacciSeries {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("Enter number of terms: ");
int n = sc.nextInt();

int a = 0, b = 1;

System.out.print("Fibonacci Series: ");
for (int i = 0; i < n; i++) {
System.out.print(a + " ");
int temp = a + b;
a = b;
b = temp;
}

sc.close();
}
}
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
23 changes: 23 additions & 0 deletions submissions/BhoomiJaiswal/PalindromeCheck/solution.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
// solution.java
import java.util.Scanner;

public class PalindromeCheck {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);

System.out.print("Enter a string: ");
String str = sc.nextLine(); // Read input string

// Reverse the input string
String reversed = new StringBuilder(str).reverse().toString();

// Check if the original string is equal to the reversed string
if (str.equals(reversed)) {
System.out.println("Palindrome");
} else {
System.out.println("Not Palindrome");
}

sc.close(); // Close the Scanner to avoid memory leaks
}
}