Bounding incomplete character sums have various applications in number theory. Granville and Soundararajan, among a variety of results for characater sums, showed the existence of characters producing large values when the sum is taken in a short interval. Kalmynin, showed that there exist primes for which Legendre symbols have this property. In this talk, I will describe how these results could be extended to higher order characters modulo primes.