Problem Name:
2762. Continuous Subarrays
Problem Statement:
You are given a 0-indexed integer array nums. A subarray of nums is called continuous if:
Let i, i + 1, ..., j be the indices in the subarray. Then, for each pair of indices i = i1, i2 = j, 0 = |nums[i1] - nums[i2]| = 2.
Return the total number of continuous subarrays.
A subarray is a contiguous non-empty sequence of elements within an array.
Problem Link:
https://leetcode.com/problems/continuous-subarrays/description/?envType=daily-question&envId=2024-12-14
Solution Link:
https://github.com/Tiwarishashwat/shashcode30/blob/main/continuousSubarrays.java
Graph Playlist:
https://www.youtube.com/playlist?list=PLQ7ZAf76c0ZOGuMjg3qwNgILb_dKWTxyQ
Java Plus DSA Placement Course Playlist:
https://youtube.com/playlist?list=PLQ7ZAf76c0ZPVdhV1bAjFv0bQc1xHURzE
Java Plus DSA Sheet:
https://docs.google.com/spreadsheets/d/119u25NO-4ZJ9zwfUKs5eGNo0exCVq3gZEFWvkCDiMqI/edit?usp=sharing
Notes:
https://github.com/Tiwarishashwat/Java-Plus-DSA-Placement-Course
Telegram Link:
https://shashwattiwari.page.link/telegramShashwat
Ultimate Recursion Series Playlist:
https://youtube.com/playlist?list=PLQ7ZAf76c0ZMzC9OHPbo-dUgx6oU3T0jK
Instagram Handle: (@shashwat_tiwari_st)
https://shashwattiwari.page.link/shashwatInsta
Samsung Interview Experience:
https://youtu.be/GrvlpBzphSU
Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung
Timestamp:
0:00 - Introduction
