<prompt> loveleetcodeKuandika Python code kutatua hii leetcode changamoto: Kutoa kamba s, kupata kwanza yasiyo ya kurudia tabia ndani yake na kurudi index yake. Kama haipo, kurudi -1.  <response>: pythondef firstUniqChars: str - int: count_dict for char in s: count_dictchar count_dict.getchar, 0 1 Increamenting the count of each character for i, char in enumerates: if count_dictchar 1: return i If the count of the character is 1, then it is the first non-repeating character, so return its index return -1 If there is no non-repeating character, return -1printfirstUniqCharloveleetcode 