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
25 changes: 25 additions & 0 deletions Day1/Java/fizz_Tobgui.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
/*
@author Pierre Tobgui
date: 1/8/2021
*/
import java.util.Scanner;

public class FizzBuzz {
public static void main(String[] args) {

Scanner input = new Scanner(System.in);
System.out.print("Enter the value of n: ");
int n = input.nextInt();
for(int i=1; i<n+1; i++) {
if(i%3 == 0 && i%5 == 0) {
System.out.println("FizzBuzz");
} else if(i%3 == 0) {
System.out.println("Fizz");
} else if(i%5 == 0) {
System.out.println("Buzz");
} else {
System.out.println(i);
}
}
}
}
5 changes: 3 additions & 2 deletions Day1/Java/fizz_nomit.java
Original file line number Diff line number Diff line change
@@ -1,11 +1,12 @@
/*
@author Nomit Pahuja
date: 27/01/19
@author Pierre Tobgui
date: 1/8/2021
*/
import java.util.Scanner;

public class FizzBuzz {
public static void main(String[] args) {

Scanner input = new Scanner(System.in);
System.out.print("Enter the value of n: ");
int n = input.nextInt();
Expand Down
44 changes: 44 additions & 0 deletions Day2/Java/Main.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,44 @@
import java.util.Scanner;
import java.util.Stack;

public class Main {

public static void main(String[]args) {
System.out.println("/* ===== String Reversal ===== */");
System.out.print("\nPlease enter the string: ");
Scanner input = new Scanner(System.in);
String str = input.next();

String reversed = reverseStr(str);
System.out.println(reversed);

}

public static String reverseStr(String str) {

Stack<Character> myStack = new Stack<Character>();
String output="";

for(int i =0;i<str.length();i++) {
myStack.push(str.charAt(i));
}

while(!myStack.isEmpty()) {
output+=myStack.pop();
}
return output;
}

public static boolean isPalindrome(String str) {

String reverse = reverseStr(str);

for(int i =0;i<str.length();i++) {
if(str.charAt(i)!=reverse.charAt(i)) {
return false;
}
}

return true;
}
}