"function isPalindrome(s, start, end) {
while (s[start] === s[end] && end >= start) {
start++;
end--;
}
return end <= start;
}
function longestPalindromicSubstring(s) {
let longestPalindrome = '';
for (let i=0; i < s.length; i++) {
let j = s.length-1;
while (s[i] !== s[j] && i <= j) {
j--;
}
if (s[i] === s[j]) {
if (isPalindrome(s, i, j)) {
const validPalindrome = s.substring(i, j+1"
Tiago R. - "function isPalindrome(s, start, end) {
while (s[start] === s[end] && end >= start) {
start++;
end--;
}
return end <= start;
}
function longestPalindromicSubstring(s) {
let longestPalindrome = '';
for (let i=0; i < s.length; i++) {
let j = s.length-1;
while (s[i] !== s[j] && i <= j) {
j--;
}
if (s[i] === s[j]) {
if (isPalindrome(s, i, j)) {
const validPalindrome = s.substring(i, j+1"See full answer
"import java.util.Arrays;
import java.util.stream.Collectors;
class Main
{
// Recursive function to print all combinations of numbers from \i\ to \n\
// having sum \n. The index\ denotes the next free slot in the output array \out\
public static void printCombinations(int i, int n, int[] out, int index)
{
// if the sum becomes n, print the combination
if (n == 0)
{
System.out.println(Arrays.stream(out).limit(index)
.boxed().collect(Collectors.toList()));
}
// start from the previous e"
Relynn may silver B. - "import java.util.Arrays;
import java.util.stream.Collectors;
class Main
{
// Recursive function to print all combinations of numbers from \i\ to \n\
// having sum \n. The index\ denotes the next free slot in the output array \out\
public static void printCombinations(int i, int n, int[] out, int index)
{
// if the sum becomes n, print the combination
if (n == 0)
{
System.out.println(Arrays.stream(out).limit(index)
.boxed().collect(Collectors.toList()));
}
// start from the previous e"See full answer
"def countuniqueoutfits(totalpants: int, uniquepants: int,
totalshirts: int, uniqueshirts: int,
totalhats: int, uniquehats: int) -> int:
"""
Number of unique outfits can simply be defined by
(uniquepantschoose1uniqueshirtschoose1uniquehatschoose_1)
(uniquepantschoose1*uniqueshirtschoose1) # Not wearing a hat
nchoosek is n
"""
res = (uniquepants*uniqueshirtsuniquehats) + (uniquepantsunique_shirts)
return res
print(countuniqueoutfits(2, 1, 1, 1, 3, 2))"
Sai R. - "def countuniqueoutfits(totalpants: int, uniquepants: int,
totalshirts: int, uniqueshirts: int,
totalhats: int, uniquehats: int) -> int:
"""
Number of unique outfits can simply be defined by
(uniquepantschoose1uniqueshirtschoose1uniquehatschoose_1)
(uniquepantschoose1*uniqueshirtschoose1) # Not wearing a hat
nchoosek is n
"""
res = (uniquepants*uniqueshirtsuniquehats) + (uniquepantsunique_shirts)
return res
print(countuniqueoutfits(2, 1, 1, 1, 3, 2))"See full answer
Asked at 
