SLIDING WINDOW

What is the primary purpose of the sliding window technique?

• To divide the array into equal parts

• To efficiently solve subarray problems

• To calculate median values

• To perform sorting in arrays

How does the sliding window improve efficiency compared to brute force?

• By reducing memory usage

• By reducing redundant calculations

• By increasing recursion depth

• By sorting data

What is the time complexity of the optimal sliding window approach for a fixed window size?

• O(n × k)

• O(n)

• O(log n)

• O(n²)

What data structures are commonly used with the sliding window technique?

• Stack

• Queue

• Deque

• Hash Map

Can the sliding window technique be applied to string problems? Provide an example.

• Yes, but only for palindrome detection

• Yes, e.g., finding the longest substring with distinct characters

• No, it's limited to numerical data only

• No, it's incompatible with strings

What are the two types of sliding window techniques?

• Fixed and Dynamic

• Static and Dynamic

• Fixed and Variable

• Constant and Changing

What is the key difference between a fixed and variable sliding window?

• Fixed window size doesn't change; variable window size can expand or shrink

• Both are always constant

• Fixed is faster than variable

• Variable is slower than fixed

How would you modify the sliding window technique to track the maximum element in the window at each step?

• Using a Queue

• Using a Stack

• Using a Deque

• Using a Hash Map

Which real-life scenario best describes a sliding window technique?

• Checking email spam filters

• Monitoring stock prices over the past week

• Calculating monthly bills

• Sorting student scores

What kind of problems are best suited for the sliding window technique?

• Searching

• Sorting

• Subarray problems

• Tree traversal give answers for it