marshallwace | | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
The interview consisted of three tasks, primarily focused on dynamic programming, and lasted for approximately 80 minutes.
Technical Questions
-
String Manipulation: Given a string of English letters, count the number of different letters that appear in both uppercase and lowercase, where all lowercase occurrences appear before any uppercase occurrence.
- Example: For the string “aaAbcCABBc”, the answer is 2 (letters ‘a’ and ‘b’ meet the condition).
-
Sliding Window: Given an array of integers and two integers L and R, find the shortest fragment of consecutive elements that contains every integer from L to R inclusive. If no such fragment exists, return -1.
-
Dynamic Programming: Given a matrix of positive integers, find a path consisting of neighboring fields (sharing a common side) that maximizes the number of trailing zeros in the product of the integers along the path. The path can start and end on any field and can turn left or right at most once.
Tips & Insights
Focus on understanding the core concepts of string manipulation, sliding window techniques, and dynamic programming strategies to effectively solve these types of problems.