Task Dependency Scheduler

You are given a list of tasks, each identified by a unique integer or string ID. Some tasks depend on other tasks and can only be executed after their prerequisite tasks have been completed. The dependencies are provided as a list of pairs [A, B] where task A must be completed before task B.

Write a function that takes the total number of tasks and a list of dependency pairs, then returns an ordering of tasks that satisfies all the constraints. If there are multiple valid orderings, return any one of them. If it is impossible to complete all tasks due to cyclic dependencies, return an appropriate indication of failure (for example, an empty list).

Example:

Input:

• Number of tasks: 4
• Dependencies: [[1, 0], [2, 0], [3, 1], [3, 2]]

A Possible Output:

[3, 1, 2, 0] // or [3, 2, 1, 0]

Constraints:

• Develop an efficient solution that can handle a large number of tasks and dependencies.
• Write clean, well-documented code.
• Consider edge cases where no valid ordering exists.