✅✅ Break the Palindrome

class Solution {
public String breakPalindrome(String palindrome) {
// If empty or of length 1 => return empty
if (palindrome.length() <= 1) {
return "";
}
char[] chars = palindrome.toCharArray();
for (int i = 0; i < chars.length; i++) {
if (chars[i] != 'a') {
// Skip if the string is of odd length and it is the middle index
if (palindrome.length() % 2 != 0 && i == palindrome.length() / 2) {
continue;
}
chars[i] = 'a';
break;
}
// If all chars all 'a' update last char to 'b'
if (i == chars.length - 1) {
chars[i] = 'b';
}
}
return String.valueOf(chars);
}
}

Sum of number diagonally
In Python3

✅✅Duplicated Products - MapIt (MyAnatomy) Python Solution - Replicon Test Code

https://stupidtechy.me/threads/duplicated-products-mapit-myanatomy-python-solution-replicon-test-code.117/

Duplicate

✅✅Circular Printer - MapIt (MyAnatomy) Python Solution - Replicon Test Code

https://stupidtechy.me/threads/circular-printer-mapit-myanatomy-python-solution-replicon-test-code.116/

Now correct
That time I just checked one test case😅

Very cool number

✅✅✅ Mettl - Large Small Difference - Tech Mahindra Exam
def LargeSmallDifference(data):
l = data[0]
s = data[0]
for num in data:
if num> l:
l = num
elif num< s:
s = num
return l, s

print(LargeSmallDifference([0, 10, 15, 40, -5, 42, 17, 28, 75]))