Index Pairs of a String · Coding Interview Practice

Index Pairs of a StringGiven a string text and an array of words, return every pair [i, j] such that text[i..j] is one of the words. Sort the pairs by i, then by j.Constraints

1 <= text.length <= 100

1 <= words.length <= 20

1 <= words[i].length <= 50, all lowercase and distinct

Examples

Input: text = "thestoryofleetcodeandme", words = ["story", "fleet", "leetcode"] Output: [[3, 7], [9, 13], [10, 17]]

Input: text = "ababa", words = ["aba", "ab"] Output: [[0, 1], [0, 2], [2, 3], [2, 4]]

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…