Sliding window technique in Data Structures Theory - Interactive Code Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to initialize the sliding window start index.

Data Structures Theory

start = [1]

Drag options to blanks, or click blank then click option'

ANone

B-1

C0

D1

Attempts:

3 left

💡 Hint

Common Mistakes

Starting the window at 1 instead of 0.

Using None or negative values as start index.

The sliding window usually starts at index 0 to cover the beginning of the data.

2fill in blank

medium

Complete the code to move the sliding window end index forward by one.

Data Structures Theory

end = [1] + 1

Drag options to blanks, or click blank then click option'

Astart

Bend

Cwindow_size

Dlength

Attempts:

3 left

💡 Hint

Common Mistakes

Adding 1 to start instead of end.

Using window_size or length incorrectly.

To slide the window forward, the end index is increased by one from its current position.

3fill in blank

hard

Fix the error in the code to shrink the sliding window from the left.

Data Structures Theory

start = [1] + 1

Drag options to blanks, or click blank then click option'

Astart

Bend

Cwindow_size

Dlength

Attempts:

3 left

💡 Hint

Common Mistakes

Increasing end instead of start.

Using window_size or length incorrectly.

To shrink the window from the left, increase the start index by one.

4fill in blank

hard

Fill both blanks to create a sliding window dictionary comprehension that stores word lengths for words longer than 3 characters.

Data Structures Theory

{word: [1] for word in words if [2] > 3}

Drag options to blanks, or click blank then click option'

Alen(word)

Cword

Attempts:

3 left

💡 Hint

Common Mistakes

Using word instead of len(word) for length.

Filtering by word instead of its length.

The dictionary comprehension maps each word to its length, filtering words longer than 3 characters using len(word) > 3.

5fill in blank

hard

Fill all three blanks to create a sliding window dictionary comprehension that stores uppercase words and their lengths if length is greater than 4.

Data Structures Theory

{ [1]: [2] for word in words if [3] > 4 }

Drag options to blanks, or click blank then click option'

Aword.upper()

Blen(word)

Dword

Attempts:

3 left

💡 Hint

Common Mistakes

Using word instead of word.upper() as key.

Filtering by word instead of length.

Mixing up key and value positions.

The comprehension uses the uppercase word as key, its length as value, and filters words longer than 4 characters.