String and cache implementation

A cache contains a list of String of length atmost L.suppose cache contains n Strings. Given a String X (of length g) as input, Find out whether any anagram of X is in cache efficiently? Find out Time Complexity. [Hints - Tries /hash/ bit-map]