From 0f1351a256783e2d5b5cffc40e11130c4e744e46 Mon Sep 17 00:00:00 2001 From: aleen Date: Fri, 17 Oct 2025 02:42:32 +0000 Subject: [PATCH 1/9] implemented fizzbuzz method --- .../java/challenges/FundamentalsPractice.java | 36 ++++++++++++++++++- 1 file changed, 35 insertions(+), 1 deletion(-) diff --git a/src/main/java/challenges/FundamentalsPractice.java b/src/main/java/challenges/FundamentalsPractice.java index 64e2aca..378a08b 100644 --- a/src/main/java/challenges/FundamentalsPractice.java +++ b/src/main/java/challenges/FundamentalsPractice.java @@ -7,6 +7,8 @@ import java.util.*; +import javax.swing.event.SwingPropertyChangeSupport; + public class FundamentalsPractice { // Example: sum of two integers @@ -25,7 +27,39 @@ public static int sum(int a, int b) { // The values in parentheses are set for y * Ex: Given [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 15], you would RETURN: [3, 2, 1] */ public static int[] fizzbuzz(int[] arr) { - return null; + + int[] fizzBuzzes = new int[3]; + + int fizzTotal = 0; + int buzzTotal = 0; + int fizzBuzzTotal = 0; + + for (int i = 0; i < arr.length; i++) { + if (arr[i] % 3 == 0 && arr[i] % 5 == 0) { + System.out.println("FizzBuzz"); + fizzBuzzTotal++; + } + + else if (arr[i] % 3 == 0) { + System.out.println("Fizz"); + fizzTotal++; + } + + else if (arr[i] % 5 == 0) { + System.out.println("Buzz"); + buzzTotal++; + } + + else { + System.out.println(arr[i]); + } + } + + fizzBuzzes[0] = fizzTotal; + fizzBuzzes[1] = buzzTotal; + fizzBuzzes[2] = fizzBuzzTotal; + + return fizzBuzzes; } /** From 770d12f060c74490282ea0c523dc580f2a9c5478 Mon Sep 17 00:00:00 2001 From: aleen Date: Fri, 17 Oct 2025 02:47:16 +0000 Subject: [PATCH 2/9] improved fizzbuzz method --- .../java/challenges/FundamentalsPractice.java | 16 ++++------------ 1 file changed, 4 insertions(+), 12 deletions(-) diff --git a/src/main/java/challenges/FundamentalsPractice.java b/src/main/java/challenges/FundamentalsPractice.java index 378a08b..627a5c4 100644 --- a/src/main/java/challenges/FundamentalsPractice.java +++ b/src/main/java/challenges/FundamentalsPractice.java @@ -28,36 +28,28 @@ public static int sum(int a, int b) { // The values in parentheses are set for y */ public static int[] fizzbuzz(int[] arr) { - int[] fizzBuzzes = new int[3]; - - int fizzTotal = 0; - int buzzTotal = 0; - int fizzBuzzTotal = 0; + int[] fizzBuzzes = {0, 0, 0}; for (int i = 0; i < arr.length; i++) { if (arr[i] % 3 == 0 && arr[i] % 5 == 0) { System.out.println("FizzBuzz"); - fizzBuzzTotal++; + fizzBuzzes[2]++; } else if (arr[i] % 3 == 0) { System.out.println("Fizz"); - fizzTotal++; + fizzBuzzes[0]++; } else if (arr[i] % 5 == 0) { System.out.println("Buzz"); - buzzTotal++; + fizzBuzzes[1]++; } else { System.out.println(arr[i]); } } - - fizzBuzzes[0] = fizzTotal; - fizzBuzzes[1] = buzzTotal; - fizzBuzzes[2] = fizzBuzzTotal; return fizzBuzzes; } From ba203efa2b80793bd3a5233b9cf9cb873645b24c Mon Sep 17 00:00:00 2001 From: aleen Date: Fri, 17 Oct 2025 04:13:12 +0000 Subject: [PATCH 3/9] reverseString method --- src/main/java/challenges/FundamentalsPractice.java | 10 ++++++++-- 1 file changed, 8 insertions(+), 2 deletions(-) diff --git a/src/main/java/challenges/FundamentalsPractice.java b/src/main/java/challenges/FundamentalsPractice.java index 627a5c4..7055006 100644 --- a/src/main/java/challenges/FundamentalsPractice.java +++ b/src/main/java/challenges/FundamentalsPractice.java @@ -65,8 +65,14 @@ else if (arr[i] % 5 == 0) { * char[] charArray = str.toCharArray(); // charArray is ['h', 'e', 'l', 'l', 'o'] */ public static String reverseString(String input) { - // Your code goes here - return null; + char[] charArray = input.toCharArray(); + char[] reversedChar = new char[charArray.length]; + + for (int i = charArray.length - 1; i >= 0; i--) { + reversedChar[charArray.length - i - 1] = charArray[i]; + } + + return new String(reversedChar); } /** From 5d7f5c407f9bdb004eb5cd02457b0eea84f810a8 Mon Sep 17 00:00:00 2001 From: aleen Date: Fri, 17 Oct 2025 04:56:54 +0000 Subject: [PATCH 4/9] maxInArray method --- src/main/java/challenges/FundamentalsPractice.java | 10 ++++++++-- 1 file changed, 8 insertions(+), 2 deletions(-) diff --git a/src/main/java/challenges/FundamentalsPractice.java b/src/main/java/challenges/FundamentalsPractice.java index 7055006..fe07591 100644 --- a/src/main/java/challenges/FundamentalsPractice.java +++ b/src/main/java/challenges/FundamentalsPractice.java @@ -80,8 +80,14 @@ public static String reverseString(String input) { * Ex: [1, 5, 3, 9, 2] -> 9 */ public static int maxInArray(int[] arr) { - // Your code goes here - return 0; + int biggest = arr[0]; + + for (int i = 1; i < arr.length; i++) { + if (arr[i] > biggest) { + biggest = arr[i]; + } + } + return biggest; } public static boolean stringsAreSame(String a, String b) { From 65b01950b381d55d8a835ae74d1a8fc38835552d Mon Sep 17 00:00:00 2001 From: aleen Date: Fri, 17 Oct 2025 05:42:59 +0000 Subject: [PATCH 5/9] countVowels method --- src/main/java/challenges/FundamentalsPractice.java | 10 ++++++++-- 1 file changed, 8 insertions(+), 2 deletions(-) diff --git a/src/main/java/challenges/FundamentalsPractice.java b/src/main/java/challenges/FundamentalsPractice.java index fe07591..277cfe5 100644 --- a/src/main/java/challenges/FundamentalsPractice.java +++ b/src/main/java/challenges/FundamentalsPractice.java @@ -104,8 +104,14 @@ public static boolean stringsAreSame(String a, String b) { * - strings can be accessed like this: variable.charAt(0) returns the first character */ public static int countVowels(String input) { - // Your code goes here - return 0; + int vowels = 0; + + for (char i = 0; i < input.length(); i++) { + if (input.charAt(i) == 'a' || input.charAt(i) == 'e' || input.charAt(i) == 'i' || input.charAt(i) == 'o' || input.charAt(i) =='u') { + vowels++; + } + } + return vowels; } /** From b7bcef3f3b66030314215cdba1ba3e5f924cff2f Mon Sep 17 00:00:00 2001 From: aleen Date: Sun, 19 Oct 2025 04:51:27 +0000 Subject: [PATCH 6/9] isPrime method --- src/main/java/challenges/FundamentalsPractice.java | 14 ++++++++++++-- 1 file changed, 12 insertions(+), 2 deletions(-) diff --git a/src/main/java/challenges/FundamentalsPractice.java b/src/main/java/challenges/FundamentalsPractice.java index 277cfe5..13c2650 100644 --- a/src/main/java/challenges/FundamentalsPractice.java +++ b/src/main/java/challenges/FundamentalsPractice.java @@ -120,8 +120,18 @@ public static int countVowels(String input) { * Hint: to check if n is prime, divide it by all integers from 2 to sqrt(n). */ public static boolean isPrime(int n) { - // Your code goes here - return false; + if (n == 1) { + return false; + } + + for (int i = 2; i <= Math.sqrt(n); i++) { + if (n % i == 0) { + return false; + } + } + + return true; + } /** From 15ef3c93e97891136dc4cbba6405c355d094ccb1 Mon Sep 17 00:00:00 2001 From: aleen Date: Sun, 19 Oct 2025 22:18:42 +0000 Subject: [PATCH 7/9] factorial method --- src/main/java/challenges/FundamentalsPractice.java | 10 +++++++--- 1 file changed, 7 insertions(+), 3 deletions(-) diff --git a/src/main/java/challenges/FundamentalsPractice.java b/src/main/java/challenges/FundamentalsPractice.java index 13c2650..8d74980 100644 --- a/src/main/java/challenges/FundamentalsPractice.java +++ b/src/main/java/challenges/FundamentalsPractice.java @@ -123,7 +123,7 @@ public static boolean isPrime(int n) { if (n == 1) { return false; } - + for (int i = 2; i <= Math.sqrt(n); i++) { if (n % i == 0) { return false; @@ -142,8 +142,12 @@ public static boolean isPrime(int n) { * THIS ONE IS HARD */ public static long factorial(int n) { - // Your code goes here - return 0L; + int previousFactorial = 1; + + for (int i = n; i > 0; i--) { + previousFactorial = previousFactorial * i; + } + return previousFactorial; } From edc8d954d5f9afd9530da2e8283ece3ea4d5550b Mon Sep 17 00:00:00 2001 From: aleen Date: Mon, 20 Oct 2025 01:06:48 +0000 Subject: [PATCH 8/9] PasswordChecker --- src/main/java/challenges/PasswordChecker.java | 65 ++++++++++++++++++- 1 file changed, 64 insertions(+), 1 deletion(-) diff --git a/src/main/java/challenges/PasswordChecker.java b/src/main/java/challenges/PasswordChecker.java index c42aafb..4b78d45 100644 --- a/src/main/java/challenges/PasswordChecker.java +++ b/src/main/java/challenges/PasswordChecker.java @@ -1,4 +1,5 @@ package challenges; +import java.util.ArrayList; import java.util.Scanner; /* @@ -36,6 +37,12 @@ public static void main(String[] args) { // TODO: Output the strength rating // System.out.println(strength); + System.out.println("enter your password: "); + String password = scanner.nextLine(); + + String strength = checkPasswordStrength(password); + System.out.println(strength); + scanner.close(); } @@ -52,6 +59,62 @@ public static String checkPasswordStrength(String password) { // - Check for uppercase, lowercase, digit, and symbol // - Return the appropriate rating - return ""; // Placeholder + if (password.length() < 8) { + return "Weak"; + } + + int types = 0; + + ArrayList upperCase = new ArrayList<>(); + ArrayList lowerCase = new ArrayList<>(); + ArrayList digit = new ArrayList<>(); + ArrayList symbol = new ArrayList<>(); + + for (char c : password.toCharArray()) { + if (Character.isUpperCase(c)) { + upperCase.add(c); + } + + else if (Character.isLowerCase(c)) { + lowerCase.add(c); + } + + else if (Character.isDigit(c)) { + digit.add(c); + } + + else { + symbol.add(c); + } + } + + if (upperCase.size() > 0) { + types++; + } + + if (lowerCase.size() > 0) { + types++; + } + + if (digit.size() > 0) { + types++; + } + + if (symbol.size() > 0) { + types++; + } + + if (types == 4) { + return "Strong"; + } + + else if (types == 3) { + return "Moderate"; + } + + else { + return "Weak"; + } + } } \ No newline at end of file From 2033451ce75e03d96d074e161ffe9f3d7f4a5243 Mon Sep 17 00:00:00 2001 From: aleen Date: Mon, 20 Oct 2025 01:47:29 +0000 Subject: [PATCH 9/9] stringsAreSame method and manual test --- src/main/java/challenges/FundamentalsPractice.java | 8 +++++++- 1 file changed, 7 insertions(+), 1 deletion(-) diff --git a/src/main/java/challenges/FundamentalsPractice.java b/src/main/java/challenges/FundamentalsPractice.java index 8d74980..f486e32 100644 --- a/src/main/java/challenges/FundamentalsPractice.java +++ b/src/main/java/challenges/FundamentalsPractice.java @@ -94,7 +94,8 @@ public static boolean stringsAreSame(String a, String b) { // If strings are equal, return true. Else, return false // Hint: use .equals() to compare strings not == // Do not care about capitals HI is equal to hi look up how to do. - return false; + + return a.equalsIgnoreCase(b); } /** @@ -172,6 +173,11 @@ public static void main(String[] args) { int[] nums = {1, 5, 3, 9, 2}; System.out.println("maxInArray([1,5,3,9,2]) = " + maxInArray(nums)); // Expected: 9 + // stringsAreSame + String one = "hello"; + String two = "HELLO"; + System.out.println("stringAreSame = " + stringsAreSame(one, two)); + // countVowels String word = "banana"; System.out.println("countVowels('banana') = " + countVowels(word)); // Expected: 3