>RunTimeFix
BookStudyPracticeInterviewsYouTubeCoursesAbout
Log inGet Started
Topics/String Algorithms & Hashing
advanced level

String Algorithms & Hashing

Quick Answer

What is String Algorithms & Hashing?

String problems require specialized techniques beyond basic string manipulation. RunTimeFix covers polynomial rolling hashing (comparing substrings in O(1) after O(n) preprocessing), the trie data structure for prefix-based queries, and the character-level operations that simplify many contest problems. Rolling hashing is a probabilistic technique that enables fast substring comparison, pattern matching, and palindrome detection. Tries enable efficient prefix search, autocomplete-style queries, and XOR-maximum problems. Both are essential tools for any serious competitive programmer.

  • string algorithms
  • hashing
  • polynomial hashing
  • trie
  • prefix tree
  • string matching
  • Rabin-Karp

Study Material for String Algorithms & Hashing

Ch 30: Hashing, String Algorithms & Geometry Basics

Polynomial Rolling Hashing · The Trie (Prefix Tree) · Geometry: The Cross Product · Book 1 Conclusion

Ch 5: Strings & Character Operations

std::string in C++ · Character Operations & ASCII Mathematics

Ch 3: Arrays, Strings & Character Operations

1D Arrays (C-Style) · 2D Arrays & Row-Major Layout · std::string & Character Operations

Related Topics

Data StructuresAlgorithmsCompetitive Programming
Was this helpful?

Published by RunTimeFix · Comprehensive guides for competitive programming

>RunTimeFix

Practical programming education. Books, videos, courses, and hands-on learning for competitive programming, DSA, and software engineering.

RunTimeFix

  • About
  • YouTube
  • Book
  • Study Library
  • Courses

Learn

  • Competitive Programming
  • DSA
  • Development
  • Databases

Legal

  • Privacy
  • Terms
  • Refund Policy

RunTimeFix — debug → solve → run

© 2026 RunTimeFix. All rights reserved.