LeetCode
Question
#1703 Minimum Adjacent Swaps for K Consecutive Ones
Question Details
LeetCode #1703: Minimum Adjacent Swaps for K Consecutive Ones. Difficulty: Hard. Topics: Array, Greedy, Sliding Window, Prefix Sum. Asked at Turing in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →About This Question
This is a reported interview question from a turing interview for a swe role during the coding round.
It covers the following topics: Prefix Sum, Arrays, Greedy, Sliding Window .
Difficulty rating: Hard