{ "by_slug": { "01-matrix": { "question_id": "542", "task_id": "01-matrix", "title": "01 Matrix", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/01-matrix.json", "recommendation_by_id": "/v1/recommendations/by-id/542.json" }, "2-keys-keyboard": { "question_id": "650", "task_id": "2-keys-keyboard", "title": "2 Keys Keyboard", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/2-keys-keyboard.json", "recommendation_by_id": "/v1/recommendations/by-id/650.json" }, "4-keys-keyboard": { "question_id": "651", "task_id": "4-keys-keyboard", "title": "4 Keys Keyboard", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/4-keys-keyboard.json", "recommendation_by_id": "/v1/recommendations/by-id/651.json" }, "airplane-seat-assignment-probability": { "question_id": "1227", "task_id": "airplane-seat-assignment-probability", "title": "Airplane Seat Assignment Probability", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/airplane-seat-assignment-probability.json", "recommendation_by_id": "/v1/recommendations/by-id/1227.json" }, "allocate-mailboxes": { "question_id": "1478", "task_id": "allocate-mailboxes", "title": "Allocate Mailboxes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/allocate-mailboxes.json", "recommendation_by_id": "/v1/recommendations/by-id/1478.json" }, "android-unlock-patterns": { "question_id": "351", "task_id": "android-unlock-patterns", "title": "Android Unlock Patterns", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/android-unlock-patterns.json", "recommendation_by_id": "/v1/recommendations/by-id/351.json" }, "apply-operations-to-make-two-strings-equal": { "question_id": "2896", "task_id": "apply-operations-to-make-two-strings-equal", "title": "Apply Operations To Make Two Strings Equal", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/apply-operations-to-make-two-strings-equal.json", "recommendation_by_id": "/v1/recommendations/by-id/2896.json" }, "arithmetic-slices": { "question_id": "413", "task_id": "arithmetic-slices", "title": "Arithmetic Slices", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/arithmetic-slices.json", "recommendation_by_id": "/v1/recommendations/by-id/413.json" }, "arithmetic-slices-ii-subsequence": { "question_id": "446", "task_id": "arithmetic-slices-ii-subsequence", "title": "Arithmetic Slices Ii Subsequence", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/arithmetic-slices-ii-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/446.json" }, "as-far-from-land-as-possible": { "question_id": "1162", "task_id": "as-far-from-land-as-possible", "title": "As Far From Land As Possible", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/as-far-from-land-as-possible.json", "recommendation_by_id": "/v1/recommendations/by-id/1162.json" }, "beautiful-arrangement": { "question_id": "526", "task_id": "beautiful-arrangement", "title": "Beautiful Arrangement", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/beautiful-arrangement.json", "recommendation_by_id": "/v1/recommendations/by-id/526.json" }, "best-sightseeing-pair": { "question_id": "1014", "task_id": "best-sightseeing-pair", "title": "Best Sightseeing Pair", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/best-sightseeing-pair.json", "recommendation_by_id": "/v1/recommendations/by-id/1014.json" }, "best-team-with-no-conflicts": { "question_id": "1626", "task_id": "best-team-with-no-conflicts", "title": "Best Team With No Conflicts", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/best-team-with-no-conflicts.json", "recommendation_by_id": "/v1/recommendations/by-id/1626.json" }, "best-time-to-buy-and-sell-stock": { "question_id": "121", "task_id": "best-time-to-buy-and-sell-stock", "title": "Best Time To Buy And Sell Stock", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/best-time-to-buy-and-sell-stock.json", "recommendation_by_id": "/v1/recommendations/by-id/121.json" }, "best-time-to-buy-and-sell-stock-ii": { "question_id": "122", "task_id": "best-time-to-buy-and-sell-stock-ii", "title": "Best Time To Buy And Sell Stock Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/best-time-to-buy-and-sell-stock-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/122.json" }, "best-time-to-buy-and-sell-stock-iii": { "question_id": "123", "task_id": "best-time-to-buy-and-sell-stock-iii", "title": "Best Time To Buy And Sell Stock Iii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/best-time-to-buy-and-sell-stock-iii.json", "recommendation_by_id": "/v1/recommendations/by-id/123.json" }, "best-time-to-buy-and-sell-stock-iv": { "question_id": "188", "task_id": "best-time-to-buy-and-sell-stock-iv", "title": "Best Time To Buy And Sell Stock Iv", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/best-time-to-buy-and-sell-stock-iv.json", "recommendation_by_id": "/v1/recommendations/by-id/188.json" }, "best-time-to-buy-and-sell-stock-with-cooldown": { "question_id": "309", "task_id": "best-time-to-buy-and-sell-stock-with-cooldown", "title": "Best Time To Buy And Sell Stock With Cooldown", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/best-time-to-buy-and-sell-stock-with-cooldown.json", "recommendation_by_id": "/v1/recommendations/by-id/309.json" }, "best-time-to-buy-and-sell-stock-with-transaction-fee": { "question_id": "714", "task_id": "best-time-to-buy-and-sell-stock-with-transaction-fee", "title": "Best Time To Buy And Sell Stock With Transaction Fee", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/best-time-to-buy-and-sell-stock-with-transaction-fee.json", "recommendation_by_id": "/v1/recommendations/by-id/714.json" }, "binary-tree-cameras": { "question_id": "968", "task_id": "binary-tree-cameras", "title": "Binary Tree Cameras", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/binary-tree-cameras.json", "recommendation_by_id": "/v1/recommendations/by-id/968.json" }, "binary-tree-maximum-path-sum": { "question_id": "124", "task_id": "binary-tree-maximum-path-sum", "title": "Binary Tree Maximum Path Sum", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/binary-tree-maximum-path-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/124.json" }, "binary-trees-with-factors": { "question_id": "823", "task_id": "binary-trees-with-factors", "title": "Binary Trees With Factors", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/binary-trees-with-factors.json", "recommendation_by_id": "/v1/recommendations/by-id/823.json" }, "bitwise-ors-of-subarrays": { "question_id": "898", "task_id": "bitwise-ors-of-subarrays", "title": "Bitwise Ors Of Subarrays", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/bitwise-ors-of-subarrays.json", "recommendation_by_id": "/v1/recommendations/by-id/898.json" }, "bomb-enemy": { "question_id": "361", "task_id": "bomb-enemy", "title": "Bomb Enemy", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/bomb-enemy.json", "recommendation_by_id": "/v1/recommendations/by-id/361.json" }, "build-array-where-you-can-find-the-maximum-exactly-k-comparisons": { "question_id": "1420", "task_id": "build-array-where-you-can-find-the-maximum-exactly-k-comparisons", "title": "Build Array Where You Can Find The Maximum Exactly K Comparisons", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/build-array-where-you-can-find-the-maximum-exactly-k-comparisons.json", "recommendation_by_id": "/v1/recommendations/by-id/1420.json" }, "burst-balloons": { "question_id": "312", "task_id": "burst-balloons", "title": "Burst Balloons", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/burst-balloons.json", "recommendation_by_id": "/v1/recommendations/by-id/312.json" }, "campus-bikes-ii": { "question_id": "1066", "task_id": "campus-bikes-ii", "title": "Campus Bikes Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/campus-bikes-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1066.json" }, "can-i-win": { "question_id": "464", "task_id": "can-i-win", "title": "Can I Win", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/can-i-win.json", "recommendation_by_id": "/v1/recommendations/by-id/464.json" }, "cat-and-mouse": { "question_id": "913", "task_id": "cat-and-mouse", "title": "Cat And Mouse", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/cat-and-mouse.json", "recommendation_by_id": "/v1/recommendations/by-id/913.json" }, "cat-and-mouse-ii": { "question_id": "1728", "task_id": "cat-and-mouse-ii", "title": "Cat And Mouse Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/cat-and-mouse-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1728.json" }, "champagne-tower": { "question_id": "799", "task_id": "champagne-tower", "title": "Champagne Tower", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/champagne-tower.json", "recommendation_by_id": "/v1/recommendations/by-id/799.json" }, "cheapest-flights-within-k-stops": { "question_id": "787", "task_id": "cheapest-flights-within-k-stops", "title": "Cheapest Flights Within K Stops", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/cheapest-flights-within-k-stops.json", "recommendation_by_id": "/v1/recommendations/by-id/787.json" }, "check-if-an-original-string-exists-given-two-encoded-strings": { "question_id": "2060", "task_id": "check-if-an-original-string-exists-given-two-encoded-strings", "title": "Check If An Original String Exists Given Two Encoded Strings", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/check-if-an-original-string-exists-given-two-encoded-strings.json", "recommendation_by_id": "/v1/recommendations/by-id/2060.json" }, "check-if-it-is-possible-to-split-array": { "question_id": "2811", "task_id": "check-if-it-is-possible-to-split-array", "title": "Check If It Is Possible To Split Array", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/check-if-it-is-possible-to-split-array.json", "recommendation_by_id": "/v1/recommendations/by-id/2811.json" }, "check-if-there-is-a-path-with-equal-number-of-0s-and-1s": { "question_id": "2510", "task_id": "check-if-there-is-a-path-with-equal-number-of-0s-and-1s", "title": "Check If There Is A Path With Equal Number Of 0S And 1S", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/check-if-there-is-a-path-with-equal-number-of-0s-and-1s.json", "recommendation_by_id": "/v1/recommendations/by-id/2510.json" }, "check-if-there-is-a-valid-parentheses-string-path": { "question_id": "2267", "task_id": "check-if-there-is-a-valid-parentheses-string-path", "title": "Check If There Is A Valid Parentheses String Path", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/check-if-there-is-a-valid-parentheses-string-path.json", "recommendation_by_id": "/v1/recommendations/by-id/2267.json" }, "check-if-there-is-a-valid-partition-for-the-array": { "question_id": "2369", "task_id": "check-if-there-is-a-valid-partition-for-the-array", "title": "Check If There Is A Valid Partition For The Array", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/check-if-there-is-a-valid-partition-for-the-array.json", "recommendation_by_id": "/v1/recommendations/by-id/2369.json" }, "cherry-pickup": { "question_id": "741", "task_id": "cherry-pickup", "title": "Cherry Pickup", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/cherry-pickup.json", "recommendation_by_id": "/v1/recommendations/by-id/741.json" }, "cherry-pickup-ii": { "question_id": "1463", "task_id": "cherry-pickup-ii", "title": "Cherry Pickup Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/cherry-pickup-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1463.json" }, "choose-edges-to-maximize-score-in-a-tree": { "question_id": "2378", "task_id": "choose-edges-to-maximize-score-in-a-tree", "title": "Choose Edges To Maximize Score In A Tree", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/choose-edges-to-maximize-score-in-a-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/2378.json" }, "choose-numbers-from-two-arrays-in-range": { "question_id": "2143", "task_id": "choose-numbers-from-two-arrays-in-range", "title": "Choose Numbers From Two Arrays In Range", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/choose-numbers-from-two-arrays-in-range.json", "recommendation_by_id": "/v1/recommendations/by-id/2143.json" }, "climbing-stairs": { "question_id": "70", "task_id": "climbing-stairs", "title": "Climbing Stairs", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/climbing-stairs.json", "recommendation_by_id": "/v1/recommendations/by-id/70.json" }, "closest-dessert-cost": { "question_id": "1774", "task_id": "closest-dessert-cost", "title": "Closest Dessert Cost", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/closest-dessert-cost.json", "recommendation_by_id": "/v1/recommendations/by-id/1774.json" }, "closest-subsequence-sum": { "question_id": "1755", "task_id": "closest-subsequence-sum", "title": "Closest Subsequence Sum", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/closest-subsequence-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1755.json" }, "coin-change": { "question_id": "322", "task_id": "coin-change", "title": "Coin Change", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/coin-change.json", "recommendation_by_id": "/v1/recommendations/by-id/322.json" }, "coin-change-ii": { "question_id": "518", "task_id": "coin-change-ii", "title": "Coin Change Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/coin-change-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/518.json" }, "coin-path": { "question_id": "656", "task_id": "coin-path", "title": "Coin Path", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/coin-path.json", "recommendation_by_id": "/v1/recommendations/by-id/656.json" }, "combination-sum-iv": { "question_id": "377", "task_id": "combination-sum-iv", "title": "Combination Sum Iv", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/combination-sum-iv.json", "recommendation_by_id": "/v1/recommendations/by-id/377.json" }, "concatenated-words": { "question_id": "472", "task_id": "concatenated-words", "title": "Concatenated Words", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/concatenated-words.json", "recommendation_by_id": "/v1/recommendations/by-id/472.json" }, "constrained-subsequence-sum": { "question_id": "1425", "task_id": "constrained-subsequence-sum", "title": "Constrained Subsequence Sum", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/constrained-subsequence-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1425.json" }, "construct-string-with-minimum-cost": { "question_id": "3213", "task_id": "construct-string-with-minimum-cost", "title": "Construct String With Minimum Cost", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/construct-string-with-minimum-cost.json", "recommendation_by_id": "/v1/recommendations/by-id/3213.json" }, "construct-the-longest-new-string": { "question_id": "2745", "task_id": "construct-the-longest-new-string", "title": "Construct The Longest New String", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/construct-the-longest-new-string.json", "recommendation_by_id": "/v1/recommendations/by-id/2745.json" }, "count-all-possible-routes": { "question_id": "1575", "task_id": "count-all-possible-routes", "title": "Count All Possible Routes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-all-possible-routes.json", "recommendation_by_id": "/v1/recommendations/by-id/1575.json" }, "count-all-valid-pickup-and-delivery-options": { "question_id": "1359", "task_id": "count-all-valid-pickup-and-delivery-options", "title": "Count All Valid Pickup And Delivery Options", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-all-valid-pickup-and-delivery-options.json", "recommendation_by_id": "/v1/recommendations/by-id/1359.json" }, "count-different-palindromic-subsequences": { "question_id": "730", "task_id": "count-different-palindromic-subsequences", "title": "Count Different Palindromic Subsequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-different-palindromic-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/730.json" }, "count-fertile-pyramids-in-a-land": { "question_id": "2088", "task_id": "count-fertile-pyramids-in-a-land", "title": "Count Fertile Pyramids In A Land", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-fertile-pyramids-in-a-land.json", "recommendation_by_id": "/v1/recommendations/by-id/2088.json" }, "count-increasing-quadruplets": { "question_id": "2552", "task_id": "count-increasing-quadruplets", "title": "Count Increasing Quadruplets", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-increasing-quadruplets.json", "recommendation_by_id": "/v1/recommendations/by-id/2552.json" }, "count-number-of-possible-root-nodes": { "question_id": "2581", "task_id": "count-number-of-possible-root-nodes", "title": "Count Number Of Possible Root Nodes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-number-of-possible-root-nodes.json", "recommendation_by_id": "/v1/recommendations/by-id/2581.json" }, "count-number-of-special-subsequences": { "question_id": "1955", "task_id": "count-number-of-special-subsequences", "title": "Count Number Of Special Subsequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-number-of-special-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/1955.json" }, "count-number-of-teams": { "question_id": "1395", "task_id": "count-number-of-teams", "title": "Count Number Of Teams", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-number-of-teams.json", "recommendation_by_id": "/v1/recommendations/by-id/1395.json" }, "count-number-of-texts": { "question_id": "2266", "task_id": "count-number-of-texts", "title": "Count Number Of Texts", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-number-of-texts.json", "recommendation_by_id": "/v1/recommendations/by-id/2266.json" }, "count-number-of-ways-to-place-houses": { "question_id": "2320", "task_id": "count-number-of-ways-to-place-houses", "title": "Count Number Of Ways To Place Houses", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-number-of-ways-to-place-houses.json", "recommendation_by_id": "/v1/recommendations/by-id/2320.json" }, "count-numbers-with-unique-digits": { "question_id": "357", "task_id": "count-numbers-with-unique-digits", "title": "Count Numbers With Unique Digits", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-numbers-with-unique-digits.json", "recommendation_by_id": "/v1/recommendations/by-id/357.json" }, "count-numbers-with-unique-digits-ii": { "question_id": "3032", "task_id": "count-numbers-with-unique-digits-ii", "title": "Count Numbers With Unique Digits Ii", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/count-numbers-with-unique-digits-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/3032.json" }, "count-of-integers": { "question_id": "2719", "task_id": "count-of-integers", "title": "Count Of Integers", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-of-integers.json", "recommendation_by_id": "/v1/recommendations/by-id/2719.json" }, "count-of-sub-multisets-with-bounded-sum": { "question_id": "2902", "task_id": "count-of-sub-multisets-with-bounded-sum", "title": "Count Of Sub Multisets With Bounded Sum", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-of-sub-multisets-with-bounded-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/2902.json" }, "count-palindromic-subsequences": { "question_id": "2484", "task_id": "count-palindromic-subsequences", "title": "Count Palindromic Subsequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-palindromic-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/2484.json" }, "count-paths-that-can-form-a-palindrome-in-a-tree": { "question_id": "2791", "task_id": "count-paths-that-can-form-a-palindrome-in-a-tree", "title": "Count Paths That Can Form A Palindrome In A Tree", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-paths-that-can-form-a-palindrome-in-a-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/2791.json" }, "count-sorted-vowel-strings": { "question_id": "1641", "task_id": "count-sorted-vowel-strings", "title": "Count Sorted Vowel Strings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-sorted-vowel-strings.json", "recommendation_by_id": "/v1/recommendations/by-id/1641.json" }, "count-special-integers": { "question_id": "2376", "task_id": "count-special-integers", "title": "Count Special Integers", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-special-integers.json", "recommendation_by_id": "/v1/recommendations/by-id/2376.json" }, "count-square-submatrices-with-all-ones": { "question_id": "1277", "task_id": "count-square-submatrices-with-all-ones", "title": "Count Square Submatrices With All Ones", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-square-submatrices-with-all-ones.json", "recommendation_by_id": "/v1/recommendations/by-id/1277.json" }, "count-stepping-numbers-in-range": { "question_id": "2801", "task_id": "count-stepping-numbers-in-range", "title": "Count Stepping Numbers In Range", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-stepping-numbers-in-range.json", "recommendation_by_id": "/v1/recommendations/by-id/2801.json" }, "count-strictly-increasing-subarrays": { "question_id": "2393", "task_id": "count-strictly-increasing-subarrays", "title": "Count Strictly Increasing Subarrays", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-strictly-increasing-subarrays.json", "recommendation_by_id": "/v1/recommendations/by-id/2393.json" }, "count-submatrices-with-all-ones": { "question_id": "1504", "task_id": "count-submatrices-with-all-ones", "title": "Count Submatrices With All Ones", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-submatrices-with-all-ones.json", "recommendation_by_id": "/v1/recommendations/by-id/1504.json" }, "count-substrings-that-differ-by-one-character": { "question_id": "1638", "task_id": "count-substrings-that-differ-by-one-character", "title": "Count Substrings That Differ By One Character", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-substrings-that-differ-by-one-character.json", "recommendation_by_id": "/v1/recommendations/by-id/1638.json" }, "count-subtrees-with-max-distance-between-cities": { "question_id": "1617", "task_id": "count-subtrees-with-max-distance-between-cities", "title": "Count Subtrees With Max Distance Between Cities", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-subtrees-with-max-distance-between-cities.json", "recommendation_by_id": "/v1/recommendations/by-id/1617.json" }, "count-the-number-of-ideal-arrays": { "question_id": "2338", "task_id": "count-the-number-of-ideal-arrays", "title": "Count The Number Of Ideal Arrays", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-the-number-of-ideal-arrays.json", "recommendation_by_id": "/v1/recommendations/by-id/2338.json" }, "count-the-number-of-inversions": { "question_id": "3193", "task_id": "count-the-number-of-inversions", "title": "Count The Number Of Inversions", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-the-number-of-inversions.json", "recommendation_by_id": "/v1/recommendations/by-id/3193.json" }, "count-the-number-of-k-free-subsets": { "question_id": "2638", "task_id": "count-the-number-of-k-free-subsets", "title": "Count The Number Of K Free Subsets", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-the-number-of-k-free-subsets.json", "recommendation_by_id": "/v1/recommendations/by-id/2638.json" }, "count-the-number-of-powerful-integers": { "question_id": "2999", "task_id": "count-the-number-of-powerful-integers", "title": "Count The Number Of Powerful Integers", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-the-number-of-powerful-integers.json", "recommendation_by_id": "/v1/recommendations/by-id/2999.json" }, "count-the-number-of-square-free-subsets": { "question_id": "2572", "task_id": "count-the-number-of-square-free-subsets", "title": "Count The Number Of Square Free Subsets", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-the-number-of-square-free-subsets.json", "recommendation_by_id": "/v1/recommendations/by-id/2572.json" }, "count-the-repetitions": { "question_id": "466", "task_id": "count-the-repetitions", "title": "Count The Repetitions", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-the-repetitions.json", "recommendation_by_id": "/v1/recommendations/by-id/466.json" }, "count-unique-characters-of-all-substrings-of-a-given-string": { "question_id": "828", "task_id": "count-unique-characters-of-all-substrings-of-a-given-string", "title": "Count Unique Characters Of All Substrings Of A Given String", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-unique-characters-of-all-substrings-of-a-given-string.json", "recommendation_by_id": "/v1/recommendations/by-id/828.json" }, "count-valid-paths-in-a-tree": { "question_id": "2867", "task_id": "count-valid-paths-in-a-tree", "title": "Count Valid Paths In A Tree", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-valid-paths-in-a-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/2867.json" }, "count-visited-nodes-in-a-directed-graph": { "question_id": "2876", "task_id": "count-visited-nodes-in-a-directed-graph", "title": "Count Visited Nodes In A Directed Graph", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-visited-nodes-in-a-directed-graph.json", "recommendation_by_id": "/v1/recommendations/by-id/2876.json" }, "count-vowels-permutation": { "question_id": "1220", "task_id": "count-vowels-permutation", "title": "Count Vowels Permutation", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-vowels-permutation.json", "recommendation_by_id": "/v1/recommendations/by-id/1220.json" }, "count-ways-to-build-good-strings": { "question_id": "2466", "task_id": "count-ways-to-build-good-strings", "title": "Count Ways To Build Good Strings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-ways-to-build-good-strings.json", "recommendation_by_id": "/v1/recommendations/by-id/2466.json" }, "count-ways-to-build-rooms-in-an-ant-colony": { "question_id": "1916", "task_id": "count-ways-to-build-rooms-in-an-ant-colony", "title": "Count Ways To Build Rooms In An Ant Colony", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-ways-to-build-rooms-in-an-ant-colony.json", "recommendation_by_id": "/v1/recommendations/by-id/1916.json" }, "count-ways-to-distribute-candies": { "question_id": "1692", "task_id": "count-ways-to-distribute-candies", "title": "Count Ways To Distribute Candies", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-ways-to-distribute-candies.json", "recommendation_by_id": "/v1/recommendations/by-id/1692.json" }, "counting-bits": { "question_id": "338", "task_id": "counting-bits", "title": "Counting Bits", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/counting-bits.json", "recommendation_by_id": "/v1/recommendations/by-id/338.json" }, "decode-ways": { "question_id": "91", "task_id": "decode-ways", "title": "Decode Ways", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/decode-ways.json", "recommendation_by_id": "/v1/recommendations/by-id/91.json" }, "decode-ways-ii": { "question_id": "639", "task_id": "decode-ways-ii", "title": "Decode Ways Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/decode-ways-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/639.json" }, "decremental-string-concatenation": { "question_id": "2746", "task_id": "decremental-string-concatenation", "title": "Decremental String Concatenation", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/decremental-string-concatenation.json", "recommendation_by_id": "/v1/recommendations/by-id/2746.json" }, "delete-and-earn": { "question_id": "740", "task_id": "delete-and-earn", "title": "Delete And Earn", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/delete-and-earn.json", "recommendation_by_id": "/v1/recommendations/by-id/740.json" }, "delete-columns-to-make-sorted-iii": { "question_id": "960", "task_id": "delete-columns-to-make-sorted-iii", "title": "Delete Columns To Make Sorted Iii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/delete-columns-to-make-sorted-iii.json", "recommendation_by_id": "/v1/recommendations/by-id/960.json" }, "delete-operation-for-two-strings": { "question_id": "583", "task_id": "delete-operation-for-two-strings", "title": "Delete Operation For Two Strings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/delete-operation-for-two-strings.json", "recommendation_by_id": "/v1/recommendations/by-id/583.json" }, "delivering-boxes-from-storage-to-ports": { "question_id": "1687", "task_id": "delivering-boxes-from-storage-to-ports", "title": "Delivering Boxes From Storage To Ports", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/delivering-boxes-from-storage-to-ports.json", "recommendation_by_id": "/v1/recommendations/by-id/1687.json" }, "dice-roll-simulation": { "question_id": "1223", "task_id": "dice-roll-simulation", "title": "Dice Roll Simulation", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/dice-roll-simulation.json", "recommendation_by_id": "/v1/recommendations/by-id/1223.json" }, "difference-between-maximum-and-minimum-price-sum": { "question_id": "2538", "task_id": "difference-between-maximum-and-minimum-price-sum", "title": "Difference Between Maximum And Minimum Price Sum", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/difference-between-maximum-and-minimum-price-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/2538.json" }, "different-ways-to-add-parentheses": { "question_id": "241", "task_id": "different-ways-to-add-parentheses", "title": "Different Ways To Add Parentheses", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/different-ways-to-add-parentheses.json", "recommendation_by_id": "/v1/recommendations/by-id/241.json" }, "digit-count-in-range": { "question_id": "1067", "task_id": "digit-count-in-range", "title": "Digit Count In Range", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/digit-count-in-range.json", "recommendation_by_id": "/v1/recommendations/by-id/1067.json" }, "disconnect-path-in-a-binary-matrix-by-at-most-one-flip": { "question_id": "2556", "task_id": "disconnect-path-in-a-binary-matrix-by-at-most-one-flip", "title": "Disconnect Path In A Binary Matrix By At Most One Flip", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/disconnect-path-in-a-binary-matrix-by-at-most-one-flip.json", "recommendation_by_id": "/v1/recommendations/by-id/2556.json" }, "distinct-subsequences": { "question_id": "115", "task_id": "distinct-subsequences", "title": "Distinct Subsequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/distinct-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/115.json" }, "distinct-subsequences-ii": { "question_id": "940", "task_id": "distinct-subsequences-ii", "title": "Distinct Subsequences Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/distinct-subsequences-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/940.json" }, "distribute-repeating-integers": { "question_id": "1655", "task_id": "distribute-repeating-integers", "title": "Distribute Repeating Integers", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/distribute-repeating-integers.json", "recommendation_by_id": "/v1/recommendations/by-id/1655.json" }, "divisor-game": { "question_id": "1025", "task_id": "divisor-game", "title": "Divisor Game", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/divisor-game.json", "recommendation_by_id": "/v1/recommendations/by-id/1025.json" }, "domino-and-tromino-tiling": { "question_id": "790", "task_id": "domino-and-tromino-tiling", "title": "Domino And Tromino Tiling", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/domino-and-tromino-tiling.json", "recommendation_by_id": "/v1/recommendations/by-id/790.json" }, "dungeon-game": { "question_id": "174", "task_id": "dungeon-game", "title": "Dungeon Game", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/dungeon-game.json", "recommendation_by_id": "/v1/recommendations/by-id/174.json" }, "edit-distance": { "question_id": "72", "task_id": "edit-distance", "title": "Edit Distance", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/edit-distance.json", "recommendation_by_id": "/v1/recommendations/by-id/72.json" }, "egg-drop-with-2-eggs-and-n-floors": { "question_id": "1884", "task_id": "egg-drop-with-2-eggs-and-n-floors", "title": "Egg Drop With 2 Eggs And N Floors", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/egg-drop-with-2-eggs-and-n-floors.json", "recommendation_by_id": "/v1/recommendations/by-id/1884.json" }, "encode-string-with-shortest-length": { "question_id": "471", "task_id": "encode-string-with-shortest-length", "title": "Encode String With Shortest Length", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/encode-string-with-shortest-length.json", "recommendation_by_id": "/v1/recommendations/by-id/471.json" }, "equalize-strings-by-adding-or-removing-characters-at-ends": { "question_id": "3135", "task_id": "equalize-strings-by-adding-or-removing-characters-at-ends", "title": "Equalize Strings By Adding Or Removing Characters At Ends", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/equalize-strings-by-adding-or-removing-characters-at-ends.json", "recommendation_by_id": "/v1/recommendations/by-id/3135.json" }, "extra-characters-in-a-string": { "question_id": "2707", "task_id": "extra-characters-in-a-string", "title": "Extra Characters In A String", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/extra-characters-in-a-string.json", "recommendation_by_id": "/v1/recommendations/by-id/2707.json" }, "fair-distribution-of-cookies": { "question_id": "2305", "task_id": "fair-distribution-of-cookies", "title": "Fair Distribution Of Cookies", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/fair-distribution-of-cookies.json", "recommendation_by_id": "/v1/recommendations/by-id/2305.json" }, "fibonacci-number": { "question_id": "509", "task_id": "fibonacci-number", "title": "Fibonacci Number", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/fibonacci-number.json", "recommendation_by_id": "/v1/recommendations/by-id/509.json" }, "filling-bookcase-shelves": { "question_id": "1105", "task_id": "filling-bookcase-shelves", "title": "Filling Bookcase Shelves", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/filling-bookcase-shelves.json", "recommendation_by_id": "/v1/recommendations/by-id/1105.json" }, "find-all-good-indices": { "question_id": "2420", "task_id": "find-all-good-indices", "title": "Find All Good Indices", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-all-good-indices.json", "recommendation_by_id": "/v1/recommendations/by-id/2420.json" }, "find-all-good-strings": { "question_id": "1397", "task_id": "find-all-good-strings", "title": "Find All Good Strings", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-all-good-strings.json", "recommendation_by_id": "/v1/recommendations/by-id/1397.json" }, "find-all-possible-stable-binary-arrays-i": { "question_id": "3129", "task_id": "find-all-possible-stable-binary-arrays-i", "title": "Find All Possible Stable Binary Arrays I", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-all-possible-stable-binary-arrays-i.json", "recommendation_by_id": "/v1/recommendations/by-id/3129.json" }, "find-all-possible-stable-binary-arrays-ii": { "question_id": "3130", "task_id": "find-all-possible-stable-binary-arrays-ii", "title": "Find All Possible Stable Binary Arrays Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-all-possible-stable-binary-arrays-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/3130.json" }, "find-good-days-to-rob-the-bank": { "question_id": "2100", "task_id": "find-good-days-to-rob-the-bank", "title": "Find Good Days To Rob The Bank", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-good-days-to-rob-the-bank.json", "recommendation_by_id": "/v1/recommendations/by-id/2100.json" }, "find-maximum-non-decreasing-array-length": { "question_id": "2945", "task_id": "find-maximum-non-decreasing-array-length", "title": "Find Maximum Non Decreasing Array Length", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-maximum-non-decreasing-array-length.json", "recommendation_by_id": "/v1/recommendations/by-id/2945.json" }, "find-minimum-time-to-finish-all-jobs": { "question_id": "1723", "task_id": "find-minimum-time-to-finish-all-jobs", "title": "Find Minimum Time To Finish All Jobs", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-minimum-time-to-finish-all-jobs.json", "recommendation_by_id": "/v1/recommendations/by-id/1723.json" }, "find-number-of-coins-to-place-in-tree-nodes": { "question_id": "2973", "task_id": "find-number-of-coins-to-place-in-tree-nodes", "title": "Find Number Of Coins To Place In Tree Nodes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-number-of-coins-to-place-in-tree-nodes.json", "recommendation_by_id": "/v1/recommendations/by-id/2973.json" }, "find-number-of-ways-to-reach-the-k-th-stair": { "question_id": "3154", "task_id": "find-number-of-ways-to-reach-the-k-th-stair", "title": "Find Number Of Ways To Reach The K Th Stair", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-number-of-ways-to-reach-the-k-th-stair.json", "recommendation_by_id": "/v1/recommendations/by-id/3154.json" }, "find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance": { "question_id": "1334", "task_id": "find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance", "title": "Find The City With The Smallest Number Of Neighbors At A Threshold Distance", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.json", "recommendation_by_id": "/v1/recommendations/by-id/1334.json" }, "find-the-derangement-of-an-array": { "question_id": "634", "task_id": "find-the-derangement-of-an-array", "title": "Find The Derangement Of An Array", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-derangement-of-an-array.json", "recommendation_by_id": "/v1/recommendations/by-id/634.json" }, "find-the-maximum-length-of-a-good-subsequence-i": { "question_id": "3176", "task_id": "find-the-maximum-length-of-a-good-subsequence-i", "title": "Find The Maximum Length Of A Good Subsequence I", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-maximum-length-of-a-good-subsequence-i.json", "recommendation_by_id": "/v1/recommendations/by-id/3176.json" }, "find-the-maximum-length-of-a-good-subsequence-ii": { "question_id": "3177", "task_id": "find-the-maximum-length-of-a-good-subsequence-ii", "title": "Find The Maximum Length Of A Good Subsequence Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-maximum-length-of-a-good-subsequence-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/3177.json" }, "find-the-maximum-length-of-valid-subsequence-i": { "question_id": "3201", "task_id": "find-the-maximum-length-of-valid-subsequence-i", "title": "Find The Maximum Length Of Valid Subsequence I", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-maximum-length-of-valid-subsequence-i.json", "recommendation_by_id": "/v1/recommendations/by-id/3201.json" }, "find-the-maximum-length-of-valid-subsequence-ii": { "question_id": "3202", "task_id": "find-the-maximum-length-of-valid-subsequence-ii", "title": "Find The Maximum Length Of Valid Subsequence Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-maximum-length-of-valid-subsequence-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/3202.json" }, "find-the-maximum-sum-of-node-values": { "question_id": "3068", "task_id": "find-the-maximum-sum-of-node-values", "title": "Find The Maximum Sum Of Node Values", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-maximum-sum-of-node-values.json", "recommendation_by_id": "/v1/recommendations/by-id/3068.json" }, "find-the-minimum-cost-array-permutation": { "question_id": "3149", "task_id": "find-the-minimum-cost-array-permutation", "title": "Find The Minimum Cost Array Permutation", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-minimum-cost-array-permutation.json", "recommendation_by_id": "/v1/recommendations/by-id/3149.json" }, "find-the-shortest-superstring": { "question_id": "943", "task_id": "find-the-shortest-superstring", "title": "Find The Shortest Superstring", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-shortest-superstring.json", "recommendation_by_id": "/v1/recommendations/by-id/943.json" }, "find-the-string-with-lcp": { "question_id": "2573", "task_id": "find-the-string-with-lcp", "title": "Find The String With Lcp", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-string-with-lcp.json", "recommendation_by_id": "/v1/recommendations/by-id/2573.json" }, "find-the-substring-with-maximum-cost": { "question_id": "2606", "task_id": "find-the-substring-with-maximum-cost", "title": "Find The Substring With Maximum Cost", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-substring-with-maximum-cost.json", "recommendation_by_id": "/v1/recommendations/by-id/2606.json" }, "find-the-sum-of-subsequence-powers": { "question_id": "3098", "task_id": "find-the-sum-of-subsequence-powers", "title": "Find The Sum Of Subsequence Powers", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-sum-of-subsequence-powers.json", "recommendation_by_id": "/v1/recommendations/by-id/3098.json" }, "find-the-sum-of-the-power-of-all-subsequences": { "question_id": "3082", "task_id": "find-the-sum-of-the-power-of-all-subsequences", "title": "Find The Sum Of The Power Of All Subsequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-sum-of-the-power-of-all-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/3082.json" }, "find-two-non-overlapping-sub-arrays-each-with-target-sum": { "question_id": "1477", "task_id": "find-two-non-overlapping-sub-arrays-each-with-target-sum", "title": "Find Two Non Overlapping Sub Arrays Each With Target Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-two-non-overlapping-sub-arrays-each-with-target-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1477.json" }, "first-day-where-you-have-been-in-all-the-rooms": { "question_id": "1997", "task_id": "first-day-where-you-have-been-in-all-the-rooms", "title": "First Day Where You Have Been In All The Rooms", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/first-day-where-you-have-been-in-all-the-rooms.json", "recommendation_by_id": "/v1/recommendations/by-id/1997.json" }, "flip-game-ii": { "question_id": "294", "task_id": "flip-game-ii", "title": "Flip Game Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/flip-game-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/294.json" }, "flip-string-to-monotone-increasing": { "question_id": "926", "task_id": "flip-string-to-monotone-increasing", "title": "Flip String To Monotone Increasing", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/flip-string-to-monotone-increasing.json", "recommendation_by_id": "/v1/recommendations/by-id/926.json" }, "form-largest-integer-with-digits-that-add-up-to-target": { "question_id": "1449", "task_id": "form-largest-integer-with-digits-that-add-up-to-target", "title": "Form Largest Integer With Digits That Add Up To Target", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/form-largest-integer-with-digits-that-add-up-to-target.json", "recommendation_by_id": "/v1/recommendations/by-id/1449.json" }, "freedom-trail": { "question_id": "514", "task_id": "freedom-trail", "title": "Freedom Trail", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/freedom-trail.json", "recommendation_by_id": "/v1/recommendations/by-id/514.json" }, "frog-jump": { "question_id": "403", "task_id": "frog-jump", "title": "Frog Jump", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/frog-jump.json", "recommendation_by_id": "/v1/recommendations/by-id/403.json" }, "game-of-nim": { "question_id": "1908", "task_id": "game-of-nim", "title": "Game Of Nim", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/game-of-nim.json", "recommendation_by_id": "/v1/recommendations/by-id/1908.json" }, "generate-parentheses": { "question_id": "22", "task_id": "generate-parentheses", "title": "Generate Parentheses", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/generate-parentheses.json", "recommendation_by_id": "/v1/recommendations/by-id/22.json" }, "get-the-maximum-score": { "question_id": "1537", "task_id": "get-the-maximum-score", "title": "Get The Maximum Score", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/get-the-maximum-score.json", "recommendation_by_id": "/v1/recommendations/by-id/1537.json" }, "greatest-sum-divisible-by-three": { "question_id": "1262", "task_id": "greatest-sum-divisible-by-three", "title": "Greatest Sum Divisible By Three", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/greatest-sum-divisible-by-three.json", "recommendation_by_id": "/v1/recommendations/by-id/1262.json" }, "guess-number-higher-or-lower-ii": { "question_id": "375", "task_id": "guess-number-higher-or-lower-ii", "title": "Guess Number Higher Or Lower Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/guess-number-higher-or-lower-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/375.json" }, "handshakes-that-dont-cross": { "question_id": "1259", "task_id": "handshakes-that-dont-cross", "title": "Handshakes That Dont Cross", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/handshakes-that-dont-cross.json", "recommendation_by_id": "/v1/recommendations/by-id/1259.json" }, "house-robber": { "question_id": "198", "task_id": "house-robber", "title": "House Robber", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/house-robber.json", "recommendation_by_id": "/v1/recommendations/by-id/198.json" }, "house-robber-ii": { "question_id": "213", "task_id": "house-robber-ii", "title": "House Robber Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/house-robber-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/213.json" }, "house-robber-iii": { "question_id": "337", "task_id": "house-robber-iii", "title": "House Robber Iii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/house-robber-iii.json", "recommendation_by_id": "/v1/recommendations/by-id/337.json" }, "integer-break": { "question_id": "343", "task_id": "integer-break", "title": "Integer Break", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/integer-break.json", "recommendation_by_id": "/v1/recommendations/by-id/343.json" }, "integer-replacement": { "question_id": "397", "task_id": "integer-replacement", "title": "Integer Replacement", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/integer-replacement.json", "recommendation_by_id": "/v1/recommendations/by-id/397.json" }, "interleaving-string": { "question_id": "97", "task_id": "interleaving-string", "title": "Interleaving String", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/interleaving-string.json", "recommendation_by_id": "/v1/recommendations/by-id/97.json" }, "is-subsequence": { "question_id": "392", "task_id": "is-subsequence", "title": "Is Subsequence", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/is-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/392.json" }, "jump-game": { "question_id": "55", "task_id": "jump-game", "title": "Jump Game", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/jump-game.json", "recommendation_by_id": "/v1/recommendations/by-id/55.json" }, "jump-game-ii": { "question_id": "45", "task_id": "jump-game-ii", "title": "Jump Game Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/jump-game-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/45.json" }, "jump-game-v": { "question_id": "1340", "task_id": "jump-game-v", "title": "Jump Game V", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/jump-game-v.json", "recommendation_by_id": "/v1/recommendations/by-id/1340.json" }, "jump-game-vi": { "question_id": "1696", "task_id": "jump-game-vi", "title": "Jump Game Vi", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/jump-game-vi.json", "recommendation_by_id": "/v1/recommendations/by-id/1696.json" }, "jump-game-vii": { "question_id": "1871", "task_id": "jump-game-vii", "title": "Jump Game Vii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/jump-game-vii.json", "recommendation_by_id": "/v1/recommendations/by-id/1871.json" }, "jump-game-viii": { "question_id": "2297", "task_id": "jump-game-viii", "title": "Jump Game Viii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/jump-game-viii.json", "recommendation_by_id": "/v1/recommendations/by-id/2297.json" }, "k-concatenation-maximum-sum": { "question_id": "1191", "task_id": "k-concatenation-maximum-sum", "title": "K Concatenation Maximum Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/k-concatenation-maximum-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1191.json" }, "k-inverse-pairs-array": { "question_id": "629", "task_id": "k-inverse-pairs-array", "title": "K Inverse Pairs Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/k-inverse-pairs-array.json", "recommendation_by_id": "/v1/recommendations/by-id/629.json" }, "knight-dialer": { "question_id": "935", "task_id": "knight-dialer", "title": "Knight Dialer", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/knight-dialer.json", "recommendation_by_id": "/v1/recommendations/by-id/935.json" }, "knight-probability-in-chessboard": { "question_id": "688", "task_id": "knight-probability-in-chessboard", "title": "Knight Probability In Chessboard", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/knight-probability-in-chessboard.json", "recommendation_by_id": "/v1/recommendations/by-id/688.json" }, "kth-smallest-instructions": { "question_id": "1643", "task_id": "kth-smallest-instructions", "title": "Kth Smallest Instructions", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/kth-smallest-instructions.json", "recommendation_by_id": "/v1/recommendations/by-id/1643.json" }, "largest-1-bordered-square": { "question_id": "1139", "task_id": "largest-1-bordered-square", "title": "Largest 1 Bordered Square", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/largest-1-bordered-square.json", "recommendation_by_id": "/v1/recommendations/by-id/1139.json" }, "largest-bst-subtree": { "question_id": "333", "task_id": "largest-bst-subtree", "title": "Largest Bst Subtree", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/largest-bst-subtree.json", "recommendation_by_id": "/v1/recommendations/by-id/333.json" }, "largest-color-value-in-a-directed-graph": { "question_id": "1857", "task_id": "largest-color-value-in-a-directed-graph", "title": "Largest Color Value In A Directed Graph", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/largest-color-value-in-a-directed-graph.json", "recommendation_by_id": "/v1/recommendations/by-id/1857.json" }, "largest-divisible-subset": { "question_id": "368", "task_id": "largest-divisible-subset", "title": "Largest Divisible Subset", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/largest-divisible-subset.json", "recommendation_by_id": "/v1/recommendations/by-id/368.json" }, "largest-multiple-of-three": { "question_id": "1363", "task_id": "largest-multiple-of-three", "title": "Largest Multiple Of Three", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/largest-multiple-of-three.json", "recommendation_by_id": "/v1/recommendations/by-id/1363.json" }, "largest-plus-sign": { "question_id": "764", "task_id": "largest-plus-sign", "title": "Largest Plus Sign", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/largest-plus-sign.json", "recommendation_by_id": "/v1/recommendations/by-id/764.json" }, "largest-sum-of-averages": { "question_id": "813", "task_id": "largest-sum-of-averages", "title": "Largest Sum Of Averages", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/largest-sum-of-averages.json", "recommendation_by_id": "/v1/recommendations/by-id/813.json" }, "last-stone-weight-ii": { "question_id": "1049", "task_id": "last-stone-weight-ii", "title": "Last Stone Weight Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/last-stone-weight-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1049.json" }, "least-operators-to-express-number": { "question_id": "964", "task_id": "least-operators-to-express-number", "title": "Least Operators To Express Number", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/least-operators-to-express-number.json", "recommendation_by_id": "/v1/recommendations/by-id/964.json" }, "length-of-longest-fibonacci-subsequence": { "question_id": "873", "task_id": "length-of-longest-fibonacci-subsequence", "title": "Length Of Longest Fibonacci Subsequence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/length-of-longest-fibonacci-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/873.json" }, "length-of-the-longest-subsequence-that-sums-to-target": { "question_id": "2915", "task_id": "length-of-the-longest-subsequence-that-sums-to-target", "title": "Length Of The Longest Subsequence That Sums To Target", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/length-of-the-longest-subsequence-that-sums-to-target.json", "recommendation_by_id": "/v1/recommendations/by-id/2915.json" }, "longest-arithmetic-subsequence": { "question_id": "1027", "task_id": "longest-arithmetic-subsequence", "title": "Longest Arithmetic Subsequence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-arithmetic-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/1027.json" }, "longest-arithmetic-subsequence-of-given-difference": { "question_id": "1218", "task_id": "longest-arithmetic-subsequence-of-given-difference", "title": "Longest Arithmetic Subsequence Of Given Difference", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-arithmetic-subsequence-of-given-difference.json", "recommendation_by_id": "/v1/recommendations/by-id/1218.json" }, "longest-binary-subsequence-less-than-or-equal-to-k": { "question_id": "2311", "task_id": "longest-binary-subsequence-less-than-or-equal-to-k", "title": "Longest Binary Subsequence Less Than Or Equal To K", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-binary-subsequence-less-than-or-equal-to-k.json", "recommendation_by_id": "/v1/recommendations/by-id/2311.json" }, "longest-chunked-palindrome-decomposition": { "question_id": "1147", "task_id": "longest-chunked-palindrome-decomposition", "title": "Longest Chunked Palindrome Decomposition", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-chunked-palindrome-decomposition.json", "recommendation_by_id": "/v1/recommendations/by-id/1147.json" }, "longest-common-subsequence": { "question_id": "1143", "task_id": "longest-common-subsequence", "title": "Longest Common Subsequence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-common-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/1143.json" }, "longest-ideal-subsequence": { "question_id": "2370", "task_id": "longest-ideal-subsequence", "title": "Longest Ideal Subsequence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-ideal-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/2370.json" }, "longest-increasing-path-in-a-matrix": { "question_id": "329", "task_id": "longest-increasing-path-in-a-matrix", "title": "Longest Increasing Path In A Matrix", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-increasing-path-in-a-matrix.json", "recommendation_by_id": "/v1/recommendations/by-id/329.json" }, "longest-increasing-subsequence": { "question_id": "300", "task_id": "longest-increasing-subsequence", "title": "Longest Increasing Subsequence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-increasing-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/300.json" }, "longest-increasing-subsequence-ii": { "question_id": "2407", "task_id": "longest-increasing-subsequence-ii", "title": "Longest Increasing Subsequence Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-increasing-subsequence-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/2407.json" }, "longest-line-of-consecutive-one-in-matrix": { "question_id": "562", "task_id": "longest-line-of-consecutive-one-in-matrix", "title": "Longest Line Of Consecutive One In Matrix", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-line-of-consecutive-one-in-matrix.json", "recommendation_by_id": "/v1/recommendations/by-id/562.json" }, "longest-mountain-in-array": { "question_id": "845", "task_id": "longest-mountain-in-array", "title": "Longest Mountain In Array", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-mountain-in-array.json", "recommendation_by_id": "/v1/recommendations/by-id/845.json" }, "longest-non-decreasing-subarray-from-two-arrays": { "question_id": "2771", "task_id": "longest-non-decreasing-subarray-from-two-arrays", "title": "Longest Non Decreasing Subarray From Two Arrays", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-non-decreasing-subarray-from-two-arrays.json", "recommendation_by_id": "/v1/recommendations/by-id/2771.json" }, "longest-palindromic-subsequence": { "question_id": "516", "task_id": "longest-palindromic-subsequence", "title": "Longest Palindromic Subsequence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-palindromic-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/516.json" }, "longest-palindromic-subsequence-ii": { "question_id": "1682", "task_id": "longest-palindromic-subsequence-ii", "title": "Longest Palindromic Subsequence Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-palindromic-subsequence-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1682.json" }, "longest-palindromic-substring": { "question_id": "5", "task_id": "longest-palindromic-substring", "title": "Longest Palindromic Substring", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-palindromic-substring.json", "recommendation_by_id": "/v1/recommendations/by-id/5.json" }, "longest-repeating-substring": { "question_id": "1062", "task_id": "longest-repeating-substring", "title": "Longest Repeating Substring", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-repeating-substring.json", "recommendation_by_id": "/v1/recommendations/by-id/1062.json" }, "longest-square-streak-in-an-array": { "question_id": "2501", "task_id": "longest-square-streak-in-an-array", "title": "Longest Square Streak In An Array", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-square-streak-in-an-array.json", "recommendation_by_id": "/v1/recommendations/by-id/2501.json" }, "longest-string-chain": { "question_id": "1048", "task_id": "longest-string-chain", "title": "Longest String Chain", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-string-chain.json", "recommendation_by_id": "/v1/recommendations/by-id/1048.json" }, "longest-subarray-of-1s-after-deleting-one-element": { "question_id": "1493", "task_id": "longest-subarray-of-1s-after-deleting-one-element", "title": "Longest Subarray Of 1S After Deleting One Element", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-subarray-of-1s-after-deleting-one-element.json", "recommendation_by_id": "/v1/recommendations/by-id/1493.json" }, "longest-unequal-adjacent-groups-subsequence-i": { "question_id": "2900", "task_id": "longest-unequal-adjacent-groups-subsequence-i", "title": "Longest Unequal Adjacent Groups Subsequence I", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-unequal-adjacent-groups-subsequence-i.json", "recommendation_by_id": "/v1/recommendations/by-id/2900.json" }, "longest-unequal-adjacent-groups-subsequence-ii": { "question_id": "2901", "task_id": "longest-unequal-adjacent-groups-subsequence-ii", "title": "Longest Unequal Adjacent Groups Subsequence Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-unequal-adjacent-groups-subsequence-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/2901.json" }, "longest-valid-parentheses": { "question_id": "32", "task_id": "longest-valid-parentheses", "title": "Longest Valid Parentheses", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-valid-parentheses.json", "recommendation_by_id": "/v1/recommendations/by-id/32.json" }, "longest-zigzag-path-in-a-binary-tree": { "question_id": "1372", "task_id": "longest-zigzag-path-in-a-binary-tree", "title": "Longest Zigzag Path In A Binary Tree", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-zigzag-path-in-a-binary-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/1372.json" }, "make-array-non-decreasing-or-non-increasing": { "question_id": "2263", "task_id": "make-array-non-decreasing-or-non-increasing", "title": "Make Array Non Decreasing Or Non Increasing", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/make-array-non-decreasing-or-non-increasing.json", "recommendation_by_id": "/v1/recommendations/by-id/2263.json" }, "make-array-strictly-increasing": { "question_id": "1187", "task_id": "make-array-strictly-increasing", "title": "Make Array Strictly Increasing", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/make-array-strictly-increasing.json", "recommendation_by_id": "/v1/recommendations/by-id/1187.json" }, "make-costs-of-paths-equal-in-a-binary-tree": { "question_id": "2673", "task_id": "make-costs-of-paths-equal-in-a-binary-tree", "title": "Make Costs Of Paths Equal In A Binary Tree", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/make-costs-of-paths-equal-in-a-binary-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/2673.json" }, "make-the-xor-of-all-segments-equal-to-zero": { "question_id": "1787", "task_id": "make-the-xor-of-all-segments-equal-to-zero", "title": "Make The Xor Of All Segments Equal To Zero", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/make-the-xor-of-all-segments-equal-to-zero.json", "recommendation_by_id": "/v1/recommendations/by-id/1787.json" }, "matchsticks-to-square": { "question_id": "473", "task_id": "matchsticks-to-square", "title": "Matchsticks To Square", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/matchsticks-to-square.json", "recommendation_by_id": "/v1/recommendations/by-id/473.json" }, "max-consecutive-ones-ii": { "question_id": "487", "task_id": "max-consecutive-ones-ii", "title": "Max Consecutive Ones Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/max-consecutive-ones-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/487.json" }, "max-dot-product-of-two-subsequences": { "question_id": "1458", "task_id": "max-dot-product-of-two-subsequences", "title": "Max Dot Product Of Two Subsequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/max-dot-product-of-two-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/1458.json" }, "maximal-rectangle": { "question_id": "85", "task_id": "maximal-rectangle", "title": "Maximal Rectangle", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximal-rectangle.json", "recommendation_by_id": "/v1/recommendations/by-id/85.json" }, "maximal-square": { "question_id": "221", "task_id": "maximal-square", "title": "Maximal Square", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximal-square.json", "recommendation_by_id": "/v1/recommendations/by-id/221.json" }, "maximize-consecutive-elements-in-an-array-after-modification": { "question_id": "3041", "task_id": "maximize-consecutive-elements-in-an-array-after-modification", "title": "Maximize Consecutive Elements In An Array After Modification", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximize-consecutive-elements-in-an-array-after-modification.json", "recommendation_by_id": "/v1/recommendations/by-id/3041.json" }, "maximize-grid-happiness": { "question_id": "1659", "task_id": "maximize-grid-happiness", "title": "Maximize Grid Happiness", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximize-grid-happiness.json", "recommendation_by_id": "/v1/recommendations/by-id/1659.json" }, "maximize-palindrome-length-from-subsequences": { "question_id": "1771", "task_id": "maximize-palindrome-length-from-subsequences", "title": "Maximize Palindrome Length From Subsequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximize-palindrome-length-from-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/1771.json" }, "maximize-the-number-of-partitions-after-operations": { "question_id": "3003", "task_id": "maximize-the-number-of-partitions-after-operations", "title": "Maximize The Number Of Partitions After Operations", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximize-the-number-of-partitions-after-operations.json", "recommendation_by_id": "/v1/recommendations/by-id/3003.json" }, "maximize-the-profit-as-the-salesman": { "question_id": "2830", "task_id": "maximize-the-profit-as-the-salesman", "title": "Maximize The Profit As The Salesman", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximize-the-profit-as-the-salesman.json", "recommendation_by_id": "/v1/recommendations/by-id/2830.json" }, "maximize-total-cost-of-alternating-subarrays": { "question_id": "3196", "task_id": "maximize-total-cost-of-alternating-subarrays", "title": "Maximize Total Cost Of Alternating Subarrays", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximize-total-cost-of-alternating-subarrays.json", "recommendation_by_id": "/v1/recommendations/by-id/3196.json" }, "maximize-total-tastiness-of-purchased-fruits": { "question_id": "2431", "task_id": "maximize-total-tastiness-of-purchased-fruits", "title": "Maximize Total Tastiness Of Purchased Fruits", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximize-total-tastiness-of-purchased-fruits.json", "recommendation_by_id": "/v1/recommendations/by-id/2431.json" }, "maximize-value-of-function-in-a-ball-passing-game": { "question_id": "2836", "task_id": "maximize-value-of-function-in-a-ball-passing-game", "title": "Maximize Value Of Function In A Ball Passing Game", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximize-value-of-function-in-a-ball-passing-game.json", "recommendation_by_id": "/v1/recommendations/by-id/2836.json" }, "maximum-absolute-sum-of-any-subarray": { "question_id": "1749", "task_id": "maximum-absolute-sum-of-any-subarray", "title": "Maximum Absolute Sum Of Any Subarray", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-absolute-sum-of-any-subarray.json", "recommendation_by_id": "/v1/recommendations/by-id/1749.json" }, "maximum-alternating-subarray-sum": { "question_id": "2036", "task_id": "maximum-alternating-subarray-sum", "title": "Maximum Alternating Subarray Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-alternating-subarray-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/2036.json" }, "maximum-alternating-subsequence-sum": { "question_id": "1911", "task_id": "maximum-alternating-subsequence-sum", "title": "Maximum Alternating Subsequence Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-alternating-subsequence-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1911.json" }, "maximum-and-sum-of-array": { "question_id": "2172", "task_id": "maximum-and-sum-of-array", "title": "Maximum And Sum Of Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-and-sum-of-array.json", "recommendation_by_id": "/v1/recommendations/by-id/2172.json" }, "maximum-array-hopping-score-i": { "question_id": "3205", "task_id": "maximum-array-hopping-score-i", "title": "Maximum Array Hopping Score I", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-array-hopping-score-i.json", "recommendation_by_id": "/v1/recommendations/by-id/3205.json" }, "maximum-balanced-subsequence-sum": { "question_id": "2926", "task_id": "maximum-balanced-subsequence-sum", "title": "Maximum Balanced Subsequence Sum", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-balanced-subsequence-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/2926.json" }, "maximum-compatibility-score-sum": { "question_id": "1947", "task_id": "maximum-compatibility-score-sum", "title": "Maximum Compatibility Score Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-compatibility-score-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1947.json" }, "maximum-cost-of-trip-with-k-highways": { "question_id": "2247", "task_id": "maximum-cost-of-trip-with-k-highways", "title": "Maximum Cost Of Trip With K Highways", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-cost-of-trip-with-k-highways.json", "recommendation_by_id": "/v1/recommendations/by-id/2247.json" }, "maximum-deletions-on-a-string": { "question_id": "2430", "task_id": "maximum-deletions-on-a-string", "title": "Maximum Deletions On A String", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-deletions-on-a-string.json", "recommendation_by_id": "/v1/recommendations/by-id/2430.json" }, "maximum-difference-score-in-a-grid": { "question_id": "3148", "task_id": "maximum-difference-score-in-a-grid", "title": "Maximum Difference Score In A Grid", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-difference-score-in-a-grid.json", "recommendation_by_id": "/v1/recommendations/by-id/3148.json" }, "maximum-earnings-from-taxi": { "question_id": "2008", "task_id": "maximum-earnings-from-taxi", "title": "Maximum Earnings From Taxi", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-earnings-from-taxi.json", "recommendation_by_id": "/v1/recommendations/by-id/2008.json" }, "maximum-height-by-stacking-cuboids": { "question_id": "1691", "task_id": "maximum-height-by-stacking-cuboids", "title": "Maximum Height By Stacking Cuboids", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-height-by-stacking-cuboids.json", "recommendation_by_id": "/v1/recommendations/by-id/1691.json" }, "maximum-length-of-pair-chain": { "question_id": "646", "task_id": "maximum-length-of-pair-chain", "title": "Maximum Length Of Pair Chain", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-length-of-pair-chain.json", "recommendation_by_id": "/v1/recommendations/by-id/646.json" }, "maximum-length-of-repeated-subarray": { "question_id": "718", "task_id": "maximum-length-of-repeated-subarray", "title": "Maximum Length Of Repeated Subarray", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-length-of-repeated-subarray.json", "recommendation_by_id": "/v1/recommendations/by-id/718.json" }, "maximum-length-of-subarray-with-positive-product": { "question_id": "1567", "task_id": "maximum-length-of-subarray-with-positive-product", "title": "Maximum Length Of Subarray With Positive Product", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-length-of-subarray-with-positive-product.json", "recommendation_by_id": "/v1/recommendations/by-id/1567.json" }, "maximum-non-negative-product-in-a-matrix": { "question_id": "1594", "task_id": "maximum-non-negative-product-in-a-matrix", "title": "Maximum Non Negative Product In A Matrix", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-non-negative-product-in-a-matrix.json", "recommendation_by_id": "/v1/recommendations/by-id/1594.json" }, "maximum-number-of-books-you-can-take": { "question_id": "2355", "task_id": "maximum-number-of-books-you-can-take", "title": "Maximum Number Of Books You Can Take", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-books-you-can-take.json", "recommendation_by_id": "/v1/recommendations/by-id/2355.json" }, "maximum-number-of-events-that-can-be-attended-ii": { "question_id": "1751", "task_id": "maximum-number-of-events-that-can-be-attended-ii", "title": "Maximum Number Of Events That Can Be Attended Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-events-that-can-be-attended-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1751.json" }, "maximum-number-of-groups-getting-fresh-donuts": { "question_id": "1815", "task_id": "maximum-number-of-groups-getting-fresh-donuts", "title": "Maximum Number Of Groups Getting Fresh Donuts", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-groups-getting-fresh-donuts.json", "recommendation_by_id": "/v1/recommendations/by-id/1815.json" }, "maximum-number-of-jumps-to-reach-the-last-index": { "question_id": "2770", "task_id": "maximum-number-of-jumps-to-reach-the-last-index", "title": "Maximum Number Of Jumps To Reach The Last Index", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-jumps-to-reach-the-last-index.json", "recommendation_by_id": "/v1/recommendations/by-id/2770.json" }, "maximum-number-of-moves-in-a-grid": { "question_id": "2684", "task_id": "maximum-number-of-moves-in-a-grid", "title": "Maximum Number Of Moves In A Grid", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-moves-in-a-grid.json", "recommendation_by_id": "/v1/recommendations/by-id/2684.json" }, "maximum-number-of-non-overlapping-palindrome-substrings": { "question_id": "2472", "task_id": "maximum-number-of-non-overlapping-palindrome-substrings", "title": "Maximum Number Of Non Overlapping Palindrome Substrings", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-non-overlapping-palindrome-substrings.json", "recommendation_by_id": "/v1/recommendations/by-id/2472.json" }, "maximum-number-of-operations-with-the-same-score-ii": { "question_id": "3040", "task_id": "maximum-number-of-operations-with-the-same-score-ii", "title": "Maximum Number Of Operations With The Same Score Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-operations-with-the-same-score-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/3040.json" }, "maximum-number-of-points-with-cost": { "question_id": "1937", "task_id": "maximum-number-of-points-with-cost", "title": "Maximum Number Of Points With Cost", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-points-with-cost.json", "recommendation_by_id": "/v1/recommendations/by-id/1937.json" }, "maximum-number-of-removal-queries-that-can-be-processed-i": { "question_id": "3018", "task_id": "maximum-number-of-removal-queries-that-can-be-processed-i", "title": "Maximum Number Of Removal Queries That Can Be Processed I", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-removal-queries-that-can-be-processed-i.json", "recommendation_by_id": "/v1/recommendations/by-id/3018.json" }, "maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k": { "question_id": "3007", "task_id": "maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k", "title": "Maximum Number That Sum Of The Prices Is Less Than Or Equal To K", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k.json", "recommendation_by_id": "/v1/recommendations/by-id/3007.json" }, "maximum-points-after-collecting-coins-from-all-nodes": { "question_id": "2920", "task_id": "maximum-points-after-collecting-coins-from-all-nodes", "title": "Maximum Points After Collecting Coins From All Nodes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-points-after-collecting-coins-from-all-nodes.json", "recommendation_by_id": "/v1/recommendations/by-id/2920.json" }, "maximum-product-of-the-length-of-two-palindromic-subsequences": { "question_id": "2002", "task_id": "maximum-product-of-the-length-of-two-palindromic-subsequences", "title": "Maximum Product Of The Length Of Two Palindromic Subsequences", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-product-of-the-length-of-two-palindromic-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/2002.json" }, "maximum-product-subarray": { "question_id": "152", "task_id": "maximum-product-subarray", "title": "Maximum Product Subarray", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-product-subarray.json", "recommendation_by_id": "/v1/recommendations/by-id/152.json" }, "maximum-profit-from-trading-stocks": { "question_id": "2291", "task_id": "maximum-profit-from-trading-stocks", "title": "Maximum Profit From Trading Stocks", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-profit-from-trading-stocks.json", "recommendation_by_id": "/v1/recommendations/by-id/2291.json" }, "maximum-repeating-substring": { "question_id": "1668", "task_id": "maximum-repeating-substring", "title": "Maximum Repeating Substring", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-repeating-substring.json", "recommendation_by_id": "/v1/recommendations/by-id/1668.json" }, "maximum-score-after-applying-operations-on-a-tree": { "question_id": "2925", "task_id": "maximum-score-after-applying-operations-on-a-tree", "title": "Maximum Score After Applying Operations On A Tree", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-score-after-applying-operations-on-a-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/2925.json" }, "maximum-score-from-grid-operations": { "question_id": "3225", "task_id": "maximum-score-from-grid-operations", "title": "Maximum Score From Grid Operations", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-score-from-grid-operations.json", "recommendation_by_id": "/v1/recommendations/by-id/3225.json" }, "maximum-score-from-performing-multiplication-operations": { "question_id": "1770", "task_id": "maximum-score-from-performing-multiplication-operations", "title": "Maximum Score From Performing Multiplication Operations", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-score-from-performing-multiplication-operations.json", "recommendation_by_id": "/v1/recommendations/by-id/1770.json" }, "maximum-score-of-spliced-array": { "question_id": "2321", "task_id": "maximum-score-of-spliced-array", "title": "Maximum Score Of Spliced Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-score-of-spliced-array.json", "recommendation_by_id": "/v1/recommendations/by-id/2321.json" }, "maximum-score-words-formed-by-letters": { "question_id": "1255", "task_id": "maximum-score-words-formed-by-letters", "title": "Maximum Score Words Formed By Letters", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-score-words-formed-by-letters.json", "recommendation_by_id": "/v1/recommendations/by-id/1255.json" }, "maximum-strength-of-a-group": { "question_id": "2708", "task_id": "maximum-strength-of-a-group", "title": "Maximum Strength Of A Group", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-strength-of-a-group.json", "recommendation_by_id": "/v1/recommendations/by-id/2708.json" }, "maximum-strength-of-k-disjoint-subarrays": { "question_id": "3077", "task_id": "maximum-strength-of-k-disjoint-subarrays", "title": "Maximum Strength Of K Disjoint Subarrays", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-strength-of-k-disjoint-subarrays.json", "recommendation_by_id": "/v1/recommendations/by-id/3077.json" }, "maximum-strictly-increasing-cells-in-a-matrix": { "question_id": "2713", "task_id": "maximum-strictly-increasing-cells-in-a-matrix", "title": "Maximum Strictly Increasing Cells In A Matrix", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-strictly-increasing-cells-in-a-matrix.json", "recommendation_by_id": "/v1/recommendations/by-id/2713.json" }, "maximum-students-taking-exam": { "question_id": "1349", "task_id": "maximum-students-taking-exam", "title": "Maximum Students Taking Exam", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-students-taking-exam.json", "recommendation_by_id": "/v1/recommendations/by-id/1349.json" }, "maximum-subarray": { "question_id": "53", "task_id": "maximum-subarray", "title": "Maximum Subarray", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-subarray.json", "recommendation_by_id": "/v1/recommendations/by-id/53.json" }, "maximum-subarray-sum-after-one-operation": { "question_id": "1746", "task_id": "maximum-subarray-sum-after-one-operation", "title": "Maximum Subarray Sum After One Operation", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-subarray-sum-after-one-operation.json", "recommendation_by_id": "/v1/recommendations/by-id/1746.json" }, "maximum-subarray-sum-with-one-deletion": { "question_id": "1186", "task_id": "maximum-subarray-sum-with-one-deletion", "title": "Maximum Subarray Sum With One Deletion", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-subarray-sum-with-one-deletion.json", "recommendation_by_id": "/v1/recommendations/by-id/1186.json" }, "maximum-subtree-of-the-same-color": { "question_id": "3004", "task_id": "maximum-subtree-of-the-same-color", "title": "Maximum Subtree Of The Same Color", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-subtree-of-the-same-color.json", "recommendation_by_id": "/v1/recommendations/by-id/3004.json" }, "maximum-sum-bst-in-binary-tree": { "question_id": "1373", "task_id": "maximum-sum-bst-in-binary-tree", "title": "Maximum Sum Bst In Binary Tree", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-sum-bst-in-binary-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/1373.json" }, "maximum-sum-circular-subarray": { "question_id": "918", "task_id": "maximum-sum-circular-subarray", "title": "Maximum Sum Circular Subarray", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-sum-circular-subarray.json", "recommendation_by_id": "/v1/recommendations/by-id/918.json" }, "maximum-sum-of-3-non-overlapping-subarrays": { "question_id": "689", "task_id": "maximum-sum-of-3-non-overlapping-subarrays", "title": "Maximum Sum Of 3 Non Overlapping Subarrays", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-sum-of-3-non-overlapping-subarrays.json", "recommendation_by_id": "/v1/recommendations/by-id/689.json" }, "maximum-sum-of-subsequence-with-non-adjacent-elements": { "question_id": "3165", "task_id": "maximum-sum-of-subsequence-with-non-adjacent-elements", "title": "Maximum Sum Of Subsequence With Non Adjacent Elements", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-sum-of-subsequence-with-non-adjacent-elements.json", "recommendation_by_id": "/v1/recommendations/by-id/3165.json" }, "maximum-sum-of-two-non-overlapping-subarrays": { "question_id": "1031", "task_id": "maximum-sum-of-two-non-overlapping-subarrays", "title": "Maximum Sum Of Two Non Overlapping Subarrays", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-sum-of-two-non-overlapping-subarrays.json", "recommendation_by_id": "/v1/recommendations/by-id/1031.json" }, "maximum-total-damage-with-spell-casting": { "question_id": "3186", "task_id": "maximum-total-damage-with-spell-casting", "title": "Maximum Total Damage With Spell Casting", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-total-damage-with-spell-casting.json", "recommendation_by_id": "/v1/recommendations/by-id/3186.json" }, "maximum-total-reward-using-operations-i": { "question_id": "3180", "task_id": "maximum-total-reward-using-operations-i", "title": "Maximum Total Reward Using Operations I", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-total-reward-using-operations-i.json", "recommendation_by_id": "/v1/recommendations/by-id/3180.json" }, "maximum-total-reward-using-operations-ii": { "question_id": "3181", "task_id": "maximum-total-reward-using-operations-ii", "title": "Maximum Total Reward Using Operations Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-total-reward-using-operations-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/3181.json" }, "maximum-vacation-days": { "question_id": "568", "task_id": "maximum-vacation-days", "title": "Maximum Vacation Days", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-vacation-days.json", "recommendation_by_id": "/v1/recommendations/by-id/568.json" }, "maximum-value-of-k-coins-from-piles": { "question_id": "2218", "task_id": "maximum-value-of-k-coins-from-piles", "title": "Maximum Value Of K Coins From Piles", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-value-of-k-coins-from-piles.json", "recommendation_by_id": "/v1/recommendations/by-id/2218.json" }, "min-cost-climbing-stairs": { "question_id": "746", "task_id": "min-cost-climbing-stairs", "title": "Min Cost Climbing Stairs", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/min-cost-climbing-stairs.json", "recommendation_by_id": "/v1/recommendations/by-id/746.json" }, "minimize-maximum-of-array": { "question_id": "2439", "task_id": "minimize-maximum-of-array", "title": "Minimize Maximum Of Array", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimize-maximum-of-array.json", "recommendation_by_id": "/v1/recommendations/by-id/2439.json" }, "minimize-the-difference-between-target-and-chosen-elements": { "question_id": "1981", "task_id": "minimize-the-difference-between-target-and-chosen-elements", "title": "Minimize The Difference Between Target And Chosen Elements", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimize-the-difference-between-target-and-chosen-elements.json", "recommendation_by_id": "/v1/recommendations/by-id/1981.json" }, "minimize-the-total-price-of-the-trips": { "question_id": "2646", "task_id": "minimize-the-total-price-of-the-trips", "title": "Minimize The Total Price Of The Trips", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimize-the-total-price-of-the-trips.json", "recommendation_by_id": "/v1/recommendations/by-id/2646.json" }, "minimizing-array-after-replacing-pairs-with-their-product": { "question_id": "2892", "task_id": "minimizing-array-after-replacing-pairs-with-their-product", "title": "Minimizing Array After Replacing Pairs With Their Product", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimizing-array-after-replacing-pairs-with-their-product.json", "recommendation_by_id": "/v1/recommendations/by-id/2892.json" }, "minimum-additions-to-make-valid-string": { "question_id": "2645", "task_id": "minimum-additions-to-make-valid-string", "title": "Minimum Additions To Make Valid String", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-additions-to-make-valid-string.json", "recommendation_by_id": "/v1/recommendations/by-id/2645.json" }, "minimum-ascii-delete-sum-for-two-strings": { "question_id": "712", "task_id": "minimum-ascii-delete-sum-for-two-strings", "title": "Minimum Ascii Delete Sum For Two Strings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-ascii-delete-sum-for-two-strings.json", "recommendation_by_id": "/v1/recommendations/by-id/712.json" }, "minimum-changes-to-make-k-semi-palindromes": { "question_id": "2911", "task_id": "minimum-changes-to-make-k-semi-palindromes", "title": "Minimum Changes To Make K Semi Palindromes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-changes-to-make-k-semi-palindromes.json", "recommendation_by_id": "/v1/recommendations/by-id/2911.json" }, "minimum-cost-for-cutting-cake-i": { "question_id": "3218", "task_id": "minimum-cost-for-cutting-cake-i", "title": "Minimum Cost For Cutting Cake I", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-for-cutting-cake-i.json", "recommendation_by_id": "/v1/recommendations/by-id/3218.json" }, "minimum-cost-for-tickets": { "question_id": "983", "task_id": "minimum-cost-for-tickets", "title": "Minimum Cost For Tickets", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-for-tickets.json", "recommendation_by_id": "/v1/recommendations/by-id/983.json" }, "minimum-cost-to-change-the-final-value-of-expression": { "question_id": "1896", "task_id": "minimum-cost-to-change-the-final-value-of-expression", "title": "Minimum Cost To Change The Final Value Of Expression", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-change-the-final-value-of-expression.json", "recommendation_by_id": "/v1/recommendations/by-id/1896.json" }, "minimum-cost-to-connect-two-groups-of-points": { "question_id": "1595", "task_id": "minimum-cost-to-connect-two-groups-of-points", "title": "Minimum Cost To Connect Two Groups Of Points", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-connect-two-groups-of-points.json", "recommendation_by_id": "/v1/recommendations/by-id/1595.json" }, "minimum-cost-to-convert-string-ii": { "question_id": "2977", "task_id": "minimum-cost-to-convert-string-ii", "title": "Minimum Cost To Convert String Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-convert-string-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/2977.json" }, "minimum-cost-to-cut-a-stick": { "question_id": "1547", "task_id": "minimum-cost-to-cut-a-stick", "title": "Minimum Cost To Cut A Stick", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-cut-a-stick.json", "recommendation_by_id": "/v1/recommendations/by-id/1547.json" }, "minimum-cost-to-make-all-characters-equal": { "question_id": "2712", "task_id": "minimum-cost-to-make-all-characters-equal", "title": "Minimum Cost To Make All Characters Equal", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-make-all-characters-equal.json", "recommendation_by_id": "/v1/recommendations/by-id/2712.json" }, "minimum-cost-to-merge-stones": { "question_id": "1000", "task_id": "minimum-cost-to-merge-stones", "title": "Minimum Cost To Merge Stones", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-merge-stones.json", "recommendation_by_id": "/v1/recommendations/by-id/1000.json" }, "minimum-cost-to-reach-destination-in-time": { "question_id": "1928", "task_id": "minimum-cost-to-reach-destination-in-time", "title": "Minimum Cost To Reach Destination In Time", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-reach-destination-in-time.json", "recommendation_by_id": "/v1/recommendations/by-id/1928.json" }, "minimum-cost-to-separate-sentence-into-rows": { "question_id": "2052", "task_id": "minimum-cost-to-separate-sentence-into-rows", "title": "Minimum Cost To Separate Sentence Into Rows", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-separate-sentence-into-rows.json", "recommendation_by_id": "/v1/recommendations/by-id/2052.json" }, "minimum-cost-to-split-an-array": { "question_id": "2547", "task_id": "minimum-cost-to-split-an-array", "title": "Minimum Cost To Split An Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-split-an-array.json", "recommendation_by_id": "/v1/recommendations/by-id/2547.json" }, "minimum-cost-tree-from-leaf-values": { "question_id": "1130", "task_id": "minimum-cost-tree-from-leaf-values", "title": "Minimum Cost Tree From Leaf Values", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-tree-from-leaf-values.json", "recommendation_by_id": "/v1/recommendations/by-id/1130.json" }, "minimum-costs-using-the-train-line": { "question_id": "2361", "task_id": "minimum-costs-using-the-train-line", "title": "Minimum Costs Using The Train Line", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-costs-using-the-train-line.json", "recommendation_by_id": "/v1/recommendations/by-id/2361.json" }, "minimum-deletions-to-make-string-balanced": { "question_id": "1653", "task_id": "minimum-deletions-to-make-string-balanced", "title": "Minimum Deletions To Make String Balanced", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-deletions-to-make-string-balanced.json", "recommendation_by_id": "/v1/recommendations/by-id/1653.json" }, "minimum-difference-in-sums-after-removal-of-elements": { "question_id": "2163", "task_id": "minimum-difference-in-sums-after-removal-of-elements", "title": "Minimum Difference In Sums After Removal Of Elements", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-difference-in-sums-after-removal-of-elements.json", "recommendation_by_id": "/v1/recommendations/by-id/2163.json" }, "minimum-difficulty-of-a-job-schedule": { "question_id": "1335", "task_id": "minimum-difficulty-of-a-job-schedule", "title": "Minimum Difficulty Of A Job Schedule", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-difficulty-of-a-job-schedule.json", "recommendation_by_id": "/v1/recommendations/by-id/1335.json" }, "minimum-distance-to-type-a-word-using-two-fingers": { "question_id": "1320", "task_id": "minimum-distance-to-type-a-word-using-two-fingers", "title": "Minimum Distance To Type A Word Using Two Fingers", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-distance-to-type-a-word-using-two-fingers.json", "recommendation_by_id": "/v1/recommendations/by-id/1320.json" }, "minimum-edge-reversals-so-every-node-is-reachable": { "question_id": "2858", "task_id": "minimum-edge-reversals-so-every-node-is-reachable", "title": "Minimum Edge Reversals So Every Node Is Reachable", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-edge-reversals-so-every-node-is-reachable.json", "recommendation_by_id": "/v1/recommendations/by-id/2858.json" }, "minimum-falling-path-sum": { "question_id": "931", "task_id": "minimum-falling-path-sum", "title": "Minimum Falling Path Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-falling-path-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/931.json" }, "minimum-falling-path-sum-ii": { "question_id": "1289", "task_id": "minimum-falling-path-sum-ii", "title": "Minimum Falling Path Sum Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-falling-path-sum-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1289.json" }, "minimum-incompatibility": { "question_id": "1681", "task_id": "minimum-incompatibility", "title": "Minimum Incompatibility", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-incompatibility.json", "recommendation_by_id": "/v1/recommendations/by-id/1681.json" }, "minimum-increment-operations-to-make-array-beautiful": { "question_id": "2919", "task_id": "minimum-increment-operations-to-make-array-beautiful", "title": "Minimum Increment Operations To Make Array Beautiful", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-increment-operations-to-make-array-beautiful.json", "recommendation_by_id": "/v1/recommendations/by-id/2919.json" }, "minimum-insertion-steps-to-make-a-string-palindrome": { "question_id": "1312", "task_id": "minimum-insertion-steps-to-make-a-string-palindrome", "title": "Minimum Insertion Steps To Make A String Palindrome", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-insertion-steps-to-make-a-string-palindrome.json", "recommendation_by_id": "/v1/recommendations/by-id/1312.json" }, "minimum-jumps-to-reach-home": { "question_id": "1654", "task_id": "minimum-jumps-to-reach-home", "title": "Minimum Jumps To Reach Home", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-jumps-to-reach-home.json", "recommendation_by_id": "/v1/recommendations/by-id/1654.json" }, "minimum-moves-to-spread-stones-over-grid": { "question_id": "2850", "task_id": "minimum-moves-to-spread-stones-over-grid", "title": "Minimum Moves To Spread Stones Over Grid", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-moves-to-spread-stones-over-grid.json", "recommendation_by_id": "/v1/recommendations/by-id/2850.json" }, "minimum-number-of-coins-for-fruits": { "question_id": "2944", "task_id": "minimum-number-of-coins-for-fruits", "title": "Minimum Number Of Coins For Fruits", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-coins-for-fruits.json", "recommendation_by_id": "/v1/recommendations/by-id/2944.json" }, "minimum-number-of-coins-for-fruits-ii": { "question_id": "2969", "task_id": "minimum-number-of-coins-for-fruits-ii", "title": "Minimum Number Of Coins For Fruits Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-coins-for-fruits-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/2969.json" }, "minimum-number-of-days-to-eat-n-oranges": { "question_id": "1553", "task_id": "minimum-number-of-days-to-eat-n-oranges", "title": "Minimum Number Of Days To Eat N Oranges", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-days-to-eat-n-oranges.json", "recommendation_by_id": "/v1/recommendations/by-id/1553.json" }, "minimum-number-of-flips-to-make-the-binary-string-alternating": { "question_id": "1888", "task_id": "minimum-number-of-flips-to-make-the-binary-string-alternating", "title": "Minimum Number Of Flips To Make The Binary String Alternating", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-flips-to-make-the-binary-string-alternating.json", "recommendation_by_id": "/v1/recommendations/by-id/1888.json" }, "minimum-number-of-food-buckets-to-feed-the-hamsters": { "question_id": "2086", "task_id": "minimum-number-of-food-buckets-to-feed-the-hamsters", "title": "Minimum Number Of Food Buckets To Feed The Hamsters", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-food-buckets-to-feed-the-hamsters.json", "recommendation_by_id": "/v1/recommendations/by-id/2086.json" }, "minimum-number-of-increments-on-subarrays-to-form-a-target-array": { "question_id": "1526", "task_id": "minimum-number-of-increments-on-subarrays-to-form-a-target-array", "title": "Minimum Number Of Increments On Subarrays To Form A Target Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-increments-on-subarrays-to-form-a-target-array.json", "recommendation_by_id": "/v1/recommendations/by-id/1526.json" }, "minimum-number-of-lines-to-cover-points": { "question_id": "2152", "task_id": "minimum-number-of-lines-to-cover-points", "title": "Minimum Number Of Lines To Cover Points", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-lines-to-cover-points.json", "recommendation_by_id": "/v1/recommendations/by-id/2152.json" }, "minimum-number-of-operations-to-make-x-and-y-equal": { "question_id": "2998", "task_id": "minimum-number-of-operations-to-make-x-and-y-equal", "title": "Minimum Number Of Operations To Make X And Y Equal", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-operations-to-make-x-and-y-equal.json", "recommendation_by_id": "/v1/recommendations/by-id/2998.json" }, "minimum-number-of-operations-to-satisfy-conditions": { "question_id": "3122", "task_id": "minimum-number-of-operations-to-satisfy-conditions", "title": "Minimum Number Of Operations To Satisfy Conditions", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-operations-to-satisfy-conditions.json", "recommendation_by_id": "/v1/recommendations/by-id/3122.json" }, "minimum-number-of-refueling-stops": { "question_id": "871", "task_id": "minimum-number-of-refueling-stops", "title": "Minimum Number Of Refueling Stops", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-refueling-stops.json", "recommendation_by_id": "/v1/recommendations/by-id/871.json" }, "minimum-number-of-removals-to-make-mountain-array": { "question_id": "1671", "task_id": "minimum-number-of-removals-to-make-mountain-array", "title": "Minimum Number Of Removals To Make Mountain Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-removals-to-make-mountain-array.json", "recommendation_by_id": "/v1/recommendations/by-id/1671.json" }, "minimum-number-of-taps-to-open-to-water-a-garden": { "question_id": "1326", "task_id": "minimum-number-of-taps-to-open-to-water-a-garden", "title": "Minimum Number Of Taps To Open To Water A Garden", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-taps-to-open-to-water-a-garden.json", "recommendation_by_id": "/v1/recommendations/by-id/1326.json" }, "minimum-number-of-visited-cells-in-a-grid": { "question_id": "2617", "task_id": "minimum-number-of-visited-cells-in-a-grid", "title": "Minimum Number Of Visited Cells In A Grid", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-visited-cells-in-a-grid.json", "recommendation_by_id": "/v1/recommendations/by-id/2617.json" }, "minimum-number-of-work-sessions-to-finish-the-tasks": { "question_id": "1986", "task_id": "minimum-number-of-work-sessions-to-finish-the-tasks", "title": "Minimum Number Of Work Sessions To Finish The Tasks", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-work-sessions-to-finish-the-tasks.json", "recommendation_by_id": "/v1/recommendations/by-id/1986.json" }, "minimum-one-bit-operations-to-make-integers-zero": { "question_id": "1611", "task_id": "minimum-one-bit-operations-to-make-integers-zero", "title": "Minimum One Bit Operations To Make Integers Zero", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-one-bit-operations-to-make-integers-zero.json", "recommendation_by_id": "/v1/recommendations/by-id/1611.json" }, "minimum-operations-to-make-array-equal-to-target": { "question_id": "3229", "task_id": "minimum-operations-to-make-array-equal-to-target", "title": "Minimum Operations To Make Array Equal To Target", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-operations-to-make-array-equal-to-target.json", "recommendation_by_id": "/v1/recommendations/by-id/3229.json" }, "minimum-operations-to-make-binary-array-elements-equal-to-one-ii": { "question_id": "3192", "task_id": "minimum-operations-to-make-binary-array-elements-equal-to-one-ii", "title": "Minimum Operations To Make Binary Array Elements Equal To One Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-operations-to-make-binary-array-elements-equal-to-one-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/3192.json" }, "minimum-operations-to-reduce-an-integer-to-0": { "question_id": "2571", "task_id": "minimum-operations-to-reduce-an-integer-to-0", "title": "Minimum Operations To Reduce An Integer To 0", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-operations-to-reduce-an-integer-to-0.json", "recommendation_by_id": "/v1/recommendations/by-id/2571.json" }, "minimum-path-cost-in-a-grid": { "question_id": "2304", "task_id": "minimum-path-cost-in-a-grid", "title": "Minimum Path Cost In A Grid", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-path-cost-in-a-grid.json", "recommendation_by_id": "/v1/recommendations/by-id/2304.json" }, "minimum-path-sum": { "question_id": "64", "task_id": "minimum-path-sum", "title": "Minimum Path Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-path-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/64.json" }, "minimum-score-triangulation-of-polygon": { "question_id": "1039", "task_id": "minimum-score-triangulation-of-polygon", "title": "Minimum Score Triangulation Of Polygon", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-score-triangulation-of-polygon.json", "recommendation_by_id": "/v1/recommendations/by-id/1039.json" }, "minimum-sideway-jumps": { "question_id": "1824", "task_id": "minimum-sideway-jumps", "title": "Minimum Sideway Jumps", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-sideway-jumps.json", "recommendation_by_id": "/v1/recommendations/by-id/1824.json" }, "minimum-skips-to-arrive-at-meeting-on-time": { "question_id": "1883", "task_id": "minimum-skips-to-arrive-at-meeting-on-time", "title": "Minimum Skips To Arrive At Meeting On Time", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-skips-to-arrive-at-meeting-on-time.json", "recommendation_by_id": "/v1/recommendations/by-id/1883.json" }, "minimum-split-into-subarrays-with-gcd-greater-than-one": { "question_id": "2436", "task_id": "minimum-split-into-subarrays-with-gcd-greater-than-one", "title": "Minimum Split Into Subarrays With Gcd Greater Than One", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-split-into-subarrays-with-gcd-greater-than-one.json", "recommendation_by_id": "/v1/recommendations/by-id/2436.json" }, "minimum-subarrays-in-a-valid-split": { "question_id": "2464", "task_id": "minimum-subarrays-in-a-valid-split", "title": "Minimum Subarrays In A Valid Split", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-subarrays-in-a-valid-split.json", "recommendation_by_id": "/v1/recommendations/by-id/2464.json" }, "minimum-substring-partition-of-equal-character-frequency": { "question_id": "3144", "task_id": "minimum-substring-partition-of-equal-character-frequency", "title": "Minimum Substring Partition Of Equal Character Frequency", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-substring-partition-of-equal-character-frequency.json", "recommendation_by_id": "/v1/recommendations/by-id/3144.json" }, "minimum-sum-of-values-by-dividing-array": { "question_id": "3117", "task_id": "minimum-sum-of-values-by-dividing-array", "title": "Minimum Sum Of Values By Dividing Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-sum-of-values-by-dividing-array.json", "recommendation_by_id": "/v1/recommendations/by-id/3117.json" }, "minimum-swaps-to-make-sequences-increasing": { "question_id": "801", "task_id": "minimum-swaps-to-make-sequences-increasing", "title": "Minimum Swaps To Make Sequences Increasing", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-swaps-to-make-sequences-increasing.json", "recommendation_by_id": "/v1/recommendations/by-id/801.json" }, "minimum-time-to-finish-the-race": { "question_id": "2188", "task_id": "minimum-time-to-finish-the-race", "title": "Minimum Time To Finish The Race", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-time-to-finish-the-race.json", "recommendation_by_id": "/v1/recommendations/by-id/2188.json" }, "minimum-time-to-kill-all-monsters": { "question_id": "2403", "task_id": "minimum-time-to-kill-all-monsters", "title": "Minimum Time To Kill All Monsters", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-time-to-kill-all-monsters.json", "recommendation_by_id": "/v1/recommendations/by-id/2403.json" }, "minimum-time-to-make-array-sum-at-most-x": { "question_id": "2809", "task_id": "minimum-time-to-make-array-sum-at-most-x", "title": "Minimum Time To Make Array Sum At Most X", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-time-to-make-array-sum-at-most-x.json", "recommendation_by_id": "/v1/recommendations/by-id/2809.json" }, "minimum-time-to-make-rope-colorful": { "question_id": "1578", "task_id": "minimum-time-to-make-rope-colorful", "title": "Minimum Time To Make Rope Colorful", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-time-to-make-rope-colorful.json", "recommendation_by_id": "/v1/recommendations/by-id/1578.json" }, "minimum-time-to-remove-all-cars-containing-illegal-goods": { "question_id": "2167", "task_id": "minimum-time-to-remove-all-cars-containing-illegal-goods", "title": "Minimum Time To Remove All Cars Containing Illegal Goods", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-time-to-remove-all-cars-containing-illegal-goods.json", "recommendation_by_id": "/v1/recommendations/by-id/2167.json" }, "minimum-total-distance-traveled": { "question_id": "2463", "task_id": "minimum-total-distance-traveled", "title": "Minimum Total Distance Traveled", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-total-distance-traveled.json", "recommendation_by_id": "/v1/recommendations/by-id/2463.json" }, "minimum-total-space-wasted-with-k-resizing-operations": { "question_id": "1959", "task_id": "minimum-total-space-wasted-with-k-resizing-operations", "title": "Minimum Total Space Wasted With K Resizing Operations", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-total-space-wasted-with-k-resizing-operations.json", "recommendation_by_id": "/v1/recommendations/by-id/1959.json" }, "minimum-white-tiles-after-covering-with-carpets": { "question_id": "2209", "task_id": "minimum-white-tiles-after-covering-with-carpets", "title": "Minimum White Tiles After Covering With Carpets", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-white-tiles-after-covering-with-carpets.json", "recommendation_by_id": "/v1/recommendations/by-id/2209.json" }, "minimum-window-subsequence": { "question_id": "727", "task_id": "minimum-window-subsequence", "title": "Minimum Window Subsequence", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-window-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/727.json" }, "minimum-xor-sum-of-two-arrays": { "question_id": "1879", "task_id": "minimum-xor-sum-of-two-arrays", "title": "Minimum Xor Sum Of Two Arrays", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-xor-sum-of-two-arrays.json", "recommendation_by_id": "/v1/recommendations/by-id/1879.json" }, "most-expensive-item-that-can-not-be-bought": { "question_id": "2979", "task_id": "most-expensive-item-that-can-not-be-bought", "title": "Most Expensive Item That Can Not Be Bought", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/most-expensive-item-that-can-not-be-bought.json", "recommendation_by_id": "/v1/recommendations/by-id/2979.json" }, "n-th-tribonacci-number": { "question_id": "1137", "task_id": "n-th-tribonacci-number", "title": "N Th Tribonacci Number", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/n-th-tribonacci-number.json", "recommendation_by_id": "/v1/recommendations/by-id/1137.json" }, "new-21-game": { "question_id": "837", "task_id": "new-21-game", "title": "New 21 Game", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/new-21-game.json", "recommendation_by_id": "/v1/recommendations/by-id/837.json" }, "non-negative-integers-without-consecutive-ones": { "question_id": "600", "task_id": "non-negative-integers-without-consecutive-ones", "title": "Non Negative Integers Without Consecutive Ones", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/non-negative-integers-without-consecutive-ones.json", "recommendation_by_id": "/v1/recommendations/by-id/600.json" }, "non-overlapping-intervals": { "question_id": "435", "task_id": "non-overlapping-intervals", "title": "Non Overlapping Intervals", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/non-overlapping-intervals.json", "recommendation_by_id": "/v1/recommendations/by-id/435.json" }, "number-of-beautiful-integers-in-the-range": { "question_id": "2827", "task_id": "number-of-beautiful-integers-in-the-range", "title": "Number Of Beautiful Integers In The Range", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-beautiful-integers-in-the-range.json", "recommendation_by_id": "/v1/recommendations/by-id/2827.json" }, "number-of-beautiful-partitions": { "question_id": "2478", "task_id": "number-of-beautiful-partitions", "title": "Number Of Beautiful Partitions", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-beautiful-partitions.json", "recommendation_by_id": "/v1/recommendations/by-id/2478.json" }, "number-of-corner-rectangles": { "question_id": "750", "task_id": "number-of-corner-rectangles", "title": "Number Of Corner Rectangles", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-corner-rectangles.json", "recommendation_by_id": "/v1/recommendations/by-id/750.json" }, "number-of-dice-rolls-with-target-sum": { "question_id": "1155", "task_id": "number-of-dice-rolls-with-target-sum", "title": "Number Of Dice Rolls With Target Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-dice-rolls-with-target-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1155.json" }, "number-of-digit-one": { "question_id": "233", "task_id": "number-of-digit-one", "title": "Number Of Digit One", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-digit-one.json", "recommendation_by_id": "/v1/recommendations/by-id/233.json" }, "number-of-distinct-roll-sequences": { "question_id": "2318", "task_id": "number-of-distinct-roll-sequences", "title": "Number Of Distinct Roll Sequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-distinct-roll-sequences.json", "recommendation_by_id": "/v1/recommendations/by-id/2318.json" }, "number-of-good-binary-strings": { "question_id": "2533", "task_id": "number-of-good-binary-strings", "title": "Number Of Good Binary Strings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-good-binary-strings.json", "recommendation_by_id": "/v1/recommendations/by-id/2533.json" }, "number-of-good-ways-to-split-a-string": { "question_id": "1525", "task_id": "number-of-good-ways-to-split-a-string", "title": "Number Of Good Ways To Split A String", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-good-ways-to-split-a-string.json", "recommendation_by_id": "/v1/recommendations/by-id/1525.json" }, "number-of-great-partitions": { "question_id": "2518", "task_id": "number-of-great-partitions", "title": "Number Of Great Partitions", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-great-partitions.json", "recommendation_by_id": "/v1/recommendations/by-id/2518.json" }, "number-of-increasing-paths-in-a-grid": { "question_id": "2328", "task_id": "number-of-increasing-paths-in-a-grid", "title": "Number Of Increasing Paths In A Grid", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-increasing-paths-in-a-grid.json", "recommendation_by_id": "/v1/recommendations/by-id/2328.json" }, "number-of-longest-increasing-subsequence": { "question_id": "673", "task_id": "number-of-longest-increasing-subsequence", "title": "Number Of Longest Increasing Subsequence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-longest-increasing-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/673.json" }, "number-of-matching-subsequences": { "question_id": "792", "task_id": "number-of-matching-subsequences", "title": "Number Of Matching Subsequences", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-matching-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/792.json" }, "number-of-music-playlists": { "question_id": "920", "task_id": "number-of-music-playlists", "title": "Number Of Music Playlists", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-music-playlists.json", "recommendation_by_id": "/v1/recommendations/by-id/920.json" }, "number-of-paths-with-max-score": { "question_id": "1301", "task_id": "number-of-paths-with-max-score", "title": "Number Of Paths With Max Score", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-paths-with-max-score.json", "recommendation_by_id": "/v1/recommendations/by-id/1301.json" }, "number-of-people-aware-of-a-secret": { "question_id": "2327", "task_id": "number-of-people-aware-of-a-secret", "title": "Number Of People Aware Of A Secret", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-people-aware-of-a-secret.json", "recommendation_by_id": "/v1/recommendations/by-id/2327.json" }, "number-of-restricted-paths-from-first-to-last-node": { "question_id": "1786", "task_id": "number-of-restricted-paths-from-first-to-last-node", "title": "Number Of Restricted Paths From First To Last Node", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-restricted-paths-from-first-to-last-node.json", "recommendation_by_id": "/v1/recommendations/by-id/1786.json" }, "number-of-self-divisible-permutations": { "question_id": "2992", "task_id": "number-of-self-divisible-permutations", "title": "Number Of Self Divisible Permutations", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-self-divisible-permutations.json", "recommendation_by_id": "/v1/recommendations/by-id/2992.json" }, "number-of-sets-of-k-non-overlapping-line-segments": { "question_id": "1621", "task_id": "number-of-sets-of-k-non-overlapping-line-segments", "title": "Number Of Sets Of K Non Overlapping Line Segments", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-sets-of-k-non-overlapping-line-segments.json", "recommendation_by_id": "/v1/recommendations/by-id/1621.json" }, "number-of-smooth-descent-periods-of-a-stock": { "question_id": "2110", "task_id": "number-of-smooth-descent-periods-of-a-stock", "title": "Number Of Smooth Descent Periods Of A Stock", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-smooth-descent-periods-of-a-stock.json", "recommendation_by_id": "/v1/recommendations/by-id/2110.json" }, "number-of-squareful-arrays": { "question_id": "996", "task_id": "number-of-squareful-arrays", "title": "Number Of Squareful Arrays", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-squareful-arrays.json", "recommendation_by_id": "/v1/recommendations/by-id/996.json" }, "number-of-strings-which-can-be-rearranged-to-contain-substring": { "question_id": "2930", "task_id": "number-of-strings-which-can-be-rearranged-to-contain-substring", "title": "Number Of Strings Which Can Be Rearranged To Contain Substring", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-strings-which-can-be-rearranged-to-contain-substring.json", "recommendation_by_id": "/v1/recommendations/by-id/2930.json" }, "number-of-sub-arrays-with-odd-sum": { "question_id": "1524", "task_id": "number-of-sub-arrays-with-odd-sum", "title": "Number Of Sub Arrays With Odd Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-sub-arrays-with-odd-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1524.json" }, "number-of-subarrays-having-even-product": { "question_id": "2495", "task_id": "number-of-subarrays-having-even-product", "title": "Number Of Subarrays Having Even Product", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-subarrays-having-even-product.json", "recommendation_by_id": "/v1/recommendations/by-id/2495.json" }, "number-of-unique-good-subsequences": { "question_id": "1987", "task_id": "number-of-unique-good-subsequences", "title": "Number Of Unique Good Subsequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-unique-good-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/1987.json" }, "number-of-ways-of-cutting-a-pizza": { "question_id": "1444", "task_id": "number-of-ways-of-cutting-a-pizza", "title": "Number Of Ways Of Cutting A Pizza", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-of-cutting-a-pizza.json", "recommendation_by_id": "/v1/recommendations/by-id/1444.json" }, "number-of-ways-to-arrive-at-destination": { "question_id": "1976", "task_id": "number-of-ways-to-arrive-at-destination", "title": "Number Of Ways To Arrive At Destination", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-arrive-at-destination.json", "recommendation_by_id": "/v1/recommendations/by-id/1976.json" }, "number-of-ways-to-build-house-of-cards": { "question_id": "2189", "task_id": "number-of-ways-to-build-house-of-cards", "title": "Number Of Ways To Build House Of Cards", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-build-house-of-cards.json", "recommendation_by_id": "/v1/recommendations/by-id/2189.json" }, "number-of-ways-to-build-sturdy-brick-wall": { "question_id": "2184", "task_id": "number-of-ways-to-build-sturdy-brick-wall", "title": "Number Of Ways To Build Sturdy Brick Wall", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-build-sturdy-brick-wall.json", "recommendation_by_id": "/v1/recommendations/by-id/2184.json" }, "number-of-ways-to-divide-a-long-corridor": { "question_id": "2147", "task_id": "number-of-ways-to-divide-a-long-corridor", "title": "Number Of Ways To Divide A Long Corridor", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-divide-a-long-corridor.json", "recommendation_by_id": "/v1/recommendations/by-id/2147.json" }, "number-of-ways-to-earn-points": { "question_id": "2585", "task_id": "number-of-ways-to-earn-points", "title": "Number Of Ways To Earn Points", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-earn-points.json", "recommendation_by_id": "/v1/recommendations/by-id/2585.json" }, "number-of-ways-to-form-a-target-string-given-a-dictionary": { "question_id": "1639", "task_id": "number-of-ways-to-form-a-target-string-given-a-dictionary", "title": "Number Of Ways To Form A Target String Given A Dictionary", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-form-a-target-string-given-a-dictionary.json", "recommendation_by_id": "/v1/recommendations/by-id/1639.json" }, "number-of-ways-to-paint-n-3-grid": { "question_id": "1411", "task_id": "number-of-ways-to-paint-n-3-grid", "title": "Number Of Ways To Paint N 3 Grid", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-paint-n-3-grid.json", "recommendation_by_id": "/v1/recommendations/by-id/1411.json" }, "number-of-ways-to-reach-a-position-after-exactly-k-steps": { "question_id": "2400", "task_id": "number-of-ways-to-reach-a-position-after-exactly-k-steps", "title": "Number Of Ways To Reach A Position After Exactly K Steps", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-reach-a-position-after-exactly-k-steps.json", "recommendation_by_id": "/v1/recommendations/by-id/2400.json" }, "number-of-ways-to-reach-destination-in-the-grid": { "question_id": "2912", "task_id": "number-of-ways-to-reach-destination-in-the-grid", "title": "Number Of Ways To Reach Destination In The Grid", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-reach-destination-in-the-grid.json", "recommendation_by_id": "/v1/recommendations/by-id/2912.json" }, "number-of-ways-to-rearrange-sticks-with-k-sticks-visible": { "question_id": "1866", "task_id": "number-of-ways-to-rearrange-sticks-with-k-sticks-visible", "title": "Number Of Ways To Rearrange Sticks With K Sticks Visible", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-rearrange-sticks-with-k-sticks-visible.json", "recommendation_by_id": "/v1/recommendations/by-id/1866.json" }, "number-of-ways-to-reorder-array-to-get-same-bst": { "question_id": "1569", "task_id": "number-of-ways-to-reorder-array-to-get-same-bst", "title": "Number Of Ways To Reorder Array To Get Same Bst", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-reorder-array-to-get-same-bst.json", "recommendation_by_id": "/v1/recommendations/by-id/1569.json" }, "number-of-ways-to-select-buildings": { "question_id": "2222", "task_id": "number-of-ways-to-select-buildings", "title": "Number Of Ways To Select Buildings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-select-buildings.json", "recommendation_by_id": "/v1/recommendations/by-id/2222.json" }, "number-of-ways-to-separate-numbers": { "question_id": "1977", "task_id": "number-of-ways-to-separate-numbers", "title": "Number Of Ways To Separate Numbers", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-separate-numbers.json", "recommendation_by_id": "/v1/recommendations/by-id/1977.json" }, "number-of-ways-to-stay-in-the-same-place-after-some-steps": { "question_id": "1269", "task_id": "number-of-ways-to-stay-in-the-same-place-after-some-steps", "title": "Number Of Ways To Stay In The Same Place After Some Steps", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-stay-in-the-same-place-after-some-steps.json", "recommendation_by_id": "/v1/recommendations/by-id/1269.json" }, "number-of-ways-to-wear-different-hats-to-each-other": { "question_id": "1434", "task_id": "number-of-ways-to-wear-different-hats-to-each-other", "title": "Number Of Ways To Wear Different Hats To Each Other", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-wear-different-hats-to-each-other.json", "recommendation_by_id": "/v1/recommendations/by-id/1434.json" }, "numbers-at-most-n-given-digit-set": { "question_id": "902", "task_id": "numbers-at-most-n-given-digit-set", "title": "Numbers At Most N Given Digit Set", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/numbers-at-most-n-given-digit-set.json", "recommendation_by_id": "/v1/recommendations/by-id/902.json" }, "numbers-with-repeated-digits": { "question_id": "1012", "task_id": "numbers-with-repeated-digits", "title": "Numbers With Repeated Digits", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/numbers-with-repeated-digits.json", "recommendation_by_id": "/v1/recommendations/by-id/1012.json" }, "odd-even-jump": { "question_id": "975", "task_id": "odd-even-jump", "title": "Odd Even Jump", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/odd-even-jump.json", "recommendation_by_id": "/v1/recommendations/by-id/975.json" }, "ones-and-zeroes": { "question_id": "474", "task_id": "ones-and-zeroes", "title": "Ones And Zeroes", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/ones-and-zeroes.json", "recommendation_by_id": "/v1/recommendations/by-id/474.json" }, "optimal-account-balancing": { "question_id": "465", "task_id": "optimal-account-balancing", "title": "Optimal Account Balancing", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/optimal-account-balancing.json", "recommendation_by_id": "/v1/recommendations/by-id/465.json" }, "optimal-division": { "question_id": "553", "task_id": "optimal-division", "title": "Optimal Division", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/optimal-division.json", "recommendation_by_id": "/v1/recommendations/by-id/553.json" }, "out-of-boundary-paths": { "question_id": "576", "task_id": "out-of-boundary-paths", "title": "Out Of Boundary Paths", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/out-of-boundary-paths.json", "recommendation_by_id": "/v1/recommendations/by-id/576.json" }, "paint-fence": { "question_id": "276", "task_id": "paint-fence", "title": "Paint Fence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/paint-fence.json", "recommendation_by_id": "/v1/recommendations/by-id/276.json" }, "paint-house": { "question_id": "256", "task_id": "paint-house", "title": "Paint House", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/paint-house.json", "recommendation_by_id": "/v1/recommendations/by-id/256.json" }, "paint-house-ii": { "question_id": "265", "task_id": "paint-house-ii", "title": "Paint House Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/paint-house-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/265.json" }, "paint-house-iii": { "question_id": "1473", "task_id": "paint-house-iii", "title": "Paint House Iii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/paint-house-iii.json", "recommendation_by_id": "/v1/recommendations/by-id/1473.json" }, "painting-a-grid-with-three-different-colors": { "question_id": "1931", "task_id": "painting-a-grid-with-three-different-colors", "title": "Painting A Grid With Three Different Colors", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/painting-a-grid-with-three-different-colors.json", "recommendation_by_id": "/v1/recommendations/by-id/1931.json" }, "painting-the-walls": { "question_id": "2742", "task_id": "painting-the-walls", "title": "Painting The Walls", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/painting-the-walls.json", "recommendation_by_id": "/v1/recommendations/by-id/2742.json" }, "palindrome-partitioning": { "question_id": "131", "task_id": "palindrome-partitioning", "title": "Palindrome Partitioning", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/palindrome-partitioning.json", "recommendation_by_id": "/v1/recommendations/by-id/131.json" }, "palindrome-partitioning-ii": { "question_id": "132", "task_id": "palindrome-partitioning-ii", "title": "Palindrome Partitioning Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/palindrome-partitioning-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/132.json" }, "palindrome-partitioning-iii": { "question_id": "1278", "task_id": "palindrome-partitioning-iii", "title": "Palindrome Partitioning Iii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/palindrome-partitioning-iii.json", "recommendation_by_id": "/v1/recommendations/by-id/1278.json" }, "palindrome-partitioning-iv": { "question_id": "1745", "task_id": "palindrome-partitioning-iv", "title": "Palindrome Partitioning Iv", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/palindrome-partitioning-iv.json", "recommendation_by_id": "/v1/recommendations/by-id/1745.json" }, "palindromic-substrings": { "question_id": "647", "task_id": "palindromic-substrings", "title": "Palindromic Substrings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/palindromic-substrings.json", "recommendation_by_id": "/v1/recommendations/by-id/647.json" }, "parallel-courses-ii": { "question_id": "1494", "task_id": "parallel-courses-ii", "title": "Parallel Courses Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/parallel-courses-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1494.json" }, "parallel-courses-iii": { "question_id": "2050", "task_id": "parallel-courses-iii", "title": "Parallel Courses Iii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/parallel-courses-iii.json", "recommendation_by_id": "/v1/recommendations/by-id/2050.json" }, "partition-array-for-maximum-sum": { "question_id": "1043", "task_id": "partition-array-for-maximum-sum", "title": "Partition Array For Maximum Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/partition-array-for-maximum-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1043.json" }, "partition-array-into-two-arrays-to-minimize-sum-difference": { "question_id": "2035", "task_id": "partition-array-into-two-arrays-to-minimize-sum-difference", "title": "Partition Array Into Two Arrays To Minimize Sum Difference", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/partition-array-into-two-arrays-to-minimize-sum-difference.json", "recommendation_by_id": "/v1/recommendations/by-id/2035.json" }, "partition-equal-subset-sum": { "question_id": "416", "task_id": "partition-equal-subset-sum", "title": "Partition Equal Subset Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/partition-equal-subset-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/416.json" }, "partition-string-into-minimum-beautiful-substrings": { "question_id": "2767", "task_id": "partition-string-into-minimum-beautiful-substrings", "title": "Partition String Into Minimum Beautiful Substrings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/partition-string-into-minimum-beautiful-substrings.json", "recommendation_by_id": "/v1/recommendations/by-id/2767.json" }, "partition-string-into-substrings-with-values-at-most-k": { "question_id": "2522", "task_id": "partition-string-into-substrings-with-values-at-most-k", "title": "Partition String Into Substrings With Values At Most K", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/partition-string-into-substrings-with-values-at-most-k.json", "recommendation_by_id": "/v1/recommendations/by-id/2522.json" }, "partition-to-k-equal-sum-subsets": { "question_id": "698", "task_id": "partition-to-k-equal-sum-subsets", "title": "Partition To K Equal Sum Subsets", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/partition-to-k-equal-sum-subsets.json", "recommendation_by_id": "/v1/recommendations/by-id/698.json" }, "pascals-triangle": { "question_id": "118", "task_id": "pascals-triangle", "title": "Pascals Triangle", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/pascals-triangle.json", "recommendation_by_id": "/v1/recommendations/by-id/118.json" }, "pascals-triangle-ii": { "question_id": "119", "task_id": "pascals-triangle-ii", "title": "Pascals Triangle Ii", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/pascals-triangle-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/119.json" }, "paths-in-matrix-whose-sum-is-divisible-by-k": { "question_id": "2435", "task_id": "paths-in-matrix-whose-sum-is-divisible-by-k", "title": "Paths In Matrix Whose Sum Is Divisible By K", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/paths-in-matrix-whose-sum-is-divisible-by-k.json", "recommendation_by_id": "/v1/recommendations/by-id/2435.json" }, "perfect-squares": { "question_id": "279", "task_id": "perfect-squares", "title": "Perfect Squares", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/perfect-squares.json", "recommendation_by_id": "/v1/recommendations/by-id/279.json" }, "pizza-with-3n-slices": { "question_id": "1388", "task_id": "pizza-with-3n-slices", "title": "Pizza With 3N Slices", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/pizza-with-3n-slices.json", "recommendation_by_id": "/v1/recommendations/by-id/1388.json" }, "poor-pigs": { "question_id": "458", "task_id": "poor-pigs", "title": "Poor Pigs", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/poor-pigs.json", "recommendation_by_id": "/v1/recommendations/by-id/458.json" }, "power-of-heroes": { "question_id": "2681", "task_id": "power-of-heroes", "title": "Power Of Heroes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/power-of-heroes.json", "recommendation_by_id": "/v1/recommendations/by-id/2681.json" }, "predict-the-winner": { "question_id": "486", "task_id": "predict-the-winner", "title": "Predict The Winner", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/predict-the-winner.json", "recommendation_by_id": "/v1/recommendations/by-id/486.json" }, "probability-of-a-two-boxes-having-the-same-number-of-distinct-balls": { "question_id": "1467", "task_id": "probability-of-a-two-boxes-having-the-same-number-of-distinct-balls", "title": "Probability Of A Two Boxes Having The Same Number Of Distinct Balls", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls.json", "recommendation_by_id": "/v1/recommendations/by-id/1467.json" }, "profitable-schemes": { "question_id": "879", "task_id": "profitable-schemes", "title": "Profitable Schemes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/profitable-schemes.json", "recommendation_by_id": "/v1/recommendations/by-id/879.json" }, "push-dominoes": { "question_id": "838", "task_id": "push-dominoes", "title": "Push Dominoes", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/push-dominoes.json", "recommendation_by_id": "/v1/recommendations/by-id/838.json" }, "race-car": { "question_id": "818", "task_id": "race-car", "title": "Race Car", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/race-car.json", "recommendation_by_id": "/v1/recommendations/by-id/818.json" }, "reducing-dishes": { "question_id": "1402", "task_id": "reducing-dishes", "title": "Reducing Dishes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/reducing-dishes.json", "recommendation_by_id": "/v1/recommendations/by-id/1402.json" }, "regular-expression-matching": { "question_id": "10", "task_id": "regular-expression-matching", "title": "Regular Expression Matching", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/regular-expression-matching.json", "recommendation_by_id": "/v1/recommendations/by-id/10.json" }, "remove-adjacent-almost-equal-characters": { "question_id": "2957", "task_id": "remove-adjacent-almost-equal-characters", "title": "Remove Adjacent Almost Equal Characters", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/remove-adjacent-almost-equal-characters.json", "recommendation_by_id": "/v1/recommendations/by-id/2957.json" }, "remove-boxes": { "question_id": "546", "task_id": "remove-boxes", "title": "Remove Boxes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/remove-boxes.json", "recommendation_by_id": "/v1/recommendations/by-id/546.json" }, "restore-the-array": { "question_id": "1416", "task_id": "restore-the-array", "title": "Restore The Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/restore-the-array.json", "recommendation_by_id": "/v1/recommendations/by-id/1416.json" }, "rotate-function": { "question_id": "396", "task_id": "rotate-function", "title": "Rotate Function", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/rotate-function.json", "recommendation_by_id": "/v1/recommendations/by-id/396.json" }, "rotated-digits": { "question_id": "788", "task_id": "rotated-digits", "title": "Rotated Digits", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/rotated-digits.json", "recommendation_by_id": "/v1/recommendations/by-id/788.json" }, "russian-doll-envelopes": { "question_id": "354", "task_id": "russian-doll-envelopes", "title": "Russian Doll Envelopes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/russian-doll-envelopes.json", "recommendation_by_id": "/v1/recommendations/by-id/354.json" }, "scramble-string": { "question_id": "87", "task_id": "scramble-string", "title": "Scramble String", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/scramble-string.json", "recommendation_by_id": "/v1/recommendations/by-id/87.json" }, "selling-pieces-of-wood": { "question_id": "2312", "task_id": "selling-pieces-of-wood", "title": "Selling Pieces Of Wood", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/selling-pieces-of-wood.json", "recommendation_by_id": "/v1/recommendations/by-id/2312.json" }, "sentence-screen-fitting": { "question_id": "418", "task_id": "sentence-screen-fitting", "title": "Sentence Screen Fitting", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/sentence-screen-fitting.json", "recommendation_by_id": "/v1/recommendations/by-id/418.json" }, "shopping-offers": { "question_id": "638", "task_id": "shopping-offers", "title": "Shopping Offers", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/shopping-offers.json", "recommendation_by_id": "/v1/recommendations/by-id/638.json" }, "shortest-common-supersequence": { "question_id": "1092", "task_id": "shortest-common-supersequence", "title": "Shortest Common Supersequence", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/shortest-common-supersequence.json", "recommendation_by_id": "/v1/recommendations/by-id/1092.json" }, "shortest-distance-to-target-color": { "question_id": "1182", "task_id": "shortest-distance-to-target-color", "title": "Shortest Distance To Target Color", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/shortest-distance-to-target-color.json", "recommendation_by_id": "/v1/recommendations/by-id/1182.json" }, "shortest-path-visiting-all-nodes": { "question_id": "847", "task_id": "shortest-path-visiting-all-nodes", "title": "Shortest Path Visiting All Nodes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/shortest-path-visiting-all-nodes.json", "recommendation_by_id": "/v1/recommendations/by-id/847.json" }, "sliding-puzzle": { "question_id": "773", "task_id": "sliding-puzzle", "title": "Sliding Puzzle", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/sliding-puzzle.json", "recommendation_by_id": "/v1/recommendations/by-id/773.json" }, "smallest-missing-genetic-value-in-each-subtree": { "question_id": "2003", "task_id": "smallest-missing-genetic-value-in-each-subtree", "title": "Smallest Missing Genetic Value In Each Subtree", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/smallest-missing-genetic-value-in-each-subtree.json", "recommendation_by_id": "/v1/recommendations/by-id/2003.json" }, "smallest-sufficient-team": { "question_id": "1125", "task_id": "smallest-sufficient-team", "title": "Smallest Sufficient Team", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/smallest-sufficient-team.json", "recommendation_by_id": "/v1/recommendations/by-id/1125.json" }, "solving-questions-with-brainpower": { "question_id": "2140", "task_id": "solving-questions-with-brainpower", "title": "Solving Questions With Brainpower", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/solving-questions-with-brainpower.json", "recommendation_by_id": "/v1/recommendations/by-id/2140.json" }, "sort-integers-by-the-power-value": { "question_id": "1387", "task_id": "sort-integers-by-the-power-value", "title": "Sort Integers By The Power Value", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/sort-integers-by-the-power-value.json", "recommendation_by_id": "/v1/recommendations/by-id/1387.json" }, "sorting-three-groups": { "question_id": "2826", "task_id": "sorting-three-groups", "title": "Sorting Three Groups", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/sorting-three-groups.json", "recommendation_by_id": "/v1/recommendations/by-id/2826.json" }, "soup-servings": { "question_id": "808", "task_id": "soup-servings", "title": "Soup Servings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/soup-servings.json", "recommendation_by_id": "/v1/recommendations/by-id/808.json" }, "special-permutations": { "question_id": "2741", "task_id": "special-permutations", "title": "Special Permutations", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/special-permutations.json", "recommendation_by_id": "/v1/recommendations/by-id/2741.json" }, "split-array-largest-sum": { "question_id": "410", "task_id": "split-array-largest-sum", "title": "Split Array Largest Sum", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/split-array-largest-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/410.json" }, "split-array-with-same-average": { "question_id": "805", "task_id": "split-array-with-same-average", "title": "Split Array With Same Average", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/split-array-with-same-average.json", "recommendation_by_id": "/v1/recommendations/by-id/805.json" }, "stickers-to-spell-word": { "question_id": "691", "task_id": "stickers-to-spell-word", "title": "Stickers To Spell Word", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/stickers-to-spell-word.json", "recommendation_by_id": "/v1/recommendations/by-id/691.json" }, "stone-game": { "question_id": "877", "task_id": "stone-game", "title": "Stone Game", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/stone-game.json", "recommendation_by_id": "/v1/recommendations/by-id/877.json" }, "stone-game-ii": { "question_id": "1140", "task_id": "stone-game-ii", "title": "Stone Game Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/stone-game-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1140.json" }, "stone-game-iii": { "question_id": "1406", "task_id": "stone-game-iii", "title": "Stone Game Iii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/stone-game-iii.json", "recommendation_by_id": "/v1/recommendations/by-id/1406.json" }, "stone-game-iv": { "question_id": "1510", "task_id": "stone-game-iv", "title": "Stone Game Iv", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/stone-game-iv.json", "recommendation_by_id": "/v1/recommendations/by-id/1510.json" }, "stone-game-v": { "question_id": "1563", "task_id": "stone-game-v", "title": "Stone Game V", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/stone-game-v.json", "recommendation_by_id": "/v1/recommendations/by-id/1563.json" }, "stone-game-vii": { "question_id": "1690", "task_id": "stone-game-vii", "title": "Stone Game Vii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/stone-game-vii.json", "recommendation_by_id": "/v1/recommendations/by-id/1690.json" }, "stone-game-viii": { "question_id": "1872", "task_id": "stone-game-viii", "title": "Stone Game Viii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/stone-game-viii.json", "recommendation_by_id": "/v1/recommendations/by-id/1872.json" }, "strange-printer": { "question_id": "664", "task_id": "strange-printer", "title": "Strange Printer", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/strange-printer.json", "recommendation_by_id": "/v1/recommendations/by-id/664.json" }, "string-compression-ii": { "question_id": "1531", "task_id": "string-compression-ii", "title": "String Compression Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/string-compression-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1531.json" }, "string-transformation": { "question_id": "2851", "task_id": "string-transformation", "title": "String Transformation", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/string-transformation.json", "recommendation_by_id": "/v1/recommendations/by-id/2851.json" }, "student-attendance-record-ii": { "question_id": "552", "task_id": "student-attendance-record-ii", "title": "Student Attendance Record Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/student-attendance-record-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/552.json" }, "subarrays-distinct-element-sum-of-squares-ii": { "question_id": "2916", "task_id": "subarrays-distinct-element-sum-of-squares-ii", "title": "Subarrays Distinct Element Sum Of Squares Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/subarrays-distinct-element-sum-of-squares-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/2916.json" }, "substring-with-largest-variance": { "question_id": "2272", "task_id": "substring-with-largest-variance", "title": "Substring With Largest Variance", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/substring-with-largest-variance.json", "recommendation_by_id": "/v1/recommendations/by-id/2272.json" }, "subtree-removal-game-with-fibonacci-tree": { "question_id": "2005", "task_id": "subtree-removal-game-with-fibonacci-tree", "title": "Subtree Removal Game With Fibonacci Tree", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/subtree-removal-game-with-fibonacci-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/2005.json" }, "sum-of-distances-in-tree": { "question_id": "834", "task_id": "sum-of-distances-in-tree", "title": "Sum Of Distances In Tree", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/sum-of-distances-in-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/834.json" }, "sum-of-numbers-with-units-digit-k": { "question_id": "2310", "task_id": "sum-of-numbers-with-units-digit-k", "title": "Sum Of Numbers With Units Digit K", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/sum-of-numbers-with-units-digit-k.json", "recommendation_by_id": "/v1/recommendations/by-id/2310.json" }, "sum-of-special-evenly-spaced-elements-in-array": { "question_id": "1714", "task_id": "sum-of-special-evenly-spaced-elements-in-array", "title": "Sum Of Special Evenly Spaced Elements In Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/sum-of-special-evenly-spaced-elements-in-array.json", "recommendation_by_id": "/v1/recommendations/by-id/1714.json" }, "sum-of-subarray-minimums": { "question_id": "907", "task_id": "sum-of-subarray-minimums", "title": "Sum Of Subarray Minimums", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/sum-of-subarray-minimums.json", "recommendation_by_id": "/v1/recommendations/by-id/907.json" }, "super-egg-drop": { "question_id": "887", "task_id": "super-egg-drop", "title": "Super Egg Drop", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/super-egg-drop.json", "recommendation_by_id": "/v1/recommendations/by-id/887.json" }, "super-ugly-number": { "question_id": "313", "task_id": "super-ugly-number", "title": "Super Ugly Number", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/super-ugly-number.json", "recommendation_by_id": "/v1/recommendations/by-id/313.json" }, "tallest-billboard": { "question_id": "956", "task_id": "tallest-billboard", "title": "Tallest Billboard", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/tallest-billboard.json", "recommendation_by_id": "/v1/recommendations/by-id/956.json" }, "target-sum": { "question_id": "494", "task_id": "target-sum", "title": "Target Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/target-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/494.json" }, "the-earliest-and-latest-rounds-where-players-compete": { "question_id": "1900", "task_id": "the-earliest-and-latest-rounds-where-players-compete", "title": "The Earliest And Latest Rounds Where Players Compete", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/the-earliest-and-latest-rounds-where-players-compete.json", "recommendation_by_id": "/v1/recommendations/by-id/1900.json" }, "the-most-similar-path-in-a-graph": { "question_id": "1548", "task_id": "the-most-similar-path-in-a-graph", "title": "The Most Similar Path In A Graph", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/the-most-similar-path-in-a-graph.json", "recommendation_by_id": "/v1/recommendations/by-id/1548.json" }, "the-number-of-beautiful-subsets": { "question_id": "2597", "task_id": "the-number-of-beautiful-subsets", "title": "The Number Of Beautiful Subsets", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/the-number-of-beautiful-subsets.json", "recommendation_by_id": "/v1/recommendations/by-id/2597.json" }, "the-number-of-good-subsets": { "question_id": "1994", "task_id": "the-number-of-good-subsets", "title": "The Number Of Good Subsets", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/the-number-of-good-subsets.json", "recommendation_by_id": "/v1/recommendations/by-id/1994.json" }, "the-number-of-ways-to-make-the-sum": { "question_id": "3183", "task_id": "the-number-of-ways-to-make-the-sum", "title": "The Number Of Ways To Make The Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/the-number-of-ways-to-make-the-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/3183.json" }, "the-score-of-students-solving-math-expression": { "question_id": "2019", "task_id": "the-score-of-students-solving-math-expression", "title": "The Score Of Students Solving Math Expression", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/the-score-of-students-solving-math-expression.json", "recommendation_by_id": "/v1/recommendations/by-id/2019.json" }, "time-needed-to-rearrange-a-binary-string": { "question_id": "2380", "task_id": "time-needed-to-rearrange-a-binary-string", "title": "Time Needed To Rearrange A Binary String", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/time-needed-to-rearrange-a-binary-string.json", "recommendation_by_id": "/v1/recommendations/by-id/2380.json" }, "time-taken-to-mark-all-nodes": { "question_id": "3241", "task_id": "time-taken-to-mark-all-nodes", "title": "Time Taken To Mark All Nodes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/time-taken-to-mark-all-nodes.json", "recommendation_by_id": "/v1/recommendations/by-id/3241.json" }, "toss-strange-coins": { "question_id": "1230", "task_id": "toss-strange-coins", "title": "Toss Strange Coins", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/toss-strange-coins.json", "recommendation_by_id": "/v1/recommendations/by-id/1230.json" }, "total-appeal-of-a-string": { "question_id": "2262", "task_id": "total-appeal-of-a-string", "title": "Total Appeal Of A String", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/total-appeal-of-a-string.json", "recommendation_by_id": "/v1/recommendations/by-id/2262.json" }, "trapping-rain-water": { "question_id": "42", "task_id": "trapping-rain-water", "title": "Trapping Rain Water", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/trapping-rain-water.json", "recommendation_by_id": "/v1/recommendations/by-id/42.json" }, "triangle": { "question_id": "120", "task_id": "triangle", "title": "Triangle", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/triangle.json", "recommendation_by_id": "/v1/recommendations/by-id/120.json" }, "two-best-non-overlapping-events": { "question_id": "2054", "task_id": "two-best-non-overlapping-events", "title": "Two Best Non Overlapping Events", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/two-best-non-overlapping-events.json", "recommendation_by_id": "/v1/recommendations/by-id/2054.json" }, "ugly-number-ii": { "question_id": "264", "task_id": "ugly-number-ii", "title": "Ugly Number Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/ugly-number-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/264.json" }, "uncrossed-lines": { "question_id": "1035", "task_id": "uncrossed-lines", "title": "Uncrossed Lines", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/uncrossed-lines.json", "recommendation_by_id": "/v1/recommendations/by-id/1035.json" }, "unique-binary-search-trees": { "question_id": "96", "task_id": "unique-binary-search-trees", "title": "Unique Binary Search Trees", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/unique-binary-search-trees.json", "recommendation_by_id": "/v1/recommendations/by-id/96.json" }, "unique-paths": { "question_id": "62", "task_id": "unique-paths", "title": "Unique Paths", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/unique-paths.json", "recommendation_by_id": "/v1/recommendations/by-id/62.json" }, "unique-paths-ii": { "question_id": "63", "task_id": "unique-paths-ii", "title": "Unique Paths Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/unique-paths-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/63.json" }, "unique-substrings-in-wraparound-string": { "question_id": "467", "task_id": "unique-substrings-in-wraparound-string", "title": "Unique Substrings In Wraparound String", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/unique-substrings-in-wraparound-string.json", "recommendation_by_id": "/v1/recommendations/by-id/467.json" }, "valid-palindrome-iii": { "question_id": "1216", "task_id": "valid-palindrome-iii", "title": "Valid Palindrome Iii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/valid-palindrome-iii.json", "recommendation_by_id": "/v1/recommendations/by-id/1216.json" }, "valid-parenthesis-string": { "question_id": "678", "task_id": "valid-parenthesis-string", "title": "Valid Parenthesis String", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/valid-parenthesis-string.json", "recommendation_by_id": "/v1/recommendations/by-id/678.json" }, "valid-permutations-for-di-sequence": { "question_id": "903", "task_id": "valid-permutations-for-di-sequence", "title": "Valid Permutations For Di Sequence", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/valid-permutations-for-di-sequence.json", "recommendation_by_id": "/v1/recommendations/by-id/903.json" }, "video-stitching": { "question_id": "1024", "task_id": "video-stitching", "title": "Video Stitching", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/video-stitching.json", "recommendation_by_id": "/v1/recommendations/by-id/1024.json" }, "visit-array-positions-to-maximize-score": { "question_id": "2786", "task_id": "visit-array-positions-to-maximize-score", "title": "Visit Array Positions To Maximize Score", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/visit-array-positions-to-maximize-score.json", "recommendation_by_id": "/v1/recommendations/by-id/2786.json" }, "vowels-of-all-substrings": { "question_id": "2063", "task_id": "vowels-of-all-substrings", "title": "Vowels Of All Substrings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/vowels-of-all-substrings.json", "recommendation_by_id": "/v1/recommendations/by-id/2063.json" }, "ways-to-express-an-integer-as-sum-of-powers": { "question_id": "2787", "task_id": "ways-to-express-an-integer-as-sum-of-powers", "title": "Ways To Express An Integer As Sum Of Powers", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/ways-to-express-an-integer-as-sum-of-powers.json", "recommendation_by_id": "/v1/recommendations/by-id/2787.json" }, "ways-to-split-array-into-good-subarrays": { "question_id": "2750", "task_id": "ways-to-split-array-into-good-subarrays", "title": "Ways To Split Array Into Good Subarrays", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/ways-to-split-array-into-good-subarrays.json", "recommendation_by_id": "/v1/recommendations/by-id/2750.json" }, "wiggle-subsequence": { "question_id": "376", "task_id": "wiggle-subsequence", "title": "Wiggle Subsequence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/wiggle-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/376.json" }, "wildcard-matching": { "question_id": "44", "task_id": "wildcard-matching", "title": "Wildcard Matching", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/wildcard-matching.json", "recommendation_by_id": "/v1/recommendations/by-id/44.json" }, "word-break": { "question_id": "139", "task_id": "word-break", "title": "Word Break", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/word-break.json", "recommendation_by_id": "/v1/recommendations/by-id/139.json" }, "word-break-ii": { "question_id": "140", "task_id": "word-break-ii", "title": "Word Break Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/word-break-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/140.json" }, "zuma-game": { "question_id": "488", "task_id": "zuma-game", "title": "Zuma Game", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/zuma-game.json", "recommendation_by_id": "/v1/recommendations/by-id/488.json" } }, "by_id": { "10": { "question_id": "10", "task_id": "regular-expression-matching", "title": "Regular Expression Matching", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/regular-expression-matching.json", "recommendation_by_id": "/v1/recommendations/by-id/10.json" }, "1000": { "question_id": "1000", "task_id": "minimum-cost-to-merge-stones", "title": "Minimum Cost To Merge Stones", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-merge-stones.json", "recommendation_by_id": "/v1/recommendations/by-id/1000.json" }, "1012": { "question_id": "1012", "task_id": "numbers-with-repeated-digits", "title": "Numbers With Repeated Digits", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/numbers-with-repeated-digits.json", "recommendation_by_id": "/v1/recommendations/by-id/1012.json" }, "1014": { "question_id": "1014", "task_id": "best-sightseeing-pair", "title": "Best Sightseeing Pair", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/best-sightseeing-pair.json", "recommendation_by_id": "/v1/recommendations/by-id/1014.json" }, "1024": { "question_id": "1024", "task_id": "video-stitching", "title": "Video Stitching", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/video-stitching.json", "recommendation_by_id": "/v1/recommendations/by-id/1024.json" }, "1025": { "question_id": "1025", "task_id": "divisor-game", "title": "Divisor Game", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/divisor-game.json", "recommendation_by_id": "/v1/recommendations/by-id/1025.json" }, "1027": { "question_id": "1027", "task_id": "longest-arithmetic-subsequence", "title": "Longest Arithmetic Subsequence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-arithmetic-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/1027.json" }, "1031": { "question_id": "1031", "task_id": "maximum-sum-of-two-non-overlapping-subarrays", "title": "Maximum Sum Of Two Non Overlapping Subarrays", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-sum-of-two-non-overlapping-subarrays.json", "recommendation_by_id": "/v1/recommendations/by-id/1031.json" }, "1035": { "question_id": "1035", "task_id": "uncrossed-lines", "title": "Uncrossed Lines", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/uncrossed-lines.json", "recommendation_by_id": "/v1/recommendations/by-id/1035.json" }, "1039": { "question_id": "1039", "task_id": "minimum-score-triangulation-of-polygon", "title": "Minimum Score Triangulation Of Polygon", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-score-triangulation-of-polygon.json", "recommendation_by_id": "/v1/recommendations/by-id/1039.json" }, "1043": { "question_id": "1043", "task_id": "partition-array-for-maximum-sum", "title": "Partition Array For Maximum Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/partition-array-for-maximum-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1043.json" }, "1048": { "question_id": "1048", "task_id": "longest-string-chain", "title": "Longest String Chain", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-string-chain.json", "recommendation_by_id": "/v1/recommendations/by-id/1048.json" }, "1049": { "question_id": "1049", "task_id": "last-stone-weight-ii", "title": "Last Stone Weight Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/last-stone-weight-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1049.json" }, "1062": { "question_id": "1062", "task_id": "longest-repeating-substring", "title": "Longest Repeating Substring", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-repeating-substring.json", "recommendation_by_id": "/v1/recommendations/by-id/1062.json" }, "1066": { "question_id": "1066", "task_id": "campus-bikes-ii", "title": "Campus Bikes Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/campus-bikes-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1066.json" }, "1067": { "question_id": "1067", "task_id": "digit-count-in-range", "title": "Digit Count In Range", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/digit-count-in-range.json", "recommendation_by_id": "/v1/recommendations/by-id/1067.json" }, "1092": { "question_id": "1092", "task_id": "shortest-common-supersequence", "title": "Shortest Common Supersequence", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/shortest-common-supersequence.json", "recommendation_by_id": "/v1/recommendations/by-id/1092.json" }, "1105": { "question_id": "1105", "task_id": "filling-bookcase-shelves", "title": "Filling Bookcase Shelves", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/filling-bookcase-shelves.json", "recommendation_by_id": "/v1/recommendations/by-id/1105.json" }, "1125": { "question_id": "1125", "task_id": "smallest-sufficient-team", "title": "Smallest Sufficient Team", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/smallest-sufficient-team.json", "recommendation_by_id": "/v1/recommendations/by-id/1125.json" }, "1130": { "question_id": "1130", "task_id": "minimum-cost-tree-from-leaf-values", "title": "Minimum Cost Tree From Leaf Values", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-tree-from-leaf-values.json", "recommendation_by_id": "/v1/recommendations/by-id/1130.json" }, "1137": { "question_id": "1137", "task_id": "n-th-tribonacci-number", "title": "N Th Tribonacci Number", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/n-th-tribonacci-number.json", "recommendation_by_id": "/v1/recommendations/by-id/1137.json" }, "1139": { "question_id": "1139", "task_id": "largest-1-bordered-square", "title": "Largest 1 Bordered Square", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/largest-1-bordered-square.json", "recommendation_by_id": "/v1/recommendations/by-id/1139.json" }, "1140": { "question_id": "1140", "task_id": "stone-game-ii", "title": "Stone Game Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/stone-game-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1140.json" }, "1143": { "question_id": "1143", "task_id": "longest-common-subsequence", "title": "Longest Common Subsequence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-common-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/1143.json" }, "1147": { "question_id": "1147", "task_id": "longest-chunked-palindrome-decomposition", "title": "Longest Chunked Palindrome Decomposition", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-chunked-palindrome-decomposition.json", "recommendation_by_id": "/v1/recommendations/by-id/1147.json" }, "115": { "question_id": "115", "task_id": "distinct-subsequences", "title": "Distinct Subsequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/distinct-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/115.json" }, "1155": { "question_id": "1155", "task_id": "number-of-dice-rolls-with-target-sum", "title": "Number Of Dice Rolls With Target Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-dice-rolls-with-target-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1155.json" }, "1162": { "question_id": "1162", "task_id": "as-far-from-land-as-possible", "title": "As Far From Land As Possible", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/as-far-from-land-as-possible.json", "recommendation_by_id": "/v1/recommendations/by-id/1162.json" }, "118": { "question_id": "118", "task_id": "pascals-triangle", "title": "Pascals Triangle", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/pascals-triangle.json", "recommendation_by_id": "/v1/recommendations/by-id/118.json" }, "1182": { "question_id": "1182", "task_id": "shortest-distance-to-target-color", "title": "Shortest Distance To Target Color", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/shortest-distance-to-target-color.json", "recommendation_by_id": "/v1/recommendations/by-id/1182.json" }, "1186": { "question_id": "1186", "task_id": "maximum-subarray-sum-with-one-deletion", "title": "Maximum Subarray Sum With One Deletion", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-subarray-sum-with-one-deletion.json", "recommendation_by_id": "/v1/recommendations/by-id/1186.json" }, "1187": { "question_id": "1187", "task_id": "make-array-strictly-increasing", "title": "Make Array Strictly Increasing", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/make-array-strictly-increasing.json", "recommendation_by_id": "/v1/recommendations/by-id/1187.json" }, "119": { "question_id": "119", "task_id": "pascals-triangle-ii", "title": "Pascals Triangle Ii", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/pascals-triangle-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/119.json" }, "1191": { "question_id": "1191", "task_id": "k-concatenation-maximum-sum", "title": "K Concatenation Maximum Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/k-concatenation-maximum-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1191.json" }, "120": { "question_id": "120", "task_id": "triangle", "title": "Triangle", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/triangle.json", "recommendation_by_id": "/v1/recommendations/by-id/120.json" }, "121": { "question_id": "121", "task_id": "best-time-to-buy-and-sell-stock", "title": "Best Time To Buy And Sell Stock", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/best-time-to-buy-and-sell-stock.json", "recommendation_by_id": "/v1/recommendations/by-id/121.json" }, "1216": { "question_id": "1216", "task_id": "valid-palindrome-iii", "title": "Valid Palindrome Iii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/valid-palindrome-iii.json", "recommendation_by_id": "/v1/recommendations/by-id/1216.json" }, "1218": { "question_id": "1218", "task_id": "longest-arithmetic-subsequence-of-given-difference", "title": "Longest Arithmetic Subsequence Of Given Difference", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-arithmetic-subsequence-of-given-difference.json", "recommendation_by_id": "/v1/recommendations/by-id/1218.json" }, "122": { "question_id": "122", "task_id": "best-time-to-buy-and-sell-stock-ii", "title": "Best Time To Buy And Sell Stock Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/best-time-to-buy-and-sell-stock-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/122.json" }, "1220": { "question_id": "1220", "task_id": "count-vowels-permutation", "title": "Count Vowels Permutation", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-vowels-permutation.json", "recommendation_by_id": "/v1/recommendations/by-id/1220.json" }, "1223": { "question_id": "1223", "task_id": "dice-roll-simulation", "title": "Dice Roll Simulation", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/dice-roll-simulation.json", "recommendation_by_id": "/v1/recommendations/by-id/1223.json" }, "1227": { "question_id": "1227", "task_id": "airplane-seat-assignment-probability", "title": "Airplane Seat Assignment Probability", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/airplane-seat-assignment-probability.json", "recommendation_by_id": "/v1/recommendations/by-id/1227.json" }, "123": { "question_id": "123", "task_id": "best-time-to-buy-and-sell-stock-iii", "title": "Best Time To Buy And Sell Stock Iii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/best-time-to-buy-and-sell-stock-iii.json", "recommendation_by_id": "/v1/recommendations/by-id/123.json" }, "1230": { "question_id": "1230", "task_id": "toss-strange-coins", "title": "Toss Strange Coins", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/toss-strange-coins.json", "recommendation_by_id": "/v1/recommendations/by-id/1230.json" }, "124": { "question_id": "124", "task_id": "binary-tree-maximum-path-sum", "title": "Binary Tree Maximum Path Sum", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/binary-tree-maximum-path-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/124.json" }, "1255": { "question_id": "1255", "task_id": "maximum-score-words-formed-by-letters", "title": "Maximum Score Words Formed By Letters", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-score-words-formed-by-letters.json", "recommendation_by_id": "/v1/recommendations/by-id/1255.json" }, "1259": { "question_id": "1259", "task_id": "handshakes-that-dont-cross", "title": "Handshakes That Dont Cross", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/handshakes-that-dont-cross.json", "recommendation_by_id": "/v1/recommendations/by-id/1259.json" }, "1262": { "question_id": "1262", "task_id": "greatest-sum-divisible-by-three", "title": "Greatest Sum Divisible By Three", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/greatest-sum-divisible-by-three.json", "recommendation_by_id": "/v1/recommendations/by-id/1262.json" }, "1269": { "question_id": "1269", "task_id": "number-of-ways-to-stay-in-the-same-place-after-some-steps", "title": "Number Of Ways To Stay In The Same Place After Some Steps", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-stay-in-the-same-place-after-some-steps.json", "recommendation_by_id": "/v1/recommendations/by-id/1269.json" }, "1277": { "question_id": "1277", "task_id": "count-square-submatrices-with-all-ones", "title": "Count Square Submatrices With All Ones", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-square-submatrices-with-all-ones.json", "recommendation_by_id": "/v1/recommendations/by-id/1277.json" }, "1278": { "question_id": "1278", "task_id": "palindrome-partitioning-iii", "title": "Palindrome Partitioning Iii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/palindrome-partitioning-iii.json", "recommendation_by_id": "/v1/recommendations/by-id/1278.json" }, "1289": { "question_id": "1289", "task_id": "minimum-falling-path-sum-ii", "title": "Minimum Falling Path Sum Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-falling-path-sum-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1289.json" }, "1301": { "question_id": "1301", "task_id": "number-of-paths-with-max-score", "title": "Number Of Paths With Max Score", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-paths-with-max-score.json", "recommendation_by_id": "/v1/recommendations/by-id/1301.json" }, "131": { "question_id": "131", "task_id": "palindrome-partitioning", "title": "Palindrome Partitioning", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/palindrome-partitioning.json", "recommendation_by_id": "/v1/recommendations/by-id/131.json" }, "1312": { "question_id": "1312", "task_id": "minimum-insertion-steps-to-make-a-string-palindrome", "title": "Minimum Insertion Steps To Make A String Palindrome", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-insertion-steps-to-make-a-string-palindrome.json", "recommendation_by_id": "/v1/recommendations/by-id/1312.json" }, "132": { "question_id": "132", "task_id": "palindrome-partitioning-ii", "title": "Palindrome Partitioning Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/palindrome-partitioning-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/132.json" }, "1320": { "question_id": "1320", "task_id": "minimum-distance-to-type-a-word-using-two-fingers", "title": "Minimum Distance To Type A Word Using Two Fingers", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-distance-to-type-a-word-using-two-fingers.json", "recommendation_by_id": "/v1/recommendations/by-id/1320.json" }, "1326": { "question_id": "1326", "task_id": "minimum-number-of-taps-to-open-to-water-a-garden", "title": "Minimum Number Of Taps To Open To Water A Garden", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-taps-to-open-to-water-a-garden.json", "recommendation_by_id": "/v1/recommendations/by-id/1326.json" }, "1334": { "question_id": "1334", "task_id": "find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance", "title": "Find The City With The Smallest Number Of Neighbors At A Threshold Distance", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.json", "recommendation_by_id": "/v1/recommendations/by-id/1334.json" }, "1335": { "question_id": "1335", "task_id": "minimum-difficulty-of-a-job-schedule", "title": "Minimum Difficulty Of A Job Schedule", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-difficulty-of-a-job-schedule.json", "recommendation_by_id": "/v1/recommendations/by-id/1335.json" }, "1340": { "question_id": "1340", "task_id": "jump-game-v", "title": "Jump Game V", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/jump-game-v.json", "recommendation_by_id": "/v1/recommendations/by-id/1340.json" }, "1349": { "question_id": "1349", "task_id": "maximum-students-taking-exam", "title": "Maximum Students Taking Exam", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-students-taking-exam.json", "recommendation_by_id": "/v1/recommendations/by-id/1349.json" }, "1359": { "question_id": "1359", "task_id": "count-all-valid-pickup-and-delivery-options", "title": "Count All Valid Pickup And Delivery Options", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-all-valid-pickup-and-delivery-options.json", "recommendation_by_id": "/v1/recommendations/by-id/1359.json" }, "1363": { "question_id": "1363", "task_id": "largest-multiple-of-three", "title": "Largest Multiple Of Three", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/largest-multiple-of-three.json", "recommendation_by_id": "/v1/recommendations/by-id/1363.json" }, "1372": { "question_id": "1372", "task_id": "longest-zigzag-path-in-a-binary-tree", "title": "Longest Zigzag Path In A Binary Tree", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-zigzag-path-in-a-binary-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/1372.json" }, "1373": { "question_id": "1373", "task_id": "maximum-sum-bst-in-binary-tree", "title": "Maximum Sum Bst In Binary Tree", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-sum-bst-in-binary-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/1373.json" }, "1387": { "question_id": "1387", "task_id": "sort-integers-by-the-power-value", "title": "Sort Integers By The Power Value", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/sort-integers-by-the-power-value.json", "recommendation_by_id": "/v1/recommendations/by-id/1387.json" }, "1388": { "question_id": "1388", "task_id": "pizza-with-3n-slices", "title": "Pizza With 3N Slices", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/pizza-with-3n-slices.json", "recommendation_by_id": "/v1/recommendations/by-id/1388.json" }, "139": { "question_id": "139", "task_id": "word-break", "title": "Word Break", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/word-break.json", "recommendation_by_id": "/v1/recommendations/by-id/139.json" }, "1395": { "question_id": "1395", "task_id": "count-number-of-teams", "title": "Count Number Of Teams", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-number-of-teams.json", "recommendation_by_id": "/v1/recommendations/by-id/1395.json" }, "1397": { "question_id": "1397", "task_id": "find-all-good-strings", "title": "Find All Good Strings", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-all-good-strings.json", "recommendation_by_id": "/v1/recommendations/by-id/1397.json" }, "140": { "question_id": "140", "task_id": "word-break-ii", "title": "Word Break Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/word-break-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/140.json" }, "1402": { "question_id": "1402", "task_id": "reducing-dishes", "title": "Reducing Dishes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/reducing-dishes.json", "recommendation_by_id": "/v1/recommendations/by-id/1402.json" }, "1406": { "question_id": "1406", "task_id": "stone-game-iii", "title": "Stone Game Iii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/stone-game-iii.json", "recommendation_by_id": "/v1/recommendations/by-id/1406.json" }, "1411": { "question_id": "1411", "task_id": "number-of-ways-to-paint-n-3-grid", "title": "Number Of Ways To Paint N 3 Grid", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-paint-n-3-grid.json", "recommendation_by_id": "/v1/recommendations/by-id/1411.json" }, "1416": { "question_id": "1416", "task_id": "restore-the-array", "title": "Restore The Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/restore-the-array.json", "recommendation_by_id": "/v1/recommendations/by-id/1416.json" }, "1420": { "question_id": "1420", "task_id": "build-array-where-you-can-find-the-maximum-exactly-k-comparisons", "title": "Build Array Where You Can Find The Maximum Exactly K Comparisons", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/build-array-where-you-can-find-the-maximum-exactly-k-comparisons.json", "recommendation_by_id": "/v1/recommendations/by-id/1420.json" }, "1425": { "question_id": "1425", "task_id": "constrained-subsequence-sum", "title": "Constrained Subsequence Sum", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/constrained-subsequence-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1425.json" }, "1434": { "question_id": "1434", "task_id": "number-of-ways-to-wear-different-hats-to-each-other", "title": "Number Of Ways To Wear Different Hats To Each Other", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-wear-different-hats-to-each-other.json", "recommendation_by_id": "/v1/recommendations/by-id/1434.json" }, "1444": { "question_id": "1444", "task_id": "number-of-ways-of-cutting-a-pizza", "title": "Number Of Ways Of Cutting A Pizza", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-of-cutting-a-pizza.json", "recommendation_by_id": "/v1/recommendations/by-id/1444.json" }, "1449": { "question_id": "1449", "task_id": "form-largest-integer-with-digits-that-add-up-to-target", "title": "Form Largest Integer With Digits That Add Up To Target", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/form-largest-integer-with-digits-that-add-up-to-target.json", "recommendation_by_id": "/v1/recommendations/by-id/1449.json" }, "1458": { "question_id": "1458", "task_id": "max-dot-product-of-two-subsequences", "title": "Max Dot Product Of Two Subsequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/max-dot-product-of-two-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/1458.json" }, "1463": { "question_id": "1463", "task_id": "cherry-pickup-ii", "title": "Cherry Pickup Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/cherry-pickup-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1463.json" }, "1467": { "question_id": "1467", "task_id": "probability-of-a-two-boxes-having-the-same-number-of-distinct-balls", "title": "Probability Of A Two Boxes Having The Same Number Of Distinct Balls", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls.json", "recommendation_by_id": "/v1/recommendations/by-id/1467.json" }, "1473": { "question_id": "1473", "task_id": "paint-house-iii", "title": "Paint House Iii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/paint-house-iii.json", "recommendation_by_id": "/v1/recommendations/by-id/1473.json" }, "1477": { "question_id": "1477", "task_id": "find-two-non-overlapping-sub-arrays-each-with-target-sum", "title": "Find Two Non Overlapping Sub Arrays Each With Target Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-two-non-overlapping-sub-arrays-each-with-target-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1477.json" }, "1478": { "question_id": "1478", "task_id": "allocate-mailboxes", "title": "Allocate Mailboxes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/allocate-mailboxes.json", "recommendation_by_id": "/v1/recommendations/by-id/1478.json" }, "1493": { "question_id": "1493", "task_id": "longest-subarray-of-1s-after-deleting-one-element", "title": "Longest Subarray Of 1S After Deleting One Element", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-subarray-of-1s-after-deleting-one-element.json", "recommendation_by_id": "/v1/recommendations/by-id/1493.json" }, "1494": { "question_id": "1494", "task_id": "parallel-courses-ii", "title": "Parallel Courses Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/parallel-courses-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1494.json" }, "1504": { "question_id": "1504", "task_id": "count-submatrices-with-all-ones", "title": "Count Submatrices With All Ones", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-submatrices-with-all-ones.json", "recommendation_by_id": "/v1/recommendations/by-id/1504.json" }, "1510": { "question_id": "1510", "task_id": "stone-game-iv", "title": "Stone Game Iv", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/stone-game-iv.json", "recommendation_by_id": "/v1/recommendations/by-id/1510.json" }, "152": { "question_id": "152", "task_id": "maximum-product-subarray", "title": "Maximum Product Subarray", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-product-subarray.json", "recommendation_by_id": "/v1/recommendations/by-id/152.json" }, "1524": { "question_id": "1524", "task_id": "number-of-sub-arrays-with-odd-sum", "title": "Number Of Sub Arrays With Odd Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-sub-arrays-with-odd-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1524.json" }, "1525": { "question_id": "1525", "task_id": "number-of-good-ways-to-split-a-string", "title": "Number Of Good Ways To Split A String", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-good-ways-to-split-a-string.json", "recommendation_by_id": "/v1/recommendations/by-id/1525.json" }, "1526": { "question_id": "1526", "task_id": "minimum-number-of-increments-on-subarrays-to-form-a-target-array", "title": "Minimum Number Of Increments On Subarrays To Form A Target Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-increments-on-subarrays-to-form-a-target-array.json", "recommendation_by_id": "/v1/recommendations/by-id/1526.json" }, "1531": { "question_id": "1531", "task_id": "string-compression-ii", "title": "String Compression Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/string-compression-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1531.json" }, "1537": { "question_id": "1537", "task_id": "get-the-maximum-score", "title": "Get The Maximum Score", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/get-the-maximum-score.json", "recommendation_by_id": "/v1/recommendations/by-id/1537.json" }, "1547": { "question_id": "1547", "task_id": "minimum-cost-to-cut-a-stick", "title": "Minimum Cost To Cut A Stick", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-cut-a-stick.json", "recommendation_by_id": "/v1/recommendations/by-id/1547.json" }, "1548": { "question_id": "1548", "task_id": "the-most-similar-path-in-a-graph", "title": "The Most Similar Path In A Graph", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/the-most-similar-path-in-a-graph.json", "recommendation_by_id": "/v1/recommendations/by-id/1548.json" }, "1553": { "question_id": "1553", "task_id": "minimum-number-of-days-to-eat-n-oranges", "title": "Minimum Number Of Days To Eat N Oranges", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-days-to-eat-n-oranges.json", "recommendation_by_id": "/v1/recommendations/by-id/1553.json" }, "1563": { "question_id": "1563", "task_id": "stone-game-v", "title": "Stone Game V", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/stone-game-v.json", "recommendation_by_id": "/v1/recommendations/by-id/1563.json" }, "1567": { "question_id": "1567", "task_id": "maximum-length-of-subarray-with-positive-product", "title": "Maximum Length Of Subarray With Positive Product", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-length-of-subarray-with-positive-product.json", "recommendation_by_id": "/v1/recommendations/by-id/1567.json" }, "1569": { "question_id": "1569", "task_id": "number-of-ways-to-reorder-array-to-get-same-bst", "title": "Number Of Ways To Reorder Array To Get Same Bst", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-reorder-array-to-get-same-bst.json", "recommendation_by_id": "/v1/recommendations/by-id/1569.json" }, "1575": { "question_id": "1575", "task_id": "count-all-possible-routes", "title": "Count All Possible Routes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-all-possible-routes.json", "recommendation_by_id": "/v1/recommendations/by-id/1575.json" }, "1578": { "question_id": "1578", "task_id": "minimum-time-to-make-rope-colorful", "title": "Minimum Time To Make Rope Colorful", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-time-to-make-rope-colorful.json", "recommendation_by_id": "/v1/recommendations/by-id/1578.json" }, "1594": { "question_id": "1594", "task_id": "maximum-non-negative-product-in-a-matrix", "title": "Maximum Non Negative Product In A Matrix", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-non-negative-product-in-a-matrix.json", "recommendation_by_id": "/v1/recommendations/by-id/1594.json" }, "1595": { "question_id": "1595", "task_id": "minimum-cost-to-connect-two-groups-of-points", "title": "Minimum Cost To Connect Two Groups Of Points", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-connect-two-groups-of-points.json", "recommendation_by_id": "/v1/recommendations/by-id/1595.json" }, "1611": { "question_id": "1611", "task_id": "minimum-one-bit-operations-to-make-integers-zero", "title": "Minimum One Bit Operations To Make Integers Zero", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-one-bit-operations-to-make-integers-zero.json", "recommendation_by_id": "/v1/recommendations/by-id/1611.json" }, "1617": { "question_id": "1617", "task_id": "count-subtrees-with-max-distance-between-cities", "title": "Count Subtrees With Max Distance Between Cities", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-subtrees-with-max-distance-between-cities.json", "recommendation_by_id": "/v1/recommendations/by-id/1617.json" }, "1621": { "question_id": "1621", "task_id": "number-of-sets-of-k-non-overlapping-line-segments", "title": "Number Of Sets Of K Non Overlapping Line Segments", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-sets-of-k-non-overlapping-line-segments.json", "recommendation_by_id": "/v1/recommendations/by-id/1621.json" }, "1626": { "question_id": "1626", "task_id": "best-team-with-no-conflicts", "title": "Best Team With No Conflicts", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/best-team-with-no-conflicts.json", "recommendation_by_id": "/v1/recommendations/by-id/1626.json" }, "1638": { "question_id": "1638", "task_id": "count-substrings-that-differ-by-one-character", "title": "Count Substrings That Differ By One Character", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-substrings-that-differ-by-one-character.json", "recommendation_by_id": "/v1/recommendations/by-id/1638.json" }, "1639": { "question_id": "1639", "task_id": "number-of-ways-to-form-a-target-string-given-a-dictionary", "title": "Number Of Ways To Form A Target String Given A Dictionary", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-form-a-target-string-given-a-dictionary.json", "recommendation_by_id": "/v1/recommendations/by-id/1639.json" }, "1641": { "question_id": "1641", "task_id": "count-sorted-vowel-strings", "title": "Count Sorted Vowel Strings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-sorted-vowel-strings.json", "recommendation_by_id": "/v1/recommendations/by-id/1641.json" }, "1643": { "question_id": "1643", "task_id": "kth-smallest-instructions", "title": "Kth Smallest Instructions", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/kth-smallest-instructions.json", "recommendation_by_id": "/v1/recommendations/by-id/1643.json" }, "1653": { "question_id": "1653", "task_id": "minimum-deletions-to-make-string-balanced", "title": "Minimum Deletions To Make String Balanced", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-deletions-to-make-string-balanced.json", "recommendation_by_id": "/v1/recommendations/by-id/1653.json" }, "1654": { "question_id": "1654", "task_id": "minimum-jumps-to-reach-home", "title": "Minimum Jumps To Reach Home", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-jumps-to-reach-home.json", "recommendation_by_id": "/v1/recommendations/by-id/1654.json" }, "1655": { "question_id": "1655", "task_id": "distribute-repeating-integers", "title": "Distribute Repeating Integers", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/distribute-repeating-integers.json", "recommendation_by_id": "/v1/recommendations/by-id/1655.json" }, "1659": { "question_id": "1659", "task_id": "maximize-grid-happiness", "title": "Maximize Grid Happiness", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximize-grid-happiness.json", "recommendation_by_id": "/v1/recommendations/by-id/1659.json" }, "1668": { "question_id": "1668", "task_id": "maximum-repeating-substring", "title": "Maximum Repeating Substring", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-repeating-substring.json", "recommendation_by_id": "/v1/recommendations/by-id/1668.json" }, "1671": { "question_id": "1671", "task_id": "minimum-number-of-removals-to-make-mountain-array", "title": "Minimum Number Of Removals To Make Mountain Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-removals-to-make-mountain-array.json", "recommendation_by_id": "/v1/recommendations/by-id/1671.json" }, "1681": { "question_id": "1681", "task_id": "minimum-incompatibility", "title": "Minimum Incompatibility", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-incompatibility.json", "recommendation_by_id": "/v1/recommendations/by-id/1681.json" }, "1682": { "question_id": "1682", "task_id": "longest-palindromic-subsequence-ii", "title": "Longest Palindromic Subsequence Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-palindromic-subsequence-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1682.json" }, "1687": { "question_id": "1687", "task_id": "delivering-boxes-from-storage-to-ports", "title": "Delivering Boxes From Storage To Ports", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/delivering-boxes-from-storage-to-ports.json", "recommendation_by_id": "/v1/recommendations/by-id/1687.json" }, "1690": { "question_id": "1690", "task_id": "stone-game-vii", "title": "Stone Game Vii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/stone-game-vii.json", "recommendation_by_id": "/v1/recommendations/by-id/1690.json" }, "1691": { "question_id": "1691", "task_id": "maximum-height-by-stacking-cuboids", "title": "Maximum Height By Stacking Cuboids", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-height-by-stacking-cuboids.json", "recommendation_by_id": "/v1/recommendations/by-id/1691.json" }, "1692": { "question_id": "1692", "task_id": "count-ways-to-distribute-candies", "title": "Count Ways To Distribute Candies", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-ways-to-distribute-candies.json", "recommendation_by_id": "/v1/recommendations/by-id/1692.json" }, "1696": { "question_id": "1696", "task_id": "jump-game-vi", "title": "Jump Game Vi", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/jump-game-vi.json", "recommendation_by_id": "/v1/recommendations/by-id/1696.json" }, "1714": { "question_id": "1714", "task_id": "sum-of-special-evenly-spaced-elements-in-array", "title": "Sum Of Special Evenly Spaced Elements In Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/sum-of-special-evenly-spaced-elements-in-array.json", "recommendation_by_id": "/v1/recommendations/by-id/1714.json" }, "1723": { "question_id": "1723", "task_id": "find-minimum-time-to-finish-all-jobs", "title": "Find Minimum Time To Finish All Jobs", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-minimum-time-to-finish-all-jobs.json", "recommendation_by_id": "/v1/recommendations/by-id/1723.json" }, "1728": { "question_id": "1728", "task_id": "cat-and-mouse-ii", "title": "Cat And Mouse Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/cat-and-mouse-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1728.json" }, "174": { "question_id": "174", "task_id": "dungeon-game", "title": "Dungeon Game", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/dungeon-game.json", "recommendation_by_id": "/v1/recommendations/by-id/174.json" }, "1745": { "question_id": "1745", "task_id": "palindrome-partitioning-iv", "title": "Palindrome Partitioning Iv", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/palindrome-partitioning-iv.json", "recommendation_by_id": "/v1/recommendations/by-id/1745.json" }, "1746": { "question_id": "1746", "task_id": "maximum-subarray-sum-after-one-operation", "title": "Maximum Subarray Sum After One Operation", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-subarray-sum-after-one-operation.json", "recommendation_by_id": "/v1/recommendations/by-id/1746.json" }, "1749": { "question_id": "1749", "task_id": "maximum-absolute-sum-of-any-subarray", "title": "Maximum Absolute Sum Of Any Subarray", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-absolute-sum-of-any-subarray.json", "recommendation_by_id": "/v1/recommendations/by-id/1749.json" }, "1751": { "question_id": "1751", "task_id": "maximum-number-of-events-that-can-be-attended-ii", "title": "Maximum Number Of Events That Can Be Attended Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-events-that-can-be-attended-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/1751.json" }, "1755": { "question_id": "1755", "task_id": "closest-subsequence-sum", "title": "Closest Subsequence Sum", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/closest-subsequence-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1755.json" }, "1770": { "question_id": "1770", "task_id": "maximum-score-from-performing-multiplication-operations", "title": "Maximum Score From Performing Multiplication Operations", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-score-from-performing-multiplication-operations.json", "recommendation_by_id": "/v1/recommendations/by-id/1770.json" }, "1771": { "question_id": "1771", "task_id": "maximize-palindrome-length-from-subsequences", "title": "Maximize Palindrome Length From Subsequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximize-palindrome-length-from-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/1771.json" }, "1774": { "question_id": "1774", "task_id": "closest-dessert-cost", "title": "Closest Dessert Cost", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/closest-dessert-cost.json", "recommendation_by_id": "/v1/recommendations/by-id/1774.json" }, "1786": { "question_id": "1786", "task_id": "number-of-restricted-paths-from-first-to-last-node", "title": "Number Of Restricted Paths From First To Last Node", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-restricted-paths-from-first-to-last-node.json", "recommendation_by_id": "/v1/recommendations/by-id/1786.json" }, "1787": { "question_id": "1787", "task_id": "make-the-xor-of-all-segments-equal-to-zero", "title": "Make The Xor Of All Segments Equal To Zero", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/make-the-xor-of-all-segments-equal-to-zero.json", "recommendation_by_id": "/v1/recommendations/by-id/1787.json" }, "1815": { "question_id": "1815", "task_id": "maximum-number-of-groups-getting-fresh-donuts", "title": "Maximum Number Of Groups Getting Fresh Donuts", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-groups-getting-fresh-donuts.json", "recommendation_by_id": "/v1/recommendations/by-id/1815.json" }, "1824": { "question_id": "1824", "task_id": "minimum-sideway-jumps", "title": "Minimum Sideway Jumps", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-sideway-jumps.json", "recommendation_by_id": "/v1/recommendations/by-id/1824.json" }, "1857": { "question_id": "1857", "task_id": "largest-color-value-in-a-directed-graph", "title": "Largest Color Value In A Directed Graph", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/largest-color-value-in-a-directed-graph.json", "recommendation_by_id": "/v1/recommendations/by-id/1857.json" }, "1866": { "question_id": "1866", "task_id": "number-of-ways-to-rearrange-sticks-with-k-sticks-visible", "title": "Number Of Ways To Rearrange Sticks With K Sticks Visible", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-rearrange-sticks-with-k-sticks-visible.json", "recommendation_by_id": "/v1/recommendations/by-id/1866.json" }, "1871": { "question_id": "1871", "task_id": "jump-game-vii", "title": "Jump Game Vii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/jump-game-vii.json", "recommendation_by_id": "/v1/recommendations/by-id/1871.json" }, "1872": { "question_id": "1872", "task_id": "stone-game-viii", "title": "Stone Game Viii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/stone-game-viii.json", "recommendation_by_id": "/v1/recommendations/by-id/1872.json" }, "1879": { "question_id": "1879", "task_id": "minimum-xor-sum-of-two-arrays", "title": "Minimum Xor Sum Of Two Arrays", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-xor-sum-of-two-arrays.json", "recommendation_by_id": "/v1/recommendations/by-id/1879.json" }, "188": { "question_id": "188", "task_id": "best-time-to-buy-and-sell-stock-iv", "title": "Best Time To Buy And Sell Stock Iv", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/best-time-to-buy-and-sell-stock-iv.json", "recommendation_by_id": "/v1/recommendations/by-id/188.json" }, "1883": { "question_id": "1883", "task_id": "minimum-skips-to-arrive-at-meeting-on-time", "title": "Minimum Skips To Arrive At Meeting On Time", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-skips-to-arrive-at-meeting-on-time.json", "recommendation_by_id": "/v1/recommendations/by-id/1883.json" }, "1884": { "question_id": "1884", "task_id": "egg-drop-with-2-eggs-and-n-floors", "title": "Egg Drop With 2 Eggs And N Floors", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/egg-drop-with-2-eggs-and-n-floors.json", "recommendation_by_id": "/v1/recommendations/by-id/1884.json" }, "1888": { "question_id": "1888", "task_id": "minimum-number-of-flips-to-make-the-binary-string-alternating", "title": "Minimum Number Of Flips To Make The Binary String Alternating", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-flips-to-make-the-binary-string-alternating.json", "recommendation_by_id": "/v1/recommendations/by-id/1888.json" }, "1896": { "question_id": "1896", "task_id": "minimum-cost-to-change-the-final-value-of-expression", "title": "Minimum Cost To Change The Final Value Of Expression", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-change-the-final-value-of-expression.json", "recommendation_by_id": "/v1/recommendations/by-id/1896.json" }, "1900": { "question_id": "1900", "task_id": "the-earliest-and-latest-rounds-where-players-compete", "title": "The Earliest And Latest Rounds Where Players Compete", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/the-earliest-and-latest-rounds-where-players-compete.json", "recommendation_by_id": "/v1/recommendations/by-id/1900.json" }, "1908": { "question_id": "1908", "task_id": "game-of-nim", "title": "Game Of Nim", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/game-of-nim.json", "recommendation_by_id": "/v1/recommendations/by-id/1908.json" }, "1911": { "question_id": "1911", "task_id": "maximum-alternating-subsequence-sum", "title": "Maximum Alternating Subsequence Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-alternating-subsequence-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1911.json" }, "1916": { "question_id": "1916", "task_id": "count-ways-to-build-rooms-in-an-ant-colony", "title": "Count Ways To Build Rooms In An Ant Colony", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-ways-to-build-rooms-in-an-ant-colony.json", "recommendation_by_id": "/v1/recommendations/by-id/1916.json" }, "1928": { "question_id": "1928", "task_id": "minimum-cost-to-reach-destination-in-time", "title": "Minimum Cost To Reach Destination In Time", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-reach-destination-in-time.json", "recommendation_by_id": "/v1/recommendations/by-id/1928.json" }, "1931": { "question_id": "1931", "task_id": "painting-a-grid-with-three-different-colors", "title": "Painting A Grid With Three Different Colors", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/painting-a-grid-with-three-different-colors.json", "recommendation_by_id": "/v1/recommendations/by-id/1931.json" }, "1937": { "question_id": "1937", "task_id": "maximum-number-of-points-with-cost", "title": "Maximum Number Of Points With Cost", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-points-with-cost.json", "recommendation_by_id": "/v1/recommendations/by-id/1937.json" }, "1947": { "question_id": "1947", "task_id": "maximum-compatibility-score-sum", "title": "Maximum Compatibility Score Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-compatibility-score-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/1947.json" }, "1955": { "question_id": "1955", "task_id": "count-number-of-special-subsequences", "title": "Count Number Of Special Subsequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-number-of-special-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/1955.json" }, "1959": { "question_id": "1959", "task_id": "minimum-total-space-wasted-with-k-resizing-operations", "title": "Minimum Total Space Wasted With K Resizing Operations", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-total-space-wasted-with-k-resizing-operations.json", "recommendation_by_id": "/v1/recommendations/by-id/1959.json" }, "1976": { "question_id": "1976", "task_id": "number-of-ways-to-arrive-at-destination", "title": "Number Of Ways To Arrive At Destination", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-arrive-at-destination.json", "recommendation_by_id": "/v1/recommendations/by-id/1976.json" }, "1977": { "question_id": "1977", "task_id": "number-of-ways-to-separate-numbers", "title": "Number Of Ways To Separate Numbers", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-separate-numbers.json", "recommendation_by_id": "/v1/recommendations/by-id/1977.json" }, "198": { "question_id": "198", "task_id": "house-robber", "title": "House Robber", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/house-robber.json", "recommendation_by_id": "/v1/recommendations/by-id/198.json" }, "1981": { "question_id": "1981", "task_id": "minimize-the-difference-between-target-and-chosen-elements", "title": "Minimize The Difference Between Target And Chosen Elements", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimize-the-difference-between-target-and-chosen-elements.json", "recommendation_by_id": "/v1/recommendations/by-id/1981.json" }, "1986": { "question_id": "1986", "task_id": "minimum-number-of-work-sessions-to-finish-the-tasks", "title": "Minimum Number Of Work Sessions To Finish The Tasks", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-work-sessions-to-finish-the-tasks.json", "recommendation_by_id": "/v1/recommendations/by-id/1986.json" }, "1987": { "question_id": "1987", "task_id": "number-of-unique-good-subsequences", "title": "Number Of Unique Good Subsequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-unique-good-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/1987.json" }, "1994": { "question_id": "1994", "task_id": "the-number-of-good-subsets", "title": "The Number Of Good Subsets", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/the-number-of-good-subsets.json", "recommendation_by_id": "/v1/recommendations/by-id/1994.json" }, "1997": { "question_id": "1997", "task_id": "first-day-where-you-have-been-in-all-the-rooms", "title": "First Day Where You Have Been In All The Rooms", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/first-day-where-you-have-been-in-all-the-rooms.json", "recommendation_by_id": "/v1/recommendations/by-id/1997.json" }, "2002": { "question_id": "2002", "task_id": "maximum-product-of-the-length-of-two-palindromic-subsequences", "title": "Maximum Product Of The Length Of Two Palindromic Subsequences", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-product-of-the-length-of-two-palindromic-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/2002.json" }, "2003": { "question_id": "2003", "task_id": "smallest-missing-genetic-value-in-each-subtree", "title": "Smallest Missing Genetic Value In Each Subtree", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/smallest-missing-genetic-value-in-each-subtree.json", "recommendation_by_id": "/v1/recommendations/by-id/2003.json" }, "2005": { "question_id": "2005", "task_id": "subtree-removal-game-with-fibonacci-tree", "title": "Subtree Removal Game With Fibonacci Tree", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/subtree-removal-game-with-fibonacci-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/2005.json" }, "2008": { "question_id": "2008", "task_id": "maximum-earnings-from-taxi", "title": "Maximum Earnings From Taxi", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-earnings-from-taxi.json", "recommendation_by_id": "/v1/recommendations/by-id/2008.json" }, "2019": { "question_id": "2019", "task_id": "the-score-of-students-solving-math-expression", "title": "The Score Of Students Solving Math Expression", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/the-score-of-students-solving-math-expression.json", "recommendation_by_id": "/v1/recommendations/by-id/2019.json" }, "2035": { "question_id": "2035", "task_id": "partition-array-into-two-arrays-to-minimize-sum-difference", "title": "Partition Array Into Two Arrays To Minimize Sum Difference", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/partition-array-into-two-arrays-to-minimize-sum-difference.json", "recommendation_by_id": "/v1/recommendations/by-id/2035.json" }, "2036": { "question_id": "2036", "task_id": "maximum-alternating-subarray-sum", "title": "Maximum Alternating Subarray Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-alternating-subarray-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/2036.json" }, "2050": { "question_id": "2050", "task_id": "parallel-courses-iii", "title": "Parallel Courses Iii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/parallel-courses-iii.json", "recommendation_by_id": "/v1/recommendations/by-id/2050.json" }, "2052": { "question_id": "2052", "task_id": "minimum-cost-to-separate-sentence-into-rows", "title": "Minimum Cost To Separate Sentence Into Rows", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-separate-sentence-into-rows.json", "recommendation_by_id": "/v1/recommendations/by-id/2052.json" }, "2054": { "question_id": "2054", "task_id": "two-best-non-overlapping-events", "title": "Two Best Non Overlapping Events", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/two-best-non-overlapping-events.json", "recommendation_by_id": "/v1/recommendations/by-id/2054.json" }, "2060": { "question_id": "2060", "task_id": "check-if-an-original-string-exists-given-two-encoded-strings", "title": "Check If An Original String Exists Given Two Encoded Strings", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/check-if-an-original-string-exists-given-two-encoded-strings.json", "recommendation_by_id": "/v1/recommendations/by-id/2060.json" }, "2063": { "question_id": "2063", "task_id": "vowels-of-all-substrings", "title": "Vowels Of All Substrings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/vowels-of-all-substrings.json", "recommendation_by_id": "/v1/recommendations/by-id/2063.json" }, "2086": { "question_id": "2086", "task_id": "minimum-number-of-food-buckets-to-feed-the-hamsters", "title": "Minimum Number Of Food Buckets To Feed The Hamsters", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-food-buckets-to-feed-the-hamsters.json", "recommendation_by_id": "/v1/recommendations/by-id/2086.json" }, "2088": { "question_id": "2088", "task_id": "count-fertile-pyramids-in-a-land", "title": "Count Fertile Pyramids In A Land", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-fertile-pyramids-in-a-land.json", "recommendation_by_id": "/v1/recommendations/by-id/2088.json" }, "2100": { "question_id": "2100", "task_id": "find-good-days-to-rob-the-bank", "title": "Find Good Days To Rob The Bank", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-good-days-to-rob-the-bank.json", "recommendation_by_id": "/v1/recommendations/by-id/2100.json" }, "2110": { "question_id": "2110", "task_id": "number-of-smooth-descent-periods-of-a-stock", "title": "Number Of Smooth Descent Periods Of A Stock", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-smooth-descent-periods-of-a-stock.json", "recommendation_by_id": "/v1/recommendations/by-id/2110.json" }, "213": { "question_id": "213", "task_id": "house-robber-ii", "title": "House Robber Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/house-robber-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/213.json" }, "2140": { "question_id": "2140", "task_id": "solving-questions-with-brainpower", "title": "Solving Questions With Brainpower", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/solving-questions-with-brainpower.json", "recommendation_by_id": "/v1/recommendations/by-id/2140.json" }, "2143": { "question_id": "2143", "task_id": "choose-numbers-from-two-arrays-in-range", "title": "Choose Numbers From Two Arrays In Range", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/choose-numbers-from-two-arrays-in-range.json", "recommendation_by_id": "/v1/recommendations/by-id/2143.json" }, "2147": { "question_id": "2147", "task_id": "number-of-ways-to-divide-a-long-corridor", "title": "Number Of Ways To Divide A Long Corridor", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-divide-a-long-corridor.json", "recommendation_by_id": "/v1/recommendations/by-id/2147.json" }, "2152": { "question_id": "2152", "task_id": "minimum-number-of-lines-to-cover-points", "title": "Minimum Number Of Lines To Cover Points", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-lines-to-cover-points.json", "recommendation_by_id": "/v1/recommendations/by-id/2152.json" }, "2163": { "question_id": "2163", "task_id": "minimum-difference-in-sums-after-removal-of-elements", "title": "Minimum Difference In Sums After Removal Of Elements", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-difference-in-sums-after-removal-of-elements.json", "recommendation_by_id": "/v1/recommendations/by-id/2163.json" }, "2167": { "question_id": "2167", "task_id": "minimum-time-to-remove-all-cars-containing-illegal-goods", "title": "Minimum Time To Remove All Cars Containing Illegal Goods", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-time-to-remove-all-cars-containing-illegal-goods.json", "recommendation_by_id": "/v1/recommendations/by-id/2167.json" }, "2172": { "question_id": "2172", "task_id": "maximum-and-sum-of-array", "title": "Maximum And Sum Of Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-and-sum-of-array.json", "recommendation_by_id": "/v1/recommendations/by-id/2172.json" }, "2184": { "question_id": "2184", "task_id": "number-of-ways-to-build-sturdy-brick-wall", "title": "Number Of Ways To Build Sturdy Brick Wall", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-build-sturdy-brick-wall.json", "recommendation_by_id": "/v1/recommendations/by-id/2184.json" }, "2188": { "question_id": "2188", "task_id": "minimum-time-to-finish-the-race", "title": "Minimum Time To Finish The Race", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-time-to-finish-the-race.json", "recommendation_by_id": "/v1/recommendations/by-id/2188.json" }, "2189": { "question_id": "2189", "task_id": "number-of-ways-to-build-house-of-cards", "title": "Number Of Ways To Build House Of Cards", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-build-house-of-cards.json", "recommendation_by_id": "/v1/recommendations/by-id/2189.json" }, "22": { "question_id": "22", "task_id": "generate-parentheses", "title": "Generate Parentheses", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/generate-parentheses.json", "recommendation_by_id": "/v1/recommendations/by-id/22.json" }, "2209": { "question_id": "2209", "task_id": "minimum-white-tiles-after-covering-with-carpets", "title": "Minimum White Tiles After Covering With Carpets", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-white-tiles-after-covering-with-carpets.json", "recommendation_by_id": "/v1/recommendations/by-id/2209.json" }, "221": { "question_id": "221", "task_id": "maximal-square", "title": "Maximal Square", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximal-square.json", "recommendation_by_id": "/v1/recommendations/by-id/221.json" }, "2218": { "question_id": "2218", "task_id": "maximum-value-of-k-coins-from-piles", "title": "Maximum Value Of K Coins From Piles", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-value-of-k-coins-from-piles.json", "recommendation_by_id": "/v1/recommendations/by-id/2218.json" }, "2222": { "question_id": "2222", "task_id": "number-of-ways-to-select-buildings", "title": "Number Of Ways To Select Buildings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-select-buildings.json", "recommendation_by_id": "/v1/recommendations/by-id/2222.json" }, "2247": { "question_id": "2247", "task_id": "maximum-cost-of-trip-with-k-highways", "title": "Maximum Cost Of Trip With K Highways", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-cost-of-trip-with-k-highways.json", "recommendation_by_id": "/v1/recommendations/by-id/2247.json" }, "2262": { "question_id": "2262", "task_id": "total-appeal-of-a-string", "title": "Total Appeal Of A String", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/total-appeal-of-a-string.json", "recommendation_by_id": "/v1/recommendations/by-id/2262.json" }, "2263": { "question_id": "2263", "task_id": "make-array-non-decreasing-or-non-increasing", "title": "Make Array Non Decreasing Or Non Increasing", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/make-array-non-decreasing-or-non-increasing.json", "recommendation_by_id": "/v1/recommendations/by-id/2263.json" }, "2266": { "question_id": "2266", "task_id": "count-number-of-texts", "title": "Count Number Of Texts", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-number-of-texts.json", "recommendation_by_id": "/v1/recommendations/by-id/2266.json" }, "2267": { "question_id": "2267", "task_id": "check-if-there-is-a-valid-parentheses-string-path", "title": "Check If There Is A Valid Parentheses String Path", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/check-if-there-is-a-valid-parentheses-string-path.json", "recommendation_by_id": "/v1/recommendations/by-id/2267.json" }, "2272": { "question_id": "2272", "task_id": "substring-with-largest-variance", "title": "Substring With Largest Variance", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/substring-with-largest-variance.json", "recommendation_by_id": "/v1/recommendations/by-id/2272.json" }, "2291": { "question_id": "2291", "task_id": "maximum-profit-from-trading-stocks", "title": "Maximum Profit From Trading Stocks", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-profit-from-trading-stocks.json", "recommendation_by_id": "/v1/recommendations/by-id/2291.json" }, "2297": { "question_id": "2297", "task_id": "jump-game-viii", "title": "Jump Game Viii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/jump-game-viii.json", "recommendation_by_id": "/v1/recommendations/by-id/2297.json" }, "2304": { "question_id": "2304", "task_id": "minimum-path-cost-in-a-grid", "title": "Minimum Path Cost In A Grid", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-path-cost-in-a-grid.json", "recommendation_by_id": "/v1/recommendations/by-id/2304.json" }, "2305": { "question_id": "2305", "task_id": "fair-distribution-of-cookies", "title": "Fair Distribution Of Cookies", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/fair-distribution-of-cookies.json", "recommendation_by_id": "/v1/recommendations/by-id/2305.json" }, "2310": { "question_id": "2310", "task_id": "sum-of-numbers-with-units-digit-k", "title": "Sum Of Numbers With Units Digit K", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/sum-of-numbers-with-units-digit-k.json", "recommendation_by_id": "/v1/recommendations/by-id/2310.json" }, "2311": { "question_id": "2311", "task_id": "longest-binary-subsequence-less-than-or-equal-to-k", "title": "Longest Binary Subsequence Less Than Or Equal To K", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-binary-subsequence-less-than-or-equal-to-k.json", "recommendation_by_id": "/v1/recommendations/by-id/2311.json" }, "2312": { "question_id": "2312", "task_id": "selling-pieces-of-wood", "title": "Selling Pieces Of Wood", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/selling-pieces-of-wood.json", "recommendation_by_id": "/v1/recommendations/by-id/2312.json" }, "2318": { "question_id": "2318", "task_id": "number-of-distinct-roll-sequences", "title": "Number Of Distinct Roll Sequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-distinct-roll-sequences.json", "recommendation_by_id": "/v1/recommendations/by-id/2318.json" }, "2320": { "question_id": "2320", "task_id": "count-number-of-ways-to-place-houses", "title": "Count Number Of Ways To Place Houses", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-number-of-ways-to-place-houses.json", "recommendation_by_id": "/v1/recommendations/by-id/2320.json" }, "2321": { "question_id": "2321", "task_id": "maximum-score-of-spliced-array", "title": "Maximum Score Of Spliced Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-score-of-spliced-array.json", "recommendation_by_id": "/v1/recommendations/by-id/2321.json" }, "2327": { "question_id": "2327", "task_id": "number-of-people-aware-of-a-secret", "title": "Number Of People Aware Of A Secret", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-people-aware-of-a-secret.json", "recommendation_by_id": "/v1/recommendations/by-id/2327.json" }, "2328": { "question_id": "2328", "task_id": "number-of-increasing-paths-in-a-grid", "title": "Number Of Increasing Paths In A Grid", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-increasing-paths-in-a-grid.json", "recommendation_by_id": "/v1/recommendations/by-id/2328.json" }, "233": { "question_id": "233", "task_id": "number-of-digit-one", "title": "Number Of Digit One", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-digit-one.json", "recommendation_by_id": "/v1/recommendations/by-id/233.json" }, "2338": { "question_id": "2338", "task_id": "count-the-number-of-ideal-arrays", "title": "Count The Number Of Ideal Arrays", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-the-number-of-ideal-arrays.json", "recommendation_by_id": "/v1/recommendations/by-id/2338.json" }, "2355": { "question_id": "2355", "task_id": "maximum-number-of-books-you-can-take", "title": "Maximum Number Of Books You Can Take", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-books-you-can-take.json", "recommendation_by_id": "/v1/recommendations/by-id/2355.json" }, "2361": { "question_id": "2361", "task_id": "minimum-costs-using-the-train-line", "title": "Minimum Costs Using The Train Line", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-costs-using-the-train-line.json", "recommendation_by_id": "/v1/recommendations/by-id/2361.json" }, "2369": { "question_id": "2369", "task_id": "check-if-there-is-a-valid-partition-for-the-array", "title": "Check If There Is A Valid Partition For The Array", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/check-if-there-is-a-valid-partition-for-the-array.json", "recommendation_by_id": "/v1/recommendations/by-id/2369.json" }, "2370": { "question_id": "2370", "task_id": "longest-ideal-subsequence", "title": "Longest Ideal Subsequence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-ideal-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/2370.json" }, "2376": { "question_id": "2376", "task_id": "count-special-integers", "title": "Count Special Integers", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-special-integers.json", "recommendation_by_id": "/v1/recommendations/by-id/2376.json" }, "2378": { "question_id": "2378", "task_id": "choose-edges-to-maximize-score-in-a-tree", "title": "Choose Edges To Maximize Score In A Tree", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/choose-edges-to-maximize-score-in-a-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/2378.json" }, "2380": { "question_id": "2380", "task_id": "time-needed-to-rearrange-a-binary-string", "title": "Time Needed To Rearrange A Binary String", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/time-needed-to-rearrange-a-binary-string.json", "recommendation_by_id": "/v1/recommendations/by-id/2380.json" }, "2393": { "question_id": "2393", "task_id": "count-strictly-increasing-subarrays", "title": "Count Strictly Increasing Subarrays", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-strictly-increasing-subarrays.json", "recommendation_by_id": "/v1/recommendations/by-id/2393.json" }, "2400": { "question_id": "2400", "task_id": "number-of-ways-to-reach-a-position-after-exactly-k-steps", "title": "Number Of Ways To Reach A Position After Exactly K Steps", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-reach-a-position-after-exactly-k-steps.json", "recommendation_by_id": "/v1/recommendations/by-id/2400.json" }, "2403": { "question_id": "2403", "task_id": "minimum-time-to-kill-all-monsters", "title": "Minimum Time To Kill All Monsters", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-time-to-kill-all-monsters.json", "recommendation_by_id": "/v1/recommendations/by-id/2403.json" }, "2407": { "question_id": "2407", "task_id": "longest-increasing-subsequence-ii", "title": "Longest Increasing Subsequence Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-increasing-subsequence-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/2407.json" }, "241": { "question_id": "241", "task_id": "different-ways-to-add-parentheses", "title": "Different Ways To Add Parentheses", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/different-ways-to-add-parentheses.json", "recommendation_by_id": "/v1/recommendations/by-id/241.json" }, "2420": { "question_id": "2420", "task_id": "find-all-good-indices", "title": "Find All Good Indices", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-all-good-indices.json", "recommendation_by_id": "/v1/recommendations/by-id/2420.json" }, "2430": { "question_id": "2430", "task_id": "maximum-deletions-on-a-string", "title": "Maximum Deletions On A String", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-deletions-on-a-string.json", "recommendation_by_id": "/v1/recommendations/by-id/2430.json" }, "2431": { "question_id": "2431", "task_id": "maximize-total-tastiness-of-purchased-fruits", "title": "Maximize Total Tastiness Of Purchased Fruits", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximize-total-tastiness-of-purchased-fruits.json", "recommendation_by_id": "/v1/recommendations/by-id/2431.json" }, "2435": { "question_id": "2435", "task_id": "paths-in-matrix-whose-sum-is-divisible-by-k", "title": "Paths In Matrix Whose Sum Is Divisible By K", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/paths-in-matrix-whose-sum-is-divisible-by-k.json", "recommendation_by_id": "/v1/recommendations/by-id/2435.json" }, "2436": { "question_id": "2436", "task_id": "minimum-split-into-subarrays-with-gcd-greater-than-one", "title": "Minimum Split Into Subarrays With Gcd Greater Than One", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-split-into-subarrays-with-gcd-greater-than-one.json", "recommendation_by_id": "/v1/recommendations/by-id/2436.json" }, "2439": { "question_id": "2439", "task_id": "minimize-maximum-of-array", "title": "Minimize Maximum Of Array", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimize-maximum-of-array.json", "recommendation_by_id": "/v1/recommendations/by-id/2439.json" }, "2463": { "question_id": "2463", "task_id": "minimum-total-distance-traveled", "title": "Minimum Total Distance Traveled", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-total-distance-traveled.json", "recommendation_by_id": "/v1/recommendations/by-id/2463.json" }, "2464": { "question_id": "2464", "task_id": "minimum-subarrays-in-a-valid-split", "title": "Minimum Subarrays In A Valid Split", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-subarrays-in-a-valid-split.json", "recommendation_by_id": "/v1/recommendations/by-id/2464.json" }, "2466": { "question_id": "2466", "task_id": "count-ways-to-build-good-strings", "title": "Count Ways To Build Good Strings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-ways-to-build-good-strings.json", "recommendation_by_id": "/v1/recommendations/by-id/2466.json" }, "2472": { "question_id": "2472", "task_id": "maximum-number-of-non-overlapping-palindrome-substrings", "title": "Maximum Number Of Non Overlapping Palindrome Substrings", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-non-overlapping-palindrome-substrings.json", "recommendation_by_id": "/v1/recommendations/by-id/2472.json" }, "2478": { "question_id": "2478", "task_id": "number-of-beautiful-partitions", "title": "Number Of Beautiful Partitions", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-beautiful-partitions.json", "recommendation_by_id": "/v1/recommendations/by-id/2478.json" }, "2484": { "question_id": "2484", "task_id": "count-palindromic-subsequences", "title": "Count Palindromic Subsequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-palindromic-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/2484.json" }, "2495": { "question_id": "2495", "task_id": "number-of-subarrays-having-even-product", "title": "Number Of Subarrays Having Even Product", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-subarrays-having-even-product.json", "recommendation_by_id": "/v1/recommendations/by-id/2495.json" }, "2501": { "question_id": "2501", "task_id": "longest-square-streak-in-an-array", "title": "Longest Square Streak In An Array", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-square-streak-in-an-array.json", "recommendation_by_id": "/v1/recommendations/by-id/2501.json" }, "2510": { "question_id": "2510", "task_id": "check-if-there-is-a-path-with-equal-number-of-0s-and-1s", "title": "Check If There Is A Path With Equal Number Of 0S And 1S", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/check-if-there-is-a-path-with-equal-number-of-0s-and-1s.json", "recommendation_by_id": "/v1/recommendations/by-id/2510.json" }, "2518": { "question_id": "2518", "task_id": "number-of-great-partitions", "title": "Number Of Great Partitions", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-great-partitions.json", "recommendation_by_id": "/v1/recommendations/by-id/2518.json" }, "2522": { "question_id": "2522", "task_id": "partition-string-into-substrings-with-values-at-most-k", "title": "Partition String Into Substrings With Values At Most K", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/partition-string-into-substrings-with-values-at-most-k.json", "recommendation_by_id": "/v1/recommendations/by-id/2522.json" }, "2533": { "question_id": "2533", "task_id": "number-of-good-binary-strings", "title": "Number Of Good Binary Strings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-good-binary-strings.json", "recommendation_by_id": "/v1/recommendations/by-id/2533.json" }, "2538": { "question_id": "2538", "task_id": "difference-between-maximum-and-minimum-price-sum", "title": "Difference Between Maximum And Minimum Price Sum", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/difference-between-maximum-and-minimum-price-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/2538.json" }, "2547": { "question_id": "2547", "task_id": "minimum-cost-to-split-an-array", "title": "Minimum Cost To Split An Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-split-an-array.json", "recommendation_by_id": "/v1/recommendations/by-id/2547.json" }, "2552": { "question_id": "2552", "task_id": "count-increasing-quadruplets", "title": "Count Increasing Quadruplets", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-increasing-quadruplets.json", "recommendation_by_id": "/v1/recommendations/by-id/2552.json" }, "2556": { "question_id": "2556", "task_id": "disconnect-path-in-a-binary-matrix-by-at-most-one-flip", "title": "Disconnect Path In A Binary Matrix By At Most One Flip", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/disconnect-path-in-a-binary-matrix-by-at-most-one-flip.json", "recommendation_by_id": "/v1/recommendations/by-id/2556.json" }, "256": { "question_id": "256", "task_id": "paint-house", "title": "Paint House", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/paint-house.json", "recommendation_by_id": "/v1/recommendations/by-id/256.json" }, "2571": { "question_id": "2571", "task_id": "minimum-operations-to-reduce-an-integer-to-0", "title": "Minimum Operations To Reduce An Integer To 0", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-operations-to-reduce-an-integer-to-0.json", "recommendation_by_id": "/v1/recommendations/by-id/2571.json" }, "2572": { "question_id": "2572", "task_id": "count-the-number-of-square-free-subsets", "title": "Count The Number Of Square Free Subsets", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-the-number-of-square-free-subsets.json", "recommendation_by_id": "/v1/recommendations/by-id/2572.json" }, "2573": { "question_id": "2573", "task_id": "find-the-string-with-lcp", "title": "Find The String With Lcp", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-string-with-lcp.json", "recommendation_by_id": "/v1/recommendations/by-id/2573.json" }, "2581": { "question_id": "2581", "task_id": "count-number-of-possible-root-nodes", "title": "Count Number Of Possible Root Nodes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-number-of-possible-root-nodes.json", "recommendation_by_id": "/v1/recommendations/by-id/2581.json" }, "2585": { "question_id": "2585", "task_id": "number-of-ways-to-earn-points", "title": "Number Of Ways To Earn Points", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-earn-points.json", "recommendation_by_id": "/v1/recommendations/by-id/2585.json" }, "2597": { "question_id": "2597", "task_id": "the-number-of-beautiful-subsets", "title": "The Number Of Beautiful Subsets", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/the-number-of-beautiful-subsets.json", "recommendation_by_id": "/v1/recommendations/by-id/2597.json" }, "2606": { "question_id": "2606", "task_id": "find-the-substring-with-maximum-cost", "title": "Find The Substring With Maximum Cost", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-substring-with-maximum-cost.json", "recommendation_by_id": "/v1/recommendations/by-id/2606.json" }, "2617": { "question_id": "2617", "task_id": "minimum-number-of-visited-cells-in-a-grid", "title": "Minimum Number Of Visited Cells In A Grid", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-visited-cells-in-a-grid.json", "recommendation_by_id": "/v1/recommendations/by-id/2617.json" }, "2638": { "question_id": "2638", "task_id": "count-the-number-of-k-free-subsets", "title": "Count The Number Of K Free Subsets", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-the-number-of-k-free-subsets.json", "recommendation_by_id": "/v1/recommendations/by-id/2638.json" }, "264": { "question_id": "264", "task_id": "ugly-number-ii", "title": "Ugly Number Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/ugly-number-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/264.json" }, "2645": { "question_id": "2645", "task_id": "minimum-additions-to-make-valid-string", "title": "Minimum Additions To Make Valid String", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-additions-to-make-valid-string.json", "recommendation_by_id": "/v1/recommendations/by-id/2645.json" }, "2646": { "question_id": "2646", "task_id": "minimize-the-total-price-of-the-trips", "title": "Minimize The Total Price Of The Trips", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimize-the-total-price-of-the-trips.json", "recommendation_by_id": "/v1/recommendations/by-id/2646.json" }, "265": { "question_id": "265", "task_id": "paint-house-ii", "title": "Paint House Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/paint-house-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/265.json" }, "2673": { "question_id": "2673", "task_id": "make-costs-of-paths-equal-in-a-binary-tree", "title": "Make Costs Of Paths Equal In A Binary Tree", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/make-costs-of-paths-equal-in-a-binary-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/2673.json" }, "2681": { "question_id": "2681", "task_id": "power-of-heroes", "title": "Power Of Heroes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/power-of-heroes.json", "recommendation_by_id": "/v1/recommendations/by-id/2681.json" }, "2684": { "question_id": "2684", "task_id": "maximum-number-of-moves-in-a-grid", "title": "Maximum Number Of Moves In A Grid", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-moves-in-a-grid.json", "recommendation_by_id": "/v1/recommendations/by-id/2684.json" }, "2707": { "question_id": "2707", "task_id": "extra-characters-in-a-string", "title": "Extra Characters In A String", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/extra-characters-in-a-string.json", "recommendation_by_id": "/v1/recommendations/by-id/2707.json" }, "2708": { "question_id": "2708", "task_id": "maximum-strength-of-a-group", "title": "Maximum Strength Of A Group", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-strength-of-a-group.json", "recommendation_by_id": "/v1/recommendations/by-id/2708.json" }, "2712": { "question_id": "2712", "task_id": "minimum-cost-to-make-all-characters-equal", "title": "Minimum Cost To Make All Characters Equal", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-make-all-characters-equal.json", "recommendation_by_id": "/v1/recommendations/by-id/2712.json" }, "2713": { "question_id": "2713", "task_id": "maximum-strictly-increasing-cells-in-a-matrix", "title": "Maximum Strictly Increasing Cells In A Matrix", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-strictly-increasing-cells-in-a-matrix.json", "recommendation_by_id": "/v1/recommendations/by-id/2713.json" }, "2719": { "question_id": "2719", "task_id": "count-of-integers", "title": "Count Of Integers", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-of-integers.json", "recommendation_by_id": "/v1/recommendations/by-id/2719.json" }, "2741": { "question_id": "2741", "task_id": "special-permutations", "title": "Special Permutations", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/special-permutations.json", "recommendation_by_id": "/v1/recommendations/by-id/2741.json" }, "2742": { "question_id": "2742", "task_id": "painting-the-walls", "title": "Painting The Walls", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/painting-the-walls.json", "recommendation_by_id": "/v1/recommendations/by-id/2742.json" }, "2745": { "question_id": "2745", "task_id": "construct-the-longest-new-string", "title": "Construct The Longest New String", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/construct-the-longest-new-string.json", "recommendation_by_id": "/v1/recommendations/by-id/2745.json" }, "2746": { "question_id": "2746", "task_id": "decremental-string-concatenation", "title": "Decremental String Concatenation", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/decremental-string-concatenation.json", "recommendation_by_id": "/v1/recommendations/by-id/2746.json" }, "2750": { "question_id": "2750", "task_id": "ways-to-split-array-into-good-subarrays", "title": "Ways To Split Array Into Good Subarrays", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/ways-to-split-array-into-good-subarrays.json", "recommendation_by_id": "/v1/recommendations/by-id/2750.json" }, "276": { "question_id": "276", "task_id": "paint-fence", "title": "Paint Fence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/paint-fence.json", "recommendation_by_id": "/v1/recommendations/by-id/276.json" }, "2767": { "question_id": "2767", "task_id": "partition-string-into-minimum-beautiful-substrings", "title": "Partition String Into Minimum Beautiful Substrings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/partition-string-into-minimum-beautiful-substrings.json", "recommendation_by_id": "/v1/recommendations/by-id/2767.json" }, "2770": { "question_id": "2770", "task_id": "maximum-number-of-jumps-to-reach-the-last-index", "title": "Maximum Number Of Jumps To Reach The Last Index", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-jumps-to-reach-the-last-index.json", "recommendation_by_id": "/v1/recommendations/by-id/2770.json" }, "2771": { "question_id": "2771", "task_id": "longest-non-decreasing-subarray-from-two-arrays", "title": "Longest Non Decreasing Subarray From Two Arrays", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-non-decreasing-subarray-from-two-arrays.json", "recommendation_by_id": "/v1/recommendations/by-id/2771.json" }, "2786": { "question_id": "2786", "task_id": "visit-array-positions-to-maximize-score", "title": "Visit Array Positions To Maximize Score", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/visit-array-positions-to-maximize-score.json", "recommendation_by_id": "/v1/recommendations/by-id/2786.json" }, "2787": { "question_id": "2787", "task_id": "ways-to-express-an-integer-as-sum-of-powers", "title": "Ways To Express An Integer As Sum Of Powers", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/ways-to-express-an-integer-as-sum-of-powers.json", "recommendation_by_id": "/v1/recommendations/by-id/2787.json" }, "279": { "question_id": "279", "task_id": "perfect-squares", "title": "Perfect Squares", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/perfect-squares.json", "recommendation_by_id": "/v1/recommendations/by-id/279.json" }, "2791": { "question_id": "2791", "task_id": "count-paths-that-can-form-a-palindrome-in-a-tree", "title": "Count Paths That Can Form A Palindrome In A Tree", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-paths-that-can-form-a-palindrome-in-a-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/2791.json" }, "2801": { "question_id": "2801", "task_id": "count-stepping-numbers-in-range", "title": "Count Stepping Numbers In Range", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-stepping-numbers-in-range.json", "recommendation_by_id": "/v1/recommendations/by-id/2801.json" }, "2809": { "question_id": "2809", "task_id": "minimum-time-to-make-array-sum-at-most-x", "title": "Minimum Time To Make Array Sum At Most X", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-time-to-make-array-sum-at-most-x.json", "recommendation_by_id": "/v1/recommendations/by-id/2809.json" }, "2811": { "question_id": "2811", "task_id": "check-if-it-is-possible-to-split-array", "title": "Check If It Is Possible To Split Array", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/check-if-it-is-possible-to-split-array.json", "recommendation_by_id": "/v1/recommendations/by-id/2811.json" }, "2826": { "question_id": "2826", "task_id": "sorting-three-groups", "title": "Sorting Three Groups", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/sorting-three-groups.json", "recommendation_by_id": "/v1/recommendations/by-id/2826.json" }, "2827": { "question_id": "2827", "task_id": "number-of-beautiful-integers-in-the-range", "title": "Number Of Beautiful Integers In The Range", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-beautiful-integers-in-the-range.json", "recommendation_by_id": "/v1/recommendations/by-id/2827.json" }, "2830": { "question_id": "2830", "task_id": "maximize-the-profit-as-the-salesman", "title": "Maximize The Profit As The Salesman", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximize-the-profit-as-the-salesman.json", "recommendation_by_id": "/v1/recommendations/by-id/2830.json" }, "2836": { "question_id": "2836", "task_id": "maximize-value-of-function-in-a-ball-passing-game", "title": "Maximize Value Of Function In A Ball Passing Game", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximize-value-of-function-in-a-ball-passing-game.json", "recommendation_by_id": "/v1/recommendations/by-id/2836.json" }, "2850": { "question_id": "2850", "task_id": "minimum-moves-to-spread-stones-over-grid", "title": "Minimum Moves To Spread Stones Over Grid", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-moves-to-spread-stones-over-grid.json", "recommendation_by_id": "/v1/recommendations/by-id/2850.json" }, "2851": { "question_id": "2851", "task_id": "string-transformation", "title": "String Transformation", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/string-transformation.json", "recommendation_by_id": "/v1/recommendations/by-id/2851.json" }, "2858": { "question_id": "2858", "task_id": "minimum-edge-reversals-so-every-node-is-reachable", "title": "Minimum Edge Reversals So Every Node Is Reachable", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-edge-reversals-so-every-node-is-reachable.json", "recommendation_by_id": "/v1/recommendations/by-id/2858.json" }, "2867": { "question_id": "2867", "task_id": "count-valid-paths-in-a-tree", "title": "Count Valid Paths In A Tree", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-valid-paths-in-a-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/2867.json" }, "2876": { "question_id": "2876", "task_id": "count-visited-nodes-in-a-directed-graph", "title": "Count Visited Nodes In A Directed Graph", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-visited-nodes-in-a-directed-graph.json", "recommendation_by_id": "/v1/recommendations/by-id/2876.json" }, "2892": { "question_id": "2892", "task_id": "minimizing-array-after-replacing-pairs-with-their-product", "title": "Minimizing Array After Replacing Pairs With Their Product", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimizing-array-after-replacing-pairs-with-their-product.json", "recommendation_by_id": "/v1/recommendations/by-id/2892.json" }, "2896": { "question_id": "2896", "task_id": "apply-operations-to-make-two-strings-equal", "title": "Apply Operations To Make Two Strings Equal", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/apply-operations-to-make-two-strings-equal.json", "recommendation_by_id": "/v1/recommendations/by-id/2896.json" }, "2900": { "question_id": "2900", "task_id": "longest-unequal-adjacent-groups-subsequence-i", "title": "Longest Unequal Adjacent Groups Subsequence I", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-unequal-adjacent-groups-subsequence-i.json", "recommendation_by_id": "/v1/recommendations/by-id/2900.json" }, "2901": { "question_id": "2901", "task_id": "longest-unequal-adjacent-groups-subsequence-ii", "title": "Longest Unequal Adjacent Groups Subsequence Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-unequal-adjacent-groups-subsequence-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/2901.json" }, "2902": { "question_id": "2902", "task_id": "count-of-sub-multisets-with-bounded-sum", "title": "Count Of Sub Multisets With Bounded Sum", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-of-sub-multisets-with-bounded-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/2902.json" }, "2911": { "question_id": "2911", "task_id": "minimum-changes-to-make-k-semi-palindromes", "title": "Minimum Changes To Make K Semi Palindromes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-changes-to-make-k-semi-palindromes.json", "recommendation_by_id": "/v1/recommendations/by-id/2911.json" }, "2912": { "question_id": "2912", "task_id": "number-of-ways-to-reach-destination-in-the-grid", "title": "Number Of Ways To Reach Destination In The Grid", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-ways-to-reach-destination-in-the-grid.json", "recommendation_by_id": "/v1/recommendations/by-id/2912.json" }, "2915": { "question_id": "2915", "task_id": "length-of-the-longest-subsequence-that-sums-to-target", "title": "Length Of The Longest Subsequence That Sums To Target", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/length-of-the-longest-subsequence-that-sums-to-target.json", "recommendation_by_id": "/v1/recommendations/by-id/2915.json" }, "2916": { "question_id": "2916", "task_id": "subarrays-distinct-element-sum-of-squares-ii", "title": "Subarrays Distinct Element Sum Of Squares Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/subarrays-distinct-element-sum-of-squares-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/2916.json" }, "2919": { "question_id": "2919", "task_id": "minimum-increment-operations-to-make-array-beautiful", "title": "Minimum Increment Operations To Make Array Beautiful", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-increment-operations-to-make-array-beautiful.json", "recommendation_by_id": "/v1/recommendations/by-id/2919.json" }, "2920": { "question_id": "2920", "task_id": "maximum-points-after-collecting-coins-from-all-nodes", "title": "Maximum Points After Collecting Coins From All Nodes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-points-after-collecting-coins-from-all-nodes.json", "recommendation_by_id": "/v1/recommendations/by-id/2920.json" }, "2925": { "question_id": "2925", "task_id": "maximum-score-after-applying-operations-on-a-tree", "title": "Maximum Score After Applying Operations On A Tree", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-score-after-applying-operations-on-a-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/2925.json" }, "2926": { "question_id": "2926", "task_id": "maximum-balanced-subsequence-sum", "title": "Maximum Balanced Subsequence Sum", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-balanced-subsequence-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/2926.json" }, "2930": { "question_id": "2930", "task_id": "number-of-strings-which-can-be-rearranged-to-contain-substring", "title": "Number Of Strings Which Can Be Rearranged To Contain Substring", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-strings-which-can-be-rearranged-to-contain-substring.json", "recommendation_by_id": "/v1/recommendations/by-id/2930.json" }, "294": { "question_id": "294", "task_id": "flip-game-ii", "title": "Flip Game Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/flip-game-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/294.json" }, "2944": { "question_id": "2944", "task_id": "minimum-number-of-coins-for-fruits", "title": "Minimum Number Of Coins For Fruits", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-coins-for-fruits.json", "recommendation_by_id": "/v1/recommendations/by-id/2944.json" }, "2945": { "question_id": "2945", "task_id": "find-maximum-non-decreasing-array-length", "title": "Find Maximum Non Decreasing Array Length", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-maximum-non-decreasing-array-length.json", "recommendation_by_id": "/v1/recommendations/by-id/2945.json" }, "2957": { "question_id": "2957", "task_id": "remove-adjacent-almost-equal-characters", "title": "Remove Adjacent Almost Equal Characters", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/remove-adjacent-almost-equal-characters.json", "recommendation_by_id": "/v1/recommendations/by-id/2957.json" }, "2969": { "question_id": "2969", "task_id": "minimum-number-of-coins-for-fruits-ii", "title": "Minimum Number Of Coins For Fruits Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-coins-for-fruits-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/2969.json" }, "2973": { "question_id": "2973", "task_id": "find-number-of-coins-to-place-in-tree-nodes", "title": "Find Number Of Coins To Place In Tree Nodes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-number-of-coins-to-place-in-tree-nodes.json", "recommendation_by_id": "/v1/recommendations/by-id/2973.json" }, "2977": { "question_id": "2977", "task_id": "minimum-cost-to-convert-string-ii", "title": "Minimum Cost To Convert String Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-to-convert-string-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/2977.json" }, "2979": { "question_id": "2979", "task_id": "most-expensive-item-that-can-not-be-bought", "title": "Most Expensive Item That Can Not Be Bought", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/most-expensive-item-that-can-not-be-bought.json", "recommendation_by_id": "/v1/recommendations/by-id/2979.json" }, "2992": { "question_id": "2992", "task_id": "number-of-self-divisible-permutations", "title": "Number Of Self Divisible Permutations", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-self-divisible-permutations.json", "recommendation_by_id": "/v1/recommendations/by-id/2992.json" }, "2998": { "question_id": "2998", "task_id": "minimum-number-of-operations-to-make-x-and-y-equal", "title": "Minimum Number Of Operations To Make X And Y Equal", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-operations-to-make-x-and-y-equal.json", "recommendation_by_id": "/v1/recommendations/by-id/2998.json" }, "2999": { "question_id": "2999", "task_id": "count-the-number-of-powerful-integers", "title": "Count The Number Of Powerful Integers", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-the-number-of-powerful-integers.json", "recommendation_by_id": "/v1/recommendations/by-id/2999.json" }, "300": { "question_id": "300", "task_id": "longest-increasing-subsequence", "title": "Longest Increasing Subsequence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-increasing-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/300.json" }, "3003": { "question_id": "3003", "task_id": "maximize-the-number-of-partitions-after-operations", "title": "Maximize The Number Of Partitions After Operations", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximize-the-number-of-partitions-after-operations.json", "recommendation_by_id": "/v1/recommendations/by-id/3003.json" }, "3004": { "question_id": "3004", "task_id": "maximum-subtree-of-the-same-color", "title": "Maximum Subtree Of The Same Color", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-subtree-of-the-same-color.json", "recommendation_by_id": "/v1/recommendations/by-id/3004.json" }, "3007": { "question_id": "3007", "task_id": "maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k", "title": "Maximum Number That Sum Of The Prices Is Less Than Or Equal To K", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k.json", "recommendation_by_id": "/v1/recommendations/by-id/3007.json" }, "3018": { "question_id": "3018", "task_id": "maximum-number-of-removal-queries-that-can-be-processed-i", "title": "Maximum Number Of Removal Queries That Can Be Processed I", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-removal-queries-that-can-be-processed-i.json", "recommendation_by_id": "/v1/recommendations/by-id/3018.json" }, "3032": { "question_id": "3032", "task_id": "count-numbers-with-unique-digits-ii", "title": "Count Numbers With Unique Digits Ii", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/count-numbers-with-unique-digits-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/3032.json" }, "3040": { "question_id": "3040", "task_id": "maximum-number-of-operations-with-the-same-score-ii", "title": "Maximum Number Of Operations With The Same Score Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-number-of-operations-with-the-same-score-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/3040.json" }, "3041": { "question_id": "3041", "task_id": "maximize-consecutive-elements-in-an-array-after-modification", "title": "Maximize Consecutive Elements In An Array After Modification", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximize-consecutive-elements-in-an-array-after-modification.json", "recommendation_by_id": "/v1/recommendations/by-id/3041.json" }, "3068": { "question_id": "3068", "task_id": "find-the-maximum-sum-of-node-values", "title": "Find The Maximum Sum Of Node Values", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-maximum-sum-of-node-values.json", "recommendation_by_id": "/v1/recommendations/by-id/3068.json" }, "3077": { "question_id": "3077", "task_id": "maximum-strength-of-k-disjoint-subarrays", "title": "Maximum Strength Of K Disjoint Subarrays", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-strength-of-k-disjoint-subarrays.json", "recommendation_by_id": "/v1/recommendations/by-id/3077.json" }, "3082": { "question_id": "3082", "task_id": "find-the-sum-of-the-power-of-all-subsequences", "title": "Find The Sum Of The Power Of All Subsequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-sum-of-the-power-of-all-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/3082.json" }, "309": { "question_id": "309", "task_id": "best-time-to-buy-and-sell-stock-with-cooldown", "title": "Best Time To Buy And Sell Stock With Cooldown", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/best-time-to-buy-and-sell-stock-with-cooldown.json", "recommendation_by_id": "/v1/recommendations/by-id/309.json" }, "3098": { "question_id": "3098", "task_id": "find-the-sum-of-subsequence-powers", "title": "Find The Sum Of Subsequence Powers", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-sum-of-subsequence-powers.json", "recommendation_by_id": "/v1/recommendations/by-id/3098.json" }, "3117": { "question_id": "3117", "task_id": "minimum-sum-of-values-by-dividing-array", "title": "Minimum Sum Of Values By Dividing Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-sum-of-values-by-dividing-array.json", "recommendation_by_id": "/v1/recommendations/by-id/3117.json" }, "312": { "question_id": "312", "task_id": "burst-balloons", "title": "Burst Balloons", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/burst-balloons.json", "recommendation_by_id": "/v1/recommendations/by-id/312.json" }, "3122": { "question_id": "3122", "task_id": "minimum-number-of-operations-to-satisfy-conditions", "title": "Minimum Number Of Operations To Satisfy Conditions", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-operations-to-satisfy-conditions.json", "recommendation_by_id": "/v1/recommendations/by-id/3122.json" }, "3129": { "question_id": "3129", "task_id": "find-all-possible-stable-binary-arrays-i", "title": "Find All Possible Stable Binary Arrays I", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-all-possible-stable-binary-arrays-i.json", "recommendation_by_id": "/v1/recommendations/by-id/3129.json" }, "313": { "question_id": "313", "task_id": "super-ugly-number", "title": "Super Ugly Number", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/super-ugly-number.json", "recommendation_by_id": "/v1/recommendations/by-id/313.json" }, "3130": { "question_id": "3130", "task_id": "find-all-possible-stable-binary-arrays-ii", "title": "Find All Possible Stable Binary Arrays Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-all-possible-stable-binary-arrays-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/3130.json" }, "3135": { "question_id": "3135", "task_id": "equalize-strings-by-adding-or-removing-characters-at-ends", "title": "Equalize Strings By Adding Or Removing Characters At Ends", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/equalize-strings-by-adding-or-removing-characters-at-ends.json", "recommendation_by_id": "/v1/recommendations/by-id/3135.json" }, "3144": { "question_id": "3144", "task_id": "minimum-substring-partition-of-equal-character-frequency", "title": "Minimum Substring Partition Of Equal Character Frequency", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-substring-partition-of-equal-character-frequency.json", "recommendation_by_id": "/v1/recommendations/by-id/3144.json" }, "3148": { "question_id": "3148", "task_id": "maximum-difference-score-in-a-grid", "title": "Maximum Difference Score In A Grid", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-difference-score-in-a-grid.json", "recommendation_by_id": "/v1/recommendations/by-id/3148.json" }, "3149": { "question_id": "3149", "task_id": "find-the-minimum-cost-array-permutation", "title": "Find The Minimum Cost Array Permutation", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-minimum-cost-array-permutation.json", "recommendation_by_id": "/v1/recommendations/by-id/3149.json" }, "3154": { "question_id": "3154", "task_id": "find-number-of-ways-to-reach-the-k-th-stair", "title": "Find Number Of Ways To Reach The K Th Stair", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-number-of-ways-to-reach-the-k-th-stair.json", "recommendation_by_id": "/v1/recommendations/by-id/3154.json" }, "3165": { "question_id": "3165", "task_id": "maximum-sum-of-subsequence-with-non-adjacent-elements", "title": "Maximum Sum Of Subsequence With Non Adjacent Elements", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-sum-of-subsequence-with-non-adjacent-elements.json", "recommendation_by_id": "/v1/recommendations/by-id/3165.json" }, "3176": { "question_id": "3176", "task_id": "find-the-maximum-length-of-a-good-subsequence-i", "title": "Find The Maximum Length Of A Good Subsequence I", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-maximum-length-of-a-good-subsequence-i.json", "recommendation_by_id": "/v1/recommendations/by-id/3176.json" }, "3177": { "question_id": "3177", "task_id": "find-the-maximum-length-of-a-good-subsequence-ii", "title": "Find The Maximum Length Of A Good Subsequence Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-maximum-length-of-a-good-subsequence-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/3177.json" }, "3180": { "question_id": "3180", "task_id": "maximum-total-reward-using-operations-i", "title": "Maximum Total Reward Using Operations I", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-total-reward-using-operations-i.json", "recommendation_by_id": "/v1/recommendations/by-id/3180.json" }, "3181": { "question_id": "3181", "task_id": "maximum-total-reward-using-operations-ii", "title": "Maximum Total Reward Using Operations Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-total-reward-using-operations-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/3181.json" }, "3183": { "question_id": "3183", "task_id": "the-number-of-ways-to-make-the-sum", "title": "The Number Of Ways To Make The Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/the-number-of-ways-to-make-the-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/3183.json" }, "3186": { "question_id": "3186", "task_id": "maximum-total-damage-with-spell-casting", "title": "Maximum Total Damage With Spell Casting", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-total-damage-with-spell-casting.json", "recommendation_by_id": "/v1/recommendations/by-id/3186.json" }, "3192": { "question_id": "3192", "task_id": "minimum-operations-to-make-binary-array-elements-equal-to-one-ii", "title": "Minimum Operations To Make Binary Array Elements Equal To One Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-operations-to-make-binary-array-elements-equal-to-one-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/3192.json" }, "3193": { "question_id": "3193", "task_id": "count-the-number-of-inversions", "title": "Count The Number Of Inversions", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-the-number-of-inversions.json", "recommendation_by_id": "/v1/recommendations/by-id/3193.json" }, "3196": { "question_id": "3196", "task_id": "maximize-total-cost-of-alternating-subarrays", "title": "Maximize Total Cost Of Alternating Subarrays", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximize-total-cost-of-alternating-subarrays.json", "recommendation_by_id": "/v1/recommendations/by-id/3196.json" }, "32": { "question_id": "32", "task_id": "longest-valid-parentheses", "title": "Longest Valid Parentheses", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-valid-parentheses.json", "recommendation_by_id": "/v1/recommendations/by-id/32.json" }, "3201": { "question_id": "3201", "task_id": "find-the-maximum-length-of-valid-subsequence-i", "title": "Find The Maximum Length Of Valid Subsequence I", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-maximum-length-of-valid-subsequence-i.json", "recommendation_by_id": "/v1/recommendations/by-id/3201.json" }, "3202": { "question_id": "3202", "task_id": "find-the-maximum-length-of-valid-subsequence-ii", "title": "Find The Maximum Length Of Valid Subsequence Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-maximum-length-of-valid-subsequence-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/3202.json" }, "3205": { "question_id": "3205", "task_id": "maximum-array-hopping-score-i", "title": "Maximum Array Hopping Score I", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-array-hopping-score-i.json", "recommendation_by_id": "/v1/recommendations/by-id/3205.json" }, "3213": { "question_id": "3213", "task_id": "construct-string-with-minimum-cost", "title": "Construct String With Minimum Cost", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/construct-string-with-minimum-cost.json", "recommendation_by_id": "/v1/recommendations/by-id/3213.json" }, "3218": { "question_id": "3218", "task_id": "minimum-cost-for-cutting-cake-i", "title": "Minimum Cost For Cutting Cake I", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-for-cutting-cake-i.json", "recommendation_by_id": "/v1/recommendations/by-id/3218.json" }, "322": { "question_id": "322", "task_id": "coin-change", "title": "Coin Change", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/coin-change.json", "recommendation_by_id": "/v1/recommendations/by-id/322.json" }, "3225": { "question_id": "3225", "task_id": "maximum-score-from-grid-operations", "title": "Maximum Score From Grid Operations", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-score-from-grid-operations.json", "recommendation_by_id": "/v1/recommendations/by-id/3225.json" }, "3229": { "question_id": "3229", "task_id": "minimum-operations-to-make-array-equal-to-target", "title": "Minimum Operations To Make Array Equal To Target", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-operations-to-make-array-equal-to-target.json", "recommendation_by_id": "/v1/recommendations/by-id/3229.json" }, "3241": { "question_id": "3241", "task_id": "time-taken-to-mark-all-nodes", "title": "Time Taken To Mark All Nodes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/time-taken-to-mark-all-nodes.json", "recommendation_by_id": "/v1/recommendations/by-id/3241.json" }, "329": { "question_id": "329", "task_id": "longest-increasing-path-in-a-matrix", "title": "Longest Increasing Path In A Matrix", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-increasing-path-in-a-matrix.json", "recommendation_by_id": "/v1/recommendations/by-id/329.json" }, "333": { "question_id": "333", "task_id": "largest-bst-subtree", "title": "Largest Bst Subtree", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/largest-bst-subtree.json", "recommendation_by_id": "/v1/recommendations/by-id/333.json" }, "337": { "question_id": "337", "task_id": "house-robber-iii", "title": "House Robber Iii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/house-robber-iii.json", "recommendation_by_id": "/v1/recommendations/by-id/337.json" }, "338": { "question_id": "338", "task_id": "counting-bits", "title": "Counting Bits", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/counting-bits.json", "recommendation_by_id": "/v1/recommendations/by-id/338.json" }, "343": { "question_id": "343", "task_id": "integer-break", "title": "Integer Break", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/integer-break.json", "recommendation_by_id": "/v1/recommendations/by-id/343.json" }, "351": { "question_id": "351", "task_id": "android-unlock-patterns", "title": "Android Unlock Patterns", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/android-unlock-patterns.json", "recommendation_by_id": "/v1/recommendations/by-id/351.json" }, "354": { "question_id": "354", "task_id": "russian-doll-envelopes", "title": "Russian Doll Envelopes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/russian-doll-envelopes.json", "recommendation_by_id": "/v1/recommendations/by-id/354.json" }, "357": { "question_id": "357", "task_id": "count-numbers-with-unique-digits", "title": "Count Numbers With Unique Digits", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/count-numbers-with-unique-digits.json", "recommendation_by_id": "/v1/recommendations/by-id/357.json" }, "361": { "question_id": "361", "task_id": "bomb-enemy", "title": "Bomb Enemy", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/bomb-enemy.json", "recommendation_by_id": "/v1/recommendations/by-id/361.json" }, "368": { "question_id": "368", "task_id": "largest-divisible-subset", "title": "Largest Divisible Subset", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/largest-divisible-subset.json", "recommendation_by_id": "/v1/recommendations/by-id/368.json" }, "375": { "question_id": "375", "task_id": "guess-number-higher-or-lower-ii", "title": "Guess Number Higher Or Lower Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/guess-number-higher-or-lower-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/375.json" }, "376": { "question_id": "376", "task_id": "wiggle-subsequence", "title": "Wiggle Subsequence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/wiggle-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/376.json" }, "377": { "question_id": "377", "task_id": "combination-sum-iv", "title": "Combination Sum Iv", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/combination-sum-iv.json", "recommendation_by_id": "/v1/recommendations/by-id/377.json" }, "392": { "question_id": "392", "task_id": "is-subsequence", "title": "Is Subsequence", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/is-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/392.json" }, "396": { "question_id": "396", "task_id": "rotate-function", "title": "Rotate Function", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/rotate-function.json", "recommendation_by_id": "/v1/recommendations/by-id/396.json" }, "397": { "question_id": "397", "task_id": "integer-replacement", "title": "Integer Replacement", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/integer-replacement.json", "recommendation_by_id": "/v1/recommendations/by-id/397.json" }, "403": { "question_id": "403", "task_id": "frog-jump", "title": "Frog Jump", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/frog-jump.json", "recommendation_by_id": "/v1/recommendations/by-id/403.json" }, "410": { "question_id": "410", "task_id": "split-array-largest-sum", "title": "Split Array Largest Sum", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/split-array-largest-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/410.json" }, "413": { "question_id": "413", "task_id": "arithmetic-slices", "title": "Arithmetic Slices", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/arithmetic-slices.json", "recommendation_by_id": "/v1/recommendations/by-id/413.json" }, "416": { "question_id": "416", "task_id": "partition-equal-subset-sum", "title": "Partition Equal Subset Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/partition-equal-subset-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/416.json" }, "418": { "question_id": "418", "task_id": "sentence-screen-fitting", "title": "Sentence Screen Fitting", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/sentence-screen-fitting.json", "recommendation_by_id": "/v1/recommendations/by-id/418.json" }, "42": { "question_id": "42", "task_id": "trapping-rain-water", "title": "Trapping Rain Water", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/trapping-rain-water.json", "recommendation_by_id": "/v1/recommendations/by-id/42.json" }, "435": { "question_id": "435", "task_id": "non-overlapping-intervals", "title": "Non Overlapping Intervals", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/non-overlapping-intervals.json", "recommendation_by_id": "/v1/recommendations/by-id/435.json" }, "44": { "question_id": "44", "task_id": "wildcard-matching", "title": "Wildcard Matching", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/wildcard-matching.json", "recommendation_by_id": "/v1/recommendations/by-id/44.json" }, "446": { "question_id": "446", "task_id": "arithmetic-slices-ii-subsequence", "title": "Arithmetic Slices Ii Subsequence", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/arithmetic-slices-ii-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/446.json" }, "45": { "question_id": "45", "task_id": "jump-game-ii", "title": "Jump Game Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/jump-game-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/45.json" }, "458": { "question_id": "458", "task_id": "poor-pigs", "title": "Poor Pigs", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/poor-pigs.json", "recommendation_by_id": "/v1/recommendations/by-id/458.json" }, "464": { "question_id": "464", "task_id": "can-i-win", "title": "Can I Win", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/can-i-win.json", "recommendation_by_id": "/v1/recommendations/by-id/464.json" }, "465": { "question_id": "465", "task_id": "optimal-account-balancing", "title": "Optimal Account Balancing", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/optimal-account-balancing.json", "recommendation_by_id": "/v1/recommendations/by-id/465.json" }, "466": { "question_id": "466", "task_id": "count-the-repetitions", "title": "Count The Repetitions", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-the-repetitions.json", "recommendation_by_id": "/v1/recommendations/by-id/466.json" }, "467": { "question_id": "467", "task_id": "unique-substrings-in-wraparound-string", "title": "Unique Substrings In Wraparound String", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/unique-substrings-in-wraparound-string.json", "recommendation_by_id": "/v1/recommendations/by-id/467.json" }, "471": { "question_id": "471", "task_id": "encode-string-with-shortest-length", "title": "Encode String With Shortest Length", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/encode-string-with-shortest-length.json", "recommendation_by_id": "/v1/recommendations/by-id/471.json" }, "472": { "question_id": "472", "task_id": "concatenated-words", "title": "Concatenated Words", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/concatenated-words.json", "recommendation_by_id": "/v1/recommendations/by-id/472.json" }, "473": { "question_id": "473", "task_id": "matchsticks-to-square", "title": "Matchsticks To Square", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/matchsticks-to-square.json", "recommendation_by_id": "/v1/recommendations/by-id/473.json" }, "474": { "question_id": "474", "task_id": "ones-and-zeroes", "title": "Ones And Zeroes", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/ones-and-zeroes.json", "recommendation_by_id": "/v1/recommendations/by-id/474.json" }, "486": { "question_id": "486", "task_id": "predict-the-winner", "title": "Predict The Winner", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/predict-the-winner.json", "recommendation_by_id": "/v1/recommendations/by-id/486.json" }, "487": { "question_id": "487", "task_id": "max-consecutive-ones-ii", "title": "Max Consecutive Ones Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/max-consecutive-ones-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/487.json" }, "488": { "question_id": "488", "task_id": "zuma-game", "title": "Zuma Game", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/zuma-game.json", "recommendation_by_id": "/v1/recommendations/by-id/488.json" }, "494": { "question_id": "494", "task_id": "target-sum", "title": "Target Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/target-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/494.json" }, "5": { "question_id": "5", "task_id": "longest-palindromic-substring", "title": "Longest Palindromic Substring", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-palindromic-substring.json", "recommendation_by_id": "/v1/recommendations/by-id/5.json" }, "509": { "question_id": "509", "task_id": "fibonacci-number", "title": "Fibonacci Number", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/fibonacci-number.json", "recommendation_by_id": "/v1/recommendations/by-id/509.json" }, "514": { "question_id": "514", "task_id": "freedom-trail", "title": "Freedom Trail", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/freedom-trail.json", "recommendation_by_id": "/v1/recommendations/by-id/514.json" }, "516": { "question_id": "516", "task_id": "longest-palindromic-subsequence", "title": "Longest Palindromic Subsequence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-palindromic-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/516.json" }, "518": { "question_id": "518", "task_id": "coin-change-ii", "title": "Coin Change Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/coin-change-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/518.json" }, "526": { "question_id": "526", "task_id": "beautiful-arrangement", "title": "Beautiful Arrangement", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/beautiful-arrangement.json", "recommendation_by_id": "/v1/recommendations/by-id/526.json" }, "53": { "question_id": "53", "task_id": "maximum-subarray", "title": "Maximum Subarray", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-subarray.json", "recommendation_by_id": "/v1/recommendations/by-id/53.json" }, "542": { "question_id": "542", "task_id": "01-matrix", "title": "01 Matrix", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/01-matrix.json", "recommendation_by_id": "/v1/recommendations/by-id/542.json" }, "546": { "question_id": "546", "task_id": "remove-boxes", "title": "Remove Boxes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/remove-boxes.json", "recommendation_by_id": "/v1/recommendations/by-id/546.json" }, "55": { "question_id": "55", "task_id": "jump-game", "title": "Jump Game", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/jump-game.json", "recommendation_by_id": "/v1/recommendations/by-id/55.json" }, "552": { "question_id": "552", "task_id": "student-attendance-record-ii", "title": "Student Attendance Record Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/student-attendance-record-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/552.json" }, "553": { "question_id": "553", "task_id": "optimal-division", "title": "Optimal Division", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/optimal-division.json", "recommendation_by_id": "/v1/recommendations/by-id/553.json" }, "562": { "question_id": "562", "task_id": "longest-line-of-consecutive-one-in-matrix", "title": "Longest Line Of Consecutive One In Matrix", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-line-of-consecutive-one-in-matrix.json", "recommendation_by_id": "/v1/recommendations/by-id/562.json" }, "568": { "question_id": "568", "task_id": "maximum-vacation-days", "title": "Maximum Vacation Days", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-vacation-days.json", "recommendation_by_id": "/v1/recommendations/by-id/568.json" }, "576": { "question_id": "576", "task_id": "out-of-boundary-paths", "title": "Out Of Boundary Paths", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/out-of-boundary-paths.json", "recommendation_by_id": "/v1/recommendations/by-id/576.json" }, "583": { "question_id": "583", "task_id": "delete-operation-for-two-strings", "title": "Delete Operation For Two Strings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/delete-operation-for-two-strings.json", "recommendation_by_id": "/v1/recommendations/by-id/583.json" }, "600": { "question_id": "600", "task_id": "non-negative-integers-without-consecutive-ones", "title": "Non Negative Integers Without Consecutive Ones", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/non-negative-integers-without-consecutive-ones.json", "recommendation_by_id": "/v1/recommendations/by-id/600.json" }, "62": { "question_id": "62", "task_id": "unique-paths", "title": "Unique Paths", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/unique-paths.json", "recommendation_by_id": "/v1/recommendations/by-id/62.json" }, "629": { "question_id": "629", "task_id": "k-inverse-pairs-array", "title": "K Inverse Pairs Array", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/k-inverse-pairs-array.json", "recommendation_by_id": "/v1/recommendations/by-id/629.json" }, "63": { "question_id": "63", "task_id": "unique-paths-ii", "title": "Unique Paths Ii", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/unique-paths-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/63.json" }, "634": { "question_id": "634", "task_id": "find-the-derangement-of-an-array", "title": "Find The Derangement Of An Array", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-derangement-of-an-array.json", "recommendation_by_id": "/v1/recommendations/by-id/634.json" }, "638": { "question_id": "638", "task_id": "shopping-offers", "title": "Shopping Offers", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/shopping-offers.json", "recommendation_by_id": "/v1/recommendations/by-id/638.json" }, "639": { "question_id": "639", "task_id": "decode-ways-ii", "title": "Decode Ways Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/decode-ways-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/639.json" }, "64": { "question_id": "64", "task_id": "minimum-path-sum", "title": "Minimum Path Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-path-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/64.json" }, "646": { "question_id": "646", "task_id": "maximum-length-of-pair-chain", "title": "Maximum Length Of Pair Chain", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-length-of-pair-chain.json", "recommendation_by_id": "/v1/recommendations/by-id/646.json" }, "647": { "question_id": "647", "task_id": "palindromic-substrings", "title": "Palindromic Substrings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/palindromic-substrings.json", "recommendation_by_id": "/v1/recommendations/by-id/647.json" }, "650": { "question_id": "650", "task_id": "2-keys-keyboard", "title": "2 Keys Keyboard", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/2-keys-keyboard.json", "recommendation_by_id": "/v1/recommendations/by-id/650.json" }, "651": { "question_id": "651", "task_id": "4-keys-keyboard", "title": "4 Keys Keyboard", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/4-keys-keyboard.json", "recommendation_by_id": "/v1/recommendations/by-id/651.json" }, "656": { "question_id": "656", "task_id": "coin-path", "title": "Coin Path", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/coin-path.json", "recommendation_by_id": "/v1/recommendations/by-id/656.json" }, "664": { "question_id": "664", "task_id": "strange-printer", "title": "Strange Printer", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/strange-printer.json", "recommendation_by_id": "/v1/recommendations/by-id/664.json" }, "673": { "question_id": "673", "task_id": "number-of-longest-increasing-subsequence", "title": "Number Of Longest Increasing Subsequence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-longest-increasing-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/673.json" }, "678": { "question_id": "678", "task_id": "valid-parenthesis-string", "title": "Valid Parenthesis String", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/valid-parenthesis-string.json", "recommendation_by_id": "/v1/recommendations/by-id/678.json" }, "688": { "question_id": "688", "task_id": "knight-probability-in-chessboard", "title": "Knight Probability In Chessboard", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/knight-probability-in-chessboard.json", "recommendation_by_id": "/v1/recommendations/by-id/688.json" }, "689": { "question_id": "689", "task_id": "maximum-sum-of-3-non-overlapping-subarrays", "title": "Maximum Sum Of 3 Non Overlapping Subarrays", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-sum-of-3-non-overlapping-subarrays.json", "recommendation_by_id": "/v1/recommendations/by-id/689.json" }, "691": { "question_id": "691", "task_id": "stickers-to-spell-word", "title": "Stickers To Spell Word", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/stickers-to-spell-word.json", "recommendation_by_id": "/v1/recommendations/by-id/691.json" }, "698": { "question_id": "698", "task_id": "partition-to-k-equal-sum-subsets", "title": "Partition To K Equal Sum Subsets", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/partition-to-k-equal-sum-subsets.json", "recommendation_by_id": "/v1/recommendations/by-id/698.json" }, "70": { "question_id": "70", "task_id": "climbing-stairs", "title": "Climbing Stairs", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/climbing-stairs.json", "recommendation_by_id": "/v1/recommendations/by-id/70.json" }, "712": { "question_id": "712", "task_id": "minimum-ascii-delete-sum-for-two-strings", "title": "Minimum Ascii Delete Sum For Two Strings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-ascii-delete-sum-for-two-strings.json", "recommendation_by_id": "/v1/recommendations/by-id/712.json" }, "714": { "question_id": "714", "task_id": "best-time-to-buy-and-sell-stock-with-transaction-fee", "title": "Best Time To Buy And Sell Stock With Transaction Fee", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/best-time-to-buy-and-sell-stock-with-transaction-fee.json", "recommendation_by_id": "/v1/recommendations/by-id/714.json" }, "718": { "question_id": "718", "task_id": "maximum-length-of-repeated-subarray", "title": "Maximum Length Of Repeated Subarray", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-length-of-repeated-subarray.json", "recommendation_by_id": "/v1/recommendations/by-id/718.json" }, "72": { "question_id": "72", "task_id": "edit-distance", "title": "Edit Distance", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/edit-distance.json", "recommendation_by_id": "/v1/recommendations/by-id/72.json" }, "727": { "question_id": "727", "task_id": "minimum-window-subsequence", "title": "Minimum Window Subsequence", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-window-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/727.json" }, "730": { "question_id": "730", "task_id": "count-different-palindromic-subsequences", "title": "Count Different Palindromic Subsequences", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-different-palindromic-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/730.json" }, "740": { "question_id": "740", "task_id": "delete-and-earn", "title": "Delete And Earn", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/delete-and-earn.json", "recommendation_by_id": "/v1/recommendations/by-id/740.json" }, "741": { "question_id": "741", "task_id": "cherry-pickup", "title": "Cherry Pickup", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/cherry-pickup.json", "recommendation_by_id": "/v1/recommendations/by-id/741.json" }, "746": { "question_id": "746", "task_id": "min-cost-climbing-stairs", "title": "Min Cost Climbing Stairs", "difficulty": "Easy", "recommendation_by_slug": "/v1/recommendations/by-slug/min-cost-climbing-stairs.json", "recommendation_by_id": "/v1/recommendations/by-id/746.json" }, "750": { "question_id": "750", "task_id": "number-of-corner-rectangles", "title": "Number Of Corner Rectangles", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-corner-rectangles.json", "recommendation_by_id": "/v1/recommendations/by-id/750.json" }, "764": { "question_id": "764", "task_id": "largest-plus-sign", "title": "Largest Plus Sign", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/largest-plus-sign.json", "recommendation_by_id": "/v1/recommendations/by-id/764.json" }, "773": { "question_id": "773", "task_id": "sliding-puzzle", "title": "Sliding Puzzle", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/sliding-puzzle.json", "recommendation_by_id": "/v1/recommendations/by-id/773.json" }, "787": { "question_id": "787", "task_id": "cheapest-flights-within-k-stops", "title": "Cheapest Flights Within K Stops", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/cheapest-flights-within-k-stops.json", "recommendation_by_id": "/v1/recommendations/by-id/787.json" }, "788": { "question_id": "788", "task_id": "rotated-digits", "title": "Rotated Digits", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/rotated-digits.json", "recommendation_by_id": "/v1/recommendations/by-id/788.json" }, "790": { "question_id": "790", "task_id": "domino-and-tromino-tiling", "title": "Domino And Tromino Tiling", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/domino-and-tromino-tiling.json", "recommendation_by_id": "/v1/recommendations/by-id/790.json" }, "792": { "question_id": "792", "task_id": "number-of-matching-subsequences", "title": "Number Of Matching Subsequences", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-matching-subsequences.json", "recommendation_by_id": "/v1/recommendations/by-id/792.json" }, "799": { "question_id": "799", "task_id": "champagne-tower", "title": "Champagne Tower", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/champagne-tower.json", "recommendation_by_id": "/v1/recommendations/by-id/799.json" }, "801": { "question_id": "801", "task_id": "minimum-swaps-to-make-sequences-increasing", "title": "Minimum Swaps To Make Sequences Increasing", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-swaps-to-make-sequences-increasing.json", "recommendation_by_id": "/v1/recommendations/by-id/801.json" }, "805": { "question_id": "805", "task_id": "split-array-with-same-average", "title": "Split Array With Same Average", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/split-array-with-same-average.json", "recommendation_by_id": "/v1/recommendations/by-id/805.json" }, "808": { "question_id": "808", "task_id": "soup-servings", "title": "Soup Servings", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/soup-servings.json", "recommendation_by_id": "/v1/recommendations/by-id/808.json" }, "813": { "question_id": "813", "task_id": "largest-sum-of-averages", "title": "Largest Sum Of Averages", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/largest-sum-of-averages.json", "recommendation_by_id": "/v1/recommendations/by-id/813.json" }, "818": { "question_id": "818", "task_id": "race-car", "title": "Race Car", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/race-car.json", "recommendation_by_id": "/v1/recommendations/by-id/818.json" }, "823": { "question_id": "823", "task_id": "binary-trees-with-factors", "title": "Binary Trees With Factors", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/binary-trees-with-factors.json", "recommendation_by_id": "/v1/recommendations/by-id/823.json" }, "828": { "question_id": "828", "task_id": "count-unique-characters-of-all-substrings-of-a-given-string", "title": "Count Unique Characters Of All Substrings Of A Given String", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/count-unique-characters-of-all-substrings-of-a-given-string.json", "recommendation_by_id": "/v1/recommendations/by-id/828.json" }, "834": { "question_id": "834", "task_id": "sum-of-distances-in-tree", "title": "Sum Of Distances In Tree", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/sum-of-distances-in-tree.json", "recommendation_by_id": "/v1/recommendations/by-id/834.json" }, "837": { "question_id": "837", "task_id": "new-21-game", "title": "New 21 Game", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/new-21-game.json", "recommendation_by_id": "/v1/recommendations/by-id/837.json" }, "838": { "question_id": "838", "task_id": "push-dominoes", "title": "Push Dominoes", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/push-dominoes.json", "recommendation_by_id": "/v1/recommendations/by-id/838.json" }, "845": { "question_id": "845", "task_id": "longest-mountain-in-array", "title": "Longest Mountain In Array", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/longest-mountain-in-array.json", "recommendation_by_id": "/v1/recommendations/by-id/845.json" }, "847": { "question_id": "847", "task_id": "shortest-path-visiting-all-nodes", "title": "Shortest Path Visiting All Nodes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/shortest-path-visiting-all-nodes.json", "recommendation_by_id": "/v1/recommendations/by-id/847.json" }, "85": { "question_id": "85", "task_id": "maximal-rectangle", "title": "Maximal Rectangle", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/maximal-rectangle.json", "recommendation_by_id": "/v1/recommendations/by-id/85.json" }, "87": { "question_id": "87", "task_id": "scramble-string", "title": "Scramble String", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/scramble-string.json", "recommendation_by_id": "/v1/recommendations/by-id/87.json" }, "871": { "question_id": "871", "task_id": "minimum-number-of-refueling-stops", "title": "Minimum Number Of Refueling Stops", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-number-of-refueling-stops.json", "recommendation_by_id": "/v1/recommendations/by-id/871.json" }, "873": { "question_id": "873", "task_id": "length-of-longest-fibonacci-subsequence", "title": "Length Of Longest Fibonacci Subsequence", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/length-of-longest-fibonacci-subsequence.json", "recommendation_by_id": "/v1/recommendations/by-id/873.json" }, "877": { "question_id": "877", "task_id": "stone-game", "title": "Stone Game", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/stone-game.json", "recommendation_by_id": "/v1/recommendations/by-id/877.json" }, "879": { "question_id": "879", "task_id": "profitable-schemes", "title": "Profitable Schemes", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/profitable-schemes.json", "recommendation_by_id": "/v1/recommendations/by-id/879.json" }, "887": { "question_id": "887", "task_id": "super-egg-drop", "title": "Super Egg Drop", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/super-egg-drop.json", "recommendation_by_id": "/v1/recommendations/by-id/887.json" }, "898": { "question_id": "898", "task_id": "bitwise-ors-of-subarrays", "title": "Bitwise Ors Of Subarrays", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/bitwise-ors-of-subarrays.json", "recommendation_by_id": "/v1/recommendations/by-id/898.json" }, "902": { "question_id": "902", "task_id": "numbers-at-most-n-given-digit-set", "title": "Numbers At Most N Given Digit Set", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/numbers-at-most-n-given-digit-set.json", "recommendation_by_id": "/v1/recommendations/by-id/902.json" }, "903": { "question_id": "903", "task_id": "valid-permutations-for-di-sequence", "title": "Valid Permutations For Di Sequence", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/valid-permutations-for-di-sequence.json", "recommendation_by_id": "/v1/recommendations/by-id/903.json" }, "907": { "question_id": "907", "task_id": "sum-of-subarray-minimums", "title": "Sum Of Subarray Minimums", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/sum-of-subarray-minimums.json", "recommendation_by_id": "/v1/recommendations/by-id/907.json" }, "91": { "question_id": "91", "task_id": "decode-ways", "title": "Decode Ways", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/decode-ways.json", "recommendation_by_id": "/v1/recommendations/by-id/91.json" }, "913": { "question_id": "913", "task_id": "cat-and-mouse", "title": "Cat And Mouse", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/cat-and-mouse.json", "recommendation_by_id": "/v1/recommendations/by-id/913.json" }, "918": { "question_id": "918", "task_id": "maximum-sum-circular-subarray", "title": "Maximum Sum Circular Subarray", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/maximum-sum-circular-subarray.json", "recommendation_by_id": "/v1/recommendations/by-id/918.json" }, "920": { "question_id": "920", "task_id": "number-of-music-playlists", "title": "Number Of Music Playlists", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-music-playlists.json", "recommendation_by_id": "/v1/recommendations/by-id/920.json" }, "926": { "question_id": "926", "task_id": "flip-string-to-monotone-increasing", "title": "Flip String To Monotone Increasing", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/flip-string-to-monotone-increasing.json", "recommendation_by_id": "/v1/recommendations/by-id/926.json" }, "931": { "question_id": "931", "task_id": "minimum-falling-path-sum", "title": "Minimum Falling Path Sum", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-falling-path-sum.json", "recommendation_by_id": "/v1/recommendations/by-id/931.json" }, "935": { "question_id": "935", "task_id": "knight-dialer", "title": "Knight Dialer", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/knight-dialer.json", "recommendation_by_id": "/v1/recommendations/by-id/935.json" }, "940": { "question_id": "940", "task_id": "distinct-subsequences-ii", "title": "Distinct Subsequences Ii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/distinct-subsequences-ii.json", "recommendation_by_id": "/v1/recommendations/by-id/940.json" }, "943": { "question_id": "943", "task_id": "find-the-shortest-superstring", "title": "Find The Shortest Superstring", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/find-the-shortest-superstring.json", "recommendation_by_id": "/v1/recommendations/by-id/943.json" }, "956": { "question_id": "956", "task_id": "tallest-billboard", "title": "Tallest Billboard", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/tallest-billboard.json", "recommendation_by_id": "/v1/recommendations/by-id/956.json" }, "96": { "question_id": "96", "task_id": "unique-binary-search-trees", "title": "Unique Binary Search Trees", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/unique-binary-search-trees.json", "recommendation_by_id": "/v1/recommendations/by-id/96.json" }, "960": { "question_id": "960", "task_id": "delete-columns-to-make-sorted-iii", "title": "Delete Columns To Make Sorted Iii", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/delete-columns-to-make-sorted-iii.json", "recommendation_by_id": "/v1/recommendations/by-id/960.json" }, "964": { "question_id": "964", "task_id": "least-operators-to-express-number", "title": "Least Operators To Express Number", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/least-operators-to-express-number.json", "recommendation_by_id": "/v1/recommendations/by-id/964.json" }, "968": { "question_id": "968", "task_id": "binary-tree-cameras", "title": "Binary Tree Cameras", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/binary-tree-cameras.json", "recommendation_by_id": "/v1/recommendations/by-id/968.json" }, "97": { "question_id": "97", "task_id": "interleaving-string", "title": "Interleaving String", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/interleaving-string.json", "recommendation_by_id": "/v1/recommendations/by-id/97.json" }, "975": { "question_id": "975", "task_id": "odd-even-jump", "title": "Odd Even Jump", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/odd-even-jump.json", "recommendation_by_id": "/v1/recommendations/by-id/975.json" }, "983": { "question_id": "983", "task_id": "minimum-cost-for-tickets", "title": "Minimum Cost For Tickets", "difficulty": "Medium", "recommendation_by_slug": "/v1/recommendations/by-slug/minimum-cost-for-tickets.json", "recommendation_by_id": "/v1/recommendations/by-id/983.json" }, "996": { "question_id": "996", "task_id": "number-of-squareful-arrays", "title": "Number Of Squareful Arrays", "difficulty": "Hard", "recommendation_by_slug": "/v1/recommendations/by-slug/number-of-squareful-arrays.json", "recommendation_by_id": "/v1/recommendations/by-id/996.json" } } }