Check if all substrings are dictionary words

Q: Check if all substrings are dictionary words

This question evaluates string-processing skills such as substring enumeration and membership testing against a dictionary, along with algorithmic reasoning about correctness and complexity.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

You are given a string s (letters only) and access to an English dictionary dict (a set of valid words).

Return true if every contiguous substring of s with length >= 3 is a valid dictionary word (i.e., for all i, j with 0 <= i <= j < n and j - i + 1 >= 3, s[i..j] ∈ dict). Otherwise return false.

Clarifications:

Substring means contiguous .
You may assume dictionary lookups are available (e.g., dict.contains(word) ), or you can preprocess the dictionary.

Example:

If s = "cats" , you must check "cat" , "ats" , and "cats" (and any other substrings of length >= 3).

Check if all substrings are dictionary words

Quick Overview

Comments (0)