# LeetCode Çözümleri – 674. Longest Continuous Increasing Subsequence

LeetCode içerisinde bulunan “Longest Continuous Increasing Subsequence” sorusunun açıklaması ve çözümü. Bu soruda sizden sürekli artışın olduğu en uzun alt diziyi bulmanız isteniyor. Bu tarz sorularda “Sliding Window” tekniği çok yaygın kullanılan bir tekniktir.

✨ Sliding Window tekniği nedir?

🟩 What is Sliding Window Algorithm? Examples?: https://stackoverflow.com/q/8269916/447156

🟩 An Introduction to Sliding Window Algorithms: https://levelup.gitconnected.com/an-introduction-to-sliding-window-algorithms-5533c4fe1cc7

🟩 How to Solve Sliding Window Problems: https://medium.com/outco/how-to-solve-sliding-window-problems-28d67601a66

🟩 Sliding Window Algorithm: https://www.baeldung.com/cs/sliding-window-algorithm

🔥 LeetCode 674. Longest Continuous Increasing Subsequence: https://leetcode.com/problems/longest-continuous-increasing-subsequence/

➡️ Problem açıklaması:

Given an unsorted array of integers nums, return the length of the longest continuous increasing subsequence (i.e. subarray). The subsequence must be strictly increasing.

A continuous increasing subsequence is defined by two indices l and r (l less r) such that it is [nums[l], nums[l + 1], …, nums[r – 1], nums[r]] and for each l lessEqual i less r, nums[i] less nums[i + 1].

Example 1:

Input: nums = [1,3,5,4,7]

Output: 3

Explanation: The longest continuous increasing subsequence is [1,3,5] with length 3. Even though [1,3,5,7] is an increasing subsequence, it is not continuous as elements 5 and 7 are separated by element 4.

Example 2:

Input: nums = [2,2,2,2,2]

Output: 1

Explanation: The longest continuous increasing subsequence is  with length 1. Note that it must be strictly increasing.

Constraints:

0 <= nums.length <= 10^4

-10^9 <= nums[i] <= 10^9

This site uses Akismet to reduce spam. Learn how your comment data is processed.