Из-за периодической блокировки нашего сайта РКН сервисами, просим воспользоваться резервным адресом:
Загрузить через ClipSave.ruУ нас вы можете посмотреть бесплатно LeetCode 3187 | Peaks in Array | Weekly Contest 402 | или скачать в максимальном доступном качестве, которое было загружено на ютуб. Для скачивания выберите вариант из формы ниже:
Если кнопки скачивания не
загрузились
НАЖМИТЕ ЗДЕСЬ или обновите страницу
Если возникают проблемы со скачиванием, пожалуйста напишите в поддержку по адресу внизу
страницы.
Спасибо за использование сервиса savevideohd.ru
Hello friends! In this video, we'll explore how to solve a problem involving peaks in an array and handling two types of queries efficiently. A peak in an array is an element that is greater than its previous and next element. Problem Description: Given, an integer array nums and a 2D integer array queries We need to process the following types of queries: queries[i] = [1, li, ri]: Determine the count of peak elements in the subarray nums[li..ri]. queries[i] = [2, indexi, vali]: Change the value of nums[indexi] to vali. Our goal is to return an array containing the results of the queries of the first type in order. Notes: The first and the last element of an array or a subarray cannot be a peak. Example: Input: nums = [3,1,4,2,5], queries = [[2,3,4],[1,0,4]] Output: [0] Watch the video to understand the detailed implementation and see the code in action! 🚀 By the end of this video, you'll have a comprehensive understanding of how to approach and solve this problem effectively. If you find this video helpful, please like, share, and subscribe to support the channel. Your feedback is valuable, so feel free to comment if you have any questions or suggestions. 🔗 Related Links and Resources: LeetCode Weekly Contest 402 Problem Link on LeetCode (https://leetcode.com/problems/peaks-i...) Check out the source code on GitHub: https://github.com/algohorizon1/leetc... LeetCode Daily Challenge - • LeetCode Daily Challenge LeetCode Contest - • LeetCode Contest LeetCode Problem Solutions - • LeetCode Problem Solutions LeetCode Top Interview 150 - • LeetCode Top Interview 150 Tags: #leetcode #leetcodedailychallenge #arrays #arraysinjava #dsa #problemsolving #interviewpreparation #java #datastructures #datastructuresandalgorithms #coding #programming #weeklycontest Thank you for watching and happy coding! 😊 Music I use: https://www.bensound.com License code: ZHZCGWXPWFJEOVSU