Step through the algorithm visually — use Play or the step buttons (inspired by AlgoMaster / visualgo).
Flipkart interview context: Task Scheduler is a Medium Heap / Priority Queue problem — Top-K and merge-K patterns use a min/max heap of size K.
Use the animation above to step through each move before writing code.
Pattern: Heap / Priority Queue
Read from stdin, write to stdout. Classic interview problem #621.
Task Scheduler — Flipkart interview prep · Heap / Priority Queue
Classic interview problem #621.
Input (stdin)
Line 1: nums\nLine 2: k
Output (stdout)
Heap pattern (Task Scheduler)
Your program must read from stdin and write the answer to stdout (no extra debug text).
3 2 1 5 6 4 2
5
| Test | Status | Details |
|---|
Ready — edit the code above and click Run or Submit.
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
class Program
{
static int[] Ria(string line = null)
{
line ??= Console.ReadLine();
if (string.IsNullOrWhiteSpace(line)) return Array.Empty<int>();
return line.Trim().Split(new[] { ' ', ',', '\t' }, StringSplitOptions.RemoveEmptyEntries)
.Select(int.Parse).ToArray();
}
static string[] Rsa()
{
int n = int.Parse(Console.ReadLine());
var arr = new string[n];
for (int i = 0; i < n; i++) arr[i] = Console.ReadLine();
return arr;
}
static void W(params object[] parts) => Console.WriteLine(string.Join(" ", parts));
static void Wb(bool v) => Console.WriteLine(v ? "true" : "false");
static void Wi(int v) => Console.WriteLine(v);
static void Ws(string v) => Console.WriteLine(v);
static void Main()
{
var nums = Ria();
int k = int.Parse(Console.ReadLine());
Wi(nums.OrderByDescending(x => x).Skip(k - 1).First());
}
}Try solving on your own first, then reveal the official answer.