| - | 214. Shortest Palindrome | Hard | 2-Pointers, Backtracking | O(𝑛²) | O(𝑛) | 5.05%, 42.16% |
| - | 1545. Find Kth Bit in Nth Binary String | Medium | Logarithmic Reduction | O(log𝑘) | O(1) | 100.00%, 72.92% |
| - | 2924. Find Champion II | Medium | Greedy, Set filtering | O(𝑛+𝑚) | O(𝑛) | 74.17%, 80.31% |
| W-406 | 3216. Lexicographically Smallest String After a Swap | Easy | Greedy | O(𝑛) | O(𝑛) | 86.34%, 87.79% |
| B-135 | 3222. Find the Winning Player in Coin Game | Easy | Math | O(1) | O(1) | 73.16%, 8.49% |
| B-135 | 3223. Minimum Length of String After Operations | Medium | Greedy | O(𝑛) | O(𝑘) | 21.16%, 84.77% |
| B-135 | 3224. Minimum Array Changes to Make Differences Equal | Medium | Greedy | O(𝑛²) | O(𝑛) | 29.90%, 23.02% |
| W-407 | 3226. Number of Bit Changes to Make Two Integers Equal | Easy | Bit Manipulation | O(log𝑛) | O(1) | 86.16%, 10.58% |
| W-407 | 3227. Vowels Game in a String | Medium | Game Theory, Greedy | O(𝑛) | O(1) | 78.26%, 51.99% |
| W-407 | 3228. Maximum Number of Operations to Move Ones to the End | Medium | Greedy, Counting | O(𝑛) | O(𝑛) | 15.04%, 7.20% |
| W-407 | 3229. Minimum Operations to Make Array Equal to Target | Hard | Greedy | O(𝑛) | O(1) | 96.87%, 99.76% |
| W-408 | 3232. Find if Digit Game Can Be Won | Easy | Iterative | O(𝑛) | O(1) | 5.18%, 42.08% |
| W-408 | 3233. Find the Count of Numbers Which Are Not Special | Medium | Precomputation of Primes | O(√𝑛) | O(𝑛) | 80.00%, 5.49% |
| W-408 | 3234. Count the Number of Substrings With Dominant Ones | Medium | Greedy, Brute Force | O(𝑛√𝑛) | O(𝑛) | 9.38%, 27.34% |
| B-136 | 3238. Find the Number of Winning Players | Easy | Counting | O(𝑛𝑦+𝑚) | O(𝑛×𝑦) | 10.00%, 31.25% |
| B-136 | 3239. Minimum Number of Flips to Make Binary Grid Palindromic I | Medium | Brute Force | O(𝑚×𝑛) | O(𝑚×𝑛) | 6.67%, 35.38% |
| B-136 | 3240. Minimum Number of Flips to Make Binary Grid Palindromic II | Medium | Greedy | O(𝑚×𝑛) | O(1) | 5.88%, 49.48% |
| W-409 | 3242. Design Neighbor Sum Service | Easy | Padded Grid | O(𝑛²) | O(𝑛²) | 5.66%, 82.75% |
| W-409 | 3243. Shortest Distance After Road Addition Queries I | Medium | BFS | O(𝑛𝑞+𝑞²) | O(𝑛+𝑞) | 5.28%, 5.90% |
| W-409 | 3244. Shortest Distance After Road Addition Queries II | Hard | Greedy, Removal from Set | O(𝑛×𝑞) | O(𝑛+𝑞) | 35.42%, 19.59% |
| W-410 | 3248. Snake in Matrix | Easy | Simple Commands | O(𝑛) | O(1) | 10.30%, 46.61% |
| W-410 | 3249. Count the Number of Good Nodes | Medium | DFS, BFS | O(𝑛) | O(𝑛) | 5.77%, 18.15% |
| B-137 | 3254. Find the Power of K-Size Subarrays I | Medium | Sliding Window | O(𝑛) | O(𝑛) | 15.26%, 56.34% |
| B-137 | 3255. Find the Power of K-Size Subarrays II | Medium | Sliding Window | O(𝑛) | O(𝑛) | 5.81%, 5.07% |
| W-411 | 3258. Count Substrings That Satisfy K-Constraint I | Easy | Sliding Window | O(𝑛) | O(1) | 28.64%, 99.09% |
| W-412 | 3264. Final Array State After K Multiplication Operations I | Easy | Greedy, Heap | O(𝑘log𝑛 + 𝑛log𝑛) | O(𝑛) | 10.25%, 15.78% |
| W-412 | 3265. Count Almost Equal Pairs I | Medium | Brute Force | O(𝑛²×𝑚) | O(𝑚) | 35.77%, 96.50% |
| W-412 | 3266. Final Array State After K Multiplication Operations II | Hard | Greedy, Heap | O(𝑘log𝑛 + 𝑛log𝑛) | O(𝑛) | 5.16%, 47.95% |
| W-412 | 3267. Count Almost Equal Pairs II | Hard | Permutation Set Intersections, Sliding Window | O(𝑛²+𝑛𝑚⁴) | O(𝑛𝑚⁴) | 28.00%, 5.33% |
| B-138 | 3270. Find the Key of the Numbers | Easy | Digit Manipulation | O(1) | O(1) | 3.69%, 100.00% |
| W-413 | 3274. Check if Two Chessboard Squares Have the Same Color | Easy | Parity Check | O(1) | O(1) | 51.68%, 100.00% |
| W-413 | 3275. K-th Nearest Obstacle Queries | Medium | | | | |
| W-414 | 3280. Convert Date to Binary | Easy | | | | |
| W-414 | 3281. Maximize Score of Numbers in Ranges | Medium | | | | |
| B-139 | 3285. Find Indices of Stable Mountains | Easy | | | | |
| B-139 | 3286. Find a Safe Walk Through a Grid | Medium | | | | |
| W-415 | 3289. The Two Sneaky Numbers of Digitville | Easy | | | | |
| W-416 | 3295. Report Spam Message | Medium | | | | |
| B-140 | 3300. Minimum Element After Replacement With Digit Sum | Easy | | | | |
| B-140 | 3301. Maximize the Total Height of Unique Towers | Medium | | | | |
| B-140 | 3302. Find the Lexicographically Smallest Valid Sequence | Medium | Greedy, Prefix-sum-like Precomputation | O(𝑛) | O(𝑛) | 60.60%, 50.48% |
| B-140 | 3303. Find the Occurrence of First Almost Equal Substring | Hard | Z-algorithm, 2-way | O(𝑛+𝑚) | O(𝑛+𝑚) | 95.34%, 76.70% |
| W-417 | 3304. Find the K-th Character in String Game I | Easy | Brute Force | O(𝑘) | O(𝑘) | 48.45%, 56.78% |
| W-417 | 3304. Find the K-th Character in String Game I | Easy | Logarithmic Reduction | O(log𝑘) | O(1) | 100.00%, 17.19% |
| W-417 | 3305. Count of Substrings Containing Every Vowel and K Consonants I | Medium | Brute Force | O(𝑛²) | O(1) | 33.81%, 7.44% |
| W-417 | 3306. Count of Substrings Containing Every Vowel and K Consonants II | Medium | Sliding Window | O(𝑛) | O(1) | 32.33%, 49.25% |
| W-417 | 3307. Find the K-th Character in String Game II | Hard | Binary Search | O(log𝑘) | O(log𝑘) | 21.09%, 26.46% |
| W-420 | 3324. Find the Sequence of Strings Appeared on the Screen | Medium | Brute Force | O(𝑛) | O(𝑛) | 21.01%, 56.33% |
| W-420 | 3325. Count Substrings With K-Frequency Characters I | Medium | Sliding Window | O(𝑛) | O(1) | 78.76%, 67.75% |
| W-420 | 3326. Minimum Division Operations to Make Array Non Decreasing | Medium | Greedy | O(𝑛√𝑚) | O(1) | 34.74%, 48.36% |
| B-142 | 3330. Find the Original Typed String I | Easy | Counting | O(𝑛) | O(1) | 66.10%, 55.62% |
| B-142 | 3331. Find Subtree Sizes After Changes | Medium | DFS, Brute Force | O(𝑛²) | O(𝑛) | 5.01%, 5.08% |
| W-421 | 3334. Find the Maximum Factor Score of Array | Medium | Prime Factorisation | O(𝑛²) | O(𝑛) | 5.83%, 59.60% |
| W-422 | 3340. Check Balanced String | Easy | Iterative | O(𝑛) | O(1) | 56.40%, 38.80% |
| W-422 | 3341. Find Minimum Time to Reach Last Room I | Medium | Dijkstra | O(𝑛𝑚log(𝑛𝑚)) | O(𝑛×𝑚) | 15.16%, 7.18% |
| W-422 | 3342. Find Minimum Time to Reach Last Room II | Medium | Dijkstra | O(𝑛𝑚log(𝑛𝑚)) | O(𝑛×𝑚) | 8.26%, 13.72% |
| W-424 | 3354. Make Array Elements Equal to Zero | Easy | Greedy, Prefix SumZero | O(𝑛) | O(1) | 79.51%, 73.70% |
| W-424 | 3355. Zero Array Transformation I | Medium | Greedy, Prefix-sum-like Precomputation | O(𝑛+𝑞) | O(𝑛) | 58.48%, 82.45% |
| W-424 | 3356. Zero Array Transformation II | Medium | Greedy, Prefix-sum-like | O(𝑛+𝑞) | O(𝑛) | 97.37%, 41.05% |
| B-144 | 3360. Stone Removal Game | Easy | Simulation | O(√𝑛) | O(1) | 100.00%, 78.49% |
| B-144 | 3361. Shift Distance Between Two Strings | Medium | Precomputation Grid | O(𝑛) | O(1) | 95.41%, 48.70% |
| W-425 | 3364. Minimum Positive Sum Subarray | Easy | Brute Force | O(𝑛³) | O(1) | 6.45%, 83.57% |
| W-425 | 3365. Rearrange K Substrings to Form Target String | Medium | Greedy with Sorting | O(𝑛log𝑘) | O(𝑛) | 5.06%, 5.56% |
| W-425 | 3366. Minimum Array Sum | Medium | Dynamic Programming (Iterative) with Greedy Preprocessing | O(𝑛³) | O(𝑛³) | 43.94%, 62.12% |
| B-162 | 3633. Earliest Finish Time for Land and Water Rides I | Easy | Greedy linear pass | O(𝑛+𝑚) | O(1) | 100.00%, 100.00% |
| B-162 | 3634. Minimum Removals to Balance Array | Medium | 2-Pointers Sliding Window | O(𝑛log𝑛) | O(𝑛) | 63.46%, 7.04% |
| B-162 | 3635. Earliest Finish Time for Land and Water Rides II | Medium | Greedy linear pass | O(𝑛+𝑚) | O(1) | 100.00%, 100.00% |
| W-465 | 3668. Restore Finishing Order | Easy | Set lookup | O(𝑛+𝑚) | O(𝑚) | 38.41%, 78.94% |
| W-465 | 3669. Balanced K-Factor Decomposition | Medium | Prime Factorisation, Combinatorial BFS | O((log𝑛)!) | O((log𝑛)!) | 68.08%, 16.68% |
![]() | ![]() | ![]() | ![]() | ![]() | ![]() | ![]() |
