@cetzal

def uncommonChars(s1, s2): #code here freq1 = [False] * 26 freq2 = [False] * 26 # Marcar caracteres presentes en s1 for c in s1: freq1[ord(c) - ord('a')] = True # Marcar caracteres presentes en s2

def last_find(txt: str, pat:str) -> int: s = len(txt) l = len(pat) for i in range(s - l, -1, -1): count = 0 for x in range(l -1, -1, -1): if txt[i + x] == pat[x]: count += 1 if count =

def count_ocurrency(txt, pat) -> int: s = len(txt) x = len(pat) count = 0 for i in range(s - x + 1): j = 0 for n in range(x): if txt[i + n] != pat[n]: break j +=1

def find_all_match(txt, pat): n = len(txt) m = len(pat) if m == 0: return 0 for i in range( n - m + 1):

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static void main(String[] args) { String txt = "banana"; //minuscula // System.out.println