List N Tasks by Priority Substring | Dataford Interview Questions

Coinbase task views need to show the highest-priority tasks whose titles contain a user-provided search term. Given a list of tasks, return up to n matching tasks sorted by descending priority, preserving their original order when priorities are equal.

Matching must be case-insensitive and must treat the target as a literal substring. Return the complete original task objects without modifying them.

Formal Specification

Implement filter_tasks(tasks, target, n).

tasks is a list of dictionaries. Each dictionary contains a string title and integer priority.
target is a string to search for in each task title.
n is a non-negative integer specifying the maximum number of results.
Return a list of at most n task dictionaries.

Constraints

0 <= len(tasks) <= 10^5
0 <= n <= len(tasks)
0 <= task['priority'] <= 10^9
Every task contains a string 'title' and an integer 'priority'
Matching is case-insensitive and target matching is literal

Function Signature

def filter_tasks(tasks, target, n):

Your question is List N Tasks by Priority Substring. 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