diff --git a/workspaces/archive/problems.jsonl b/workspaces/archive/problems.jsonl index 62e9e836..d1816af1 100644 --- a/workspaces/archive/problems.jsonl +++ b/workspaces/archive/problems.jsonl @@ -258,7 +258,7 @@ {"dailyChallengeDates":["2020-07-27","2022-02-08","2023-04-26"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":258,"title":"Add Digits","titleSlug":"add-digits"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":259,"title":"3Sum Smaller","titleSlug":"3sum-smaller"} {"dailyChallengeDates":["2020-07-24","2021-11-06","2024-05-31"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":260,"title":"Single Number III","titleSlug":"single-number-iii"} -{"dailyChallengeDates":[],"weeklyChallengeDates":["2021-08-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":261,"title":"Graph Valid Tree","titleSlug":"graph-valid-tree"} +{"dailyChallengeDates":[],"weeklyChallengeDates":["2021-08-22","2025-01-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":261,"title":"Graph Valid Tree","titleSlug":"graph-valid-tree"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":262,"title":"Trips and Users","titleSlug":"trips-and-users"} {"dailyChallengeDates":["2022-11-18"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":263,"title":"Ugly Number","titleSlug":"ugly-number"} {"dailyChallengeDates":["2020-07-05","2024-08-18"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":264,"title":"Ugly Number II","titleSlug":"ugly-number-ii"} @@ -404,7 +404,7 @@ {"dailyChallengeDates":["2020-08-24","2021-11-04","2024-04-14"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":404,"title":"Sum of Left Leaves","titleSlug":"sum-of-left-leaves"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":405,"title":"Convert a Number to Hexadecimal","titleSlug":"convert-a-number-to-hexadecimal"} {"dailyChallengeDates":["2020-06-06","2022-06-29"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":406,"title":"Queue Reconstruction by Height","titleSlug":"queue-reconstruction-by-height"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":407,"title":"Trapping Rain Water II","titleSlug":"trapping-rain-water-ii"} +{"dailyChallengeDates":["2025-01-19"],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":407,"title":"Trapping Rain Water II","titleSlug":"trapping-rain-water-ii"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":408,"title":"Valid Word Abbreviation","titleSlug":"valid-word-abbreviation"} {"dailyChallengeDates":["2020-08-14","2024-06-04"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":409,"title":"Longest Palindrome","titleSlug":"longest-palindrome"} {"dailyChallengeDates":["2022-03-31"],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":410,"title":"Split Array Largest Sum","titleSlug":"split-array-largest-sum"} @@ -681,7 +681,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":681,"title":"Next Closest Time","titleSlug":"next-closest-time"} {"dailyChallengeDates":["2022-04-10"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":682,"title":"Baseball Game","titleSlug":"baseball-game"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":683,"title":"K Empty Slots","titleSlug":"k-empty-slots"} -{"dailyChallengeDates":["2021-06-25"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":684,"title":"Redundant Connection","titleSlug":"redundant-connection"} +{"dailyChallengeDates":["2021-06-25","2025-01-29"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":684,"title":"Redundant Connection","titleSlug":"redundant-connection"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":685,"title":"Redundant Connection II","titleSlug":"redundant-connection-ii"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":686,"title":"Repeated String Match","titleSlug":"repeated-string-match"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":687,"title":"Longest Univalue Path","titleSlug":"longest-univalue-path"} @@ -799,7 +799,7 @@ {"dailyChallengeDates":["2020-10-26","2022-03-04","2023-09-24"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":799,"title":"Champagne Tower","titleSlug":"champagne-tower"} {"dailyChallengeDates":[],"weeklyChallengeDates":["2022-10-15"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":800,"title":"Similar RGB Color","titleSlug":"similar-rgb-color"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":801,"title":"Minimum Swaps To Make Sequences Increasing","titleSlug":"minimum-swaps-to-make-sequences-increasing"} -{"dailyChallengeDates":["2023-07-12"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":802,"title":"Find Eventual Safe States","titleSlug":"find-eventual-safe-states"} +{"dailyChallengeDates":["2023-07-12","2025-01-24"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":802,"title":"Find Eventual Safe States","titleSlug":"find-eventual-safe-states"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":803,"title":"Bricks Falling When Hit","titleSlug":"bricks-falling-when-hit"} {"dailyChallengeDates":["2020-11-22","2022-08-17"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":804,"title":"Unique Morse Code Words","titleSlug":"unique-morse-code-words"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":805,"title":"Split Array With Same Average","titleSlug":"split-array-with-same-average"} @@ -824,7 +824,7 @@ {"dailyChallengeDates":["2020-08-19"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":824,"title":"Goat Latin","titleSlug":"goat-latin"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":825,"title":"Friends Of Appropriate Ages","titleSlug":"friends-of-appropriate-ages"} {"dailyChallengeDates":["2024-06-18"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":826,"title":"Most Profit Assigning Work","titleSlug":"most-profit-assigning-work"} -{"dailyChallengeDates":["2021-08-01"],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":827,"title":"Making A Large Island","titleSlug":"making-a-large-island"} +{"dailyChallengeDates":["2021-08-01","2025-01-31"],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":827,"title":"Making A Large Island","titleSlug":"making-a-large-island"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":828,"title":"Count Unique Characters of All Substrings of a Given String","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":829,"title":"Consecutive Numbers Sum","titleSlug":"consecutive-numbers-sum"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":830,"title":"Positions of Large Groups","titleSlug":"positions-of-large-groups"} @@ -913,7 +913,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":913,"title":"Cat and Mouse","titleSlug":"cat-and-mouse"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":914,"title":"X of a Kind in a Deck of Cards","titleSlug":"x-of-a-kind-in-a-deck-of-cards"} {"dailyChallengeDates":["2021-07-22"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":915,"title":"Partition Array into Disjoint Intervals","titleSlug":"partition-array-into-disjoint-intervals"} -{"dailyChallengeDates":["2021-03-26","2022-07-30"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":916,"title":"Word Subsets","titleSlug":"word-subsets"} +{"dailyChallengeDates":["2021-03-26","2022-07-30","2025-01-10"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":916,"title":"Word Subsets","titleSlug":"word-subsets"} {"dailyChallengeDates":["2021-09-14"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":917,"title":"Reverse Only Letters","titleSlug":"reverse-only-letters"} {"dailyChallengeDates":["2020-05-15","2023-01-18"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":918,"title":"Maximum Sum Circular Subarray","titleSlug":"maximum-sum-circular-subarray"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":919,"title":"Complete Binary Tree Inserter","titleSlug":"complete-binary-tree-inserter"} @@ -1264,7 +1264,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1264,"title":"Page Recommendations","titleSlug":"page-recommendations"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1265,"title":"Print Immutable Linked List in Reverse","titleSlug":"print-immutable-linked-list-in-reverse"} {"dailyChallengeDates":["2023-12-03"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1266,"title":"Minimum Time Visiting All Points","titleSlug":"minimum-time-visiting-all-points"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1267,"title":"Count Servers that Communicate","titleSlug":"count-servers-that-communicate"} +{"dailyChallengeDates":["2025-01-23"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1267,"title":"Count Servers that Communicate","titleSlug":"count-servers-that-communicate"} {"dailyChallengeDates":["2021-05-31","2022-06-19"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1268,"title":"Search Suggestions System","titleSlug":"search-suggestions-system"} {"dailyChallengeDates":["2023-10-15"],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1269,"title":"Number of Ways to Stay in the Same Place After Some Steps","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1270,"title":"All People Report to the Given Manager","titleSlug":"all-people-report-to-the-given-manager"} @@ -1365,7 +1365,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1365,"title":"How Many Numbers Are Smaller Than the Current Number","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1366,"title":"Rank Teams by Votes","titleSlug":"rank-teams-by-votes"} {"dailyChallengeDates":["2024-09-07"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1367,"title":"Linked List in Binary Tree","titleSlug":"linked-list-in-binary-tree"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1368,"title":"Minimum Cost to Make at Least One Valid Path in a Grid","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"} +{"dailyChallengeDates":["2025-01-18"],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1368,"title":"Minimum Cost to Make at Least One Valid Path in a Grid","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1369,"title":"Get the Second Most Recent Activity","titleSlug":"get-the-second-most-recent-activity"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1370,"title":"Increasing Decreasing String","titleSlug":"increasing-decreasing-string"} {"dailyChallengeDates":["2024-09-15"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1371,"title":"Find the Longest Substring Containing Vowels in Even Counts","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"} @@ -1397,7 +1397,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1397,"title":"Find All Good Strings","titleSlug":"find-all-good-strings"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1398,"title":"Customers Who Bought Products A and B but Not C","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1399,"title":"Count Largest Group","titleSlug":"count-largest-group"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1400,"title":"Construct K Palindrome Strings","titleSlug":"construct-k-palindrome-strings"} +{"dailyChallengeDates":["2025-01-11"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1400,"title":"Construct K Palindrome Strings","titleSlug":"construct-k-palindrome-strings"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1401,"title":"Circle and Rectangle Overlapping","titleSlug":"circle-and-rectangle-overlapping"} {"dailyChallengeDates":["2023-03-29"],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1402,"title":"Reducing Dishes","titleSlug":"reducing-dishes"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1403,"title":"Minimum Subsequence in Non-Increasing Order","titleSlug":"minimum-subsequence-in-non-increasing-order"} @@ -1405,7 +1405,7 @@ {"dailyChallengeDates":["2024-10-16"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1405,"title":"Longest Happy String","titleSlug":"longest-happy-string"} {"dailyChallengeDates":["2023-05-27"],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1406,"title":"Stone Game III","titleSlug":"stone-game-iii"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1407,"title":"Top Travellers","titleSlug":"top-travellers"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1408,"title":"String Matching in an Array","titleSlug":"string-matching-in-an-array"} +{"dailyChallengeDates":["2025-01-07"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1408,"title":"String Matching in an Array","titleSlug":"string-matching-in-an-array"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1409,"title":"Queries on a Permutation With Key","titleSlug":"queries-on-a-permutation-with-key"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1410,"title":"HTML Entity Parser","titleSlug":"html-entity-parser"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1411,"title":"Number of Ways to Paint N × 3 Grid","titleSlug":"number-of-ways-to-paint-n-3-grid"} @@ -1419,12 +1419,12 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1419,"title":"Minimum Number of Frogs Croaking","titleSlug":"minimum-number-of-frogs-croaking"} {"dailyChallengeDates":["2023-10-07"],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1420,"title":"Build Array Where You Can Find The Maximum Exactly K Comparisons","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1421,"title":"NPV Queries","titleSlug":"npv-queries"} -{"dailyChallengeDates":["2023-12-22"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1422,"title":"Maximum Score After Splitting a String","titleSlug":"maximum-score-after-splitting-a-string"} +{"dailyChallengeDates":["2023-12-22","2025-01-01"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1422,"title":"Maximum Score After Splitting a String","titleSlug":"maximum-score-after-splitting-a-string"} {"dailyChallengeDates":["2021-05-11","2022-06-26"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1423,"title":"Maximum Points You Can Obtain from Cards","titleSlug":"maximum-points-you-can-obtain-from-cards"} {"dailyChallengeDates":["2023-11-22"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1424,"title":"Diagonal Traverse II","titleSlug":"diagonal-traverse-ii"} {"dailyChallengeDates":["2023-10-21"],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1425,"title":"Constrained Subsequence Sum","titleSlug":"constrained-subsequence-sum"} {"dailyChallengeDates":["2020-04-07"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1426,"title":"Counting Elements","titleSlug":"counting-elements"} -{"dailyChallengeDates":["2020-04-14"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1427,"title":"Perform String Shifts","titleSlug":"perform-string-shifts"} +{"dailyChallengeDates":["2020-04-14"],"weeklyChallengeDates":["2025-01-01"],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1427,"title":"Perform String Shifts","titleSlug":"perform-string-shifts"} {"dailyChallengeDates":["2020-04-21"],"weeklyChallengeDates":["2021-10-01","2022-12-29","2024-01-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1428,"title":"Leftmost Column with at Least a One","titleSlug":"leftmost-column-with-at-least-a-one"} {"dailyChallengeDates":["2020-04-28"],"weeklyChallengeDates":["2021-11-22","2024-10-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1429,"title":"First Unique Number","titleSlug":"first-unique-number"} {"dailyChallengeDates":["2020-04-30"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1430,"title":"Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"} @@ -1459,7 +1459,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1459,"title":"Rectangles Area","titleSlug":"rectangles-area"} {"dailyChallengeDates":["2024-08-03"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1460,"title":"Make Two Arrays Equal by Reversing Subarrays","titleSlug":"make-two-arrays-equal-by-reversing-subarrays"} {"dailyChallengeDates":["2021-03-12","2022-05-31"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1461,"title":"Check If a String Contains All Binary Codes of Size K","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1462,"title":"Course Schedule IV","titleSlug":"course-schedule-iv"} +{"dailyChallengeDates":["2025-01-27"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1462,"title":"Course Schedule IV","titleSlug":"course-schedule-iv"} {"dailyChallengeDates":["2020-12-19","2022-01-08","2024-02-11"],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1463,"title":"Cherry Pickup II","titleSlug":"cherry-pickup-ii"} {"dailyChallengeDates":["2023-12-12"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1464,"title":"Maximum Product of Two Elements in an Array","titleSlug":"maximum-product-of-two-elements-in-an-array"} {"dailyChallengeDates":["2021-06-03","2022-07-02"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1465,"title":"Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"} @@ -1727,7 +1727,7 @@ {"dailyChallengeDates":["2023-11-26"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1727,"title":"Largest Submatrix With Rearrangements","titleSlug":"largest-submatrix-with-rearrangements"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1728,"title":"Cat and Mouse II","titleSlug":"cat-and-mouse-ii"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1729,"title":"Find Followers Count","titleSlug":"find-followers-count"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1730,"title":"Shortest Path to Get Food","titleSlug":"shortest-path-to-get-food"} +{"dailyChallengeDates":[],"weeklyChallengeDates":["2025-01-15"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1730,"title":"Shortest Path to Get Food","titleSlug":"shortest-path-to-get-food"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1731,"title":"The Number of Employees Which Report to Each Employee","titleSlug":"the-number-of-employees-which-report-to-each-employee"} {"dailyChallengeDates":["2023-06-19"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1732,"title":"Find the Highest Altitude","titleSlug":"find-the-highest-altitude"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1733,"title":"Minimum Number of People to Teach","titleSlug":"minimum-number-of-people-to-teach"} @@ -1762,11 +1762,11 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":["2021-10-29"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1762,"title":"Buildings With an Ocean View","titleSlug":"buildings-with-an-ocean-view"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1763,"title":"Longest Nice Substring","titleSlug":"longest-nice-substring"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1764,"title":"Form Array by Concatenating Subarrays of Another Array","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1765,"title":"Map of Highest Peak","titleSlug":"map-of-highest-peak"} +{"dailyChallengeDates":["2025-01-22"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1765,"title":"Map of Highest Peak","titleSlug":"map-of-highest-peak"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1766,"title":"Tree of Coprimes","titleSlug":"tree-of-coprimes"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":1767,"title":"Find the Subtasks That Did Not Execute","titleSlug":"find-the-subtasks-that-did-not-execute"} {"dailyChallengeDates":["2023-04-18"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1768,"title":"Merge Strings Alternately","titleSlug":"merge-strings-alternately"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1769,"title":"Minimum Number of Operations to Move All Balls to Each Box","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"} +{"dailyChallengeDates":["2025-01-06"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1769,"title":"Minimum Number of Operations to Move All Balls to Each Box","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"} {"dailyChallengeDates":["2022-09-16"],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1770,"title":"Maximum Score from Performing Multiplication Operations","titleSlug":"maximum-score-from-performing-multiplication-operations"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1771,"title":"Maximize Palindrome Length From Subsequences","titleSlug":"maximize-palindrome-length-from-subsequences"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":1772,"title":"Sort Features by Popularity","titleSlug":"sort-features-by-popularity"} @@ -1927,7 +1927,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1927,"title":"Sum Game","titleSlug":"sum-game"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1928,"title":"Minimum Cost to Reach Destination in Time","titleSlug":"minimum-cost-to-reach-destination-in-time"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":1929,"title":"Concatenation of Array","titleSlug":"concatenation-of-array"} -{"dailyChallengeDates":["2023-11-14"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1930,"title":"Unique Length-3 Palindromic Subsequences","titleSlug":"unique-length-3-palindromic-subsequences"} +{"dailyChallengeDates":["2023-11-14","2025-01-04"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":1930,"title":"Unique Length-3 Palindromic Subsequences","titleSlug":"unique-length-3-palindromic-subsequences"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1931,"title":"Painting a Grid With Three Different Colors","titleSlug":"painting-a-grid-with-three-different-colors"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":1932,"title":"Merge BSTs to Create Single BST","titleSlug":"merge-bsts-to-create-single-bst"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":1933,"title":"Check if String Is Decomposable Into Value-Equal Substrings","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"} @@ -2014,7 +2014,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2014,"title":"Longest Subsequence Repeated k Times","titleSlug":"longest-subsequence-repeated-k-times"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2015,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2016,"title":"Maximum Difference Between Increasing Elements","titleSlug":"maximum-difference-between-increasing-elements"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2017,"title":"Grid Game","titleSlug":"grid-game"} +{"dailyChallengeDates":["2025-01-21"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2017,"title":"Grid Game","titleSlug":"grid-game"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2018,"title":"Check if Word Can Be Placed In Crossword","titleSlug":"check-if-word-can-be-placed-in-crossword"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2019,"title":"The Score of Students Solving Math Expression","titleSlug":"the-score-of-students-solving-math-expression"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2020,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"} @@ -2113,7 +2113,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2113,"title":"Elements in Array After Removing and Replacing Elements","titleSlug":"elements-in-array-after-removing-and-replacing-elements"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2114,"title":"Maximum Number of Words Found in Sentences","titleSlug":"maximum-number-of-words-found-in-sentences"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2115,"title":"Find All Possible Recipes from Given Supplies","titleSlug":"find-all-possible-recipes-from-given-supplies"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2116,"title":"Check if a Parentheses String Can Be Valid","titleSlug":"check-if-a-parentheses-string-can-be-valid"} +{"dailyChallengeDates":["2025-01-12"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2116,"title":"Check if a Parentheses String Can Be Valid","titleSlug":"check-if-a-parentheses-string-can-be-valid"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2117,"title":"Abbreviating the Product of a Range","titleSlug":"abbreviating-the-product-of-a-range"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2118,"title":"Build the Equation","titleSlug":"build-the-equation"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2119,"title":"A Number After a Double Reversal","titleSlug":"a-number-after-a-double-reversal"} @@ -2124,7 +2124,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2124,"title":"Check if All A's Appears Before All B's","titleSlug":"check-if-all-as-appears-before-all-bs"} {"dailyChallengeDates":["2024-01-03"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2125,"title":"Number of Laser Beams in a Bank","titleSlug":"number-of-laser-beams-in-a-bank"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2126,"title":"Destroying Asteroids","titleSlug":"destroying-asteroids"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2127,"title":"Maximum Employees to Be Invited to a Meeting","titleSlug":"maximum-employees-to-be-invited-to-a-meeting"} +{"dailyChallengeDates":["2025-01-26"],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2127,"title":"Maximum Employees to Be Invited to a Meeting","titleSlug":"maximum-employees-to-be-invited-to-a-meeting"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2128,"title":"Remove All Ones With Row and Column Flips","titleSlug":"remove-all-ones-with-row-and-column-flips"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2129,"title":"Capitalize the Title","titleSlug":"capitalize-the-title"} {"dailyChallengeDates":["2023-05-17"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2130,"title":"Maximum Twin Sum of a Linked List","titleSlug":"maximum-twin-sum-of-a-linked-list"} @@ -2165,7 +2165,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2165,"title":"Smallest Value of the Rearranged Number","titleSlug":"smallest-value-of-the-rearranged-number"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2166,"title":"Design Bitset","titleSlug":"design-bitset"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2167,"title":"Minimum Time to Remove All Cars Containing Illegal Goods","titleSlug":"minimum-time-to-remove-all-cars-containing-illegal-goods"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2168,"title":"Unique Substrings With Equal Digit Frequency","titleSlug":"unique-substrings-with-equal-digit-frequency"} +{"dailyChallengeDates":[],"weeklyChallengeDates":["2025-01-08"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2168,"title":"Unique Substrings With Equal Digit Frequency","titleSlug":"unique-substrings-with-equal-digit-frequency"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2169,"title":"Count Operations to Obtain Zero","titleSlug":"count-operations-to-obtain-zero"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2170,"title":"Minimum Operations to Make the Array Alternating","titleSlug":"minimum-operations-to-make-the-array-alternating"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2171,"title":"Removing Minimum Number of Magic Beans","titleSlug":"removing-minimum-number-of-magic-beans"} @@ -2182,7 +2182,7 @@ {"dailyChallengeDates":["2024-12-17"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2182,"title":"Construct String With Repeat Limit","titleSlug":"construct-string-with-repeat-limit"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2183,"title":"Count Array Pairs Divisible by K","titleSlug":"count-array-pairs-divisible-by-k"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2184,"title":"Number of Ways to Build Sturdy Brick Wall","titleSlug":"number-of-ways-to-build-sturdy-brick-wall"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2185,"title":"Counting Words With a Given Prefix","titleSlug":"counting-words-with-a-given-prefix"} +{"dailyChallengeDates":["2025-01-09"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2185,"title":"Counting Words With a Given Prefix","titleSlug":"counting-words-with-a-given-prefix"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2186,"title":"Minimum Number of Steps to Make Two Strings Anagram II","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram-ii"} {"dailyChallengeDates":["2023-03-07"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2187,"title":"Minimum Time to Complete Trips","titleSlug":"minimum-time-to-complete-trips"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2188,"title":"Minimum Time to Finish the Race","titleSlug":"minimum-time-to-finish-the-race"} @@ -2267,7 +2267,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2267,"title":"Check if There Is a Valid Parentheses String Path","titleSlug":"check-if-there-is-a-valid-parentheses-string-path"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2268,"title":"Minimum Number of Keypresses","titleSlug":"minimum-number-of-keypresses"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2269,"title":"Find the K-Beauty of a Number","titleSlug":"find-the-k-beauty-of-a-number"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2270,"title":"Number of Ways to Split Array","titleSlug":"number-of-ways-to-split-array"} +{"dailyChallengeDates":["2025-01-03"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2270,"title":"Number of Ways to Split Array","titleSlug":"number-of-ways-to-split-array"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2271,"title":"Maximum White Tiles Covered by a Carpet","titleSlug":"maximum-white-tiles-covered-by-a-carpet"} {"dailyChallengeDates":["2023-07-09"],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2272,"title":"Substring With Largest Variance","titleSlug":"substring-with-largest-variance"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2273,"title":"Find Resultant Array After Removing Anagrams","titleSlug":"find-resultant-array-after-removing-anagrams"} @@ -2378,7 +2378,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2378,"title":"Choose Edges to Maximize Score in a Tree","titleSlug":"choose-edges-to-maximize-score-in-a-tree"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2379,"title":"Minimum Recolors to Get K Consecutive Black Blocks","titleSlug":"minimum-recolors-to-get-k-consecutive-black-blocks"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2380,"title":"Time Needed to Rearrange a Binary String","titleSlug":"time-needed-to-rearrange-a-binary-string"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2381,"title":"Shifting Letters II","titleSlug":"shifting-letters-ii"} +{"dailyChallengeDates":["2025-01-05"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2381,"title":"Shifting Letters II","titleSlug":"shifting-letters-ii"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2382,"title":"Maximum Segment Sum After Removals","titleSlug":"maximum-segment-sum-after-removals"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2383,"title":"Minimum Hours of Training to Win a Competition","titleSlug":"minimum-hours-of-training-to-win-a-competition"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2384,"title":"Largest Palindromic Number","titleSlug":"largest-palindromic-number"} @@ -2422,11 +2422,11 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2422,"title":"Merge Operations to Turn Array Into a Palindrome","titleSlug":"merge-operations-to-turn-array-into-a-palindrome"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2423,"title":"Remove Letter To Equalize Frequency","titleSlug":"remove-letter-to-equalize-frequency"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2424,"title":"Longest Uploaded Prefix","titleSlug":"longest-uploaded-prefix"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2425,"title":"Bitwise XOR of All Pairings","titleSlug":"bitwise-xor-of-all-pairings"} +{"dailyChallengeDates":["2025-01-16"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2425,"title":"Bitwise XOR of All Pairings","titleSlug":"bitwise-xor-of-all-pairings"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2426,"title":"Number of Pairs Satisfying Inequality","titleSlug":"number-of-pairs-satisfying-inequality"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2427,"title":"Number of Common Factors","titleSlug":"number-of-common-factors"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2428,"title":"Maximum Sum of an Hourglass","titleSlug":"maximum-sum-of-an-hourglass"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2429,"title":"Minimize XOR","titleSlug":"minimize-xor"} +{"dailyChallengeDates":["2025-01-15"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2429,"title":"Minimize XOR","titleSlug":"minimize-xor"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2430,"title":"Maximum Deletions on a String","titleSlug":"maximum-deletions-on-a-string"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2431,"title":"Maximize Total Tastiness of Purchased Fruits","titleSlug":"maximize-total-tastiness-of-purchased-fruits"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2432,"title":"The Employee That Worked on the Longest Task","titleSlug":"the-employee-that-worked-on-the-longest-task"} @@ -2490,7 +2490,7 @@ {"dailyChallengeDates":["2024-11-02"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2490,"title":"Circular Sentence","titleSlug":"circular-sentence"} {"dailyChallengeDates":["2024-10-04"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2491,"title":"Divide Players Into Teams of Equal Skill","titleSlug":"divide-players-into-teams-of-equal-skill"} {"dailyChallengeDates":["2023-03-22"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2492,"title":"Minimum Score of a Path Between Two Cities","titleSlug":"minimum-score-of-a-path-between-two-cities"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2493,"title":"Divide Nodes Into the Maximum Number of Groups","titleSlug":"divide-nodes-into-the-maximum-number-of-groups"} +{"dailyChallengeDates":["2025-01-30"],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2493,"title":"Divide Nodes Into the Maximum Number of Groups","titleSlug":"divide-nodes-into-the-maximum-number-of-groups"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":2494,"title":"Merge Overlapping Events in the Same Hall","titleSlug":"merge-overlapping-events-in-the-same-hall"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2495,"title":"Number of Subarrays Having Even Product","titleSlug":"number-of-subarrays-having-even-product"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2496,"title":"Maximum Value of a String in an Array","titleSlug":"maximum-value-of-a-string-in-an-array"} @@ -2556,7 +2556,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2556,"title":"Disconnect Path in a Binary Matrix by at Most One Flip","titleSlug":"disconnect-path-in-a-binary-matrix-by-at-most-one-flip"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2557,"title":"Maximum Number of Integers to Choose From a Range II","titleSlug":"maximum-number-of-integers-to-choose-from-a-range-ii"} {"dailyChallengeDates":["2024-12-12"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2558,"title":"Take Gifts From the Richest Pile","titleSlug":"take-gifts-from-the-richest-pile"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2559,"title":"Count Vowel Strings in Ranges","titleSlug":"count-vowel-strings-in-ranges"} +{"dailyChallengeDates":["2025-01-02"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2559,"title":"Count Vowel Strings in Ranges","titleSlug":"count-vowel-strings-in-ranges"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2560,"title":"House Robber IV","titleSlug":"house-robber-iv"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2561,"title":"Rearranging Fruits","titleSlug":"rearranging-fruits"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2562,"title":"Find the Array Concatenation Value","titleSlug":"find-the-array-concatenation-value"} @@ -2654,11 +2654,11 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2654,"title":"Minimum Number of Operations to Make All Array Elements Equal to 1","titleSlug":"minimum-number-of-operations-to-make-all-array-elements-equal-to-1"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2655,"title":"Find Maximal Uncovered Ranges","titleSlug":"find-maximal-uncovered-ranges"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2656,"title":"Maximum Sum With Exactly K Elements","titleSlug":"maximum-sum-with-exactly-k-elements"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2657,"title":"Find the Prefix Common Array of Two Arrays","titleSlug":"find-the-prefix-common-array-of-two-arrays"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2658,"title":"Maximum Number of Fish in a Grid","titleSlug":"maximum-number-of-fish-in-a-grid"} +{"dailyChallengeDates":["2025-01-14"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2657,"title":"Find the Prefix Common Array of Two Arrays","titleSlug":"find-the-prefix-common-array-of-two-arrays"} +{"dailyChallengeDates":["2025-01-28"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2658,"title":"Maximum Number of Fish in a Grid","titleSlug":"maximum-number-of-fish-in-a-grid"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2659,"title":"Make Array Empty","titleSlug":"make-array-empty"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2660,"title":"Determine the Winner of a Bowling Game","titleSlug":"determine-the-winner-of-a-bowling-game"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2661,"title":"First Completely Painted Row or Column","titleSlug":"first-completely-painted-row-or-column"} +{"dailyChallengeDates":["2025-01-20"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2661,"title":"First Completely Painted Row or Column","titleSlug":"first-completely-painted-row-or-column"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2662,"title":"Minimum Cost of a Path With Special Roads","titleSlug":"minimum-cost-of-a-path-with-special-roads"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2663,"title":"Lexicographically Smallest Beautiful String","titleSlug":"lexicographically-smallest-beautiful-string"} {"dailyChallengeDates":[],"weeklyChallengeDates":["2024-10-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2664,"title":"The Knight’s Tour","titleSlug":"the-knights-tour"} @@ -2680,7 +2680,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2680,"title":"Maximum OR","titleSlug":"maximum-or"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2681,"title":"Power of Heroes","titleSlug":"power-of-heroes"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2682,"title":"Find the Losers of the Circular Game","titleSlug":"find-the-losers-of-the-circular-game"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2683,"title":"Neighboring Bitwise XOR","titleSlug":"neighboring-bitwise-xor"} +{"dailyChallengeDates":["2025-01-17"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2683,"title":"Neighboring Bitwise XOR","titleSlug":"neighboring-bitwise-xor"} {"dailyChallengeDates":["2024-10-29"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2684,"title":"Maximum Number of Moves in a Grid","titleSlug":"maximum-number-of-moves-in-a-grid"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2685,"title":"Count the Number of Complete Components","titleSlug":"count-the-number-of-complete-components"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2686,"title":"Immediate Food Delivery III","titleSlug":"immediate-food-delivery-iii"} @@ -2849,7 +2849,7 @@ {"dailyChallengeDates":["2023-11-08"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2849,"title":"Determine if a Cell Is Reachable at a Given Time","titleSlug":"determine-if-a-cell-is-reachable-at-a-given-time"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2850,"title":"Minimum Moves to Spread Stones Over Grid","titleSlug":"minimum-moves-to-spread-stones-over-grid"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2851,"title":"String Transformation","titleSlug":"string-transformation"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2852,"title":"Sum of Remoteness of All Cells","titleSlug":"sum-of-remoteness-of-all-cells"} +{"dailyChallengeDates":[],"weeklyChallengeDates":["2025-01-22"],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2852,"title":"Sum of Remoteness of All Cells","titleSlug":"sum-of-remoteness-of-all-cells"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":2853,"title":"Highest Salaries Difference","titleSlug":"highest-salaries-difference"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2854,"title":"Rolling Average Steps","titleSlug":"rolling-average-steps"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2855,"title":"Minimum Right Shifts to Sort the Array","titleSlug":"minimum-right-shifts-to-sort-the-array"} @@ -2945,7 +2945,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2945,"title":"Find Maximum Non-decreasing Array Length","titleSlug":"find-maximum-non-decreasing-array-length"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2946,"title":"Matrix Similarity After Cyclic Shifts","titleSlug":"matrix-similarity-after-cyclic-shifts"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2947,"title":"Count Beautiful Substrings I","titleSlug":"count-beautiful-substrings-i"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2948,"title":"Make Lexicographically Smallest Array by Swapping Elements","titleSlug":"make-lexicographically-smallest-array-by-swapping-elements"} +{"dailyChallengeDates":["2025-01-25"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":2948,"title":"Make Lexicographically Smallest Array by Swapping Elements","titleSlug":"make-lexicographically-smallest-array-by-swapping-elements"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":2949,"title":"Count Beautiful Substrings II","titleSlug":"count-beautiful-substrings-ii"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":2950,"title":"Number of Divisible Substrings","titleSlug":"number-of-divisible-substrings"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":2951,"title":"Find the Peaks","titleSlug":"find-the-peaks"} @@ -3039,7 +3039,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3039,"title":"Apply Operations to Make String Empty","titleSlug":"apply-operations-to-make-string-empty"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3040,"title":"Maximum Number of Operations With the Same Score II","titleSlug":"maximum-number-of-operations-with-the-same-score-ii"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3041,"title":"Maximize Consecutive Elements in an Array After Modification","titleSlug":"maximize-consecutive-elements-in-an-array-after-modification"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3042,"title":"Count Prefix and Suffix Pairs I","titleSlug":"count-prefix-and-suffix-pairs-i"} +{"dailyChallengeDates":["2025-01-08"],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3042,"title":"Count Prefix and Suffix Pairs I","titleSlug":"count-prefix-and-suffix-pairs-i"} {"dailyChallengeDates":["2024-09-24"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3043,"title":"Find the Length of the Longest Common Prefix","titleSlug":"find-the-length-of-the-longest-common-prefix"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3044,"title":"Most Frequent Prime","titleSlug":"most-frequent-prime"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3045,"title":"Count Prefix and Suffix Pairs II","titleSlug":"count-prefix-and-suffix-pairs-ii"} @@ -3220,7 +3220,7 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3220,"title":"Odd and Even Transactions","titleSlug":"odd-and-even-transactions"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3221,"title":"Maximum Array Hopping Score II","titleSlug":"maximum-array-hopping-score-ii"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3222,"title":"Find the Winning Player in Coin Game","titleSlug":"find-the-winning-player-in-coin-game"} -{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3223,"title":"Minimum Length of String After Operations","titleSlug":"minimum-length-of-string-after-operations"} +{"dailyChallengeDates":["2025-01-13"],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3223,"title":"Minimum Length of String After Operations","titleSlug":"minimum-length-of-string-after-operations"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3224,"title":"Minimum Array Changes to Make Differences Equal","titleSlug":"minimum-array-changes-to-make-differences-equal"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3225,"title":"Maximum Score From Grid Operations","titleSlug":"maximum-score-from-grid-operations"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3226,"title":"Number of Bit Changes to Make Two Integers Equal","titleSlug":"number-of-bit-changes-to-make-two-integers-equal"} @@ -3371,3 +3371,50 @@ {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3371,"title":"Identify the Largest Outlier in an Array","titleSlug":"identify-the-largest-outlier-in-an-array"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3372,"title":"Maximize the Number of Target Nodes After Connecting Trees I","titleSlug":"maximize-the-number-of-target-nodes-after-connecting-trees-i"} {"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3373,"title":"Maximize the Number of Target Nodes After Connecting Trees II","titleSlug":"maximize-the-number-of-target-nodes-after-connecting-trees-ii"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3374,"title":"First Letter Capitalization II","titleSlug":"first-letter-capitalization-ii"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3375,"title":"Minimum Operations to Make Array Values Equal to K","titleSlug":"minimum-operations-to-make-array-values-equal-to-k"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3376,"title":"Minimum Time to Break Locks I","titleSlug":"minimum-time-to-break-locks-i"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3377,"title":"Digit Operations to Make Two Integers Equal","titleSlug":"digit-operations-to-make-two-integers-equal"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3378,"title":"Count Connected Components in LCM Graph","titleSlug":"count-connected-components-in-lcm-graph"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3379,"title":"Transformed Array","titleSlug":"transformed-array"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3380,"title":"Maximum Area Rectangle With Point Constraints I","titleSlug":"maximum-area-rectangle-with-point-constraints-i"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3381,"title":"Maximum Subarray Sum With Length Divisible by K","titleSlug":"maximum-subarray-sum-with-length-divisible-by-k"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3382,"title":"Maximum Area Rectangle With Point Constraints II","titleSlug":"maximum-area-rectangle-with-point-constraints-ii"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3383,"title":"Minimum Runes to Add to Cast Spell","titleSlug":"minimum-runes-to-add-to-cast-spell"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3384,"title":"Team Dominance by Pass Success","titleSlug":"team-dominance-by-pass-success"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3385,"title":"Minimum Time to Break Locks II","titleSlug":"minimum-time-to-break-locks-ii"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3386,"title":"Button with Longest Push Time","titleSlug":"button-with-longest-push-time"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3387,"title":"Maximize Amount After Two Days of Conversions","titleSlug":"maximize-amount-after-two-days-of-conversions"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3388,"title":"Count Beautiful Splits in an Array","titleSlug":"count-beautiful-splits-in-an-array"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3389,"title":"Minimum Operations to Make Character Frequencies Equal","titleSlug":"minimum-operations-to-make-character-frequencies-equal"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3390,"title":"Longest Team Pass Streak","titleSlug":"longest-team-pass-streak"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3391,"title":"Design a 3D Binary Matrix with Efficient Layer Tracking","titleSlug":"design-a-3d-binary-matrix-with-efficient-layer-tracking"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3392,"title":"Count Subarrays of Length Three With a Condition","titleSlug":"count-subarrays-of-length-three-with-a-condition"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3393,"title":"Count Paths With the Given XOR Value","titleSlug":"count-paths-with-the-given-xor-value"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3394,"title":"Check if Grid can be Cut into Sections","titleSlug":"check-if-grid-can-be-cut-into-sections"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3395,"title":"Subsequences with a Unique Middle Mode I","titleSlug":"subsequences-with-a-unique-middle-mode-i"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3396,"title":"Minimum Number of Operations to Make Elements in Array Distinct","titleSlug":"minimum-number-of-operations-to-make-elements-in-array-distinct"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3397,"title":"Maximum Number of Distinct Elements After Operations","titleSlug":"maximum-number-of-distinct-elements-after-operations"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3398,"title":"Smallest Substring With Identical Characters I","titleSlug":"smallest-substring-with-identical-characters-i"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3399,"title":"Smallest Substring With Identical Characters II","titleSlug":"smallest-substring-with-identical-characters-ii"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":true,"questionFrontendId":3400,"title":"Maximum Number of Matching Indices After Right Shifts","titleSlug":"maximum-number-of-matching-indices-after-right-shifts"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3401,"title":"Find Circular Gift Exchange Chains","titleSlug":"find-circular-gift-exchange-chains"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3402,"title":"Minimum Operations to Make Columns Strictly Increasing","titleSlug":"minimum-operations-to-make-columns-strictly-increasing"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3403,"title":"Find the Lexicographically Largest String From the Box I","titleSlug":"find-the-lexicographically-largest-string-from-the-box-i"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3404,"title":"Count Special Subsequences","titleSlug":"count-special-subsequences"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3405,"title":"Count the Number of Arrays with K Matching Adjacent Elements","titleSlug":"count-the-number-of-arrays-with-k-matching-adjacent-elements"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3406,"title":"Find the Lexicographically Largest String From the Box II","titleSlug":"find-the-lexicographically-largest-string-from-the-box-ii"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3407,"title":"Substring Matching Pattern","titleSlug":"substring-matching-pattern"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3408,"title":"Design Task Manager","titleSlug":"design-task-manager"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3409,"title":"Longest Subsequence With Decreasing Adjacent Difference","titleSlug":"longest-subsequence-with-decreasing-adjacent-difference"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3410,"title":"Maximize Subarray Sum After Removing All Occurrences of One Element","titleSlug":"maximize-subarray-sum-after-removing-all-occurrences-of-one-element"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3411,"title":"Maximum Subarray With Equal Products","titleSlug":"maximum-subarray-with-equal-products"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3412,"title":"Find Mirror Score of a String","titleSlug":"find-mirror-score-of-a-string"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3413,"title":"Maximum Coins From K Consecutive Bags","titleSlug":"maximum-coins-from-k-consecutive-bags"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3414,"title":"Maximum Score of Non-overlapping Intervals","titleSlug":"maximum-score-of-non-overlapping-intervals"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":true,"questionFrontendId":3415,"title":"Find Products with Three Consecutive Digits","titleSlug":"find-products-with-three-consecutive-digits"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":true,"questionFrontendId":3416,"title":"Subsequences with a Unique Middle Mode II","titleSlug":"subsequences-with-a-unique-middle-mode-ii"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Easy","isPaidOnly":false,"questionFrontendId":3417,"title":"Zigzag Grid Traversal With Skip","titleSlug":"zigzag-grid-traversal-with-skip"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3418,"title":"Maximum Amount of Money Robot Can Earn","titleSlug":"maximum-amount-of-money-robot-can-earn"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Medium","isPaidOnly":false,"questionFrontendId":3419,"title":"Minimize the Maximum Edge Weight of Graph","titleSlug":"minimize-the-maximum-edge-weight-of-graph"} +{"dailyChallengeDates":[],"weeklyChallengeDates":[],"difficulty":"Hard","isPaidOnly":false,"questionFrontendId":3420,"title":"Count Non-Decreasing Subarrays After K Operations","titleSlug":"count-non-decreasing-subarrays-after-k-operations"}