Skip to content

Instantly share code, notes, and snippets.

@pricklywiggles

pricklywiggles/hone.backup.json

Last active April 15, 2026 02:28
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save pricklywiggles/e5260522414efe5ebd79c7a210cd0af9 to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save pricklywiggles/e5260522414efe5ebd79c7a210cd0af9 to your computer and use it in GitHub Desktop.
Download ZIP
Hone full backup
Raw
hone.backup.json
{
"version": 2,
"exported_at": "2026-04-13T00:27:03Z",
"problems": [
{
"platform": "leetcode",
"slug": "132-pattern",
"title": "132 Pattern",
"difficulty": "medium",
"created_at": "2026-04-12 22:13:09",
"topics": [
"array",
"binary search",
"stack",
"monotonic stack",
"ordered set"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "2-keys-keyboard",
"title": "2 Keys Keyboard",
"difficulty": "medium",
"created_at": "2026-04-12 22:13:11",
"topics": [
"math",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "add-to-array-form-of-integer",
"title": "Add to Array-Form of Integer",
"difficulty": "easy",
"created_at": "2026-04-12 22:13:12",
"topics": [
"array",
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "adding-spaces-to-a-string",
"title": "Adding Spaces to a String",
"difficulty": "medium",
"created_at": "2026-04-12 22:13:14",
"topics": [
"array",
"two pointers",
"string",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "allow-one-function-call",
"title": "Allow One Function Call",
"difficulty": "easy",
"created_at": "2026-04-12 22:13:45",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "alternating-groups-ii",
"title": "Alternating Groups II",
"difficulty": "medium",
"created_at": "2026-04-12 22:13:46",
"topics": [
"array",
"sliding window"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "apply-operations-to-an-array",
"title": "Apply Operations to an Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:13:48",
"topics": [
"array",
"two pointers",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "apply-operations-to-maximize-score",
"title": "Apply Operations to Maximize Score",
"difficulty": "hard",
"created_at": "2026-04-12 22:13:52",
"topics": [
"array",
"stack",
"monotonic stack",
"math",
"greedy",
"sorting",
"number theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "apply-transform-over-each-element-in-array",
"title": "Apply Transform Over Each Element in Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:13:54",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "arithmetic-slices-ii-subsequence",
"title": "Arithmetic Slices II - Subsequence",
"difficulty": "hard",
"created_at": "2026-04-12 22:13:55",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "array-of-objects-to-matrix",
"title": "Array of Objects to Matrix",
"difficulty": "hard",
"created_at": "2026-04-12 22:13:57",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "array-prototype-last",
"title": "Array Prototype Last",
"difficulty": "easy",
"created_at": "2026-04-12 22:13:58",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "array-reduce-transformation",
"title": "Array Reduce Transformation",
"difficulty": "easy",
"created_at": "2026-04-12 22:14:00",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "array-with-elements-not-equal-to-average-of-neighbors",
"title": "Array With Elements Not Equal to Average of Neighbors",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:01",
"topics": [
"array",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "array-wrapper",
"title": "Array Wrapper",
"difficulty": "easy",
"created_at": "2026-04-12 22:14:02",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "as-far-from-land-as-possible",
"title": "As Far from Land as Possible",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:04",
"topics": [
"array",
"dynamic programming",
"breadth first search",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "average-waiting-time",
"title": "Average Waiting Time",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:06",
"topics": [
"array",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "backspace-string-compare",
"title": "Backspace String Compare",
"difficulty": "easy",
"created_at": "2026-04-12 22:14:07",
"topics": [
"stack",
"two pointers",
"string",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "bag-of-tokens",
"title": "Bag of Tokens",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:08",
"topics": [
"array",
"two pointers",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "best-sightseeing-pair",
"title": "Best Sightseeing Pair",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:10",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "best-team-with-no-conflicts",
"title": "Best Team With No Conflicts",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:12",
"topics": [
"array",
"dynamic programming",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "bitwise-xor-of-all-pairings",
"title": "Bitwise XOR of All Pairings",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:14",
"topics": [
"array",
"bit manipulation",
"brainteaser"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "brick-wall",
"title": "Brick Wall",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:15",
"topics": [
"array",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "cache-with-time-limit",
"title": "Cache With Time Limit",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:17",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "calculate-money-in-leetcode-bank",
"title": "Calculate Money in Leetcode Bank",
"difficulty": "easy",
"created_at": "2026-04-12 22:14:18",
"topics": [
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "call-function-with-custom-context",
"title": "Call Function with Custom Context",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:20",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "champagne-tower",
"title": "Champagne Tower",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:21",
"topics": [
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "check-if-a-parentheses-string-can-be-valid",
"title": "Check if a Parentheses String Can Be Valid",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:23",
"topics": [
"stack",
"string",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "check-if-a-string-contains-all-binary-codes-of-size-k",
"title": "Check If a String Contains All Binary Codes of Size K",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:24",
"topics": [
"string",
"bit manipulation",
"hash table",
"rolling hash",
"hash function"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "check-if-grid-can-be-cut-into-sections",
"title": "Check if Grid can be Cut into Sections",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:25",
"topics": [
"array",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "check-if-move-is-legal",
"title": "Check if Move is Legal",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:27",
"topics": [
"array",
"matrix",
"enumeration"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "check-if-number-is-a-sum-of-powers-of-three",
"title": "Check if Number is a Sum of Powers of Three",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:29",
"topics": [
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "check-if-object-instance-of-class",
"title": "Check if Object Instance of Class",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:30",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "check-if-one-string-swap-can-make-strings-equal",
"title": "Check if One String Swap Can Make Strings Equal",
"difficulty": "easy",
"created_at": "2026-04-12 22:14:32",
"topics": [
"string",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "check-if-there-is-a-valid-partition-for-the-array",
"title": "Check if There is a Valid Partition For The Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:34",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "check-if-two-string-arrays-are-equivalent",
"title": "Check If Two String Arrays are Equivalent",
"difficulty": "easy",
"created_at": "2026-04-12 22:14:35",
"topics": [
"array",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "cherry-pickup-ii",
"title": "Cherry Pickup II",
"difficulty": "hard",
"created_at": "2026-04-12 22:14:37",
"topics": [
"array",
"dynamic programming",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "chunk-array",
"title": "Chunk Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:14:38",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "circular-sentence",
"title": "Circular Sentence",
"difficulty": "easy",
"created_at": "2026-04-12 22:14:40",
"topics": [
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "clear-digits",
"title": "Clear Digits",
"difficulty": "easy",
"created_at": "2026-04-12 22:14:41",
"topics": [
"stack",
"string",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "closest-prime-numbers-in-range",
"title": "Closest Prime Numbers in Range",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:43",
"topics": [
"math",
"number theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "constrained-subsequence-sum",
"title": "Constrained Subsequence Sum",
"difficulty": "hard",
"created_at": "2026-04-12 22:14:45",
"topics": [
"array",
"dynamic programming",
"sliding window",
"queue",
"heap (priority queue)",
"monotonic queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "construct-binary-tree-from-preorder-and-postorder-traversal",
"title": "Construct Binary Tree from Preorder and Postorder Traversal",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:47",
"topics": [
"array",
"hash table",
"divide and conquer",
"tree",
"binary tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "construct-k-palindrome-strings",
"title": "Construct K Palindrome Strings",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:48",
"topics": [
"string",
"greedy",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "construct-smallest-number-from-di-string",
"title": "Construct Smallest Number From DI String",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:50",
"topics": [
"stack",
"string",
"greedy",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "construct-string-from-binary-tree",
"title": "Construct String from Binary Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:51",
"topics": [
"string",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "construct-string-with-repeat-limit",
"title": "Construct String With Repeat Limit",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:53",
"topics": [
"string",
"greedy",
"hash table",
"counting",
"heap (priority queue)"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "construct-the-lexicographically-largest-valid-sequence",
"title": "Construct the Lexicographically Largest Valid Sequence",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:55",
"topics": [
"array",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "contiguous-array",
"title": "Contiguous Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:56",
"topics": [
"array",
"hash table",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "convert-1d-array-into-2d-array",
"title": "Convert 1D Array Into 2D Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:14:58",
"topics": [
"array",
"simulation",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "convert-an-array-into-a-2d-array-with-conditions",
"title": "Convert an Array Into a 2D Array With Conditions",
"difficulty": "medium",
"created_at": "2026-04-12 22:14:59",
"topics": [
"array",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "convert-object-to-json-string",
"title": "Convert Object to JSON String",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:01",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "convert-sorted-array-to-binary-search-tree",
"title": "Convert Sorted Array to Binary Search Tree",
"difficulty": "easy",
"created_at": "2026-04-12 22:15:02",
"topics": [
"array",
"divide and conquer",
"tree",
"binary tree",
"binary search tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-all-valid-pickup-and-delivery-options",
"title": "Count All Valid Pickup and Delivery Options",
"difficulty": "hard",
"created_at": "2026-04-12 22:15:03",
"topics": [
"math",
"dynamic programming",
"combinatorics"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-days-without-meetings",
"title": "Count Days Without Meetings",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:05",
"topics": [
"array",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-number-of-bad-pairs",
"title": "Count Number of Bad Pairs",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:07",
"topics": [
"array",
"math",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-number-of-maximum-bitwise-or-subsets",
"title": "Count Number of Maximum Bitwise-OR Subsets",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:09",
"topics": [
"array",
"bit manipulation",
"enumeration",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-number-of-nice-subarrays",
"title": "Count Number of Nice Subarrays",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:10",
"topics": [
"array",
"math",
"sliding window",
"hash table",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-number-of-teams",
"title": "Count Number of Teams",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:12",
"topics": [
"array",
"dynamic programming",
"binary indexed tree",
"segment tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-of-matches-in-tournament",
"title": "Count of Matches in Tournament",
"difficulty": "easy",
"created_at": "2026-04-12 22:15:13",
"topics": [
"math",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-of-substrings-containing-every-vowel-and-k-consonants-ii",
"title": "Count of Substrings Containing Every Vowel and K Consonants II",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:15",
"topics": [
"string",
"sliding window",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-prefix-and-suffix-pairs-ii",
"title": "Count Prefix and Suffix Pairs II",
"difficulty": "hard",
"created_at": "2026-04-12 22:15:16",
"topics": [
"array",
"string",
"rolling hash",
"hash function",
"trie",
"string matching"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-square-submatrices-with-all-ones",
"title": "Count Square Submatrices with All Ones",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:18",
"topics": [
"array",
"dynamic programming",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-sub-islands",
"title": "Count Sub Islands",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:19",
"topics": [
"array",
"breadth first search",
"matrix",
"depth first search",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-subarrays-where-max-element-appears-at-least-k-times",
"title": "Count Subarrays Where Max Element Appears at Least K Times",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:21",
"topics": [
"array",
"sliding window"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-the-number-of-complete-components",
"title": "Count the Number of Complete Components",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:22",
"topics": [
"breadth first search",
"depth first search",
"union find",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-the-number-of-fair-pairs",
"title": "Count the Number of Fair Pairs",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:24",
"topics": [
"array",
"binary search",
"two pointers",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-total-number-of-colored-cells",
"title": "Count Total Number of Colored Cells",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:26",
"topics": [
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-triplets-that-can-form-two-arrays-of-equal-xor",
"title": "Count Triplets That Can Form Two Arrays of Equal XOR",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:27",
"topics": [
"array",
"math",
"bit manipulation",
"hash table",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-unguarded-cells-in-the-grid",
"title": "Count Unguarded Cells in the Grid",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:29",
"topics": [
"array",
"simulation",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-vowel-strings-in-ranges",
"title": "Count Vowel Strings in Ranges",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:30",
"topics": [
"array",
"string",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-vowels-permutation",
"title": "Count Vowels Permutation",
"difficulty": "hard",
"created_at": "2026-04-12 22:15:32",
"topics": [
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "count-ways-to-build-good-strings",
"title": "Count Ways To Build Good Strings",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:33",
"topics": [
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "counter",
"title": "Counter",
"difficulty": "easy",
"created_at": "2026-04-12 22:15:35",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "counter-ii",
"title": "Counter II",
"difficulty": "easy",
"created_at": "2026-04-12 22:15:37",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "cousins-in-binary-tree-ii",
"title": "Cousins in Binary Tree II",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:38",
"topics": [
"breadth first search",
"hash table",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "create-binary-tree-from-descriptions",
"title": "Create Binary Tree From Descriptions",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:40",
"topics": [
"array",
"hash table",
"tree",
"binary tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "create-hello-world-function",
"title": "Create Hello World Function",
"difficulty": "easy",
"created_at": "2026-04-12 22:15:42",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "curry",
"title": "Curry",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:43",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "data-stream-as-disjoint-intervals",
"title": "Data Stream as Disjoint Intervals",
"difficulty": "hard",
"created_at": "2026-04-12 22:15:45",
"topics": [
"binary search",
"ordered set",
"hash table",
"union find",
"design",
"data stream"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "debounce",
"title": "Debounce",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:46",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "defuse-the-bomb",
"title": "Defuse the Bomb",
"difficulty": "easy",
"created_at": "2026-04-12 22:15:48",
"topics": [
"array",
"sliding window"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "delete-and-earn",
"title": "Delete and Earn",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:50",
"topics": [
"array",
"dynamic programming",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "delete-nodes-and-return-forest",
"title": "Delete Nodes And Return Forest",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:51",
"topics": [
"array",
"hash table",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "delete-nodes-from-linked-list-present-in-array",
"title": "Delete Nodes From Linked List Present in Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:53",
"topics": [
"array",
"hash table",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "design-a-food-rating-system",
"title": "Design a Food Rating System",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:54",
"topics": [
"array",
"ordered set",
"string",
"hash table",
"heap (priority queue)",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "design-browser-history",
"title": "Design Browser History",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:56",
"topics": [
"array",
"stack",
"design",
"data stream",
"linked list",
"doubly linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "design-linked-list",
"title": "Design Linked List",
"difficulty": "medium",
"created_at": "2026-04-12 22:15:57",
"topics": [
"design",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "design-parking-system",
"title": "Design Parking System",
"difficulty": "easy",
"created_at": "2026-04-12 22:15:58",
"topics": [
"simulation",
"counting",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "design-underground-system",
"title": "Design Underground System",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:04",
"topics": [
"string",
"hash table",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "destination-city",
"title": "Destination City",
"difficulty": "easy",
"created_at": "2026-04-12 22:16:05",
"topics": [
"array",
"string",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "detonate-the-maximum-bombs",
"title": "Detonate the Maximum Bombs",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:07",
"topics": [
"array",
"math",
"breadth first search",
"depth first search",
"graph theory",
"geometry"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "differences-between-two-objects",
"title": "Differences Between Two Objects",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:08",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "different-ways-to-add-parentheses",
"title": "Different Ways to Add Parentheses",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:10",
"topics": [
"math",
"dynamic programming",
"string",
"recursion",
"memoization"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "distribute-coins-in-binary-tree",
"title": "Distribute Coins in Binary Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:11",
"topics": [
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "divide-array-into-arrays-with-max-difference",
"title": "Divide Array Into Arrays With Max Difference",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:13",
"topics": [
"array",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "divide-intervals-into-minimum-number-of-groups",
"title": "Divide Intervals Into Minimum Number of Groups",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:15",
"topics": [
"array",
"two pointers",
"greedy",
"sorting",
"heap (priority queue)",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "divide-nodes-into-the-maximum-number-of-groups",
"title": "Divide Nodes Into the Maximum Number of Groups",
"difficulty": "hard",
"created_at": "2026-04-12 22:16:16",
"topics": [
"breadth first search",
"depth first search",
"union find",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "divide-players-into-teams-of-equal-skill",
"title": "Divide Players Into Teams of Equal Skill",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:18",
"topics": [
"array",
"two pointers",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "eliminate-maximum-number-of-monsters",
"title": "Eliminate Maximum Number of Monsters",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:20",
"topics": [
"array",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "encode-and-decode-tinyurl",
"title": "Encode and Decode TinyURL",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:22",
"topics": [
"string",
"hash table",
"hash function",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "evaluate-boolean-binary-tree",
"title": "Evaluate Boolean Binary Tree",
"difficulty": "easy",
"created_at": "2026-04-12 22:16:23",
"topics": [
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "even-odd-tree",
"title": "Even Odd Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:24",
"topics": [
"breadth first search",
"tree",
"binary tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "event-emitter",
"title": "Event Emitter",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:26",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "filling-bookcase-shelves",
"title": "Filling Bookcase Shelves",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:27",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "filter-elements-from-array",
"title": "Filter Elements from Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:16:29",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "final-prices-with-a-special-discount-in-a-shop",
"title": "Final Prices With a Special Discount in a Shop",
"difficulty": "easy",
"created_at": "2026-04-12 22:16:30",
"topics": [
"array",
"stack",
"monotonic stack"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-all-anagrams-in-a-string",
"title": "Find All Anagrams in a String",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:32",
"topics": [
"string",
"sliding window",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-all-duplicates-in-an-array",
"title": "Find All Duplicates in an Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:33",
"topics": [
"array",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-all-people-with-secret",
"title": "Find All People With Secret",
"difficulty": "hard",
"created_at": "2026-04-12 22:16:35",
"topics": [
"sorting",
"breadth first search",
"depth first search",
"union find",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-all-possible-recipes-from-given-supplies",
"title": "Find All Possible Recipes from Given Supplies",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:36",
"topics": [
"array",
"string",
"hash table",
"graph theory",
"topological sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-bottom-left-tree-value",
"title": "Find Bottom Left Tree Value",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:37",
"topics": [
"breadth first search",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-building-where-alice-and-bob-can-meet",
"title": "Find Building Where Alice and Bob Can Meet",
"difficulty": "hard",
"created_at": "2026-04-12 22:16:39",
"topics": [
"array",
"binary search",
"stack",
"monotonic stack",
"heap (priority queue)",
"binary indexed tree",
"segment tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-champion-ii",
"title": "Find Champion II",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:40",
"topics": [
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-closest-node-to-given-two-nodes",
"title": "Find Closest Node to Given Two Nodes",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:42",
"topics": [
"depth first search",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-common-characters",
"title": "Find Common Characters",
"difficulty": "easy",
"created_at": "2026-04-12 22:16:43",
"topics": [
"array",
"string",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-duplicate-subtrees",
"title": "Find Duplicate Subtrees",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:45",
"topics": [
"hash table",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-eventual-safe-states",
"title": "Find Eventual Safe States",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:46",
"topics": [
"breadth first search",
"depth first search",
"graph theory",
"topological sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-first-palindromic-string-in-the-array",
"title": "Find First Palindromic String in the Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:16:48",
"topics": [
"array",
"two pointers",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-if-array-can-be-sorted",
"title": "Find if Array Can Be Sorted",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:49",
"topics": [
"array",
"sorting",
"bit manipulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-k-th-smallest-pair-distance",
"title": "Find K-th Smallest Pair Distance",
"difficulty": "hard",
"created_at": "2026-04-12 22:16:51",
"topics": [
"array",
"binary search",
"two pointers",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-kth-bit-in-nth-binary-string",
"title": "Find Kth Bit in Nth Binary String",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:52",
"topics": [
"string",
"simulation",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-largest-value-in-each-tree-row",
"title": "Find Largest Value in Each Tree Row",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:54",
"topics": [
"breadth first search",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-minimum-diameter-after-merging-two-trees",
"title": "Find Minimum Diameter After Merging Two Trees",
"difficulty": "hard",
"created_at": "2026-04-12 22:16:55",
"topics": [
"breadth first search",
"tree",
"depth first search",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-missing-observations",
"title": "Find Missing Observations",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:57",
"topics": [
"array",
"math",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-polygon-with-the-largest-perimeter",
"title": "Find Polygon With the Largest Perimeter",
"difficulty": "medium",
"created_at": "2026-04-12 22:16:58",
"topics": [
"array",
"greedy",
"sorting",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "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",
"created_at": "2026-04-12 22:17:00",
"topics": [
"dynamic programming",
"graph theory",
"shortest path"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-the-kth-largest-integer-in-the-array",
"title": "Find the Kth Largest Integer in the Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:01",
"topics": [
"array",
"string",
"sorting",
"heap (priority queue)",
"divide and conquer",
"quickselect"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-the-length-of-the-longest-common-prefix",
"title": "Find the Length of the Longest Common Prefix",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:03",
"topics": [
"array",
"string",
"hash table",
"trie"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-the-longest-substring-containing-vowels-in-even-counts",
"title": "Find the Longest Substring Containing Vowels in Even Counts",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:04",
"topics": [
"string",
"bit manipulation",
"hash table",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-the-longest-valid-obstacle-course-at-each-position",
"title": "Find the Longest Valid Obstacle Course at Each Position",
"difficulty": "hard",
"created_at": "2026-04-12 22:17:06",
"topics": [
"array",
"binary search",
"binary indexed tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-the-maximum-sum-of-node-values",
"title": "Find the Maximum Sum of Node Values",
"difficulty": "hard",
"created_at": "2026-04-12 22:17:08",
"topics": [
"array",
"dynamic programming",
"greedy",
"sorting",
"bit manipulation",
"tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-the-minimum-and-maximum-number-of-nodes-between-critical-points",
"title": "Find the Minimum and Maximum Number of Nodes Between Critical Points",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:09",
"topics": [
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-the-power-of-k-size-subarrays-i",
"title": "Find the Power of K-Size Subarrays I",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:11",
"topics": [
"array",
"sliding window"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-the-punishment-number-of-an-integer",
"title": "Find the Punishment Number of an Integer",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:12",
"topics": [
"math",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-the-safest-path-in-a-grid",
"title": "Find the Safest Path in a Grid",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:14",
"topics": [
"array",
"binary search",
"breadth first search",
"matrix",
"heap (priority queue)",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-the-winner-of-the-circular-game",
"title": "Find the Winner of the Circular Game",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:16",
"topics": [
"array",
"math",
"simulation",
"queue",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-unique-binary-string",
"title": "Find Unique Binary String",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:17",
"topics": [
"array",
"string",
"hash table",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-valid-matrix-given-row-and-column-sums",
"title": "Find Valid Matrix Given Row and Column Sums",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:19",
"topics": [
"array",
"greedy",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "flatten-deeply-nested-array",
"title": "Flatten Deeply Nested Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:21",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "flatten-nested-list-iterator",
"title": "Flatten Nested List Iterator",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:22",
"topics": [
"stack",
"queue",
"tree",
"depth first search",
"design",
"iterator"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "flip-columns-for-maximum-number-of-equal-rows",
"title": "Flip Columns For Maximum Number of Equal Rows",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:24",
"topics": [
"array",
"matrix",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "flip-equivalent-binary-trees",
"title": "Flip Equivalent Binary Trees",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:26",
"topics": [
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "flip-string-to-monotone-increasing",
"title": "Flip String to Monotone Increasing",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:27",
"topics": [
"dynamic programming",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "freedom-trail",
"title": "Freedom Trail",
"difficulty": "hard",
"created_at": "2026-04-12 22:17:29",
"topics": [
"dynamic programming",
"string",
"breadth first search",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "function-composition",
"title": "Function Composition",
"difficulty": "easy",
"created_at": "2026-04-12 22:17:30",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "furthest-building-you-can-reach",
"title": "Furthest Building You Can Reach",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:31",
"topics": [
"array",
"greedy",
"heap (priority queue)"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "generate-fibonacci-sequence",
"title": "Generate Fibonacci Sequence",
"difficulty": "easy",
"created_at": "2026-04-12 22:17:33",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "get-equal-substrings-within-budget",
"title": "Get Equal Substrings Within Budget",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:34",
"topics": [
"binary search",
"string",
"sliding window",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "grid-game",
"title": "Grid Game",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:36",
"topics": [
"array",
"matrix",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "group-by",
"title": "Group By",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:37",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "house-robber-iv",
"title": "House Robber IV",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:39",
"topics": [
"array",
"binary search",
"dynamic programming",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "image-smoother",
"title": "Image Smoother",
"difficulty": "easy",
"created_at": "2026-04-12 22:17:41",
"topics": [
"array",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "integer-to-english-words",
"title": "Integer to English Words",
"difficulty": "hard",
"created_at": "2026-04-12 22:17:42",
"topics": [
"math",
"string",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "is-graph-bipartite",
"title": "Is Graph Bipartite?",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:44",
"topics": [
"breadth first search",
"depth first search",
"union find",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "json-deep-equal",
"title": "JSON Deep Equal",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:45",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "k-inverse-pairs-array",
"title": "K Inverse Pairs Array",
"difficulty": "hard",
"created_at": "2026-04-12 22:17:47",
"topics": [
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "k-th-symbol-in-grammar",
"title": "K-th Symbol in Grammar",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:48",
"topics": [
"math",
"bit manipulation",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "knight-dialer",
"title": "Knight Dialer",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:50",
"topics": [
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "kth-largest-sum-in-a-binary-tree",
"title": "Kth Largest Sum in a Binary Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:51",
"topics": [
"sorting",
"breadth first search",
"tree",
"binary tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "largest-color-value-in-a-directed-graph",
"title": "Largest Color Value in a Directed Graph",
"difficulty": "hard",
"created_at": "2026-04-12 22:17:53",
"topics": [
"dynamic programming",
"string",
"hash table",
"counting",
"graph theory",
"memoization",
"topological sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "largest-combination-with-bitwise-and-greater-than-zero",
"title": "Largest Combination With Bitwise AND Greater Than Zero",
"difficulty": "medium",
"created_at": "2026-04-12 22:17:54",
"topics": [
"array",
"bit manipulation",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "largest-local-values-in-a-matrix",
"title": "Largest Local Values in a Matrix",
"difficulty": "easy",
"created_at": "2026-04-12 22:17:56",
"topics": [
"array",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "largest-odd-number-in-string",
"title": "Largest Odd Number in String",
"difficulty": "easy",
"created_at": "2026-04-12 22:17:57",
"topics": [
"math",
"string",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "largest-substring-between-two-equal-characters",
"title": "Largest Substring Between Two Equal Characters",
"difficulty": "easy",
"created_at": "2026-04-12 22:17:59",
"topics": [
"string",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "leaf-similar-trees",
"title": "Leaf-Similar Trees",
"difficulty": "easy",
"created_at": "2026-04-12 22:18:01",
"topics": [
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "least-number-of-unique-integers-after-k-removals",
"title": "Least Number of Unique Integers after K Removals",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:02",
"topics": [
"array",
"greedy",
"sorting",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "length-of-longest-fibonacci-subsequence",
"title": "Length of Longest Fibonacci Subsequence",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:04",
"topics": [
"array",
"dynamic programming",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "length-of-longest-subarray-with-at-most-k-frequency",
"title": "Length of Longest Subarray With at Most K Frequency",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:06",
"topics": [
"array",
"sliding window",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "letter-tile-possibilities",
"title": "Letter Tile Possibilities",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:08",
"topics": [
"string",
"hash table",
"counting",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "lexicographical-numbers",
"title": "Lexicographical Numbers",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:09",
"topics": [
"depth first search",
"trie"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "linked-list-in-binary-tree",
"title": "Linked List in Binary Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:11",
"topics": [
"tree",
"binary tree",
"depth first search",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "longest-ideal-subsequence",
"title": "Longest Ideal Subsequence",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:12",
"topics": [
"dynamic programming",
"string",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "longest-nice-subarray",
"title": "Longest Nice Subarray",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:14",
"topics": [
"array",
"sliding window",
"bit manipulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "longest-palindrome",
"title": "Longest Palindrome",
"difficulty": "easy",
"created_at": "2026-04-12 22:18:16",
"topics": [
"string",
"greedy",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "longest-palindromic-subsequence",
"title": "Longest Palindromic Subsequence",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:17",
"topics": [
"dynamic programming",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "longest-string-chain",
"title": "Longest String Chain",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:19",
"topics": [
"array",
"dynamic programming",
"two pointers",
"string",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "longest-subarray-with-maximum-bitwise-and",
"title": "Longest Subarray With Maximum Bitwise AND",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:21",
"topics": [
"array",
"bit manipulation",
"brainteaser"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "lucky-numbers-in-a-matrix",
"title": "Lucky Numbers in a Matrix",
"difficulty": "easy",
"created_at": "2026-04-12 22:18:22",
"topics": [
"array",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "magic-squares-in-grid",
"title": "Magic Squares In Grid",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:24",
"topics": [
"array",
"math",
"matrix",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "make-lexicographically-smallest-array-by-swapping-elements",
"title": "Make Lexicographically Smallest Array by Swapping Elements",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:25",
"topics": [
"array",
"sorting",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "make-sum-divisible-by-p",
"title": "Make Sum Divisible by P",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:27",
"topics": [
"array",
"hash table",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "make-the-string-great",
"title": "Make The String Great",
"difficulty": "easy",
"created_at": "2026-04-12 22:18:28",
"topics": [
"stack",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "make-two-arrays-equal-by-reversing-subarrays",
"title": "Make Two Arrays Equal by Reversing Subarrays",
"difficulty": "easy",
"created_at": "2026-04-12 22:18:30",
"topics": [
"array",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "making-a-large-island",
"title": "Making A Large Island",
"difficulty": "hard",
"created_at": "2026-04-12 22:18:31",
"topics": [
"array",
"breadth first search",
"matrix",
"depth first search",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "max-chunks-to-make-sorted",
"title": "Max Chunks To Make Sorted",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:33",
"topics": [
"array",
"stack",
"monotonic stack",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "max-points-on-a-line",
"title": "Max Points on a Line",
"difficulty": "hard",
"created_at": "2026-04-12 22:18:34",
"topics": [
"array",
"math",
"hash table",
"geometry"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximal-score-after-applying-k-operations",
"title": "Maximal Score After Applying K Operations",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:36",
"topics": [
"array",
"greedy",
"heap (priority queue)"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximize-score-after-n-operations",
"title": "Maximize Score After N Operations",
"difficulty": "hard",
"created_at": "2026-04-12 22:18:37",
"topics": [
"array",
"math",
"dynamic programming",
"number theory",
"bit manipulation",
"backtracking",
"bitmask"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-absolute-sum-of-any-subarray",
"title": "Maximum Absolute Sum of Any Subarray",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:39",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-alternating-subsequence-sum",
"title": "Maximum Alternating Subsequence Sum",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:40",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-beauty-of-an-array-after-applying-operation",
"title": "Maximum Beauty of an Array After Applying Operation",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:42",
"topics": [
"array",
"binary search",
"sliding window",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-candies-allocated-to-k-children",
"title": "Maximum Candies Allocated to K Children",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:43",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-element-after-decreasing-and-rearranging",
"title": "Maximum Element After Decreasing and Rearranging",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:45",
"topics": [
"array",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-employees-to-be-invited-to-a-meeting",
"title": "Maximum Employees to Be Invited to a Meeting",
"difficulty": "hard",
"created_at": "2026-04-12 22:18:47",
"topics": [
"array",
"dynamic programming",
"depth first search",
"graph theory",
"topological sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-length-of-a-concatenated-string-with-unique-characters",
"title": "Maximum Length of a Concatenated String with Unique Characters",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:48",
"topics": [
"array",
"string",
"bit manipulation",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-length-of-pair-chain",
"title": "Maximum Length of Pair Chain",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:50",
"topics": [
"array",
"dynamic programming",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-matrix-sum",
"title": "Maximum Matrix Sum",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:51",
"topics": [
"array",
"greedy",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-number-of-fish-in-a-grid",
"title": "Maximum Number of Fish in a Grid",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:53",
"topics": [
"array",
"breadth first search",
"matrix",
"depth first search",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-number-of-k-divisible-components",
"title": "Maximum Number of K-Divisible Components",
"difficulty": "hard",
"created_at": "2026-04-12 22:18:54",
"topics": [
"tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-number-of-points-from-grid-queries",
"title": "Maximum Number of Points From Grid Queries",
"difficulty": "hard",
"created_at": "2026-04-12 22:18:56",
"topics": [
"array",
"two pointers",
"sorting",
"breadth first search",
"matrix",
"heap (priority queue)",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-number-of-removable-characters",
"title": "Maximum Number of Removable Characters",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:57",
"topics": [
"array",
"binary search",
"two pointers",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-number-of-vowels-in-a-substring-of-given-length",
"title": "Maximum Number of Vowels in a Substring of Given Length",
"difficulty": "medium",
"created_at": "2026-04-12 22:18:59",
"topics": [
"string",
"sliding window"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-performance-of-a-team",
"title": "Maximum Performance of a Team",
"difficulty": "hard",
"created_at": "2026-04-12 22:19:00",
"topics": [
"array",
"greedy",
"sorting",
"heap (priority queue)"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-product-of-the-length-of-two-palindromic-subsequences",
"title": "Maximum Product of the Length of Two Palindromic Subsequences",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:02",
"topics": [
"dynamic programming",
"string",
"bit manipulation",
"backtracking",
"bitmask"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-score-from-removing-substrings",
"title": "Maximum Score From Removing Substrings",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:04",
"topics": [
"stack",
"string",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-score-of-a-good-subarray",
"title": "Maximum Score of a Good Subarray",
"difficulty": "hard",
"created_at": "2026-04-12 22:19:05",
"topics": [
"array",
"binary search",
"stack",
"monotonic stack",
"two pointers"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-score-words-formed-by-letters",
"title": "Maximum Score Words Formed by Letters",
"difficulty": "hard",
"created_at": "2026-04-12 22:19:06",
"topics": [
"array",
"dynamic programming",
"string",
"bit manipulation",
"hash table",
"counting",
"backtracking",
"bitmask"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-subarray-min-product",
"title": "Maximum Subarray Min-Product",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:08",
"topics": [
"array",
"stack",
"monotonic stack",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-subsequence-score",
"title": "Maximum Subsequence Score",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:09",
"topics": [
"array",
"greedy",
"sorting",
"heap (priority queue)"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-sum-of-3-non-overlapping-subarrays",
"title": "Maximum Sum of 3 Non-Overlapping Subarrays",
"difficulty": "hard",
"created_at": "2026-04-12 22:19:11",
"topics": [
"array",
"dynamic programming",
"sliding window",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-sum-of-distinct-subarrays-with-length-k",
"title": "Maximum Sum of Distinct Subarrays With Length K",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:12",
"topics": [
"array",
"sliding window",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-swap",
"title": "Maximum Swap",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:14",
"topics": [
"math",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-total-importance-of-roads",
"title": "Maximum Total Importance of Roads",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:15",
"topics": [
"greedy",
"sorting",
"heap (priority queue)",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-value-of-k-coins-from-piles",
"title": "Maximum Value of K Coins From Piles",
"difficulty": "hard",
"created_at": "2026-04-12 22:19:17",
"topics": [
"array",
"dynamic programming",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-width-of-binary-tree",
"title": "Maximum Width of Binary Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:18",
"topics": [
"breadth first search",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-width-ramp",
"title": "Maximum Width Ramp",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:20",
"topics": [
"array",
"stack",
"monotonic stack",
"two pointers"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximum-xor-for-each-query",
"title": "Maximum XOR for Each Query",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:21",
"topics": [
"array",
"bit manipulation",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "memoize",
"title": "Memoize",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:23",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "merge-in-between-linked-lists",
"title": "Merge In Between Linked Lists",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:24",
"topics": [
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "merge-nodes-in-between-zeros",
"title": "Merge Nodes in Between Zeros",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:26",
"topics": [
"simulation",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "merge-two-2d-arrays-by-summing-values",
"title": "Merge Two 2D Arrays by Summing Values",
"difficulty": "easy",
"created_at": "2026-04-12 22:19:27",
"topics": [
"array",
"two pointers",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimize-deviation-in-array",
"title": "Minimize Deviation in Array",
"difficulty": "hard",
"created_at": "2026-04-12 22:19:29",
"topics": [
"array",
"ordered set",
"greedy",
"heap (priority queue)"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimize-maximum-of-array",
"title": "Minimize Maximum of Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:30",
"topics": [
"array",
"binary search",
"dynamic programming",
"greedy",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimize-xor",
"title": "Minimize XOR",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:32",
"topics": [
"greedy",
"bit manipulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimized-maximum-of-products-distributed-to-any-store",
"title": "Minimized Maximum of Products Distributed to Any Store",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:33",
"topics": [
"array",
"binary search",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-add-to-make-parentheses-valid",
"title": "Minimum Add to Make Parentheses Valid",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:35",
"topics": [
"stack",
"string",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-bit-flips-to-convert-number",
"title": "Minimum Bit Flips to Convert Number",
"difficulty": "easy",
"created_at": "2026-04-12 22:19:37",
"topics": [
"bit manipulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-cost-to-convert-string-i",
"title": "Minimum Cost to Convert String I",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:38",
"topics": [
"array",
"string",
"graph theory",
"shortest path"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-cost-to-cut-a-stick",
"title": "Minimum Cost to Cut a Stick",
"difficulty": "hard",
"created_at": "2026-04-12 22:19:40",
"topics": [
"array",
"dynamic programming",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-cost-to-hire-k-workers",
"title": "Minimum Cost to Hire K Workers",
"difficulty": "hard",
"created_at": "2026-04-12 22:19:42",
"topics": [
"array",
"greedy",
"sorting",
"heap (priority queue)"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-cost-to-make-at-least-one-valid-path-in-a-grid",
"title": "Minimum Cost to Make at Least One Valid Path in a Grid",
"difficulty": "hard",
"created_at": "2026-04-12 22:19:43",
"topics": [
"array",
"breadth first search",
"matrix",
"heap (priority queue)",
"graph theory",
"shortest path"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-cost-walk-in-weighted-graph",
"title": "Minimum Cost Walk in Weighted Graph",
"difficulty": "hard",
"created_at": "2026-04-12 22:19:45",
"topics": [
"array",
"bit manipulation",
"union find",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-deletions-to-make-character-frequencies-unique",
"title": "Minimum Deletions to Make Character Frequencies Unique",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:46",
"topics": [
"string",
"greedy",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-deletions-to-make-string-balanced",
"title": "Minimum Deletions to Make String Balanced",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:48",
"topics": [
"stack",
"dynamic programming",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-difference-between-largest-and-smallest-value-in-three-moves",
"title": "Minimum Difference Between Largest and Smallest Value in Three Moves",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:49",
"topics": [
"array",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-difficulty-of-a-job-schedule",
"title": "Minimum Difficulty of a Job Schedule",
"difficulty": "hard",
"created_at": "2026-04-12 22:19:51",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-distance-between-bst-nodes",
"title": "Minimum Distance Between BST Nodes",
"difficulty": "easy",
"created_at": "2026-04-12 22:19:52",
"topics": [
"breadth first search",
"tree",
"binary tree",
"depth first search",
"binary search tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-falling-path-sum",
"title": "Minimum Falling Path Sum",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:54",
"topics": [
"array",
"dynamic programming",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-falling-path-sum-ii",
"title": "Minimum Falling Path Sum II",
"difficulty": "hard",
"created_at": "2026-04-12 22:19:55",
"topics": [
"array",
"dynamic programming",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-fuel-cost-to-report-to-the-capital",
"title": "Minimum Fuel Cost to Report to the Capital",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:57",
"topics": [
"breadth first search",
"tree",
"depth first search",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-increment-to-make-array-unique",
"title": "Minimum Increment to Make Array Unique",
"difficulty": "medium",
"created_at": "2026-04-12 22:19:59",
"topics": [
"array",
"greedy",
"sorting",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-index-of-a-valid-split",
"title": "Minimum Index of a Valid Split",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:00",
"topics": [
"array",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-length-of-string-after-deleting-similar-ends",
"title": "Minimum Length of String After Deleting Similar Ends",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:01",
"topics": [
"two pointers",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-length-of-string-after-operations",
"title": "Minimum Length of String After Operations",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:03",
"topics": [
"string",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-limit-of-balls-in-a-bag",
"title": "Minimum Limit of Balls in a Bag",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:06",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-number-of-arrows-to-burst-balloons",
"title": "Minimum Number of Arrows to Burst Balloons",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:07",
"topics": [
"array",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-number-of-changes-to-make-binary-string-beautiful",
"title": "Minimum Number of Changes to Make Binary String Beautiful",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:09",
"topics": [
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-number-of-days-to-disconnect-island",
"title": "Minimum Number of Days to Disconnect Island",
"difficulty": "hard",
"created_at": "2026-04-12 22:20:11",
"topics": [
"array",
"breadth first search",
"matrix",
"depth first search",
"strongly connected component"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-number-of-days-to-eat-n-oranges",
"title": "Minimum Number of Days to Eat N Oranges",
"difficulty": "hard",
"created_at": "2026-04-12 22:20:12",
"topics": [
"dynamic programming",
"memoization"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-number-of-flips-to-make-the-binary-string-alternating",
"title": "Minimum Number of Flips to Make the Binary String Alternating",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:14",
"topics": [
"dynamic programming",
"string",
"sliding window"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-number-of-k-consecutive-bit-flips",
"title": "Minimum Number of K Consecutive Bit Flips",
"difficulty": "hard",
"created_at": "2026-04-12 22:20:16",
"topics": [
"array",
"sliding window",
"bit manipulation",
"queue",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-number-of-operations-to-make-array-continuous",
"title": "Minimum Number of Operations to Make Array Continuous",
"difficulty": "hard",
"created_at": "2026-04-12 22:20:17",
"topics": [
"array",
"binary search",
"sliding window",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-number-of-operations-to-move-all-balls-to-each-box",
"title": "Minimum Number of Operations to Move All Balls to Each Box",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:18",
"topics": [
"array",
"string",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-number-of-operations-to-sort-a-binary-tree-by-level",
"title": "Minimum Number of Operations to Sort a Binary Tree by Level",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:20",
"topics": [
"breadth first search",
"tree",
"binary tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-number-of-pushes-to-type-word-ii",
"title": "Minimum Number of Pushes to Type Word II",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:22",
"topics": [
"string",
"greedy",
"sorting",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-number-of-removals-to-make-mountain-array",
"title": "Minimum Number of Removals to Make Mountain Array",
"difficulty": "hard",
"created_at": "2026-04-12 22:20:23",
"topics": [
"array",
"binary search",
"dynamic programming",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-number-of-swaps-to-make-the-string-balanced",
"title": "Minimum Number of Swaps to Make the String Balanced",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:25",
"topics": [
"stack",
"two pointers",
"string",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-number-of-vertices-to-reach-all-nodes",
"title": "Minimum Number of Vertices to Reach All Nodes",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:26",
"topics": [
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-obstacle-removal-to-reach-corner",
"title": "Minimum Obstacle Removal to Reach Corner",
"difficulty": "hard",
"created_at": "2026-04-12 22:20:28",
"topics": [
"array",
"breadth first search",
"matrix",
"heap (priority queue)",
"graph theory",
"shortest path"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-one-bit-operations-to-make-integers-zero",
"title": "Minimum One Bit Operations to Make Integers Zero",
"difficulty": "hard",
"created_at": "2026-04-12 22:20:30",
"topics": [
"math",
"dynamic programming",
"bit manipulation",
"recursion",
"memoization"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-operations-to-make-a-uni-value-grid",
"title": "Minimum Operations to Make a Uni-Value Grid",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:31",
"topics": [
"array",
"math",
"sorting",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-operations-to-make-binary-array-elements-equal-to-one-i",
"title": "Minimum Operations to Make Binary Array Elements Equal to One I",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:33",
"topics": [
"array",
"sliding window",
"bit manipulation",
"queue",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-operations-to-reduce-x-to-zero",
"title": "Minimum Operations to Reduce X to Zero",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:34",
"topics": [
"array",
"binary search",
"sliding window",
"hash table",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-penalty-for-a-shop",
"title": "Minimum Penalty for a Shop",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:36",
"topics": [
"string",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-score-of-a-path-between-two-cities",
"title": "Minimum Score of a Path Between Two Cities",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:38",
"topics": [
"breadth first search",
"depth first search",
"union find",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-string-length-after-removing-substrings",
"title": "Minimum String Length After Removing Substrings",
"difficulty": "easy",
"created_at": "2026-04-12 22:20:39",
"topics": [
"stack",
"string",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-swaps-to-group-all-1s-together-ii",
"title": "Minimum Swaps to Group All 1's Together II",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:41",
"topics": [
"array",
"sliding window"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-time-difference",
"title": "Minimum Time Difference",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:42",
"topics": [
"array",
"math",
"string",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-time-to-make-rope-colorful",
"title": "Minimum Time to Make Rope Colorful",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:44",
"topics": [
"array",
"dynamic programming",
"string",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-time-to-repair-cars",
"title": "Minimum Time to Repair Cars",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:45",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-time-to-visit-a-cell-in-a-grid",
"title": "Minimum Time to Visit a Cell In a Grid",
"difficulty": "hard",
"created_at": "2026-04-12 22:20:47",
"topics": [
"array",
"breadth first search",
"matrix",
"heap (priority queue)",
"graph theory",
"shortest path"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "most-beautiful-item-for-each-query",
"title": "Most Beautiful Item for Each Query",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:48",
"topics": [
"array",
"binary search",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "most-profitable-path-in-a-tree",
"title": "Most Profitable Path in a Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:50",
"topics": [
"array",
"breadth first search",
"tree",
"depth first search",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "my-calendar-i",
"title": "My Calendar I",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:52",
"topics": [
"array",
"binary search",
"ordered set",
"segment tree",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "my-calendar-ii",
"title": "My Calendar II",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:53",
"topics": [
"array",
"binary search",
"ordered set",
"prefix sum",
"segment tree",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "naming-a-company",
"title": "Naming a Company",
"difficulty": "hard",
"created_at": "2026-04-12 22:20:55",
"topics": [
"array",
"string",
"bit manipulation",
"hash table",
"enumeration"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "neighboring-bitwise-xor",
"title": "Neighboring Bitwise XOR",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:56",
"topics": [
"array",
"bit manipulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "nested-array-generator",
"title": "Nested Array Generator",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:58",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "non-decreasing-array",
"title": "Non-decreasing Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:20:59",
"topics": [
"array"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-atoms",
"title": "Number of Atoms",
"difficulty": "hard",
"created_at": "2026-04-12 22:21:01",
"topics": [
"stack",
"string",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-closed-islands",
"title": "Number of Closed Islands",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:02",
"topics": [
"array",
"breadth first search",
"matrix",
"depth first search",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-dice-rolls-with-target-sum",
"title": "Number of Dice Rolls With Target Sum",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:04",
"topics": [
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-flowers-in-full-bloom",
"title": "Number of Flowers in Full Bloom",
"difficulty": "hard",
"created_at": "2026-04-12 22:21:06",
"topics": [
"array",
"binary search",
"ordered set",
"sorting",
"hash table",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-good-leaf-nodes-pairs",
"title": "Number of Good Leaf Nodes Pairs",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:07",
"topics": [
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-good-paths",
"title": "Number of Good Paths",
"difficulty": "hard",
"created_at": "2026-04-12 22:21:09",
"topics": [
"array",
"sorting",
"hash table",
"tree",
"union find",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-laser-beams-in-a-bank",
"title": "Number of Laser Beams in a Bank",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:11",
"topics": [
"array",
"math",
"string",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-longest-increasing-subsequence",
"title": "Number of Longest Increasing Subsequence",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:12",
"topics": [
"array",
"dynamic programming",
"binary indexed tree",
"segment tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-music-playlists",
"title": "Number of Music Playlists",
"difficulty": "hard",
"created_at": "2026-04-12 22:21:14",
"topics": [
"math",
"dynamic programming",
"combinatorics"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-pairs-of-interchangeable-rectangles",
"title": "Number of Pairs of Interchangeable Rectangles",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:16",
"topics": [
"array",
"math",
"number theory",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-sub-arrays-with-odd-sum",
"title": "Number of Sub-arrays With Odd Sum",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:17",
"topics": [
"array",
"math",
"dynamic programming",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-submatrices-that-sum-to-target",
"title": "Number of Submatrices That Sum to Target",
"difficulty": "hard",
"created_at": "2026-04-12 22:21:19",
"topics": [
"array",
"matrix",
"hash table",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-substrings-containing-all-three-characters",
"title": "Number of Substrings Containing All Three Characters",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:21",
"topics": [
"string",
"sliding window",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-ways-to-arrive-at-destination",
"title": "Number of Ways to Arrive at Destination",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:22",
"topics": [
"dynamic programming",
"graph theory",
"topological sort",
"shortest path"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-ways-to-divide-a-long-corridor",
"title": "Number of Ways to Divide a Long Corridor",
"difficulty": "hard",
"created_at": "2026-04-12 22:21:24",
"topics": [
"math",
"dynamic programming",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "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",
"created_at": "2026-04-12 22:21:26",
"topics": [
"array",
"dynamic programming",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-ways-to-rearrange-sticks-with-k-sticks-visible",
"title": "Number of Ways to Rearrange Sticks With K Sticks Visible",
"difficulty": "hard",
"created_at": "2026-04-12 22:21:27",
"topics": [
"math",
"dynamic programming",
"combinatorics"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-ways-to-split-array",
"title": "Number of Ways to Split Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:29",
"topics": [
"array",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "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",
"created_at": "2026-04-12 22:21:30",
"topics": [
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "number-of-zero-filled-subarrays",
"title": "Number of Zero-Filled Subarrays",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:32",
"topics": [
"array",
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "operations-on-tree",
"title": "Operations on Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:33",
"topics": [
"array",
"breadth first search",
"hash table",
"tree",
"depth first search",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "optimal-partition-of-string",
"title": "Optimal Partition of String",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:35",
"topics": [
"string",
"greedy",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "out-of-boundary-paths",
"title": "Out of Boundary Paths",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:36",
"topics": [
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "painting-the-walls",
"title": "Painting the Walls",
"difficulty": "hard",
"created_at": "2026-04-12 22:21:38",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "parallel-courses-iii",
"title": "Parallel Courses III",
"difficulty": "hard",
"created_at": "2026-04-12 22:21:39",
"topics": [
"array",
"dynamic programming",
"graph theory",
"topological sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "parsing-a-boolean-expression",
"title": "Parsing A Boolean Expression",
"difficulty": "hard",
"created_at": "2026-04-12 22:21:41",
"topics": [
"stack",
"string",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "partition-array-according-to-given-pivot",
"title": "Partition Array According to Given Pivot",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:43",
"topics": [
"array",
"two pointers",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "partition-array-for-maximum-sum",
"title": "Partition Array for Maximum Sum",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:45",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "partition-list",
"title": "Partition List",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:46",
"topics": [
"two pointers",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "path-with-maximum-gold",
"title": "Path with Maximum Gold",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:48",
"topics": [
"array",
"matrix",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "power-of-four",
"title": "Power of Four",
"difficulty": "easy",
"created_at": "2026-04-12 22:21:49",
"topics": [
"math",
"bit manipulation",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "prime-subtraction-operation",
"title": "Prime Subtraction Operation",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:51",
"topics": [
"array",
"binary search",
"math",
"greedy",
"number theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "process-tasks-using-servers",
"title": "Process Tasks Using Servers",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:53",
"topics": [
"array",
"heap (priority queue)"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "profitable-schemes",
"title": "Profitable Schemes",
"difficulty": "hard",
"created_at": "2026-04-12 22:21:54",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "promise-pool",
"title": "Promise Pool",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:56",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "promise-time-limit",
"title": "Promise Time Limit",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:58",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "pseudo-palindromic-paths-in-a-binary-tree",
"title": "Pseudo-Palindromic Paths in a Binary Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:21:59",
"topics": [
"breadth first search",
"bit manipulation",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "push-dominoes",
"title": "Push Dominoes",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:01",
"topics": [
"dynamic programming",
"two pointers",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "range-sum-of-sorted-subarray-sums",
"title": "Range Sum of Sorted Subarray Sums",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:02",
"topics": [
"array",
"binary search",
"two pointers",
"sorting",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "recover-a-tree-from-preorder-traversal",
"title": "Recover a Tree From Preorder Traversal",
"difficulty": "hard",
"created_at": "2026-04-12 22:22:04",
"topics": [
"string",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "regions-cut-by-slashes",
"title": "Regions Cut By Slashes",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:05",
"topics": [
"array",
"breadth first search",
"matrix",
"hash table",
"depth first search",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "relative-sort-array",
"title": "Relative Sort Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:22:07",
"topics": [
"array",
"sorting",
"hash table",
"counting sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "remove-colored-pieces-if-both-neighbors-are-the-same-color",
"title": "Remove Colored Pieces if Both Neighbors are the Same Color",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:09",
"topics": [
"math",
"string",
"greedy",
"game theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "remove-covered-intervals",
"title": "Remove Covered Intervals",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:11",
"topics": [
"array",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "remove-duplicates-from-sorted-array-ii",
"title": "Remove Duplicates from Sorted Array II",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:12",
"topics": [
"array",
"two pointers"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "remove-duplicates-from-sorted-list",
"title": "Remove Duplicates from Sorted List",
"difficulty": "easy",
"created_at": "2026-04-12 22:22:14",
"topics": [
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "remove-k-digits",
"title": "Remove K Digits",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:15",
"topics": [
"stack",
"monotonic stack",
"string",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "remove-max-number-of-edges-to-keep-graph-fully-traversable",
"title": "Remove Max Number of Edges to Keep Graph Fully Traversable",
"difficulty": "hard",
"created_at": "2026-04-12 22:22:17",
"topics": [
"union find",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "remove-nodes-from-linked-list",
"title": "Remove Nodes From Linked List",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:19",
"topics": [
"stack",
"monotonic stack",
"linked list",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "removing-stars-from-a-string",
"title": "Removing Stars From a String",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:20",
"topics": [
"stack",
"string",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "reorder-routes-to-make-all-paths-lead-to-the-city-zero",
"title": "Reorder Routes to Make All Paths Lead to the City Zero",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:21",
"topics": [
"breadth first search",
"depth first search",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "repeated-dna-sequences",
"title": "Repeated DNA Sequences",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:23",
"topics": [
"string",
"sliding window",
"bit manipulation",
"hash table",
"rolling hash",
"hash function"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "reveal-cards-in-increasing-order",
"title": "Reveal Cards In Increasing Order",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:24",
"topics": [
"array",
"simulation",
"sorting",
"queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "reverse-odd-levels-of-binary-tree",
"title": "Reverse Odd Levels of Binary Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:26",
"topics": [
"breadth first search",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "reverse-substrings-between-each-pair-of-parentheses",
"title": "Reverse Substrings Between Each Pair of Parentheses",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:28",
"topics": [
"stack",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "reverse-words-in-a-string-iii",
"title": "Reverse Words in a String III",
"difficulty": "easy",
"created_at": "2026-04-12 22:22:29",
"topics": [
"two pointers",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "robot-bounded-in-circle",
"title": "Robot Bounded In Circle",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:31",
"topics": [
"math",
"string",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "robot-collisions",
"title": "Robot Collisions",
"difficulty": "hard",
"created_at": "2026-04-12 22:22:32",
"topics": [
"array",
"stack",
"simulation",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "score-after-flipping-matrix",
"title": "Score After Flipping Matrix",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:34",
"topics": [
"array",
"greedy",
"matrix",
"bit manipulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "search-suggestions-system",
"title": "Search Suggestions System",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:35",
"topics": [
"array",
"binary search",
"string",
"sorting",
"heap (priority queue)",
"trie"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "seat-reservation-manager",
"title": "Seat Reservation Manager",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:37",
"topics": [
"heap (priority queue)",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "second-minimum-time-to-reach-destination",
"title": "Second Minimum Time to Reach Destination",
"difficulty": "hard",
"created_at": "2026-04-12 22:22:38",
"topics": [
"breadth first search",
"graph theory",
"shortest path"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "sentence-similarity-iii",
"title": "Sentence Similarity III",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:40",
"topics": [
"array",
"two pointers",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "separate-black-and-white-balls",
"title": "Separate Black and White Balls",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:42",
"topics": [
"two pointers",
"string",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "sequential-digits",
"title": "Sequential Digits",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:43",
"topics": [
"enumeration"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "set-mismatch",
"title": "Set Mismatch",
"difficulty": "easy",
"created_at": "2026-04-12 22:22:45",
"topics": [
"array",
"sorting",
"bit manipulation",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "shift-2d-grid",
"title": "Shift 2D Grid",
"difficulty": "easy",
"created_at": "2026-04-12 22:22:46",
"topics": [
"array",
"simulation",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "shifting-letters-ii",
"title": "Shifting Letters II",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:48",
"topics": [
"array",
"string",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "shortest-common-supersequence",
"title": "Shortest Common Supersequence",
"difficulty": "hard",
"created_at": "2026-04-12 22:22:50",
"topics": [
"dynamic programming",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "shortest-distance-after-road-addition-queries-i",
"title": "Shortest Distance After Road Addition Queries I",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:52",
"topics": [
"array",
"breadth first search",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "shortest-palindrome",
"title": "Shortest Palindrome",
"difficulty": "hard",
"created_at": "2026-04-12 22:22:53",
"topics": [
"string",
"rolling hash",
"hash function",
"string matching"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "shortest-path-with-alternating-colors",
"title": "Shortest Path with Alternating Colors",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:55",
"topics": [
"breadth first search",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "shortest-subarray-to-be-removed-to-make-array-sorted",
"title": "Shortest Subarray to be Removed to Make Array Sorted",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:56",
"topics": [
"array",
"binary search",
"stack",
"monotonic stack",
"two pointers"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "shortest-subarray-with-or-at-least-k-ii",
"title": "Shortest Subarray With OR at Least K II",
"difficulty": "medium",
"created_at": "2026-04-12 22:22:58",
"topics": [
"array",
"sliding window",
"bit manipulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "shortest-subarray-with-sum-at-least-k",
"title": "Shortest Subarray with Sum at Least K",
"difficulty": "hard",
"created_at": "2026-04-12 22:22:59",
"topics": [
"array",
"binary search",
"sliding window",
"queue",
"heap (priority queue)",
"monotonic queue",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "shuffle-the-array",
"title": "Shuffle the Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:23:01",
"topics": [
"array"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "sign-of-the-product-of-an-array",
"title": "Sign of the Product of an Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:23:03",
"topics": [
"array",
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "sleep",
"title": "Sleep",
"difficulty": "easy",
"created_at": "2026-04-12 22:23:04",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "sliding-puzzle",
"title": "Sliding Puzzle",
"difficulty": "hard",
"created_at": "2026-04-12 22:23:06",
"topics": [
"array",
"dynamic programming",
"breadth first search",
"matrix",
"backtracking",
"memoization"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "smallest-range-covering-elements-from-k-lists",
"title": "Smallest Range Covering Elements from K Lists",
"difficulty": "hard",
"created_at": "2026-04-12 22:23:07",
"topics": [
"array",
"sliding window",
"greedy",
"sorting",
"hash table",
"heap (priority queue)"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "smallest-string-starting-from-leaf",
"title": "Smallest String Starting From Leaf",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:09",
"topics": [
"string",
"tree",
"binary tree",
"backtracking",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "snakes-and-ladders",
"title": "Snakes and Ladders",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:11",
"topics": [
"array",
"breadth first search",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "solving-questions-with-brainpower",
"title": "Solving Questions With Brainpower",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:12",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "sort-characters-by-frequency",
"title": "Sort Characters By Frequency",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:14",
"topics": [
"string",
"sorting",
"hash table",
"counting",
"heap (priority queue)",
"bucket sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "sort-list",
"title": "Sort List",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:15",
"topics": [
"two pointers",
"sorting",
"divide and conquer",
"linked list",
"merge sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "sort-the-jumbled-numbers",
"title": "Sort the Jumbled Numbers",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:17",
"topics": [
"array",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "sort-the-people",
"title": "Sort the People",
"difficulty": "easy",
"created_at": "2026-04-12 22:23:18",
"topics": [
"array",
"string",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "special-array-with-x-elements-greater-than-or-equal-x",
"title": "Special Array With X Elements Greater Than or Equal X",
"difficulty": "easy",
"created_at": "2026-04-12 22:23:20",
"topics": [
"array",
"binary search",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "spiral-matrix-iii",
"title": "Spiral Matrix III",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:21",
"topics": [
"array",
"simulation",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "spiral-matrix-iv",
"title": "Spiral Matrix IV",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:23",
"topics": [
"array",
"simulation",
"matrix",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "split-a-string-into-the-max-number-of-unique-substrings",
"title": "Split a String Into the Max Number of Unique Substrings",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:25",
"topics": [
"string",
"hash table",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "split-linked-list-in-parts",
"title": "Split Linked List in Parts",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:26",
"topics": [
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "splitting-a-string-into-descending-consecutive-values",
"title": "Splitting a String Into Descending Consecutive Values",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:28",
"topics": [
"string",
"enumeration",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "step-by-step-directions-from-a-binary-tree-node-to-another",
"title": "Step-By-Step Directions From a Binary Tree Node to Another",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:29",
"topics": [
"string",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "stickers-to-spell-word",
"title": "Stickers to Spell Word",
"difficulty": "hard",
"created_at": "2026-04-12 22:23:31",
"topics": [
"array",
"dynamic programming",
"string",
"bit manipulation",
"hash table",
"backtracking",
"memoization",
"bitmask"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "string-compression-ii",
"title": "String Compression II",
"difficulty": "hard",
"created_at": "2026-04-12 22:23:33",
"topics": [
"dynamic programming",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "student-attendance-record-ii",
"title": "Student Attendance Record II",
"difficulty": "hard",
"created_at": "2026-04-12 22:23:34",
"topics": [
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "subarray-sums-divisible-by-k",
"title": "Subarray Sums Divisible by K",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:36",
"topics": [
"array",
"hash table",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "successful-pairs-of-spells-and-potions",
"title": "Successful Pairs of Spells and Potions",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:38",
"topics": [
"array",
"binary search",
"two pointers",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "sum-of-absolute-differences-in-a-sorted-array",
"title": "Sum of Absolute Differences in a Sorted Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:39",
"topics": [
"array",
"math",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "sum-of-prefix-scores-of-strings",
"title": "Sum of Prefix Scores of Strings",
"difficulty": "hard",
"created_at": "2026-04-12 22:23:41",
"topics": [
"array",
"string",
"counting",
"trie"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "sum-of-square-numbers",
"title": "Sum of Square Numbers",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:42",
"topics": [
"binary search",
"math",
"two pointers"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "sum-of-subarray-minimums",
"title": "Sum of Subarray Minimums",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:44",
"topics": [
"array",
"stack",
"monotonic stack",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "swap-nodes-in-pairs",
"title": "Swap Nodes in Pairs",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:45",
"topics": [
"linked list",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "swapping-nodes-in-a-linked-list",
"title": "Swapping Nodes in a Linked List",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:47",
"topics": [
"two pointers",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "symmetric-tree",
"title": "Symmetric Tree",
"difficulty": "easy",
"created_at": "2026-04-12 22:23:48",
"topics": [
"breadth first search",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "take-k-of-each-character-from-left-and-right",
"title": "Take K of Each Character From Left and Right",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:50",
"topics": [
"string",
"sliding window",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "the-k-th-lexicographical-string-of-all-happy-strings-of-length-n",
"title": "The k-th Lexicographical String of All Happy Strings of Length n",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:51",
"topics": [
"string",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "the-number-of-beautiful-subsets",
"title": "The Number of Beautiful Subsets",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:55",
"topics": [
"array",
"math",
"dynamic programming",
"sorting",
"hash table",
"backtracking",
"combinatorics"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "the-number-of-the-smallest-unoccupied-chair",
"title": "The Number of the Smallest Unoccupied Chair",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:56",
"topics": [
"array",
"hash table",
"heap (priority queue)"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "throttle",
"title": "Throttle",
"difficulty": "medium",
"created_at": "2026-04-12 22:23:58",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "time-needed-to-buy-tickets",
"title": "Time Needed to Buy Tickets",
"difficulty": "easy",
"created_at": "2026-04-12 22:23:59",
"topics": [
"array",
"simulation",
"queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "time-needed-to-inform-all-employees",
"title": "Time Needed to Inform All Employees",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:00",
"topics": [
"breadth first search",
"tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "trapping-rain-water-ii",
"title": "Trapping Rain Water II",
"difficulty": "hard",
"created_at": "2026-04-12 22:24:02",
"topics": [
"array",
"breadth first search",
"matrix",
"heap (priority queue)"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "trim-a-binary-search-tree",
"title": "Trim a Binary Search Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:03",
"topics": [
"tree",
"binary tree",
"depth first search",
"binary search tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "tuple-with-same-product",
"title": "Tuple with Same Product",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:05",
"topics": [
"array",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "ugly-number-ii",
"title": "Ugly Number II",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:07",
"topics": [
"math",
"dynamic programming",
"hash table",
"heap (priority queue)"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "uncommon-words-from-two-sentences",
"title": "Uncommon Words from Two Sentences",
"difficulty": "easy",
"created_at": "2026-04-12 22:24:08",
"topics": [
"string",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "uncrossed-lines",
"title": "Uncrossed Lines",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:10",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "unique-binary-search-trees",
"title": "Unique Binary Search Trees",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:11",
"topics": [
"math",
"dynamic programming",
"tree",
"binary tree",
"binary search tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "unique-binary-search-trees-ii",
"title": "Unique Binary Search Trees II",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:13",
"topics": [
"dynamic programming",
"tree",
"binary tree",
"backtracking",
"binary search tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "unique-length-3-palindromic-subsequences",
"title": "Unique Length-3 Palindromic Subsequences",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:15",
"topics": [
"string",
"bit manipulation",
"hash table",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "validate-binary-tree-nodes",
"title": "Validate Binary Tree Nodes",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:17",
"topics": [
"breadth first search",
"tree",
"binary tree",
"depth first search",
"union find",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "validate-stack-sequences",
"title": "Validate Stack Sequences",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:18",
"topics": [
"array",
"stack",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "walking-robot-simulation",
"title": "Walking Robot Simulation",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:20",
"topics": [
"array",
"simulation",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "water-bottles",
"title": "Water Bottles",
"difficulty": "easy",
"created_at": "2026-04-12 22:24:21",
"topics": [
"math",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "widest-vertical-area-between-two-points-containing-no-points",
"title": "Widest Vertical Area Between Two Points Containing No Points",
"difficulty": "easy",
"created_at": "2026-04-12 22:24:23",
"topics": [
"array",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "word-subsets",
"title": "Word Subsets",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:24",
"topics": [
"array",
"string",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "xor-queries-of-a-subarray",
"title": "XOR Queries of a Subarray",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:26",
"topics": [
"array",
"bit manipulation",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "3sum-smaller",
"title": "3Sum Smaller",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:30",
"topics": [
"array",
"binary search",
"two pointers",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "4-keys-keyboard",
"title": "4 Keys Keyboard",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:34",
"topics": [
"math",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "4sum",
"title": "4Sum",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:37",
"topics": [
"array",
"two pointers",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "accounts-merge",
"title": "Accounts Merge",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:41",
"topics": [
"array",
"string",
"sorting",
"breadth first search",
"hash table",
"depth first search",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "add-binary",
"title": "Add Binary",
"difficulty": "easy",
"created_at": "2026-04-12 22:24:44",
"topics": [
"math",
"string",
"simulation",
"bit manipulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "add-bold-tag-in-string",
"title": "Add Bold Tag in String",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:48",
"topics": [
"array",
"string",
"hash table",
"trie",
"string matching"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "add-two-numbers",
"title": "Add Two Numbers",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:51",
"topics": [
"math",
"linked list",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "add-two-numbers-ii",
"title": "Add Two Numbers II",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:55",
"topics": [
"stack",
"math",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "all-paths-from-source-lead-to-destination",
"title": "All Paths from Source Lead to Destination",
"difficulty": "medium",
"created_at": "2026-04-12 22:24:59",
"topics": [
"topological sort",
"graph"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "anagram-groups",
"title": "Group Anagrams",
"difficulty": "medium",
"created_at": "2026-04-12 22:25:02",
"topics": [
"array",
"string",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "analyze-user-website-visit-pattern",
"title": "Analyze User Website Visit Pattern",
"difficulty": "medium",
"created_at": "2026-04-12 22:25:06",
"topics": [
"array",
"string",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "append-characters-to-string-to-make-subsequence",
"title": "Append Characters to String to Make Subsequence",
"difficulty": "medium",
"created_at": "2026-04-12 22:25:09",
"topics": [
"two pointers",
"string",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "apply-substitutions",
"title": "Apply Substitutions",
"difficulty": "medium",
"created_at": "2026-04-12 22:25:13",
"topics": [
"array",
"string",
"breadth first search",
"hash table",
"depth first search",
"graph theory",
"topological sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "armstrong-number",
"title": "Armstrong Number",
"difficulty": "easy",
"created_at": "2026-04-12 22:25:17",
"topics": [
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "arranging-coins",
"title": "Arranging Coins",
"difficulty": "easy",
"created_at": "2026-04-12 22:25:20",
"topics": [
"binary search",
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "array-transformation",
"title": "Array Transformation",
"difficulty": "easy",
"created_at": "2026-04-12 22:25:24",
"topics": [
"array",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "assign-cookies",
"title": "Assign Cookies",
"difficulty": "easy",
"created_at": "2026-04-12 22:25:27",
"topics": [
"array",
"two pointers",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "asteroid-collision",
"title": "Asteroid Collision",
"difficulty": "medium",
"created_at": "2026-04-12 22:25:31",
"topics": [
"array",
"stack",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "balanced-binary-tree",
"title": "Balanced Binary Tree",
"difficulty": "easy",
"created_at": "2026-04-12 22:25:35",
"topics": [
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "baseball-game",
"title": "Baseball Game",
"difficulty": "easy",
"created_at": "2026-04-12 22:25:38",
"topics": [
"array",
"stack",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "basic-calculator-ii",
"title": "Basic Calculator II",
"difficulty": "medium",
"created_at": "2026-04-12 22:25:42",
"topics": [
"stack",
"math",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "basic-calculator-iii",
"title": "Basic Calculator III",
"difficulty": "hard",
"created_at": "2026-04-12 22:25:46",
"topics": [
"stack",
"math",
"string",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "best-meeting-point",
"title": "Best Meeting Point",
"difficulty": "hard",
"created_at": "2026-04-12 22:25:49",
"topics": [
"array",
"math",
"sorting",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "best-time-to-buy-and-sell-stock-ii",
"title": "Best Time to Buy and Sell Stock II",
"difficulty": "medium",
"created_at": "2026-04-12 22:25:53",
"topics": [
"array",
"dynamic programming",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "binary-search",
"title": "Binary Search",
"difficulty": "easy",
"created_at": "2026-04-12 22:25:56",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "binary-search-tree-iterator",
"title": "Binary Search Tree Iterator",
"difficulty": "medium",
"created_at": "2026-04-12 22:26:00",
"topics": [
"stack",
"tree",
"binary tree",
"binary search tree",
"design",
"iterator"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "binary-searchable-numbers-in-an-unsorted-array",
"title": "Binary Searchable Numbers in an Unsorted Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:26:03",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "binary-subarrays-with-sum",
"title": "Binary Subarrays with Sum",
"difficulty": "medium",
"created_at": "2026-04-12 22:26:07",
"topics": [
"array",
"sliding window",
"hash table",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "binary-tree-diameter",
"title": "Diameter of Binary Tree",
"difficulty": "easy",
"created_at": "2026-04-12 22:26:11",
"topics": [
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "binary-tree-from-preorder-and-inorder-traversal",
"title": "Construct Binary Tree from Preorder and Inorder Traversal",
"difficulty": "medium",
"created_at": "2026-04-12 22:26:15",
"topics": [
"array",
"hash table",
"divide and conquer",
"tree",
"binary tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "binary-tree-inorder-traversal",
"title": "Binary Tree Inorder Traversal",
"difficulty": "easy",
"created_at": "2026-04-12 22:26:18",
"topics": [
"stack",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "binary-tree-longest-consecutive-sequence",
"title": "Binary Tree Longest Consecutive Sequence",
"difficulty": "medium",
"created_at": "2026-04-12 22:26:22",
"topics": [
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "binary-tree-longest-consecutive-sequence-ii",
"title": "Binary Tree Longest Consecutive Sequence II",
"difficulty": "medium",
"created_at": "2026-04-12 22:26:25",
"topics": [
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "binary-tree-maximum-path-sum",
"title": "Binary Tree Maximum Path Sum",
"difficulty": "hard",
"created_at": "2026-04-12 22:26:29",
"topics": [
"dynamic programming",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "binary-tree-postorder-traversal",
"title": "Binary Tree Postorder Traversal",
"difficulty": "easy",
"created_at": "2026-04-12 22:26:32",
"topics": [
"stack",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "binary-tree-preorder-traversal",
"title": "Binary Tree Preorder Traversal",
"difficulty": "easy",
"created_at": "2026-04-12 22:26:36",
"topics": [
"stack",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "binary-tree-right-side-view",
"title": "Binary Tree Right Side View",
"difficulty": "medium",
"created_at": "2026-04-12 22:26:40",
"topics": [
"breadth first search",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "binary-tree-vertical-order-traversal",
"title": "Binary Tree Vertical Order Traversal",
"difficulty": "medium",
"created_at": "2026-04-12 22:26:43",
"topics": [
"sorting",
"breadth first search",
"hash table",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "binary-tree-zigzag-level-order-traversal",
"title": "Binary Tree Zigzag Level Order Traversal",
"difficulty": "medium",
"created_at": "2026-04-12 22:26:47",
"topics": [
"breadth first search",
"tree",
"binary tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "bitwise-and-of-numbers-range",
"title": "Bitwise AND of Numbers Range",
"difficulty": "medium",
"created_at": "2026-04-12 22:26:50",
"topics": [
"bit manipulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "boats-to-save-people",
"title": "Boats to Save People",
"difficulty": "medium",
"created_at": "2026-04-12 22:26:54",
"topics": [
"array",
"two pointers",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "boundary-of-binary-tree",
"title": "Boundary of Binary Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:26:57",
"topics": [
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "brace-expansion",
"title": "Brace Expansion",
"difficulty": "medium",
"created_at": "2026-04-12 22:27:01",
"topics": [
"stack",
"string",
"sorting",
"breadth first search",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "brightest-position-on-street",
"title": "Brightest Position on Street",
"difficulty": "medium",
"created_at": "2026-04-12 22:27:05",
"topics": [
"array",
"ordered set",
"sorting",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "build-a-matrix-with-conditions",
"title": "Build a Matrix With Conditions",
"difficulty": "hard",
"created_at": "2026-04-12 22:27:08",
"topics": [
"array",
"matrix",
"graph theory",
"topological sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "buildings-with-an-ocean-view",
"title": "Buildings With an Ocean View",
"difficulty": "medium",
"created_at": "2026-04-12 22:27:12",
"topics": [
"array",
"stack",
"monotonic stack"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "burst-balloons",
"title": "Burst Balloons",
"difficulty": "hard",
"created_at": "2026-04-12 22:27:16",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "bus-routes",
"title": "Bus Routes",
"difficulty": "hard",
"created_at": "2026-04-12 22:27:19",
"topics": [
"array",
"breadth first search",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "buy-and-sell-crypto",
"title": "Best Time to Buy and Sell Stock",
"difficulty": "easy",
"created_at": "2026-04-12 22:27:23",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "buy-and-sell-crypto-with-cooldown",
"title": "Best Time to Buy and Sell Stock with Cooldown",
"difficulty": "medium",
"created_at": "2026-04-12 22:27:27",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "buy-two-chocolates",
"title": "Buy Two Chocolates",
"difficulty": "easy",
"created_at": "2026-04-12 22:27:30",
"topics": [
"array",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "campus-bikes",
"title": "Campus Bikes",
"difficulty": "medium",
"created_at": "2026-04-12 22:27:34",
"topics": [
"array",
"sorting",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "can-place-flowers",
"title": "Can Place Flowers",
"difficulty": "easy",
"created_at": "2026-04-12 22:27:38",
"topics": [
"array",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "candy",
"title": "Candy",
"difficulty": "hard",
"created_at": "2026-04-12 22:27:41",
"topics": [
"array",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "candy-crush",
"title": "Candy Crush",
"difficulty": "medium",
"created_at": "2026-04-12 22:27:45",
"topics": [
"array",
"two pointers",
"simulation",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "capacity-to-ship-packages-within-d-days",
"title": "Capacity to Ship Packages Within D Days",
"difficulty": "medium",
"created_at": "2026-04-12 22:27:48",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "car-fleet",
"title": "Car Fleet",
"difficulty": "medium",
"created_at": "2026-04-12 22:27:52",
"topics": [
"array",
"stack",
"monotonic stack",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "car-pooling",
"title": "Car Pooling",
"difficulty": "medium",
"created_at": "2026-04-12 22:27:55",
"topics": [
"array",
"simulation",
"sorting",
"prefix sum",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "cheapest-flight-path",
"title": "Cheapest Flights Within K Stops",
"difficulty": "medium",
"created_at": "2026-04-12 22:27:59",
"topics": [
"dynamic programming",
"breadth first search",
"depth first search",
"graph theory",
"shortest path",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "check-completeness-of-a-binary-tree",
"title": "Check Completeness of a Binary Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:28:03",
"topics": [
"breadth first search",
"tree",
"binary tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "check-if-a-number-is-majority-element-in-a-sorted-array",
"title": "Check If a Number Is Majority Element in a Sorted Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:28:06",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "check-if-array-is-sorted-and-rotated",
"title": "Check if Array Is Sorted and Rotated",
"difficulty": "easy",
"created_at": "2026-04-12 22:28:10",
"topics": [
"array"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "cherry-pickup",
"title": "Cherry Pickup",
"difficulty": "hard",
"created_at": "2026-04-12 22:28:13",
"topics": [
"array",
"dynamic programming",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "climbing-stairs",
"title": "Climbing Stairs",
"difficulty": "easy",
"created_at": "2026-04-12 22:28:17",
"topics": [
"math",
"dynamic programming",
"memoization"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "clone-graph",
"title": "Clone Graph",
"difficulty": "medium",
"created_at": "2026-04-12 22:28:21",
"topics": [
"breadth first search",
"hash table",
"depth first search",
"graph"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "clone-n-ary-tree",
"title": "Clone N-ary Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:28:25",
"topics": [
"breadth first search",
"hash table",
"tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "closest-binary-search-tree-value",
"title": "Closest Binary Search Tree Value",
"difficulty": "easy",
"created_at": "2026-04-12 22:28:28",
"topics": [
"binary search",
"tree",
"binary tree",
"depth first search",
"binary search tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "closest-binary-search-tree-value-ii",
"title": "Closest Binary Search Tree Value II",
"difficulty": "hard",
"created_at": "2026-04-12 22:28:32",
"topics": [
"stack",
"two pointers",
"tree",
"binary tree",
"depth first search",
"binary search tree",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "coin-change",
"title": "Coin Change",
"difficulty": "medium",
"created_at": "2026-04-12 22:28:35",
"topics": [
"array",
"dynamic programming",
"breadth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "coin-change-ii",
"title": "Coin Change II",
"difficulty": "medium",
"created_at": "2026-04-12 22:28:39",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "coin-path",
"title": "Coin Path",
"difficulty": "hard",
"created_at": "2026-04-12 22:28:42",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "combination-sum-iv",
"title": "Combination Sum IV",
"difficulty": "medium",
"created_at": "2026-04-12 22:28:46",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "combination-target-sum",
"title": "Combination Sum",
"difficulty": "medium",
"created_at": "2026-04-12 22:28:49",
"topics": [
"array",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "combination-target-sum-ii",
"title": "Combination Sum II",
"difficulty": "medium",
"created_at": "2026-04-12 22:28:53",
"topics": [
"array",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "combinations",
"title": "Combinations",
"difficulty": "medium",
"created_at": "2026-04-12 22:28:57",
"topics": [
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "combinations-of-a-phone-number",
"title": "Letter Combinations of a Phone Number",
"difficulty": "medium",
"created_at": "2026-04-12 22:29:00",
"topics": [
"string",
"hash table",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "concatenated-words",
"title": "Concatenated Words",
"difficulty": "hard",
"created_at": "2026-04-12 22:29:04",
"topics": [
"array",
"dynamic programming",
"string",
"sorting",
"depth first search",
"trie"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "concatenation-of-array",
"title": "Concatenation of Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:29:08",
"topics": [
"array",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "confusing-number",
"title": "Confusing Number",
"difficulty": "easy",
"created_at": "2026-04-12 22:29:12",
"topics": [
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "construct-binary-tree-from-inorder-and-postorder-traversal",
"title": "Construct Binary Tree from Inorder and Postorder Traversal",
"difficulty": "medium",
"created_at": "2026-04-12 22:29:15",
"topics": [
"array",
"hash table",
"divide and conquer",
"tree",
"binary tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "construct-quad-tree",
"title": "Construct Quad Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:29:19",
"topics": [
"array",
"matrix",
"divide and conquer",
"tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "contains-duplicate-ii",
"title": "Contains Duplicate II",
"difficulty": "easy",
"created_at": "2026-04-12 22:29:23",
"topics": [
"array",
"sliding window",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "continuous-subarray-sum",
"title": "Continuous Subarray Sum",
"difficulty": "medium",
"created_at": "2026-04-12 22:29:26",
"topics": [
"array",
"math",
"hash table",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "convert-bst-to-greater-tree",
"title": "Convert Bst to Greater Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:29:30",
"topics": [
"tree",
"binary tree",
"depth first search",
"binary search tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "copy-linked-list-with-random-pointer",
"title": "Copy Linked List with Random Pointer",
"difficulty": "medium",
"created_at": "2026-04-12 22:29:33",
"topics": [
"hash table",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "count-connected-components",
"title": "Number of Connected Components in an Undirected Graph",
"difficulty": "medium",
"created_at": "2026-04-12 22:29:37",
"topics": [
"breadth first search",
"depth first search",
"union find",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "count-good-nodes-in-binary-tree",
"title": "Count Good Nodes in Binary Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:29:41",
"topics": [
"breadth first search",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "count-number-of-islands",
"title": "Number of Islands",
"difficulty": "medium",
"created_at": "2026-04-12 22:29:44",
"topics": [
"array",
"breadth first search",
"matrix",
"depth first search",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "count-odd-numbers-in-an-interval-range",
"title": "Count Odd Numbers in an Interval Range",
"difficulty": "easy",
"created_at": "2026-04-12 22:29:48",
"topics": [
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "count-paths",
"title": "Unique Paths",
"difficulty": "medium",
"created_at": "2026-04-12 22:29:51",
"topics": [
"math",
"dynamic programming",
"combinatorics"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "count-prefix-and-suffix-pairs-i",
"title": "Count Prefix and Suffix Pairs I",
"difficulty": "easy",
"created_at": "2026-04-12 22:29:55",
"topics": [
"array",
"string",
"rolling hash",
"hash function",
"trie",
"string matching"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "count-primes",
"title": "Count Primes",
"difficulty": "medium",
"created_at": "2026-04-12 22:29:59",
"topics": [
"array",
"math",
"number theory",
"enumeration"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "count-servers-that-communicate",
"title": "Count Servers that Communicate",
"difficulty": "medium",
"created_at": "2026-04-12 22:30:02",
"topics": [
"array",
"breadth first search",
"matrix",
"counting",
"depth first search",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "count-squares",
"title": "Detect Squares",
"difficulty": "medium",
"created_at": "2026-04-12 22:30:06",
"topics": [
"array",
"hash table",
"counting",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "count-strictly-increasing-subarrays",
"title": "Count Strictly Increasing Subarrays",
"difficulty": "medium",
"created_at": "2026-04-12 22:30:09",
"topics": [
"array",
"math",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "count-subsequences",
"title": "Distinct Subsequences",
"difficulty": "hard",
"created_at": "2026-04-12 22:30:13",
"topics": [
"dynamic programming",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "count-substrings-with-only-one-distinct-letter",
"title": "Count Substrings with Only One Distinct Letter",
"difficulty": "easy",
"created_at": "2026-04-12 22:30:17",
"topics": [
"math",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "count-the-number-of-consistent-strings",
"title": "Count the Number of Consistent Strings",
"difficulty": "easy",
"created_at": "2026-04-12 22:30:20",
"topics": [
"array",
"string",
"bit manipulation",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "count-univalue-subtrees",
"title": "Count Univalue Subtrees",
"difficulty": "medium",
"created_at": "2026-04-12 22:30:24",
"topics": [
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "counting-bits",
"title": "Counting Bits",
"difficulty": "easy",
"created_at": "2026-04-12 22:30:27",
"topics": [
"dynamic programming",
"bit manipulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "counting-elements",
"title": "Counting Elements",
"difficulty": "easy",
"created_at": "2026-04-12 22:30:31",
"topics": [
"array",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "counting-words-with-a-given-prefix",
"title": "Counting Words With a Given Prefix",
"difficulty": "easy",
"created_at": "2026-04-12 22:30:35",
"topics": [
"array",
"string",
"string matching"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "course-schedule",
"title": "Course Schedule",
"difficulty": "medium",
"created_at": "2026-04-12 22:30:38",
"topics": [
"breadth first search",
"depth first search",
"graph theory",
"topological sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "course-schedule-ii",
"title": "Course Schedule II",
"difficulty": "medium",
"created_at": "2026-04-12 22:30:42",
"topics": [
"breadth first search",
"depth first search",
"graph theory",
"topological sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "course-schedule-iv",
"title": "Course Schedule IV",
"difficulty": "medium",
"created_at": "2026-04-12 22:30:45",
"topics": [
"breadth first search",
"depth first search",
"topological sort",
"graph"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "crawler-log-folder",
"title": "Crawler Log Folder",
"difficulty": "easy",
"created_at": "2026-04-12 22:30:50",
"topics": [
"array",
"stack",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "custom-sort-string",
"title": "Custom Sort String",
"difficulty": "medium",
"created_at": "2026-04-12 22:30:53",
"topics": [
"string",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "daily-temperatures",
"title": "Daily Temperatures",
"difficulty": "medium",
"created_at": "2026-04-12 22:30:57",
"topics": [
"array",
"stack",
"monotonic stack"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "decode-string",
"title": "Decode String",
"difficulty": "medium",
"created_at": "2026-04-12 22:31:01",
"topics": [
"stack",
"string",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "decode-ways",
"title": "Decode Ways",
"difficulty": "medium",
"created_at": "2026-04-12 22:31:05",
"topics": [
"dynamic programming",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "delete-leaves-with-a-given-value",
"title": "Delete Leaves With a Given Value",
"difficulty": "medium",
"created_at": "2026-04-12 22:31:08",
"topics": [
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "delete-n-nodes-after-m-nodes-of-a-linked-list",
"title": "Delete N Nodes After M Nodes of a Linked List",
"difficulty": "easy",
"created_at": "2026-04-12 22:31:12",
"topics": [
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "delete-node-in-a-bst",
"title": "Delete Node in a BST",
"difficulty": "medium",
"created_at": "2026-04-12 22:31:15",
"topics": [
"tree",
"binary tree",
"binary search tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "depth-of-binary-tree",
"title": "Maximum Depth of Binary Tree",
"difficulty": "easy",
"created_at": "2026-04-12 22:31:19",
"topics": [
"breadth first search",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "design-a-leaderboard",
"title": "Design A Leaderboard",
"difficulty": "medium",
"created_at": "2026-04-12 22:31:23",
"topics": [
"sorting",
"hash table",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "design-circular-queue",
"title": "Design Circular Queue",
"difficulty": "medium",
"created_at": "2026-04-12 22:31:26",
"topics": [
"array",
"queue",
"design",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "design-compressed-string-iterator",
"title": "Design Compressed String Iterator",
"difficulty": "easy",
"created_at": "2026-04-12 22:31:30",
"topics": [
"array",
"string",
"design",
"iterator"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "design-excel-sum-formula",
"title": "Design Excel Sum Formula",
"difficulty": "hard",
"created_at": "2026-04-12 22:31:33",
"topics": [
"array",
"string",
"matrix",
"hash table",
"graph theory",
"design",
"topological sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "design-file-system",
"title": "Design File System",
"difficulty": "medium",
"created_at": "2026-04-12 22:31:37",
"topics": [
"string",
"hash table",
"trie",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "design-hashmap",
"title": "Design HashMap",
"difficulty": "easy",
"created_at": "2026-04-12 22:31:40",
"topics": [
"array",
"hash table",
"hash function",
"design",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "design-hashset",
"title": "Design Hashset",
"difficulty": "easy",
"created_at": "2026-04-12 22:31:44",
"topics": [
"array",
"hash table",
"hash function",
"design",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "design-hit-counter",
"title": "Design Hit Counter",
"difficulty": "medium",
"created_at": "2026-04-12 22:31:47",
"topics": [
"array",
"binary search",
"queue",
"design",
"data stream"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "design-in-memory-file-system",
"title": "Design In-Memory File System",
"difficulty": "hard",
"created_at": "2026-04-12 22:31:51",
"topics": [
"string",
"sorting",
"hash table",
"trie",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "design-phone-directory",
"title": "Design Phone Directory",
"difficulty": "medium",
"created_at": "2026-04-12 22:31:55",
"topics": [
"array",
"hash table",
"queue",
"design",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "design-search-autocomplete-system",
"title": "Design Search Autocomplete System",
"difficulty": "hard",
"created_at": "2026-04-12 22:31:58",
"topics": [
"string",
"sorting",
"depth first search",
"trie",
"design",
"data stream",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "design-snake-game",
"title": "Design Snake Game",
"difficulty": "medium",
"created_at": "2026-04-12 22:32:02",
"topics": [
"array",
"simulation",
"hash table",
"queue",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "design-tic-tac-toe",
"title": "Design Tic-Tac-Toe",
"difficulty": "medium",
"created_at": "2026-04-12 22:32:05",
"topics": [
"array",
"simulation",
"matrix",
"hash table",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "design-twitter-feed",
"title": "Design Twitter",
"difficulty": "medium",
"created_at": "2026-04-12 22:32:09",
"topics": [
"hash table",
"design",
"linked list",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "design-word-search-data-structure",
"title": "Design Add and Search Word Data Structure",
"difficulty": "medium",
"created_at": "2026-04-12 22:32:12",
"topics": [
"string",
"depth first search",
"trie",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "diameter-of-n-ary-tree",
"title": "Diameter of N-Ary Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:32:16",
"topics": [
"tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "distribute-candies-among-children-ii",
"title": "Distribute Candies Among Children II",
"difficulty": "medium",
"created_at": "2026-04-12 22:32:20",
"topics": [
"math",
"enumeration",
"combinatorics"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "divide-array-into-equal-pairs",
"title": "Divide Array Into Equal Pairs",
"difficulty": "easy",
"created_at": "2026-04-12 22:32:23",
"topics": [
"array",
"bit manipulation",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "divide-chocolate",
"title": "Divide Chocolate",
"difficulty": "hard",
"created_at": "2026-04-12 22:32:27",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "dot-product-of-two-sparse-vectors",
"title": "Dot Product of Two Sparse Vectors",
"difficulty": "medium",
"created_at": "2026-04-12 22:32:31",
"topics": [
"array",
"two pointers",
"hash table",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "dota2-senate",
"title": "Dota2 Senate",
"difficulty": "medium",
"created_at": "2026-04-12 22:32:34",
"topics": [
"string",
"greedy",
"queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "duplicate-integer",
"title": "Contains Duplicate",
"difficulty": "easy",
"created_at": "2026-04-12 22:32:38",
"topics": [
"array",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "eating-bananas",
"title": "Koko Eating Bananas",
"difficulty": "medium",
"created_at": "2026-04-12 22:32:41",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "edit-distance",
"title": "Edit Distance",
"difficulty": "medium",
"created_at": "2026-04-12 22:32:45",
"topics": [
"dynamic programming",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "employee-free-time",
"title": "Employee Free Time",
"difficulty": "hard",
"created_at": "2026-04-12 22:32:48",
"topics": [
"array",
"sorting",
"heap priority queue",
"sweep line"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "encode-n-ary-tree-to-binary-tree",
"title": "Encode N-ary Tree to Binary Tree",
"difficulty": "hard",
"created_at": "2026-04-12 22:32:52",
"topics": [
"breadth first search",
"tree",
"binary tree",
"depth first search",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "encode-string-with-shortest-length",
"title": "Encode String with Shortest Length",
"difficulty": "hard",
"created_at": "2026-04-12 22:32:56",
"topics": [
"dynamic programming",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "evaluate-division",
"title": "Evaluate Division",
"difficulty": "medium",
"created_at": "2026-04-12 22:32:59",
"topics": [
"array",
"string",
"breadth first search",
"depth first search",
"union find",
"shortest path",
"graph"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "evaluate-reverse-polish-notation",
"title": "Evaluate Reverse Polish Notation",
"difficulty": "medium",
"created_at": "2026-04-12 22:33:03",
"topics": [
"array",
"stack",
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "excel-sheet-column-title",
"title": "Excel Sheet Column Title",
"difficulty": "easy",
"created_at": "2026-04-12 22:33:06",
"topics": [
"math",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "extra-characters-in-a-string",
"title": "Extra Characters in a String",
"difficulty": "medium",
"created_at": "2026-04-12 22:33:10",
"topics": [
"array",
"dynamic programming",
"string",
"hash table",
"trie"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "factor-combinations",
"title": "Factor Combinations",
"difficulty": "medium",
"created_at": "2026-04-12 22:33:13",
"topics": [
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "final-array-state-after-k-multiplication-operations-i",
"title": "Final Array State After K Multiplication Operations I",
"difficulty": "easy",
"created_at": "2026-04-12 22:33:17",
"topics": [
"array",
"math",
"simulation",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-all-numbers-disappeared-in-an-array",
"title": "Find All Numbers Disappeared in An Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:33:21",
"topics": [
"array",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-anagram-mappings",
"title": "Find Anagram Mappings",
"difficulty": "easy",
"created_at": "2026-04-12 22:33:24",
"topics": [
"array",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree",
"title": "Find Critical and Pseudo Critical Edges in Minimum Spanning Tree",
"difficulty": "hard",
"created_at": "2026-04-12 22:33:28",
"topics": [
"sorting",
"union find",
"strongly connected component",
"graph",
"minimum spanning tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-duplicate-integer",
"title": "Find the Duplicate Number",
"difficulty": "medium",
"created_at": "2026-04-12 22:33:31",
"topics": [
"array",
"binary search",
"two pointers",
"bit manipulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-first-and-last-position-of-element-in-sorted-array",
"title": "Find First And Last Position of Element In Sorted Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:33:35",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-in-mountain-array",
"title": "Find in Mountain Array",
"difficulty": "hard",
"created_at": "2026-04-12 22:33:39",
"topics": [
"array",
"binary search",
"interactive"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-k-closest-elements",
"title": "Find K Closest Elements",
"difficulty": "medium",
"created_at": "2026-04-12 22:33:42",
"topics": [
"array",
"binary search",
"two pointers",
"sliding window",
"sorting",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-k-length-substrings-with-no-repeated-characters",
"title": "Find K-Length Substrings With No Repeated Characters",
"difficulty": "medium",
"created_at": "2026-04-12 22:33:46",
"topics": [
"string",
"sliding window",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-leaves-of-binary-tree",
"title": "Find Leaves of Binary Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:33:49",
"topics": [
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-lucky-integer-in-an-array",
"title": "Find Lucky Integer in an Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:33:53",
"topics": [
"array",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-median-in-a-data-stream",
"title": "Find Median From Data Stream",
"difficulty": "hard",
"created_at": "2026-04-12 22:33:57",
"topics": [
"two pointers",
"sorting",
"design",
"data stream",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-minimum-in-rotated-sorted-array",
"title": "Find Minimum in Rotated Sorted Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:34:00",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-missing-and-repeated-values",
"title": "Find Missing and Repeated Values",
"difficulty": "easy",
"created_at": "2026-04-12 22:34:04",
"topics": [
"array",
"math",
"matrix",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-peak-element",
"title": "Find Peak Element",
"difficulty": "medium",
"created_at": "2026-04-12 22:34:08",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-permutation",
"title": "Find Permutation",
"difficulty": "medium",
"created_at": "2026-04-12 22:34:11",
"topics": [
"array",
"stack",
"string",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-pivot-index",
"title": "Find Pivot Index",
"difficulty": "easy",
"created_at": "2026-04-12 22:34:15",
"topics": [
"array",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-root-of-n-ary-tree",
"title": "Find Root of N-Ary Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:34:18",
"topics": [
"bit manipulation",
"hash table",
"tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-smallest-common-element-in-all-rows",
"title": "Find Smallest Common Element in All Rows",
"difficulty": "medium",
"created_at": "2026-04-12 22:34:22",
"topics": [
"array",
"binary search",
"matrix",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-target-in-rotated-sorted-array",
"title": "Search in Rotated Sorted Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:34:25",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-the-celebrity",
"title": "Find the Celebrity",
"difficulty": "medium",
"created_at": "2026-04-12 22:34:29",
"topics": [
"two pointers",
"graph",
"interactive"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-the-difference",
"title": "Find the Difference",
"difficulty": "easy",
"created_at": "2026-04-12 22:34:33",
"topics": [
"string",
"sorting",
"bit manipulation",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-the-difference-of-two-arrays",
"title": "Find the Difference of Two Arrays",
"difficulty": "easy",
"created_at": "2026-04-12 22:34:36",
"topics": [
"array",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-the-index-of-the-first-occurrence-in-a-string",
"title": "Find The Index of The First Occurrence in a String",
"difficulty": "easy",
"created_at": "2026-04-12 22:34:40",
"topics": [
"two pointers",
"string",
"string matching"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-the-index-of-the-large-integer",
"title": "Find the Index of the Large Integer",
"difficulty": "medium",
"created_at": "2026-04-12 22:34:44",
"topics": [
"array",
"binary search",
"interactive"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-the-town-judge",
"title": "Find the Town Judge",
"difficulty": "easy",
"created_at": "2026-04-12 22:34:47",
"topics": [
"array",
"hash table",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "find-words-that-can-be-formed-by-characters",
"title": "Find Words That Can Be Formed by Characters",
"difficulty": "easy",
"created_at": "2026-04-12 22:34:51",
"topics": [
"array",
"string",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "first-missing-positive",
"title": "First Missing Positive",
"difficulty": "hard",
"created_at": "2026-04-12 22:34:54",
"topics": [
"array",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "first-unique-character-in-a-string",
"title": "First Unique Character in a String",
"difficulty": "easy",
"created_at": "2026-04-12 22:34:58",
"topics": [
"string",
"hash table",
"counting",
"queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "first-unique-number",
"title": "First Unique Number",
"difficulty": "medium",
"created_at": "2026-04-12 22:35:02",
"topics": [
"array",
"hash table",
"queue",
"design",
"data stream"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "flood-fill",
"title": "Flood Fill",
"difficulty": "easy",
"created_at": "2026-04-12 22:35:05",
"topics": [
"array",
"breadth first search",
"matrix",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "foreign-dictionary",
"title": "Alien Dictionary",
"difficulty": "hard",
"created_at": "2026-04-12 22:35:09",
"topics": [
"array",
"string",
"breadth first search",
"depth first search",
"graph theory",
"topological sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "frequency-of-the-most-frequent-element",
"title": "Frequency of The Most Frequent Element",
"difficulty": "medium",
"created_at": "2026-04-12 22:35:12",
"topics": [
"array",
"binary search",
"sliding window",
"greedy",
"sorting",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "fruit-into-baskets",
"title": "Fruits into Basket",
"difficulty": "medium",
"created_at": "2026-04-12 22:35:16",
"topics": [
"array",
"sliding window",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "gas-station",
"title": "Gas Station",
"difficulty": "medium",
"created_at": "2026-04-12 22:35:20",
"topics": [
"array",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "generate-parentheses",
"title": "Generate Parentheses",
"difficulty": "medium",
"created_at": "2026-04-12 22:35:23",
"topics": [
"dynamic programming",
"string",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "greatest-common-divisor-of-strings",
"title": "Greatest Common Divisor of Strings",
"difficulty": "easy",
"created_at": "2026-04-12 22:35:27",
"topics": [
"math",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "greatest-common-divisor-traversal",
"title": "Greatest Common Divisor Traversal",
"difficulty": "hard",
"created_at": "2026-04-12 22:35:31",
"topics": [
"array",
"math",
"number theory",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "group-shifted-strings",
"title": "Group Shifted Strings",
"difficulty": "medium",
"created_at": "2026-04-12 22:35:34",
"topics": [
"array",
"string",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "grumpy-bookstore-owner",
"title": "Grumpy Bookstore Owner",
"difficulty": "medium",
"created_at": "2026-04-12 22:35:38",
"topics": [
"array",
"sliding window"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "guess-number-higher-or-lower",
"title": "Guess Number Higher Or Lower",
"difficulty": "easy",
"created_at": "2026-04-12 22:35:41",
"topics": [
"binary search",
"interactive"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "guess-the-majority-in-a-hidden-array",
"title": "Guess the Majority in a Hidden Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:35:45",
"topics": [
"array",
"math",
"interactive"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "hand-of-straights",
"title": "Hand of Straights",
"difficulty": "medium",
"created_at": "2026-04-12 22:35:49",
"topics": [
"array",
"greedy",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "handshakes-that-dont-cross",
"title": "Handshakes That Don't Cross",
"difficulty": "hard",
"created_at": "2026-04-12 22:35:52",
"topics": [
"math",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "height-checker",
"title": "Height Checker",
"difficulty": "easy",
"created_at": "2026-04-12 22:35:56",
"topics": [
"array",
"sorting",
"counting sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "high-five",
"title": "High Five",
"difficulty": "easy",
"created_at": "2026-04-12 22:35:59",
"topics": [
"array",
"sorting",
"hash table",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "house-robber",
"title": "House Robber",
"difficulty": "medium",
"created_at": "2026-04-12 22:36:03",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "house-robber-ii",
"title": "House Robber II",
"difficulty": "medium",
"created_at": "2026-04-12 22:36:06",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "house-robber-iii",
"title": "House Robber III",
"difficulty": "medium",
"created_at": "2026-04-12 22:36:10",
"topics": [
"dynamic programming",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "implement-prefix-tree",
"title": "Implement Trie (Prefix Tree)",
"difficulty": "medium",
"created_at": "2026-04-12 22:36:13",
"topics": [
"string",
"hash table",
"trie",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "implement-queue-using-stacks",
"title": "Implement Queue using Stacks",
"difficulty": "easy",
"created_at": "2026-04-12 22:36:17",
"topics": [
"stack",
"queue",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "implement-stack-using-queues",
"title": "Implement Stack Using Queues",
"difficulty": "easy",
"created_at": "2026-04-12 22:36:21",
"topics": [
"stack",
"queue",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "inorder-successor-in-bst-ii",
"title": "Inorder Successor in BST II",
"difficulty": "medium",
"created_at": "2026-04-12 22:36:24",
"topics": [
"tree",
"binary tree",
"binary search tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "insert-delete-getrandom-o1",
"title": "Insert Delete Get Random O(1)",
"difficulty": "medium",
"created_at": "2026-04-12 22:36:28",
"topics": [
"array",
"math",
"hash table",
"design",
"randomized"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "insert-greatest-common-divisors-in-linked-list",
"title": "Insert Greatest Common Divisors in Linked List",
"difficulty": "medium",
"created_at": "2026-04-12 22:36:32",
"topics": [
"math",
"number theory",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "insert-into-a-binary-search-tree",
"title": "Insert into a Binary Search Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:36:35",
"topics": [
"tree",
"binary tree",
"binary search tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "insert-into-a-sorted-circular-linked-list",
"title": "Insert into a Sorted Circular Linked List",
"difficulty": "medium",
"created_at": "2026-04-12 22:36:39",
"topics": [
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "insert-new-interval",
"title": "Insert Interval",
"difficulty": "medium",
"created_at": "2026-04-12 22:36:42",
"topics": [
"array"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "insertion-sort-list",
"title": "Insertion Sort List",
"difficulty": "medium",
"created_at": "2026-04-12 22:36:46",
"topics": [
"sorting",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "integer-break",
"title": "Integer Break",
"difficulty": "medium",
"created_at": "2026-04-12 22:36:50",
"topics": [
"math",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "integer-to-roman",
"title": "Integer to Roman",
"difficulty": "medium",
"created_at": "2026-04-12 22:36:53",
"topics": [
"math",
"string",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "interleaving-string",
"title": "Interleaving String",
"difficulty": "medium",
"created_at": "2026-04-12 22:36:57",
"topics": [
"dynamic programming",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "intersection-of-two-arrays",
"title": "Intersection of Two Arrays",
"difficulty": "easy",
"created_at": "2026-04-12 22:37:01",
"topics": [
"array",
"binary search",
"two pointers",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "intersection-of-two-linked-lists",
"title": "Intersection of Two Linked Lists",
"difficulty": "easy",
"created_at": "2026-04-12 22:37:04",
"topics": [
"two pointers",
"hash table",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "interval-list-intersections",
"title": "Interval List Intersections",
"difficulty": "medium",
"created_at": "2026-04-12 22:37:08",
"topics": [
"array",
"two pointers",
"sweep line"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "invert-a-binary-tree",
"title": "Invert Binary Tree",
"difficulty": "easy",
"created_at": "2026-04-12 22:37:11",
"topics": [
"breadth first search",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "ip-to-cidr",
"title": "IP to CIDR",
"difficulty": "medium",
"created_at": "2026-04-12 22:37:15",
"topics": [
"string",
"bit manipulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "ipo",
"title": "IPO",
"difficulty": "hard",
"created_at": "2026-04-12 22:37:19",
"topics": [
"array",
"greedy",
"sorting",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "is-anagram",
"title": "Valid Anagram",
"difficulty": "easy",
"created_at": "2026-04-12 22:37:22",
"topics": [
"string",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "is-palindrome",
"title": "Valid Palindrome",
"difficulty": "easy",
"created_at": "2026-04-12 22:37:26",
"topics": [
"two pointers",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "is-subsequence",
"title": "Is Subsequence",
"difficulty": "easy",
"created_at": "2026-04-12 22:37:29",
"topics": [
"dynamic programming",
"two pointers",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "island-perimeter",
"title": "Island Perimeter",
"difficulty": "easy",
"created_at": "2026-04-12 22:37:33",
"topics": [
"array",
"breadth first search",
"matrix",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "islands-and-treasure",
"title": "Islands and Treasure",
"difficulty": "medium",
"created_at": "2026-04-12 22:37:36",
"topics": [
"array",
"breadth first search",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "isomorphic-strings",
"title": "Isomorphic Strings",
"difficulty": "easy",
"created_at": "2026-04-12 22:37:40",
"topics": [
"string",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "jump-game",
"title": "Jump Game",
"difficulty": "medium",
"created_at": "2026-04-12 22:37:43",
"topics": [
"array",
"dynamic programming",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "jump-game-ii",
"title": "Jump Game II",
"difficulty": "medium",
"created_at": "2026-04-12 22:37:47",
"topics": [
"array",
"dynamic programming",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "jump-game-vii",
"title": "Jump Game VII",
"difficulty": "medium",
"created_at": "2026-04-12 22:37:51",
"topics": [
"dynamic programming",
"string",
"sliding window",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "k-closest-points-to-origin",
"title": "K Closest Points to Origin",
"difficulty": "medium",
"created_at": "2026-04-12 22:37:54",
"topics": [
"array",
"math",
"sorting",
"divide and conquer",
"geometry",
"quickselect",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "k-th-smallest-in-lexicographical-order",
"title": "K-th Smallest in Lexicographical Order",
"difficulty": "hard",
"created_at": "2026-04-12 22:37:58",
"topics": [
"trie"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "kill-process",
"title": "Kill Process",
"difficulty": "medium",
"created_at": "2026-04-12 22:38:02",
"topics": [
"array",
"breadth first search",
"hash table",
"tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "kth-distinct-string-in-an-array",
"title": "Kth Distinct String in an Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:38:06",
"topics": [
"array",
"string",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "kth-largest-element-in-an-array",
"title": "Kth Largest Element in an Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:38:10",
"topics": [
"array",
"sorting",
"divide and conquer",
"quickselect",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "kth-largest-integer-in-a-stream",
"title": "Kth Largest Element in a Stream",
"difficulty": "easy",
"created_at": "2026-04-12 22:38:13",
"topics": [
"tree",
"binary tree",
"binary search tree",
"design",
"data stream",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "kth-smallest-integer-in-bst",
"title": "Kth Smallest Integer in BST",
"difficulty": "medium",
"created_at": "2026-04-12 22:38:16",
"topics": [
"tree",
"binary tree",
"depth first search",
"binary search tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "kth-smallest-product-of-two-sorted-arrays",
"title": "Kth Smallest Product of Two Sorted Arrays",
"difficulty": "hard",
"created_at": "2026-04-12 22:38:20",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "largest-3-same-digit-number-in-string",
"title": "Largest 3-Same-Digit Number in String",
"difficulty": "easy",
"created_at": "2026-04-12 22:38:24",
"topics": [
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "largest-bst-subtree",
"title": "Largest BST Subtree",
"difficulty": "medium",
"created_at": "2026-04-12 22:38:27",
"topics": [
"dynamic programming",
"tree",
"binary tree",
"depth first search",
"binary search tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "largest-divisible-subset",
"title": "Largest Divisible Subset",
"difficulty": "medium",
"created_at": "2026-04-12 22:38:31",
"topics": [
"array",
"math",
"dynamic programming",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "largest-number",
"title": "Largest Number",
"difficulty": "medium",
"created_at": "2026-04-12 22:38:35",
"topics": [
"array",
"string",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "largest-rectangle-in-histogram",
"title": "Largest Rectangle In Histogram",
"difficulty": "hard",
"created_at": "2026-04-12 22:38:38",
"topics": [
"array",
"stack",
"monotonic stack"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "largest-submatrix-with-rearrangements",
"title": "Largest Submatrix With Rearrangements",
"difficulty": "medium",
"created_at": "2026-04-12 22:38:42",
"topics": [
"array",
"greedy",
"sorting",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "largest-unique-number",
"title": "Largest Unique Number",
"difficulty": "easy",
"created_at": "2026-04-12 22:38:45",
"topics": [
"array",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "last-stone-weight",
"title": "Last Stone Weight",
"difficulty": "easy",
"created_at": "2026-04-12 22:38:49",
"topics": [
"array",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "last-stone-weight-ii",
"title": "Last Stone Weight II",
"difficulty": "medium",
"created_at": "2026-04-12 22:38:52",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "leftmost-column-with-at-least-a-one",
"title": "Leftmost Column With at Least a One",
"difficulty": "medium",
"created_at": "2026-04-12 22:38:56",
"topics": [
"array",
"binary search",
"matrix",
"interactive"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "lemonade-change",
"title": "Lemonade Change",
"difficulty": "easy",
"created_at": "2026-04-12 22:39:00",
"topics": [
"array",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "length-of-last-word",
"title": "Length Of Last Word",
"difficulty": "easy",
"created_at": "2026-04-12 22:39:03",
"topics": [
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "level-order-traversal-of-binary-tree",
"title": "Binary Tree Level Order Traversal",
"difficulty": "medium",
"created_at": "2026-04-12 22:39:07",
"topics": [
"breadth first search",
"tree",
"binary tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "lfu-cache",
"title": "LFU Cache",
"difficulty": "hard",
"created_at": "2026-04-12 22:39:10",
"topics": [
"hash table",
"design",
"linked list",
"doubly linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "line-reflection",
"title": "Line Reflection",
"difficulty": "medium",
"created_at": "2026-04-12 22:39:14",
"topics": [
"array",
"math",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "linked-list-cycle-detection",
"title": "Linked List Cycle Detection",
"difficulty": "easy",
"created_at": "2026-04-12 22:39:17",
"topics": [
"two pointers",
"hash table",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "logger-rate-limiter",
"title": "Logger Rate Limiter",
"difficulty": "easy",
"created_at": "2026-04-12 22:39:21",
"topics": [
"hash table",
"design",
"data stream"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "lonely-pixel-i",
"title": "Lonely Pixel I",
"difficulty": "medium",
"created_at": "2026-04-12 22:39:25",
"topics": [
"array",
"matrix",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "longest-common-prefix",
"title": "Longest Common Prefix",
"difficulty": "easy",
"created_at": "2026-04-12 22:39:28",
"topics": [
"array",
"string",
"trie"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "longest-common-subsequence",
"title": "Longest Common Subsequence",
"difficulty": "medium",
"created_at": "2026-04-12 22:39:32",
"topics": [
"dynamic programming",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "longest-consecutive-sequence",
"title": "Longest Consecutive Sequence",
"difficulty": "medium",
"created_at": "2026-04-12 22:39:35",
"topics": [
"array",
"hash table",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit",
"title": "Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit",
"difficulty": "medium",
"created_at": "2026-04-12 22:39:39",
"topics": [
"array",
"ordered set",
"sliding window",
"queue",
"monotonic queue",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "longest-happy-string",
"title": "Longest Happy String",
"difficulty": "medium",
"created_at": "2026-04-12 22:39:42",
"topics": [
"string",
"greedy",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "longest-increasing-path-in-matrix",
"title": "Longest Increasing Path in Matrix",
"difficulty": "hard",
"created_at": "2026-04-12 22:39:46",
"topics": [
"array",
"dynamic programming",
"breadth first search",
"matrix",
"depth first search",
"memoization",
"topological sort",
"graph"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "longest-increasing-subsequence",
"title": "Longest Increasing Subsequence",
"difficulty": "medium",
"created_at": "2026-04-12 22:39:49",
"topics": [
"array",
"binary search",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "longest-palindromic-substring",
"title": "Longest Palindromic Substring",
"difficulty": "medium",
"created_at": "2026-04-12 22:39:53",
"topics": [
"dynamic programming",
"two pointers",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "longest-repeating-substring-with-replacement",
"title": "Longest Repeating Character Replacement",
"difficulty": "medium",
"created_at": "2026-04-12 22:39:56",
"topics": [
"string",
"sliding window",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "longest-strictly-increasing-or-strictly-decreasing-subarray",
"title": "Longest Strictly Increasing or Strictly Decreasing Subarray",
"difficulty": "easy",
"created_at": "2026-04-12 22:40:00",
"topics": [
"array"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "longest-substring-with-at-most-k-distinct-characters",
"title": "Longest Substring with At Most K Distinct Characters",
"difficulty": "medium",
"created_at": "2026-04-12 22:40:04",
"topics": [
"string",
"sliding window",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "longest-substring-with-at-most-two-distinct-characters",
"title": "Longest Substring with At Most Two Distinct Characters",
"difficulty": "medium",
"created_at": "2026-04-12 22:40:08",
"topics": [
"string",
"sliding window",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "longest-substring-without-duplicates",
"title": "Longest Substring Without Repeating Characters",
"difficulty": "medium",
"created_at": "2026-04-12 22:40:11",
"topics": [
"string",
"sliding window",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "longest-turbulent-subarray",
"title": "Longest Turbulent Subarray",
"difficulty": "medium",
"created_at": "2026-04-12 22:40:15",
"topics": [
"array",
"dynamic programming",
"sliding window"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "lowest-common-ancestor-in-binary-search-tree",
"title": "Lowest Common Ancestor in Binary Search Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:40:18",
"topics": [
"tree",
"binary tree",
"depth first search",
"binary search tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "lowest-common-ancestor-of-a-binary-tree",
"title": "Lowest Common Ancestor of a Binary Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:40:22",
"topics": [
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "lowest-common-ancestor-of-a-binary-tree-iii",
"title": "Lowest Common Ancestor of a Binary Tree III",
"difficulty": "medium",
"created_at": "2026-04-12 22:40:25",
"topics": [
"two pointers",
"hash table",
"tree",
"binary tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "lru-cache",
"title": "LRU Cache",
"difficulty": "medium",
"created_at": "2026-04-12 22:40:29",
"topics": [
"hash table",
"design",
"linked list",
"doubly linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "majority-element",
"title": "Majority Element",
"difficulty": "easy",
"created_at": "2026-04-12 22:40:32",
"topics": [
"array",
"sorting",
"hash table",
"counting",
"divide and conquer"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "majority-element-ii",
"title": "Majority Element II",
"difficulty": "medium",
"created_at": "2026-04-12 22:40:36",
"topics": [
"array",
"sorting",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "matchsticks-to-square",
"title": "Matchsticks to Square",
"difficulty": "medium",
"created_at": "2026-04-12 22:40:40",
"topics": [
"array",
"dynamic programming",
"bit manipulation",
"backtracking",
"bitmask dp"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "matrix-diagonal-sum",
"title": "Matrix Diagonal Sum",
"difficulty": "easy",
"created_at": "2026-04-12 22:40:43",
"topics": [
"array",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "max-area-of-island",
"title": "Max Area of Island",
"difficulty": "medium",
"created_at": "2026-04-12 22:40:47",
"topics": [
"array",
"breadth first search",
"matrix",
"depth first search",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "max-consecutive-ones",
"title": "Max Consecutive Ones",
"difficulty": "easy",
"created_at": "2026-04-12 22:40:50",
"topics": [
"array"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "max-consecutive-ones-ii",
"title": "Max Consecutive Ones II",
"difficulty": "medium",
"created_at": "2026-04-12 22:40:54",
"topics": [
"array",
"dynamic programming",
"sliding window"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "max-consecutive-ones-iii",
"title": "Max Consecutive Ones III",
"difficulty": "medium",
"created_at": "2026-04-12 22:40:57",
"topics": [
"array",
"binary search",
"sliding window",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "max-stack",
"title": "Max Stack",
"difficulty": "hard",
"created_at": "2026-04-12 22:41:01",
"topics": [
"stack",
"ordered set",
"design",
"linked list",
"doubly linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "max-water-container",
"title": "Container With Most Water",
"difficulty": "medium",
"created_at": "2026-04-12 22:41:04",
"topics": [
"array",
"two pointers",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximal-square",
"title": "Maximal Square",
"difficulty": "medium",
"created_at": "2026-04-12 22:41:08",
"topics": [
"array",
"dynamic programming",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximize-ysum-by-picking-a-triplet-of-distinct-xvalues",
"title": "Maximize Y-Sum by Picking a Triplet of Distinct X-Values",
"difficulty": "medium",
"created_at": "2026-04-12 22:41:11",
"topics": [
"array",
"greedy",
"sorting",
"hash table",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-ascending-subarray-sum",
"title": "Maximum Ascending Subarray Sum",
"difficulty": "easy",
"created_at": "2026-04-12 22:41:15",
"topics": [
"array"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-average-subarray-ii",
"title": "Maximum Average Subarray II",
"difficulty": "hard",
"created_at": "2026-04-12 22:41:19",
"topics": [
"array",
"binary search",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-average-subtree",
"title": "Maximum Average Subtree",
"difficulty": "medium",
"created_at": "2026-04-12 22:41:22",
"topics": [
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-difference-between-even-and-odd-frequency-i",
"title": "Maximum Difference Between Even and Odd Frequency I",
"difficulty": "easy",
"created_at": "2026-04-12 22:41:26",
"topics": [
"string",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-distance-in-arrays",
"title": "Maximum Distance in Arrays",
"difficulty": "medium",
"created_at": "2026-04-12 22:41:30",
"topics": [
"array",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-frequency-after-subarray-operation",
"title": "Maximum Frequency After Subarray Operation",
"difficulty": "medium",
"created_at": "2026-04-12 22:41:33",
"topics": [
"array",
"dynamic programming",
"greedy",
"hash table",
"enumeration",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-frequency-stack",
"title": "Maximum Frequency Stack",
"difficulty": "hard",
"created_at": "2026-04-12 22:41:37",
"topics": [
"stack",
"ordered set",
"hash table",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-nesting-depth-of-the-parentheses",
"title": "Maximum Nesting Depth of the Parentheses",
"difficulty": "easy",
"created_at": "2026-04-12 22:41:40",
"topics": [
"stack",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-number-of-balloons",
"title": "Maximum Number of Balloons",
"difficulty": "easy",
"created_at": "2026-04-12 22:41:44",
"topics": [
"string",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-number-of-ones",
"title": "Maximum Number of Ones",
"difficulty": "hard",
"created_at": "2026-04-12 22:41:47",
"topics": [
"math",
"greedy",
"sorting",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-number-of-points-with-cost",
"title": "Maximum Number of Points with Cost",
"difficulty": "medium",
"created_at": "2026-04-12 22:41:52",
"topics": [
"array",
"dynamic programming",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-odd-binary-number",
"title": "Maximum Odd Binary Number",
"difficulty": "easy",
"created_at": "2026-04-12 22:41:55",
"topics": [
"math",
"string",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-points-you-can-obtain-from-cards",
"title": "Maximum Points You Can Obtain From Cards",
"difficulty": "medium",
"created_at": "2026-04-12 22:41:59",
"topics": [
"array",
"sliding window",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-product-difference-between-two-pairs",
"title": "Maximum Product Difference Between Two Pairs",
"difficulty": "easy",
"created_at": "2026-04-12 22:42:02",
"topics": [
"array",
"math",
"sorting",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-product-subarray",
"title": "Maximum Product Subarray",
"difficulty": "medium",
"created_at": "2026-04-12 22:42:06",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-profit-in-job-scheduling",
"title": "Maximum Profit in Job Scheduling",
"difficulty": "hard",
"created_at": "2026-04-12 22:42:10",
"topics": [
"array",
"binary search",
"dynamic programming",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-score-after-splitting-a-string",
"title": "Maximum Score After Splitting a String",
"difficulty": "easy",
"created_at": "2026-04-12 22:42:13",
"topics": [
"string",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-subarray",
"title": "Maximum Subarray",
"difficulty": "medium",
"created_at": "2026-04-12 22:42:17",
"topics": [
"array",
"dynamic programming",
"divide and conquer"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-sum-circular-subarray",
"title": "Maximum Sum Circular Subarray",
"difficulty": "medium",
"created_at": "2026-04-12 22:42:21",
"topics": [
"array",
"dynamic programming",
"queue",
"monotonic queue",
"divide and conquer"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-transactions-without-negative-balance",
"title": "Maximum Transactions Without Negative Balance",
"difficulty": "medium",
"created_at": "2026-04-12 22:42:24",
"topics": [
"array",
"greedy",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "maximum-twin-sum-of-a-linked-list",
"title": "Maximum Twin Sum of a Linked List",
"difficulty": "medium",
"created_at": "2026-04-12 22:42:28",
"topics": [
"stack",
"two pointers",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "median-of-two-sorted-arrays",
"title": "Median of Two Sorted Arrays",
"difficulty": "hard",
"created_at": "2026-04-12 22:42:32",
"topics": [
"array",
"binary search",
"divide and conquer"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "meeting-rooms-iii",
"title": "Meeting Rooms III",
"difficulty": "hard",
"created_at": "2026-04-12 22:42:35",
"topics": [
"array",
"simulation",
"sorting",
"hash table",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "meeting-schedule",
"title": "Meeting Rooms",
"difficulty": "easy",
"created_at": "2026-04-12 22:42:39",
"topics": [
"array",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "meeting-schedule-ii",
"title": "Meeting Rooms II",
"difficulty": "medium",
"created_at": "2026-04-12 22:42:42",
"topics": [
"array",
"two pointers",
"greedy",
"sorting",
"prefix sum",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "meeting-scheduler",
"title": "Meeting Scheduler",
"difficulty": "medium",
"created_at": "2026-04-12 22:42:46",
"topics": [
"array",
"two pointers",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "merge-intervals",
"title": "Merge Intervals",
"difficulty": "medium",
"created_at": "2026-04-12 22:42:50",
"topics": [
"array",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "merge-k-sorted-linked-lists",
"title": "Merge K Sorted Linked Lists",
"difficulty": "hard",
"created_at": "2026-04-12 22:42:54",
"topics": [
"divide and conquer",
"linked list",
"merge sort",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "merge-sorted-array",
"title": "Merge Sorted Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:42:57",
"topics": [
"array",
"two pointers",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "merge-strings-alternately",
"title": "Merge Strings Alternately",
"difficulty": "easy",
"created_at": "2026-04-12 22:43:01",
"topics": [
"two pointers",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "merge-triplets-to-form-target",
"title": "Merge Triplets to Form Target",
"difficulty": "medium",
"created_at": "2026-04-12 22:43:05",
"topics": [
"array",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "merge-two-binary-trees",
"title": "Merge Two Binary Trees",
"difficulty": "easy",
"created_at": "2026-04-12 22:43:11",
"topics": [
"breadth first search",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "merge-two-sorted-linked-lists",
"title": "Merge Two Sorted Linked Lists",
"difficulty": "easy",
"created_at": "2026-04-12 22:43:14",
"topics": [
"linked list",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "middle-of-the-linked-list",
"title": "Middle of the Linked List",
"difficulty": "easy",
"created_at": "2026-04-12 22:43:18",
"topics": [
"two pointers",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "min-cost-climbing-stairs",
"title": "Min Cost Climbing Stairs",
"difficulty": "easy",
"created_at": "2026-04-12 22:43:21",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "min-cost-to-connect-points",
"title": "Min Cost to Connect Points",
"difficulty": "medium",
"created_at": "2026-04-12 22:43:25",
"topics": [
"array",
"union find",
"graph theory",
"minimum spanning tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimize-the-maximum-difference-of-pairs",
"title": "Minimize the Maximum Difference of Pairs",
"difficulty": "medium",
"created_at": "2026-04-12 22:43:29",
"topics": [
"array",
"binary search",
"dynamic programming",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-array-end",
"title": "Minimum Array End",
"difficulty": "medium",
"created_at": "2026-04-12 22:43:32",
"topics": [
"bit manipulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-changes-to-make-alternating-binary-string",
"title": "Minimum Changes To Make Alternating Binary String",
"difficulty": "easy",
"created_at": "2026-04-12 22:43:36",
"topics": [
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-cost-for-tickets",
"title": "Minimum Cost For Tickets",
"difficulty": "medium",
"created_at": "2026-04-12 22:43:40",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-cost-to-connect-sticks",
"title": "Minimum Cost to Connect Sticks",
"difficulty": "medium",
"created_at": "2026-04-12 22:43:43",
"topics": [
"array",
"greedy",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-difference-between-highest-and-lowest-of-k-scores",
"title": "Minimum Difference Between Highest And Lowest of K Scores",
"difficulty": "easy",
"created_at": "2026-04-12 22:43:47",
"topics": [
"array",
"sliding window",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-factorization",
"title": "Minimum Factorization",
"difficulty": "medium",
"created_at": "2026-04-12 22:43:50",
"topics": [
"math",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-height-trees",
"title": "Minimum Height Trees",
"difficulty": "medium",
"created_at": "2026-04-12 22:43:54",
"topics": [
"breadth first search",
"depth first search",
"graph theory",
"topological sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-interval-including-query",
"title": "Minimum Interval to Include Each Query",
"difficulty": "hard",
"created_at": "2026-04-12 22:43:58",
"topics": [
"array",
"binary search",
"sorting",
"heap priority queue",
"sweep line"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-knight-moves",
"title": "Minimum Knight Moves",
"difficulty": "medium",
"created_at": "2026-04-12 22:44:01",
"topics": [
"breadth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "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",
"created_at": "2026-04-12 22:44:05",
"topics": [
"array",
"stack",
"monotonic stack",
"dynamic programming",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-number-of-moves-to-seat-everyone",
"title": "Minimum Number of Moves to Seat Everyone",
"difficulty": "easy",
"created_at": "2026-04-12 22:44:09",
"topics": [
"array",
"greedy",
"sorting",
"counting sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-number-of-operations-to-make-array-empty",
"title": "Minimum Number of Operations to Make Array Empty",
"difficulty": "medium",
"created_at": "2026-04-12 22:44:12",
"topics": [
"array",
"greedy",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-path-sum",
"title": "Minimum Path Sum",
"difficulty": "medium",
"created_at": "2026-04-12 22:44:16",
"topics": [
"array",
"dynamic programming",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-recolors-to-get-k-consecutive-black-blocks",
"title": "Minimum Recolors to Get K Consecutive Black Blocks",
"difficulty": "easy",
"created_at": "2026-04-12 22:44:20",
"topics": [
"string",
"sliding window"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-remove-to-make-valid-parentheses",
"title": "Minimum Remove to make Valid Parentheses",
"difficulty": "medium",
"created_at": "2026-04-12 22:44:23",
"topics": [
"stack",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-size-subarray-sum",
"title": "Minimum Size Subarray Sum",
"difficulty": "medium",
"created_at": "2026-04-12 22:44:27",
"topics": [
"array",
"binary search",
"sliding window",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-stack",
"title": "Min Stack",
"difficulty": "medium",
"created_at": "2026-04-12 22:44:31",
"topics": [
"stack",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-time-to-collect-all-apples-in-a-tree",
"title": "Minimum Time to Collect All Apples in a Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:44:34",
"topics": [
"breadth first search",
"hash table",
"tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimum-window-with-characters",
"title": "Minimum Window Substring",
"difficulty": "hard",
"created_at": "2026-04-12 22:44:38",
"topics": [
"string",
"sliding window",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "missing-element-in-sorted-array",
"title": "Missing Element in Sorted Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:44:41",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "missing-number",
"title": "Missing Number",
"difficulty": "easy",
"created_at": "2026-04-12 22:44:45",
"topics": [
"array",
"binary search",
"math",
"sorting",
"bit manipulation",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "missing-number-in-arithmetic-progression",
"title": "Missing Number In Arithmetic Progression",
"difficulty": "easy",
"created_at": "2026-04-12 22:44:49",
"topics": [
"array",
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "missing-ranges",
"title": "Missing Ranges",
"difficulty": "easy",
"created_at": "2026-04-12 22:44:52",
"topics": [
"array"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "monotonic-array",
"title": "Monotonic Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:44:56",
"topics": [
"array"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "move-zeroes",
"title": "Move Zeroes",
"difficulty": "easy",
"created_at": "2026-04-12 22:45:00",
"topics": [
"array",
"two pointers"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "moving-average-from-data-stream",
"title": "Moving Average from Data Stream",
"difficulty": "easy",
"created_at": "2026-04-12 22:45:03",
"topics": [
"array",
"queue",
"design",
"data stream"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "multiply-strings",
"title": "Multiply Strings",
"difficulty": "medium",
"created_at": "2026-04-12 22:45:07",
"topics": [
"math",
"string",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "n-ary-tree-postorder-traversal",
"title": "N-ary Tree Postorder Traversal",
"difficulty": "easy",
"created_at": "2026-04-12 22:45:10",
"topics": [
"stack",
"tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "n-queens",
"title": "N-Queens",
"difficulty": "hard",
"created_at": "2026-04-12 22:45:14",
"topics": [
"array",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "n-queens-ii",
"title": "N-Queens II",
"difficulty": "hard",
"created_at": "2026-04-12 22:45:17",
"topics": [
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "n-th-tribonacci-number",
"title": "N-th Tribonacci Number",
"difficulty": "easy",
"created_at": "2026-04-12 22:45:21",
"topics": [
"math",
"dynamic programming",
"memoization"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "nested-list-weight-sum",
"title": "Nested List Weight Sum",
"difficulty": "medium",
"created_at": "2026-04-12 22:45:25",
"topics": [
"breadth first search",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "nested-list-weight-sum-ii",
"title": "Nested List Weight Sum II",
"difficulty": "medium",
"created_at": "2026-04-12 22:45:28",
"topics": [
"stack",
"breadth first search",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "network-delay-time",
"title": "Network Delay Time",
"difficulty": "medium",
"created_at": "2026-04-12 22:45:32",
"topics": [
"breadth first search",
"depth first search",
"shortest path",
"graph",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "new-21-game",
"title": "New 21 Game",
"difficulty": "medium",
"created_at": "2026-04-12 22:45:36",
"topics": [
"math",
"dynamic programming",
"sliding window",
"probability and statistics"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "next-greater-element-i",
"title": "Next Greater Element I",
"difficulty": "easy",
"created_at": "2026-04-12 22:45:39",
"topics": [
"array",
"stack",
"monotonic stack",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "next-permutation",
"title": "Next Permutation",
"difficulty": "medium",
"created_at": "2026-04-12 22:45:43",
"topics": [
"array",
"two pointers"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "non-cyclical-number",
"title": "Non-Cyclical Number",
"difficulty": "easy",
"created_at": "2026-04-12 22:45:46",
"topics": [
"math",
"two pointers",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "non-overlapping-intervals",
"title": "Non-overlapping Intervals",
"difficulty": "medium",
"created_at": "2026-04-12 22:45:50",
"topics": [
"array",
"dynamic programming",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "number-of-distinct-islands",
"title": "Number of Distinct Islands",
"difficulty": "medium",
"created_at": "2026-04-12 22:45:53",
"topics": [
"breadth first search",
"hash table",
"hash function",
"depth first search",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "number-of-distinct-islands-ii",
"title": "Number of Distinct Islands II",
"difficulty": "hard",
"created_at": "2026-04-12 22:45:57",
"topics": [
"array",
"sorting",
"breadth first search",
"matrix",
"hash table",
"hash function",
"depth first search",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "number-of-enclaves",
"title": "Number of Enclaves",
"difficulty": "medium",
"created_at": "2026-04-12 22:46:00",
"topics": [
"array",
"breadth first search",
"matrix",
"depth first search",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "number-of-good-pairs",
"title": "Number of Good Pairs",
"difficulty": "easy",
"created_at": "2026-04-12 22:46:04",
"topics": [
"array",
"math",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "number-of-islands-ii",
"title": "Number of Islands II",
"difficulty": "hard",
"created_at": "2026-04-12 22:46:07",
"topics": [
"array",
"hash table",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "number-of-one-bits",
"title": "Number of 1 Bits",
"difficulty": "easy",
"created_at": "2026-04-12 22:46:11",
"topics": [
"bit manipulation",
"divide and conquer"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "number-of-provinces",
"title": "Number of Provinces",
"difficulty": "medium",
"created_at": "2026-04-12 22:46:15",
"topics": [
"breadth first search",
"depth first search",
"union find",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "number-of-senior-citizens",
"title": "Number of Senior Citizens",
"difficulty": "easy",
"created_at": "2026-04-12 22:46:18",
"topics": [
"array",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "number-of-ships-in-a-rectangle",
"title": "Number of Ships in a Rectangle",
"difficulty": "hard",
"created_at": "2026-04-12 22:46:22",
"topics": [
"array",
"divide and conquer",
"interactive"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "number-of-students-unable-to-eat-lunch",
"title": "Number of Students Unable to Eat Lunch",
"difficulty": "easy",
"created_at": "2026-04-12 22:46:27",
"topics": [
"array",
"stack",
"simulation",
"queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold",
"title": "Number of Sub Arrays of Size K and Avg Greater than or Equal to Threshold",
"difficulty": "medium",
"created_at": "2026-04-12 22:46:30",
"topics": [
"array",
"sliding window"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "number-of-subsequences-that-satisfy-the-given-sum-condition",
"title": "Number of Subsequences That Satisfy The Given Sum Condition",
"difficulty": "medium",
"created_at": "2026-04-12 22:46:34",
"topics": [
"array",
"binary search",
"two pointers",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "number-of-visible-people-in-a-queue",
"title": "Number of Visible People in a Queue",
"difficulty": "hard",
"created_at": "2026-04-12 22:46:38",
"topics": [
"array",
"stack",
"monotonic stack"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "one-edit-distance",
"title": "One Edit Distance",
"difficulty": "medium",
"created_at": "2026-04-12 22:46:41",
"topics": [
"two pointers",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "ones-and-zeroes",
"title": "Ones and Zeroes",
"difficulty": "medium",
"created_at": "2026-04-12 22:46:45",
"topics": [
"array",
"dynamic programming",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "online-stock-span",
"title": "Online Stock Span",
"difficulty": "medium",
"created_at": "2026-04-12 22:46:48",
"topics": [
"stack",
"monotonic stack",
"design",
"data stream"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "open-the-lock",
"title": "Open The Lock",
"difficulty": "medium",
"created_at": "2026-04-12 22:46:52",
"topics": [
"array",
"string",
"breadth first search",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "optimal-account-balancing",
"title": "Optimal Account Balancing",
"difficulty": "hard",
"created_at": "2026-04-12 22:46:55",
"topics": [
"array",
"dynamic programming",
"bit manipulation",
"backtracking",
"bitmask dp"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "pacific-atlantic-water-flow",
"title": "Pacific Atlantic Water Flow",
"difficulty": "medium",
"created_at": "2026-04-12 22:46:59",
"topics": [
"array",
"breadth first search",
"matrix",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "paint-fence",
"title": "Paint Fence",
"difficulty": "medium",
"created_at": "2026-04-12 22:47:03",
"topics": [
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "paint-house",
"title": "Paint House",
"difficulty": "medium",
"created_at": "2026-04-12 22:47:06",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "paint-house-ii",
"title": "Paint House II",
"difficulty": "hard",
"created_at": "2026-04-12 22:47:10",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "palindrome-linked-list",
"title": "Palindrome Linked List",
"difficulty": "easy",
"created_at": "2026-04-12 22:47:13",
"topics": [
"stack",
"two pointers",
"linked list",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "palindrome-number",
"title": "Palindrome Number",
"difficulty": "easy",
"created_at": "2026-04-12 22:47:17",
"topics": [
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "palindrome-partitioning",
"title": "Palindrome Partitioning",
"difficulty": "medium",
"created_at": "2026-04-12 22:47:20",
"topics": [
"dynamic programming",
"string",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "palindrome-permutation",
"title": "Palindrome Permutation",
"difficulty": "easy",
"created_at": "2026-04-12 22:47:24",
"topics": [
"string",
"bit manipulation",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "palindromic-substrings",
"title": "Palindromic Substrings",
"difficulty": "medium",
"created_at": "2026-04-12 22:47:27",
"topics": [
"dynamic programming",
"two pointers",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "parallel-courses",
"title": "Parallel Courses",
"difficulty": "medium",
"created_at": "2026-04-12 22:47:31",
"topics": [
"graph theory",
"topological sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "partition-equal-subset-sum",
"title": "Partition Equal Subset Sum",
"difficulty": "medium",
"created_at": "2026-04-12 22:47:34",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "partition-labels",
"title": "Partition Labels",
"difficulty": "medium",
"created_at": "2026-04-12 22:47:38",
"topics": [
"two pointers",
"string",
"greedy",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "partition-to-k-equal-sum-subsets",
"title": "Partition to K Equal Sum Subsets",
"difficulty": "medium",
"created_at": "2026-04-12 22:47:42",
"topics": [
"array",
"dynamic programming",
"bit manipulation",
"backtracking",
"memoization",
"bitmask dp"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "pascals-triangle",
"title": "Pascal's Triangle",
"difficulty": "easy",
"created_at": "2026-04-12 22:47:45",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "pascals-triangle-ii",
"title": "Pascal's Triangle II",
"difficulty": "easy",
"created_at": "2026-04-12 22:47:49",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "path-crossing",
"title": "Path Crossing",
"difficulty": "easy",
"created_at": "2026-04-12 22:47:52",
"topics": [
"string",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "path-sum",
"title": "Path Sum",
"difficulty": "easy",
"created_at": "2026-04-12 22:47:56",
"topics": [
"breadth first search",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "path-with-maximum-probability",
"title": "Path with Maximum Probability",
"difficulty": "medium",
"created_at": "2026-04-12 22:47:59",
"topics": [
"array",
"graph theory",
"shortest path",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "path-with-minimum-effort",
"title": "Path with Minimum Effort",
"difficulty": "medium",
"created_at": "2026-04-12 22:48:03",
"topics": [
"array",
"binary search",
"breadth first search",
"matrix",
"depth first search",
"union find",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "perfect-squares",
"title": "Perfect Squares",
"difficulty": "medium",
"created_at": "2026-04-12 22:48:07",
"topics": [
"math",
"dynamic programming",
"breadth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "perform-string-shifts",
"title": "Perform String Shifts",
"difficulty": "easy",
"created_at": "2026-04-12 22:48:10",
"topics": [
"array",
"math",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "permutation-string",
"title": "Permutation in String",
"difficulty": "medium",
"created_at": "2026-04-12 22:48:14",
"topics": [
"two pointers",
"string",
"sliding window",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "permutations",
"title": "Permutations",
"difficulty": "medium",
"created_at": "2026-04-12 22:48:17",
"topics": [
"array",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "permutations-ii",
"title": "Permutations II",
"difficulty": "medium",
"created_at": "2026-04-12 22:48:21",
"topics": [
"array",
"sorting",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "plus-one",
"title": "Plus One",
"difficulty": "easy",
"created_at": "2026-04-12 22:48:25",
"topics": [
"array",
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "plus-one-linked-list",
"title": "Plus One Linked List",
"difficulty": "medium",
"created_at": "2026-04-12 22:48:28",
"topics": [
"math",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "populating-next-right-pointers-in-each-node",
"title": "Populating Next Right Pointers In Each Node",
"difficulty": "medium",
"created_at": "2026-04-12 22:48:32",
"topics": [
"breadth first search",
"tree",
"binary tree",
"depth first search",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "pow-x-n",
"title": "Pow(x, n)",
"difficulty": "medium",
"created_at": "2026-04-12 22:48:35",
"topics": [
"math",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "power-of-two",
"title": "Power of Two",
"difficulty": "easy",
"created_at": "2026-04-12 22:48:39",
"topics": [
"math",
"bit manipulation",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "print-immutable-linked-list-in-reverse",
"title": "Print Immutable Linked List in Reverse",
"difficulty": "medium",
"created_at": "2026-04-12 22:48:43",
"topics": [
"stack",
"two pointers",
"linked list",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "product-of-two-run-length-encoded-arrays",
"title": "Product of Two Run Length Encoded Arrays",
"difficulty": "medium",
"created_at": "2026-04-12 22:48:46",
"topics": [
"array",
"two pointers"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "products-of-array-discluding-self",
"title": "Products of Array Except Self",
"difficulty": "medium",
"created_at": "2026-04-12 22:48:50",
"topics": [
"array",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "put-boxes-into-the-warehouse-i",
"title": "Put Boxes Into the Warehouse I",
"difficulty": "medium",
"created_at": "2026-04-12 22:48:53",
"topics": [
"array",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "put-marbles-in-bags",
"title": "Put Marbles in Bags",
"difficulty": "hard",
"created_at": "2026-04-12 22:48:57",
"topics": [
"array",
"greedy",
"sorting",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "random-pick-with-weight",
"title": "Random Pick with Weight",
"difficulty": "medium",
"created_at": "2026-04-12 22:49:00",
"topics": [
"array",
"binary search",
"math",
"prefix sum",
"randomized"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "range-sum-of-bst",
"title": "Range Sum of BST",
"difficulty": "easy",
"created_at": "2026-04-12 22:49:04",
"topics": [
"tree",
"binary tree",
"depth first search",
"binary search tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "range-sum-query-2d-immutable",
"title": "Range Sum Query 2D Immutable",
"difficulty": "medium",
"created_at": "2026-04-12 22:49:07",
"topics": [
"array",
"matrix",
"prefix sum",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "range-sum-query-2d-mutable",
"title": "Range Sum Query 2D - Mutable",
"difficulty": "medium",
"created_at": "2026-04-12 22:49:11",
"topics": [
"array",
"matrix",
"binary indexed tree",
"segment tree",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "range-sum-query-immutable",
"title": "Range Sum Query Immutable",
"difficulty": "easy",
"created_at": "2026-04-12 22:49:15",
"topics": [
"array",
"prefix sum",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "ransom-note",
"title": "Ransom Note",
"difficulty": "easy",
"created_at": "2026-04-12 22:49:18",
"topics": [
"string",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "rearrange-array-elements-by-sign",
"title": "Rearrange Array Elements by Sign",
"difficulty": "medium",
"created_at": "2026-04-12 22:49:22",
"topics": [
"array",
"two pointers",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "rearrange-string-k-distance-apart",
"title": "Rearrange String k Distance Apart",
"difficulty": "hard",
"created_at": "2026-04-12 22:49:26",
"topics": [
"string",
"greedy",
"sorting",
"hash table",
"counting",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "reconstruct-flight-path",
"title": "Reconstruct Flight Path",
"difficulty": "hard",
"created_at": "2026-04-12 22:49:29",
"topics": [
"depth first search",
"graph theory",
"eulerian circuit"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "recover-binary-search-tree",
"title": "Recover Binary Search Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:49:33",
"topics": [
"tree",
"binary tree",
"depth first search",
"binary search tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "redistribute-characters-to-make-all-strings-equal",
"title": "Redistribute Characters to Make All Strings Equal",
"difficulty": "easy",
"created_at": "2026-04-12 22:49:36",
"topics": [
"string",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "redundant-connection",
"title": "Redundant Connection",
"difficulty": "medium",
"created_at": "2026-04-12 22:49:40",
"topics": [
"breadth first search",
"depth first search",
"union find",
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "regular-expression-matching",
"title": "Regular Expression Matching",
"difficulty": "hard",
"created_at": "2026-04-12 22:49:44",
"topics": [
"dynamic programming",
"string",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "remove-all-adjacent-duplicates-in-string-ii",
"title": "Remove All Adjacent Duplicates In String II",
"difficulty": "medium",
"created_at": "2026-04-12 22:49:47",
"topics": [
"stack",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "remove-duplicates-from-sorted-array",
"title": "Remove Duplicates From Sorted Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:49:51",
"topics": [
"array",
"two pointers"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "remove-element",
"title": "Remove Element",
"difficulty": "easy",
"created_at": "2026-04-12 22:49:54",
"topics": [
"array",
"two pointers"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "remove-interval",
"title": "Remove Interval",
"difficulty": "medium",
"created_at": "2026-04-12 22:49:58",
"topics": [
"array"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "remove-linked-list-elements",
"title": "Remove Linked List Elements",
"difficulty": "easy",
"created_at": "2026-04-12 22:50:01",
"topics": [
"linked list",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "remove-node-from-end-of-linked-list",
"title": "Remove Node From End of Linked List",
"difficulty": "medium",
"created_at": "2026-04-12 22:50:05",
"topics": [
"two pointers",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "remove-sub-folders-from-the-filesystem",
"title": "Remove Sub-Folders from the Filesystem",
"difficulty": "medium",
"created_at": "2026-04-12 22:50:09",
"topics": [
"array",
"string",
"depth first search",
"trie"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "reorder-linked-list",
"title": "Reorder Linked List",
"difficulty": "medium",
"created_at": "2026-04-12 22:50:12",
"topics": [
"stack",
"two pointers",
"linked list",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "reorganize-string",
"title": "Reorganize String",
"difficulty": "medium",
"created_at": "2026-04-12 22:50:16",
"topics": [
"string",
"greedy",
"sorting",
"hash table",
"counting",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "replace-elements-with-greatest-element-on-right-side",
"title": "Replace Elements With Greatest Element On Right Side",
"difficulty": "easy",
"created_at": "2026-04-12 22:50:19",
"topics": [
"array"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "restore-ip-addresses",
"title": "Restore IP Addresses",
"difficulty": "medium",
"created_at": "2026-04-12 22:50:23",
"topics": [
"string",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "reverse-a-linked-list",
"title": "Reverse Linked List",
"difficulty": "easy",
"created_at": "2026-04-12 22:50:26",
"topics": [
"linked list",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "reverse-bits",
"title": "Reverse Bits",
"difficulty": "easy",
"created_at": "2026-04-12 22:50:30",
"topics": [
"bit manipulation",
"divide and conquer"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "reverse-integer",
"title": "Reverse Integer",
"difficulty": "medium",
"created_at": "2026-04-12 22:50:34",
"topics": [
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "reverse-linked-list-ii",
"title": "Reverse Linked List II",
"difficulty": "medium",
"created_at": "2026-04-12 22:50:37",
"topics": [
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "reverse-nodes-in-k-group",
"title": "Reverse Nodes in K-Group",
"difficulty": "hard",
"created_at": "2026-04-12 22:50:41",
"topics": [
"linked list",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "reverse-string",
"title": "Reverse String",
"difficulty": "easy",
"created_at": "2026-04-12 22:50:45",
"topics": [
"two pointers",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "reverse-words-in-a-string-ii",
"title": "Reverse Words in a String II",
"difficulty": "medium",
"created_at": "2026-04-12 22:50:48",
"topics": [
"two pointers",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "robot-room-cleaner",
"title": "Robot Room Cleaner",
"difficulty": "hard",
"created_at": "2026-04-12 22:50:52",
"topics": [
"backtracking",
"interactive"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "roman-to-integer",
"title": "Roman to Integer",
"difficulty": "easy",
"created_at": "2026-04-12 22:50:56",
"topics": [
"math",
"string",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "rotate-array",
"title": "Rotate Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:50:59",
"topics": [
"array",
"math",
"two pointers"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "rotate-list",
"title": "Rotate List",
"difficulty": "medium",
"created_at": "2026-04-12 22:51:03",
"topics": [
"two pointers",
"linked list"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "rotate-matrix",
"title": "Rotate Image",
"difficulty": "medium",
"created_at": "2026-04-12 22:51:06",
"topics": [
"array",
"math",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "rotating-the-box",
"title": "Rotating the Box",
"difficulty": "medium",
"created_at": "2026-04-12 22:51:10",
"topics": [
"array",
"two pointers",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "rotting-fruit",
"title": "Rotting Fruit",
"difficulty": "medium",
"created_at": "2026-04-12 22:51:14",
"topics": [
"array",
"breadth first search",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "russian-doll-envelopes",
"title": "Russian Doll Envelopes",
"difficulty": "hard",
"created_at": "2026-04-12 22:51:17",
"topics": [
"array",
"binary search",
"dynamic programming",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "same-binary-tree",
"title": "Same Binary Tree",
"difficulty": "easy",
"created_at": "2026-04-12 22:51:21",
"topics": [
"breadth first search",
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "score-of-a-string",
"title": "Score of a String",
"difficulty": "easy",
"created_at": "2026-04-12 22:51:24",
"topics": [
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "search-2d-matrix",
"title": "Search a 2D Matrix",
"difficulty": "medium",
"created_at": "2026-04-12 22:51:28",
"topics": [
"array",
"binary search",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "search-for-word",
"title": "Word Search",
"difficulty": "medium",
"created_at": "2026-04-12 22:51:31",
"topics": [
"array",
"string",
"matrix",
"backtracking",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "search-for-word-ii",
"title": "Word Search II",
"difficulty": "hard",
"created_at": "2026-04-12 22:51:35",
"topics": [
"array",
"string",
"matrix",
"backtracking",
"trie"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "search-in-rotated-sorted-array-ii",
"title": "Search in Rotated Sorted Array II",
"difficulty": "medium",
"created_at": "2026-04-12 22:51:38",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "search-insert-position",
"title": "Search Insert Position",
"difficulty": "easy",
"created_at": "2026-04-12 22:51:42",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "sentence-screen-fitting",
"title": "Sentence Screen Fitting",
"difficulty": "medium",
"created_at": "2026-04-12 22:51:46",
"topics": [
"array",
"dynamic programming",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "sentence-similarity",
"title": "Sentence Similarity",
"difficulty": "easy",
"created_at": "2026-04-12 22:51:49",
"topics": [
"array",
"string",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "sentence-similarity-ii",
"title": "Sentence Similarity II",
"difficulty": "medium",
"created_at": "2026-04-12 22:51:53",
"topics": [
"array",
"string",
"breadth first search",
"hash table",
"depth first search",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "sequence-reconstruction",
"title": "Sequence Reconstruction",
"difficulty": "medium",
"created_at": "2026-04-12 22:51:56",
"topics": [
"array",
"graph theory",
"topological sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "serialize-and-deserialize-binary-tree",
"title": "Serialize and Deserialize Binary Tree",
"difficulty": "hard",
"created_at": "2026-04-12 22:52:00",
"topics": [
"string",
"breadth first search",
"tree",
"binary tree",
"depth first search",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "serialize-and-deserialize-n-ary-tree",
"title": "Serialize and Deserialize N-ary Tree",
"difficulty": "hard",
"created_at": "2026-04-12 22:52:03",
"topics": [
"string",
"breadth first search",
"tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "set-zeroes-in-matrix",
"title": "Set Matrix Zeroes",
"difficulty": "medium",
"created_at": "2026-04-12 22:52:07",
"topics": [
"array",
"matrix",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "shortest-bridge",
"title": "Shortest Bridge",
"difficulty": "medium",
"created_at": "2026-04-12 22:52:10",
"topics": [
"array",
"breadth first search",
"matrix",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "shortest-distance-from-all-buildings",
"title": "Shortest Distance from All Buildings",
"difficulty": "hard",
"created_at": "2026-04-12 22:52:14",
"topics": [
"array",
"breadth first search",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "shortest-path-in-binary-matrix",
"title": "Shortest Path in Binary Matrix",
"difficulty": "medium",
"created_at": "2026-04-12 22:52:17",
"topics": [
"array",
"breadth first search",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "shortest-way-to-form-string",
"title": "Shortest Way to Form String",
"difficulty": "medium",
"created_at": "2026-04-12 22:52:21",
"topics": [
"binary search",
"two pointers",
"string",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "shortest-word-distance",
"title": "Shortest Word Distance",
"difficulty": "easy",
"created_at": "2026-04-12 22:52:25",
"topics": [
"array",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "shortest-word-distance-ii",
"title": "Shortest Word Distance II",
"difficulty": "medium",
"created_at": "2026-04-12 22:52:28",
"topics": [
"array",
"two pointers",
"string",
"hash table",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "simplify-path",
"title": "Simplify Path",
"difficulty": "medium",
"created_at": "2026-04-12 22:52:32",
"topics": [
"stack",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "single-element-in-a-sorted-array",
"title": "Single Element in a Sorted Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:52:36",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "single-number",
"title": "Single Number",
"difficulty": "easy",
"created_at": "2026-04-12 22:52:39",
"topics": [
"array",
"bit manipulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "single-number-iii",
"title": "Single Number III",
"difficulty": "medium",
"created_at": "2026-04-12 22:52:43",
"topics": [
"array",
"bit manipulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "single-row-keyboard",
"title": "Single-Row Keyboard",
"difficulty": "easy",
"created_at": "2026-04-12 22:52:47",
"topics": [
"string",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "single-threaded-cpu",
"title": "Single Threaded CPU",
"difficulty": "medium",
"created_at": "2026-04-12 22:52:50",
"topics": [
"array",
"sorting",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "sliding-window-maximum",
"title": "Sliding Window Maximum",
"difficulty": "hard",
"created_at": "2026-04-12 22:52:54",
"topics": [
"array",
"sliding window",
"queue",
"monotonic queue",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "sort-an-array",
"title": "Sort an Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:52:57",
"topics": [
"array",
"sorting",
"divide and conquer",
"counting sort",
"bucket sort",
"merge sort",
"heap priority queue",
"radix sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "sort-array-by-increasing-frequency",
"title": "Sort Array by Increasing Frequency",
"difficulty": "easy",
"created_at": "2026-04-12 22:53:01",
"topics": [
"array",
"sorting",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "sort-array-by-parity",
"title": "Sort Array by Parity",
"difficulty": "easy",
"created_at": "2026-04-12 22:53:05",
"topics": [
"array",
"two pointers",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "sort-colors",
"title": "Sort Colors",
"difficulty": "medium",
"created_at": "2026-04-12 22:53:08",
"topics": [
"array",
"two pointers",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "sort-transformed-array",
"title": "Sort Transformed Array",
"difficulty": "medium",
"created_at": "2026-04-12 22:53:12",
"topics": [
"array",
"math",
"two pointers",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "sparse-matrix-multiplication",
"title": "Sparse Matrix Multiplication",
"difficulty": "medium",
"created_at": "2026-04-12 22:53:15",
"topics": [
"array",
"matrix",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "special-array-i",
"title": "Special Array I",
"difficulty": "easy",
"created_at": "2026-04-12 22:53:19",
"topics": [
"array"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "spiral-matrix",
"title": "Spiral Matrix",
"difficulty": "medium",
"created_at": "2026-04-12 22:53:23",
"topics": [
"array",
"simulation",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "spiral-matrix-ii",
"title": "Spiral Matrix II",
"difficulty": "medium",
"created_at": "2026-04-12 22:53:26",
"topics": [
"array",
"simulation",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "split-array-largest-sum",
"title": "Split Array Largest Sum",
"difficulty": "hard",
"created_at": "2026-04-12 22:53:30",
"topics": [
"array",
"binary search",
"dynamic programming",
"greedy",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "split-array-with-same-average",
"title": "Split Array With Same Average",
"difficulty": "hard",
"created_at": "2026-04-12 22:53:33",
"topics": [
"array",
"math",
"dynamic programming",
"bit manipulation",
"bitmask dp"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "split-concatenated-strings",
"title": "Split Concatenated Strings",
"difficulty": "medium",
"created_at": "2026-04-12 22:53:37",
"topics": [
"array",
"string",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "sqrtx",
"title": "Sqrt(x)",
"difficulty": "easy",
"created_at": "2026-04-12 22:53:40",
"topics": [
"binary search",
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "squares-of-a-sorted-array",
"title": "Squares of a Sorted Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:53:45",
"topics": [
"array",
"two pointers",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "stone-game",
"title": "Stone Game",
"difficulty": "medium",
"created_at": "2026-04-12 22:53:48",
"topics": [
"array",
"math",
"dynamic programming",
"game theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "stone-game-ii",
"title": "Stone Game II",
"difficulty": "medium",
"created_at": "2026-04-12 22:53:52",
"topics": [
"array",
"math",
"dynamic programming",
"prefix sum",
"game theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "stone-game-iii",
"title": "Stone Game III",
"difficulty": "hard",
"created_at": "2026-04-12 22:53:55",
"topics": [
"array",
"math",
"dynamic programming",
"game theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "string-compression",
"title": "String Compression",
"difficulty": "medium",
"created_at": "2026-04-12 22:53:59",
"topics": [
"two pointers",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "string-encode-and-decode",
"title": "Encode and Decode Strings",
"difficulty": "medium",
"created_at": "2026-04-12 22:54:02",
"topics": [
"array",
"string",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "string-matching-in-an-array",
"title": "String Matching in an Array",
"difficulty": "easy",
"created_at": "2026-04-12 22:54:06",
"topics": [
"array",
"string",
"string matching"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "strobogrammatic-number",
"title": "Strobogrammatic Number",
"difficulty": "easy",
"created_at": "2026-04-12 22:54:10",
"topics": [
"two pointers",
"string",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "strobogrammatic-number-ii",
"title": "Strobogrammatic Number II",
"difficulty": "medium",
"created_at": "2026-04-12 22:54:14",
"topics": [
"array",
"string",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "subarray-product-less-than-k",
"title": "Subarray Product Less Than K",
"difficulty": "medium",
"created_at": "2026-04-12 22:54:18",
"topics": [
"array",
"binary search",
"sliding window",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "subarray-sum-equals-k",
"title": "Subarray Sum Equals K",
"difficulty": "medium",
"created_at": "2026-04-12 22:54:21",
"topics": [
"array",
"hash table",
"prefix sum"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "subarrays-with-k-different-integers",
"title": "Subarrays with K Different Integers",
"difficulty": "hard",
"created_at": "2026-04-12 22:54:25",
"topics": [
"array",
"sliding window",
"hash table",
"counting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "subsets",
"title": "Subsets",
"difficulty": "medium",
"created_at": "2026-04-12 22:54:28",
"topics": [
"array",
"bit manipulation",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "subsets-ii",
"title": "Subsets II",
"difficulty": "medium",
"created_at": "2026-04-12 22:54:32",
"topics": [
"array",
"bit manipulation",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "subtree-of-a-binary-tree",
"title": "Subtree of Another Tree",
"difficulty": "easy",
"created_at": "2026-04-12 22:54:36",
"topics": [
"hash function",
"tree",
"binary tree",
"depth first search",
"string matching"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "sum-of-all-subset-xor-totals",
"title": "Sum of All Subsets XOR Total",
"difficulty": "easy",
"created_at": "2026-04-12 22:54:39",
"topics": [
"array",
"math",
"bit manipulation",
"enumeration",
"backtracking",
"combinatorics"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "sum-of-two-integers",
"title": "Sum of Two Integers",
"difficulty": "medium",
"created_at": "2026-04-12 22:54:43",
"topics": [
"math",
"bit manipulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "sum-root-to-leaf-numbers",
"title": "Sum Root to Leaf Numbers",
"difficulty": "medium",
"created_at": "2026-04-12 22:54:46",
"topics": [
"tree",
"binary tree",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "surrounded-regions",
"title": "Surrounded Regions",
"difficulty": "medium",
"created_at": "2026-04-12 22:54:50",
"topics": [
"array",
"breadth first search",
"matrix",
"depth first search",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "swim-in-rising-water",
"title": "Swim in Rising Water",
"difficulty": "hard",
"created_at": "2026-04-12 22:54:53",
"topics": [
"array",
"binary search",
"breadth first search",
"matrix",
"depth first search",
"union find",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "synonymous-sentences",
"title": "Synonymous Sentences",
"difficulty": "medium",
"created_at": "2026-04-12 22:54:57",
"topics": [
"array",
"string",
"sorting",
"hash table",
"backtracking",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "take-gifts-from-the-richest-pile",
"title": "Take Gifts From the Richest Pile",
"difficulty": "easy",
"created_at": "2026-04-12 22:55:01",
"topics": [
"array",
"simulation",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "target-sum",
"title": "Target Sum",
"difficulty": "medium",
"created_at": "2026-04-12 22:55:04",
"topics": [
"array",
"dynamic programming",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "task-scheduling",
"title": "Task Scheduler",
"difficulty": "medium",
"created_at": "2026-04-12 22:55:08",
"topics": [
"array",
"greedy",
"sorting",
"hash table",
"counting",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "ternary-expression-parser",
"title": "Ternary Expression Parser",
"difficulty": "medium",
"created_at": "2026-04-12 22:55:11",
"topics": [
"stack",
"string",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "text-justification",
"title": "Text Justification",
"difficulty": "hard",
"created_at": "2026-04-12 22:55:15",
"topics": [
"array",
"string",
"simulation"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "the-earliest-moment-when-everyone-become-friends",
"title": "The Earliest Moment When Everyone Become Friends",
"difficulty": "medium",
"created_at": "2026-04-12 22:55:19",
"topics": [
"array",
"sorting",
"union find"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "the-maze",
"title": "The Maze",
"difficulty": "medium",
"created_at": "2026-04-12 22:55:23",
"topics": [
"array",
"breadth first search",
"matrix",
"depth first search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "the-maze-ii",
"title": "The Maze II",
"difficulty": "medium",
"created_at": "2026-04-12 22:55:26",
"topics": [
"array",
"breadth first search",
"matrix",
"depth first search",
"graph theory",
"shortest path",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "the-maze-iii",
"title": "The Maze III",
"difficulty": "hard",
"created_at": "2026-04-12 22:55:30",
"topics": [
"array",
"string",
"breadth first search",
"matrix",
"depth first search",
"graph theory",
"shortest path",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "three-integer-sum",
"title": "3Sum",
"difficulty": "medium",
"created_at": "2026-04-12 22:55:33",
"topics": [
"array",
"two pointers",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "time-based-key-value-store",
"title": "Time Based Key-Value Store",
"difficulty": "medium",
"created_at": "2026-04-12 22:55:37",
"topics": [
"binary search",
"string",
"hash table",
"design"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "time-taken-to-cross-the-door",
"title": "Time Taken to Cross the Door",
"difficulty": "hard",
"created_at": "2026-04-12 22:55:40",
"topics": [
"array",
"simulation",
"queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "top-k-elements-in-list",
"title": "Top K Frequent Elements",
"difficulty": "medium",
"created_at": "2026-04-12 22:55:44",
"topics": [
"array",
"sorting",
"hash table",
"counting",
"divide and conquer",
"quickselect",
"bucket sort",
"heap priority queue"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "transpose-matrix",
"title": "Transpose Matrix",
"difficulty": "easy",
"created_at": "2026-04-12 22:55:47",
"topics": [
"array",
"simulation",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "trapping-rain-water",
"title": "Trapping Rain Water",
"difficulty": "hard",
"created_at": "2026-04-12 22:55:51",
"topics": [
"array",
"stack",
"monotonic stack",
"dynamic programming",
"two pointers"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "tree-diameter",
"title": "Tree Diameter",
"difficulty": "medium",
"created_at": "2026-04-12 22:55:54",
"topics": [
"breadth first search",
"tree",
"depth first search",
"graph theory",
"topological sort"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "triangle",
"title": "Triangle",
"difficulty": "medium",
"created_at": "2026-04-12 22:55:58",
"topics": [
"array",
"dynamic programming"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "two-city-scheduling",
"title": "Two City Scheduling",
"difficulty": "medium",
"created_at": "2026-04-12 22:56:02",
"topics": [
"array",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "two-integer-sum",
"title": "Two Sum",
"difficulty": "easy",
"created_at": "2026-04-12 22:56:05",
"topics": [
"array",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "two-integer-sum-ii",
"title": "Two Integer Sum II",
"difficulty": "medium",
"created_at": "2026-04-12 22:56:09",
"topics": [
"array",
"binary search",
"two pointers"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "two-sum-bsts",
"title": "Two Sum BSTs",
"difficulty": "medium",
"created_at": "2026-04-12 22:56:12",
"topics": [
"binary search",
"stack",
"two pointers",
"tree",
"binary tree",
"depth first search",
"binary search tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "ugly-number",
"title": "Ugly Number",
"difficulty": "easy",
"created_at": "2026-04-12 22:56:16",
"topics": [
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "unique-email-addresses",
"title": "Unique Email Addresses",
"difficulty": "easy",
"created_at": "2026-04-12 22:56:20",
"topics": [
"array",
"string",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "unique-paths-ii",
"title": "Unique Paths II",
"difficulty": "medium",
"created_at": "2026-04-12 22:56:24",
"topics": [
"array",
"dynamic programming",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "valid-binary-search-tree",
"title": "Valid Binary Search Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:56:27",
"topics": [
"tree",
"binary tree",
"depth first search",
"binary search tree"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "valid-palindrome-ii",
"title": "Valid Palindrome II",
"difficulty": "easy",
"created_at": "2026-04-12 22:56:31",
"topics": [
"two pointers",
"string",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "valid-palindrome-iii",
"title": "Valid Palindrome III",
"difficulty": "hard",
"created_at": "2026-04-12 22:56:35",
"topics": [
"dynamic programming",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "valid-parenthesis-string",
"title": "Valid Parenthesis String",
"difficulty": "medium",
"created_at": "2026-04-12 22:56:39",
"topics": [
"stack",
"dynamic programming",
"string",
"greedy"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "valid-perfect-square",
"title": "Valid Perfect Square",
"difficulty": "easy",
"created_at": "2026-04-12 22:56:42",
"topics": [
"binary search",
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "valid-sudoku",
"title": "Valid Sudoku",
"difficulty": "medium",
"created_at": "2026-04-12 22:56:46",
"topics": [
"array",
"matrix",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "valid-tree",
"title": "Graph Valid Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:56:49",
"topics": [
"breadth first search",
"depth first search",
"union find",
"graph"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "valid-word-abbreviation",
"title": "Valid Word Abbreviation",
"difficulty": "easy",
"created_at": "2026-04-12 22:56:53",
"topics": [
"two pointers",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "valid-word-square",
"title": "Valid Word Square",
"difficulty": "easy",
"created_at": "2026-04-12 22:56:57",
"topics": [
"array",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "validate-parentheses",
"title": "Valid Parentheses",
"difficulty": "easy",
"created_at": "2026-04-12 22:57:00",
"topics": [
"stack",
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "verify-preorder-sequence-in-binary-search-tree",
"title": "Verify Preorder Sequence in Binary Search Tree",
"difficulty": "medium",
"created_at": "2026-04-12 22:57:04",
"topics": [
"array",
"stack",
"monotonic stack",
"tree",
"binary tree",
"binary search tree",
"recursion"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "verifying-an-alien-dictionary",
"title": "Verifying An Alien Dictionary",
"difficulty": "easy",
"created_at": "2026-04-12 22:57:08",
"topics": [
"array",
"string",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "web-crawler",
"title": "Web Crawler",
"difficulty": "medium",
"created_at": "2026-04-12 22:57:11",
"topics": [
"string",
"breadth first search",
"depth first search",
"interactive"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "wiggle-sort",
"title": "Wiggle Sort",
"difficulty": "medium",
"created_at": "2026-04-12 22:57:15",
"topics": [
"array",
"greedy",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "word-break",
"title": "Word Break",
"difficulty": "medium",
"created_at": "2026-04-12 22:57:19",
"topics": [
"array",
"dynamic programming",
"string",
"hash table",
"trie",
"memoization"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "word-break-ii",
"title": "Word Break II",
"difficulty": "hard",
"created_at": "2026-04-12 22:57:23",
"topics": [
"array",
"dynamic programming",
"string",
"hash table",
"backtracking",
"trie",
"memoization"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "word-ladder",
"title": "Word Ladder",
"difficulty": "hard",
"created_at": "2026-04-12 22:57:26",
"topics": [
"string",
"breadth first search",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "word-pattern",
"title": "Word Pattern",
"difficulty": "easy",
"created_at": "2026-04-12 22:57:30",
"topics": [
"string",
"hash table"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "word-pattern-ii",
"title": "Word Pattern II",
"difficulty": "medium",
"created_at": "2026-04-12 22:57:33",
"topics": [
"string",
"hash table",
"backtracking"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "zigzag-conversion",
"title": "Zigzag Conversion",
"difficulty": "medium",
"created_at": "2026-04-12 22:57:36",
"topics": [
"string"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "zigzag-iterator",
"title": "Zigzag Iterator",
"difficulty": "medium",
"created_at": "2026-04-12 22:57:40",
"topics": [
"array",
"queue",
"design",
"iterator"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "all-possible-full-binary-trees",
"title": "All Possible Full Binary Trees",
"difficulty": "medium",
"created_at": "2026-04-12 23:08:20",
"topics": [
"dynamic programming",
"tree",
"binary tree",
"recursion",
"memoization"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-12",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "find-the-smallest-divisor-given-a-threshold",
"title": "Find the Smallest Divisor Given a Threshold",
"difficulty": "medium",
"created_at": "2026-04-13 00:09:00",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-13",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-speed-to-arrive-on-time",
"title": "Minimum Speed to Arrive on Time",
"difficulty": "medium",
"created_at": "2026-04-13 00:09:01",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-13",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-number-of-days-to-make-m-bouquets",
"title": "Minimum Number of Days to Make m Bouquets",
"difficulty": "medium",
"created_at": "2026-04-13 00:09:03",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-13",
"mastered_before": false
},
{
"platform": "geeksforgeeks",
"slug": "allocate-minimum-number-of-pages",
"title": "Allocate Minimum Pages",
"difficulty": "medium",
"created_at": "2026-04-13 00:09:07",
"topics": [
"divide and conquer",
"searching",
"algorithms"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-13",
"mastered_before": false
},
{
"platform": "geeksforgeeks",
"slug": "aggressive-cows",
"title": "Aggressive Cows",
"difficulty": "medium",
"created_at": "2026-04-13 00:09:09",
"topics": [
"binary search",
"algorithms"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-13",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "magnetic-force-between-two-balls",
"title": "Magnetic Force Between Two Balls",
"difficulty": "medium",
"created_at": "2026-04-13 00:09:11",
"topics": [
"array",
"binary search",
"sorting"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-13",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "cutting-ribbons",
"title": "Cutting Ribbons",
"difficulty": "medium",
"created_at": "2026-04-13 00:09:14",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-13",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "minimize-max-distance-to-gas-station",
"title": "Minimize Max Distance to Gas Station",
"difficulty": "hard",
"created_at": "2026-04-13 00:09:18",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-13",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimum-time-to-complete-trips",
"title": "Minimum Time to Complete Trips",
"difficulty": "medium",
"created_at": "2026-04-13 00:09:20",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-13",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "kth-missing-positive-number",
"title": "Kth Missing Positive Number",
"difficulty": "easy",
"created_at": "2026-04-13 00:09:21",
"topics": [
"array",
"binary search"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-13",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "minimize-the-difference-between-target-and-chosen-elements",
"title": "Minimize the Difference Between Target and Chosen Elements",
"difficulty": "medium",
"created_at": "2026-04-13 00:09:23",
"topics": [
"array",
"dynamic programming",
"matrix"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-13",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "maximal-network-rank",
"title": "Maximal Network Rank",
"difficulty": "medium",
"created_at": "2026-04-13 00:09:24",
"topics": [
"graph theory"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-13",
"mastered_before": false
},
{
"platform": "leetcode",
"slug": "kth-smallest-number-in-multiplication-table",
"title": "Kth Smallest Number in Multiplication Table",
"difficulty": "hard",
"created_at": "2026-04-13 00:09:26",
"topics": [
"binary search",
"math"
],
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-13",
"mastered_before": false
},
{
"platform": "neetcode",
"slug": "binarySearchTree",
"title": "Design Binary Search Tree",
"difficulty": "medium",
"created_at": "2026-04-13 00:09:29",
"topics": null,
"easiness_factor": 2.5,
"interval_days": 1,
"repetition_count": 0,
"next_review_date": "2026-04-13",
"mastered_before": false
}
],
"playlists": [
{
"name": "Full Neetcode",
"created_at": "2026-04-12 22:13:09",
"problems": [
"leetcode/132-pattern",
"leetcode/2-keys-keyboard",
"leetcode/add-to-array-form-of-integer",
"leetcode/adding-spaces-to-a-string",
"leetcode/allow-one-function-call",
"leetcode/alternating-groups-ii",
"leetcode/apply-operations-to-an-array",
"leetcode/apply-operations-to-maximize-score",
"leetcode/apply-transform-over-each-element-in-array",
"leetcode/arithmetic-slices-ii-subsequence",
"leetcode/array-of-objects-to-matrix",
"leetcode/array-prototype-last",
"leetcode/array-reduce-transformation",
"leetcode/array-with-elements-not-equal-to-average-of-neighbors",
"leetcode/array-wrapper",
"leetcode/as-far-from-land-as-possible",
"leetcode/average-waiting-time",
"leetcode/backspace-string-compare",
"leetcode/bag-of-tokens",
"leetcode/best-sightseeing-pair",
"leetcode/best-team-with-no-conflicts",
"leetcode/bitwise-xor-of-all-pairings",
"leetcode/brick-wall",
"leetcode/cache-with-time-limit",
"leetcode/calculate-money-in-leetcode-bank",
"leetcode/call-function-with-custom-context",
"leetcode/champagne-tower",
"leetcode/check-if-a-parentheses-string-can-be-valid",
"leetcode/check-if-a-string-contains-all-binary-codes-of-size-k",
"leetcode/check-if-grid-can-be-cut-into-sections",
"leetcode/check-if-move-is-legal",
"leetcode/check-if-number-is-a-sum-of-powers-of-three",
"leetcode/check-if-object-instance-of-class",
"leetcode/check-if-one-string-swap-can-make-strings-equal",
"leetcode/check-if-there-is-a-valid-partition-for-the-array",
"leetcode/check-if-two-string-arrays-are-equivalent",
"leetcode/cherry-pickup-ii",
"leetcode/chunk-array",
"leetcode/circular-sentence",
"leetcode/clear-digits",
"leetcode/closest-prime-numbers-in-range",
"leetcode/constrained-subsequence-sum",
"leetcode/construct-binary-tree-from-preorder-and-postorder-traversal",
"leetcode/construct-k-palindrome-strings",
"leetcode/construct-smallest-number-from-di-string",
"leetcode/construct-string-from-binary-tree",
"leetcode/construct-string-with-repeat-limit",
"leetcode/construct-the-lexicographically-largest-valid-sequence",
"leetcode/contiguous-array",
"leetcode/convert-1d-array-into-2d-array",
"leetcode/convert-an-array-into-a-2d-array-with-conditions",
"leetcode/convert-object-to-json-string",
"leetcode/convert-sorted-array-to-binary-search-tree",
"leetcode/count-all-valid-pickup-and-delivery-options",
"leetcode/count-days-without-meetings",
"leetcode/count-number-of-bad-pairs",
"leetcode/count-number-of-maximum-bitwise-or-subsets",
"leetcode/count-number-of-nice-subarrays",
"leetcode/count-number-of-teams",
"leetcode/count-of-matches-in-tournament",
"leetcode/count-of-substrings-containing-every-vowel-and-k-consonants-ii",
"leetcode/count-prefix-and-suffix-pairs-ii",
"leetcode/count-square-submatrices-with-all-ones",
"leetcode/count-sub-islands",
"leetcode/count-subarrays-where-max-element-appears-at-least-k-times",
"leetcode/count-the-number-of-complete-components",
"leetcode/count-the-number-of-fair-pairs",
"leetcode/count-total-number-of-colored-cells",
"leetcode/count-triplets-that-can-form-two-arrays-of-equal-xor",
"leetcode/count-unguarded-cells-in-the-grid",
"leetcode/count-vowel-strings-in-ranges",
"leetcode/count-vowels-permutation",
"leetcode/count-ways-to-build-good-strings",
"leetcode/counter",
"leetcode/counter-ii",
"leetcode/cousins-in-binary-tree-ii",
"leetcode/create-binary-tree-from-descriptions",
"leetcode/create-hello-world-function",
"leetcode/curry",
"leetcode/data-stream-as-disjoint-intervals",
"leetcode/debounce",
"leetcode/defuse-the-bomb",
"leetcode/delete-and-earn",
"leetcode/delete-nodes-and-return-forest",
"leetcode/delete-nodes-from-linked-list-present-in-array",
"leetcode/design-a-food-rating-system",
"leetcode/design-browser-history",
"leetcode/design-linked-list",
"leetcode/design-parking-system",
"leetcode/design-underground-system",
"leetcode/destination-city",
"leetcode/detonate-the-maximum-bombs",
"leetcode/differences-between-two-objects",
"leetcode/different-ways-to-add-parentheses",
"leetcode/distribute-coins-in-binary-tree",
"leetcode/divide-array-into-arrays-with-max-difference",
"leetcode/divide-intervals-into-minimum-number-of-groups",
"leetcode/divide-nodes-into-the-maximum-number-of-groups",
"leetcode/divide-players-into-teams-of-equal-skill",
"leetcode/eliminate-maximum-number-of-monsters",
"leetcode/encode-and-decode-tinyurl",
"leetcode/evaluate-boolean-binary-tree",
"leetcode/even-odd-tree",
"leetcode/event-emitter",
"leetcode/filling-bookcase-shelves",
"leetcode/filter-elements-from-array",
"leetcode/final-prices-with-a-special-discount-in-a-shop",
"leetcode/find-all-anagrams-in-a-string",
"leetcode/find-all-duplicates-in-an-array",
"leetcode/find-all-people-with-secret",
"leetcode/find-all-possible-recipes-from-given-supplies",
"leetcode/find-bottom-left-tree-value",
"leetcode/find-building-where-alice-and-bob-can-meet",
"leetcode/find-champion-ii",
"leetcode/find-closest-node-to-given-two-nodes",
"leetcode/find-common-characters",
"leetcode/find-duplicate-subtrees",
"leetcode/find-eventual-safe-states",
"leetcode/find-first-palindromic-string-in-the-array",
"leetcode/find-if-array-can-be-sorted",
"leetcode/find-k-th-smallest-pair-distance",
"leetcode/find-kth-bit-in-nth-binary-string",
"leetcode/find-largest-value-in-each-tree-row",
"leetcode/find-minimum-diameter-after-merging-two-trees",
"leetcode/find-missing-observations",
"leetcode/find-polygon-with-the-largest-perimeter",
"leetcode/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance",
"leetcode/find-the-kth-largest-integer-in-the-array",
"leetcode/find-the-length-of-the-longest-common-prefix",
"leetcode/find-the-longest-substring-containing-vowels-in-even-counts",
"leetcode/find-the-longest-valid-obstacle-course-at-each-position",
"leetcode/find-the-maximum-sum-of-node-values",
"leetcode/find-the-minimum-and-maximum-number-of-nodes-between-critical-points",
"leetcode/find-the-power-of-k-size-subarrays-i",
"leetcode/find-the-punishment-number-of-an-integer",
"leetcode/find-the-safest-path-in-a-grid",
"leetcode/find-the-winner-of-the-circular-game",
"leetcode/find-unique-binary-string",
"leetcode/find-valid-matrix-given-row-and-column-sums",
"leetcode/flatten-deeply-nested-array",
"leetcode/flatten-nested-list-iterator",
"leetcode/flip-columns-for-maximum-number-of-equal-rows",
"leetcode/flip-equivalent-binary-trees",
"leetcode/flip-string-to-monotone-increasing",
"leetcode/freedom-trail",
"leetcode/function-composition",
"leetcode/furthest-building-you-can-reach",
"leetcode/generate-fibonacci-sequence",
"leetcode/get-equal-substrings-within-budget",
"leetcode/grid-game",
"leetcode/group-by",
"leetcode/house-robber-iv",
"leetcode/image-smoother",
"leetcode/integer-to-english-words",
"leetcode/is-graph-bipartite",
"leetcode/json-deep-equal",
"leetcode/k-inverse-pairs-array",
"leetcode/k-th-symbol-in-grammar",
"leetcode/knight-dialer",
"leetcode/kth-largest-sum-in-a-binary-tree",
"leetcode/largest-color-value-in-a-directed-graph",
"leetcode/largest-combination-with-bitwise-and-greater-than-zero",
"leetcode/largest-local-values-in-a-matrix",
"leetcode/largest-odd-number-in-string",
"leetcode/largest-substring-between-two-equal-characters",
"leetcode/leaf-similar-trees",
"leetcode/least-number-of-unique-integers-after-k-removals",
"leetcode/length-of-longest-fibonacci-subsequence",
"leetcode/length-of-longest-subarray-with-at-most-k-frequency",
"leetcode/letter-tile-possibilities",
"leetcode/lexicographical-numbers",
"leetcode/linked-list-in-binary-tree",
"leetcode/longest-ideal-subsequence",
"leetcode/longest-nice-subarray",
"leetcode/longest-palindrome",
"leetcode/longest-palindromic-subsequence",
"leetcode/longest-string-chain",
"leetcode/longest-subarray-with-maximum-bitwise-and",
"leetcode/lucky-numbers-in-a-matrix",
"leetcode/magic-squares-in-grid",
"leetcode/make-lexicographically-smallest-array-by-swapping-elements",
"leetcode/make-sum-divisible-by-p",
"leetcode/make-the-string-great",
"leetcode/make-two-arrays-equal-by-reversing-subarrays",
"leetcode/making-a-large-island",
"leetcode/max-chunks-to-make-sorted",
"leetcode/max-points-on-a-line",
"leetcode/maximal-score-after-applying-k-operations",
"leetcode/maximize-score-after-n-operations",
"leetcode/maximum-absolute-sum-of-any-subarray",
"leetcode/maximum-alternating-subsequence-sum",
"leetcode/maximum-beauty-of-an-array-after-applying-operation",
"leetcode/maximum-candies-allocated-to-k-children",
"leetcode/maximum-element-after-decreasing-and-rearranging",
"leetcode/maximum-employees-to-be-invited-to-a-meeting",
"leetcode/maximum-length-of-a-concatenated-string-with-unique-characters",
"leetcode/maximum-length-of-pair-chain",
"leetcode/maximum-matrix-sum",
"leetcode/maximum-number-of-fish-in-a-grid",
"leetcode/maximum-number-of-k-divisible-components",
"leetcode/maximum-number-of-points-from-grid-queries",
"leetcode/maximum-number-of-removable-characters",
"leetcode/maximum-number-of-vowels-in-a-substring-of-given-length",
"leetcode/maximum-performance-of-a-team",
"leetcode/maximum-product-of-the-length-of-two-palindromic-subsequences",
"leetcode/maximum-score-from-removing-substrings",
"leetcode/maximum-score-of-a-good-subarray",
"leetcode/maximum-score-words-formed-by-letters",
"leetcode/maximum-subarray-min-product",
"leetcode/maximum-subsequence-score",
"leetcode/maximum-sum-of-3-non-overlapping-subarrays",
"leetcode/maximum-sum-of-distinct-subarrays-with-length-k",
"leetcode/maximum-swap",
"leetcode/maximum-total-importance-of-roads",
"leetcode/maximum-value-of-k-coins-from-piles",
"leetcode/maximum-width-of-binary-tree",
"leetcode/maximum-width-ramp",
"leetcode/maximum-xor-for-each-query",
"leetcode/memoize",
"leetcode/merge-in-between-linked-lists",
"leetcode/merge-nodes-in-between-zeros",
"leetcode/merge-two-2d-arrays-by-summing-values",
"leetcode/minimize-deviation-in-array",
"leetcode/minimize-maximum-of-array",
"leetcode/minimize-xor",
"leetcode/minimized-maximum-of-products-distributed-to-any-store",
"leetcode/minimum-add-to-make-parentheses-valid",
"leetcode/minimum-bit-flips-to-convert-number",
"leetcode/minimum-cost-to-convert-string-i",
"leetcode/minimum-cost-to-cut-a-stick",
"leetcode/minimum-cost-to-hire-k-workers",
"leetcode/minimum-cost-to-make-at-least-one-valid-path-in-a-grid",
"leetcode/minimum-cost-walk-in-weighted-graph",
"leetcode/minimum-deletions-to-make-character-frequencies-unique",
"leetcode/minimum-deletions-to-make-string-balanced",
"leetcode/minimum-difference-between-largest-and-smallest-value-in-three-moves",
"leetcode/minimum-difficulty-of-a-job-schedule",
"leetcode/minimum-distance-between-bst-nodes",
"leetcode/minimum-falling-path-sum",
"leetcode/minimum-falling-path-sum-ii",
"leetcode/minimum-fuel-cost-to-report-to-the-capital",
"leetcode/minimum-increment-to-make-array-unique",
"leetcode/minimum-index-of-a-valid-split",
"leetcode/minimum-length-of-string-after-deleting-similar-ends",
"leetcode/minimum-length-of-string-after-operations",
"leetcode/minimum-limit-of-balls-in-a-bag",
"leetcode/minimum-number-of-arrows-to-burst-balloons",
"leetcode/minimum-number-of-changes-to-make-binary-string-beautiful",
"leetcode/minimum-number-of-days-to-disconnect-island",
"leetcode/minimum-number-of-days-to-eat-n-oranges",
"leetcode/minimum-number-of-flips-to-make-the-binary-string-alternating",
"leetcode/minimum-number-of-k-consecutive-bit-flips",
"leetcode/minimum-number-of-operations-to-make-array-continuous",
"leetcode/minimum-number-of-operations-to-move-all-balls-to-each-box",
"leetcode/minimum-number-of-operations-to-sort-a-binary-tree-by-level",
"leetcode/minimum-number-of-pushes-to-type-word-ii",
"leetcode/minimum-number-of-removals-to-make-mountain-array",
"leetcode/minimum-number-of-swaps-to-make-the-string-balanced",
"leetcode/minimum-number-of-vertices-to-reach-all-nodes",
"leetcode/minimum-obstacle-removal-to-reach-corner",
"leetcode/minimum-one-bit-operations-to-make-integers-zero",
"leetcode/minimum-operations-to-make-a-uni-value-grid",
"leetcode/minimum-operations-to-make-binary-array-elements-equal-to-one-i",
"leetcode/minimum-operations-to-reduce-x-to-zero",
"leetcode/minimum-penalty-for-a-shop",
"leetcode/minimum-score-of-a-path-between-two-cities",
"leetcode/minimum-string-length-after-removing-substrings",
"leetcode/minimum-swaps-to-group-all-1s-together-ii",
"leetcode/minimum-time-difference",
"leetcode/minimum-time-to-make-rope-colorful",
"leetcode/minimum-time-to-repair-cars",
"leetcode/minimum-time-to-visit-a-cell-in-a-grid",
"leetcode/most-beautiful-item-for-each-query",
"leetcode/most-profitable-path-in-a-tree",
"leetcode/my-calendar-i",
"leetcode/my-calendar-ii",
"leetcode/naming-a-company",
"leetcode/neighboring-bitwise-xor",
"leetcode/nested-array-generator",
"leetcode/non-decreasing-array",
"leetcode/number-of-atoms",
"leetcode/number-of-closed-islands",
"leetcode/number-of-dice-rolls-with-target-sum",
"leetcode/number-of-flowers-in-full-bloom",
"leetcode/number-of-good-leaf-nodes-pairs",
"leetcode/number-of-good-paths",
"leetcode/number-of-laser-beams-in-a-bank",
"leetcode/number-of-longest-increasing-subsequence",
"leetcode/number-of-music-playlists",
"leetcode/number-of-pairs-of-interchangeable-rectangles",
"leetcode/number-of-sub-arrays-with-odd-sum",
"leetcode/number-of-submatrices-that-sum-to-target",
"leetcode/number-of-substrings-containing-all-three-characters",
"leetcode/number-of-ways-to-arrive-at-destination",
"leetcode/number-of-ways-to-divide-a-long-corridor",
"leetcode/number-of-ways-to-form-a-target-string-given-a-dictionary",
"leetcode/number-of-ways-to-rearrange-sticks-with-k-sticks-visible",
"leetcode/number-of-ways-to-split-array",
"leetcode/number-of-ways-to-stay-in-the-same-place-after-some-steps",
"leetcode/number-of-zero-filled-subarrays",
"leetcode/operations-on-tree",
"leetcode/optimal-partition-of-string",
"leetcode/out-of-boundary-paths",
"leetcode/painting-the-walls",
"leetcode/parallel-courses-iii",
"leetcode/parsing-a-boolean-expression",
"leetcode/partition-array-according-to-given-pivot",
"leetcode/partition-array-for-maximum-sum",
"leetcode/partition-list",
"leetcode/path-with-maximum-gold",
"leetcode/power-of-four",
"leetcode/prime-subtraction-operation",
"leetcode/process-tasks-using-servers",
"leetcode/profitable-schemes",
"leetcode/promise-pool",
"leetcode/promise-time-limit",
"leetcode/pseudo-palindromic-paths-in-a-binary-tree",
"leetcode/push-dominoes",
"leetcode/range-sum-of-sorted-subarray-sums",
"leetcode/recover-a-tree-from-preorder-traversal",
"leetcode/regions-cut-by-slashes",
"leetcode/relative-sort-array",
"leetcode/remove-colored-pieces-if-both-neighbors-are-the-same-color",
"leetcode/remove-covered-intervals",
"leetcode/remove-duplicates-from-sorted-array-ii",
"leetcode/remove-duplicates-from-sorted-list",
"leetcode/remove-k-digits",
"leetcode/remove-max-number-of-edges-to-keep-graph-fully-traversable",
"leetcode/remove-nodes-from-linked-list",
"leetcode/removing-stars-from-a-string",
"leetcode/reorder-routes-to-make-all-paths-lead-to-the-city-zero",
"leetcode/repeated-dna-sequences",
"leetcode/reveal-cards-in-increasing-order",
"leetcode/reverse-odd-levels-of-binary-tree",
"leetcode/reverse-substrings-between-each-pair-of-parentheses",
"leetcode/reverse-words-in-a-string-iii",
"leetcode/robot-bounded-in-circle",
"leetcode/robot-collisions",
"leetcode/score-after-flipping-matrix",
"leetcode/search-suggestions-system",
"leetcode/seat-reservation-manager",
"leetcode/second-minimum-time-to-reach-destination",
"leetcode/sentence-similarity-iii",
"leetcode/separate-black-and-white-balls",
"leetcode/sequential-digits",
"leetcode/set-mismatch",
"leetcode/shift-2d-grid",
"leetcode/shifting-letters-ii",
"leetcode/shortest-common-supersequence",
"leetcode/shortest-distance-after-road-addition-queries-i",
"leetcode/shortest-palindrome",
"leetcode/shortest-path-with-alternating-colors",
"leetcode/shortest-subarray-to-be-removed-to-make-array-sorted",
"leetcode/shortest-subarray-with-or-at-least-k-ii",
"leetcode/shortest-subarray-with-sum-at-least-k",
"leetcode/shuffle-the-array",
"leetcode/sign-of-the-product-of-an-array",
"leetcode/sleep",
"leetcode/sliding-puzzle",
"leetcode/smallest-range-covering-elements-from-k-lists",
"leetcode/smallest-string-starting-from-leaf",
"leetcode/snakes-and-ladders",
"leetcode/solving-questions-with-brainpower",
"leetcode/sort-characters-by-frequency",
"leetcode/sort-list",
"leetcode/sort-the-jumbled-numbers",
"leetcode/sort-the-people",
"leetcode/special-array-with-x-elements-greater-than-or-equal-x",
"leetcode/spiral-matrix-iii",
"leetcode/spiral-matrix-iv",
"leetcode/split-a-string-into-the-max-number-of-unique-substrings",
"leetcode/split-linked-list-in-parts",
"leetcode/splitting-a-string-into-descending-consecutive-values",
"leetcode/step-by-step-directions-from-a-binary-tree-node-to-another",
"leetcode/stickers-to-spell-word",
"leetcode/string-compression-ii",
"leetcode/student-attendance-record-ii",
"leetcode/subarray-sums-divisible-by-k",
"leetcode/successful-pairs-of-spells-and-potions",
"leetcode/sum-of-absolute-differences-in-a-sorted-array",
"leetcode/sum-of-prefix-scores-of-strings",
"leetcode/sum-of-square-numbers",
"leetcode/sum-of-subarray-minimums",
"leetcode/swap-nodes-in-pairs",
"leetcode/swapping-nodes-in-a-linked-list",
"leetcode/symmetric-tree",
"leetcode/take-k-of-each-character-from-left-and-right",
"leetcode/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n",
"leetcode/the-number-of-beautiful-subsets",
"leetcode/the-number-of-the-smallest-unoccupied-chair",
"leetcode/throttle",
"leetcode/time-needed-to-buy-tickets",
"leetcode/time-needed-to-inform-all-employees",
"leetcode/trapping-rain-water-ii",
"leetcode/trim-a-binary-search-tree",
"leetcode/tuple-with-same-product",
"leetcode/ugly-number-ii",
"leetcode/uncommon-words-from-two-sentences",
"leetcode/uncrossed-lines",
"leetcode/unique-binary-search-trees",
"leetcode/unique-binary-search-trees-ii",
"leetcode/unique-length-3-palindromic-subsequences",
"leetcode/validate-binary-tree-nodes",
"leetcode/validate-stack-sequences",
"leetcode/walking-robot-simulation",
"leetcode/water-bottles",
"leetcode/widest-vertical-area-between-two-points-containing-no-points",
"leetcode/word-subsets",
"leetcode/xor-queries-of-a-subarray",
"neetcode/3sum-smaller",
"neetcode/4-keys-keyboard",
"neetcode/4sum",
"neetcode/accounts-merge",
"neetcode/add-binary",
"neetcode/add-bold-tag-in-string",
"neetcode/add-two-numbers",
"neetcode/add-two-numbers-ii",
"neetcode/all-paths-from-source-lead-to-destination",
"neetcode/anagram-groups",
"neetcode/analyze-user-website-visit-pattern",
"neetcode/append-characters-to-string-to-make-subsequence",
"neetcode/apply-substitutions",
"neetcode/armstrong-number",
"neetcode/arranging-coins",
"neetcode/array-transformation",
"neetcode/assign-cookies",
"neetcode/asteroid-collision",
"neetcode/balanced-binary-tree",
"neetcode/baseball-game",
"neetcode/basic-calculator-ii",
"neetcode/basic-calculator-iii",
"neetcode/best-meeting-point",
"neetcode/best-time-to-buy-and-sell-stock-ii",
"neetcode/binary-search",
"neetcode/binary-search-tree-iterator",
"neetcode/binary-searchable-numbers-in-an-unsorted-array",
"neetcode/binary-subarrays-with-sum",
"neetcode/binary-tree-diameter",
"neetcode/binary-tree-from-preorder-and-inorder-traversal",
"neetcode/binary-tree-inorder-traversal",
"neetcode/binary-tree-longest-consecutive-sequence",
"neetcode/binary-tree-longest-consecutive-sequence-ii",
"neetcode/binary-tree-maximum-path-sum",
"neetcode/binary-tree-postorder-traversal",
"neetcode/binary-tree-preorder-traversal",
"neetcode/binary-tree-right-side-view",
"neetcode/binary-tree-vertical-order-traversal",
"neetcode/binary-tree-zigzag-level-order-traversal",
"neetcode/bitwise-and-of-numbers-range",
"neetcode/boats-to-save-people",
"neetcode/boundary-of-binary-tree",
"neetcode/brace-expansion",
"neetcode/brightest-position-on-street",
"neetcode/build-a-matrix-with-conditions",
"neetcode/buildings-with-an-ocean-view",
"neetcode/burst-balloons",
"neetcode/bus-routes",
"neetcode/buy-and-sell-crypto",
"neetcode/buy-and-sell-crypto-with-cooldown",
"neetcode/buy-two-chocolates",
"neetcode/campus-bikes",
"neetcode/can-place-flowers",
"neetcode/candy",
"neetcode/candy-crush",
"neetcode/capacity-to-ship-packages-within-d-days",
"neetcode/car-fleet",
"neetcode/car-pooling",
"neetcode/cheapest-flight-path",
"neetcode/check-completeness-of-a-binary-tree",
"neetcode/check-if-a-number-is-majority-element-in-a-sorted-array",
"neetcode/check-if-array-is-sorted-and-rotated",
"neetcode/cherry-pickup",
"neetcode/climbing-stairs",
"neetcode/clone-graph",
"neetcode/clone-n-ary-tree",
"neetcode/closest-binary-search-tree-value",
"neetcode/closest-binary-search-tree-value-ii",
"neetcode/coin-change",
"neetcode/coin-change-ii",
"neetcode/coin-path",
"neetcode/combination-sum-iv",
"neetcode/combination-target-sum",
"neetcode/combination-target-sum-ii",
"neetcode/combinations",
"neetcode/combinations-of-a-phone-number",
"neetcode/concatenated-words",
"neetcode/concatenation-of-array",
"neetcode/confusing-number",
"neetcode/construct-binary-tree-from-inorder-and-postorder-traversal",
"neetcode/construct-quad-tree",
"neetcode/contains-duplicate-ii",
"neetcode/continuous-subarray-sum",
"neetcode/convert-bst-to-greater-tree",
"neetcode/copy-linked-list-with-random-pointer",
"neetcode/count-connected-components",
"neetcode/count-good-nodes-in-binary-tree",
"neetcode/count-number-of-islands",
"neetcode/count-odd-numbers-in-an-interval-range",
"neetcode/count-paths",
"neetcode/count-prefix-and-suffix-pairs-i",
"neetcode/count-primes",
"neetcode/count-servers-that-communicate",
"neetcode/count-squares",
"neetcode/count-strictly-increasing-subarrays",
"neetcode/count-subsequences",
"neetcode/count-substrings-with-only-one-distinct-letter",
"neetcode/count-the-number-of-consistent-strings",
"neetcode/count-univalue-subtrees",
"neetcode/counting-bits",
"neetcode/counting-elements",
"neetcode/counting-words-with-a-given-prefix",
"neetcode/course-schedule",
"neetcode/course-schedule-ii",
"neetcode/course-schedule-iv",
"neetcode/crawler-log-folder",
"neetcode/custom-sort-string",
"neetcode/daily-temperatures",
"neetcode/decode-string",
"neetcode/decode-ways",
"neetcode/delete-leaves-with-a-given-value",
"neetcode/delete-n-nodes-after-m-nodes-of-a-linked-list",
"neetcode/delete-node-in-a-bst",
"neetcode/depth-of-binary-tree",
"neetcode/design-a-leaderboard",
"neetcode/design-circular-queue",
"neetcode/design-compressed-string-iterator",
"neetcode/design-excel-sum-formula",
"neetcode/design-file-system",
"neetcode/design-hashmap",
"neetcode/design-hashset",
"neetcode/design-hit-counter",
"neetcode/design-in-memory-file-system",
"neetcode/design-phone-directory",
"neetcode/design-search-autocomplete-system",
"neetcode/design-snake-game",
"neetcode/design-tic-tac-toe",
"neetcode/design-twitter-feed",
"neetcode/design-word-search-data-structure",
"neetcode/diameter-of-n-ary-tree",
"neetcode/distribute-candies-among-children-ii",
"neetcode/divide-array-into-equal-pairs",
"neetcode/divide-chocolate",
"neetcode/dot-product-of-two-sparse-vectors",
"neetcode/dota2-senate",
"neetcode/duplicate-integer",
"neetcode/eating-bananas",
"neetcode/edit-distance",
"neetcode/employee-free-time",
"neetcode/encode-n-ary-tree-to-binary-tree",
"neetcode/encode-string-with-shortest-length",
"neetcode/evaluate-division",
"neetcode/evaluate-reverse-polish-notation",
"neetcode/excel-sheet-column-title",
"neetcode/extra-characters-in-a-string",
"neetcode/factor-combinations",
"neetcode/final-array-state-after-k-multiplication-operations-i",
"neetcode/find-all-numbers-disappeared-in-an-array",
"neetcode/find-anagram-mappings",
"neetcode/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree",
"neetcode/find-duplicate-integer",
"neetcode/find-first-and-last-position-of-element-in-sorted-array",
"neetcode/find-in-mountain-array",
"neetcode/find-k-closest-elements",
"neetcode/find-k-length-substrings-with-no-repeated-characters",
"neetcode/find-leaves-of-binary-tree",
"neetcode/find-lucky-integer-in-an-array",
"neetcode/find-median-in-a-data-stream",
"neetcode/find-minimum-in-rotated-sorted-array",
"neetcode/find-missing-and-repeated-values",
"neetcode/find-peak-element",
"neetcode/find-permutation",
"neetcode/find-pivot-index",
"neetcode/find-root-of-n-ary-tree",
"neetcode/find-smallest-common-element-in-all-rows",
"neetcode/find-target-in-rotated-sorted-array",
"neetcode/find-the-celebrity",
"neetcode/find-the-difference",
"neetcode/find-the-difference-of-two-arrays",
"neetcode/find-the-index-of-the-first-occurrence-in-a-string",
"neetcode/find-the-index-of-the-large-integer",
"neetcode/find-the-town-judge",
"neetcode/find-words-that-can-be-formed-by-characters",
"neetcode/first-missing-positive",
"neetcode/first-unique-character-in-a-string",
"neetcode/first-unique-number",
"neetcode/flood-fill",
"neetcode/foreign-dictionary",
"neetcode/frequency-of-the-most-frequent-element",
"neetcode/fruit-into-baskets",
"neetcode/gas-station",
"neetcode/generate-parentheses",
"neetcode/greatest-common-divisor-of-strings",
"neetcode/greatest-common-divisor-traversal",
"neetcode/group-shifted-strings",
"neetcode/grumpy-bookstore-owner",
"neetcode/guess-number-higher-or-lower",
"neetcode/guess-the-majority-in-a-hidden-array",
"neetcode/hand-of-straights",
"neetcode/handshakes-that-dont-cross",
"neetcode/height-checker",
"neetcode/high-five",
"neetcode/house-robber",
"neetcode/house-robber-ii",
"neetcode/house-robber-iii",
"neetcode/implement-prefix-tree",
"neetcode/implement-queue-using-stacks",
"neetcode/implement-stack-using-queues",
"neetcode/inorder-successor-in-bst-ii",
"neetcode/insert-delete-getrandom-o1",
"neetcode/insert-greatest-common-divisors-in-linked-list",
"neetcode/insert-into-a-binary-search-tree",
"neetcode/insert-into-a-sorted-circular-linked-list",
"neetcode/insert-new-interval",
"neetcode/insertion-sort-list",
"neetcode/integer-break",
"neetcode/integer-to-roman",
"neetcode/interleaving-string",
"neetcode/intersection-of-two-arrays",
"neetcode/intersection-of-two-linked-lists",
"neetcode/interval-list-intersections",
"neetcode/invert-a-binary-tree",
"neetcode/ip-to-cidr",
"neetcode/ipo",
"neetcode/is-anagram",
"neetcode/is-palindrome",
"neetcode/is-subsequence",
"neetcode/island-perimeter",
"neetcode/islands-and-treasure",
"neetcode/isomorphic-strings",
"neetcode/jump-game",
"neetcode/jump-game-ii",
"neetcode/jump-game-vii",
"neetcode/k-closest-points-to-origin",
"neetcode/k-th-smallest-in-lexicographical-order",
"neetcode/kill-process",
"neetcode/kth-distinct-string-in-an-array",
"neetcode/kth-largest-element-in-an-array",
"neetcode/kth-largest-integer-in-a-stream",
"neetcode/kth-smallest-integer-in-bst",
"neetcode/kth-smallest-product-of-two-sorted-arrays",
"neetcode/largest-3-same-digit-number-in-string",
"neetcode/largest-bst-subtree",
"neetcode/largest-divisible-subset",
"neetcode/largest-number",
"neetcode/largest-rectangle-in-histogram",
"neetcode/largest-submatrix-with-rearrangements",
"neetcode/largest-unique-number",
"neetcode/last-stone-weight",
"neetcode/last-stone-weight-ii",
"neetcode/leftmost-column-with-at-least-a-one",
"neetcode/lemonade-change",
"neetcode/length-of-last-word",
"neetcode/level-order-traversal-of-binary-tree",
"neetcode/lfu-cache",
"neetcode/line-reflection",
"neetcode/linked-list-cycle-detection",
"neetcode/logger-rate-limiter",
"neetcode/lonely-pixel-i",
"neetcode/longest-common-prefix",
"neetcode/longest-common-subsequence",
"neetcode/longest-consecutive-sequence",
"neetcode/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit",
"neetcode/longest-happy-string",
"neetcode/longest-increasing-path-in-matrix",
"neetcode/longest-increasing-subsequence",
"neetcode/longest-palindromic-substring",
"neetcode/longest-repeating-substring-with-replacement",
"neetcode/longest-strictly-increasing-or-strictly-decreasing-subarray",
"neetcode/longest-substring-with-at-most-k-distinct-characters",
"neetcode/longest-substring-with-at-most-two-distinct-characters",
"neetcode/longest-substring-without-duplicates",
"neetcode/longest-turbulent-subarray",
"neetcode/lowest-common-ancestor-in-binary-search-tree",
"neetcode/lowest-common-ancestor-of-a-binary-tree",
"neetcode/lowest-common-ancestor-of-a-binary-tree-iii",
"neetcode/lru-cache",
"neetcode/majority-element",
"neetcode/majority-element-ii",
"neetcode/matchsticks-to-square",
"neetcode/matrix-diagonal-sum",
"neetcode/max-area-of-island",
"neetcode/max-consecutive-ones",
"neetcode/max-consecutive-ones-ii",
"neetcode/max-consecutive-ones-iii",
"neetcode/max-stack",
"neetcode/max-water-container",
"neetcode/maximal-square",
"neetcode/maximize-ysum-by-picking-a-triplet-of-distinct-xvalues",
"neetcode/maximum-ascending-subarray-sum",
"neetcode/maximum-average-subarray-ii",
"neetcode/maximum-average-subtree",
"neetcode/maximum-difference-between-even-and-odd-frequency-i",
"neetcode/maximum-distance-in-arrays",
"neetcode/maximum-frequency-after-subarray-operation",
"neetcode/maximum-frequency-stack",
"neetcode/maximum-nesting-depth-of-the-parentheses",
"neetcode/maximum-number-of-balloons",
"neetcode/maximum-number-of-ones",
"neetcode/maximum-number-of-points-with-cost",
"neetcode/maximum-odd-binary-number",
"neetcode/maximum-points-you-can-obtain-from-cards",
"neetcode/maximum-product-difference-between-two-pairs",
"neetcode/maximum-product-subarray",
"neetcode/maximum-profit-in-job-scheduling",
"neetcode/maximum-score-after-splitting-a-string",
"neetcode/maximum-subarray",
"neetcode/maximum-sum-circular-subarray",
"neetcode/maximum-transactions-without-negative-balance",
"neetcode/maximum-twin-sum-of-a-linked-list",
"neetcode/median-of-two-sorted-arrays",
"neetcode/meeting-rooms-iii",
"neetcode/meeting-schedule",
"neetcode/meeting-schedule-ii",
"neetcode/meeting-scheduler",
"neetcode/merge-intervals",
"neetcode/merge-k-sorted-linked-lists",
"neetcode/merge-sorted-array",
"neetcode/merge-strings-alternately",
"neetcode/merge-triplets-to-form-target",
"neetcode/merge-two-binary-trees",
"neetcode/merge-two-sorted-linked-lists",
"neetcode/middle-of-the-linked-list",
"neetcode/min-cost-climbing-stairs",
"neetcode/min-cost-to-connect-points",
"neetcode/minimize-the-maximum-difference-of-pairs",
"neetcode/minimum-array-end",
"neetcode/minimum-changes-to-make-alternating-binary-string",
"neetcode/minimum-cost-for-tickets",
"neetcode/minimum-cost-to-connect-sticks",
"neetcode/minimum-difference-between-highest-and-lowest-of-k-scores",
"neetcode/minimum-factorization",
"neetcode/minimum-height-trees",
"neetcode/minimum-interval-including-query",
"neetcode/minimum-knight-moves",
"neetcode/minimum-number-of-increments-on-subarrays-to-form-a-target-array",
"neetcode/minimum-number-of-moves-to-seat-everyone",
"neetcode/minimum-number-of-operations-to-make-array-empty",
"neetcode/minimum-path-sum",
"neetcode/minimum-recolors-to-get-k-consecutive-black-blocks",
"neetcode/minimum-remove-to-make-valid-parentheses",
"neetcode/minimum-size-subarray-sum",
"neetcode/minimum-stack",
"neetcode/minimum-time-to-collect-all-apples-in-a-tree",
"neetcode/minimum-window-with-characters",
"neetcode/missing-element-in-sorted-array",
"neetcode/missing-number",
"neetcode/missing-number-in-arithmetic-progression",
"neetcode/missing-ranges",
"neetcode/monotonic-array",
"neetcode/move-zeroes",
"neetcode/moving-average-from-data-stream",
"neetcode/multiply-strings",
"neetcode/n-ary-tree-postorder-traversal",
"neetcode/n-queens",
"neetcode/n-queens-ii",
"neetcode/n-th-tribonacci-number",
"neetcode/nested-list-weight-sum",
"neetcode/nested-list-weight-sum-ii",
"neetcode/network-delay-time",
"neetcode/new-21-game",
"neetcode/next-greater-element-i",
"neetcode/next-permutation",
"neetcode/non-cyclical-number",
"neetcode/non-overlapping-intervals",
"neetcode/number-of-distinct-islands",
"neetcode/number-of-distinct-islands-ii",
"neetcode/number-of-enclaves",
"neetcode/number-of-good-pairs",
"neetcode/number-of-islands-ii",
"neetcode/number-of-one-bits",
"neetcode/number-of-provinces",
"neetcode/number-of-senior-citizens",
"neetcode/number-of-ships-in-a-rectangle",
"neetcode/number-of-students-unable-to-eat-lunch",
"neetcode/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold",
"neetcode/number-of-subsequences-that-satisfy-the-given-sum-condition",
"neetcode/number-of-visible-people-in-a-queue",
"neetcode/one-edit-distance",
"neetcode/ones-and-zeroes",
"neetcode/online-stock-span",
"neetcode/open-the-lock",
"neetcode/optimal-account-balancing",
"neetcode/pacific-atlantic-water-flow",
"neetcode/paint-fence",
"neetcode/paint-house",
"neetcode/paint-house-ii",
"neetcode/palindrome-linked-list",
"neetcode/palindrome-number",
"neetcode/palindrome-partitioning",
"neetcode/palindrome-permutation",
"neetcode/palindromic-substrings",
"neetcode/parallel-courses",
"neetcode/partition-equal-subset-sum",
"neetcode/partition-labels",
"neetcode/partition-to-k-equal-sum-subsets",
"neetcode/pascals-triangle",
"neetcode/pascals-triangle-ii",
"neetcode/path-crossing",
"neetcode/path-sum",
"neetcode/path-with-maximum-probability",
"neetcode/path-with-minimum-effort",
"neetcode/perfect-squares",
"neetcode/perform-string-shifts",
"neetcode/permutation-string",
"neetcode/permutations",
"neetcode/permutations-ii",
"neetcode/plus-one",
"neetcode/plus-one-linked-list",
"neetcode/populating-next-right-pointers-in-each-node",
"neetcode/pow-x-n",
"neetcode/power-of-two",
"neetcode/print-immutable-linked-list-in-reverse",
"neetcode/product-of-two-run-length-encoded-arrays",
"neetcode/products-of-array-discluding-self",
"neetcode/put-boxes-into-the-warehouse-i",
"neetcode/put-marbles-in-bags",
"neetcode/random-pick-with-weight",
"neetcode/range-sum-of-bst",
"neetcode/range-sum-query-2d-immutable",
"neetcode/range-sum-query-2d-mutable",
"neetcode/range-sum-query-immutable",
"neetcode/ransom-note",
"neetcode/rearrange-array-elements-by-sign",
"neetcode/rearrange-string-k-distance-apart",
"neetcode/reconstruct-flight-path",
"neetcode/recover-binary-search-tree",
"neetcode/redistribute-characters-to-make-all-strings-equal",
"neetcode/redundant-connection",
"neetcode/regular-expression-matching",
"neetcode/remove-all-adjacent-duplicates-in-string-ii",
"neetcode/remove-duplicates-from-sorted-array",
"neetcode/remove-element",
"neetcode/remove-interval",
"neetcode/remove-linked-list-elements",
"neetcode/remove-node-from-end-of-linked-list",
"neetcode/remove-sub-folders-from-the-filesystem",
"neetcode/reorder-linked-list",
"neetcode/reorganize-string",
"neetcode/replace-elements-with-greatest-element-on-right-side",
"neetcode/restore-ip-addresses",
"neetcode/reverse-a-linked-list",
"neetcode/reverse-bits",
"neetcode/reverse-integer",
"neetcode/reverse-linked-list-ii",
"neetcode/reverse-nodes-in-k-group",
"neetcode/reverse-string",
"neetcode/reverse-words-in-a-string-ii",
"neetcode/robot-room-cleaner",
"neetcode/roman-to-integer",
"neetcode/rotate-array",
"neetcode/rotate-list",
"neetcode/rotate-matrix",
"neetcode/rotating-the-box",
"neetcode/rotting-fruit",
"neetcode/russian-doll-envelopes",
"neetcode/same-binary-tree",
"neetcode/score-of-a-string",
"neetcode/search-2d-matrix",
"neetcode/search-for-word",
"neetcode/search-for-word-ii",
"neetcode/search-in-rotated-sorted-array-ii",
"neetcode/search-insert-position",
"neetcode/sentence-screen-fitting",
"neetcode/sentence-similarity",
"neetcode/sentence-similarity-ii",
"neetcode/sequence-reconstruction",
"neetcode/serialize-and-deserialize-binary-tree",
"neetcode/serialize-and-deserialize-n-ary-tree",
"neetcode/set-zeroes-in-matrix",
"neetcode/shortest-bridge",
"neetcode/shortest-distance-from-all-buildings",
"neetcode/shortest-path-in-binary-matrix",
"neetcode/shortest-way-to-form-string",
"neetcode/shortest-word-distance",
"neetcode/shortest-word-distance-ii",
"neetcode/simplify-path",
"neetcode/single-element-in-a-sorted-array",
"neetcode/single-number",
"neetcode/single-number-iii",
"neetcode/single-row-keyboard",
"neetcode/single-threaded-cpu",
"neetcode/sliding-window-maximum",
"neetcode/sort-an-array",
"neetcode/sort-array-by-increasing-frequency",
"neetcode/sort-array-by-parity",
"neetcode/sort-colors",
"neetcode/sort-transformed-array",
"neetcode/sparse-matrix-multiplication",
"neetcode/special-array-i",
"neetcode/spiral-matrix",
"neetcode/spiral-matrix-ii",
"neetcode/split-array-largest-sum",
"neetcode/split-array-with-same-average",
"neetcode/split-concatenated-strings",
"neetcode/sqrtx",
"neetcode/squares-of-a-sorted-array",
"neetcode/stone-game",
"neetcode/stone-game-ii",
"neetcode/stone-game-iii",
"neetcode/string-compression",
"neetcode/string-encode-and-decode",
"neetcode/string-matching-in-an-array",
"neetcode/strobogrammatic-number",
"neetcode/strobogrammatic-number-ii",
"neetcode/subarray-product-less-than-k",
"neetcode/subarray-sum-equals-k",
"neetcode/subarrays-with-k-different-integers",
"neetcode/subsets",
"neetcode/subsets-ii",
"neetcode/subtree-of-a-binary-tree",
"neetcode/sum-of-all-subset-xor-totals",
"neetcode/sum-of-two-integers",
"neetcode/sum-root-to-leaf-numbers",
"neetcode/surrounded-regions",
"neetcode/swim-in-rising-water",
"neetcode/synonymous-sentences",
"neetcode/take-gifts-from-the-richest-pile",
"neetcode/target-sum",
"neetcode/task-scheduling",
"neetcode/ternary-expression-parser",
"neetcode/text-justification",
"neetcode/the-earliest-moment-when-everyone-become-friends",
"neetcode/the-maze",
"neetcode/the-maze-ii",
"neetcode/the-maze-iii",
"neetcode/three-integer-sum",
"neetcode/time-based-key-value-store",
"neetcode/time-taken-to-cross-the-door",
"neetcode/top-k-elements-in-list",
"neetcode/transpose-matrix",
"neetcode/trapping-rain-water",
"neetcode/tree-diameter",
"neetcode/triangle",
"neetcode/two-city-scheduling",
"neetcode/two-integer-sum",
"neetcode/two-integer-sum-ii",
"neetcode/two-sum-bsts",
"neetcode/ugly-number",
"neetcode/unique-email-addresses",
"neetcode/unique-paths-ii",
"neetcode/valid-binary-search-tree",
"neetcode/valid-palindrome-ii",
"neetcode/valid-palindrome-iii",
"neetcode/valid-parenthesis-string",
"neetcode/valid-perfect-square",
"neetcode/valid-sudoku",
"neetcode/valid-tree",
"neetcode/valid-word-abbreviation",
"neetcode/valid-word-square",
"neetcode/validate-parentheses",
"neetcode/verify-preorder-sequence-in-binary-search-tree",
"neetcode/verifying-an-alien-dictionary",
"neetcode/web-crawler",
"neetcode/wiggle-sort",
"neetcode/word-break",
"neetcode/word-break-ii",
"neetcode/word-ladder",
"neetcode/word-pattern",
"neetcode/word-pattern-ii",
"neetcode/zigzag-conversion",
"neetcode/zigzag-iterator"
]
},
{
"name": "Master binary search",
"created_at": "2026-04-13 00:08:58",
"problems": [
"neetcode/eating-bananas",
"leetcode/find-the-smallest-divisor-given-a-threshold",
"neetcode/find-peak-element",
"neetcode/find-target-in-rotated-sorted-array",
"neetcode/find-minimum-in-rotated-sorted-array",
"leetcode/minimum-speed-to-arrive-on-time",
"neetcode/capacity-to-ship-packages-within-d-days",
"leetcode/minimum-number-of-days-to-make-m-bouquets",
"neetcode/split-array-largest-sum",
"geeksforgeeks/allocate-minimum-number-of-pages",
"geeksforgeeks/aggressive-cows",
"leetcode/magnetic-force-between-two-balls",
"neetcode/cutting-ribbons",
"leetcode/find-k-th-smallest-pair-distance",
"neetcode/minimize-max-distance-to-gas-station",
"leetcode/minimum-time-to-complete-trips",
"leetcode/minimum-limit-of-balls-in-a-bag",
"leetcode/kth-missing-positive-number",
"leetcode/maximum-number-of-removable-characters",
"neetcode/median-of-two-sorted-arrays",
"neetcode/split-array-with-same-average",
"leetcode/minimize-the-difference-between-target-and-chosen-elements",
"leetcode/maximal-network-rank",
"leetcode/kth-smallest-number-in-multiplication-table"
]
},
{
"name": "Master binary trees",
"created_at": "2026-04-13 00:09:26",
"problems": [
"neetcode/insert-into-a-binary-search-tree",
"neetcode/delete-node-in-a-bst",
"neetcode/binary-tree-inorder-traversal",
"neetcode/balanced-binary-tree",
"neetcode/kth-smallest-integer-in-bst",
"neetcode/binary-tree-from-preorder-and-inorder-traversal",
"neetcode/level-order-traversal-of-binary-tree",
"neetcode/binary-tree-right-side-view",
"neetcode/binarySearchTree",
"neetcode/invert-a-binary-tree",
"neetcode/depth-of-binary-tree",
"neetcode/binary-tree-diameter",
"neetcode/same-binary-tree",
"neetcode/subtree-of-a-binary-tree",
"neetcode/valid-binary-search-tree",
"neetcode/lowest-common-ancestor-in-binary-search-tree",
"neetcode/serialize-and-deserialize-binary-tree",
"neetcode/binary-tree-maximum-path-sum"
]
},
{
"name": "Neetcode 150",
"created_at": "2026-04-13 00:10:29",
"problems": [
"neetcode/duplicate-integer",
"neetcode/is-anagram",
"neetcode/two-integer-sum",
"neetcode/anagram-groups",
"neetcode/top-k-elements-in-list",
"neetcode/string-encode-and-decode",
"neetcode/products-of-array-discluding-self",
"neetcode/valid-sudoku",
"neetcode/longest-consecutive-sequence",
"neetcode/is-palindrome",
"neetcode/two-integer-sum-ii",
"neetcode/three-integer-sum",
"neetcode/max-water-container",
"neetcode/trapping-rain-water",
"neetcode/buy-and-sell-crypto",
"neetcode/longest-substring-without-duplicates",
"neetcode/longest-repeating-substring-with-replacement",
"neetcode/permutation-string",
"neetcode/minimum-window-with-characters",
"neetcode/sliding-window-maximum",
"neetcode/validate-parentheses",
"neetcode/minimum-stack",
"neetcode/evaluate-reverse-polish-notation",
"neetcode/daily-temperatures",
"neetcode/car-fleet",
"neetcode/largest-rectangle-in-histogram",
"neetcode/binary-search",
"neetcode/search-2d-matrix",
"neetcode/eating-bananas",
"neetcode/find-minimum-in-rotated-sorted-array",
"neetcode/find-target-in-rotated-sorted-array",
"neetcode/time-based-key-value-store",
"neetcode/median-of-two-sorted-arrays",
"neetcode/reverse-a-linked-list",
"neetcode/merge-two-sorted-linked-lists",
"neetcode/linked-list-cycle-detection",
"neetcode/reorder-linked-list",
"neetcode/remove-node-from-end-of-linked-list",
"neetcode/copy-linked-list-with-random-pointer",
"neetcode/add-two-numbers",
"neetcode/find-duplicate-integer",
"neetcode/lru-cache",
"neetcode/merge-k-sorted-linked-lists",
"neetcode/reverse-nodes-in-k-group",
"neetcode/invert-a-binary-tree",
"neetcode/depth-of-binary-tree",
"neetcode/binary-tree-diameter",
"neetcode/balanced-binary-tree",
"neetcode/same-binary-tree",
"neetcode/subtree-of-a-binary-tree",
"neetcode/lowest-common-ancestor-in-binary-search-tree",
"neetcode/level-order-traversal-of-binary-tree",
"neetcode/binary-tree-right-side-view",
"neetcode/count-good-nodes-in-binary-tree",
"neetcode/valid-binary-search-tree",
"neetcode/kth-smallest-integer-in-bst",
"neetcode/binary-tree-from-preorder-and-inorder-traversal",
"neetcode/binary-tree-maximum-path-sum",
"neetcode/serialize-and-deserialize-binary-tree",
"neetcode/kth-largest-integer-in-a-stream",
"neetcode/last-stone-weight",
"neetcode/k-closest-points-to-origin",
"neetcode/kth-largest-element-in-an-array",
"neetcode/task-scheduling",
"neetcode/design-twitter-feed",
"neetcode/find-median-in-a-data-stream",
"neetcode/subsets",
"neetcode/combination-target-sum",
"neetcode/combination-target-sum-ii",
"neetcode/permutations",
"neetcode/subsets-ii",
"neetcode/generate-parentheses",
"neetcode/search-for-word",
"neetcode/palindrome-partitioning",
"neetcode/combinations-of-a-phone-number",
"neetcode/n-queens",
"neetcode/implement-prefix-tree",
"neetcode/design-word-search-data-structure",
"neetcode/search-for-word-ii",
"neetcode/count-number-of-islands",
"neetcode/max-area-of-island",
"neetcode/clone-graph",
"neetcode/islands-and-treasure",
"neetcode/rotting-fruit",
"neetcode/pacific-atlantic-water-flow",
"neetcode/surrounded-regions",
"neetcode/course-schedule",
"neetcode/course-schedule-ii",
"neetcode/valid-tree",
"neetcode/count-connected-components",
"neetcode/redundant-connection",
"neetcode/word-ladder",
"neetcode/network-delay-time",
"neetcode/reconstruct-flight-path",
"neetcode/min-cost-to-connect-points",
"neetcode/swim-in-rising-water",
"neetcode/foreign-dictionary",
"neetcode/cheapest-flight-path",
"neetcode/climbing-stairs",
"neetcode/min-cost-climbing-stairs",
"neetcode/house-robber",
"neetcode/house-robber-ii",
"neetcode/longest-palindromic-substring",
"neetcode/palindromic-substrings",
"neetcode/decode-ways",
"neetcode/coin-change",
"neetcode/maximum-product-subarray",
"neetcode/word-break",
"neetcode/longest-increasing-subsequence",
"neetcode/partition-equal-subset-sum",
"neetcode/count-paths",
"neetcode/longest-common-subsequence",
"neetcode/buy-and-sell-crypto-with-cooldown",
"neetcode/coin-change-ii",
"neetcode/target-sum",
"neetcode/interleaving-string",
"neetcode/longest-increasing-path-in-matrix",
"neetcode/count-subsequences",
"neetcode/edit-distance",
"neetcode/burst-balloons",
"neetcode/regular-expression-matching",
"neetcode/maximum-subarray",
"neetcode/jump-game",
"neetcode/jump-game-ii",
"neetcode/gas-station",
"neetcode/hand-of-straights",
"neetcode/merge-triplets-to-form-target",
"neetcode/partition-labels",
"neetcode/valid-parenthesis-string",
"neetcode/insert-new-interval",
"neetcode/merge-intervals",
"neetcode/non-overlapping-intervals",
"neetcode/meeting-schedule",
"neetcode/meeting-schedule-ii",
"neetcode/minimum-interval-including-query",
"neetcode/rotate-matrix",
"neetcode/spiral-matrix",
"neetcode/set-zeroes-in-matrix",
"neetcode/non-cyclical-number",
"neetcode/plus-one",
"neetcode/pow-x-n",
"neetcode/multiply-strings",
"neetcode/count-squares",
"neetcode/single-number",
"neetcode/number-of-one-bits",
"neetcode/counting-bits",
"neetcode/reverse-bits",
"neetcode/missing-number",
"neetcode/sum-of-two-integers",
"neetcode/reverse-integer"
]
}
],
"attempts": []
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment