Java Program for Rabin-Karp Algorithm for Pattern Searching Last Updated : 14 May, 2025 Comments Improve Suggest changes Like Article Like Report Given a text txt[0..n-1] and a pattern pat[0..m-1] , write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[] .You may assume that n > m.Examples:Input: txt[] = "THIS IS A TEST TEXT" pat[] = "TEST"Output: Pattern found at index 10Input: txt[] = "AABAACAADAABAABA" pat[] = "AABA"Output: Pattern found at index 0 Pattern found at index 9 Pattern found at index 12 The Naive String Matching algorithm slides the pattern one by one. After each slide, it one by one checks characters at the current shift and if all characters match then prints the match. Like the Naive Algorithm, Rabin-Karp algorithm also slides the pattern one by one. But unlike the Naive algorithm, Rabin Karp algorithm matches the hash value of the pattern with the hash value of current substring of text, and if the hash values match then only it starts matching individual characters. So Rabin Karp algorithm needs to calculate hash values for following strings. 1) Pattern itself. 2) All the substrings of text of length m. Java // Following program is a Java implementation // of Rabin Karp Algorithm given in the CLRS book public class Main { // d is the number of characters in the input alphabet public final static int d = 256; /* pat -> pattern txt -> text q -> A prime number */ static void search(String pat, String txt, int q) { int M = pat.length(); int N = txt.length(); int i, j; int p = 0; // hash value for pattern int t = 0; // hash value for txt int h = 1; // The value of h would be "pow(d, M-1)%q" for (i = 0; i < M - 1; i++) h = (h * d) % q; // Calculate the hash value of pattern and first // window of text for (i = 0; i < M; i++) { p = (d * p + pat.charAt(i)) % q; t = (d * t + txt.charAt(i)) % q; } // Slide the pattern over text one by one for (i = 0; i <= N - M; i++) { // Check the hash values of current window of text // and pattern. If the hash values match then only // check for characters one by one if (p == t) { /* Check for characters one by one */ for (j = 0; j < M; j++) { if (txt.charAt(i + j) != pat.charAt(j)) break; } // if p == t and pat[0...M-1] = txt[i, i+1, ...i+M-1] if (j == M) System.out.println("Pattern found at index " + i); } // Calculate hash value for next window of text: Remove // leading digit, add trailing digit if (i < N - M) { t = (d * (t - txt.charAt(i) * h) + txt.charAt(i + M)) % q; // We might get negative value of t, converting it // to positive if (t < 0) t = (t + q); } } } /* Driver program to test above function */ public static void main(String[] args) { String txt = "GEEKS FOR GEEKS"; String pat = "GEEK"; int q = 101; // A prime number search(pat, txt, q); } } // This code is contributed by nuclode OutputPattern found at index 0 Pattern found at index 10 Time Complexity: O(M+N) Space Complexity: O(1) Please refer complete article on Rabin-Karp Algorithm for Pattern Searching for more details! Comment More infoAdvertise with us Next Article Java Program for Rabin-Karp Algorithm for Pattern Searching kartik Follow Improve Article Tags : Java Practice Tags : Java Similar Reads Java Program for KMP Algorithm for Pattern Searching Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[]. You may assume that n > m. Examples: Input: txt[] = "THIS IS A TEST TEXT" pat[] = "TEST" Output: Pattern found at index 10 Input: txt[] = "AABAACAADAA 3 min read Java Program for Naive algorithm for Pattern Searching Write a Java program for a given text string with length n and a pattern with length m, the task is to print all occurrences of the pattern in text.Note: You may assume that n > m. Examples: Input: text = “THIS IS A TEST TEXTâ€, pattern = “TESTâ€Output: Pattern found at index 10 Input: text = “AABA 2 min read Java Program for Anagram Substring Search (Or Search for all permutations) Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] and its permutations (or anagrams) in txt[]. You may assume that n > m. Expected time complexity is O(n) Examples: 1) Input: txt[] = "BACDGABCDA" pat[] = "ABCD" 4 min read Searching Algorithms in Java Searching Algorithms are designed to check for an element or retrieve an element from any data structure where it is stored. Based on the type of search operation, these algorithms are generally classified into two categories: Sequential Search: In this, the list or array is traversed sequentially a 5 min read Java Program to Implement Commentz-Walter Algorithm The Commentz-Walter algorithm is a string-matching algorithm that is used to search for a given pattern in a text string. It is a variant of the Knuth-Morris-Pratt (KMP) algorithm, which is a well-known algorithm for string matching. This algorithm works by preprocessing the pattern string to create 6 min read Java Program to Construct a Binary Search Tree Binary Search Tree (BST) is the widely used data structure in computer science, primarily known for the efficient search, insertion, and deletion operations. It is the type of binary tree where each node has at most two children, referred to as the left child and the right child. Binary Search Tree 6 min read Java Pattern pattern() Method pattern() method of the Pattern class in Java is used to get the regular expression which is compiled to create this pattern. We use a regular expression to create the pattern and this method is used to get the same source expression. Example 1: Using the pattern() method to check the regex pattern 2 min read Pattern compile(String,int) method in Java with Examples The compile(String, int) method of the Pattern class used to create a pattern from the regular expression with the help of flags where both expression and flags are passed as parameters to the method. The Pattern class contains a list of flags (int constants) that can be helpful to make the Pattern 2 min read Sentinel Linear Search in Java The Linear search is a simple searching algorithm that checks every element in the list or array sequentially until the target element is found or the end of the list is reached. While linear search is not the most efficient search algorithm it is straightforward and works well for small datasets or 3 min read Arrays.binarySearch() in Java with examples | Set 2 (Search in subarray) Arrays.binarySearch()| Set 1 Covers how to find an element in a sorted array in Java. This set will cover "How to Search a key in an array within a given range including only start index". Syntax : public static int binarySearch(data_type[] arr, int fromIndex, int toIndex, data_type key) Parameters 5 min read Like