Trapping Rain Water and Regex Matching | Dataford Interview Questions

A WeChat media pipeline receives an elevation profile and a simplified validation pattern. Implement one function that solves both algorithmic tasks: calculate how much water the profile can trap, and determine whether the entire text matches the pattern.

The pattern supports only lowercase English letters, . matching any single character, and * matching zero or more occurrences of the preceding element.

Formal Specification

Implement analyze_media(height, text, pattern):

height is a list of non-negative integers. Return the trapped water volume between the bars, where each bar has width 1.
text and pattern are strings. Return whether the entire text matches pattern, not merely a substring.
Return a dictionary with exactly two keys: water, an integer, and matches, a boolean.

Constraints

1 <= len(height) <= 10^5
0 <= height[i] <= 10^9
0 <= len(text) <= 1000
1 <= len(pattern) <= 1000
Every * has a preceding valid pattern element
The water result fits in a signed 64-bit integer

Function Signature

def analyze_media(height, text, pattern):

Your question is Trapping Rain Water and Regex Matching. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem