Skip to content

Instantly share code, notes, and snippets.

@justaguywhocodes
Created March 11, 2022 00:14
Show Gist options
  • Save justaguywhocodes/13aa16a0b011c2b8ab826bb5f4d7caef to your computer and use it in GitHub Desktop.
Save justaguywhocodes/13aa16a0b011c2b8ab826bb5f4d7caef to your computer and use it in GitHub Desktop.
{
"pageProps": {
"_nextI18Next": {
"initialI18nStore": {
"en": {
"common": {
"meta": {
"title": "",
"description": "",
"keywords": ""
},
"header": {
"logo": {
"url": "",
"description": ""
},
"title": {
"problemset-all": ""
},
"action": {
"login": {
"text": "",
"url": ""
}
}
},
"conjunctions": {
"and": "and",
"or": "or"
},
"pages": {
"leetcode": "LeetCode",
"explore": "Explore",
"problems": "Problems",
"interview": {
"interview": "Interview",
"onlineInterview": "Online Interview",
"assessment": "Assessment"
},
"contest": "Contest",
"discuss": "Discuss",
"store": {
"store": "Store",
"redeem": "Redeem",
"premium": "Premium",
"shop": "Micro-shop"
},
"admin": {
"admin": "Admin",
"library": "Library",
"review": "Review",
"operations": "User Management",
"scores": "Points",
"contribute": "Contribution",
"backend": "Administration",
"internalContest": "Internal Contest Dashboard",
"contestDashboard": "Contest Dashboard",
"contestAdmin": "Contest Cheating Dashboard",
"dangerZone": "Danger Zone"
},
"mobileApp": "Mobile App",
"playground": "Playground",
"signIn": "Sign in",
"register": "Register",
"signOut": "Sign Out"
},
"userMenu": {
"renew": "Renew",
"getPremium": "Access all features with our Premium subscription!",
"orders": "Orders",
"translateQuestions": "Display problems in Chinese",
"unmockUser": "Unmock User",
"categories": {
"myList": "My Lists",
"notebook": "Notebook",
"submissions": "Submissions",
"session": "Session",
"points": "Points",
"progress": "Progress"
}
},
"playground": {
"playground": "Playground",
"myPlaygrounds": "My Playgrounds",
"remainingPlaygrounds": "Remaining",
"renew": "Renew",
"templates": {
"consoleApplication": "Console Application",
"empty": "New Playground",
"frontend": "Frontend",
"machineLearning": "Machine Learning"
}
},
"links": {
"premium": "/subscribe/",
"discuss": "/discuss/",
"assessment": "/assessment/",
"shop": "https://detail.youzan.com/show/goods/newest?alias=271n43vr9hen7",
"onlineInterview": "https://interview.leetcode.com/interview/",
"profileArticles": "/submissions/",
"orders": "/store/orders/",
"explore": "/explore/",
"admin": {
"scores": "/points/admin",
"operations": "/user_management"
}
},
"pagination": {
"perpage": "/ page"
},
"expand": "Expand",
"collapse": "Collapse"
},
"problemset": {
"meta": {
"title": "Problems - LeetCode",
"description": "Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.",
"keywords": "",
"ogImage": "https://leetcode.com/static/images/LeetCode_Sharing.png"
}
},
"question-list": {
"table": {
"header": {
"status": "Status",
"title": "Title",
"solution": "Solution",
"acceptance": "Acceptance",
"difficulty": "Difficulty",
"frequency": "Frequency",
"company": "Company"
},
"tooltip": {
"frequency": "Frequency of problems that appear in real interviews"
}
},
"filter": {
"key": {
"difficulty": "difficulty",
"status": "status",
"topics": "topicSlugs",
"companies": "companySlugs",
"list": "listId",
"solution": "editorialFilter",
"search": "search"
},
"difficulty": "Difficulty",
"status": "Status",
"list": "Lists",
"tag": "Tags",
"tagSearch": "Filter topics",
"expand": "Expand",
"collapse": "Collapse",
"reset": "Reset",
"searchPlaceholder": "Search questions",
"noResult": "No result"
},
"settings": {
"showTopicTags": "Show topic tags",
"premiumQuestions": "Premium questions",
"showCompanyTags": "Show companies"
},
"allTopics": "All Topics",
"pickOne": "Pick One",
"difficulty": {
"easy": "Easy",
"medium": "Medium",
"hard": "Hard"
},
"status": {
"todo": "Todo",
"solved": "Solved",
"attempted": "Attempted"
},
"topicTags": {
"expand": "Expand",
"collapse": "Collapse"
},
"frequency": {
"lockNotice": ""
}
},
"featured-list": {
"featured": "Featured Lists",
"problemsSolved": "Problems solved:",
"listNotFound": "List not found",
"pickOne": "Pick One",
"share": "Share"
}
},
"zh": {
"common": {
"meta": {
"title": "",
"description": "",
"keywords": ""
},
"header": {
"logo": {
"url": "",
"description": ""
},
"title": {
"problemset-all": ""
},
"action": {
"login": {
"text": "",
"url": ""
}
}
},
"conjunctions": {
"and": "and",
"or": "或"
},
"pages": {
"leetcode": "LeetCode",
"explore": "学习",
"problems": "题库",
"interview": {
"interview": "求职",
"onlineInterview": "在线面试",
"assessment": "Assessment"
},
"contest": "竞赛",
"discuss": "讨论",
"store": {
"store": "商店",
"redeem": "力扣周边",
"premium": "Plus 会员",
"shop": "精品商城"
},
"admin": {
"admin": "管理员",
"library": "题库",
"translation": "翻译",
"operations": "运营管理",
"scores": "点数",
"contribute": "贡献",
"backend": "后台管理",
"twoStepVerification": "二步验证"
},
"mobileApp": "下载 App",
"playground": "Playground",
"signIn": "登录",
"register": "注册",
"signOut": "退出"
},
"userMenu": {
"renew": "续订",
"getPremium": "升级 Plus 会员享专属特权",
"orders": "订单",
"resume": "个人资料",
"translateQuestions": "题目以中文展示",
"translateQuestionsEn": "题目以英文显示",
"enterprise": "企业招聘",
"categories": {
"myList": "收藏夹",
"notebook": "笔记本",
"submissions": "我的题解",
"session": "进度管理",
"points": "积分",
"progress": "做题分析"
}
},
"playground": {
"playground": "Playground",
"remainingPlaygrounds": "数量",
"renew": "升级",
"myPlaygrounds": "我的 Playgrounds",
"templates": {
"consoleApplication": "控制台程序",
"empty": "空白 Playground",
"frontend": "前端程序",
"machineLearning": "机器学习"
}
},
"links": {
"admin": {
"scores": "/library/scores",
"translation": "/contribution/translation/question/admin/",
"operations": "/management"
},
"premium": "/premium",
"discuss": "/circle",
"interview": "/company",
"shop": "https://detail.youzan.com/show/goods/newest?alias=271n43vr9hen7",
"onlineInterview": "https://interview.leetcode-cn.com/interview",
"profileArticles": "/profile/articles",
"orders": "/order",
"explore": "/leetbook",
"resume": "/profile/"
},
"pagination": {
"perpage": " 条/页"
},
"expand": "展开",
"collapse": "收起"
},
"problemset": {
"meta": {
"title": "题库 - 力扣 (LeetCode) 全球极客挚爱的技术成长平台",
"description": "海量技术面试题库,拥有算法、数据结构、系统设计等 1000+题目,帮助你高效提升编程技能,轻松拿下世界 IT 名企 Dream Offer。",
"keywords": "力扣, 力扣中国, leetcode, lingkou, leetcode中国, leetcode官网, 剑指 offer, 程序员面试, 秋招, 在线编程, lc, leetcode题解, leetcode答案, 面经, 算法, 面试, 求职, 招聘, 校招, 社招, 内推, 笔试, 面试题, 面试经验, 刷题, leetcode题库, 机器学习, 算法岗, 数据结构, 代码, 互联网, 编程, 开发, 程序员, 工程师, 白板面试, 码农, 程序猿, 领扣, 领扣网, 领扣网络, 领扣中国, BAT, BAT面试, OJ, online judge, coding interview, 技术面试, leetcode中文版, leetcodechina",
"ogImage": "https://static.leetcode-cn.com/cn-legacy-assets/images/LeetCode_Sharing.png"
}
},
"question-list": {
"table": {
"header": {
"status": "状态",
"title": "题目",
"solution": "题解",
"acceptance": "通过率",
"difficulty": "难度",
"frequency": "出现频率",
"company": "企业"
},
"tooltip": {
"frequency": "题目在真实面试的出题频率"
}
},
"filter": {
"key": {
"difficulty": "difficulty",
"status": "status",
"topics": "topicSlugs",
"companies": "companySlugs",
"list": "listId",
"solution": "editorialFilter",
"search": "search"
},
"difficulty": "难度",
"status": "状态",
"list": "题单",
"tag": "标签",
"tagSearch": "筛选标签",
"expand": "展开全部",
"collapse": "收起全部",
"reset": "重置",
"searchPlaceholder": "搜索题目、编号或内容",
"noResult": "暂无搜索结果"
},
"settings": {
"showTopicTags": "显示标签",
"premiumQuestions": "Plus 会员题",
"showCompanyTags": "显示企业"
},
"allTopics": "全部题目",
"pickOne": "随机一题",
"difficulty": {
"easy": "简单",
"medium": "中等",
"hard": "困难"
},
"status": {
"todo": "未开始",
"solved": "已解答",
"attempted": "尝试过"
},
"topicTags": {
"expand": "展开",
"collapse": "收起"
},
"frequency": {
"lockNotice": "升级 Plus 会员查看题目热度"
}
},
"featured-list": {
"featured": "精选题单",
"problemsSolved": "完成度:",
"listNotFound": "未找到题单",
"pickOne": "随机开始",
"share": "分享"
}
}
},
"initialLocale": "en",
"userConfig": {
"i18n": {
"defaultLocale": "zh",
"locales": [
"en",
"zh"
]
},
"react": {
"useSuspense": false
},
"default": {
"i18n": {
"defaultLocale": "zh",
"locales": [
"en",
"zh"
]
},
"react": {
"useSuspense": false
}
}
}
},
"problemsetQuestionList": {
"total": 2199,
"questions": [
{
"acRate": 48.34002111949057,
"difficulty": "EASY",
"freqBar": null,
"frontendQuestionId": "1",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Two Sum",
"titleSlug": "two-sum",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Hash Table",
"id": "VG9waWNUYWdOb2RlOjY=",
"slug": "hash-table"
}
],
"hasSolution": true,
"hasVideoSolution": true
},
{
"acRate": 38.281781487188645,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "2",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Add Two Numbers",
"titleSlug": "add-two-numbers",
"topicTags": [
{
"name": "Linked List",
"id": "VG9waWNUYWdOb2RlOjc=",
"slug": "linked-list"
},
{
"name": "Math",
"id": "VG9waWNUYWdOb2RlOjg=",
"slug": "math"
},
{
"name": "Recursion",
"id": "VG9waWNUYWdOb2RlOjMx",
"slug": "recursion"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 32.89745844270314,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "3",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Longest Substring Without Repeating Characters",
"titleSlug": "longest-substring-without-repeating-characters",
"topicTags": [
{
"name": "Hash Table",
"id": "VG9waWNUYWdOb2RlOjY=",
"slug": "hash-table"
},
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
},
{
"name": "Sliding Window",
"id": "VG9waWNUYWdOb2RlOjU1ODIx",
"slug": "sliding-window"
}
],
"hasSolution": true,
"hasVideoSolution": true
},
{
"acRate": 33.77722178922066,
"difficulty": "HARD",
"freqBar": null,
"frontendQuestionId": "4",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Median of Two Sorted Arrays",
"titleSlug": "median-of-two-sorted-arrays",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Binary Search",
"id": "VG9waWNUYWdOb2RlOjEx",
"slug": "binary-search"
},
{
"name": "Divide and Conquer",
"id": "VG9waWNUYWdOb2RlOjEy",
"slug": "divide-and-conquer"
}
],
"hasSolution": false,
"hasVideoSolution": false
},
{
"acRate": 31.700487901363594,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "5",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Longest Palindromic Substring",
"titleSlug": "longest-palindromic-substring",
"topicTags": [
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
},
{
"name": "Dynamic Programming",
"id": "VG9waWNUYWdOb2RlOjEz",
"slug": "dynamic-programming"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 41.1187224943716,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "6",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Zigzag Conversion",
"titleSlug": "zigzag-conversion",
"topicTags": [
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 26.56309731600804,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "7",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Reverse Integer",
"titleSlug": "reverse-integer",
"topicTags": [
{
"name": "Math",
"id": "VG9waWNUYWdOb2RlOjg=",
"slug": "math"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 16.47629217268497,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "8",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "String to Integer (atoi)",
"titleSlug": "string-to-integer-atoi",
"topicTags": [
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 52.20176960719627,
"difficulty": "EASY",
"freqBar": null,
"frontendQuestionId": "9",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Palindrome Number",
"titleSlug": "palindrome-number",
"topicTags": [
{
"name": "Math",
"id": "VG9waWNUYWdOb2RlOjg=",
"slug": "math"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 28.183570421411662,
"difficulty": "HARD",
"freqBar": null,
"frontendQuestionId": "10",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Regular Expression Matching",
"titleSlug": "regular-expression-matching",
"topicTags": [
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
},
{
"name": "Dynamic Programming",
"id": "VG9waWNUYWdOb2RlOjEz",
"slug": "dynamic-programming"
},
{
"name": "Recursion",
"id": "VG9waWNUYWdOb2RlOjMx",
"slug": "recursion"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 53.424101206378104,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "11",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Container With Most Water",
"titleSlug": "container-with-most-water",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Two Pointers",
"id": "VG9waWNUYWdOb2RlOjk=",
"slug": "two-pointers"
},
{
"name": "Greedy",
"id": "VG9waWNUYWdOb2RlOjE3",
"slug": "greedy"
}
],
"hasSolution": true,
"hasVideoSolution": true
},
{
"acRate": 59.142832665902326,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "12",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Integer to Roman",
"titleSlug": "integer-to-roman",
"topicTags": [
{
"name": "Hash Table",
"id": "VG9waWNUYWdOb2RlOjY=",
"slug": "hash-table"
},
{
"name": "Math",
"id": "VG9waWNUYWdOb2RlOjg=",
"slug": "math"
},
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 57.88533336368692,
"difficulty": "EASY",
"freqBar": null,
"frontendQuestionId": "13",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Roman to Integer",
"titleSlug": "roman-to-integer",
"topicTags": [
{
"name": "Hash Table",
"id": "VG9waWNUYWdOb2RlOjY=",
"slug": "hash-table"
},
{
"name": "Math",
"id": "VG9waWNUYWdOb2RlOjg=",
"slug": "math"
},
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 39.056918339258694,
"difficulty": "EASY",
"freqBar": null,
"frontendQuestionId": "14",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Longest Common Prefix",
"titleSlug": "longest-common-prefix",
"topicTags": [
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 30.740654626108782,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "15",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "3Sum",
"titleSlug": "3sum",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Two Pointers",
"id": "VG9waWNUYWdOb2RlOjk=",
"slug": "two-pointers"
},
{
"name": "Sorting",
"id": "VG9waWNUYWdOb2RlOjYxMDQ5",
"slug": "sorting"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 47.05269460338623,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "16",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "3Sum Closest",
"titleSlug": "3sum-closest",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Two Pointers",
"id": "VG9waWNUYWdOb2RlOjk=",
"slug": "two-pointers"
},
{
"name": "Sorting",
"id": "VG9waWNUYWdOb2RlOjYxMDQ5",
"slug": "sorting"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 53.18324343524014,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "17",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Letter Combinations of a Phone Number",
"titleSlug": "letter-combinations-of-a-phone-number",
"topicTags": [
{
"name": "Hash Table",
"id": "VG9waWNUYWdOb2RlOjY=",
"slug": "hash-table"
},
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
},
{
"name": "Backtracking",
"id": "VG9waWNUYWdOb2RlOjE0",
"slug": "backtracking"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 37.08859348625098,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "18",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "4Sum",
"titleSlug": "4sum",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Two Pointers",
"id": "VG9waWNUYWdOb2RlOjk=",
"slug": "two-pointers"
},
{
"name": "Sorting",
"id": "VG9waWNUYWdOb2RlOjYxMDQ5",
"slug": "sorting"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 38.00459464440095,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "19",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Remove Nth Node From End of List",
"titleSlug": "remove-nth-node-from-end-of-list",
"topicTags": [
{
"name": "Linked List",
"id": "VG9waWNUYWdOb2RlOjc=",
"slug": "linked-list"
},
{
"name": "Two Pointers",
"id": "VG9waWNUYWdOb2RlOjk=",
"slug": "two-pointers"
}
],
"hasSolution": true,
"hasVideoSolution": true
},
{
"acRate": 40.612591661235854,
"difficulty": "EASY",
"freqBar": null,
"frontendQuestionId": "20",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Valid Parentheses",
"titleSlug": "valid-parentheses",
"topicTags": [
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
},
{
"name": "Stack",
"id": "VG9waWNUYWdOb2RlOjE1",
"slug": "stack"
}
],
"hasSolution": true,
"hasVideoSolution": true
},
{
"acRate": 59.885805177870786,
"difficulty": "EASY",
"freqBar": null,
"frontendQuestionId": "21",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Merge Two Sorted Lists",
"titleSlug": "merge-two-sorted-lists",
"topicTags": [
{
"name": "Linked List",
"id": "VG9waWNUYWdOb2RlOjc=",
"slug": "linked-list"
},
{
"name": "Recursion",
"id": "VG9waWNUYWdOb2RlOjMx",
"slug": "recursion"
}
],
"hasSolution": true,
"hasVideoSolution": true
},
{
"acRate": 69.5837831404296,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "22",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Generate Parentheses",
"titleSlug": "generate-parentheses",
"topicTags": [
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
},
{
"name": "Dynamic Programming",
"id": "VG9waWNUYWdOb2RlOjEz",
"slug": "dynamic-programming"
},
{
"name": "Backtracking",
"id": "VG9waWNUYWdOb2RlOjE0",
"slug": "backtracking"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 46.63339842902739,
"difficulty": "HARD",
"freqBar": null,
"frontendQuestionId": "23",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Merge k Sorted Lists",
"titleSlug": "merge-k-sorted-lists",
"topicTags": [
{
"name": "Linked List",
"id": "VG9waWNUYWdOb2RlOjc=",
"slug": "linked-list"
},
{
"name": "Divide and Conquer",
"id": "VG9waWNUYWdOb2RlOjEy",
"slug": "divide-and-conquer"
},
{
"name": "Heap (Priority Queue)",
"id": "VG9waWNUYWdOb2RlOjYxMDUw",
"slug": "heap-priority-queue"
},
{
"name": "Merge Sort",
"id": "VG9waWNUYWdOb2RlOjYxMDUx",
"slug": "merge-sort"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 58.25226860381859,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "24",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Swap Nodes in Pairs",
"titleSlug": "swap-nodes-in-pairs",
"topicTags": [
{
"name": "Linked List",
"id": "VG9waWNUYWdOb2RlOjc=",
"slug": "linked-list"
},
{
"name": "Recursion",
"id": "VG9waWNUYWdOb2RlOjMx",
"slug": "recursion"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 50.44563447129651,
"difficulty": "HARD",
"freqBar": null,
"frontendQuestionId": "25",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Reverse Nodes in k-Group",
"titleSlug": "reverse-nodes-in-k-group",
"topicTags": [
{
"name": "Linked List",
"id": "VG9waWNUYWdOb2RlOjc=",
"slug": "linked-list"
},
{
"name": "Recursion",
"id": "VG9waWNUYWdOb2RlOjMx",
"slug": "recursion"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 48.44278005627615,
"difficulty": "EASY",
"freqBar": null,
"frontendQuestionId": "26",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Remove Duplicates from Sorted Array",
"titleSlug": "remove-duplicates-from-sorted-array",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Two Pointers",
"id": "VG9waWNUYWdOb2RlOjk=",
"slug": "two-pointers"
}
],
"hasSolution": true,
"hasVideoSolution": true
},
{
"acRate": 50.98890651386749,
"difficulty": "EASY",
"freqBar": null,
"frontendQuestionId": "27",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Remove Element",
"titleSlug": "remove-element",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Two Pointers",
"id": "VG9waWNUYWdOb2RlOjk=",
"slug": "two-pointers"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 35.61625721067326,
"difficulty": "EASY",
"freqBar": null,
"frontendQuestionId": "28",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Implement strStr()",
"titleSlug": "implement-strstr",
"topicTags": [
{
"name": "Two Pointers",
"id": "VG9waWNUYWdOb2RlOjk=",
"slug": "two-pointers"
},
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
},
{
"name": "String Matching",
"id": "VG9waWNUYWdOb2RlOjYxMDUy",
"slug": "string-matching"
}
],
"hasSolution": false,
"hasVideoSolution": false
},
{
"acRate": 17.04572213315952,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "29",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Divide Two Integers",
"titleSlug": "divide-two-integers",
"topicTags": [
{
"name": "Math",
"id": "VG9waWNUYWdOb2RlOjg=",
"slug": "math"
},
{
"name": "Bit Manipulation",
"id": "VG9waWNUYWdOb2RlOjE5",
"slug": "bit-manipulation"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 27.868228201056453,
"difficulty": "HARD",
"freqBar": null,
"frontendQuestionId": "30",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Substring with Concatenation of All Words",
"titleSlug": "substring-with-concatenation-of-all-words",
"topicTags": [
{
"name": "Hash Table",
"id": "VG9waWNUYWdOb2RlOjY=",
"slug": "hash-table"
},
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
},
{
"name": "Sliding Window",
"id": "VG9waWNUYWdOb2RlOjU1ODIx",
"slug": "sliding-window"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 35.41210346875135,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "31",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Next Permutation",
"titleSlug": "next-permutation",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Two Pointers",
"id": "VG9waWNUYWdOb2RlOjk=",
"slug": "two-pointers"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 31.124128237374993,
"difficulty": "HARD",
"freqBar": null,
"frontendQuestionId": "32",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Longest Valid Parentheses",
"titleSlug": "longest-valid-parentheses",
"topicTags": [
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
},
{
"name": "Dynamic Programming",
"id": "VG9waWNUYWdOb2RlOjEz",
"slug": "dynamic-programming"
},
{
"name": "Stack",
"id": "VG9waWNUYWdOb2RlOjE1",
"slug": "stack"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 37.531209326726014,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "33",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Search in Rotated Sorted Array",
"titleSlug": "search-in-rotated-sorted-array",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Binary Search",
"id": "VG9waWNUYWdOb2RlOjEx",
"slug": "binary-search"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 39.754564724257186,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "34",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Find First and Last Position of Element in Sorted Array",
"titleSlug": "find-first-and-last-position-of-element-in-sorted-array",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Binary Search",
"id": "VG9waWNUYWdOb2RlOjEx",
"slug": "binary-search"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 42.410108539880106,
"difficulty": "EASY",
"freqBar": null,
"frontendQuestionId": "35",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Search Insert Position",
"titleSlug": "search-insert-position",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Binary Search",
"id": "VG9waWNUYWdOb2RlOjEx",
"slug": "binary-search"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 54.6095991996279,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "36",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Valid Sudoku",
"titleSlug": "valid-sudoku",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Hash Table",
"id": "VG9waWNUYWdOb2RlOjY=",
"slug": "hash-table"
},
{
"name": "Matrix",
"id": "VG9waWNUYWdOb2RlOjYxMDUz",
"slug": "matrix"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 53.23226010141687,
"difficulty": "HARD",
"freqBar": null,
"frontendQuestionId": "37",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Sudoku Solver",
"titleSlug": "sudoku-solver",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Backtracking",
"id": "VG9waWNUYWdOb2RlOjE0",
"slug": "backtracking"
},
{
"name": "Matrix",
"id": "VG9waWNUYWdOb2RlOjYxMDUz",
"slug": "matrix"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 48.337674987904244,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "38",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Count and Say",
"titleSlug": "count-and-say",
"topicTags": [
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
}
],
"hasSolution": false,
"hasVideoSolution": false
},
{
"acRate": 64.8595346188485,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "39",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Combination Sum",
"titleSlug": "combination-sum",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Backtracking",
"id": "VG9waWNUYWdOb2RlOjE0",
"slug": "backtracking"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 52.12822778401025,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "40",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Combination Sum II",
"titleSlug": "combination-sum-ii",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Backtracking",
"id": "VG9waWNUYWdOb2RlOjE0",
"slug": "backtracking"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 35.754104871404124,
"difficulty": "HARD",
"freqBar": null,
"frontendQuestionId": "41",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "First Missing Positive",
"titleSlug": "first-missing-positive",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Hash Table",
"id": "VG9waWNUYWdOb2RlOjY=",
"slug": "hash-table"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 55.95446654817088,
"difficulty": "HARD",
"freqBar": null,
"frontendQuestionId": "42",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Trapping Rain Water",
"titleSlug": "trapping-rain-water",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Two Pointers",
"id": "VG9waWNUYWdOb2RlOjk=",
"slug": "two-pointers"
},
{
"name": "Dynamic Programming",
"id": "VG9waWNUYWdOb2RlOjEz",
"slug": "dynamic-programming"
},
{
"name": "Stack",
"id": "VG9waWNUYWdOb2RlOjE1",
"slug": "stack"
},
{
"name": "Monotonic Stack",
"id": "VG9waWNUYWdOb2RlOjYxMDU0",
"slug": "monotonic-stack"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 37.44978017198062,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "43",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Multiply Strings",
"titleSlug": "multiply-strings",
"topicTags": [
{
"name": "Math",
"id": "VG9waWNUYWdOb2RlOjg=",
"slug": "math"
},
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
},
{
"name": "Simulation",
"id": "VG9waWNUYWdOb2RlOjYxMDU1",
"slug": "simulation"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 26.428458894299627,
"difficulty": "HARD",
"freqBar": null,
"frontendQuestionId": "44",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Wildcard Matching",
"titleSlug": "wildcard-matching",
"topicTags": [
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
},
{
"name": "Dynamic Programming",
"id": "VG9waWNUYWdOb2RlOjEz",
"slug": "dynamic-programming"
},
{
"name": "Greedy",
"id": "VG9waWNUYWdOb2RlOjE3",
"slug": "greedy"
},
{
"name": "Recursion",
"id": "VG9waWNUYWdOb2RlOjMx",
"slug": "recursion"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 36.6446351886295,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "45",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Jump Game II",
"titleSlug": "jump-game-ii",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Dynamic Programming",
"id": "VG9waWNUYWdOb2RlOjEz",
"slug": "dynamic-programming"
},
{
"name": "Greedy",
"id": "VG9waWNUYWdOb2RlOjE3",
"slug": "greedy"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 71.62617776715965,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "46",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Permutations",
"titleSlug": "permutations",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Backtracking",
"id": "VG9waWNUYWdOb2RlOjE0",
"slug": "backtracking"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 53.59226978166382,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "47",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Permutations II",
"titleSlug": "permutations-ii",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Backtracking",
"id": "VG9waWNUYWdOb2RlOjE0",
"slug": "backtracking"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 65.91273779488958,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "48",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Rotate Image",
"titleSlug": "rotate-image",
"topicTags": [
{
"name": "Array",
"id": "VG9waWNUYWdOb2RlOjU=",
"slug": "array"
},
{
"name": "Math",
"id": "VG9waWNUYWdOb2RlOjg=",
"slug": "math"
},
{
"name": "Matrix",
"id": "VG9waWNUYWdOb2RlOjYxMDUz",
"slug": "matrix"
}
],
"hasSolution": true,
"hasVideoSolution": false
},
{
"acRate": 63.596505837903415,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "49",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Group Anagrams",
"titleSlug": "group-anagrams",
"topicTags": [
{
"name": "Hash Table",
"id": "VG9waWNUYWdOb2RlOjY=",
"slug": "hash-table"
},
{
"name": "String",
"id": "VG9waWNUYWdOb2RlOjEw",
"slug": "string"
},
{
"name": "Sorting",
"id": "VG9waWNUYWdOb2RlOjYxMDQ5",
"slug": "sorting"
}
],
"hasSolution": true,
"hasVideoSolution": true
},
{
"acRate": 32.16983512610974,
"difficulty": "MEDIUM",
"freqBar": null,
"frontendQuestionId": "50",
"isFavor": false,
"paidOnly": false,
"status": "NOT_STARTED",
"title": "Pow(x, n)",
"titleSlug": "powx-n",
"topicTags": [
{
"name": "Math",
"id": "VG9waWNUYWdOb2RlOjg=",
"slug": "math"
},
{
"name": "Recursion",
"id": "VG9waWNUYWdOb2RlOjMx",
"slug": "recursion"
}
],
"hasSolution": true,
"hasVideoSolution": false
}
]
},
"featuredLists": [
{
"coverUrl": "https://assets.leetcode.com/lcus-resource/featured_lists/laptop.png",
"name": "Top Interview Questions",
"link": "/problem-list/top-interview-questions",
"idHash": "top-interview-questions",
"isPaidOnly": false,
"description": "LeetCode is the golden standard for technical interviews . LeetCode problems are widely used during technical interviews at companies like Facebook, Hulu and Google. In the face of tight and limited job preparation time, this set of selected high-frequency interview problems can help you improve efficiently and greatly increase the possibility of obtaining an offer.",
"creator": {
"realName": "LeetCode"
},
"tags": [],
"questionCount": 145,
"acStats": []
},
{
"coverUrl": "https://assets.leetcode.com/lcus-resource/featured_lists/top.png",
"name": "Top 100 Liked Questions",
"link": "/problem-list/top-100-liked-questions",
"idHash": "top-100-liked-questions",
"isPaidOnly": false,
"description": "Practice on the top 100 liked questions by LeetCode users! This problems list is constantly updated according to the likes and dislikes of the problem.",
"creator": {
"realName": "LeetCode"
},
"tags": [],
"questionCount": 100,
"acStats": []
},
{
"coverUrl": "https://assets.leetcode.com/lcus-resource/featured_lists/facebook.png",
"name": "Top Facebook Questions",
"link": "/problem-list/top-facebook-questions",
"idHash": "top-facebook-questions",
"isPaidOnly": true,
"description": "Interested in joining Facebook? This problems list will give you a preliminary grasp of Facebook's interview style and test sites, and conduct simulation exercises in advance. The list is updated based on how frequently problems appear in an interview.",
"creator": {
"realName": "LeetCode"
},
"tags": [],
"questionCount": 50,
"acStats": []
},
{
"coverUrl": "https://assets.leetcode.com/lcus-resource/featured_lists/google.png",
"name": "Top Google Questions",
"link": "/problem-list/top-google-questions",
"idHash": "top-google-questions",
"isPaidOnly": true,
"description": "Looking to join Google? This problems list will give you a preliminary grasp of Google's interview style and test sites, and conduct simulation exercises in advance. The list is updated based on how frequently problems appear in an interview.",
"creator": {
"realName": "LeetCode"
},
"tags": [],
"questionCount": 50,
"acStats": []
},
{
"coverUrl": "https://assets.leetcode.com/lcus-resource/featured_lists/amazon.png",
"name": "Top Amazon Questions",
"link": "/problem-list/top-amazon-questions",
"idHash": "top-amazon-questions",
"isPaidOnly": true,
"description": "If your goal is to join Amazon, this problems list will give you a preliminary grasp of Amazon's interview style and test sites, and conduct simulation exercises in advance. The list is updated based on how frequently problems appear in an interview.",
"creator": {
"realName": "LeetCode"
},
"tags": [],
"questionCount": 50,
"acStats": []
},
{
"coverUrl": "https://assets.leetcode.com/lcus-resource/featured_lists/hot.png",
"name": "LeetCode Curated Algo 170",
"link": "/problem-list/leetcode-curated-algo-170",
"idHash": "leetcode-curated-algo-170",
"isPaidOnly": false,
"description": "A selection of the 170 most popular problems on LeetCode, great for beginners who are new to algorithms and data structure and those who want to improve efficiently in a short period of time. Mastering these 170 problems you will have the basic skills required in the coding world.",
"creator": {
"realName": "LeetCode"
},
"tags": [],
"questionCount": 170,
"acStats": []
},
{
"coverUrl": "https://assets.leetcode.com/lcus-resource/featured_lists/microsoft.png",
"name": "Top Microsoft Questions",
"link": "/problem-list/top-microsoft-questions",
"idHash": "top-microsoft-questions",
"isPaidOnly": true,
"description": "Aiming for Microsoft? This problems list will give you a preliminary grasp of their interview style and test sites, and conduct simulation exercises in advance. The list is updated based on how frequently problems appear in an interview.",
"creator": {
"realName": "LeetCode"
},
"tags": [
{
"name": "Microsoft",
"slug": "microsoft"
}
],
"questionCount": 50,
"acStats": []
},
{
"coverUrl": "https://assets.leetcode.com/lcus-resource/featured_lists/sql.png",
"name": "LeetCode Curated SQL 70",
"link": "/problem-list/leetcode-curated-sql-70",
"idHash": "leetcode-curated-sql-70",
"isPaidOnly": false,
"description": "In the early days, SQL, as a language for querying databases, was an essential skill for programmers, because only after obtaining the correct data set, subsequent data processing and analysis can happen. During an interview, SQL is also a key factor. Through these 70 practice problems, you will build a solid 'database' foundation.",
"creator": {
"realName": "LeetCode"
},
"tags": [],
"questionCount": 70,
"acStats": []
}
],
"topicTags": [
{
"id": "VG9waWNUYWdOb2RlOjU=",
"name": "Array",
"slug": "array",
"translatedName": null,
"questionCount": 1060
},
{
"id": "VG9waWNUYWdOb2RlOjEw",
"name": "String",
"slug": "string",
"translatedName": null,
"questionCount": 515
},
{
"id": "VG9waWNUYWdOb2RlOjY=",
"name": "Hash Table",
"slug": "hash-table",
"translatedName": null,
"questionCount": 367
},
{
"id": "VG9waWNUYWdOb2RlOjEz",
"name": "Dynamic Programming",
"slug": "dynamic-programming",
"translatedName": null,
"questionCount": 358
},
{
"id": "VG9waWNUYWdOb2RlOjg=",
"name": "Math",
"slug": "math",
"translatedName": null,
"questionCount": 353
},
{
"id": "VG9waWNUYWdOb2RlOjIx",
"name": "Depth-First Search",
"slug": "depth-first-search",
"translatedName": null,
"questionCount": 240
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDQ5",
"name": "Sorting",
"slug": "sorting",
"translatedName": null,
"questionCount": 236
},
{
"id": "VG9waWNUYWdOb2RlOjE3",
"name": "Greedy",
"slug": "greedy",
"translatedName": null,
"questionCount": 229
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDQz",
"name": "Database",
"slug": "database",
"translatedName": null,
"questionCount": 195
},
{
"id": "VG9waWNUYWdOb2RlOjIy",
"name": "Breadth-First Search",
"slug": "breadth-first-search",
"translatedName": null,
"questionCount": 194
},
{
"id": "VG9waWNUYWdOb2RlOjIw",
"name": "Tree",
"slug": "tree",
"translatedName": null,
"questionCount": 185
},
{
"id": "VG9waWNUYWdOb2RlOjEx",
"name": "Binary Search",
"slug": "binary-search",
"translatedName": null,
"questionCount": 171
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDUz",
"name": "Matrix",
"slug": "matrix",
"translatedName": null,
"questionCount": 159
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDU3",
"name": "Binary Tree",
"slug": "binary-tree",
"translatedName": null,
"questionCount": 156
},
{
"id": "VG9waWNUYWdOb2RlOjk=",
"name": "Two Pointers",
"slug": "two-pointers",
"translatedName": null,
"questionCount": 144
},
{
"id": "VG9waWNUYWdOb2RlOjE5",
"name": "Bit Manipulation",
"slug": "bit-manipulation",
"translatedName": null,
"questionCount": 129
},
{
"id": "VG9waWNUYWdOb2RlOjE1",
"name": "Stack",
"slug": "stack",
"translatedName": null,
"questionCount": 120
},
{
"id": "VG9waWNUYWdOb2RlOjI1",
"name": "Design",
"slug": "design",
"translatedName": null,
"questionCount": 105
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDUw",
"name": "Heap (Priority Queue)",
"slug": "heap-priority-queue",
"translatedName": null,
"questionCount": 103
},
{
"id": "VG9waWNUYWdOb2RlOjI0",
"name": "Graph",
"slug": "graph",
"translatedName": null,
"questionCount": 90
},
{
"id": "VG9waWNUYWdOb2RlOjE0",
"name": "Backtracking",
"slug": "backtracking",
"translatedName": null,
"questionCount": 90
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDU1",
"name": "Simulation",
"slug": "simulation",
"translatedName": null,
"questionCount": 88
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDY4",
"name": "Prefix Sum",
"slug": "prefix-sum",
"translatedName": null,
"questionCount": 76
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDYy",
"name": "Counting",
"slug": "counting",
"translatedName": null,
"questionCount": 73
},
{
"id": "VG9waWNUYWdOb2RlOjU1ODIx",
"name": "Sliding Window",
"slug": "sliding-window",
"translatedName": null,
"questionCount": 69
},
{
"id": "VG9waWNUYWdOb2RlOjc=",
"name": "Linked List",
"slug": "linked-list",
"translatedName": null,
"questionCount": 66
},
{
"id": "VG9waWNUYWdOb2RlOjIz",
"name": "Union Find",
"slug": "union-find",
"translatedName": null,
"questionCount": 59
},
{
"id": "VG9waWNUYWdOb2RlOjMx",
"name": "Recursion",
"slug": "recursion",
"translatedName": null,
"questionCount": 42
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDcw",
"name": "Ordered Set",
"slug": "ordered-set",
"translatedName": null,
"questionCount": 40
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDU0",
"name": "Monotonic Stack",
"slug": "monotonic-stack",
"translatedName": null,
"questionCount": 40
},
{
"id": "VG9waWNUYWdOb2RlOjMw",
"name": "Binary Search Tree",
"slug": "binary-search-tree",
"translatedName": null,
"questionCount": 40
},
{
"id": "VG9waWNUYWdOb2RlOjI3",
"name": "Trie",
"slug": "trie",
"translatedName": null,
"questionCount": 39
},
{
"id": "VG9waWNUYWdOb2RlOjEy",
"name": "Divide and Conquer",
"slug": "divide-and-conquer",
"translatedName": null,
"questionCount": 38
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDc4",
"name": "Bitmask",
"slug": "bitmask",
"translatedName": null,
"questionCount": 34
},
{
"id": "VG9waWNUYWdOb2RlOjM0",
"name": "Queue",
"slug": "queue",
"translatedName": null,
"questionCount": 31
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDY2",
"name": "Enumeration",
"slug": "enumeration",
"translatedName": null,
"questionCount": 28
},
{
"id": "VG9waWNUYWdOb2RlOjM4",
"name": "Geometry",
"slug": "geometry",
"translatedName": null,
"questionCount": 28
},
{
"id": "VG9waWNUYWdOb2RlOjMz",
"name": "Memoization",
"slug": "memoization",
"translatedName": null,
"questionCount": 28
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDcz",
"name": "Game Theory",
"slug": "game-theory",
"translatedName": null,
"questionCount": 24
},
{
"id": "VG9waWNUYWdOb2RlOjI5",
"name": "Segment Tree",
"slug": "segment-tree",
"translatedName": null,
"questionCount": 23
},
{
"id": "VG9waWNUYWdOb2RlOjI2",
"name": "Topological Sort",
"slug": "topological-sort",
"translatedName": null,
"questionCount": 23
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDY1",
"name": "Hash Function",
"slug": "hash-function",
"translatedName": null,
"questionCount": 22
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDU5",
"name": "Interactive",
"slug": "interactive",
"translatedName": null,
"questionCount": 18
},
{
"id": "VG9waWNUYWdOb2RlOjI4",
"name": "Binary Indexed Tree",
"slug": "binary-indexed-tree",
"translatedName": null,
"questionCount": 18
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDYz",
"name": "Data Stream",
"slug": "data-stream",
"translatedName": null,
"questionCount": 16
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDUy",
"name": "String Matching",
"slug": "string-matching",
"translatedName": null,
"questionCount": 15
},
{
"id": "VG9waWNUYWdOb2RlOjU2NTk4",
"name": "Rolling Hash",
"slug": "rolling-hash",
"translatedName": null,
"questionCount": 15
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDc2",
"name": "Shortest Path",
"slug": "shortest-path",
"translatedName": null,
"questionCount": 13
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDc1",
"name": "Randomized",
"slug": "randomized",
"translatedName": null,
"questionCount": 12
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDY3",
"name": "Number Theory",
"slug": "number-theory",
"translatedName": null,
"questionCount": 12
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDU2",
"name": "Combinatorics",
"slug": "combinatorics",
"translatedName": null,
"questionCount": 12
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDcx",
"name": "Monotonic Queue",
"slug": "monotonic-queue",
"translatedName": null,
"questionCount": 9
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDY0",
"name": "Iterator",
"slug": "iterator",
"translatedName": null,
"questionCount": 9
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDUx",
"name": "Merge Sort",
"slug": "merge-sort",
"translatedName": null,
"questionCount": 9
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDQ1",
"name": "Concurrency",
"slug": "concurrency",
"translatedName": null,
"questionCount": 9
},
{
"id": "VG9waWNUYWdOb2RlOjMy",
"name": "Brainteaser",
"slug": "brainteaser",
"translatedName": null,
"questionCount": 8
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDc5",
"name": "Probability and Statistics",
"slug": "probability-and-statistics",
"translatedName": null,
"questionCount": 7
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDU4",
"name": "Doubly-Linked List",
"slug": "doubly-linked-list",
"translatedName": null,
"questionCount": 7
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDY5",
"name": "Quickselect",
"slug": "quickselect",
"translatedName": null,
"questionCount": 6
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDYw",
"name": "Bucket Sort",
"slug": "bucket-sort",
"translatedName": null,
"questionCount": 6
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDgz",
"name": "Minimum Spanning Tree",
"slug": "minimum-spanning-tree",
"translatedName": null,
"questionCount": 5
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDcy",
"name": "Counting Sort",
"slug": "counting-sort",
"translatedName": null,
"questionCount": 5
},
{
"id": "VG9waWNUYWdOb2RlOjU2Njk4",
"name": "Suffix Array",
"slug": "suffix-array",
"translatedName": null,
"questionCount": 5
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDQ0",
"name": "Shell",
"slug": "shell",
"translatedName": null,
"questionCount": 4
},
{
"id": "VG9waWNUYWdOb2RlOjU2MTE5",
"name": "Line Sweep",
"slug": "line-sweep",
"translatedName": null,
"questionCount": 4
},
{
"id": "VG9waWNUYWdOb2RlOjM2",
"name": "Reservoir Sampling",
"slug": "reservoir-sampling",
"translatedName": null,
"questionCount": 4
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDc0",
"name": "Eulerian Circuit",
"slug": "eulerian-circuit",
"translatedName": null,
"questionCount": 3
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDg1",
"name": "Strongly Connected Component",
"slug": "strongly-connected-component",
"translatedName": null,
"questionCount": 2
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDYx",
"name": "Radix Sort",
"slug": "radix-sort",
"translatedName": null,
"questionCount": 2
},
{
"id": "VG9waWNUYWdOb2RlOjU0NTY5",
"name": "Rejection Sampling",
"slug": "rejection-sampling",
"translatedName": null,
"questionCount": 2
},
{
"id": "VG9waWNUYWdOb2RlOjYxMDg0",
"name": "Biconnected Component",
"slug": "biconnected-component",
"translatedName": null,
"questionCount": 1
}
]
},
"__N_SSG": true
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment