C++ Py3|Sliding window hashmap解Leetcode 2958 Length of Longest Subarray With at Most K

Beat 99.89% C++ Py3|Sliding window hashmap解Leetcode 2958 Length of Longest Subarray With at Most K

一陣子沒出Leetcode解題長片。這題其實很標準2958. Length of Longest Subarray With at Most K Frequency，適合練習sliding window+ hash map ! 客製化的hash map似乎是overkilling

[codes on Leetcode]https://leetcode.com/problems/length-of-longest-subarray-with-at-most-k-frequency/solutions/8455711/sliding-window-hashmapbeats-9955-by-anwe-u1a5/

  #anwendeng 

===

Time stamps:

00:00 - Introduction and Problem Overview (LeetCode 2958)

00:18 - Performance Results: Beating 99.89% in C++

00:48 - Problem Logic: Defining a "Good" Subarray

01:54 - Solution Strategy: Standard Sliding Window

02:13 - Example 1 Walkthrough

03:14 - Example 2 & 3 Walkthrough

04:08 - Constraints and Data Structure Choice (Hash Map)

05:03 - High-level Solution Concept

06:17 - C++ Implementation and Memory Optimization (unordered_map)

07:07 - Python Implementation: Using defaultdict and enumerate

08:01 - Window Shrinking Logic and Final Updates

08:58 - Submission and Closing