Step through the algorithm visually — use Play or the step buttons (inspired by AlgoMaster / visualgo).
Atlassian interview context: Sliding Window Maximum is a Hard Sliding Window problem — Maintain a window [L, R] and update counts as you expand or contract.
Use the animation above to step through each move before writing code.
Pattern: Sliding Window
Read from stdin, write to stdout. Classic interview problem #239.
Sliding Window Maximum — Atlassian interview prep · Sliding Window
Classic interview problem #239.
Input (stdin)
Line 1: integers\nLine 2: k
Output (stdout)
Sliding window maximums
Your program must read from stdin and write the answer to stdout (no extra debug text).
1 3 -1 -3 5 3 6 7 3
3 3 5 5 6 7
| 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());
var dq = new LinkedList<int>();
var res = new List<int>();
for (int i = 0; i < nums.Length; i++) {
while (dq.Count > 0 && dq.First.Value < i - k + 1) dq.RemoveFirst();
while (dq.Count > 0 && nums[dq.Last.Value] <= nums[i]) dq.RemoveLast();
dq.AddLast(i);
if (i >= k - 1) res.Add(nums[dq.First.Value]);
}
W(string.Join(" ", res));
}
}Try solving on your own first, then reveal the official answer.