CPMagical CP Library

Problem solution · C++

Design Task Manager

Design Task Manager: a C++ solution using hash-based lookup. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Hash-based lookup
Source
walkccc LeetCode Solutions
Length
54 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Hash-based lookup

For Design Task Manager, the implementation stores previously seen values or frequencies in a hash table for direct membership and lookup operations.

  1. Decide the key that represents the information needed later.
  2. Update its count or stored state while scanning the input.
  3. Use constant-time expected lookups to detect matches or assemble the result.

Code notes

  • 54 lines of C++ from the credited upstream file 3408.cpp.
  • The implementation visibly relies on sequence storage, hash lookup, ordered lookup.
  • 1 loop block detected.

Complexity

Expected hash operations are constant time, but the surrounding scan and the number of stored keys determine total work and memory.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeDesign Task Manager · C++C++
Use this to learn the idea, then write your own version.
struct Task {  int userId;  int taskId;  int priority;   Task() = default;  Task(int u, int t, int p) : userId(u), taskId(t), priority(p) {}   bool operator<(const Task& other) const {    return priority == other.priority ? taskId > other.taskId                                      : priority > other.priority;  }}; class TaskManager { public:  unordered_map<int, Task> taskMap;  // {taskId: Task}  set<Task> taskSet;  // Stores tasks sorted by priority and taskId.   TaskManager(vector<vector<int>>& tasks) {    for (const auto& task : tasks)      add(task[0], task[1], task[2]);  }   void add(int userId, int taskId, int priority) {    const Task task(userId, taskId, priority);    taskMap[taskId] = task;    taskSet.insert(task);  }   void edit(int taskId, int newPriority) {    const Task task = taskMap[taskId];    taskSet.erase(task);    const Task editedTask = Task(task.userId, task.taskId, newPriority);    taskSet.insert(editedTask);    taskMap[taskId] = editedTask;  }   void rmv(int taskId) {    const Task task = taskMap[taskId];    taskSet.erase(task);    taskMap.erase(taskId);  }   int execTop() {    if (taskSet.empty())      return -1;    const Task task = *taskSet.begin();    taskSet.erase(task);    taskMap.erase(task.taskId);    return task.userId;  }};

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗