CodeCraftersLab

TUF+ Basic Maths - Check for perfect number [Brute force approach]

TUF+ Basic Maths - GCD of two numbers [Optimal approach]

TUF+ Basic Maths - GCD of two numbers [Better approach]

Second Largest Element in Array (Brute Force) | Java | Easy Explanation 🔥

Largest Element in Array | Java Coding Interview Question

TUF+ Basic Arrays - Check if the array is sorted [Brute]

TUF+ Basic String - Rotate String | Java Solution

TUF+ Basic Maths - GCD of two numbers [Brute force approach]

TUF+ Basic String - Finding the Longest Common Prefix (LCP) | Java Solution

TUF+ Basic String - How to Check if a String is a Palindrome in Java

TUF+ Basic Maths - LCM of two numbers [Optimal approach]

TUF+ Basic Arrays - Check if the array is sorted [Better]

TUF+ Basic String - Finding the Largest Odd Number in a String | Java Solution

TUF+ Basic Maths - Check if the number is armstrong

TUF+ Basic Arrays - Count of odd numbers in array

TUF+ Basic Maths - Check for perfect number [Optimal approach]