Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Counting Embeddings > Editorial

Counting Embeddings — Solution & Editorial

Back to the Problem

dp[j] = embeddings of T's first j characters; for each character of S, update j downward: on a match dp[j] += dp[j−1]. The empty prefix has one embedding.

Complexity: O(|S|·|T|)

Watch out: Update j from high to low, or each text character can be reused within one step.