Prefix and Suffix search || Leetcode Hard
Автор: Digital Interview
Загружено: 2022-06-17
Просмотров: 354
Описание:
Design a special dictionary with some words that searchs the words in it by a prefix and a suffix.
Implement the WordFilter class:
WordFilter(string[] words) Initializes the object with the words in the dictionary.
f(string prefix, string suffix) Returns the index of the word in the dictionary, which has the prefix prefix and the suffix suffix. If there is more than one valid index, return the largest of them. If there is no such word in the dictionary, return -1.
Example 1:
Input
["WordFilter", "f"]
[[["apple"]], ["a", "e"]]
Output
[null, 0]
Explanation
WordFilter wordFilter = new WordFilter(["apple"]);
wordFilter.f("a", "e"); // return 0, because the word at index 0 has prefix = "a" and suffix = 'e".
Link for Leetcode solutions: • Find First and Last Position of Element in...
Link for placement series: • Wipro Interview || Virtual Business Discus...
#leetcode #leetcodesolution
Coding Solutions|| Off Campus Placement 2022
Get notified about all off campus jobs/interviews and the process.
We are building our website and it will be back soon with lots of content till then subscribe us on youtube.
https://t.me/tech_geek1
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
