#Strings

Write a function to determine if two strings are anagrams of each other. An anagram is a word or phrase formed by rearranging the letters of a different word or phrase. Provide the runtime complexity of your solution.

Answer another DSA question focusing on strings.

Complete a coding question that focuses on string manipulation.

Given a string, find the length of the longest substring that contains all unique characters. Explain your approach and provide a solution with its time complexity.

In a stream of characters, determine which character has the kth highest frequency. If two characters have the same frequency, return the one that appears first in the stream. Example: If the input is 'abracadabra', k = 2, the output should be 'a'.