Process 8 tasks in FIFO; print order.
| Test | Status | Details |
|---|
Ready — edit the code above and click Run or Submit.
using System;
using System.Collections.Generic;
using System.Linq;
class Program
{
static void Main()
{
var q = new Queue<int>();
for (int t = 1; t <= 8; t++) q.Enqueue(t);
var order = new List<int>();
while (q.Count > 0) order.Add(q.Dequeue());
Console.WriteLine(string.Join(",", order));
}
}Try solving on your own first, then reveal the official answer.
FIFO queue simulation.