Longest Turbulent Subarray | dynamic programming | leetcode# 978

Показать описание

Welcome to Joeystech and in this video, we will be solving a problem from the Leetcode website - the longest turbulent subarray.

Like its name, this problem will create a little turbulence in the mind while you try to solve it but like I say, if your foundation is strong then solving it is going to be not that difficult.

You are about to add a fabulous dynamic programming problem to your bag so stay tuned to the video and watch it till the end.

The solution that I am going to tell you passed all the test cases in Leetcode and it took only 3 milliseconds.

Also, if you haven’t subscribed to my channel yet, hit the subscribe button and the bell icon because that way you will get to know whenever I release a new video.

Now, I invite you to the section where I explain the problem statement to you without further delay.

You have an integer array out of which you need to find the longest turbulent subarray.

9,4,2,10,7,8,8,1,9

A turbulent subarray is a subarray in which the comparison sign turns opposite between each contiguous pair of integers in the subarray.

Remember that the comparison sign flips between the integers.

Out of the array given above, we have to find the longest such subarray that is turbulent in nature.

Let’s begin solving it and see how the dynamic programming technique unfolds the solution magically.

*********** Github link **************

Рекомендации по теме

Комментарии

More LEETCODE problems solved using Dynamic Programming from Joey'sTech
Rotated Digits

Integer Break Problem

Frog Jump Problem

House Robber Problem

2 Keys Keyboard

Length of Maximum Pair Chain

Cost of Climbing Stairs

Coin game where you have three choices

Maximum Profit by buying and selling shares

Word Break Problem using dynamic programming

joeystechpluscode

Osm soln sir...very easy to understand
Thanks sir😊

sunitasoni

Longest Turbulent Subarray | dynamic programming | leetcode# 978

Longest Turbulent Array - Leetcode 978 - Python

Longest Turbulent Subarray | dynamic programming | leetcode# 978

Leetcode 978. Longest Turbulent Subarray - Dynamic Programming

LeetCode 978. Longest Turbulent Subarray

6.b) Longest turbulence subarray || Kadane Algorithm

Longest Turbulent Subarray | LeetCode | No DP Sliding Window Easy Solution, Explained Simply

#LeetCode978 Longest Turbulent Subarray Solution

Lec 22- Longest Turbulent Subarray | Dynamic Programming | Python | Leetcode

Day 15/30 | Longest Turbulent Subarray | September LeetCoding Challenge 2021 | DP | C++

Longest Turbulent Subarray | Leetcode 978 | Live coding session 🔥🔥🔥

Longest Turbulent Subarray | Leetcode 978 | Dynamic Programming | Basics to Optimal Solution | CP

LeetCode - Longest Turbulent Subarray

Longest Turbulent Subarray | Leetcode | Kadane Algorithm | Newton School

978. Longest Turbulent Subarray - Day 15/30 Leetcode September Challenge

Longest Turbulent Subarray

978. Longest Turbulent Subarray | Medium Level Interview Question | Full Explanation in Python

September 15/2021 LeetCode Challenge: Longest Turbulent Subarray

Leetcode 0978. Longest Turbulent Subarray

Leetcode 978: Longest Turbulent Subarray

Longest Turbulent Subarray||Python||Medium||Leetcode

Longest Turbulent Subarray || 15 September leetcode solution || leetcode week 3 solution || leetcode

Leetcode 978. Longest Turbulent Subarray (2d dp)

LeetCode978 Longest Turbulent Subarray

leetcode 2765. Longest Alternating Subarray - Dynamic Programming