.

Java/lab_1/lab_1.java

@@ -1,7 +1,7 @@
 import java.util.Scanner;
 
-public class Lab_1 {
+public class lab_1 {
-
+    
     public static int protectedInput(String variable_to_read, Scanner input) {
         int read_variable;
         do {

Java/lab_2/lab_2.java

@@ -1,6 +1,6 @@
 import java.util.Scanner;
 
-public class Lab_2 {
+public class lab_2 {
 
     public static short protectedInput(String inputPrompt, String errorMessage, Scanner input) {
         short read_variable;

Java/lab_3/lab_3.java

@@ -0,0 +1,58 @@
+package OOP.Java.lab_3;
+
+public class lab_3 {
+    static int maxStrLength;
+    static String result;
+    
+    public static void cSubUtil(StringBuilder stringbuilder, int leftBoundary, int rightBoundary) {
+        String string = stringbuilder.toString().toLowerCase().replaceAll("[^a-z]","");
+        // check if the indices lie in the range of string
+        // and also if it is palindrome
+        while (leftBoundary >= 0 && rightBoundary < string.length() && string.toLowerCase().charAt(leftBoundary) == string.toLowerCase().charAt(rightBoundary)) {
+            // expand the boundary
+            leftBoundary--;
+            rightBoundary++;
+        }
+        // if it's length is greater than maxLength update
+        // maxLength and res
+        if (rightBoundary - leftBoundary - 1 >= maxStrLength) {
+            result = string.substring(leftBoundary + 1, rightBoundary);
+            maxStrLength = rightBoundary - leftBoundary - 1;
+        }
+        return;
+    }
+
+    public static int longestPalSubstr(StringBuilder string)
+    {
+        result = "";
+        maxStrLength = 1;
+        // for every index in the string check palindromes
+        // starting from that index
+        for (int i = 0; i < string.length(); i++) {
+            // check for odd length palindromes
+            cSubUtil(string, i, i);
+            // check for even length palindromes
+            cSubUtil(string, i, i + 1);
+        }
+        System.out.println("Longest palindrome substring is: " + compareStrings(string));
+        return compareStrings(string).length();
+    }
+
+    public static String compareStrings(StringBuilder builder) {
+        for (int leftBoundary = 0; leftBoundary <= builder.length(); leftBoundary++) {
+            for (int rightBoundary = builder.length(); leftBoundary >= 0; rightBoundary--) {
+                if (result.equals(builder.substring(leftBoundary, rightBoundary).toString().toLowerCase().replaceAll("[^a-z]",""))) {
+                    return builder.substring(leftBoundary, rightBoundary).toString();
+                }
+            }
+        }
+        return "";
+    }
+
+    public static void main(String[] args) {
+        StringBuilder stringToDetect = new StringBuilder("Eva, can I see bees in a cave?");
+
+        System.out.println("Initial string: " + stringToDetect.toString());
+        System.out.println("Length is: " + longestPalSubstr(stringToDetect));
+    }
+}

Rust/lab_1/Cargo.toml

@@ -5,5 +5,12 @@ edition = "2021"
 
 # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
 
+[profile.release]
+opt-level = 'z'     # Optimize for size
+lto = true          # Enable link-time optimization
+codegen-units = 1   # Reduce number of codegen units to increase optimizations
+panic = 'abort'     # Abort on panic
+strip = true        # Strip symbols from binary*
+
 [dependencies]
 text_io = "0.1.12"

Rust/lab_1/src/main.rs

@@ -19,4 +19,4 @@ fn main() {
     let s: f32 = ((b + m) as f32 / 2f32) * ((m - b + 1) * (n - a + 1)) as f32;
 
     println!("S = {}", s);
-}
+}