LeetCode
Experience
#3105 Longest Strictly Increasing or Strictly Decreasing Subarray
Interview Experience
LeetCode #3105: Longest Strictly Increasing or Strictly Decreasing Subarray. Difficulty: Easy. Topics: Array. Asked at Yandex 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 candidate experience report from a yandex interview for a swe role during the coding round.
It covers the following topics: Arrays .
Difficulty rating: Easy