Find indices of all occurrence of one string in other
Given two strings, str1 and str2, the task is to print the indices(Consider, indices starting from 0) of occurrence of str2 in str1. If no such index occurs, print “NONE”.
Examples:
Input : GeeksforGeeks
Geeks
Output : 0 8
Input : GFG
g
Output : NONE
A simple solution is to check all substrings of given string one by one. If a substring matches, print its index.
C++
// C++ program to find indicies of all // occurrences of one string in other. #include <iostream> using namespace std; void printIndex(string str, string s) { bool flag = false; for (int i = 0; i < str.length(); i++) { if (str.substr(i, s.length()) == s) { cout << i << " "; flag = true; } } if (flag == false) cout << "NONE"; } int main() { string str1 = "GeeksforGeeks"; string str2 = "Geeks"; printIndex(str1, str2); return 0; } |
chevron_right
filter_none
Java
// Java program to find indicies of all // occurrences of one String in other. class GFG { static void printIndex(String str, String s) { boolean flag = false; for (int i = 0; i < str.length() - s.length() + 1; i++) { if (str.substring(i, i + s.length()).equals(s)) { System.out.print(i + " "); flag = true; } } if (flag == false) { System.out.println("NONE"); } } // Driver code public static void main(String[] args) { String str1 = "GeeksforGeeks"; String str2 = "Geeks"; printIndex(str1, str2); } } // This code is contributed by Rajput-JI |
chevron_right
filter_none
Python3
# Python program to find indicies of all # occurrences of one String in other. def printIndex(str, s): flag = False; for i in range(len(str)): if (str[i:i + len(s)] == s): print( i, end =" "); flag = True; if (flag == False): print("NONE"); # Driver code str1 = "GeeksforGeeks"; str2 = "Geeks"; printIndex(str1, str2); # This code contributed by PrinciRaj1992 |
chevron_right
filter_none
C#
// C# program to find indicies of all // occurrences of one String in other. using System; class GFG { static void printIndex(String str, String s) { bool flag = false; for (int i = 0; i < str.Length - s.Length + 1; i++) { if (str.Substring(i, s.Length) .Equals(s)) { Console.Write(i + " "); flag = true; } } if (flag == false) { Console.WriteLine("NONE"); } } // Driver code public static void Main(String[] args) { String str1 = "GeeksforGeeks"; String str2 = "Geeks"; printIndex(str1, str2); } } // This code is contributed by 29AjayKumar |
chevron_right
filter_none
PHP
<?php // PHP program to find indicies of all // occurrences of one string in other. function printIndex($str, $s) { $flag = false; for ($i = 0; $i < strlen($str); $i++) { if (substr($str,$i, strlen($s)) == $s) { echo $i . " "; $flag = true; } } if ($flag == false) echo "NONE"; } // Driver Code $str1 = "GeeksforGeeks"; $str2 = "Geeks"; printIndex($str1, $str2); // This code is contributed by mits ?> |
chevron_right
filter_none
Output:
0 8
Time Complexity : O(n * n)
An efficient solution is to KMP string matching algorithm.
Recommended Posts:
- Find the starting indices of the substrings in string (S) which is made by concatenating all words from a list(L)
- Rearrange given string to maximize the occurrence of string t
- Arrange a binary string to get maximum value within a range of indices
- Program to count occurrence of a given character in a string
- Count occurrence of a given character in a string using Stream API in Java
- Minimize the length of string by removing occurrence of only one character
- Generate two output strings depending upon occurrence of character in input string.
- Generate two output strings depending upon occurrence of character in input string in Python
- Find the occurrence of the given binary pattern in the binary representation of the array elements
- Find the longest sub-string which is prefix, suffix and also present inside the string | Set 2
- String Range Queries to find the number of subsets equal to a given String
- Find the longest sub-string which is prefix, suffix and also present inside the string
- Given a string and an integer k, find the kth sub-string when all the sub-strings are sorted according to the given condition
- Find length of longest subsequence of one string which is substring of another string
- Find the character in first string that is present at minimum index in second string
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
