NeetCode #516LC-291MediumBacktracking
← Back to All Problems#516 · #291 · Word Pattern II(单词规律 II)
📌 Problem Statement & Constraints
Given a
pattern string and a string s, return whether s matches the pattern, where each letter in the pattern maps bijectively to a non-empty substring of s. Constraints: 1 <= pattern.length, s.length <= 20.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!