From 1389bf474963d6b20512883f2364d0717e86b54d Mon Sep 17 00:00:00 2001
From: Matin-Ardestani <m.matin.ardestani@gmail.com>
Date: Thu, 23 Apr 2026 01:44:43 +0330
Subject: [PATCH] Implement findPalindromes method

---
 src/main/java/BonusExercises.java | 24 +++++++++++++++++++++++-
 1 file changed, 23 insertions(+), 1 deletion(-)

diff --git a/src/main/java/BonusExercises.java b/src/main/java/BonusExercises.java
index e14ca3c..729530b 100644
--- a/src/main/java/BonusExercises.java
+++ b/src/main/java/BonusExercises.java
@@ -84,10 +84,32 @@ public class BonusExercises {
      */
     public List<String> findPalindromes(String string) {
         List<String> list = new ArrayList<>();
-        // todo
+
+        String[] words = string.split("\\s+|,");
+        for(String word : words){
+            if(word.length() >= 3 && isPalindrome(word)){
+                list.add(word);
+            }
+        }
+
         return list;
     }
 
+    private boolean isPalindrome(String string){
+        boolean result = true;
+        int counter = 0;
+        while(counter + 1 <= string.length() / 2){
+            char ch1 = string.charAt(counter);
+            char ch2 = string.charAt(string.length() - 1 - counter);
+            if(Character.toLowerCase(ch1) != Character.toLowerCase(ch2)){
+                result = false;
+                break;
+            }
+            counter++;
+        }
+        return result;
+    }
+
     public static void main(String[] args) {
         // you can test your code here
     }