C++ bitset array依數字 3、13、177、31622分割解Leetcode 3020 Find the Maximum Number of Elements in Subset

C++ bitset array依數字 3、13、177、31622分割解Leetcode 3020  Find the Maximum Number of Elements in Subset

不用hashmap，另圖蹊徑才有辦法快速解答Leetcode 3020. 

-----

No Hashmap—forging a new path to crush LeetCode 3020 fast.

Trick: isqrt(1e9)=31622 , 177, 13,  3

[codes on Leetcodes]https://leetcode.com/problems/find-the-maximum-number-of-elements-in-subset/solutions/8360422/divide-nums-according-to-3-1317731622bea-5tk4/

 #anwendeng 

Beats 100%|C/C++矩陣冪次方解Leetcode難題3700 Number of ZigZag Arrays II

Beats 100%|C/C++矩陣冪次方解Leetcode難題3700  Number of ZigZag Arrays II

[codes on Leetcode 3700]https://leetcode.com/problems/number-of-zigzag-arrays-ii/solutions/8354788/symmetrymatrix-exponential149ms-beats-10-9hxf/

[codes on Leetcode 3699]https://leetcode.com/problems/number-of-zigzag-arrays-i/solutions/8352758/use-symmetryprefixdpbeats-9352-by-anwend-xcjj/

在這段影片中，我將深入解析如何使用 矩陣快速冪 (Matrix Exponentiation) 來高效解決 LeetCode 難題 3700：Number of ZigZag Arrays II。這題是 ZigZag Array 系列的進階版本，對時間複雜度有極高要求。

0ms|Leetcode1189 text中可有幾個ballon|C++ 1 liner Py3

0ms|Leetcode1189 text中可有幾個ballon|C++ 1 linerPy3 

會處理count freq，接著來就能處理counting sort

[Leetcode 1833 Maximum Ice Cream Bars|Greedy counting sort]https://www.youtube.com/watch?v=4deOmcdAekg

[codes on Leetcode]https://leetcode.com/problems/maximum-number-of-balloons/solutions/8350164/count-freqbeats-100-by-anwendeng-be0r/

[Py3 1-liner請進]

0ms C++ Py3|Leetcode 1833 Maximum Ice Cream Bars|Greedy counting sort

counting sort 0ms cpp py3 Leetcode1833

貪婪計數排序速解Leetcode 1833 Maximum Ice Cream Bars

[codes on Leetcode]https://leetcode.com/problems/maximum-ice-cream-bars/solutions/8348036/greedy-counting-sortbeats-100-by-anwende-x10v/