Flipkart Grid

Find the next greater element for each item in a circular array, wrapping around to the start using a monotonic stack. Given a directed graph of task dependencies, determine if all tasks can be finished and return a valid execution order using topological sort. Find the maximum profit from buying and selling stock at most two times, solved using multi-state dynamic programming.