LeetCode study plans API
Use the LeetCode study plans API to retrieve problem metadata, grouped result tables, record identities and titles and source-page links as structured JSON from LeetCode. Choose record slug as optional query conditions to select the source records or view required for your request. Use these results to choose programming exercises by difficulty or topic and connect study plans with problem references. The documented source-page link form identifies the requested entry directly and lets you reuse an existing source-page reference. The detail page includes parameter definitions, paired request and response examples, and usage pricing for this operation.
- Selected price
- $0.002 / billing creditPublished pricing
- Sellers / implementations
- 1 / 1
- Requests · 30d
- —Loading...
- Success rate · 30d
- —Loading...
| Seller | Pricing | Requests · 30d | Performance | Access |
|---|---|---|---|---|
apishCurrent LeetCode study plans API · GET · View API reference | $0.002 / billing credit | — | —successP50— |
Run sends a real API request. Charges follow the published API contract.
Response structure
awardobjectdescriptionstringiconstringicon_gifstringnamestring
cachedbooleancoverstringcredits_usedintegerdescriptionstringfetched_atstringgroupsobject[]namestringpremium_onlybooleanproblemsobject[]difficultystringnumberintegerpremiumbooleanslugstringtitlestringtopicsstring[]urlstring
problems_countintegerslugstring
highlightstringnamestringpremium_onlybooleanproblems_countintegerrelatedobject[]highlightstringnamestringpremium_onlybooleanslugstring
slugstringurlstring
// Inferred from response examples. Fields are optional and other fields may be returned.
export type ApiResponse = {
award?: {
description?: string;
icon?: string;
icon_gif?: string;
name?: string;
};
cached?: boolean;
cover?: string;
credits_used?: number;
description?: string;
fetched_at?: string;
groups?: Array<{
name?: string;
premium_only?: boolean;
problems?: Array<{
difficulty?: string;
number?: number;
premium?: boolean;
slug?: string;
title?: string;
topics?: Array<string>;
url?: string;
}>;
problems_count?: number;
slug?: string;
}>;
highlight?: string;
name?: string;
premium_only?: boolean;
problems_count?: number;
related?: Array<{
highlight?: string;
name?: string;
premium_only?: boolean;
slug?: string;
}>;
slug?: string;
url?: string;
};- Method
- GET
- Endpoint
https://api.openany.si/v1/agent-apis/apish/leetcode/v1/study-plan- Content type
- application/json
- Authentication
Authorization: Bearer $OPENANY_API_KEY
curl \
'https://api.openany.si/v1/agent-apis/apish/leetcode/v1/study-plan?output=json&raw=0&slug=top-interview-150' \
-X GET \
-H "Authorization: Bearer $OPENANY_API_KEY" \
-H 'Content-Type: application/json'Input parameters
Fields in this listing; additional options and input encoding can vary by provider.
| Parameter | Location | Type | Required | Description |
|---|---|---|---|---|
slug | URL query parametersquery | string | No | Study plan slug or leetcode.com/studyplan/<slug>/ link; empty lists all plans. |
raw | URL query parametersquery | string | No | 0 leaves out the bulky `raw` source blocks (often 10-30x smaller). enum: "0", "1" |
fields | URL query parametersquery | string | No | Comma-separated fields to return, e.g. `posts.id,posts.title`. Call metadata is always included. |
fresh | URL query parametersquery | string | No | 1 skips the 24-hour cache and fetches live. enum: "1" |
output | URL query parametersquery | string | No | JSON only for this OpenAny product. Omit output or use json; CSV and NDJSON are not supported. enum: "json" |
records | URL query parametersquery | string | No | With output=csv|ndjson: the top-level list to turn into rows (e.g. `reviews`), or `.` for the whole object as one row. |
Required markers inside a nested object or variant apply when that object or variant is used.
Sample response
Sample response · Documented HTTP 200 Example from the provider's documentation. Field values in your results will differ.
{
"award": {
"description": "Complete the study plan to win the badge!",
"icon": "https://assets.leetcode.com/static_assets/others/Top_100_Liked-1.png",
"icon_gif": "https://assets.leetcode.com/static_assets/others/Top_Interview_150.gif",
"name": "Top Interview 150"
},
"cached": false,
"cover": "https://assets.leetcode.com/static_assets/others/Top_Interview_150_static_cover_picture.png",
"credits_used": 1,
"description": "150 Original & Classic Questions\r\nCovers comprehensive interview topics\r\nBest for 3+ months of prep time\r\nProblems support high-quality editorials",
"fetched_at": "2026-11-19T12:29:42.263Z",
"groups": [
{
"name": "Array / String",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 88,
"premium": false,
"slug": "merge-sorted-array",
"title": "Merge Sorted Array",
"topics": [
"array",
"two-pointers",
"sorting"
],
"url": "https://leetcode.com/problems/merge-sorted-array/"
},
{
"difficulty": "easy",
"number": 27,
"premium": false,
"slug": "remove-element",
"title": "Remove Element",
"topics": [
"array",
"two-pointers"
],
"url": "https://leetcode.com/problems/remove-element/"
},
{
"difficulty": "easy",
"number": 26,
"premium": false,
"slug": "remove-duplicates-from-sorted-array",
"title": "Remove Duplicates from Sorted Array",
"topics": [
"array",
"two-pointers"
],
"url": "https://leetcode.com/problems/remove-duplicates-from-sorted-array/"
},
{
"difficulty": "medium",
"number": 80,
"premium": false,
"slug": "remove-duplicates-from-sorted-array-ii",
"title": "Remove Duplicates from Sorted Array II",
"topics": [
"array",
"two-pointers"
],
"url": "https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/"
},
{
"difficulty": "easy",
"number": 169,
"premium": false,
"slug": "majority-element",
"title": "Majority Element",
"topics": [
"array",
"hash-table",
"divide-and-conquer",
"sorting",
"counting",
"boyer-moore-majority-vote-algorithm"
],
"url": "https://leetcode.com/problems/majority-element/"
},
{
"difficulty": "medium",
"number": 189,
"premium": false,
"slug": "rotate-array",
"title": "Rotate Array",
"topics": [
"array",
"math",
"two-pointers"
],
"url": "https://leetcode.com/problems/rotate-array/"
},
{
"difficulty": "easy",
"number": 121,
"premium": false,
"slug": "best-time-to-buy-and-sell-stock",
"title": "Best Time to Buy and Sell Stock",
"topics": [
"array",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock/"
},
{
"difficulty": "medium",
"number": 122,
"premium": false,
"slug": "best-time-to-buy-and-sell-stock-ii",
"title": "Best Time to Buy and Sell Stock II",
"topics": [
"array",
"dynamic-programming",
"greedy"
],
"url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/"
},
{
"difficulty": "medium",
"number": 55,
"premium": false,
"slug": "jump-game",
"title": "Jump Game",
"topics": [
"array",
"dynamic-programming",
"greedy"
],
"url": "https://leetcode.com/problems/jump-game/"
},
{
"difficulty": "medium",
"number": 45,
"premium": false,
"slug": "jump-game-ii",
"title": "Jump Game II",
"topics": [
"array",
"dynamic-programming",
"greedy"
],
"url": "https://leetcode.com/problems/jump-game-ii/"
},
{
"difficulty": "medium",
"number": 274,
"premium": false,
"slug": "h-index",
"title": "H-Index",
"topics": [
"array",
"sorting",
"counting-sort"
],
"url": "https://leetcode.com/problems/h-index/"
},
{
"difficulty": "medium",
"number": 380,
"premium": false,
"slug": "insert-delete-getrandom-o1",
"title": "Insert Delete GetRandom O(1)",
"topics": [
"array",
"hash-table",
"math",
"design",
"randomized"
],
"url": "https://leetcode.com/problems/insert-delete-getrandom-o1/"
},
{
"difficulty": "medium",
"number": 238,
"premium": false,
"slug": "product-of-array-except-self",
"title": "Product of Array Except Self",
"topics": [
"array",
"prefix-sum"
],
"url": "https://leetcode.com/problems/product-of-array-except-self/"
},
{
"difficulty": "medium",
"number": 134,
"premium": false,
"slug": "gas-station",
"title": "Gas Station",
"topics": [
"array",
"greedy"
],
"url": "https://leetcode.com/problems/gas-station/"
},
{
"difficulty": "hard",
"number": 135,
"premium": false,
"slug": "candy",
"title": "Candy",
"topics": [
"array",
"greedy"
],
"url": "https://leetcode.com/problems/candy/"
},
{
"difficulty": "hard",
"number": 42,
"premium": false,
"slug": "trapping-rain-water",
"title": "Trapping Rain Water",
"topics": [
"array",
"two-pointers",
"dynamic-programming",
"stack",
"monotonic-stack"
],
"url": "https://leetcode.com/problems/trapping-rain-water/"
},
{
"difficulty": "easy",
"number": 13,
"premium": false,
"slug": "roman-to-integer",
"title": "Roman to Integer",
"topics": [
"hash-table",
"math",
"string"
],
"url": "https://leetcode.com/problems/roman-to-integer/"
},
{
"difficulty": "medium",
"number": 12,
"premium": false,
"slug": "integer-to-roman",
"title": "Integer to Roman",
"topics": [
"hash-table",
"math",
"string"
],
"url": "https://leetcode.com/problems/integer-to-roman/"
},
{
"difficulty": "easy",
"number": 58,
"premium": false,
"slug": "length-of-last-word",
"title": "Length of Last Word",
"topics": [
"string"
],
"url": "https://leetcode.com/problems/length-of-last-word/"
},
{
"difficulty": "easy",
"number": 14,
"premium": false,
"slug": "longest-common-prefix",
"title": "Longest Common Prefix",
"topics": [
"array",
"string",
"trie"
],
"url": "https://leetcode.com/problems/longest-common-prefix/"
},
{
"difficulty": "medium",
"number": 151,
"premium": false,
"slug": "reverse-words-in-a-string",
"title": "Reverse Words in a String",
"topics": [
"two-pointers",
"string"
],
"url": "https://leetcode.com/problems/reverse-words-in-a-string/"
},
{
"difficulty": "medium",
"number": 6,
"premium": false,
"slug": "zigzag-conversion",
"title": "Zigzag Conversion",
"topics": [
"string"
],
"url": "https://leetcode.com/problems/zigzag-conversion/"
},
{
"difficulty": "easy",
"number": 28,
"premium": false,
"slug": "find-the-index-of-the-first-occurrence-in-a-string",
"title": "Find the Index of the First Occurrence in a String",
"topics": [
"two-pointers",
"string",
"string-matching",
"z-algorithm",
"knuth-morris-pratt-algorithm",
"boyer-moore-string-search-algorithm"
],
"url": "https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/"
},
{
"difficulty": "hard",
"number": 68,
"premium": false,
"slug": "text-justification",
"title": "Text Justification",
"topics": [
"array",
"string",
"simulation"
],
"url": "https://leetcode.com/problems/text-justification/"
}
],
"problems_count": 24,
"slug": "top-interview-150-1-yf91"
},
{
"name": "Two Pointers",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 125,
"premium": false,
"slug": "valid-palindrome",
"title": "Valid Palindrome",
"topics": [
"two-pointers",
"string"
],
"url": "https://leetcode.com/problems/valid-palindrome/"
},
{
"difficulty": "easy",
"number": 392,
"premium": false,
"slug": "is-subsequence",
"title": "Is Subsequence",
"topics": [
"two-pointers",
"string",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/is-subsequence/"
},
{
"difficulty": "medium",
"number": 167,
"premium": false,
"slug": "two-sum-ii-input-array-is-sorted",
"title": "Two Sum II - Input Array Is Sorted",
"topics": [
"array",
"two-pointers",
"binary-search"
],
"url": "https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/"
},
{
"difficulty": "medium",
"number": 11,
"premium": false,
"slug": "container-with-most-water",
"title": "Container With Most Water",
"topics": [
"array",
"two-pointers",
"greedy"
],
"url": "https://leetcode.com/problems/container-with-most-water/"
},
{
"difficulty": "medium",
"number": 15,
"premium": false,
"slug": "3sum",
"title": "3Sum",
"topics": [
"array",
"two-pointers",
"sorting"
],
"url": "https://leetcode.com/problems/3sum/"
}
],
"problems_count": 5,
"slug": "top-interview-150-2-o7jr"
},
{
"name": "Sliding Window",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 209,
"premium": false,
"slug": "minimum-size-subarray-sum",
"title": "Minimum Size Subarray Sum",
"topics": [
"array",
"binary-search",
"sliding-window",
"prefix-sum"
],
"url": "https://leetcode.com/problems/minimum-size-subarray-sum/"
},
{
"difficulty": "medium",
"number": 3,
"premium": false,
"slug": "longest-substring-without-repeating-characters",
"title": "Longest Substring Without Repeating Characters",
"topics": [
"hash-table",
"string",
"sliding-window"
],
"url": "https://leetcode.com/problems/longest-substring-without-repeating-characters/"
},
{
"difficulty": "hard",
"number": 30,
"premium": false,
"slug": "substring-with-concatenation-of-all-words",
"title": "Substring with Concatenation of All Words",
"topics": [
"hash-table",
"string",
"sliding-window"
],
"url": "https://leetcode.com/problems/substring-with-concatenation-of-all-words/"
},
{
"difficulty": "hard",
"number": 76,
"premium": false,
"slug": "minimum-window-substring",
"title": "Minimum Window Substring",
"topics": [
"hash-table",
"string",
"sliding-window"
],
"url": "https://leetcode.com/problems/minimum-window-substring/"
}
],
"problems_count": 4,
"slug": "top-interview-150-3-h81e"
},
{
"name": "Matrix",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 36,
"premium": false,
"slug": "valid-sudoku",
"title": "Valid Sudoku",
"topics": [
"array",
"hash-table",
"matrix"
],
"url": "https://leetcode.com/problems/valid-sudoku/"
},
{
"difficulty": "medium",
"number": 54,
"premium": false,
"slug": "spiral-matrix",
"title": "Spiral Matrix",
"topics": [
"array",
"matrix",
"simulation"
],
"url": "https://leetcode.com/problems/spiral-matrix/"
},
{
"difficulty": "medium",
"number": 48,
"premium": false,
"slug": "rotate-image",
"title": "Rotate Image",
"topics": [
"array",
"math",
"matrix"
],
"url": "https://leetcode.com/problems/rotate-image/"
},
{
"difficulty": "medium",
"number": 73,
"premium": false,
"slug": "set-matrix-zeroes",
"title": "Set Matrix Zeroes",
"topics": [
"array",
"hash-table",
"matrix"
],
"url": "https://leetcode.com/problems/set-matrix-zeroes/"
},
{
"difficulty": "medium",
"number": 289,
"premium": false,
"slug": "game-of-life",
"title": "Game of Life",
"topics": [
"array",
"matrix",
"simulation"
],
"url": "https://leetcode.com/problems/game-of-life/"
}
],
"problems_count": 5,
"slug": "top-interview-150-4-ukui"
},
{
"name": "Hashmap",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 383,
"premium": false,
"slug": "ransom-note",
"title": "Ransom Note",
"topics": [
"hash-table",
"string",
"counting"
],
"url": "https://leetcode.com/problems/ransom-note/"
},
{
"difficulty": "easy",
"number": 205,
"premium": false,
"slug": "isomorphic-strings",
"title": "Isomorphic Strings",
"topics": [
"hash-table",
"string"
],
"url": "https://leetcode.com/problems/isomorphic-strings/"
},
{
"difficulty": "easy",
"number": 290,
"premium": false,
"slug": "word-pattern",
"title": "Word Pattern",
"topics": [
"hash-table",
"string"
],
"url": "https://leetcode.com/problems/word-pattern/"
},
{
"difficulty": "easy",
"number": 242,
"premium": false,
"slug": "valid-anagram",
"title": "Valid Anagram",
"topics": [
"hash-table",
"string",
"sorting"
],
"url": "https://leetcode.com/problems/valid-anagram/"
},
{
"difficulty": "medium",
"number": 49,
"premium": false,
"slug": "group-anagrams",
"title": "Group Anagrams",
"topics": [
"array",
"hash-table",
"string",
"sorting"
],
"url": "https://leetcode.com/problems/group-anagrams/"
},
{
"difficulty": "easy",
"number": 1,
"premium": false,
"slug": "two-sum",
"title": "Two Sum",
"topics": [
"array",
"hash-table"
],
"url": "https://leetcode.com/problems/two-sum/"
},
{
"difficulty": "easy",
"number": 202,
"premium": false,
"slug": "happy-number",
"title": "Happy Number",
"topics": [
"hash-table",
"math",
"two-pointers",
"floyds-cycle-finding-algorithm"
],
"url": "https://leetcode.com/problems/happy-number/"
},
{
"difficulty": "easy",
"number": 219,
"premium": false,
"slug": "contains-duplicate-ii",
"title": "Contains Duplicate II",
"topics": [
"array",
"hash-table",
"sliding-window"
],
"url": "https://leetcode.com/problems/contains-duplicate-ii/"
},
{
"difficulty": "medium",
"number": 128,
"premium": false,
"slug": "longest-consecutive-sequence",
"title": "Longest Consecutive Sequence",
"topics": [
"array",
"hash-table",
"union-find"
],
"url": "https://leetcode.com/problems/longest-consecutive-sequence/"
}
],
"problems_count": 9,
"slug": "top-interview-150-5-nfzq"
},
{
"name": "Intervals",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 228,
"premium": false,
"slug": "summary-ranges",
"title": "Summary Ranges",
"topics": [
"array"
],
"url": "https://leetcode.com/problems/summary-ranges/"
},
{
"difficulty": "medium",
"number": 56,
"premium": false,
"slug": "merge-intervals",
"title": "Merge Intervals",
"topics": [
"array",
"sorting",
"quicksort"
],
"url": "https://leetcode.com/problems/merge-intervals/"
},
{
"difficulty": "medium",
"number": 57,
"premium": false,
"slug": "insert-interval",
"title": "Insert Interval",
"topics": [
"array"
],
"url": "https://leetcode.com/problems/insert-interval/"
},
{
"difficulty": "medium",
"number": 452,
"premium": false,
"slug": "minimum-number-of-arrows-to-burst-balloons",
"title": "Minimum Number of Arrows to Burst Balloons",
"topics": [
"array",
"greedy",
"sorting"
],
"url": "https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/"
}
],
"problems_count": 4,
"slug": "top-interview-150-6-ni2n"
},
{
"name": "Stack",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 20,
"premium": false,
"slug": "valid-parentheses",
"title": "Valid Parentheses",
"topics": [
"string",
"stack",
"bracket-sequences"
],
"url": "https://leetcode.com/problems/valid-parentheses/"
},
{
"difficulty": "medium",
"number": 71,
"premium": false,
"slug": "simplify-path",
"title": "Simplify Path",
"topics": [
"string",
"stack"
],
"url": "https://leetcode.com/problems/simplify-path/"
},
{
"difficulty": "medium",
"number": 155,
"premium": false,
"slug": "min-stack",
"title": "Min Stack",
"topics": [
"stack",
"design"
],
"url": "https://leetcode.com/problems/min-stack/"
},
{
"difficulty": "medium",
"number": 150,
"premium": false,
"slug": "evaluate-reverse-polish-notation",
"title": "Evaluate Reverse Polish Notation",
"topics": [
"array",
"math",
"stack"
],
"url": "https://leetcode.com/problems/evaluate-reverse-polish-notation/"
},
{
"difficulty": "hard",
"number": 224,
"premium": false,
"slug": "basic-calculator",
"title": "Basic Calculator",
"topics": [
"math",
"string",
"stack",
"recursion"
],
"url": "https://leetcode.com/problems/basic-calculator/"
}
],
"problems_count": 5,
"slug": "top-interview-150-7-x7pk"
},
{
"name": "Linked List",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 141,
"premium": false,
"slug": "linked-list-cycle",
"title": "Linked List Cycle",
"topics": [
"hash-table",
"linked-list",
"two-pointers",
"floyds-cycle-finding-algorithm"
],
"url": "https://leetcode.com/problems/linked-list-cycle/"
},
{
"difficulty": "medium",
"number": 2,
"premium": false,
"slug": "add-two-numbers",
"title": "Add Two Numbers",
"topics": [
"linked-list",
"math",
"recursion"
],
"url": "https://leetcode.com/problems/add-two-numbers/"
},
{
"difficulty": "easy",
"number": 21,
"premium": false,
"slug": "merge-two-sorted-lists",
"title": "Merge Two Sorted Lists",
"topics": [
"linked-list",
"recursion"
],
"url": "https://leetcode.com/problems/merge-two-sorted-lists/"
},
{
"difficulty": "medium",
"number": 138,
"premium": false,
"slug": "copy-list-with-random-pointer",
"title": "Copy List with Random Pointer",
"topics": [
"hash-table",
"linked-list"
],
"url": "https://leetcode.com/problems/copy-list-with-random-pointer/"
},
{
"difficulty": "medium",
"number": 92,
"premium": false,
"slug": "reverse-linked-list-ii",
"title": "Reverse Linked List II",
"topics": [
"linked-list"
],
"url": "https://leetcode.com/problems/reverse-linked-list-ii/"
},
{
"difficulty": "hard",
"number": 25,
"premium": false,
"slug": "reverse-nodes-in-k-group",
"title": "Reverse Nodes in k-Group",
"topics": [
"linked-list",
"recursion"
],
"url": "https://leetcode.com/problems/reverse-nodes-in-k-group/"
},
{
"difficulty": "medium",
"number": 19,
"premium": false,
"slug": "remove-nth-node-from-end-of-list",
"title": "Remove Nth Node From End of List",
"topics": [
"linked-list",
"two-pointers"
],
"url": "https://leetcode.com/problems/remove-nth-node-from-end-of-list/"
},
{
"difficulty": "medium",
"number": 82,
"premium": false,
"slug": "remove-duplicates-from-sorted-list-ii",
"title": "Remove Duplicates from Sorted List II",
"topics": [
"linked-list",
"two-pointers"
],
"url": "https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/"
},
{
"difficulty": "medium",
"number": 61,
"premium": false,
"slug": "rotate-list",
"title": "Rotate List",
"topics": [
"linked-list",
"two-pointers"
],
"url": "https://leetcode.com/problems/rotate-list/"
},
{
"difficulty": "medium",
"number": 86,
"premium": false,
"slug": "partition-list",
"title": "Partition List",
"topics": [
"linked-list",
"two-pointers"
],
"url": "https://leetcode.com/problems/partition-list/"
},
{
"difficulty": "medium",
"number": 146,
"premium": false,
"slug": "lru-cache",
"title": "LRU Cache",
"topics": [
"hash-table",
"linked-list",
"design",
"doubly-linked-list"
],
"url": "https://leetcode.com/problems/lru-cache/"
}
],
"problems_count": 11,
"slug": "top-interview-150-8-rvcb"
},
{
"name": "Binary Tree General",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 104,
"premium": false,
"slug": "maximum-depth-of-binary-tree",
"title": "Maximum Depth of Binary Tree",
"topics": [
"tree",
"depth-first-search",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/maximum-depth-of-binary-tree/"
},
{
"difficulty": "easy",
"number": 100,
"premium": false,
"slug": "same-tree",
"title": "Same Tree",
"topics": [
"tree",
"depth-first-search",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/same-tree/"
},
{
"difficulty": "easy",
"number": 226,
"premium": false,
"slug": "invert-binary-tree",
"title": "Invert Binary Tree",
"topics": [
"tree",
"depth-first-search",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/invert-binary-tree/"
},
{
"difficulty": "easy",
"number": 101,
"premium": false,
"slug": "symmetric-tree",
"title": "Symmetric Tree",
"topics": [
"tree",
"depth-first-search",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/symmetric-tree/"
},
{
"difficulty": "medium",
"number": 105,
"premium": false,
"slug": "construct-binary-tree-from-preorder-and-inorder-traversal",
"title": "Construct Binary Tree from Preorder and Inorder Traversal",
"topics": [
"array",
"hash-table",
"divide-and-conquer",
"tree",
"binary-tree"
],
"url": "https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/"
},
{
"difficulty": "medium",
"number": 106,
"premium": false,
"slug": "construct-binary-tree-from-inorder-and-postorder-traversal",
"title": "Construct Binary Tree from Inorder and Postorder Traversal",
"topics": [
"array",
"hash-table",
"divide-and-conquer",
"tree",
"binary-tree"
],
"url": "https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/"
},
{
"difficulty": "medium",
"number": 117,
"premium": false,
"slug": "populating-next-right-pointers-in-each-node-ii",
"title": "Populating Next Right Pointers in Each Node II",
"topics": [
"linked-list",
"tree",
"depth-first-search",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/"
},
{
"difficulty": "medium",
"number": 114,
"premium": false,
"slug": "flatten-binary-tree-to-linked-list",
"title": "Flatten Binary Tree to Linked List",
"topics": [
"linked-list",
"stack",
"tree",
"depth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/flatten-binary-tree-to-linked-list/"
},
{
"difficulty": "easy",
"number": 112,
"premium": false,
"slug": "path-sum",
"title": "Path Sum",
"topics": [
"tree",
"depth-first-search",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/path-sum/"
},
{
"difficulty": "medium",
"number": 129,
"premium": false,
"slug": "sum-root-to-leaf-numbers",
"title": "Sum Root to Leaf Numbers",
"topics": [
"tree",
"depth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/sum-root-to-leaf-numbers/"
},
{
"difficulty": "hard",
"number": 124,
"premium": false,
"slug": "binary-tree-maximum-path-sum",
"title": "Binary Tree Maximum Path Sum",
"topics": [
"dynamic-programming",
"tree",
"depth-first-search",
"binary-tree",
"dp-on-trees"
],
"url": "https://leetcode.com/problems/binary-tree-maximum-path-sum/"
},
{
"difficulty": "medium",
"number": 173,
"premium": false,
"slug": "binary-search-tree-iterator",
"title": "Binary Search Tree Iterator",
"topics": [
"stack",
"tree",
"design",
"binary-search-tree",
"binary-tree",
"iterator"
],
"url": "https://leetcode.com/problems/binary-search-tree-iterator/"
},
{
"difficulty": "medium",
"number": 222,
"premium": false,
"slug": "count-complete-tree-nodes",
"title": "Count Complete Tree Nodes",
"topics": [
"binary-search",
"bit-manipulation",
"tree",
"binary-tree"
],
"url": "https://leetcode.com/problems/count-complete-tree-nodes/"
},
{
"difficulty": "medium",
"number": 236,
"premium": false,
"slug": "lowest-common-ancestor-of-a-binary-tree",
"title": "Lowest Common Ancestor of a Binary Tree",
"topics": [
"tree",
"depth-first-search",
"binary-tree",
"binary-lifting",
"lowest-common-ancestor"
],
"url": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/"
}
],
"problems_count": 14,
"slug": "top-interview-150-9-ozek"
},
{
"name": "Binary Tree BFS",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 199,
"premium": false,
"slug": "binary-tree-right-side-view",
"title": "Binary Tree Right Side View",
"topics": [
"tree",
"depth-first-search",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/binary-tree-right-side-view/"
},
{
"difficulty": "easy",
"number": 637,
"premium": false,
"slug": "average-of-levels-in-binary-tree",
"title": "Average of Levels in Binary Tree",
"topics": [
"tree",
"depth-first-search",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/average-of-levels-in-binary-tree/"
},
{
"difficulty": "medium",
"number": 102,
"premium": false,
"slug": "binary-tree-level-order-traversal",
"title": "Binary Tree Level Order Traversal",
"topics": [
"tree",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/binary-tree-level-order-traversal/"
},
{
"difficulty": "medium",
"number": 103,
"premium": false,
"slug": "binary-tree-zigzag-level-order-traversal",
"title": "Binary Tree Zigzag Level Order Traversal",
"topics": [
"tree",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/"
}
],
"problems_count": 4,
"slug": "top-interview-150-10-ibmi"
},
{
"name": "Binary Search Tree",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 530,
"premium": false,
"slug": "minimum-absolute-difference-in-bst",
"title": "Minimum Absolute Difference in BST",
"topics": [
"tree",
"depth-first-search",
"breadth-first-search",
"binary-search-tree",
"binary-tree"
],
"url": "https://leetcode.com/problems/minimum-absolute-difference-in-bst/"
},
{
"difficulty": "medium",
"number": 230,
"premium": false,
"slug": "kth-smallest-element-in-a-bst",
"title": "Kth Smallest Element in a BST",
"topics": [
"tree",
"depth-first-search",
"binary-search-tree",
"binary-tree"
],
"url": "https://leetcode.com/problems/kth-smallest-element-in-a-bst/"
},
{
"difficulty": "medium",
"number": 98,
"premium": false,
"slug": "validate-binary-search-tree",
"title": "Validate Binary Search Tree",
"topics": [
"tree",
"depth-first-search",
"binary-search-tree",
"binary-tree"
],
"url": "https://leetcode.com/problems/validate-binary-search-tree/"
}
],
"problems_count": 3,
"slug": "top-interview-150-11-z3y5"
},
{
"name": "Graph General",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 200,
"premium": false,
"slug": "number-of-islands",
"title": "Number of Islands",
"topics": [
"array",
"depth-first-search",
"breadth-first-search",
"union-find",
"matrix"
],
"url": "https://leetcode.com/problems/number-of-islands/"
},
{
"difficulty": "medium",
"number": 130,
"premium": false,
"slug": "surrounded-regions",
"title": "Surrounded Regions",
"topics": [
"array",
"depth-first-search",
"breadth-first-search",
"union-find",
"matrix"
],
"url": "https://leetcode.com/problems/surrounded-regions/"
},
{
"difficulty": "medium",
"number": 133,
"premium": false,
"slug": "clone-graph",
"title": "Clone Graph",
"topics": [
"hash-table",
"depth-first-search",
"breadth-first-search",
"graph"
],
"url": "https://leetcode.com/problems/clone-graph/"
},
{
"difficulty": "medium",
"number": 399,
"premium": false,
"slug": "evaluate-division",
"title": "Evaluate Division",
"topics": [
"array",
"string",
"depth-first-search",
"breadth-first-search",
"union-find",
"graph",
"shortest-path",
"bellman-ford-algorithm",
"floyd-warshall-algorithm"
],
"url": "https://leetcode.com/problems/evaluate-division/"
},
{
"difficulty": "medium",
"number": 207,
"premium": false,
"slug": "course-schedule",
"title": "Course Schedule",
"topics": [
"depth-first-search",
"breadth-first-search",
"graph",
"topological-sort",
"directed-acyclic-graph"
],
"url": "https://leetcode.com/problems/course-schedule/"
},
{
"difficulty": "medium",
"number": 210,
"premium": false,
"slug": "course-schedule-ii",
"title": "Course Schedule II",
"topics": [
"depth-first-search",
"breadth-first-search",
"graph",
"topological-sort"
],
"url": "https://leetcode.com/problems/course-schedule-ii/"
}
],
"problems_count": 6,
"slug": "top-interview-150-12-7djr"
},
{
"name": "Graph BFS",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 909,
"premium": false,
"slug": "snakes-and-ladders",
"title": "Snakes and Ladders",
"topics": [
"array",
"breadth-first-search",
"matrix"
],
"url": "https://leetcode.com/problems/snakes-and-ladders/"
},
{
"difficulty": "medium",
"number": 433,
"premium": false,
"slug": "minimum-genetic-mutation",
"title": "Minimum Genetic Mutation",
"topics": [
"hash-table",
"string",
"breadth-first-search",
"bidirectional-search"
],
"url": "https://leetcode.com/problems/minimum-genetic-mutation/"
},
{
"difficulty": "hard",
"number": 127,
"premium": false,
"slug": "word-ladder",
"title": "Word Ladder",
"topics": [
"hash-table",
"string",
"breadth-first-search",
"bidirectional-search"
],
"url": "https://leetcode.com/problems/word-ladder/"
}
],
"problems_count": 3,
"slug": "top-interview-150-13-9z8t"
},
{
"name": "Trie",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 208,
"premium": false,
"slug": "implement-trie-prefix-tree",
"title": "Implement Trie (Prefix Tree)",
"topics": [
"hash-table",
"string",
"design",
"trie"
],
"url": "https://leetcode.com/problems/implement-trie-prefix-tree/"
},
{
"difficulty": "medium",
"number": 211,
"premium": false,
"slug": "design-add-and-search-words-data-structure",
"title": "Design Add and Search Words Data Structure",
"topics": [
"string",
"depth-first-search",
"design",
"trie"
],
"url": "https://leetcode.com/problems/design-add-and-search-words-data-structure/"
},
{
"difficulty": "hard",
"number": 212,
"premium": false,
"slug": "word-search-ii",
"title": "Word Search II",
"topics": [
"array",
"string",
"backtracking",
"trie",
"matrix"
],
"url": "https://leetcode.com/problems/word-search-ii/"
}
],
"problems_count": 3,
"slug": "top-interview-150-14-lih2"
},
{
"name": "Backtracking",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 17,
"premium": false,
"slug": "letter-combinations-of-a-phone-number",
"title": "Letter Combinations of a Phone Number",
"topics": [
"hash-table",
"string",
"backtracking"
],
"url": "https://leetcode.com/problems/letter-combinations-of-a-phone-number/"
},
{
"difficulty": "medium",
"number": 77,
"premium": false,
"slug": "combinations",
"title": "Combinations",
"topics": [
"backtracking"
],
"url": "https://leetcode.com/problems/combinations/"
},
{
"difficulty": "medium",
"number": 46,
"premium": false,
"slug": "permutations",
"title": "Permutations",
"topics": [
"array",
"backtracking"
],
"url": "https://leetcode.com/problems/permutations/"
},
{
"difficulty": "medium",
"number": 39,
"premium": false,
"slug": "combination-sum",
"title": "Combination Sum",
"topics": [
"array",
"backtracking"
],
"url": "https://leetcode.com/problems/combination-sum/"
},
{
"difficulty": "hard",
"number": 52,
"premium": false,
"slug": "n-queens-ii",
"title": "N-Queens II",
"topics": [
"backtracking",
"algorithm-x"
],
"url": "https://leetcode.com/problems/n-queens-ii/"
},
{
"difficulty": "medium",
"number": 22,
"premium": false,
"slug": "generate-parentheses",
"title": "Generate Parentheses",
"topics": [
"string",
"dynamic-programming",
"backtracking",
"bracket-sequences"
],
"url": "https://leetcode.com/problems/generate-parentheses/"
},
{
"difficulty": "medium",
"number": 79,
"premium": false,
"slug": "word-search",
"title": "Word Search",
"topics": [
"array",
"string",
"backtracking",
"depth-first-search",
"matrix"
],
"url": "https://leetcode.com/problems/word-search/"
}
],
"problems_count": 7,
"slug": "top-interview-150-15-rpt9"
},
{
"name": "Divide & Conquer",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 108,
"premium": false,
"slug": "convert-sorted-array-to-binary-search-tree",
"title": "Convert Sorted Array to Binary Search Tree",
"topics": [
"array",
"divide-and-conquer",
"tree",
"binary-search-tree",
"binary-tree"
],
"url": "https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/"
},
{
"difficulty": "medium",
"number": 148,
"premium": false,
"slug": "sort-list",
"title": "Sort List",
"topics": [
"linked-list",
"two-pointers",
"divide-and-conquer",
"sorting",
"merge-sort"
],
"url": "https://leetcode.com/problems/sort-list/"
},
{
"difficulty": "medium",
"number": 427,
"premium": false,
"slug": "construct-quad-tree",
"title": "Construct Quad Tree",
"topics": [
"array",
"divide-and-conquer",
"tree",
"matrix"
],
"url": "https://leetcode.com/problems/construct-quad-tree/"
},
{
"difficulty": "hard",
"number": 23,
"premium": false,
"slug": "merge-k-sorted-lists",
"title": "Merge k Sorted Lists",
"topics": [
"linked-list",
"divide-and-conquer",
"heap-priority-queue",
"merge-sort",
"tournament-sort"
],
"url": "https://leetcode.com/problems/merge-k-sorted-lists/"
}
],
"problems_count": 4,
"slug": "top-interview-150-16-z95i"
},
{
"name": "Kadane's Algorithm",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 53,
"premium": false,
"slug": "maximum-subarray",
"title": "Maximum Subarray",
"topics": [
"array",
"divide-and-conquer",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/maximum-subarray/"
},
{
"difficulty": "medium",
"number": 918,
"premium": false,
"slug": "maximum-sum-circular-subarray",
"title": "Maximum Sum Circular Subarray",
"topics": [
"array",
"divide-and-conquer",
"dynamic-programming",
"queue",
"monotonic-queue"
],
"url": "https://leetcode.com/problems/maximum-sum-circular-subarray/"
}
],
"problems_count": 2,
"slug": "top-interview-150-17-tjhz"
},
{
"name": "Binary Search",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 35,
"premium": false,
"slug": "search-insert-position",
"title": "Search Insert Position",
"topics": [
"array",
"binary-search"
],
"url": "https://leetcode.com/problems/search-insert-position/"
},
{
"difficulty": "medium",
"number": 74,
"premium": false,
"slug": "search-a-2d-matrix",
"title": "Search a 2D Matrix",
"topics": [
"array",
"binary-search",
"matrix"
],
"url": "https://leetcode.com/problems/search-a-2d-matrix/"
},
{
"difficulty": "medium",
"number": 162,
"premium": false,
"slug": "find-peak-element",
"title": "Find Peak Element",
"topics": [
"array",
"binary-search"
],
"url": "https://leetcode.com/problems/find-peak-element/"
},
{
"difficulty": "medium",
"number": 33,
"premium": false,
"slug": "search-in-rotated-sorted-array",
"title": "Search in Rotated Sorted Array",
"topics": [
"array",
"binary-search"
],
"url": "https://leetcode.com/problems/search-in-rotated-sorted-array/"
},
{
"difficulty": "medium",
"number": 34,
"premium": false,
"slug": "find-first-and-last-position-of-element-in-sorted-array",
"title": "Find First and Last Position of Element in Sorted Array",
"topics": [
"array",
"binary-search"
],
"url": "https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/"
},
{
"difficulty": "medium",
"number": 153,
"premium": false,
"slug": "find-minimum-in-rotated-sorted-array",
"title": "Find Minimum in Rotated Sorted Array",
"topics": [
"array",
"binary-search"
],
"url": "https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/"
},
{
"difficulty": "hard",
"number": 4,
"premium": false,
"slug": "median-of-two-sorted-arrays",
"title": "Median of Two Sorted Arrays",
"topics": [
"array",
"binary-search",
"divide-and-conquer"
],
"url": "https://leetcode.com/problems/median-of-two-sorted-arrays/"
}
],
"problems_count": 7,
"slug": "top-interview-150-18-quur"
},
{
"name": "Heap",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 215,
"premium": false,
"slug": "kth-largest-element-in-an-array",
"title": "Kth Largest Element in an Array",
"topics": [
"array",
"divide-and-conquer",
"sorting",
"heap-priority-queue",
"quickselect"
],
"url": "https://leetcode.com/problems/kth-largest-element-in-an-array/"
},
{
"difficulty": "hard",
"number": 502,
"premium": false,
"slug": "ipo",
"title": "IPO",
"topics": [
"array",
"greedy",
"sorting",
"heap-priority-queue"
],
"url": "https://leetcode.com/problems/ipo/"
},
{
"difficulty": "medium",
"number": 373,
"premium": false,
"slug": "find-k-pairs-with-smallest-sums",
"title": "Find K Pairs with Smallest Sums",
"topics": [
"array",
"heap-priority-queue"
],
"url": "https://leetcode.com/problems/find-k-pairs-with-smallest-sums/"
},
{
"difficulty": "hard",
"number": 295,
"premium": false,
"slug": "find-median-from-data-stream",
"title": "Find Median from Data Stream",
"topics": [
"two-pointers",
"design",
"sorting",
"heap-priority-queue",
"data-stream"
],
"url": "https://leetcode.com/problems/find-median-from-data-stream/"
}
],
"problems_count": 4,
"slug": "top-interview-150-19-w23l"
},
{
"name": "Bit Manipulation",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 67,
"premium": false,
"slug": "add-binary",
"title": "Add Binary",
"topics": [
"math",
"string",
"bit-manipulation",
"simulation"
],
"url": "https://leetcode.com/problems/add-binary/"
},
{
"difficulty": "easy",
"number": 190,
"premium": false,
"slug": "reverse-bits",
"title": "Reverse Bits",
"topics": [
"divide-and-conquer",
"bit-manipulation"
],
"url": "https://leetcode.com/problems/reverse-bits/"
},
{
"difficulty": "easy",
"number": 191,
"premium": false,
"slug": "number-of-1-bits",
"title": "Number of 1 Bits",
"topics": [
"divide-and-conquer",
"bit-manipulation"
],
"url": "https://leetcode.com/problems/number-of-1-bits/"
},
{
"difficulty": "easy",
"number": 136,
"premium": false,
"slug": "single-number",
"title": "Single Number",
"topics": [
"array",
"bit-manipulation"
],
"url": "https://leetcode.com/problems/single-number/"
},
{
"difficulty": "medium",
"number": 137,
"premium": false,
"slug": "single-number-ii",
"title": "Single Number II",
"topics": [
"array",
"bit-manipulation"
],
"url": "https://leetcode.com/problems/single-number-ii/"
},
{
"difficulty": "medium",
"number": 201,
"premium": false,
"slug": "bitwise-and-of-numbers-range",
"title": "Bitwise AND of Numbers Range",
"topics": [
"bit-manipulation"
],
"url": "https://leetcode.com/problems/bitwise-and-of-numbers-range/"
}
],
"problems_count": 6,
"slug": "top-interview-150-20-m490"
},
{
"name": "Math",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 9,
"premium": false,
"slug": "palindrome-number",
"title": "Palindrome Number",
"topics": [
"math"
],
"url": "https://leetcode.com/problems/palindrome-number/"
},
{
"difficulty": "easy",
"number": 66,
"premium": false,
"slug": "plus-one",
"title": "Plus One",
"topics": [
"array",
"math"
],
"url": "https://leetcode.com/problems/plus-one/"
},
{
"difficulty": "medium",
"number": 172,
"premium": false,
"slug": "factorial-trailing-zeroes",
"title": "Factorial Trailing Zeroes",
"topics": [
"math"
],
"url": "https://leetcode.com/problems/factorial-trailing-zeroes/"
},
{
"difficulty": "easy",
"number": 69,
"premium": false,
"slug": "sqrtx",
"title": "Sqrt(x)",
"topics": [
"math",
"binary-search",
"newtons-method"
],
"url": "https://leetcode.com/problems/sqrtx/"
},
{
"difficulty": "medium",
"number": 50,
"premium": false,
"slug": "powx-n",
"title": "Pow(x, n)",
"topics": [
"math",
"recursion"
],
"url": "https://leetcode.com/problems/powx-n/"
},
{
"difficulty": "hard",
"number": 149,
"premium": false,
"slug": "max-points-on-a-line",
"title": "Max Points on a Line",
"topics": [
"array",
"hash-table",
"math",
"geometry",
"euclidean-algorithm",
"greatest-common-divisor"
],
"url": "https://leetcode.com/problems/max-points-on-a-line/"
}
],
"problems_count": 6,
"slug": "top-interview-150-21-098q"
},
{
"name": "1D DP",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 70,
"premium": false,
"slug": "climbing-stairs",
"title": "Climbing Stairs",
"topics": [
"math",
"dynamic-programming",
"memoization"
],
"url": "https://leetcode.com/problems/climbing-stairs/"
},
{
"difficulty": "medium",
"number": 198,
"premium": false,
"slug": "house-robber",
"title": "House Robber",
"topics": [
"array",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/house-robber/"
},
{
"difficulty": "medium",
"number": 139,
"premium": false,
"slug": "word-break",
"title": "Word Break",
"topics": [
"array",
"hash-table",
"string",
"dynamic-programming",
"trie",
"memoization",
"brute-force-search"
],
"url": "https://leetcode.com/problems/word-break/"
},
{
"difficulty": "medium",
"number": 322,
"premium": false,
"slug": "coin-change",
"title": "Coin Change",
"topics": [
"array",
"dynamic-programming",
"breadth-first-search",
"knapsack-problem",
"complete-knapsack"
],
"url": "https://leetcode.com/problems/coin-change/"
},
{
"difficulty": "medium",
"number": 300,
"premium": false,
"slug": "longest-increasing-subsequence",
"title": "Longest Increasing Subsequence",
"topics": [
"array",
"binary-search",
"dynamic-programming",
"longest-increasing-subsequence"
],
"url": "https://leetcode.com/problems/longest-increasing-subsequence/"
}
],
"problems_count": 5,
"slug": "top-interview-150-22-p3qn"
},
{
"name": "Multidimensional DP",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 120,
"premium": false,
"slug": "triangle",
"title": "Triangle",
"topics": [
"array",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/triangle/"
},
{
"difficulty": "medium",
"number": 64,
"premium": false,
"slug": "minimum-path-sum",
"title": "Minimum Path Sum",
"topics": [
"array",
"dynamic-programming",
"matrix"
],
"url": "https://leetcode.com/problems/minimum-path-sum/"
},
{
"difficulty": "medium",
"number": 63,
"premium": false,
"slug": "unique-paths-ii",
"title": "Unique Paths II",
"topics": [
"array",
"dynamic-programming",
"matrix"
],
"url": "https://leetcode.com/problems/unique-paths-ii/"
},
{
"difficulty": "medium",
"number": 5,
"premium": false,
"slug": "longest-palindromic-substring",
"title": "Longest Palindromic Substring",
"topics": [
"two-pointers",
"string",
"dynamic-programming",
"manacher"
],
"url": "https://leetcode.com/problems/longest-palindromic-substring/"
},
{
"difficulty": "medium",
"number": 97,
"premium": false,
"slug": "interleaving-string",
"title": "Interleaving String",
"topics": [
"string",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/interleaving-string/"
},
{
"difficulty": "medium",
"number": 72,
"premium": false,
"slug": "edit-distance",
"title": "Edit Distance",
"topics": [
"string",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/edit-distance/"
},
{
"difficulty": "hard",
"number": 123,
"premium": false,
"slug": "best-time-to-buy-and-sell-stock-iii",
"title": "Best Time to Buy and Sell Stock III",
"topics": [
"array",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/"
},
{
"difficulty": "hard",
"number": 188,
"premium": false,
"slug": "best-time-to-buy-and-sell-stock-iv",
"title": "Best Time to Buy and Sell Stock IV",
"topics": [
"array",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/"
},
{
"difficulty": "medium",
"number": 221,
"premium": false,
"slug": "maximal-square",
"title": "Maximal Square",
"topics": [
"array",
"dynamic-programming",
"matrix"
],
"url": "https://leetcode.com/problems/maximal-square/"
}
],
"problems_count": 9,
"slug": "top-interview-150-23-cpbf"
}
],
"highlight": "Must-do List for Interview Prep",
"name": "Top Interview 150",
"premium_only": false,
"problems_count": 150,
"related": [
{
"highlight": "Ace Coding Interview with 75 Qs",
"name": "LeetCode 75",
"premium_only": false,
"slug": "leetcode-75"
},
{
"highlight": "100 Best Rated Problems",
"name": "Top 100 Liked",
"premium_only": false,
"slug": "top-100-liked"
},
{
"highlight": "LeetCode Staff Pick",
"name": "Premium Algo 100",
"premium_only": true,
"slug": "premium-algo-100"
},
{
"highlight": "Excel Implementation Skills in 50 Qs",
"name": "Programming Skills",
"premium_only": false,
"slug": "programming-skills"
}
],
"slug": "top-interview-150",
"url": "https://leetcode.com/studyplan/top-interview-150/"
}Composite rule pricing
Calculated from input parameters and actual returned quantities. Estimate the maximum cost before calling.
Base fee: $0.000000. One matching variant replaces the base fee. Matching add-ons and quantity charges are added.
| Fee item | Price | Metering source | When | Quantity limit |
|---|---|---|---|---|
| Actual API.SH credits consumed | $0.002000 / billing credit | Response · /credits_used · Numeric value | Always | 1 billing credit · Decimal places: 0 |
Each quantity charge is rounded before summing: ceil. Requests exceeding this cost limit are rejected; it is not a price cap: $0.002000.
Response quantities settle after the response. Before execution, the maximum quantity determines the reservation; unused reservation is released. Missing or invalid quantities are not treated as zero.
Pricing parameters and defaults
[]
Agent integration
Copy the resource contract without sharing an API key.
View API Markdown
# LeetCode study plans API
Use the LeetCode study plans API to retrieve problem metadata, grouped result tables, record identities and titles and source-page links as structured JSON from LeetCode. Choose record slug as optional query conditions to select the source records or view required for your request. Use these results to choose programming exercises by difficulty or topic and connect study plans with problem references. The documented source-page link form identifies the requested entry directly and lets you reuse an existing source-page reference. The detail page includes parameter definitions, paired request and response examples, and usage pricing for this operation.
## Available implementations
apish · LeetCode study plans API: https://openany.si/markets/apis/capabilities/leetcode-study-plans-api?offering=322b66bd-cf6c-4225-9611-8929265fd59f · $0.002 / billing credit
## Selected API contract
Documentation: https://openany.si/markets/apis/capabilities/leetcode-study-plans-api
Method: GET
Endpoint: https://api.openany.si/v1/agent-apis/apish/leetcode/v1/study-plan
Price: $0.002 / billing credit
Provider: apish
Contract revision: 2
Price source: OpenAny public API contract and documented provider unit rates. Price update time: not supplied.
Use OPENANY_API_KEY from the environment. API Key calls use your shared balance.
## Prepared request
```bash
curl \
'https://api.openany.si/v1/agent-apis/apish/leetcode/v1/study-plan?output=json&raw=0&slug=top-interview-150' \
-X GET \
-H "Authorization: Bearer $OPENANY_API_KEY" \
-H 'Content-Type: application/json'
```
## API contract
```json
{
"resource_type": "api",
"name": "LeetCode study plans API",
"endpoint": "https://api.openany.si/v1/agent-apis/apish/leetcode/v1/study-plan",
"method": "GET",
"content_type": "none",
"execution_mode": "sync",
"authentication": {
"type": "bearer",
"environment_variable": "OPENANY_API_KEY"
},
"inputs": [
{
"description": "Study plan slug or leetcode.com/studyplan/<slug>/ link; empty lists all plans.",
"location": "query",
"name": "slug",
"nullable": false,
"required": false,
"type": "string"
},
{
"description": "0 leaves out the bulky `raw` source blocks (often 10-30x smaller).",
"enum_values": [
"0",
"1"
],
"location": "query",
"name": "raw",
"nullable": false,
"required": false,
"type": "string"
},
{
"description": "Comma-separated fields to return, e.g. `posts.id,posts.title`. Call metadata is always included.",
"location": "query",
"name": "fields",
"nullable": false,
"required": false,
"type": "string"
},
{
"description": "1 skips the 24-hour cache and fetches live.",
"enum_values": [
"1"
],
"location": "query",
"name": "fresh",
"nullable": false,
"required": false,
"type": "string"
},
{
"description": "JSON only for this OpenAny product. Omit output or use json; CSV and NDJSON are not supported.",
"enum_values": [
"json"
],
"location": "query",
"name": "output",
"nullable": false,
"required": false,
"type": "string"
},
{
"description": "With output=csv|ndjson: the top-level list to turn into rows (e.g. `reviews`), or `.` for the whole object as one row.",
"location": "query",
"name": "records",
"nullable": false,
"required": false,
"type": "string"
}
],
"billing": {
"currency": "USD",
"mode": "rules",
"parameters": [],
"policy_version": 2,
"sale": {
"addons": [],
"base_price_micro_usd": "0",
"max_cost_micro_usd": "2000",
"quantities": [
{
"id": "upstream_credits",
"label": "Actual API.SH credits consumed",
"max_quantity": "1",
"measure": "value",
"pointer": "/credits_used",
"price_micro_usd": "2000",
"quantity_scale": 0,
"source": "response",
"unit": "credit",
"unit_quantity": "1"
}
],
"rounding": "ceil",
"variants": []
}
},
"examples": [
{
"http_status": 200,
"name": "Official example · Live API.SH response · Minimal request",
"request": {
"body": null,
"headers": {},
"path": {},
"query": {
"output": "json",
"raw": "0",
"slug": "top-interview-150"
}
},
"response_body": {
"award": {
"description": "Complete the study plan to win the badge!",
"icon": "https://assets.leetcode.com/static_assets/others/Top_100_Liked-1.png",
"icon_gif": "https://assets.leetcode.com/static_assets/others/Top_Interview_150.gif",
"name": "Top Interview 150"
},
"cached": false,
"cover": "https://assets.leetcode.com/static_assets/others/Top_Interview_150_static_cover_picture.png",
"credits_used": 1,
"description": "150 Original & Classic Questions\r\nCovers comprehensive interview topics\r\nBest for 3+ months of prep time\r\nProblems support high-quality editorials",
"fetched_at": "2026-11-19T12:29:42.263Z",
"groups": [
{
"name": "Array / String",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 88,
"premium": false,
"slug": "merge-sorted-array",
"title": "Merge Sorted Array",
"topics": [
"array",
"two-pointers",
"sorting"
],
"url": "https://leetcode.com/problems/merge-sorted-array/"
},
{
"difficulty": "easy",
"number": 27,
"premium": false,
"slug": "remove-element",
"title": "Remove Element",
"topics": [
"array",
"two-pointers"
],
"url": "https://leetcode.com/problems/remove-element/"
},
{
"difficulty": "easy",
"number": 26,
"premium": false,
"slug": "remove-duplicates-from-sorted-array",
"title": "Remove Duplicates from Sorted Array",
"topics": [
"array",
"two-pointers"
],
"url": "https://leetcode.com/problems/remove-duplicates-from-sorted-array/"
},
{
"difficulty": "medium",
"number": 80,
"premium": false,
"slug": "remove-duplicates-from-sorted-array-ii",
"title": "Remove Duplicates from Sorted Array II",
"topics": [
"array",
"two-pointers"
],
"url": "https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/"
},
{
"difficulty": "easy",
"number": 169,
"premium": false,
"slug": "majority-element",
"title": "Majority Element",
"topics": [
"array",
"hash-table",
"divide-and-conquer",
"sorting",
"counting",
"boyer-moore-majority-vote-algorithm"
],
"url": "https://leetcode.com/problems/majority-element/"
},
{
"difficulty": "medium",
"number": 189,
"premium": false,
"slug": "rotate-array",
"title": "Rotate Array",
"topics": [
"array",
"math",
"two-pointers"
],
"url": "https://leetcode.com/problems/rotate-array/"
},
{
"difficulty": "easy",
"number": 121,
"premium": false,
"slug": "best-time-to-buy-and-sell-stock",
"title": "Best Time to Buy and Sell Stock",
"topics": [
"array",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock/"
},
{
"difficulty": "medium",
"number": 122,
"premium": false,
"slug": "best-time-to-buy-and-sell-stock-ii",
"title": "Best Time to Buy and Sell Stock II",
"topics": [
"array",
"dynamic-programming",
"greedy"
],
"url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/"
},
{
"difficulty": "medium",
"number": 55,
"premium": false,
"slug": "jump-game",
"title": "Jump Game",
"topics": [
"array",
"dynamic-programming",
"greedy"
],
"url": "https://leetcode.com/problems/jump-game/"
},
{
"difficulty": "medium",
"number": 45,
"premium": false,
"slug": "jump-game-ii",
"title": "Jump Game II",
"topics": [
"array",
"dynamic-programming",
"greedy"
],
"url": "https://leetcode.com/problems/jump-game-ii/"
},
{
"difficulty": "medium",
"number": 274,
"premium": false,
"slug": "h-index",
"title": "H-Index",
"topics": [
"array",
"sorting",
"counting-sort"
],
"url": "https://leetcode.com/problems/h-index/"
},
{
"difficulty": "medium",
"number": 380,
"premium": false,
"slug": "insert-delete-getrandom-o1",
"title": "Insert Delete GetRandom O(1)",
"topics": [
"array",
"hash-table",
"math",
"design",
"randomized"
],
"url": "https://leetcode.com/problems/insert-delete-getrandom-o1/"
},
{
"difficulty": "medium",
"number": 238,
"premium": false,
"slug": "product-of-array-except-self",
"title": "Product of Array Except Self",
"topics": [
"array",
"prefix-sum"
],
"url": "https://leetcode.com/problems/product-of-array-except-self/"
},
{
"difficulty": "medium",
"number": 134,
"premium": false,
"slug": "gas-station",
"title": "Gas Station",
"topics": [
"array",
"greedy"
],
"url": "https://leetcode.com/problems/gas-station/"
},
{
"difficulty": "hard",
"number": 135,
"premium": false,
"slug": "candy",
"title": "Candy",
"topics": [
"array",
"greedy"
],
"url": "https://leetcode.com/problems/candy/"
},
{
"difficulty": "hard",
"number": 42,
"premium": false,
"slug": "trapping-rain-water",
"title": "Trapping Rain Water",
"topics": [
"array",
"two-pointers",
"dynamic-programming",
"stack",
"monotonic-stack"
],
"url": "https://leetcode.com/problems/trapping-rain-water/"
},
{
"difficulty": "easy",
"number": 13,
"premium": false,
"slug": "roman-to-integer",
"title": "Roman to Integer",
"topics": [
"hash-table",
"math",
"string"
],
"url": "https://leetcode.com/problems/roman-to-integer/"
},
{
"difficulty": "medium",
"number": 12,
"premium": false,
"slug": "integer-to-roman",
"title": "Integer to Roman",
"topics": [
"hash-table",
"math",
"string"
],
"url": "https://leetcode.com/problems/integer-to-roman/"
},
{
"difficulty": "easy",
"number": 58,
"premium": false,
"slug": "length-of-last-word",
"title": "Length of Last Word",
"topics": [
"string"
],
"url": "https://leetcode.com/problems/length-of-last-word/"
},
{
"difficulty": "easy",
"number": 14,
"premium": false,
"slug": "longest-common-prefix",
"title": "Longest Common Prefix",
"topics": [
"array",
"string",
"trie"
],
"url": "https://leetcode.com/problems/longest-common-prefix/"
},
{
"difficulty": "medium",
"number": 151,
"premium": false,
"slug": "reverse-words-in-a-string",
"title": "Reverse Words in a String",
"topics": [
"two-pointers",
"string"
],
"url": "https://leetcode.com/problems/reverse-words-in-a-string/"
},
{
"difficulty": "medium",
"number": 6,
"premium": false,
"slug": "zigzag-conversion",
"title": "Zigzag Conversion",
"topics": [
"string"
],
"url": "https://leetcode.com/problems/zigzag-conversion/"
},
{
"difficulty": "easy",
"number": 28,
"premium": false,
"slug": "find-the-index-of-the-first-occurrence-in-a-string",
"title": "Find the Index of the First Occurrence in a String",
"topics": [
"two-pointers",
"string",
"string-matching",
"z-algorithm",
"knuth-morris-pratt-algorithm",
"boyer-moore-string-search-algorithm"
],
"url": "https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/"
},
{
"difficulty": "hard",
"number": 68,
"premium": false,
"slug": "text-justification",
"title": "Text Justification",
"topics": [
"array",
"string",
"simulation"
],
"url": "https://leetcode.com/problems/text-justification/"
}
],
"problems_count": 24,
"slug": "top-interview-150-1-yf91"
},
{
"name": "Two Pointers",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 125,
"premium": false,
"slug": "valid-palindrome",
"title": "Valid Palindrome",
"topics": [
"two-pointers",
"string"
],
"url": "https://leetcode.com/problems/valid-palindrome/"
},
{
"difficulty": "easy",
"number": 392,
"premium": false,
"slug": "is-subsequence",
"title": "Is Subsequence",
"topics": [
"two-pointers",
"string",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/is-subsequence/"
},
{
"difficulty": "medium",
"number": 167,
"premium": false,
"slug": "two-sum-ii-input-array-is-sorted",
"title": "Two Sum II - Input Array Is Sorted",
"topics": [
"array",
"two-pointers",
"binary-search"
],
"url": "https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/"
},
{
"difficulty": "medium",
"number": 11,
"premium": false,
"slug": "container-with-most-water",
"title": "Container With Most Water",
"topics": [
"array",
"two-pointers",
"greedy"
],
"url": "https://leetcode.com/problems/container-with-most-water/"
},
{
"difficulty": "medium",
"number": 15,
"premium": false,
"slug": "3sum",
"title": "3Sum",
"topics": [
"array",
"two-pointers",
"sorting"
],
"url": "https://leetcode.com/problems/3sum/"
}
],
"problems_count": 5,
"slug": "top-interview-150-2-o7jr"
},
{
"name": "Sliding Window",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 209,
"premium": false,
"slug": "minimum-size-subarray-sum",
"title": "Minimum Size Subarray Sum",
"topics": [
"array",
"binary-search",
"sliding-window",
"prefix-sum"
],
"url": "https://leetcode.com/problems/minimum-size-subarray-sum/"
},
{
"difficulty": "medium",
"number": 3,
"premium": false,
"slug": "longest-substring-without-repeating-characters",
"title": "Longest Substring Without Repeating Characters",
"topics": [
"hash-table",
"string",
"sliding-window"
],
"url": "https://leetcode.com/problems/longest-substring-without-repeating-characters/"
},
{
"difficulty": "hard",
"number": 30,
"premium": false,
"slug": "substring-with-concatenation-of-all-words",
"title": "Substring with Concatenation of All Words",
"topics": [
"hash-table",
"string",
"sliding-window"
],
"url": "https://leetcode.com/problems/substring-with-concatenation-of-all-words/"
},
{
"difficulty": "hard",
"number": 76,
"premium": false,
"slug": "minimum-window-substring",
"title": "Minimum Window Substring",
"topics": [
"hash-table",
"string",
"sliding-window"
],
"url": "https://leetcode.com/problems/minimum-window-substring/"
}
],
"problems_count": 4,
"slug": "top-interview-150-3-h81e"
},
{
"name": "Matrix",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 36,
"premium": false,
"slug": "valid-sudoku",
"title": "Valid Sudoku",
"topics": [
"array",
"hash-table",
"matrix"
],
"url": "https://leetcode.com/problems/valid-sudoku/"
},
{
"difficulty": "medium",
"number": 54,
"premium": false,
"slug": "spiral-matrix",
"title": "Spiral Matrix",
"topics": [
"array",
"matrix",
"simulation"
],
"url": "https://leetcode.com/problems/spiral-matrix/"
},
{
"difficulty": "medium",
"number": 48,
"premium": false,
"slug": "rotate-image",
"title": "Rotate Image",
"topics": [
"array",
"math",
"matrix"
],
"url": "https://leetcode.com/problems/rotate-image/"
},
{
"difficulty": "medium",
"number": 73,
"premium": false,
"slug": "set-matrix-zeroes",
"title": "Set Matrix Zeroes",
"topics": [
"array",
"hash-table",
"matrix"
],
"url": "https://leetcode.com/problems/set-matrix-zeroes/"
},
{
"difficulty": "medium",
"number": 289,
"premium": false,
"slug": "game-of-life",
"title": "Game of Life",
"topics": [
"array",
"matrix",
"simulation"
],
"url": "https://leetcode.com/problems/game-of-life/"
}
],
"problems_count": 5,
"slug": "top-interview-150-4-ukui"
},
{
"name": "Hashmap",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 383,
"premium": false,
"slug": "ransom-note",
"title": "Ransom Note",
"topics": [
"hash-table",
"string",
"counting"
],
"url": "https://leetcode.com/problems/ransom-note/"
},
{
"difficulty": "easy",
"number": 205,
"premium": false,
"slug": "isomorphic-strings",
"title": "Isomorphic Strings",
"topics": [
"hash-table",
"string"
],
"url": "https://leetcode.com/problems/isomorphic-strings/"
},
{
"difficulty": "easy",
"number": 290,
"premium": false,
"slug": "word-pattern",
"title": "Word Pattern",
"topics": [
"hash-table",
"string"
],
"url": "https://leetcode.com/problems/word-pattern/"
},
{
"difficulty": "easy",
"number": 242,
"premium": false,
"slug": "valid-anagram",
"title": "Valid Anagram",
"topics": [
"hash-table",
"string",
"sorting"
],
"url": "https://leetcode.com/problems/valid-anagram/"
},
{
"difficulty": "medium",
"number": 49,
"premium": false,
"slug": "group-anagrams",
"title": "Group Anagrams",
"topics": [
"array",
"hash-table",
"string",
"sorting"
],
"url": "https://leetcode.com/problems/group-anagrams/"
},
{
"difficulty": "easy",
"number": 1,
"premium": false,
"slug": "two-sum",
"title": "Two Sum",
"topics": [
"array",
"hash-table"
],
"url": "https://leetcode.com/problems/two-sum/"
},
{
"difficulty": "easy",
"number": 202,
"premium": false,
"slug": "happy-number",
"title": "Happy Number",
"topics": [
"hash-table",
"math",
"two-pointers",
"floyds-cycle-finding-algorithm"
],
"url": "https://leetcode.com/problems/happy-number/"
},
{
"difficulty": "easy",
"number": 219,
"premium": false,
"slug": "contains-duplicate-ii",
"title": "Contains Duplicate II",
"topics": [
"array",
"hash-table",
"sliding-window"
],
"url": "https://leetcode.com/problems/contains-duplicate-ii/"
},
{
"difficulty": "medium",
"number": 128,
"premium": false,
"slug": "longest-consecutive-sequence",
"title": "Longest Consecutive Sequence",
"topics": [
"array",
"hash-table",
"union-find"
],
"url": "https://leetcode.com/problems/longest-consecutive-sequence/"
}
],
"problems_count": 9,
"slug": "top-interview-150-5-nfzq"
},
{
"name": "Intervals",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 228,
"premium": false,
"slug": "summary-ranges",
"title": "Summary Ranges",
"topics": [
"array"
],
"url": "https://leetcode.com/problems/summary-ranges/"
},
{
"difficulty": "medium",
"number": 56,
"premium": false,
"slug": "merge-intervals",
"title": "Merge Intervals",
"topics": [
"array",
"sorting",
"quicksort"
],
"url": "https://leetcode.com/problems/merge-intervals/"
},
{
"difficulty": "medium",
"number": 57,
"premium": false,
"slug": "insert-interval",
"title": "Insert Interval",
"topics": [
"array"
],
"url": "https://leetcode.com/problems/insert-interval/"
},
{
"difficulty": "medium",
"number": 452,
"premium": false,
"slug": "minimum-number-of-arrows-to-burst-balloons",
"title": "Minimum Number of Arrows to Burst Balloons",
"topics": [
"array",
"greedy",
"sorting"
],
"url": "https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/"
}
],
"problems_count": 4,
"slug": "top-interview-150-6-ni2n"
},
{
"name": "Stack",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 20,
"premium": false,
"slug": "valid-parentheses",
"title": "Valid Parentheses",
"topics": [
"string",
"stack",
"bracket-sequences"
],
"url": "https://leetcode.com/problems/valid-parentheses/"
},
{
"difficulty": "medium",
"number": 71,
"premium": false,
"slug": "simplify-path",
"title": "Simplify Path",
"topics": [
"string",
"stack"
],
"url": "https://leetcode.com/problems/simplify-path/"
},
{
"difficulty": "medium",
"number": 155,
"premium": false,
"slug": "min-stack",
"title": "Min Stack",
"topics": [
"stack",
"design"
],
"url": "https://leetcode.com/problems/min-stack/"
},
{
"difficulty": "medium",
"number": 150,
"premium": false,
"slug": "evaluate-reverse-polish-notation",
"title": "Evaluate Reverse Polish Notation",
"topics": [
"array",
"math",
"stack"
],
"url": "https://leetcode.com/problems/evaluate-reverse-polish-notation/"
},
{
"difficulty": "hard",
"number": 224,
"premium": false,
"slug": "basic-calculator",
"title": "Basic Calculator",
"topics": [
"math",
"string",
"stack",
"recursion"
],
"url": "https://leetcode.com/problems/basic-calculator/"
}
],
"problems_count": 5,
"slug": "top-interview-150-7-x7pk"
},
{
"name": "Linked List",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 141,
"premium": false,
"slug": "linked-list-cycle",
"title": "Linked List Cycle",
"topics": [
"hash-table",
"linked-list",
"two-pointers",
"floyds-cycle-finding-algorithm"
],
"url": "https://leetcode.com/problems/linked-list-cycle/"
},
{
"difficulty": "medium",
"number": 2,
"premium": false,
"slug": "add-two-numbers",
"title": "Add Two Numbers",
"topics": [
"linked-list",
"math",
"recursion"
],
"url": "https://leetcode.com/problems/add-two-numbers/"
},
{
"difficulty": "easy",
"number": 21,
"premium": false,
"slug": "merge-two-sorted-lists",
"title": "Merge Two Sorted Lists",
"topics": [
"linked-list",
"recursion"
],
"url": "https://leetcode.com/problems/merge-two-sorted-lists/"
},
{
"difficulty": "medium",
"number": 138,
"premium": false,
"slug": "copy-list-with-random-pointer",
"title": "Copy List with Random Pointer",
"topics": [
"hash-table",
"linked-list"
],
"url": "https://leetcode.com/problems/copy-list-with-random-pointer/"
},
{
"difficulty": "medium",
"number": 92,
"premium": false,
"slug": "reverse-linked-list-ii",
"title": "Reverse Linked List II",
"topics": [
"linked-list"
],
"url": "https://leetcode.com/problems/reverse-linked-list-ii/"
},
{
"difficulty": "hard",
"number": 25,
"premium": false,
"slug": "reverse-nodes-in-k-group",
"title": "Reverse Nodes in k-Group",
"topics": [
"linked-list",
"recursion"
],
"url": "https://leetcode.com/problems/reverse-nodes-in-k-group/"
},
{
"difficulty": "medium",
"number": 19,
"premium": false,
"slug": "remove-nth-node-from-end-of-list",
"title": "Remove Nth Node From End of List",
"topics": [
"linked-list",
"two-pointers"
],
"url": "https://leetcode.com/problems/remove-nth-node-from-end-of-list/"
},
{
"difficulty": "medium",
"number": 82,
"premium": false,
"slug": "remove-duplicates-from-sorted-list-ii",
"title": "Remove Duplicates from Sorted List II",
"topics": [
"linked-list",
"two-pointers"
],
"url": "https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/"
},
{
"difficulty": "medium",
"number": 61,
"premium": false,
"slug": "rotate-list",
"title": "Rotate List",
"topics": [
"linked-list",
"two-pointers"
],
"url": "https://leetcode.com/problems/rotate-list/"
},
{
"difficulty": "medium",
"number": 86,
"premium": false,
"slug": "partition-list",
"title": "Partition List",
"topics": [
"linked-list",
"two-pointers"
],
"url": "https://leetcode.com/problems/partition-list/"
},
{
"difficulty": "medium",
"number": 146,
"premium": false,
"slug": "lru-cache",
"title": "LRU Cache",
"topics": [
"hash-table",
"linked-list",
"design",
"doubly-linked-list"
],
"url": "https://leetcode.com/problems/lru-cache/"
}
],
"problems_count": 11,
"slug": "top-interview-150-8-rvcb"
},
{
"name": "Binary Tree General",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 104,
"premium": false,
"slug": "maximum-depth-of-binary-tree",
"title": "Maximum Depth of Binary Tree",
"topics": [
"tree",
"depth-first-search",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/maximum-depth-of-binary-tree/"
},
{
"difficulty": "easy",
"number": 100,
"premium": false,
"slug": "same-tree",
"title": "Same Tree",
"topics": [
"tree",
"depth-first-search",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/same-tree/"
},
{
"difficulty": "easy",
"number": 226,
"premium": false,
"slug": "invert-binary-tree",
"title": "Invert Binary Tree",
"topics": [
"tree",
"depth-first-search",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/invert-binary-tree/"
},
{
"difficulty": "easy",
"number": 101,
"premium": false,
"slug": "symmetric-tree",
"title": "Symmetric Tree",
"topics": [
"tree",
"depth-first-search",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/symmetric-tree/"
},
{
"difficulty": "medium",
"number": 105,
"premium": false,
"slug": "construct-binary-tree-from-preorder-and-inorder-traversal",
"title": "Construct Binary Tree from Preorder and Inorder Traversal",
"topics": [
"array",
"hash-table",
"divide-and-conquer",
"tree",
"binary-tree"
],
"url": "https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/"
},
{
"difficulty": "medium",
"number": 106,
"premium": false,
"slug": "construct-binary-tree-from-inorder-and-postorder-traversal",
"title": "Construct Binary Tree from Inorder and Postorder Traversal",
"topics": [
"array",
"hash-table",
"divide-and-conquer",
"tree",
"binary-tree"
],
"url": "https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/"
},
{
"difficulty": "medium",
"number": 117,
"premium": false,
"slug": "populating-next-right-pointers-in-each-node-ii",
"title": "Populating Next Right Pointers in Each Node II",
"topics": [
"linked-list",
"tree",
"depth-first-search",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/"
},
{
"difficulty": "medium",
"number": 114,
"premium": false,
"slug": "flatten-binary-tree-to-linked-list",
"title": "Flatten Binary Tree to Linked List",
"topics": [
"linked-list",
"stack",
"tree",
"depth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/flatten-binary-tree-to-linked-list/"
},
{
"difficulty": "easy",
"number": 112,
"premium": false,
"slug": "path-sum",
"title": "Path Sum",
"topics": [
"tree",
"depth-first-search",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/path-sum/"
},
{
"difficulty": "medium",
"number": 129,
"premium": false,
"slug": "sum-root-to-leaf-numbers",
"title": "Sum Root to Leaf Numbers",
"topics": [
"tree",
"depth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/sum-root-to-leaf-numbers/"
},
{
"difficulty": "hard",
"number": 124,
"premium": false,
"slug": "binary-tree-maximum-path-sum",
"title": "Binary Tree Maximum Path Sum",
"topics": [
"dynamic-programming",
"tree",
"depth-first-search",
"binary-tree",
"dp-on-trees"
],
"url": "https://leetcode.com/problems/binary-tree-maximum-path-sum/"
},
{
"difficulty": "medium",
"number": 173,
"premium": false,
"slug": "binary-search-tree-iterator",
"title": "Binary Search Tree Iterator",
"topics": [
"stack",
"tree",
"design",
"binary-search-tree",
"binary-tree",
"iterator"
],
"url": "https://leetcode.com/problems/binary-search-tree-iterator/"
},
{
"difficulty": "medium",
"number": 222,
"premium": false,
"slug": "count-complete-tree-nodes",
"title": "Count Complete Tree Nodes",
"topics": [
"binary-search",
"bit-manipulation",
"tree",
"binary-tree"
],
"url": "https://leetcode.com/problems/count-complete-tree-nodes/"
},
{
"difficulty": "medium",
"number": 236,
"premium": false,
"slug": "lowest-common-ancestor-of-a-binary-tree",
"title": "Lowest Common Ancestor of a Binary Tree",
"topics": [
"tree",
"depth-first-search",
"binary-tree",
"binary-lifting",
"lowest-common-ancestor"
],
"url": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/"
}
],
"problems_count": 14,
"slug": "top-interview-150-9-ozek"
},
{
"name": "Binary Tree BFS",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 199,
"premium": false,
"slug": "binary-tree-right-side-view",
"title": "Binary Tree Right Side View",
"topics": [
"tree",
"depth-first-search",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/binary-tree-right-side-view/"
},
{
"difficulty": "easy",
"number": 637,
"premium": false,
"slug": "average-of-levels-in-binary-tree",
"title": "Average of Levels in Binary Tree",
"topics": [
"tree",
"depth-first-search",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/average-of-levels-in-binary-tree/"
},
{
"difficulty": "medium",
"number": 102,
"premium": false,
"slug": "binary-tree-level-order-traversal",
"title": "Binary Tree Level Order Traversal",
"topics": [
"tree",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/binary-tree-level-order-traversal/"
},
{
"difficulty": "medium",
"number": 103,
"premium": false,
"slug": "binary-tree-zigzag-level-order-traversal",
"title": "Binary Tree Zigzag Level Order Traversal",
"topics": [
"tree",
"breadth-first-search",
"binary-tree"
],
"url": "https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/"
}
],
"problems_count": 4,
"slug": "top-interview-150-10-ibmi"
},
{
"name": "Binary Search Tree",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 530,
"premium": false,
"slug": "minimum-absolute-difference-in-bst",
"title": "Minimum Absolute Difference in BST",
"topics": [
"tree",
"depth-first-search",
"breadth-first-search",
"binary-search-tree",
"binary-tree"
],
"url": "https://leetcode.com/problems/minimum-absolute-difference-in-bst/"
},
{
"difficulty": "medium",
"number": 230,
"premium": false,
"slug": "kth-smallest-element-in-a-bst",
"title": "Kth Smallest Element in a BST",
"topics": [
"tree",
"depth-first-search",
"binary-search-tree",
"binary-tree"
],
"url": "https://leetcode.com/problems/kth-smallest-element-in-a-bst/"
},
{
"difficulty": "medium",
"number": 98,
"premium": false,
"slug": "validate-binary-search-tree",
"title": "Validate Binary Search Tree",
"topics": [
"tree",
"depth-first-search",
"binary-search-tree",
"binary-tree"
],
"url": "https://leetcode.com/problems/validate-binary-search-tree/"
}
],
"problems_count": 3,
"slug": "top-interview-150-11-z3y5"
},
{
"name": "Graph General",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 200,
"premium": false,
"slug": "number-of-islands",
"title": "Number of Islands",
"topics": [
"array",
"depth-first-search",
"breadth-first-search",
"union-find",
"matrix"
],
"url": "https://leetcode.com/problems/number-of-islands/"
},
{
"difficulty": "medium",
"number": 130,
"premium": false,
"slug": "surrounded-regions",
"title": "Surrounded Regions",
"topics": [
"array",
"depth-first-search",
"breadth-first-search",
"union-find",
"matrix"
],
"url": "https://leetcode.com/problems/surrounded-regions/"
},
{
"difficulty": "medium",
"number": 133,
"premium": false,
"slug": "clone-graph",
"title": "Clone Graph",
"topics": [
"hash-table",
"depth-first-search",
"breadth-first-search",
"graph"
],
"url": "https://leetcode.com/problems/clone-graph/"
},
{
"difficulty": "medium",
"number": 399,
"premium": false,
"slug": "evaluate-division",
"title": "Evaluate Division",
"topics": [
"array",
"string",
"depth-first-search",
"breadth-first-search",
"union-find",
"graph",
"shortest-path",
"bellman-ford-algorithm",
"floyd-warshall-algorithm"
],
"url": "https://leetcode.com/problems/evaluate-division/"
},
{
"difficulty": "medium",
"number": 207,
"premium": false,
"slug": "course-schedule",
"title": "Course Schedule",
"topics": [
"depth-first-search",
"breadth-first-search",
"graph",
"topological-sort",
"directed-acyclic-graph"
],
"url": "https://leetcode.com/problems/course-schedule/"
},
{
"difficulty": "medium",
"number": 210,
"premium": false,
"slug": "course-schedule-ii",
"title": "Course Schedule II",
"topics": [
"depth-first-search",
"breadth-first-search",
"graph",
"topological-sort"
],
"url": "https://leetcode.com/problems/course-schedule-ii/"
}
],
"problems_count": 6,
"slug": "top-interview-150-12-7djr"
},
{
"name": "Graph BFS",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 909,
"premium": false,
"slug": "snakes-and-ladders",
"title": "Snakes and Ladders",
"topics": [
"array",
"breadth-first-search",
"matrix"
],
"url": "https://leetcode.com/problems/snakes-and-ladders/"
},
{
"difficulty": "medium",
"number": 433,
"premium": false,
"slug": "minimum-genetic-mutation",
"title": "Minimum Genetic Mutation",
"topics": [
"hash-table",
"string",
"breadth-first-search",
"bidirectional-search"
],
"url": "https://leetcode.com/problems/minimum-genetic-mutation/"
},
{
"difficulty": "hard",
"number": 127,
"premium": false,
"slug": "word-ladder",
"title": "Word Ladder",
"topics": [
"hash-table",
"string",
"breadth-first-search",
"bidirectional-search"
],
"url": "https://leetcode.com/problems/word-ladder/"
}
],
"problems_count": 3,
"slug": "top-interview-150-13-9z8t"
},
{
"name": "Trie",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 208,
"premium": false,
"slug": "implement-trie-prefix-tree",
"title": "Implement Trie (Prefix Tree)",
"topics": [
"hash-table",
"string",
"design",
"trie"
],
"url": "https://leetcode.com/problems/implement-trie-prefix-tree/"
},
{
"difficulty": "medium",
"number": 211,
"premium": false,
"slug": "design-add-and-search-words-data-structure",
"title": "Design Add and Search Words Data Structure",
"topics": [
"string",
"depth-first-search",
"design",
"trie"
],
"url": "https://leetcode.com/problems/design-add-and-search-words-data-structure/"
},
{
"difficulty": "hard",
"number": 212,
"premium": false,
"slug": "word-search-ii",
"title": "Word Search II",
"topics": [
"array",
"string",
"backtracking",
"trie",
"matrix"
],
"url": "https://leetcode.com/problems/word-search-ii/"
}
],
"problems_count": 3,
"slug": "top-interview-150-14-lih2"
},
{
"name": "Backtracking",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 17,
"premium": false,
"slug": "letter-combinations-of-a-phone-number",
"title": "Letter Combinations of a Phone Number",
"topics": [
"hash-table",
"string",
"backtracking"
],
"url": "https://leetcode.com/problems/letter-combinations-of-a-phone-number/"
},
{
"difficulty": "medium",
"number": 77,
"premium": false,
"slug": "combinations",
"title": "Combinations",
"topics": [
"backtracking"
],
"url": "https://leetcode.com/problems/combinations/"
},
{
"difficulty": "medium",
"number": 46,
"premium": false,
"slug": "permutations",
"title": "Permutations",
"topics": [
"array",
"backtracking"
],
"url": "https://leetcode.com/problems/permutations/"
},
{
"difficulty": "medium",
"number": 39,
"premium": false,
"slug": "combination-sum",
"title": "Combination Sum",
"topics": [
"array",
"backtracking"
],
"url": "https://leetcode.com/problems/combination-sum/"
},
{
"difficulty": "hard",
"number": 52,
"premium": false,
"slug": "n-queens-ii",
"title": "N-Queens II",
"topics": [
"backtracking",
"algorithm-x"
],
"url": "https://leetcode.com/problems/n-queens-ii/"
},
{
"difficulty": "medium",
"number": 22,
"premium": false,
"slug": "generate-parentheses",
"title": "Generate Parentheses",
"topics": [
"string",
"dynamic-programming",
"backtracking",
"bracket-sequences"
],
"url": "https://leetcode.com/problems/generate-parentheses/"
},
{
"difficulty": "medium",
"number": 79,
"premium": false,
"slug": "word-search",
"title": "Word Search",
"topics": [
"array",
"string",
"backtracking",
"depth-first-search",
"matrix"
],
"url": "https://leetcode.com/problems/word-search/"
}
],
"problems_count": 7,
"slug": "top-interview-150-15-rpt9"
},
{
"name": "Divide & Conquer",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 108,
"premium": false,
"slug": "convert-sorted-array-to-binary-search-tree",
"title": "Convert Sorted Array to Binary Search Tree",
"topics": [
"array",
"divide-and-conquer",
"tree",
"binary-search-tree",
"binary-tree"
],
"url": "https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/"
},
{
"difficulty": "medium",
"number": 148,
"premium": false,
"slug": "sort-list",
"title": "Sort List",
"topics": [
"linked-list",
"two-pointers",
"divide-and-conquer",
"sorting",
"merge-sort"
],
"url": "https://leetcode.com/problems/sort-list/"
},
{
"difficulty": "medium",
"number": 427,
"premium": false,
"slug": "construct-quad-tree",
"title": "Construct Quad Tree",
"topics": [
"array",
"divide-and-conquer",
"tree",
"matrix"
],
"url": "https://leetcode.com/problems/construct-quad-tree/"
},
{
"difficulty": "hard",
"number": 23,
"premium": false,
"slug": "merge-k-sorted-lists",
"title": "Merge k Sorted Lists",
"topics": [
"linked-list",
"divide-and-conquer",
"heap-priority-queue",
"merge-sort",
"tournament-sort"
],
"url": "https://leetcode.com/problems/merge-k-sorted-lists/"
}
],
"problems_count": 4,
"slug": "top-interview-150-16-z95i"
},
{
"name": "Kadane's Algorithm",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 53,
"premium": false,
"slug": "maximum-subarray",
"title": "Maximum Subarray",
"topics": [
"array",
"divide-and-conquer",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/maximum-subarray/"
},
{
"difficulty": "medium",
"number": 918,
"premium": false,
"slug": "maximum-sum-circular-subarray",
"title": "Maximum Sum Circular Subarray",
"topics": [
"array",
"divide-and-conquer",
"dynamic-programming",
"queue",
"monotonic-queue"
],
"url": "https://leetcode.com/problems/maximum-sum-circular-subarray/"
}
],
"problems_count": 2,
"slug": "top-interview-150-17-tjhz"
},
{
"name": "Binary Search",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 35,
"premium": false,
"slug": "search-insert-position",
"title": "Search Insert Position",
"topics": [
"array",
"binary-search"
],
"url": "https://leetcode.com/problems/search-insert-position/"
},
{
"difficulty": "medium",
"number": 74,
"premium": false,
"slug": "search-a-2d-matrix",
"title": "Search a 2D Matrix",
"topics": [
"array",
"binary-search",
"matrix"
],
"url": "https://leetcode.com/problems/search-a-2d-matrix/"
},
{
"difficulty": "medium",
"number": 162,
"premium": false,
"slug": "find-peak-element",
"title": "Find Peak Element",
"topics": [
"array",
"binary-search"
],
"url": "https://leetcode.com/problems/find-peak-element/"
},
{
"difficulty": "medium",
"number": 33,
"premium": false,
"slug": "search-in-rotated-sorted-array",
"title": "Search in Rotated Sorted Array",
"topics": [
"array",
"binary-search"
],
"url": "https://leetcode.com/problems/search-in-rotated-sorted-array/"
},
{
"difficulty": "medium",
"number": 34,
"premium": false,
"slug": "find-first-and-last-position-of-element-in-sorted-array",
"title": "Find First and Last Position of Element in Sorted Array",
"topics": [
"array",
"binary-search"
],
"url": "https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/"
},
{
"difficulty": "medium",
"number": 153,
"premium": false,
"slug": "find-minimum-in-rotated-sorted-array",
"title": "Find Minimum in Rotated Sorted Array",
"topics": [
"array",
"binary-search"
],
"url": "https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/"
},
{
"difficulty": "hard",
"number": 4,
"premium": false,
"slug": "median-of-two-sorted-arrays",
"title": "Median of Two Sorted Arrays",
"topics": [
"array",
"binary-search",
"divide-and-conquer"
],
"url": "https://leetcode.com/problems/median-of-two-sorted-arrays/"
}
],
"problems_count": 7,
"slug": "top-interview-150-18-quur"
},
{
"name": "Heap",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 215,
"premium": false,
"slug": "kth-largest-element-in-an-array",
"title": "Kth Largest Element in an Array",
"topics": [
"array",
"divide-and-conquer",
"sorting",
"heap-priority-queue",
"quickselect"
],
"url": "https://leetcode.com/problems/kth-largest-element-in-an-array/"
},
{
"difficulty": "hard",
"number": 502,
"premium": false,
"slug": "ipo",
"title": "IPO",
"topics": [
"array",
"greedy",
"sorting",
"heap-priority-queue"
],
"url": "https://leetcode.com/problems/ipo/"
},
{
"difficulty": "medium",
"number": 373,
"premium": false,
"slug": "find-k-pairs-with-smallest-sums",
"title": "Find K Pairs with Smallest Sums",
"topics": [
"array",
"heap-priority-queue"
],
"url": "https://leetcode.com/problems/find-k-pairs-with-smallest-sums/"
},
{
"difficulty": "hard",
"number": 295,
"premium": false,
"slug": "find-median-from-data-stream",
"title": "Find Median from Data Stream",
"topics": [
"two-pointers",
"design",
"sorting",
"heap-priority-queue",
"data-stream"
],
"url": "https://leetcode.com/problems/find-median-from-data-stream/"
}
],
"problems_count": 4,
"slug": "top-interview-150-19-w23l"
},
{
"name": "Bit Manipulation",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 67,
"premium": false,
"slug": "add-binary",
"title": "Add Binary",
"topics": [
"math",
"string",
"bit-manipulation",
"simulation"
],
"url": "https://leetcode.com/problems/add-binary/"
},
{
"difficulty": "easy",
"number": 190,
"premium": false,
"slug": "reverse-bits",
"title": "Reverse Bits",
"topics": [
"divide-and-conquer",
"bit-manipulation"
],
"url": "https://leetcode.com/problems/reverse-bits/"
},
{
"difficulty": "easy",
"number": 191,
"premium": false,
"slug": "number-of-1-bits",
"title": "Number of 1 Bits",
"topics": [
"divide-and-conquer",
"bit-manipulation"
],
"url": "https://leetcode.com/problems/number-of-1-bits/"
},
{
"difficulty": "easy",
"number": 136,
"premium": false,
"slug": "single-number",
"title": "Single Number",
"topics": [
"array",
"bit-manipulation"
],
"url": "https://leetcode.com/problems/single-number/"
},
{
"difficulty": "medium",
"number": 137,
"premium": false,
"slug": "single-number-ii",
"title": "Single Number II",
"topics": [
"array",
"bit-manipulation"
],
"url": "https://leetcode.com/problems/single-number-ii/"
},
{
"difficulty": "medium",
"number": 201,
"premium": false,
"slug": "bitwise-and-of-numbers-range",
"title": "Bitwise AND of Numbers Range",
"topics": [
"bit-manipulation"
],
"url": "https://leetcode.com/problems/bitwise-and-of-numbers-range/"
}
],
"problems_count": 6,
"slug": "top-interview-150-20-m490"
},
{
"name": "Math",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 9,
"premium": false,
"slug": "palindrome-number",
"title": "Palindrome Number",
"topics": [
"math"
],
"url": "https://leetcode.com/problems/palindrome-number/"
},
{
"difficulty": "easy",
"number": 66,
"premium": false,
"slug": "plus-one",
"title": "Plus One",
"topics": [
"array",
"math"
],
"url": "https://leetcode.com/problems/plus-one/"
},
{
"difficulty": "medium",
"number": 172,
"premium": false,
"slug": "factorial-trailing-zeroes",
"title": "Factorial Trailing Zeroes",
"topics": [
"math"
],
"url": "https://leetcode.com/problems/factorial-trailing-zeroes/"
},
{
"difficulty": "easy",
"number": 69,
"premium": false,
"slug": "sqrtx",
"title": "Sqrt(x)",
"topics": [
"math",
"binary-search",
"newtons-method"
],
"url": "https://leetcode.com/problems/sqrtx/"
},
{
"difficulty": "medium",
"number": 50,
"premium": false,
"slug": "powx-n",
"title": "Pow(x, n)",
"topics": [
"math",
"recursion"
],
"url": "https://leetcode.com/problems/powx-n/"
},
{
"difficulty": "hard",
"number": 149,
"premium": false,
"slug": "max-points-on-a-line",
"title": "Max Points on a Line",
"topics": [
"array",
"hash-table",
"math",
"geometry",
"euclidean-algorithm",
"greatest-common-divisor"
],
"url": "https://leetcode.com/problems/max-points-on-a-line/"
}
],
"problems_count": 6,
"slug": "top-interview-150-21-098q"
},
{
"name": "1D DP",
"premium_only": false,
"problems": [
{
"difficulty": "easy",
"number": 70,
"premium": false,
"slug": "climbing-stairs",
"title": "Climbing Stairs",
"topics": [
"math",
"dynamic-programming",
"memoization"
],
"url": "https://leetcode.com/problems/climbing-stairs/"
},
{
"difficulty": "medium",
"number": 198,
"premium": false,
"slug": "house-robber",
"title": "House Robber",
"topics": [
"array",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/house-robber/"
},
{
"difficulty": "medium",
"number": 139,
"premium": false,
"slug": "word-break",
"title": "Word Break",
"topics": [
"array",
"hash-table",
"string",
"dynamic-programming",
"trie",
"memoization",
"brute-force-search"
],
"url": "https://leetcode.com/problems/word-break/"
},
{
"difficulty": "medium",
"number": 322,
"premium": false,
"slug": "coin-change",
"title": "Coin Change",
"topics": [
"array",
"dynamic-programming",
"breadth-first-search",
"knapsack-problem",
"complete-knapsack"
],
"url": "https://leetcode.com/problems/coin-change/"
},
{
"difficulty": "medium",
"number": 300,
"premium": false,
"slug": "longest-increasing-subsequence",
"title": "Longest Increasing Subsequence",
"topics": [
"array",
"binary-search",
"dynamic-programming",
"longest-increasing-subsequence"
],
"url": "https://leetcode.com/problems/longest-increasing-subsequence/"
}
],
"problems_count": 5,
"slug": "top-interview-150-22-p3qn"
},
{
"name": "Multidimensional DP",
"premium_only": false,
"problems": [
{
"difficulty": "medium",
"number": 120,
"premium": false,
"slug": "triangle",
"title": "Triangle",
"topics": [
"array",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/triangle/"
},
{
"difficulty": "medium",
"number": 64,
"premium": false,
"slug": "minimum-path-sum",
"title": "Minimum Path Sum",
"topics": [
"array",
"dynamic-programming",
"matrix"
],
"url": "https://leetcode.com/problems/minimum-path-sum/"
},
{
"difficulty": "medium",
"number": 63,
"premium": false,
"slug": "unique-paths-ii",
"title": "Unique Paths II",
"topics": [
"array",
"dynamic-programming",
"matrix"
],
"url": "https://leetcode.com/problems/unique-paths-ii/"
},
{
"difficulty": "medium",
"number": 5,
"premium": false,
"slug": "longest-palindromic-substring",
"title": "Longest Palindromic Substring",
"topics": [
"two-pointers",
"string",
"dynamic-programming",
"manacher"
],
"url": "https://leetcode.com/problems/longest-palindromic-substring/"
},
{
"difficulty": "medium",
"number": 97,
"premium": false,
"slug": "interleaving-string",
"title": "Interleaving String",
"topics": [
"string",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/interleaving-string/"
},
{
"difficulty": "medium",
"number": 72,
"premium": false,
"slug": "edit-distance",
"title": "Edit Distance",
"topics": [
"string",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/edit-distance/"
},
{
"difficulty": "hard",
"number": 123,
"premium": false,
"slug": "best-time-to-buy-and-sell-stock-iii",
"title": "Best Time to Buy and Sell Stock III",
"topics": [
"array",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/"
},
{
"difficulty": "hard",
"number": 188,
"premium": false,
"slug": "best-time-to-buy-and-sell-stock-iv",
"title": "Best Time to Buy and Sell Stock IV",
"topics": [
"array",
"dynamic-programming"
],
"url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/"
},
{
"difficulty": "medium",
"number": 221,
"premium": false,
"slug": "maximal-square",
"title": "Maximal Square",
"topics": [
"array",
"dynamic-programming",
"matrix"
],
"url": "https://leetcode.com/problems/maximal-square/"
}
],
"problems_count": 9,
"slug": "top-interview-150-23-cpbf"
}
],
"highlight": "Must-do List for Interview Prep",
"name": "Top Interview 150",
"premium_only": false,
"problems_count": 150,
"related": [
{
"highlight": "Ace Coding Interview with 75 Qs",
"name": "LeetCode 75",
"premium_only": false,
"slug": "leetcode-75"
},
{
"highlight": "100 Best Rated Problems",
"name": "Top 100 Liked",
"premium_only": false,
"slug": "top-100-liked"
},
{
"highlight": "LeetCode Staff Pick",
"name": "Premium Algo 100",
"premium_only": true,
"slug": "premium-algo-100"
},
{
"highlight": "Excel Implementation Skills in 50 Qs",
"name": "Programming Skills",
"premium_only": false,
"slug": "programming-skills"
}
],
"slug": "top-interview-150",
"url": "https://leetcode.com/studyplan/top-interview-150/"
}
}
]
}
```Error handling
| Status | Next step |
|---|---|
400 | Check the offering and request fields. |
401 / 403 | Verify your credentials and access permissions. |
402 | Inspect the selected access mode and returned payment requirements. |
429 | Respect the returned rate limit and retry guidance. |
5xx | Inspect the error and usage record before retrying a paid operation. |
Official example · Live API.SH response · Minimal request
Example from the provider's documentation. Field values in your results will differ.
Prepare your environment
Use a terminal with cURL installed.
Use an OpenAny API key with shared-balance access. Confirm availability and price before running; a call may charge your balance.
Set the key in your terminal using the hidden prompt below. Keep its value out of source files and logs.
Terminal · macOS / Linuxprintf 'OpenAny API key: ' read -r -s OPENANY_API_KEY export OPENANY_API_KEY printf '\n'Run the request
Paste the complete command below into your terminal.
Values to replace before running 6
Review these request fields before running. Keep the published provider and request method unchanged.
slug- Study plan slug or leetcode.com/studyplan/<slug>/ link; empty lists all plans.
raw- 0 leaves out the bulky `raw` source blocks (often 10-30x smaller).
fields- Comma-separated fields to return, e.g. `posts.id,posts.title`. Call metadata is always included.
fresh- 1 skips the 24-hour cache and fetches live.
output- JSON only for this OpenAny product. Omit output or use json; CSV and NDJSON are not supported.
records- With output=csv|ndjson: the top-level list to turn into rows (e.g. `reviews`), or `.` for the whole object as one row.
Terminal · cURLcurl \ 'https://api.openany.si/v1/agent-apis/apish/leetcode/v1/study-plan?output=json&raw=0&slug=top-interview-150' \ -X GET \ -H "Authorization: Bearer $OPENANY_API_KEY" \ -H 'Content-Type: application/json'Check the response
Sample response · Documented HTTP 200
Sample response{ "award": { "description": "Complete the study plan to win the badge!", "icon": "https://assets.leetcode.com/static_assets/others/Top_100_Liked-1.png", "icon_gif": "https://assets.leetcode.com/static_assets/others/Top_Interview_150.gif", "name": "Top Interview 150" }, "cached": false, "cover": "https://assets.leetcode.com/static_assets/others/Top_Interview_150_static_cover_picture.png", "credits_used": 1, "description": "150 Original & Classic Questions\r\nCovers comprehensive interview topics\r\nBest for 3+ months of prep time\r\nProblems support high-quality editorials", "fetched_at": "2026-11-19T12:29:42.263Z", "groups": [ { "name": "Array / String", "premium_only": false, "problems": [ { "difficulty": "easy", "number": 88, "premium": false, "slug": "merge-sorted-array", "title": "Merge Sorted Array", "topics": [ "array", "two-pointers", "sorting" ], "url": "https://leetcode.com/problems/merge-sorted-array/" }, { "difficulty": "easy", "number": 27, "premium": false, "slug": "remove-element", "title": "Remove Element", "topics": [ "array", "two-pointers" ], "url": "https://leetcode.com/problems/remove-element/" }, { "difficulty": "easy", "number": 26, "premium": false, "slug": "remove-duplicates-from-sorted-array", "title": "Remove Duplicates from Sorted Array", "topics": [ "array", "two-pointers" ], "url": "https://leetcode.com/problems/remove-duplicates-from-sorted-array/" }, { "difficulty": "medium", "number": 80, "premium": false, "slug": "remove-duplicates-from-sorted-array-ii", "title": "Remove Duplicates from Sorted Array II", "topics": [ "array", "two-pointers" ], "url": "https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/" }, { "difficulty": "easy", "number": 169, "premium": false, "slug": "majority-element", "title": "Majority Element", "topics": [ "array", "hash-table", "divide-and-conquer", "sorting", "counting", "boyer-moore-majority-vote-algorithm" ], "url": "https://leetcode.com/problems/majority-element/" }, { "difficulty": "medium", "number": 189, "premium": false, "slug": "rotate-array", "title": "Rotate Array", "topics": [ "array", "math", "two-pointers" ], "url": "https://leetcode.com/problems/rotate-array/" }, { "difficulty": "easy", "number": 121, "premium": false, "slug": "best-time-to-buy-and-sell-stock", "title": "Best Time to Buy and Sell Stock", "topics": [ "array", "dynamic-programming" ], "url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock/" }, { "difficulty": "medium", "number": 122, "premium": false, "slug": "best-time-to-buy-and-sell-stock-ii", "title": "Best Time to Buy and Sell Stock II", "topics": [ "array", "dynamic-programming", "greedy" ], "url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/" }, { "difficulty": "medium", "number": 55, "premium": false, "slug": "jump-game", "title": "Jump Game", "topics": [ "array", "dynamic-programming", "greedy" ], "url": "https://leetcode.com/problems/jump-game/" }, { "difficulty": "medium", "number": 45, "premium": false, "slug": "jump-game-ii", "title": "Jump Game II", "topics": [ "array", "dynamic-programming", "greedy" ], "url": "https://leetcode.com/problems/jump-game-ii/" }, { "difficulty": "medium", "number": 274, "premium": false, "slug": "h-index", "title": "H-Index", "topics": [ "array", "sorting", "counting-sort" ], "url": "https://leetcode.com/problems/h-index/" }, { "difficulty": "medium", "number": 380, "premium": false, "slug": "insert-delete-getrandom-o1", "title": "Insert Delete GetRandom O(1)", "topics": [ "array", "hash-table", "math", "design", "randomized" ], "url": "https://leetcode.com/problems/insert-delete-getrandom-o1/" }, { "difficulty": "medium", "number": 238, "premium": false, "slug": "product-of-array-except-self", "title": "Product of Array Except Self", "topics": [ "array", "prefix-sum" ], "url": "https://leetcode.com/problems/product-of-array-except-self/" }, { "difficulty": "medium", "number": 134, "premium": false, "slug": "gas-station", "title": "Gas Station", "topics": [ "array", "greedy" ], "url": "https://leetcode.com/problems/gas-station/" }, { "difficulty": "hard", "number": 135, "premium": false, "slug": "candy", "title": "Candy", "topics": [ "array", "greedy" ], "url": "https://leetcode.com/problems/candy/" }, { "difficulty": "hard", "number": 42, "premium": false, "slug": "trapping-rain-water", "title": "Trapping Rain Water", "topics": [ "array", "two-pointers", "dynamic-programming", "stack", "monotonic-stack" ], "url": "https://leetcode.com/problems/trapping-rain-water/" }, { "difficulty": "easy", "number": 13, "premium": false, "slug": "roman-to-integer", "title": "Roman to Integer", "topics": [ "hash-table", "math", "string" ], "url": "https://leetcode.com/problems/roman-to-integer/" }, { "difficulty": "medium", "number": 12, "premium": false, "slug": "integer-to-roman", "title": "Integer to Roman", "topics": [ "hash-table", "math", "string" ], "url": "https://leetcode.com/problems/integer-to-roman/" }, { "difficulty": "easy", "number": 58, "premium": false, "slug": "length-of-last-word", "title": "Length of Last Word", "topics": [ "string" ], "url": "https://leetcode.com/problems/length-of-last-word/" }, { "difficulty": "easy", "number": 14, "premium": false, "slug": "longest-common-prefix", "title": "Longest Common Prefix", "topics": [ "array", "string", "trie" ], "url": "https://leetcode.com/problems/longest-common-prefix/" }, { "difficulty": "medium", "number": 151, "premium": false, "slug": "reverse-words-in-a-string", "title": "Reverse Words in a String", "topics": [ "two-pointers", "string" ], "url": "https://leetcode.com/problems/reverse-words-in-a-string/" }, { "difficulty": "medium", "number": 6, "premium": false, "slug": "zigzag-conversion", "title": "Zigzag Conversion", "topics": [ "string" ], "url": "https://leetcode.com/problems/zigzag-conversion/" }, { "difficulty": "easy", "number": 28, "premium": false, "slug": "find-the-index-of-the-first-occurrence-in-a-string", "title": "Find the Index of the First Occurrence in a String", "topics": [ "two-pointers", "string", "string-matching", "z-algorithm", "knuth-morris-pratt-algorithm", "boyer-moore-string-search-algorithm" ], "url": "https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/" }, { "difficulty": "hard", "number": 68, "premium": false, "slug": "text-justification", "title": "Text Justification", "topics": [ "array", "string", "simulation" ], "url": "https://leetcode.com/problems/text-justification/" } ], "problems_count": 24, "slug": "top-interview-150-1-yf91" }, { "name": "Two Pointers", "premium_only": false, "problems": [ { "difficulty": "easy", "number": 125, "premium": false, "slug": "valid-palindrome", "title": "Valid Palindrome", "topics": [ "two-pointers", "string" ], "url": "https://leetcode.com/problems/valid-palindrome/" }, { "difficulty": "easy", "number": 392, "premium": false, "slug": "is-subsequence", "title": "Is Subsequence", "topics": [ "two-pointers", "string", "dynamic-programming" ], "url": "https://leetcode.com/problems/is-subsequence/" }, { "difficulty": "medium", "number": 167, "premium": false, "slug": "two-sum-ii-input-array-is-sorted", "title": "Two Sum II - Input Array Is Sorted", "topics": [ "array", "two-pointers", "binary-search" ], "url": "https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/" }, { "difficulty": "medium", "number": 11, "premium": false, "slug": "container-with-most-water", "title": "Container With Most Water", "topics": [ "array", "two-pointers", "greedy" ], "url": "https://leetcode.com/problems/container-with-most-water/" }, { "difficulty": "medium", "number": 15, "premium": false, "slug": "3sum", "title": "3Sum", "topics": [ "array", "two-pointers", "sorting" ], "url": "https://leetcode.com/problems/3sum/" } ], "problems_count": 5, "slug": "top-interview-150-2-o7jr" }, { "name": "Sliding Window", "premium_only": false, "problems": [ { "difficulty": "medium", "number": 209, "premium": false, "slug": "minimum-size-subarray-sum", "title": "Minimum Size Subarray Sum", "topics": [ "array", "binary-search", "sliding-window", "prefix-sum" ], "url": "https://leetcode.com/problems/minimum-size-subarray-sum/" }, { "difficulty": "medium", "number": 3, "premium": false, "slug": "longest-substring-without-repeating-characters", "title": "Longest Substring Without Repeating Characters", "topics": [ "hash-table", "string", "sliding-window" ], "url": "https://leetcode.com/problems/longest-substring-without-repeating-characters/" }, { "difficulty": "hard", "number": 30, "premium": false, "slug": "substring-with-concatenation-of-all-words", "title": "Substring with Concatenation of All Words", "topics": [ "hash-table", "string", "sliding-window" ], "url": "https://leetcode.com/problems/substring-with-concatenation-of-all-words/" }, { "difficulty": "hard", "number": 76, "premium": false, "slug": "minimum-window-substring", "title": "Minimum Window Substring", "topics": [ "hash-table", "string", "sliding-window" ], "url": "https://leetcode.com/problems/minimum-window-substring/" } ], "problems_count": 4, "slug": "top-interview-150-3-h81e" }, { "name": "Matrix", "premium_only": false, "problems": [ { "difficulty": "medium", "number": 36, "premium": false, "slug": "valid-sudoku", "title": "Valid Sudoku", "topics": [ "array", "hash-table", "matrix" ], "url": "https://leetcode.com/problems/valid-sudoku/" }, { "difficulty": "medium", "number": 54, "premium": false, "slug": "spiral-matrix", "title": "Spiral Matrix", "topics": [ "array", "matrix", "simulation" ], "url": "https://leetcode.com/problems/spiral-matrix/" }, { "difficulty": "medium", "number": 48, "premium": false, "slug": "rotate-image", "title": "Rotate Image", "topics": [ "array", "math", "matrix" ], "url": "https://leetcode.com/problems/rotate-image/" }, { "difficulty": "medium", "number": 73, "premium": false, "slug": "set-matrix-zeroes", "title": "Set Matrix Zeroes", "topics": [ "array", "hash-table", "matrix" ], "url": "https://leetcode.com/problems/set-matrix-zeroes/" }, { "difficulty": "medium", "number": 289, "premium": false, "slug": "game-of-life", "title": "Game of Life", "topics": [ "array", "matrix", "simulation" ], "url": "https://leetcode.com/problems/game-of-life/" } ], "problems_count": 5, "slug": "top-interview-150-4-ukui" }, { "name": "Hashmap", "premium_only": false, "problems": [ { "difficulty": "easy", "number": 383, "premium": false, "slug": "ransom-note", "title": "Ransom Note", "topics": [ "hash-table", "string", "counting" ], "url": "https://leetcode.com/problems/ransom-note/" }, { "difficulty": "easy", "number": 205, "premium": false, "slug": "isomorphic-strings", "title": "Isomorphic Strings", "topics": [ "hash-table", "string" ], "url": "https://leetcode.com/problems/isomorphic-strings/" }, { "difficulty": "easy", "number": 290, "premium": false, "slug": "word-pattern", "title": "Word Pattern", "topics": [ "hash-table", "string" ], "url": "https://leetcode.com/problems/word-pattern/" }, { "difficulty": "easy", "number": 242, "premium": false, "slug": "valid-anagram", "title": "Valid Anagram", "topics": [ "hash-table", "string", "sorting" ], "url": "https://leetcode.com/problems/valid-anagram/" }, { "difficulty": "medium", "number": 49, "premium": false, "slug": "group-anagrams", "title": "Group Anagrams", "topics": [ "array", "hash-table", "string", "sorting" ], "url": "https://leetcode.com/problems/group-anagrams/" }, { "difficulty": "easy", "number": 1, "premium": false, "slug": "two-sum", "title": "Two Sum", "topics": [ "array", "hash-table" ], "url": "https://leetcode.com/problems/two-sum/" }, { "difficulty": "easy", "number": 202, "premium": false, "slug": "happy-number", "title": "Happy Number", "topics": [ "hash-table", "math", "two-pointers", "floyds-cycle-finding-algorithm" ], "url": "https://leetcode.com/problems/happy-number/" }, { "difficulty": "easy", "number": 219, "premium": false, "slug": "contains-duplicate-ii", "title": "Contains Duplicate II", "topics": [ "array", "hash-table", "sliding-window" ], "url": "https://leetcode.com/problems/contains-duplicate-ii/" }, { "difficulty": "medium", "number": 128, "premium": false, "slug": "longest-consecutive-sequence", "title": "Longest Consecutive Sequence", "topics": [ "array", "hash-table", "union-find" ], "url": "https://leetcode.com/problems/longest-consecutive-sequence/" } ], "problems_count": 9, "slug": "top-interview-150-5-nfzq" }, { "name": "Intervals", "premium_only": false, "problems": [ { "difficulty": "easy", "number": 228, "premium": false, "slug": "summary-ranges", "title": "Summary Ranges", "topics": [ "array" ], "url": "https://leetcode.com/problems/summary-ranges/" }, { "difficulty": "medium", "number": 56, "premium": false, "slug": "merge-intervals", "title": "Merge Intervals", "topics": [ "array", "sorting", "quicksort" ], "url": "https://leetcode.com/problems/merge-intervals/" }, { "difficulty": "medium", "number": 57, "premium": false, "slug": "insert-interval", "title": "Insert Interval", "topics": [ "array" ], "url": "https://leetcode.com/problems/insert-interval/" }, { "difficulty": "medium", "number": 452, "premium": false, "slug": "minimum-number-of-arrows-to-burst-balloons", "title": "Minimum Number of Arrows to Burst Balloons", "topics": [ "array", "greedy", "sorting" ], "url": "https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/" } ], "problems_count": 4, "slug": "top-interview-150-6-ni2n" }, { "name": "Stack", "premium_only": false, "problems": [ { "difficulty": "easy", "number": 20, "premium": false, "slug": "valid-parentheses", "title": "Valid Parentheses", "topics": [ "string", "stack", "bracket-sequences" ], "url": "https://leetcode.com/problems/valid-parentheses/" }, { "difficulty": "medium", "number": 71, "premium": false, "slug": "simplify-path", "title": "Simplify Path", "topics": [ "string", "stack" ], "url": "https://leetcode.com/problems/simplify-path/" }, { "difficulty": "medium", "number": 155, "premium": false, "slug": "min-stack", "title": "Min Stack", "topics": [ "stack", "design" ], "url": "https://leetcode.com/problems/min-stack/" }, { "difficulty": "medium", "number": 150, "premium": false, "slug": "evaluate-reverse-polish-notation", "title": "Evaluate Reverse Polish Notation", "topics": [ "array", "math", "stack" ], "url": "https://leetcode.com/problems/evaluate-reverse-polish-notation/" }, { "difficulty": "hard", "number": 224, "premium": false, "slug": "basic-calculator", "title": "Basic Calculator", "topics": [ "math", "string", "stack", "recursion" ], "url": "https://leetcode.com/problems/basic-calculator/" } ], "problems_count": 5, "slug": "top-interview-150-7-x7pk" }, { "name": "Linked List", "premium_only": false, "problems": [ { "difficulty": "easy", "number": 141, "premium": false, "slug": "linked-list-cycle", "title": "Linked List Cycle", "topics": [ "hash-table", "linked-list", "two-pointers", "floyds-cycle-finding-algorithm" ], "url": "https://leetcode.com/problems/linked-list-cycle/" }, { "difficulty": "medium", "number": 2, "premium": false, "slug": "add-two-numbers", "title": "Add Two Numbers", "topics": [ "linked-list", "math", "recursion" ], "url": "https://leetcode.com/problems/add-two-numbers/" }, { "difficulty": "easy", "number": 21, "premium": false, "slug": "merge-two-sorted-lists", "title": "Merge Two Sorted Lists", "topics": [ "linked-list", "recursion" ], "url": "https://leetcode.com/problems/merge-two-sorted-lists/" }, { "difficulty": "medium", "number": 138, "premium": false, "slug": "copy-list-with-random-pointer", "title": "Copy List with Random Pointer", "topics": [ "hash-table", "linked-list" ], "url": "https://leetcode.com/problems/copy-list-with-random-pointer/" }, { "difficulty": "medium", "number": 92, "premium": false, "slug": "reverse-linked-list-ii", "title": "Reverse Linked List II", "topics": [ "linked-list" ], "url": "https://leetcode.com/problems/reverse-linked-list-ii/" }, { "difficulty": "hard", "number": 25, "premium": false, "slug": "reverse-nodes-in-k-group", "title": "Reverse Nodes in k-Group", "topics": [ "linked-list", "recursion" ], "url": "https://leetcode.com/problems/reverse-nodes-in-k-group/" }, { "difficulty": "medium", "number": 19, "premium": false, "slug": "remove-nth-node-from-end-of-list", "title": "Remove Nth Node From End of List", "topics": [ "linked-list", "two-pointers" ], "url": "https://leetcode.com/problems/remove-nth-node-from-end-of-list/" }, { "difficulty": "medium", "number": 82, "premium": false, "slug": "remove-duplicates-from-sorted-list-ii", "title": "Remove Duplicates from Sorted List II", "topics": [ "linked-list", "two-pointers" ], "url": "https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/" }, { "difficulty": "medium", "number": 61, "premium": false, "slug": "rotate-list", "title": "Rotate List", "topics": [ "linked-list", "two-pointers" ], "url": "https://leetcode.com/problems/rotate-list/" }, { "difficulty": "medium", "number": 86, "premium": false, "slug": "partition-list", "title": "Partition List", "topics": [ "linked-list", "two-pointers" ], "url": "https://leetcode.com/problems/partition-list/" }, { "difficulty": "medium", "number": 146, "premium": false, "slug": "lru-cache", "title": "LRU Cache", "topics": [ "hash-table", "linked-list", "design", "doubly-linked-list" ], "url": "https://leetcode.com/problems/lru-cache/" } ], "problems_count": 11, "slug": "top-interview-150-8-rvcb" }, { "name": "Binary Tree General", "premium_only": false, "problems": [ { "difficulty": "easy", "number": 104, "premium": false, "slug": "maximum-depth-of-binary-tree", "title": "Maximum Depth of Binary Tree", "topics": [ "tree", "depth-first-search", "breadth-first-search", "binary-tree" ], "url": "https://leetcode.com/problems/maximum-depth-of-binary-tree/" }, { "difficulty": "easy", "number": 100, "premium": false, "slug": "same-tree", "title": "Same Tree", "topics": [ "tree", "depth-first-search", "breadth-first-search", "binary-tree" ], "url": "https://leetcode.com/problems/same-tree/" }, { "difficulty": "easy", "number": 226, "premium": false, "slug": "invert-binary-tree", "title": "Invert Binary Tree", "topics": [ "tree", "depth-first-search", "breadth-first-search", "binary-tree" ], "url": "https://leetcode.com/problems/invert-binary-tree/" }, { "difficulty": "easy", "number": 101, "premium": false, "slug": "symmetric-tree", "title": "Symmetric Tree", "topics": [ "tree", "depth-first-search", "breadth-first-search", "binary-tree" ], "url": "https://leetcode.com/problems/symmetric-tree/" }, { "difficulty": "medium", "number": 105, "premium": false, "slug": "construct-binary-tree-from-preorder-and-inorder-traversal", "title": "Construct Binary Tree from Preorder and Inorder Traversal", "topics": [ "array", "hash-table", "divide-and-conquer", "tree", "binary-tree" ], "url": "https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/" }, { "difficulty": "medium", "number": 106, "premium": false, "slug": "construct-binary-tree-from-inorder-and-postorder-traversal", "title": "Construct Binary Tree from Inorder and Postorder Traversal", "topics": [ "array", "hash-table", "divide-and-conquer", "tree", "binary-tree" ], "url": "https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/" }, { "difficulty": "medium", "number": 117, "premium": false, "slug": "populating-next-right-pointers-in-each-node-ii", "title": "Populating Next Right Pointers in Each Node II", "topics": [ "linked-list", "tree", "depth-first-search", "breadth-first-search", "binary-tree" ], "url": "https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/" }, { "difficulty": "medium", "number": 114, "premium": false, "slug": "flatten-binary-tree-to-linked-list", "title": "Flatten Binary Tree to Linked List", "topics": [ "linked-list", "stack", "tree", "depth-first-search", "binary-tree" ], "url": "https://leetcode.com/problems/flatten-binary-tree-to-linked-list/" }, { "difficulty": "easy", "number": 112, "premium": false, "slug": "path-sum", "title": "Path Sum", "topics": [ "tree", "depth-first-search", "breadth-first-search", "binary-tree" ], "url": "https://leetcode.com/problems/path-sum/" }, { "difficulty": "medium", "number": 129, "premium": false, "slug": "sum-root-to-leaf-numbers", "title": "Sum Root to Leaf Numbers", "topics": [ "tree", "depth-first-search", "binary-tree" ], "url": "https://leetcode.com/problems/sum-root-to-leaf-numbers/" }, { "difficulty": "hard", "number": 124, "premium": false, "slug": "binary-tree-maximum-path-sum", "title": "Binary Tree Maximum Path Sum", "topics": [ "dynamic-programming", "tree", "depth-first-search", "binary-tree", "dp-on-trees" ], "url": "https://leetcode.com/problems/binary-tree-maximum-path-sum/" }, { "difficulty": "medium", "number": 173, "premium": false, "slug": "binary-search-tree-iterator", "title": "Binary Search Tree Iterator", "topics": [ "stack", "tree", "design", "binary-search-tree", "binary-tree", "iterator" ], "url": "https://leetcode.com/problems/binary-search-tree-iterator/" }, { "difficulty": "medium", "number": 222, "premium": false, "slug": "count-complete-tree-nodes", "title": "Count Complete Tree Nodes", "topics": [ "binary-search", "bit-manipulation", "tree", "binary-tree" ], "url": "https://leetcode.com/problems/count-complete-tree-nodes/" }, { "difficulty": "medium", "number": 236, "premium": false, "slug": "lowest-common-ancestor-of-a-binary-tree", "title": "Lowest Common Ancestor of a Binary Tree", "topics": [ "tree", "depth-first-search", "binary-tree", "binary-lifting", "lowest-common-ancestor" ], "url": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/" } ], "problems_count": 14, "slug": "top-interview-150-9-ozek" }, { "name": "Binary Tree BFS", "premium_only": false, "problems": [ { "difficulty": "medium", "number": 199, "premium": false, "slug": "binary-tree-right-side-view", "title": "Binary Tree Right Side View", "topics": [ "tree", "depth-first-search", "breadth-first-search", "binary-tree" ], "url": "https://leetcode.com/problems/binary-tree-right-side-view/" }, { "difficulty": "easy", "number": 637, "premium": false, "slug": "average-of-levels-in-binary-tree", "title": "Average of Levels in Binary Tree", "topics": [ "tree", "depth-first-search", "breadth-first-search", "binary-tree" ], "url": "https://leetcode.com/problems/average-of-levels-in-binary-tree/" }, { "difficulty": "medium", "number": 102, "premium": false, "slug": "binary-tree-level-order-traversal", "title": "Binary Tree Level Order Traversal", "topics": [ "tree", "breadth-first-search", "binary-tree" ], "url": "https://leetcode.com/problems/binary-tree-level-order-traversal/" }, { "difficulty": "medium", "number": 103, "premium": false, "slug": "binary-tree-zigzag-level-order-traversal", "title": "Binary Tree Zigzag Level Order Traversal", "topics": [ "tree", "breadth-first-search", "binary-tree" ], "url": "https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/" } ], "problems_count": 4, "slug": "top-interview-150-10-ibmi" }, { "name": "Binary Search Tree", "premium_only": false, "problems": [ { "difficulty": "easy", "number": 530, "premium": false, "slug": "minimum-absolute-difference-in-bst", "title": "Minimum Absolute Difference in BST", "topics": [ "tree", "depth-first-search", "breadth-first-search", "binary-search-tree", "binary-tree" ], "url": "https://leetcode.com/problems/minimum-absolute-difference-in-bst/" }, { "difficulty": "medium", "number": 230, "premium": false, "slug": "kth-smallest-element-in-a-bst", "title": "Kth Smallest Element in a BST", "topics": [ "tree", "depth-first-search", "binary-search-tree", "binary-tree" ], "url": "https://leetcode.com/problems/kth-smallest-element-in-a-bst/" }, { "difficulty": "medium", "number": 98, "premium": false, "slug": "validate-binary-search-tree", "title": "Validate Binary Search Tree", "topics": [ "tree", "depth-first-search", "binary-search-tree", "binary-tree" ], "url": "https://leetcode.com/problems/validate-binary-search-tree/" } ], "problems_count": 3, "slug": "top-interview-150-11-z3y5" }, { "name": "Graph General", "premium_only": false, "problems": [ { "difficulty": "medium", "number": 200, "premium": false, "slug": "number-of-islands", "title": "Number of Islands", "topics": [ "array", "depth-first-search", "breadth-first-search", "union-find", "matrix" ], "url": "https://leetcode.com/problems/number-of-islands/" }, { "difficulty": "medium", "number": 130, "premium": false, "slug": "surrounded-regions", "title": "Surrounded Regions", "topics": [ "array", "depth-first-search", "breadth-first-search", "union-find", "matrix" ], "url": "https://leetcode.com/problems/surrounded-regions/" }, { "difficulty": "medium", "number": 133, "premium": false, "slug": "clone-graph", "title": "Clone Graph", "topics": [ "hash-table", "depth-first-search", "breadth-first-search", "graph" ], "url": "https://leetcode.com/problems/clone-graph/" }, { "difficulty": "medium", "number": 399, "premium": false, "slug": "evaluate-division", "title": "Evaluate Division", "topics": [ "array", "string", "depth-first-search", "breadth-first-search", "union-find", "graph", "shortest-path", "bellman-ford-algorithm", "floyd-warshall-algorithm" ], "url": "https://leetcode.com/problems/evaluate-division/" }, { "difficulty": "medium", "number": 207, "premium": false, "slug": "course-schedule", "title": "Course Schedule", "topics": [ "depth-first-search", "breadth-first-search", "graph", "topological-sort", "directed-acyclic-graph" ], "url": "https://leetcode.com/problems/course-schedule/" }, { "difficulty": "medium", "number": 210, "premium": false, "slug": "course-schedule-ii", "title": "Course Schedule II", "topics": [ "depth-first-search", "breadth-first-search", "graph", "topological-sort" ], "url": "https://leetcode.com/problems/course-schedule-ii/" } ], "problems_count": 6, "slug": "top-interview-150-12-7djr" }, { "name": "Graph BFS", "premium_only": false, "problems": [ { "difficulty": "medium", "number": 909, "premium": false, "slug": "snakes-and-ladders", "title": "Snakes and Ladders", "topics": [ "array", "breadth-first-search", "matrix" ], "url": "https://leetcode.com/problems/snakes-and-ladders/" }, { "difficulty": "medium", "number": 433, "premium": false, "slug": "minimum-genetic-mutation", "title": "Minimum Genetic Mutation", "topics": [ "hash-table", "string", "breadth-first-search", "bidirectional-search" ], "url": "https://leetcode.com/problems/minimum-genetic-mutation/" }, { "difficulty": "hard", "number": 127, "premium": false, "slug": "word-ladder", "title": "Word Ladder", "topics": [ "hash-table", "string", "breadth-first-search", "bidirectional-search" ], "url": "https://leetcode.com/problems/word-ladder/" } ], "problems_count": 3, "slug": "top-interview-150-13-9z8t" }, { "name": "Trie", "premium_only": false, "problems": [ { "difficulty": "medium", "number": 208, "premium": false, "slug": "implement-trie-prefix-tree", "title": "Implement Trie (Prefix Tree)", "topics": [ "hash-table", "string", "design", "trie" ], "url": "https://leetcode.com/problems/implement-trie-prefix-tree/" }, { "difficulty": "medium", "number": 211, "premium": false, "slug": "design-add-and-search-words-data-structure", "title": "Design Add and Search Words Data Structure", "topics": [ "string", "depth-first-search", "design", "trie" ], "url": "https://leetcode.com/problems/design-add-and-search-words-data-structure/" }, { "difficulty": "hard", "number": 212, "premium": false, "slug": "word-search-ii", "title": "Word Search II", "topics": [ "array", "string", "backtracking", "trie", "matrix" ], "url": "https://leetcode.com/problems/word-search-ii/" } ], "problems_count": 3, "slug": "top-interview-150-14-lih2" }, { "name": "Backtracking", "premium_only": false, "problems": [ { "difficulty": "medium", "number": 17, "premium": false, "slug": "letter-combinations-of-a-phone-number", "title": "Letter Combinations of a Phone Number", "topics": [ "hash-table", "string", "backtracking" ], "url": "https://leetcode.com/problems/letter-combinations-of-a-phone-number/" }, { "difficulty": "medium", "number": 77, "premium": false, "slug": "combinations", "title": "Combinations", "topics": [ "backtracking" ], "url": "https://leetcode.com/problems/combinations/" }, { "difficulty": "medium", "number": 46, "premium": false, "slug": "permutations", "title": "Permutations", "topics": [ "array", "backtracking" ], "url": "https://leetcode.com/problems/permutations/" }, { "difficulty": "medium", "number": 39, "premium": false, "slug": "combination-sum", "title": "Combination Sum", "topics": [ "array", "backtracking" ], "url": "https://leetcode.com/problems/combination-sum/" }, { "difficulty": "hard", "number": 52, "premium": false, "slug": "n-queens-ii", "title": "N-Queens II", "topics": [ "backtracking", "algorithm-x" ], "url": "https://leetcode.com/problems/n-queens-ii/" }, { "difficulty": "medium", "number": 22, "premium": false, "slug": "generate-parentheses", "title": "Generate Parentheses", "topics": [ "string", "dynamic-programming", "backtracking", "bracket-sequences" ], "url": "https://leetcode.com/problems/generate-parentheses/" }, { "difficulty": "medium", "number": 79, "premium": false, "slug": "word-search", "title": "Word Search", "topics": [ "array", "string", "backtracking", "depth-first-search", "matrix" ], "url": "https://leetcode.com/problems/word-search/" } ], "problems_count": 7, "slug": "top-interview-150-15-rpt9" }, { "name": "Divide & Conquer", "premium_only": false, "problems": [ { "difficulty": "easy", "number": 108, "premium": false, "slug": "convert-sorted-array-to-binary-search-tree", "title": "Convert Sorted Array to Binary Search Tree", "topics": [ "array", "divide-and-conquer", "tree", "binary-search-tree", "binary-tree" ], "url": "https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/" }, { "difficulty": "medium", "number": 148, "premium": false, "slug": "sort-list", "title": "Sort List", "topics": [ "linked-list", "two-pointers", "divide-and-conquer", "sorting", "merge-sort" ], "url": "https://leetcode.com/problems/sort-list/" }, { "difficulty": "medium", "number": 427, "premium": false, "slug": "construct-quad-tree", "title": "Construct Quad Tree", "topics": [ "array", "divide-and-conquer", "tree", "matrix" ], "url": "https://leetcode.com/problems/construct-quad-tree/" }, { "difficulty": "hard", "number": 23, "premium": false, "slug": "merge-k-sorted-lists", "title": "Merge k Sorted Lists", "topics": [ "linked-list", "divide-and-conquer", "heap-priority-queue", "merge-sort", "tournament-sort" ], "url": "https://leetcode.com/problems/merge-k-sorted-lists/" } ], "problems_count": 4, "slug": "top-interview-150-16-z95i" }, { "name": "Kadane's Algorithm", "premium_only": false, "problems": [ { "difficulty": "medium", "number": 53, "premium": false, "slug": "maximum-subarray", "title": "Maximum Subarray", "topics": [ "array", "divide-and-conquer", "dynamic-programming" ], "url": "https://leetcode.com/problems/maximum-subarray/" }, { "difficulty": "medium", "number": 918, "premium": false, "slug": "maximum-sum-circular-subarray", "title": "Maximum Sum Circular Subarray", "topics": [ "array", "divide-and-conquer", "dynamic-programming", "queue", "monotonic-queue" ], "url": "https://leetcode.com/problems/maximum-sum-circular-subarray/" } ], "problems_count": 2, "slug": "top-interview-150-17-tjhz" }, { "name": "Binary Search", "premium_only": false, "problems": [ { "difficulty": "easy", "number": 35, "premium": false, "slug": "search-insert-position", "title": "Search Insert Position", "topics": [ "array", "binary-search" ], "url": "https://leetcode.com/problems/search-insert-position/" }, { "difficulty": "medium", "number": 74, "premium": false, "slug": "search-a-2d-matrix", "title": "Search a 2D Matrix", "topics": [ "array", "binary-search", "matrix" ], "url": "https://leetcode.com/problems/search-a-2d-matrix/" }, { "difficulty": "medium", "number": 162, "premium": false, "slug": "find-peak-element", "title": "Find Peak Element", "topics": [ "array", "binary-search" ], "url": "https://leetcode.com/problems/find-peak-element/" }, { "difficulty": "medium", "number": 33, "premium": false, "slug": "search-in-rotated-sorted-array", "title": "Search in Rotated Sorted Array", "topics": [ "array", "binary-search" ], "url": "https://leetcode.com/problems/search-in-rotated-sorted-array/" }, { "difficulty": "medium", "number": 34, "premium": false, "slug": "find-first-and-last-position-of-element-in-sorted-array", "title": "Find First and Last Position of Element in Sorted Array", "topics": [ "array", "binary-search" ], "url": "https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/" }, { "difficulty": "medium", "number": 153, "premium": false, "slug": "find-minimum-in-rotated-sorted-array", "title": "Find Minimum in Rotated Sorted Array", "topics": [ "array", "binary-search" ], "url": "https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/" }, { "difficulty": "hard", "number": 4, "premium": false, "slug": "median-of-two-sorted-arrays", "title": "Median of Two Sorted Arrays", "topics": [ "array", "binary-search", "divide-and-conquer" ], "url": "https://leetcode.com/problems/median-of-two-sorted-arrays/" } ], "problems_count": 7, "slug": "top-interview-150-18-quur" }, { "name": "Heap", "premium_only": false, "problems": [ { "difficulty": "medium", "number": 215, "premium": false, "slug": "kth-largest-element-in-an-array", "title": "Kth Largest Element in an Array", "topics": [ "array", "divide-and-conquer", "sorting", "heap-priority-queue", "quickselect" ], "url": "https://leetcode.com/problems/kth-largest-element-in-an-array/" }, { "difficulty": "hard", "number": 502, "premium": false, "slug": "ipo", "title": "IPO", "topics": [ "array", "greedy", "sorting", "heap-priority-queue" ], "url": "https://leetcode.com/problems/ipo/" }, { "difficulty": "medium", "number": 373, "premium": false, "slug": "find-k-pairs-with-smallest-sums", "title": "Find K Pairs with Smallest Sums", "topics": [ "array", "heap-priority-queue" ], "url": "https://leetcode.com/problems/find-k-pairs-with-smallest-sums/" }, { "difficulty": "hard", "number": 295, "premium": false, "slug": "find-median-from-data-stream", "title": "Find Median from Data Stream", "topics": [ "two-pointers", "design", "sorting", "heap-priority-queue", "data-stream" ], "url": "https://leetcode.com/problems/find-median-from-data-stream/" } ], "problems_count": 4, "slug": "top-interview-150-19-w23l" }, { "name": "Bit Manipulation", "premium_only": false, "problems": [ { "difficulty": "easy", "number": 67, "premium": false, "slug": "add-binary", "title": "Add Binary", "topics": [ "math", "string", "bit-manipulation", "simulation" ], "url": "https://leetcode.com/problems/add-binary/" }, { "difficulty": "easy", "number": 190, "premium": false, "slug": "reverse-bits", "title": "Reverse Bits", "topics": [ "divide-and-conquer", "bit-manipulation" ], "url": "https://leetcode.com/problems/reverse-bits/" }, { "difficulty": "easy", "number": 191, "premium": false, "slug": "number-of-1-bits", "title": "Number of 1 Bits", "topics": [ "divide-and-conquer", "bit-manipulation" ], "url": "https://leetcode.com/problems/number-of-1-bits/" }, { "difficulty": "easy", "number": 136, "premium": false, "slug": "single-number", "title": "Single Number", "topics": [ "array", "bit-manipulation" ], "url": "https://leetcode.com/problems/single-number/" }, { "difficulty": "medium", "number": 137, "premium": false, "slug": "single-number-ii", "title": "Single Number II", "topics": [ "array", "bit-manipulation" ], "url": "https://leetcode.com/problems/single-number-ii/" }, { "difficulty": "medium", "number": 201, "premium": false, "slug": "bitwise-and-of-numbers-range", "title": "Bitwise AND of Numbers Range", "topics": [ "bit-manipulation" ], "url": "https://leetcode.com/problems/bitwise-and-of-numbers-range/" } ], "problems_count": 6, "slug": "top-interview-150-20-m490" }, { "name": "Math", "premium_only": false, "problems": [ { "difficulty": "easy", "number": 9, "premium": false, "slug": "palindrome-number", "title": "Palindrome Number", "topics": [ "math" ], "url": "https://leetcode.com/problems/palindrome-number/" }, { "difficulty": "easy", "number": 66, "premium": false, "slug": "plus-one", "title": "Plus One", "topics": [ "array", "math" ], "url": "https://leetcode.com/problems/plus-one/" }, { "difficulty": "medium", "number": 172, "premium": false, "slug": "factorial-trailing-zeroes", "title": "Factorial Trailing Zeroes", "topics": [ "math" ], "url": "https://leetcode.com/problems/factorial-trailing-zeroes/" }, { "difficulty": "easy", "number": 69, "premium": false, "slug": "sqrtx", "title": "Sqrt(x)", "topics": [ "math", "binary-search", "newtons-method" ], "url": "https://leetcode.com/problems/sqrtx/" }, { "difficulty": "medium", "number": 50, "premium": false, "slug": "powx-n", "title": "Pow(x, n)", "topics": [ "math", "recursion" ], "url": "https://leetcode.com/problems/powx-n/" }, { "difficulty": "hard", "number": 149, "premium": false, "slug": "max-points-on-a-line", "title": "Max Points on a Line", "topics": [ "array", "hash-table", "math", "geometry", "euclidean-algorithm", "greatest-common-divisor" ], "url": "https://leetcode.com/problems/max-points-on-a-line/" } ], "problems_count": 6, "slug": "top-interview-150-21-098q" }, { "name": "1D DP", "premium_only": false, "problems": [ { "difficulty": "easy", "number": 70, "premium": false, "slug": "climbing-stairs", "title": "Climbing Stairs", "topics": [ "math", "dynamic-programming", "memoization" ], "url": "https://leetcode.com/problems/climbing-stairs/" }, { "difficulty": "medium", "number": 198, "premium": false, "slug": "house-robber", "title": "House Robber", "topics": [ "array", "dynamic-programming" ], "url": "https://leetcode.com/problems/house-robber/" }, { "difficulty": "medium", "number": 139, "premium": false, "slug": "word-break", "title": "Word Break", "topics": [ "array", "hash-table", "string", "dynamic-programming", "trie", "memoization", "brute-force-search" ], "url": "https://leetcode.com/problems/word-break/" }, { "difficulty": "medium", "number": 322, "premium": false, "slug": "coin-change", "title": "Coin Change", "topics": [ "array", "dynamic-programming", "breadth-first-search", "knapsack-problem", "complete-knapsack" ], "url": "https://leetcode.com/problems/coin-change/" }, { "difficulty": "medium", "number": 300, "premium": false, "slug": "longest-increasing-subsequence", "title": "Longest Increasing Subsequence", "topics": [ "array", "binary-search", "dynamic-programming", "longest-increasing-subsequence" ], "url": "https://leetcode.com/problems/longest-increasing-subsequence/" } ], "problems_count": 5, "slug": "top-interview-150-22-p3qn" }, { "name": "Multidimensional DP", "premium_only": false, "problems": [ { "difficulty": "medium", "number": 120, "premium": false, "slug": "triangle", "title": "Triangle", "topics": [ "array", "dynamic-programming" ], "url": "https://leetcode.com/problems/triangle/" }, { "difficulty": "medium", "number": 64, "premium": false, "slug": "minimum-path-sum", "title": "Minimum Path Sum", "topics": [ "array", "dynamic-programming", "matrix" ], "url": "https://leetcode.com/problems/minimum-path-sum/" }, { "difficulty": "medium", "number": 63, "premium": false, "slug": "unique-paths-ii", "title": "Unique Paths II", "topics": [ "array", "dynamic-programming", "matrix" ], "url": "https://leetcode.com/problems/unique-paths-ii/" }, { "difficulty": "medium", "number": 5, "premium": false, "slug": "longest-palindromic-substring", "title": "Longest Palindromic Substring", "topics": [ "two-pointers", "string", "dynamic-programming", "manacher" ], "url": "https://leetcode.com/problems/longest-palindromic-substring/" }, { "difficulty": "medium", "number": 97, "premium": false, "slug": "interleaving-string", "title": "Interleaving String", "topics": [ "string", "dynamic-programming" ], "url": "https://leetcode.com/problems/interleaving-string/" }, { "difficulty": "medium", "number": 72, "premium": false, "slug": "edit-distance", "title": "Edit Distance", "topics": [ "string", "dynamic-programming" ], "url": "https://leetcode.com/problems/edit-distance/" }, { "difficulty": "hard", "number": 123, "premium": false, "slug": "best-time-to-buy-and-sell-stock-iii", "title": "Best Time to Buy and Sell Stock III", "topics": [ "array", "dynamic-programming" ], "url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/" }, { "difficulty": "hard", "number": 188, "premium": false, "slug": "best-time-to-buy-and-sell-stock-iv", "title": "Best Time to Buy and Sell Stock IV", "topics": [ "array", "dynamic-programming" ], "url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/" }, { "difficulty": "medium", "number": 221, "premium": false, "slug": "maximal-square", "title": "Maximal Square", "topics": [ "array", "dynamic-programming", "matrix" ], "url": "https://leetcode.com/problems/maximal-square/" } ], "problems_count": 9, "slug": "top-interview-150-23-cpbf" } ], "highlight": "Must-do List for Interview Prep", "name": "Top Interview 150", "premium_only": false, "problems_count": 150, "related": [ { "highlight": "Ace Coding Interview with 75 Qs", "name": "LeetCode 75", "premium_only": false, "slug": "leetcode-75" }, { "highlight": "100 Best Rated Problems", "name": "Top 100 Liked", "premium_only": false, "slug": "top-100-liked" }, { "highlight": "LeetCode Staff Pick", "name": "Premium Algo 100", "premium_only": true, "slug": "premium-algo-100" }, { "highlight": "Excel Implementation Skills in 50 Qs", "name": "Programming Skills", "premium_only": false, "slug": "programming-skills" } ], "slug": "top-interview-150", "url": "https://leetcode.com/studyplan/top-interview-150/" }
Common questions
Do I need a separate key for every provider?
Use your OpenAny API key for standard API access. Read it from OPENANY_API_KEY in your environment and keep it out of prompts, source code and logs.
Are these providers interchangeable?
No. Each offering has its own inputs, pricing and response contract. Selecting a catalog offering does not establish automatic routing or fallback. Confirm the service contract before calling.
How is this API billed?
API-key calls use your shared balance at the selected implementation's published rate. Check the billing unit and request-specific pricing rules before making a paid call. Recorded usage determines the final charge under that contract.
Where do the price and contract come from?
The selected implementation publishes its provider, request contract, revision and billing rules through OpenAny's public API catalog. A revision number identifies a contract version, not a price update date. A price update timestamp is not supplied; do not treat a page date as one.
How do OpenAny Balance and x402 differ?
OpenAny Balance uses an API key and one shared balance. Card, USDC and x402 top-ups, card auto top-up and USDC subscriptions fund that balance; available routes appear on the Credits page. Direct x402 is a separate pay-per-request flow, available only on listings that show it and requiring an authorized payment client.
Does Playground send a paid request?
Yes. After you sign in, Run sends a real API request using an active OpenAny API key. Charges follow the published API contract and use your shared balance. Selecting an implementation, editing inputs and viewing sample responses do not send requests.
Use LeetCode study plans API with your agent
Inspect endpoint contracts and confirm availability and pricing before a paid call.