From d81de0cbacfe06873adfeb7ef47dac6edd47e0a5 Mon Sep 17 00:00:00 2001
From: rezaseydanloo <rezaseydanloo.83@gmail.com>
Date: Tue, 5 Mar 2024 10:55:16 +0330
Subject: [PATCH 1/9] just for test

---
 test | 1 +
 1 file changed, 1 insertion(+)
 create mode 100644 test

diff --git a/test b/test
new file mode 100644
index 0000000..038d718
--- /dev/null
+++ b/test
@@ -0,0 +1 @@
+testing

From b261a29b9615154df5ce1df88e7220132c927d4c Mon Sep 17 00:00:00 2001
From: rezaseydanloo <rezaseydanloo.83@gmail.com>
Date: Tue, 5 Mar 2024 11:09:35 +0330
Subject: [PATCH 2/9] tamrin 1

---
 Answers/40230212055/Advanced.java | 128 ++++++++++++++++++++++++++++++
 1 file changed, 128 insertions(+)
 create mode 100755 Answers/40230212055/Advanced.java

diff --git a/Answers/40230212055/Advanced.java b/Answers/40230212055/Advanced.java
new file mode 100755
index 0000000..3eac56d
--- /dev/null
+++ b/Answers/40230212055/Advanced.java
@@ -0,0 +1,128 @@
+import java.util.Objects;
+import java.util.Scanner;
+
+public class Advanced {
+
+    /**
+     * Goal : Changing a Sentence Content
+
+     * In this function, you have a sentence, a word & a newWord as Entry
+     * You have to search the sentence to find the word that you were given as input and change it with the newWord
+
+     */
+    public String wordCensor(String sentence, String word, String newWord){
+
+
+        String[] sentence1 = sentence.split(" ");
+
+        int size = sentence1.length;
+
+        String word1 = word;
+
+
+        for(int i =0 ; i<size ; i++)
+        {
+            if (sentence1[i].equals(word1))
+            {
+                sentence1[i] = newWord;
+                break;
+            }
+        }
+
+        for(int i =1 ; i<size ; i++)
+        {
+           sentence1[0]+=" ";
+           sentence1[0]+=sentence1[i];
+        }
+//**
+return sentence1[0];
+
+
+    }
+
+    /**
+     * In this function You have a firstName and a lastName as Entry and you have to normalize them as a fullName
+     * @param firstName is a first name with irregular letters (example : hARry)
+     * @param lastName is a last name with irregular letters (example : pOtTeR)
+     * @return fullName is a normal full name that just the first letter of firstName & lastName is Capitalized (example : Harry Potter)
+     */
+    public String normalizingName(String firstName, String lastName){
+
+        String firstname1 = firstName;
+        String lastname1 = lastName;
+        String [] firstname = firstname1.split("");
+        String [] lastname = lastname1.split("");
+        int size1 =firstname.length;
+        int size2 =lastname.length;
+
+
+        for (int i=0 ; i<size1 ; i++)
+        {
+            if (i==0)
+            {
+                firstname[0]=firstname[0].toUpperCase();
+                continue;
+            }
+            firstname[i]=firstname[i].toLowerCase();
+            firstname[0]+=firstname[i];
+        }
+        if(lastName==" ")
+            return firstname[0];
+
+        for (int i=0 ; i<size2 ; i++)
+        {
+            if (i==0)
+            {
+                lastname[0]=lastname[0].toUpperCase();
+                continue;
+            }
+            lastname[i]=lastname[i].toLowerCase();
+            lastname[0]+=lastname[i];
+        }
+        if (firstName==" ")
+            return lastname[0];
+        firstname[0]+=" ";
+        firstname[0]+=lastname[0];
+
+        return firstname[0];
+    }
+
+    /**
+     * Removing repeated letter in a word
+     * @param word This input could have Consecutive repeated letters or not
+     * @return if word contains Consecutive repeated letters, one of the repeated letters should be omitted
+     */
+    public String doubleChar(String word) {
+
+
+        String [] str2 = word.split("");
+        int size = str2.length;
+        String final1;
+
+        int a=str2[1].codePointAt(0);
+
+        for (int i=1 ; i<size-1 ; i++)
+        {
+            int shomaresh=0;
+            for(int j=i+1 ; j<size ; j++)
+            {
+                if (str2[i].codePointAt(0)==str2[j].codePointAt(0))
+                {
+                    shomaresh++;
+                }
+                if(str2[i].codePointAt(0)!=str2[j].codePointAt(0))
+                {
+                    str2[0]+=str2[i];
+                    i+=shomaresh;
+                    break;
+                }
+            }
+
+        }
+        str2[0]+=str2[size-1];
+
+
+        return str2[0];
+    }
+}
+

From a76630c70fbe55e05d00f0cda0b17d3f290fdb0f Mon Sep 17 00:00:00 2001
From: rezaseydanloo <rezaseydanloo.83@gmail.com>
Date: Tue, 5 Mar 2024 11:13:37 +0330
Subject: [PATCH 3/9] tamrin 1

---
 Answers/40230212055/Warmup.java | 157 ++++++++++++++++++++++++++++++++
 1 file changed, 157 insertions(+)
 create mode 100755 Answers/40230212055/Warmup.java

diff --git a/Answers/40230212055/Warmup.java b/Answers/40230212055/Warmup.java
new file mode 100755
index 0000000..95027de
--- /dev/null
+++ b/Answers/40230212055/Warmup.java
@@ -0,0 +1,157 @@
+import java.util.Scanner;
+
+public class   Warmup {
+
+    /**
+     * Goal : Simple Introduction To Strings
+     * In the first function, your inputs are a number and a sentence
+     * @return is the number th word of the sentence
+     */
+    public String wordFinder(String sentence, int number) {
+        System.out.print("sentence: ");
+
+        String [] str = sentence.split(" ");
+
+        int size = str.length;
+        if (size<number)
+        {
+            return " Number = " +number+ " is out Of Bound" ;
+        }
+        else
+        return str[number-1];
+        //tanrin 1
+    }
+
+    /**
+     * Goal : Basic introduction to Strings & using foreach
+     * @param number        is in String type
+     * @param searchForEven is a boolean entry
+     * @return if searchForEven is true ? return the number of even numbers : return the number of odd numbers
+     */
+    public int oddEvenCounter(String number, boolean searchForEven) {
+
+
+        int number2 = Integer.parseInt(number) ;
+        int number3 = number2;
+        int shomaresh=0 ;
+
+        while(true)
+        {
+
+            if (number2==0)
+                break;
+            number2 = number2/10;
+            shomaresh ++;
+
+        }
+
+        boolean status1 = searchForEven;
+
+        if (status1==true)
+        {
+            int even=0;
+            for (int i=1 ; i<=shomaresh ; i++)
+            {
+
+                if(number3%2==0)
+                {
+                    even++;
+                }
+                number3/=10;
+
+            }
+            return even;
+        }
+
+        else
+        {
+            int odd=0;
+
+            for (int i=1 ; i<=shomaresh ; i++)
+            {
+
+                if(number3%2==1)
+                {
+                    odd++;
+                }
+
+                number3/=10;
+
+            }
+
+            return  odd;
+
+        }
+
+
+
+    }
+
+    /**
+     * @param wordA --> first word
+     * @param wordB --> second word
+     * @return The word that is first in alphabet column
+     */
+    public String firstWord(String wordA, String wordB) {
+
+
+        String string11 =wordA;
+        String string22 =wordB;
+        String[] str1 = string11.split("");
+        String[] str2 = string22.split("");
+
+
+        int i=0;
+        int b1=string11.length();
+        int b2=string22.length();
+
+        while(true)
+        {
+          /*  if (str1[i]=="\0" && str2[i]!="\0")
+            {
+                System.out.println(string11);
+                break;
+            }
+            else if (str1[i]!="\0" && str2[i]=="\0")
+            {
+                System.out.println(string22);
+                break;
+
+            }
+            else
+            {
+                System.out.println(string22);
+
+            }
+*/
+            if ((i)==b1)
+            {
+                return (string11);
+            }
+            if ((i)==b2)
+            {
+                return (string22);
+            }
+
+            if (str1[i].compareTo(str2[i])<0)
+            {
+
+                return (string11);
+            }
+
+            else if (str1[i].compareTo(str2[i])>0)
+            {
+
+                return (string22);
+
+            }
+
+            else
+                i++;
+
+        }
+
+
+
+    }
+}

From f1b2776c6f6a5decb6d27dcd89fd86329c99e1b9 Mon Sep 17 00:00:00 2001
From: rezaseydanloo <rezaseydanloo.83@gmail.com>
Date: Tue, 5 Mar 2024 11:17:45 +0330
Subject: [PATCH 4/9] tamrin2

---
 Answers/40230212055/Warmup.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Answers/40230212055/Warmup.java b/Answers/40230212055/Warmup.java
index 95027de..3a56408 100755
--- a/Answers/40230212055/Warmup.java
+++ b/Answers/40230212055/Warmup.java
@@ -78,7 +78,7 @@ public int oddEvenCounter(String number, boolean searchForEven) {
                 number3/=10;
 
             }
-
+//tamrin 2
             return  odd;
 
         }

From 9222e54491c9eda1baa10a2bfc620b19c3c81257 Mon Sep 17 00:00:00 2001
From: rezaseydanloo <rezaseydanloo.83@gmail.com>
Date: Tue, 5 Mar 2024 11:19:03 +0330
Subject: [PATCH 5/9] tamrin3

---
 Answers/40230212055/Warmup.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Answers/40230212055/Warmup.java b/Answers/40230212055/Warmup.java
index 3a56408..54d6e42 100755
--- a/Answers/40230212055/Warmup.java
+++ b/Answers/40230212055/Warmup.java
@@ -152,6 +152,6 @@ else if (str1[i].compareTo(str2[i])>0)
         }
 
 
-
+//tamrin3
     }
 }

From a1770d5cb66062832cdd5db98123a6bdd4a33984 Mon Sep 17 00:00:00 2001
From: rezaseydanloo <rezaseydanloo.83@gmail.com>
Date: Tue, 5 Mar 2024 11:22:37 +0330
Subject: [PATCH 6/9] Advanced.java

---
 Answers/40230212055/Advanced.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Answers/40230212055/Advanced.java b/Answers/40230212055/Advanced.java
index 3eac56d..490418e 100755
--- a/Answers/40230212055/Advanced.java
+++ b/Answers/40230212055/Advanced.java
@@ -34,7 +34,7 @@ public String wordCensor(String sentence, String word, String newWord){
            sentence1[0]+=" ";
            sentence1[0]+=sentence1[i];
         }
-//**
+//***
 return sentence1[0];
 
 

From 4badc4e7b1a23164d11f55ac61479e2d77119418 Mon Sep 17 00:00:00 2001
From: rezaseydanloo <rezaseydanloo.83@gmail.com>
Date: Tue, 5 Mar 2024 11:24:01 +0330
Subject: [PATCH 7/9] tamrin4

---
 Answers/40230212055/Advanced.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Answers/40230212055/Advanced.java b/Answers/40230212055/Advanced.java
index 490418e..2d41efe 100755
--- a/Answers/40230212055/Advanced.java
+++ b/Answers/40230212055/Advanced.java
@@ -34,7 +34,7 @@ public String wordCensor(String sentence, String word, String newWord){
            sentence1[0]+=" ";
            sentence1[0]+=sentence1[i];
         }
-//***
+//****
 return sentence1[0];
 
 

From 534cdac14257c71308716d9ac3dbe3eb09328d12 Mon Sep 17 00:00:00 2001
From: rezaseydanloo <rezaseydanloo.83@gmail.com>
Date: Tue, 5 Mar 2024 11:26:09 +0330
Subject: [PATCH 8/9] tamrin5

---
 Answers/40230212055/Advanced.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Answers/40230212055/Advanced.java b/Answers/40230212055/Advanced.java
index 2d41efe..89fc780 100755
--- a/Answers/40230212055/Advanced.java
+++ b/Answers/40230212055/Advanced.java
@@ -83,7 +83,7 @@ public String normalizingName(String firstName, String lastName){
             return lastname[0];
         firstname[0]+=" ";
         firstname[0]+=lastname[0];
-
+//****
         return firstname[0];
     }
 

From 64e3a6be5f73c1e7a5b26543d98faf3423843988 Mon Sep 17 00:00:00 2001
From: rezaseydanloo <rezaseydanloo.83@gmail.com>
Date: Tue, 5 Mar 2024 11:27:34 +0330
Subject: [PATCH 9/9] tamrin6

---
 Answers/40230212055/Advanced.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Answers/40230212055/Advanced.java b/Answers/40230212055/Advanced.java
index 89fc780..9ae086a 100755
--- a/Answers/40230212055/Advanced.java
+++ b/Answers/40230212055/Advanced.java
@@ -121,7 +121,7 @@ public String doubleChar(String word) {
         }
         str2[0]+=str2[size-1];
 
-
+//****
         return str2[0];
     }
 }