Difficulty,Title,Frequency,Acceptance Rate,Link,Topics HARD,Trionic Array II,100.0,0.004714681951659041,https://leetcode.com/problems/trionic-array-ii,"Array, Dynamic Programming" HARD,Cherry Pickup,97.5,0.004074181020637922,https://leetcode.com/problems/cherry-pickup,"Array, Dynamic Programming, Matrix" MEDIUM,Reach a Number,94.8,0.004583091302740667,https://leetcode.com/problems/reach-a-number,"Math, Binary Search" MEDIUM,Count Number of Nice Subarrays,91.6,0.007582893273212039,https://leetcode.com/problems/count-number-of-nice-subarrays,"Array, Hash Table, Math, Sliding Window, Prefix Sum" HARD,Zuma Game,83.7,0.002893431467354321,https://leetcode.com/problems/zuma-game,"String, Dynamic Programming, Stack, Breadth-First Search, Memoization" HARD,Strange Printer,83.7,0.006104271793979468,https://leetcode.com/problems/strange-printer,"String, Dynamic Programming" HARD,Frog Position After T Seconds,78.5,0.0038885635405337578,https://leetcode.com/problems/frog-position-after-t-seconds,"Tree, Depth-First Search, Breadth-First Search, Graph Theory" HARD,Critical Connections in a Network,78.5,0.006073522377389313,https://leetcode.com/problems/critical-connections-in-a-network,"Depth-First Search, Graph Theory, Biconnected Component, Bridge (Graph)" HARD,Longest Valid Parentheses,62.2,0.004136898151059135,https://leetcode.com/problems/longest-valid-parentheses,"String, Dynamic Programming, Stack, Bracket Sequences" HARD,Lexicographically Maximum MEX Array,62.2,0.005377436353247412,https://leetcode.com/problems/lexicographically-maximum-mex-array,"Array, Hash Table, Greedy, Queue" MEDIUM,Capacity To Ship Packages Within D Days,62.2,0.007481786250078604,https://leetcode.com/problems/capacity-to-ship-packages-within-d-days,"Array, Binary Search" MEDIUM,Longest Repeating Character Replacement,62.2,0.006087660686638922,https://leetcode.com/problems/longest-repeating-character-replacement,"Hash Table, String, Sliding Window" HARD,Minimum Time to Transport All Individuals,62.2,0.0028693836405529953,https://leetcode.com/problems/minimum-time-to-transport-all-individuals,"Array, Bit Manipulation, Graph Theory, Heap (Priority Queue), Shortest Path, Bitmask"