all_problems.json

{
  "1234": {
    "Name": "Replace the Substring for Balanced String",
    "Acceptance": "33.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/replace-the-substring-for-balanced-string"
  },
  "1": {
    "Name": "Two Sum",
    "Acceptance": "45.6%",
    "Difficulty": "Easy",
    "Frequency": "0.014983541429464405",
    "Link": " https://leetcode.com/problems/two-sum"
  },
  "2": {
    "Name": "Add Two Numbers",
    "Acceptance": "33.9%",
    "Difficulty": "Medium",
    "Frequency": "0.009003349524164856",
    "Link": " https://leetcode.com/problems/add-two-numbers"
  },
  "21": {
    "Name": "Merge Two Sorted Lists",
    "Acceptance": "53.5%",
    "Difficulty": "Easy",
    "Frequency": "0.10062341537355711",
    "Link": " https://leetcode.com/problems/merge-two-sorted-lists"
  },
  "1096": {
    "Name": "Brace Expansion II",
    "Acceptance": "62.2%",
    "Difficulty": "Hard",
    "Frequency": "3.5045558946493087",
    "Link": " https://leetcode.com/problems/brace-expansion-ii"
  },
  "741": {
    "Name": "Cherry Pickup",
    "Acceptance": "33.9%",
    "Difficulty": "Hard",
    "Frequency": "2.728198259587133",
    "Link": " https://leetcode.com/problems/cherry-pickup"
  },
  "5": {
    "Name": "Longest Palindromic Substring",
    "Acceptance": "29.5%",
    "Difficulty": "Medium",
    "Frequency": "0.02634844326401841",
    "Link": " https://leetcode.com/problems/longest-palindromic-substring"
  },
  "3": {
    "Name": "Longest Substring Without Repeating Characters",
    "Acceptance": "30.4%",
    "Difficulty": "Medium",
    "Frequency": "0.008179203236736318",
    "Link": " https://leetcode.com/problems/longest-substring-without-repeating-characters"
  },
  "82": {
    "Name": "Remove Duplicates from Sorted List II",
    "Acceptance": "36.8%",
    "Difficulty": "Medium",
    "Frequency": "0.1110882064011508",
    "Link": " https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii"
  },
  "274": {
    "Name": "H-Index",
    "Acceptance": "36.1%",
    "Difficulty": "Medium",
    "Frequency": "0.12351840574112768",
    "Link": " https://leetcode.com/problems/h-index"
  },
  "706": {
    "Name": "Design HashMap",
    "Acceptance": "61.3%",
    "Difficulty": "Easy",
    "Frequency": "0.10482987091202353",
    "Link": " https://leetcode.com/problems/design-hashmap"
  },
  "22": {
    "Name": "Generate Parentheses",
    "Acceptance": "62.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/generate-parentheses"
  },
  "115": {
    "Name": "Distinct Subsequences",
    "Acceptance": "38.3%",
    "Difficulty": "Hard",
    "Frequency": "0.061494781607806234",
    "Link": " https://leetcode.com/problems/distinct-subsequences"
  },
  "739": {
    "Name": "Daily Temperatures",
    "Acceptance": "63.3%",
    "Difficulty": "Medium",
    "Frequency": "0.14268538871155678",
    "Link": " https://leetcode.com/problems/daily-temperatures"
  },
  "420": {
    "Name": "Strong Password Checker",
    "Acceptance": "14.0%",
    "Difficulty": "Hard",
    "Frequency": "0.22471711576164025",
    "Link": " https://leetcode.com/problems/strong-password-checker"
  },
  "218": {
    "Name": "The Skyline Problem",
    "Acceptance": "34.6%",
    "Difficulty": "Hard",
    "Frequency": "0.3456466128972542",
    "Link": " https://leetcode.com/problems/the-skyline-problem"
  },
  "76": {
    "Name": "Minimum Window Substring",
    "Acceptance": "34.6%",
    "Difficulty": "Hard",
    "Frequency": "0.0702999835499499",
    "Link": " https://leetcode.com/problems/minimum-window-substring"
  },
  "728": {
    "Name": "Self Dividing Numbers",
    "Acceptance": "74.3%",
    "Difficulty": "Easy",
    "Frequency": "0.024662162384069",
    "Link": " https://leetcode.com/problems/self-dividing-numbers"
  },
  "15": {
    "Name": "3Sum",
    "Acceptance": "26.8%",
    "Difficulty": "Medium",
    "Frequency": "0.0021990113314367685",
    "Link": " https://leetcode.com/problems/3sum"
  },
  "206": {
    "Name": "Reverse Linked List",
    "Acceptance": "62.5%",
    "Difficulty": "Easy",
    "Frequency": "0.02086427467076072",
    "Link": " https://leetcode.com/problems/reverse-linked-list"
  },
  "725": {
    "Name": "Split Linked List in Parts",
    "Acceptance": "52.2%",
    "Difficulty": "Medium",
    "Frequency": "0.5618008463726617",
    "Link": " https://leetcode.com/problems/split-linked-list-in-parts"
  },
  "53": {
    "Name": "Maximum Subarray",
    "Acceptance": "46.5%",
    "Difficulty": "Easy",
    "Frequency": "0.02512179687463535",
    "Link": " https://leetcode.com/problems/maximum-subarray"
  },
  "37": {
    "Name": "Sudoku Solver",
    "Acceptance": "43.6%",
    "Difficulty": "Hard",
    "Frequency": "0.01821543989134118",
    "Link": " https://leetcode.com/problems/sudoku-solver"
  },
  "25": {
    "Name": "Reverse Nodes in k-Group",
    "Acceptance": "42.1%",
    "Difficulty": "Hard",
    "Frequency": "0.062178154907672076",
    "Link": " https://leetcode.com/problems/reverse-nodes-in-k-group"
  },
  "202": {
    "Name": "Happy Number",
    "Acceptance": "50.4%",
    "Difficulty": "Easy",
    "Frequency": "0.014045174703047602",
    "Link": " https://leetcode.com/problems/happy-number"
  },
  "42": {
    "Name": "Trapping Rain Water",
    "Acceptance": "48.9%",
    "Difficulty": "Hard",
    "Frequency": "0.2080272315165578",
    "Link": " https://leetcode.com/problems/trapping-rain-water"
  },
  "560": {
    "Name": "Subarray Sum Equals K",
    "Acceptance": "43.9%",
    "Difficulty": "Medium",
    "Frequency": "0.1592148659754748",
    "Link": " https://leetcode.com/problems/subarray-sum-equals-k"
  },
  "7": {
    "Name": "Reverse Integer",
    "Acceptance": "25.8%",
    "Difficulty": "Easy",
    "Frequency": "0.2635507930508001",
    "Link": " https://leetcode.com/problems/reverse-integer"
  },
  "31": {
    "Name": "Next Permutation",
    "Acceptance": "32.6%",
    "Difficulty": "Medium",
    "Frequency": "0.19579797845713617",
    "Link": " https://leetcode.com/problems/next-permutation"
  },
  "74": {
    "Name": "Search a 2D Matrix",
    "Acceptance": "36.5%",
    "Difficulty": "Medium",
    "Frequency": "0.29107845681405486",
    "Link": " https://leetcode.com/problems/search-a-2d-matrix"
  },
  "4": {
    "Name": "Median of Two Sorted Arrays",
    "Acceptance": "29.6%",
    "Difficulty": "Hard",
    "Frequency": "0.008754068159914991",
    "Link": " https://leetcode.com/problems/median-of-two-sorted-arrays"
  },
  "214": {
    "Name": "Shortest Palindrome",
    "Acceptance": "29.8%",
    "Difficulty": "Hard",
    "Frequency": "0.07220456924739427",
    "Link": " https://leetcode.com/problems/shortest-palindrome"
  },
  "12": {
    "Name": "Integer to Roman",
    "Acceptance": "55.1%",
    "Difficulty": "Medium",
    "Frequency": "0.25718087109817106",
    "Link": " https://leetcode.com/problems/integer-to-roman"
  },
  "617": {
    "Name": "Merge Two Binary Trees",
    "Acceptance": "74.1%",
    "Difficulty": "Easy",
    "Frequency": "0.018496211633622316",
    "Link": " https://leetcode.com/problems/merge-two-binary-trees"
  },
  "1114": {
    "Name": "Print in Order",
    "Acceptance": "65.7%",
    "Difficulty": "Easy",
    "Frequency": "0.12136085700426744",
    "Link": " https://leetcode.com/problems/print-in-order"
  },
  "55": {
    "Name": "Jump Game",
    "Acceptance": "34.6%",
    "Difficulty": "Medium",
    "Frequency": "0.030985252381807864",
    "Link": " https://leetcode.com/problems/jump-game"
  },
  "368": {
    "Name": "Largest Divisible Subset",
    "Acceptance": "38.0%",
    "Difficulty": "Medium",
    "Frequency": "0.32027305846942417",
    "Link": " https://leetcode.com/problems/largest-divisible-subset"
  },
  "176": {
    "Name": "Second Highest Salary",
    "Acceptance": "31.6%",
    "Difficulty": "Easy",
    "Frequency": "0.02809173486701511",
    "Link": " https://leetcode.com/problems/second-highest-salary"
  },
  "1108": {
    "Name": "Defanging an IP Address",
    "Acceptance": "87.5%",
    "Difficulty": "Easy",
    "Frequency": "0.015715357479628243",
    "Link": " https://leetcode.com/problems/defanging-an-ip-address"
  },
  "219": {
    "Name": "Contains Duplicate II",
    "Acceptance": "37.7%",
    "Difficulty": "Easy",
    "Frequency": "0.01276748910345265",
    "Link": " https://leetcode.com/problems/contains-duplicate-ii"
  },
  "11": {
    "Name": "Container With Most Water",
    "Acceptance": "50.8%",
    "Difficulty": "Medium",
    "Frequency": "0.08564331184863502",
    "Link": " https://leetcode.com/problems/container-with-most-water"
  },
  "343": {
    "Name": "Integer Break",
    "Acceptance": "50.4%",
    "Difficulty": "Medium",
    "Frequency": "0.7715473732272846",
    "Link": " https://leetcode.com/problems/integer-break"
  },
  "312": {
    "Name": "Burst Balloons",
    "Acceptance": "51.8%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/burst-balloons"
  },
  "220": {
    "Name": "Contains Duplicate III",
    "Acceptance": "20.9%",
    "Difficulty": "Medium",
    "Frequency": "0.20432784239539936",
    "Link": " https://leetcode.com/problems/contains-duplicate-iii"
  },
  "395": {
    "Name": "Longest Substring with At Least K Repeating Characters",
    "Acceptance": "41.4%",
    "Difficulty": "Medium",
    "Frequency": "0.14261022668001652",
    "Link": " https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters"
  },
  "836": {
    "Name": "Rectangle Overlap",
    "Acceptance": "48.6%",
    "Difficulty": "Easy",
    "Frequency": "0.05371219359052555",
    "Link": " https://leetcode.com/problems/rectangle-overlap"
  },
  "221": {
    "Name": "Maximal Square",
    "Acceptance": "37.7%",
    "Difficulty": "Medium",
    "Frequency": "0.1475288463816385",
    "Link": " https://leetcode.com/problems/maximal-square"
  },
  "18": {
    "Name": "4Sum",
    "Acceptance": "33.7%",
    "Difficulty": "Medium",
    "Frequency": "0.10887545776527079",
    "Link": " https://leetcode.com/problems/4sum"
  },
  "45": {
    "Name": "Jump Game II",
    "Acceptance": "30.6%",
    "Difficulty": "Hard",
    "Frequency": "0.021353124470568974",
    "Link": " https://leetcode.com/problems/jump-game-ii"
  },
  "300": {
    "Name": "Longest Increasing Subsequence",
    "Acceptance": "42.6%",
    "Difficulty": "Medium",
    "Frequency": "0.10155280044326445",
    "Link": " https://leetcode.com/problems/longest-increasing-subsequence"
  },
  "525": {
    "Name": "Contiguous Array",
    "Acceptance": "42.8%",
    "Difficulty": "Medium",
    "Frequency": "0.04390949261556855",
    "Link": " https://leetcode.com/problems/contiguous-array"
  },
  "229": {
    "Name": "Majority Element II",
    "Acceptance": "35.6%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/majority-element-ii"
  },
  "146": {
    "Name": "LRU Cache",
    "Acceptance": "33.2%",
    "Difficulty": "Medium",
    "Frequency": "0.3225459261278396",
    "Link": " https://leetcode.com/problems/lru-cache"
  },
  "200": {
    "Name": "Number of Islands",
    "Acceptance": "46.8%",
    "Difficulty": "Medium",
    "Frequency": "0.011509262420590827",
    "Link": " https://leetcode.com/problems/number-of-islands"
  },
  "993": {
    "Name": "Cousins in Binary Tree",
    "Acceptance": "52.0%",
    "Difficulty": "Easy",
    "Frequency": "0.36406958263507494",
    "Link": " https://leetcode.com/problems/cousins-in-binary-tree"
  },
  "6": {
    "Name": "ZigZag Conversion",
    "Acceptance": "36.3%",
    "Difficulty": "Medium",
    "Frequency": "0.01726827253226344",
    "Link": " https://leetcode.com/problems/zigzag-conversion"
  },
  "175": {
    "Name": "Combine Two Tables",
    "Acceptance": "60.8%",
    "Difficulty": "Easy",
    "Frequency": "0.23623293593199463",
    "Link": " https://leetcode.com/problems/combine-two-tables"
  },
  "994": {
    "Name": "Rotting Oranges",
    "Acceptance": "49.2%",
    "Difficulty": "Medium",
    "Frequency": "0.31869742552695396",
    "Link": " https://leetcode.com/problems/rotting-oranges"
  },
  "389": {
    "Name": "Find the Difference",
    "Acceptance": "55.3%",
    "Difficulty": "Easy",
    "Frequency": "1.3593946914822543",
    "Link": " https://leetcode.com/problems/find-the-difference"
  },
  "178": {
    "Name": "Rank Scores",
    "Acceptance": "45.8%",
    "Difficulty": "Medium",
    "Frequency": "0.01606460250380669",
    "Link": " https://leetcode.com/problems/rank-scores"
  },
  "191": {
    "Name": "Number of 1 Bits",
    "Acceptance": "49.8%",
    "Difficulty": "Easy",
    "Frequency": "0.05484219764644818",
    "Link": " https://leetcode.com/problems/number-of-1-bits"
  },
  "51": {
    "Name": "N-Queens",
    "Acceptance": "46.6%",
    "Difficulty": "Hard",
    "Frequency": "0.28871459706597014",
    "Link": " https://leetcode.com/problems/n-queens"
  },
  "322": {
    "Name": "Coin Change",
    "Acceptance": "35.5%",
    "Difficulty": "Medium",
    "Frequency": "0.016022774188122292",
    "Link": " https://leetcode.com/problems/coin-change"
  },
  "204": {
    "Name": "Count Primes",
    "Acceptance": "31.5%",
    "Difficulty": "Easy",
    "Frequency": "0.026775361248112174",
    "Link": " https://leetcode.com/problems/count-primes"
  },
  "59": {
    "Name": "Spiral Matrix II",
    "Acceptance": "53.9%",
    "Difficulty": "Medium",
    "Frequency": "0.09113771199852426",
    "Link": " https://leetcode.com/problems/spiral-matrix-ii"
  },
  "238": {
    "Name": "Product of Array Except Self",
    "Acceptance": "60.1%",
    "Difficulty": "Medium",
    "Frequency": "0.40402106453593073",
    "Link": " https://leetcode.com/problems/product-of-array-except-self"
  },
  "561": {
    "Name": "Array Partition I",
    "Acceptance": "72.0%",
    "Difficulty": "Easy",
    "Frequency": "0.059408706690609644",
    "Link": " https://leetcode.com/problems/array-partition-i"
  },
  "217": {
    "Name": "Contains Duplicate",
    "Acceptance": "56.0%",
    "Difficulty": "Easy",
    "Frequency": "0.12305339234280654",
    "Link": " https://leetcode.com/problems/contains-duplicate"
  },
  "198": {
    "Name": "House Robber",
    "Acceptance": "42.0%",
    "Difficulty": "Easy",
    "Frequency": "0.16929591377679865",
    "Link": " https://leetcode.com/problems/house-robber"
  },
  "54": {
    "Name": "Spiral Matrix",
    "Acceptance": "34.1%",
    "Difficulty": "Medium",
    "Frequency": "0.12572728493821236",
    "Link": " https://leetcode.com/problems/spiral-matrix"
  },
  "142": {
    "Name": "Linked List Cycle II",
    "Acceptance": "37.3%",
    "Difficulty": "Medium",
    "Frequency": "1.179958785742859",
    "Link": " https://leetcode.com/problems/linked-list-cycle-ii"
  },
  "41": {
    "Name": "First Missing Positive",
    "Acceptance": "32.0%",
    "Difficulty": "Hard",
    "Frequency": "0.014368063266920193",
    "Link": " https://leetcode.com/problems/first-missing-positive"
  },
  "315": {
    "Name": "Count of Smaller Numbers After Self",
    "Acceptance": "41.5%",
    "Difficulty": "Hard",
    "Frequency": "0.30851522790511515",
    "Link": " https://leetcode.com/problems/count-of-smaller-numbers-after-self"
  },
  "24": {
    "Name": "Swap Nodes in Pairs",
    "Acceptance": "50.4%",
    "Difficulty": "Medium",
    "Frequency": "0.1729418749687828",
    "Link": " https://leetcode.com/problems/swap-nodes-in-pairs"
  },
  "703": {
    "Name": "Kth Largest Element in a Stream",
    "Acceptance": "49.7%",
    "Difficulty": "Easy",
    "Frequency": "0.031004894819414507",
    "Link": " https://leetcode.com/problems/kth-largest-element-in-a-stream"
  },
  "64": {
    "Name": "Minimum Path Sum",
    "Acceptance": "54.5%",
    "Difficulty": "Medium",
    "Frequency": "0.024287775531756203",
    "Link": " https://leetcode.com/problems/minimum-path-sum"
  },
  "44": {
    "Name": "Wildcard Matching",
    "Acceptance": "24.7%",
    "Difficulty": "Hard",
    "Frequency": "0.8088199846507318",
    "Link": " https://leetcode.com/problems/wildcard-matching"
  },
  "13": {
    "Name": "Roman to Integer",
    "Acceptance": "55.7%",
    "Difficulty": "Easy",
    "Frequency": "0.01303586978808304",
    "Link": " https://leetcode.com/problems/roman-to-integer"
  },
  "1192": {
    "Name": "Critical Connections in a Network",
    "Acceptance": "48.6%",
    "Difficulty": "Hard",
    "Frequency": "0.030183377823098576",
    "Link": " https://leetcode.com/problems/critical-connections-in-a-network"
  },
  "70": {
    "Name": "Climbing Stairs",
    "Acceptance": "47.8%",
    "Difficulty": "Easy",
    "Frequency": "0.006020261250215664",
    "Link": " https://leetcode.com/problems/climbing-stairs"
  },
  "329": {
    "Name": "Longest Increasing Path in a Matrix",
    "Acceptance": "43.4%",
    "Difficulty": "Hard",
    "Frequency": "0.8540205747820803",
    "Link": " https://leetcode.com/problems/longest-increasing-path-in-a-matrix"
  },
  "85": {
    "Name": "Maximal Rectangle",
    "Acceptance": "37.7%",
    "Difficulty": "Hard",
    "Frequency": "0.050135812424355455",
    "Link": " https://leetcode.com/problems/maximal-rectangle"
  },
  "344": {
    "Name": "Reverse String",
    "Acceptance": "68.5%",
    "Difficulty": "Easy",
    "Frequency": "0.051072212148151434",
    "Link": " https://leetcode.com/problems/reverse-string"
  },
  "137": {
    "Name": "Single Number II",
    "Acceptance": "52.4%",
    "Difficulty": "Medium",
    "Frequency": "1.1931677117978516",
    "Link": " https://leetcode.com/problems/single-number-ii"
  },
  "88": {
    "Name": "Merge Sorted Array",
    "Acceptance": "39.4%",
    "Difficulty": "Easy",
    "Frequency": "0.0697535511282702",
    "Link": " https://leetcode.com/problems/merge-sorted-array"
  },
  "543": {
    "Name": "Diameter of Binary Tree",
    "Acceptance": "48.4%",
    "Difficulty": "Easy",
    "Frequency": "0.032708305572393875",
    "Link": " https://leetcode.com/problems/diameter-of-binary-tree"
  },
  "987": {
    "Name": "Vertical Order Traversal of a Binary Tree",
    "Acceptance": "36.6%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree"
  },
  "1051": {
    "Name": "Height Checker",
    "Acceptance": "71.1%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/height-checker"
  },
  "48": {
    "Name": "Rotate Image",
    "Acceptance": "56.7%",
    "Difficulty": "Medium",
    "Frequency": "0.019354662474288496",
    "Link": " https://leetcode.com/problems/rotate-image"
  },
  "148": {
    "Name": "Sort List",
    "Acceptance": "42.3%",
    "Difficulty": "Medium",
    "Frequency": "1.1657881739717664",
    "Link": " https://leetcode.com/problems/sort-list"
  },
  "236": {
    "Name": "Lowest Common Ancestor of a Binary Tree",
    "Acceptance": "45.7%",
    "Difficulty": "Medium",
    "Frequency": "0.27050984255037824",
    "Link": " https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree"
  },
  "92": {
    "Name": "Reverse Linked List II",
    "Acceptance": "38.8%",
    "Difficulty": "Medium",
    "Frequency": "0.041073535208287514",
    "Link": " https://leetcode.com/problems/reverse-linked-list-ii"
  },
  "234": {
    "Name": "Palindrome Linked List",
    "Acceptance": "39.3%",
    "Difficulty": "Easy",
    "Frequency": "0.010171877938733932",
    "Link": " https://leetcode.com/problems/palindrome-linked-list"
  },
  "61": {
    "Name": "Rotate List",
    "Acceptance": "30.0%",
    "Difficulty": "Medium",
    "Frequency": "1.4847733982613056",
    "Link": " https://leetcode.com/problems/rotate-list"
  },
  "113": {
    "Name": "Path Sum II",
    "Acceptance": "46.7%",
    "Difficulty": "Medium",
    "Frequency": "0.10919117261048063",
    "Link": " https://leetcode.com/problems/path-sum-ii"
  },
  "387": {
    "Name": "First Unique Character in a String",
    "Acceptance": "53.4%",
    "Difficulty": "Easy",
    "Frequency": "0.009392680199054166",
    "Link": " https://leetcode.com/problems/first-unique-character-in-a-string"
  },
  "96": {
    "Name": "Unique Binary Search Trees",
    "Acceptance": "52.9%",
    "Difficulty": "Medium",
    "Frequency": "0.056410171529350385",
    "Link": " https://leetcode.com/problems/unique-binary-search-trees"
  },
  "279": {
    "Name": "Perfect Squares",
    "Acceptance": "47.4%",
    "Difficulty": "Medium",
    "Frequency": "0.008781615160384712",
    "Link": " https://leetcode.com/problems/perfect-squares"
  },
  "20": {
    "Name": "Valid Parentheses",
    "Acceptance": "39.0%",
    "Difficulty": "Easy",
    "Frequency": "0.034596174971291214",
    "Link": " https://leetcode.com/problems/valid-parentheses"
  },
  "23": {
    "Name": "Merge k Sorted Lists",
    "Acceptance": "40.2%",
    "Difficulty": "Hard",
    "Frequency": "0.023981964686485415",
    "Link": " https://leetcode.com/problems/merge-k-sorted-lists"
  },
  "128": {
    "Name": "Longest Consecutive Sequence",
    "Acceptance": "45.1%",
    "Difficulty": "Hard",
    "Frequency": "0.020252717433212362",
    "Link": " https://leetcode.com/problems/longest-consecutive-sequence"
  },
  "295": {
    "Name": "Find Median from Data Stream",
    "Acceptance": "44.3%",
    "Difficulty": "Hard",
    "Frequency": "0.34887033918684873",
    "Link": " https://leetcode.com/problems/find-median-from-data-stream"
  },
  "139": {
    "Name": "Word Break",
    "Acceptance": "40.1%",
    "Difficulty": "Medium",
    "Frequency": "0.07342247443539282",
    "Link": " https://leetcode.com/problems/word-break"
  },
  "977": {
    "Name": "Squares of a Sorted Array",
    "Acceptance": "72.1%",
    "Difficulty": "Easy",
    "Frequency": "0.015474196582597383",
    "Link": " https://leetcode.com/problems/squares-of-a-sorted-array"
  },
  "49": {
    "Name": "Group Anagrams",
    "Acceptance": "56.9%",
    "Difficulty": "Medium",
    "Frequency": "0.008538951314232168",
    "Link": " https://leetcode.com/problems/group-anagrams"
  },
  "239": {
    "Name": "Sliding Window Maximum",
    "Acceptance": "43.0%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/sliding-window-maximum"
  },
  "56": {
    "Name": "Merge Intervals",
    "Acceptance": "39.3%",
    "Difficulty": "Medium",
    "Frequency": "0.10703248793941993",
    "Link": " https://leetcode.com/problems/merge-intervals"
  },
  "876": {
    "Name": "Middle of the Linked List",
    "Acceptance": "68.4%",
    "Difficulty": "Easy",
    "Frequency": "0.01631061893137506",
    "Link": " https://leetcode.com/problems/middle-of-the-linked-list"
  },
  "240": {
    "Name": "Search a 2D Matrix II",
    "Acceptance": "43.2%",
    "Difficulty": "Medium",
    "Frequency": "0.199673934851342",
    "Link": " https://leetcode.com/problems/search-a-2d-matrix-ii"
  },
  "16": {
    "Name": "3Sum Closest",
    "Acceptance": "46.0%",
    "Difficulty": "Medium",
    "Frequency": "0.00714416326666986",
    "Link": " https://leetcode.com/problems/3sum-closest"
  },
  "10": {
    "Name": "Regular Expression Matching",
    "Acceptance": "26.8%",
    "Difficulty": "Hard",
    "Frequency": "0.01609764684284749",
    "Link": " https://leetcode.com/problems/regular-expression-matching"
  },
  "1365": {
    "Name": "How Many Numbers Are Smaller Than the Current Number",
    "Acceptance": "85.6%",
    "Difficulty": "Easy",
    "Frequency": "0.015926721367078105",
    "Link": " https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number"
  },
  "110": {
    "Name": "Balanced Binary Tree",
    "Acceptance": "43.5%",
    "Difficulty": "Easy",
    "Frequency": "0.7847320043954652",
    "Link": " https://leetcode.com/problems/balanced-binary-tree"
  },
  "73": {
    "Name": "Set Matrix Zeroes",
    "Acceptance": "43.1%",
    "Difficulty": "Medium",
    "Frequency": "0.07912453490203865",
    "Link": " https://leetcode.com/problems/set-matrix-zeroes"
  },
  "114": {
    "Name": "Flatten Binary Tree to Linked List",
    "Acceptance": "49.3%",
    "Difficulty": "Medium",
    "Frequency": "0.026213820787528385",
    "Link": " https://leetcode.com/problems/flatten-binary-tree-to-linked-list"
  },
  "118": {
    "Name": "Pascal's Triangle",
    "Acceptance": "52.5%",
    "Difficulty": "Easy",
    "Frequency": "0.12852395589356347",
    "Link": " https://leetcode.com/problems/pascals-triangle"
  },
  "83": {
    "Name": "Remove Duplicates from Sorted List",
    "Acceptance": "45.4%",
    "Difficulty": "Easy",
    "Frequency": "0.055776537457411894",
    "Link": " https://leetcode.com/problems/remove-duplicates-from-sorted-list"
  },
  "91": {
    "Name": "Decode Ways",
    "Acceptance": "24.7%",
    "Difficulty": "Medium",
    "Frequency": "0.46914273798301376",
    "Link": " https://leetcode.com/problems/decode-ways"
  },
  "152": {
    "Name": "Maximum Product Subarray",
    "Acceptance": "31.7%",
    "Difficulty": "Medium",
    "Frequency": "0.034438665054543384",
    "Link": " https://leetcode.com/problems/maximum-product-subarray"
  },
  "287": {
    "Name": "Find the Duplicate Number",
    "Acceptance": "55.5%",
    "Difficulty": "Medium",
    "Frequency": "0.012335682739188652",
    "Link": " https://leetcode.com/problems/find-the-duplicate-number"
  },
  "112": {
    "Name": "Path Sum",
    "Acceptance": "41.2%",
    "Difficulty": "Easy",
    "Frequency": "0.062250218772217134",
    "Link": " https://leetcode.com/problems/path-sum"
  },
  "278": {
    "Name": "First Bad Version",
    "Acceptance": "35.7%",
    "Difficulty": "Easy",
    "Frequency": "0.021394050366625766",
    "Link": " https://leetcode.com/problems/first-bad-version"
  },
  "237": {
    "Name": "Delete Node in a Linked List",
    "Acceptance": "63.8%",
    "Difficulty": "Easy",
    "Frequency": "0.0756951835991673",
    "Link": " https://leetcode.com/problems/delete-node-in-a-linked-list"
  },
  "155": {
    "Name": "Min Stack",
    "Acceptance": "44.5%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/min-stack"
  },
  "169": {
    "Name": "Majority Element",
    "Acceptance": "58.7%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/majority-element"
  },
  "35": {
    "Name": "Search Insert Position",
    "Acceptance": "42.6%",
    "Difficulty": "Easy",
    "Frequency": "0.004646848510375352",
    "Link": " https://leetcode.com/problems/search-insert-position"
  },
  "1470": {
    "Name": "Shuffle the Array",
    "Acceptance": "88.9%",
    "Difficulty": "Easy",
    "Frequency": "0.004527967890154029",
    "Link": " https://leetcode.com/problems/shuffle-the-array"
  },
  "125": {
    "Name": "Valid Palindrome",
    "Acceptance": "36.7%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/valid-palindrome"
  },
  "215": {
    "Name": "Kth Largest Element in an Array",
    "Acceptance": "55.4%",
    "Difficulty": "Medium",
    "Frequency": "0.1468246397351854",
    "Link": " https://leetcode.com/problems/kth-largest-element-in-an-array"
  },
  "8": {
    "Name": "String to Integer (atoi)",
    "Acceptance": "15.4%",
    "Difficulty": "Medium",
    "Frequency": "0.008133799926770198",
    "Link": " https://leetcode.com/problems/string-to-integer-atoi"
  },
  "141": {
    "Name": "Linked List Cycle",
    "Acceptance": "41.1%",
    "Difficulty": "Easy",
    "Frequency": "0.15195931150111644",
    "Link": " https://leetcode.com/problems/linked-list-cycle"
  },
  "101": {
    "Name": "Symmetric Tree",
    "Acceptance": "46.8%",
    "Difficulty": "Easy",
    "Frequency": "0.06415501202452933",
    "Link": " https://leetcode.com/problems/symmetric-tree"
  },
  "14": {
    "Name": "Longest Common Prefix",
    "Acceptance": "35.4%",
    "Difficulty": "Easy",
    "Frequency": "0.1714957284786035",
    "Link": " https://leetcode.com/problems/longest-common-prefix"
  },
  "66": {
    "Name": "Plus One",
    "Acceptance": "43.0%",
    "Difficulty": "Easy",
    "Frequency": "0.039245846990968294",
    "Link": " https://leetcode.com/problems/plus-one"
  },
  "33": {
    "Name": "Search in Rotated Sorted Array",
    "Acceptance": "34.5%",
    "Difficulty": "Medium",
    "Frequency": "0.007252832180390353",
    "Link": " https://leetcode.com/problems/search-in-rotated-sorted-array"
  },
  "9": {
    "Name": "Palindrome Number",
    "Acceptance": "48.4%",
    "Difficulty": "Easy",
    "Frequency": "0.13338577922783287",
    "Link": " https://leetcode.com/problems/palindrome-number"
  },
  "98": {
    "Name": "Validate Binary Search Tree",
    "Acceptance": "27.8%",
    "Difficulty": "Medium",
    "Frequency": "0.14682390140626445",
    "Link": " https://leetcode.com/problems/validate-binary-search-tree"
  },
  "104": {
    "Name": "Maximum Depth of Binary Tree",
    "Acceptance": "66.0%",
    "Difficulty": "Easy",
    "Frequency": "0.07782775325625388",
    "Link": " https://leetcode.com/problems/maximum-depth-of-binary-tree"
  },
  "121": {
    "Name": "Best Time to Buy and Sell Stock",
    "Acceptance": "50.5%",
    "Difficulty": "Easy",
    "Frequency": "0.02468763599282147",
    "Link": " https://leetcode.com/problems/best-time-to-buy-and-sell-stock"
  },
  "26": {
    "Name": "Remove Duplicates from Sorted Array",
    "Acceptance": "45.1%",
    "Difficulty": "Easy",
    "Frequency": "0.030773138378062014",
    "Link": " https://leetcode.com/problems/remove-duplicates-from-sorted-array"
  },
  "79": {
    "Name": "Word Search",
    "Acceptance": "35.6%",
    "Difficulty": "Medium",
    "Frequency": "0.014673179500416637",
    "Link": " https://leetcode.com/problems/word-search"
  },
  "192": {
    "Name": "Word Frequency",
    "Acceptance": "25.8%",
    "Difficulty": "Medium",
    "Frequency": "0.10186917331721722",
    "Link": " https://leetcode.com/problems/word-frequency"
  },
  "726": {
    "Name": "Number of Atoms",
    "Acceptance": "49.0%",
    "Difficulty": "Hard",
    "Frequency": "0.06371581438610768",
    "Link": " https://leetcode.com/problems/number-of-atoms"
  },
  "446": {
    "Name": "Arithmetic Slices II - Subsequence",
    "Acceptance": "32.7%",
    "Difficulty": "Hard",
    "Frequency": "0.25416851512733507",
    "Link": " https://leetcode.com/problems/arithmetic-slices-ii-subsequence"
  },
  "929": {
    "Name": "Unique Email Addresses",
    "Acceptance": "67.4%",
    "Difficulty": "Easy",
    "Frequency": "0.033748984736641036",
    "Link": " https://leetcode.com/problems/unique-email-addresses"
  },
  "386": {
    "Name": "Lexicographical Numbers",
    "Acceptance": "51.6%",
    "Difficulty": "Medium",
    "Frequency": "0.49504337366290274",
    "Link": " https://leetcode.com/problems/lexicographical-numbers"
  },
  "554": {
    "Name": "Brick Wall",
    "Acceptance": "50.0%",
    "Difficulty": "Medium",
    "Frequency": "0.8487112881843506",
    "Link": " https://leetcode.com/problems/brick-wall"
  },
  "771": {
    "Name": "Jewels and Stones",
    "Acceptance": "86.4%",
    "Difficulty": "Easy",
    "Frequency": "0.08172573752382946",
    "Link": " https://leetcode.com/problems/jewels-and-stones"
  },
  "195": {
    "Name": "Tenth Line",
    "Acceptance": "33.0%",
    "Difficulty": "Easy",
    "Frequency": "0.1329388000145885",
    "Link": " https://leetcode.com/problems/tenth-line"
  },
  "595": {
    "Name": "Big Countries",
    "Acceptance": "77.3%",
    "Difficulty": "Easy",
    "Frequency": "0.03475253199083958",
    "Link": " https://leetcode.com/problems/big-countries"
  },
  "177": {
    "Name": "Nth Highest Salary",
    "Acceptance": "31.4%",
    "Difficulty": "Medium",
    "Frequency": "0.032054026290083464",
    "Link": " https://leetcode.com/problems/nth-highest-salary"
  },
  "30": {
    "Name": "Substring with Concatenation of All Words",
    "Acceptance": "25.4%",
    "Difficulty": "Hard",
    "Frequency": "0.41194709630297865",
    "Link": " https://leetcode.com/problems/substring-with-concatenation-of-all-words"
  },
  "601": {
    "Name": "Human Traffic of Stadium",
    "Acceptance": "41.7%",
    "Difficulty": "Hard",
    "Frequency": "0.05223119222544569",
    "Link": " https://leetcode.com/problems/human-traffic-of-stadium"
  },
  "681": {
    "Name": "Next Closest Time",
    "Acceptance": "45.0%",
    "Difficulty": "Medium",
    "Frequency": "0.05045206096038863",
    "Link": " https://leetcode.com/problems/next-closest-time"
  },
  "856": {
    "Name": "Score of Parentheses",
    "Acceptance": "60.5%",
    "Difficulty": "Medium",
    "Frequency": "0.09997219291013618",
    "Link": " https://leetcode.com/problems/score-of-parentheses"
  },
  "669": {
    "Name": "Trim a Binary Search Tree",
    "Acceptance": "63.0%",
    "Difficulty": "Easy",
    "Frequency": "0.15441568579144338",
    "Link": " https://leetcode.com/problems/trim-a-binary-search-tree"
  },
  "448": {
    "Name": "Find All Numbers Disappeared in an Array",
    "Acceptance": "55.9%",
    "Difficulty": "Easy",
    "Frequency": "0.025954417138050502",
    "Link": " https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array"
  },
  "535": {
    "Name": "Encode and Decode TinyURL",
    "Acceptance": "79.9%",
    "Difficulty": "Medium",
    "Frequency": "0.7284232783609871",
    "Link": " https://leetcode.com/problems/encode-and-decode-tinyurl"
  },
  "1010": {
    "Name": "Pairs of Songs With Total Durations Divisible by 60",
    "Acceptance": "47.4%",
    "Difficulty": "Easy",
    "Frequency": "0.04180336980436055",
    "Link": " https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60"
  },
  "545": {
    "Name": "Boundary of Binary Tree",
    "Acceptance": "38.9%",
    "Difficulty": "Medium",
    "Frequency": "0.235382573048932",
    "Link": " https://leetcode.com/problems/boundary-of-binary-tree"
  },
  "686": {
    "Name": "Repeated String Match",
    "Acceptance": "32.3%",
    "Difficulty": "Easy",
    "Frequency": "4.836325284003677",
    "Link": " https://leetcode.com/problems/repeated-string-match"
  },
  "402": {
    "Name": "Remove K Digits",
    "Acceptance": "28.4%",
    "Difficulty": "Medium",
    "Frequency": "0.016863806052004816",
    "Link": " https://leetcode.com/problems/remove-k-digits"
  },
  "95": {
    "Name": "Unique Binary Search Trees II",
    "Acceptance": "40.6%",
    "Difficulty": "Medium",
    "Frequency": "0.23140873085083383",
    "Link": " https://leetcode.com/problems/unique-binary-search-trees-ii"
  },
  "46": {
    "Name": "Permutations",
    "Acceptance": "63.5%",
    "Difficulty": "Medium",
    "Frequency": "0.17865549703058456",
    "Link": " https://leetcode.com/problems/permutations"
  },
  "375": {
    "Name": "Guess Number Higher or Lower II",
    "Acceptance": "40.3%",
    "Difficulty": "Medium",
    "Frequency": "2.412208895973755",
    "Link": " https://leetcode.com/problems/guess-number-higher-or-lower-ii"
  },
  "875": {
    "Name": "Koko Eating Bananas",
    "Acceptance": "52.1%",
    "Difficulty": "Medium",
    "Frequency": "0.20615016122677673",
    "Link": " https://leetcode.com/problems/koko-eating-bananas"
  },
  "32": {
    "Name": "Longest Valid Parentheses",
    "Acceptance": "28.4%",
    "Difficulty": "Hard",
    "Frequency": "0.053811130379891575",
    "Link": " https://leetcode.com/problems/longest-valid-parentheses"
  },
  "78": {
    "Name": "Subsets",
    "Acceptance": "62.0%",
    "Difficulty": "Medium",
    "Frequency": "0.03610109392687382",
    "Link": " https://leetcode.com/problems/subsets"
  },
  "131": {
    "Name": "Palindrome Partitioning",
    "Acceptance": "47.5%",
    "Difficulty": "Medium",
    "Frequency": "0.07999145847429394",
    "Link": " https://leetcode.com/problems/palindrome-partitioning"
  },
  "460": {
    "Name": "LFU Cache",
    "Acceptance": "34.2%",
    "Difficulty": "Hard",
    "Frequency": "0.3604069261652464",
    "Link": " https://leetcode.com/problems/lfu-cache"
  },
  "316": {
    "Name": "Remove Duplicate Letters",
    "Acceptance": "35.8%",
    "Difficulty": "Hard",
    "Frequency": "0.1692074260063661",
    "Link": " https://leetcode.com/problems/remove-duplicate-letters"
  },
  "201": {
    "Name": "Bitwise AND of Numbers Range",
    "Acceptance": "39.4%",
    "Difficulty": "Medium",
    "Frequency": "0.5616591289700842",
    "Link": " https://leetcode.com/problems/bitwise-and-of-numbers-range"
  },
  "709": {
    "Name": "To Lower Case",
    "Acceptance": "79.3%",
    "Difficulty": "Easy",
    "Frequency": "0.02780531308033682",
    "Link": " https://leetcode.com/problems/to-lower-case"
  },
  "159": {
    "Name": "Longest Substring with At Most Two Distinct Characters",
    "Acceptance": "49.4%",
    "Difficulty": "Medium",
    "Frequency": "0.36517862980007215",
    "Link": " https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters"
  },
  "81": {
    "Name": "Search in Rotated Sorted Array II",
    "Acceptance": "33.0%",
    "Difficulty": "Medium",
    "Frequency": "0.6690496289808848",
    "Link": " https://leetcode.com/problems/search-in-rotated-sorted-array-ii"
  },
  "378": {
    "Name": "Kth Smallest Element in a Sorted Matrix",
    "Acceptance": "54.3%",
    "Difficulty": "Medium",
    "Frequency": "0.0671753972751187",
    "Link": " https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix"
  },
  "143": {
    "Name": "Reorder List",
    "Acceptance": "37.1%",
    "Difficulty": "Medium",
    "Frequency": "0.04554002588608351",
    "Link": " https://leetcode.com/problems/reorder-list"
  },
  "107": {
    "Name": "Binary Tree Level Order Traversal II",
    "Acceptance": "53.5%",
    "Difficulty": "Easy",
    "Frequency": "0.014395642075089957",
    "Link": " https://leetcode.com/problems/binary-tree-level-order-traversal-ii"
  },
  "877": {
    "Name": "Stone Game",
    "Acceptance": "64.8%",
    "Difficulty": "Medium",
    "Frequency": "0.02486144206532915",
    "Link": " https://leetcode.com/problems/stone-game"
  },
  "138": {
    "Name": "Copy List with Random Pointer",
    "Acceptance": "36.4%",
    "Difficulty": "Medium",
    "Frequency": "0.11310689844326921",
    "Link": " https://leetcode.com/problems/copy-list-with-random-pointer"
  },
  "65": {
    "Name": "Valid Number",
    "Acceptance": "15.3%",
    "Difficulty": "Hard",
    "Frequency": "0.04813763559815448",
    "Link": " https://leetcode.com/problems/valid-number"
  },
  "199": {
    "Name": "Binary Tree Right Side View",
    "Acceptance": "54.1%",
    "Difficulty": "Medium",
    "Frequency": "0.0056826406650506926",
    "Link": " https://leetcode.com/problems/binary-tree-right-side-view"
  },
  "72": {
    "Name": "Edit Distance",
    "Acceptance": "44.8%",
    "Difficulty": "Hard",
    "Frequency": "0.08301606966836801",
    "Link": " https://leetcode.com/problems/edit-distance"
  },
  "185": {
    "Name": "Department Top Three Salaries",
    "Acceptance": "34.5%",
    "Difficulty": "Hard",
    "Frequency": "0.07421850176056281",
    "Link": " https://leetcode.com/problems/department-top-three-salaries"
  },
  "224": {
    "Name": "Basic Calculator",
    "Acceptance": "36.8%",
    "Difficulty": "Hard",
    "Frequency": "1.204714054955524",
    "Link": " https://leetcode.com/problems/basic-calculator"
  },
  "93": {
    "Name": "Restore IP Addresses",
    "Acceptance": "35.6%",
    "Difficulty": "Medium",
    "Frequency": "0.11242734769506908",
    "Link": " https://leetcode.com/problems/restore-ip-addresses"
  },
  "399": {
    "Name": "Evaluate Division",
    "Acceptance": "51.6%",
    "Difficulty": "Medium",
    "Frequency": "0.3338128467131867",
    "Link": " https://leetcode.com/problems/evaluate-division"
  },
  "235": {
    "Name": "Lowest Common Ancestor of a Binary Search Tree",
    "Acceptance": "49.9%",
    "Difficulty": "Easy",
    "Frequency": "0.12399764165657076",
    "Link": " https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree"
  },
  "197": {
    "Name": "Rising Temperature",
    "Acceptance": "38.4%",
    "Difficulty": "Easy",
    "Frequency": "0.2576203889657197",
    "Link": " https://leetcode.com/problems/rising-temperature"
  },
  "314": {
    "Name": "Binary Tree Vertical Order Traversal",
    "Acceptance": "45.3%",
    "Difficulty": "Medium",
    "Frequency": "0.07017345555905126",
    "Link": " https://leetcode.com/problems/binary-tree-vertical-order-traversal"
  },
  "136": {
    "Name": "Single Number",
    "Acceptance": "65.5%",
    "Difficulty": "Easy",
    "Frequency": "0.08335861851743445",
    "Link": " https://leetcode.com/problems/single-number"
  },
  "168": {
    "Name": "Excel Sheet Column Title",
    "Acceptance": "31.1%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/excel-sheet-column-title"
  },
  "415": {
    "Name": "Add Strings",
    "Acceptance": "47.5%",
    "Difficulty": "Easy",
    "Frequency": "0.08919862525832246",
    "Link": " https://leetcode.com/problems/add-strings"
  },
  "71": {
    "Name": "Simplify Path",
    "Acceptance": "32.6%",
    "Difficulty": "Medium",
    "Frequency": "0.015486178630494266",
    "Link": " https://leetcode.com/problems/simplify-path"
  },
  "1002": {
    "Name": "Find Common Characters",
    "Acceptance": "67.7%",
    "Difficulty": "Easy",
    "Frequency": "0.033176651317732786",
    "Link": " https://leetcode.com/problems/find-common-characters"
  },
  "29": {
    "Name": "Divide Two Integers",
    "Acceptance": "16.4%",
    "Difficulty": "Medium",
    "Frequency": "0.14250148324930875",
    "Link": " https://leetcode.com/problems/divide-two-integers"
  },
  "404": {
    "Name": "Sum of Left Leaves",
    "Acceptance": "50.9%",
    "Difficulty": "Easy",
    "Frequency": "0.013981353230340547",
    "Link": " https://leetcode.com/problems/sum-of-left-leaves"
  },
  "122": {
    "Name": "Best Time to Buy and Sell Stock II",
    "Acceptance": "57.0%",
    "Difficulty": "Easy",
    "Frequency": "0.03890614539325958",
    "Link": " https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii"
  },
  "57": {
    "Name": "Insert Interval",
    "Acceptance": "33.5%",
    "Difficulty": "Hard",
    "Frequency": "0.784728817691922",
    "Link": " https://leetcode.com/problems/insert-interval"
  },
  "665": {
    "Name": "Non-decreasing Array",
    "Acceptance": "19.5%",
    "Difficulty": "Easy",
    "Frequency": "0.23531936993140348",
    "Link": " https://leetcode.com/problems/non-decreasing-array"
  },
  "695": {
    "Name": "Max Area of Island",
    "Acceptance": "62.7%",
    "Difficulty": "Medium",
    "Frequency": "0.012132390248237822",
    "Link": " https://leetcode.com/problems/max-area-of-island"
  },
  "181": {
    "Name": "Employees Earning More Than Their Managers",
    "Acceptance": "56.9%",
    "Difficulty": "Easy",
    "Frequency": "0.1445812288111076",
    "Link": " https://leetcode.com/problems/employees-earning-more-than-their-managers"
  },
  "77": {
    "Name": "Combinations",
    "Acceptance": "54.7%",
    "Difficulty": "Medium",
    "Frequency": "0.13693231153364",
    "Link": " https://leetcode.com/problems/combinations"
  },
  "19": {
    "Name": "Remove Nth Node From End of List",
    "Acceptance": "35.2%",
    "Difficulty": "Medium",
    "Frequency": "0.018335680533090114",
    "Link": " https://leetcode.com/problems/remove-nth-node-from-end-of-list"
  },
  "547": {
    "Name": "Friend Circles",
    "Acceptance": "58.6%",
    "Difficulty": "Medium",
    "Frequency": "0.04804286211474039",
    "Link": " https://leetcode.com/problems/friend-circles"
  },
  "205": {
    "Name": "Isomorphic Strings",
    "Acceptance": "39.8%",
    "Difficulty": "Easy",
    "Frequency": "0.1703978238463443",
    "Link": " https://leetcode.com/problems/isomorphic-strings"
  },
  "268": {
    "Name": "Missing Number",
    "Acceptance": "51.7%",
    "Difficulty": "Easy",
    "Frequency": "0.01854480591539982",
    "Link": " https://leetcode.com/problems/missing-number"
  },
  "257": {
    "Name": "Binary Tree Paths",
    "Acceptance": "51.5%",
    "Difficulty": "Easy",
    "Frequency": "0.23334105110860667",
    "Link": " https://leetcode.com/problems/binary-tree-paths"
  },
  "647": {
    "Name": "Palindromic Substrings",
    "Acceptance": "60.6%",
    "Difficulty": "Medium",
    "Frequency": "0.023250853650202817",
    "Link": " https://leetcode.com/problems/palindromic-substrings"
  },
  "62": {
    "Name": "Unique Paths",
    "Acceptance": "54.1%",
    "Difficulty": "Medium",
    "Frequency": "0.02853749186115581",
    "Link": " https://leetcode.com/problems/unique-paths"
  },
  "380": {
    "Name": "Insert Delete GetRandom O(1)",
    "Acceptance": "47.5%",
    "Difficulty": "Medium",
    "Frequency": "0.08509738264123867",
    "Link": " https://leetcode.com/problems/insert-delete-getrandom-o1"
  },
  "47": {
    "Name": "Permutations II",
    "Acceptance": "46.4%",
    "Difficulty": "Medium",
    "Frequency": "0.08386751759778556",
    "Link": " https://leetcode.com/problems/permutations-ii"
  },
  "40": {
    "Name": "Combination Sum II",
    "Acceptance": "48.2%",
    "Difficulty": "Medium",
    "Frequency": "0.14322916392828683",
    "Link": " https://leetcode.com/problems/combination-sum-ii"
  },
  "700": {
    "Name": "Search in a Binary Search Tree",
    "Acceptance": "73.1%",
    "Difficulty": "Easy",
    "Frequency": "0.05205171583916148",
    "Link": " https://leetcode.com/problems/search-in-a-binary-search-tree"
  },
  "84": {
    "Name": "Largest Rectangle in Histogram",
    "Acceptance": "35.2%",
    "Difficulty": "Hard",
    "Frequency": "0.12570469475928556",
    "Link": " https://leetcode.com/problems/largest-rectangle-in-histogram"
  },
  "102": {
    "Name": "Binary Tree Level Order Traversal",
    "Acceptance": "54.6%",
    "Difficulty": "Medium",
    "Frequency": "0.15775607939386688",
    "Link": " https://leetcode.com/problems/binary-tree-level-order-traversal"
  },
  "38": {
    "Name": "Count and Say",
    "Acceptance": "44.6%",
    "Difficulty": "Easy",
    "Frequency": "0.030956234663467107",
    "Link": " https://leetcode.com/problems/count-and-say"
  },
  "692": {
    "Name": "Top K Frequent Words",
    "Acceptance": "51.8%",
    "Difficulty": "Medium",
    "Frequency": "0.43507396043031815",
    "Link": " https://leetcode.com/problems/top-k-frequent-words"
  },
  "145": {
    "Name": "Binary Tree Postorder Traversal",
    "Acceptance": "55.0%",
    "Difficulty": "Hard",
    "Frequency": "0.00751459482064135",
    "Link": " https://leetcode.com/problems/binary-tree-postorder-traversal"
  },
  "36": {
    "Name": "Valid Sudoku",
    "Acceptance": "48.7%",
    "Difficulty": "Medium",
    "Frequency": "0.007258242715805398",
    "Link": " https://leetcode.com/problems/valid-sudoku"
  },
  "412": {
    "Name": "Fizz Buzz",
    "Acceptance": "62.3%",
    "Difficulty": "Easy",
    "Frequency": "0.027152525030955416",
    "Link": " https://leetcode.com/problems/fizz-buzz"
  },
  "67": {
    "Name": "Add Binary",
    "Acceptance": "45.2%",
    "Difficulty": "Easy",
    "Frequency": "0.003735684238128885",
    "Link": " https://leetcode.com/problems/add-binary"
  },
  "105": {
    "Name": "Construct Binary Tree from Preorder and Inorder Traversal",
    "Acceptance": "48.8%",
    "Difficulty": "Medium",
    "Frequency": "0.06421700221172061",
    "Link": " https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal"
  },
  "50": {
    "Name": "Pow(x;n)",
    "Acceptance": "30.3%",
    "Difficulty": "Medium",
    "Frequency": "0.008728496167158806",
    "Link": " https://leetcode.com/problems/powx-n"
  },
  "124": {
    "Name": "Binary Tree Maximum Path Sum",
    "Acceptance": "34.3%",
    "Difficulty": "Hard",
    "Frequency": "0.034081815554754834",
    "Link": " https://leetcode.com/problems/binary-tree-maximum-path-sum"
  },
  "28": {
    "Name": "Implement strStr()",
    "Acceptance": "34.5%",
    "Difficulty": "Easy",
    "Frequency": "0.008476223285653011",
    "Link": " https://leetcode.com/problems/implement-strstr"
  },
  "283": {
    "Name": "Move Zeroes",
    "Acceptance": "57.8%",
    "Difficulty": "Easy",
    "Frequency": "0.002758622439079723",
    "Link": " https://leetcode.com/problems/move-zeroes"
  },
  "154": {
    "Name": "Find Minimum in Rotated Sorted Array II",
    "Acceptance": "41.6%",
    "Difficulty": "Hard",
    "Frequency": "0.013222109274363887",
    "Link": " https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii"
  },
  "203": {
    "Name": "Remove Linked List Elements",
    "Acceptance": "38.6%",
    "Difficulty": "Easy",
    "Frequency": "0.006479067005887776",
    "Link": " https://leetcode.com/problems/remove-linked-list-elements"
  },
  "292": {
    "Name": "Nim Game",
    "Acceptance": "54.9%",
    "Difficulty": "Easy",
    "Frequency": "0.03996979643236185",
    "Link": " https://leetcode.com/problems/nim-game"
  },
  "795": {
    "Name": "Number of Subarrays with Bounded Maximum",
    "Acceptance": "46.3%",
    "Difficulty": "Medium",
    "Frequency": "0.2171959803892134",
    "Link": " https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum"
  },
  "1190": {
    "Name": "Reverse Substrings Between Each Pair of Parentheses",
    "Acceptance": "61.5%",
    "Difficulty": "Medium",
    "Frequency": "0.09928670042921932",
    "Link": " https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses"
  },
  "258": {
    "Name": "Add Digits",
    "Acceptance": "57.6%",
    "Difficulty": "Easy",
    "Frequency": "0.03259608198749547",
    "Link": " https://leetcode.com/problems/add-digits"
  },
  "793": {
    "Name": "Preimage Size of Factorial Zeroes Function",
    "Acceptance": "40.3%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function"
  },
  "908": {
    "Name": "Smallest Range I",
    "Acceptance": "65.8%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/smallest-range-i"
  },
  "910": {
    "Name": "Smallest Range II",
    "Acceptance": "26.6%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/smallest-range-ii"
  },
  "413": {
    "Name": "Arithmetic Slices",
    "Acceptance": "57.9%",
    "Difficulty": "Medium",
    "Frequency": "0.3794137261371684",
    "Link": " https://leetcode.com/problems/arithmetic-slices"
  },
  "1106": {
    "Name": "Parsing A Boolean Expression",
    "Acceptance": "58.5%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/parsing-a-boolean-expression"
  },
  "381": {
    "Name": "Insert Delete GetRandom O(1) - Duplicates allowed",
    "Acceptance": "34.1%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed"
  },
  "736": {
    "Name": "Parse Lisp Expression",
    "Acceptance": "47.5%",
    "Difficulty": "Hard",
    "Frequency": "2.959364629383116",
    "Link": " https://leetcode.com/problems/parse-lisp-expression"
  },
  "362": {
    "Name": "Design Hit Counter",
    "Acceptance": "63.7%",
    "Difficulty": "Medium",
    "Frequency": "0.09391059944990159",
    "Link": " https://leetcode.com/problems/design-hit-counter"
  },
  "230": {
    "Name": "Kth Smallest Element in a BST",
    "Acceptance": "60.2%",
    "Difficulty": "Medium",
    "Frequency": "0.014200301729123736",
    "Link": " https://leetcode.com/problems/kth-smallest-element-in-a-bst"
  },
  "127": {
    "Name": "Word Ladder",
    "Acceptance": "29.6%",
    "Difficulty": "Medium",
    "Frequency": "0.16031071649701922",
    "Link": " https://leetcode.com/problems/word-ladder"
  },
  "755": {
    "Name": "Pour Water",
    "Acceptance": "43.3%",
    "Difficulty": "Medium",
    "Frequency": "0.5580780410684244",
    "Link": " https://leetcode.com/problems/pour-water"
  },
  "1166": {
    "Name": "Design File System",
    "Acceptance": "56.8%",
    "Difficulty": "Medium",
    "Frequency": "0.5632107588532816",
    "Link": " https://leetcode.com/problems/design-file-system"
  },
  "336": {
    "Name": "Palindrome Pairs",
    "Acceptance": "33.7%",
    "Difficulty": "Hard",
    "Frequency": "1.1081703064742152",
    "Link": " https://leetcode.com/problems/palindrome-pairs"
  },
  "166": {
    "Name": "Fraction to Recurring Decimal",
    "Acceptance": "21.6%",
    "Difficulty": "Medium",
    "Frequency": "1.3061986410149267",
    "Link": " https://leetcode.com/problems/fraction-to-recurring-decimal"
  },
  "773": {
    "Name": "Sliding Puzzle",
    "Acceptance": "59.3%",
    "Difficulty": "Hard",
    "Frequency": "1.5000532464765486",
    "Link": " https://leetcode.com/problems/sliding-puzzle"
  },
  "864": {
    "Name": "Shortest Path to Get All Keys",
    "Acceptance": "40.1%",
    "Difficulty": "Hard",
    "Frequency": "0.6061358035703156",
    "Link": " https://leetcode.com/problems/shortest-path-to-get-all-keys"
  },
  "787": {
    "Name": "Cheapest Flights Within K Stops",
    "Acceptance": "39.3%",
    "Difficulty": "Medium",
    "Frequency": "0.018824085245635554",
    "Link": " https://leetcode.com/problems/cheapest-flights-within-k-stops"
  },
  "269": {
    "Name": "Alien Dictionary",
    "Acceptance": "33.3%",
    "Difficulty": "Hard",
    "Frequency": "0.04997917057465883",
    "Link": " https://leetcode.com/problems/alien-dictionary"
  },
  "251": {
    "Name": "Flatten 2D Vector",
    "Acceptance": "45.7%",
    "Difficulty": "Medium",
    "Frequency": "0.06635933243696077",
    "Link": " https://leetcode.com/problems/flatten-2d-vector"
  },
  "1257": {
    "Name": "Smallest Common Region",
    "Acceptance": "58.8%",
    "Difficulty": "Medium",
    "Frequency": "0.5049690916532777",
    "Link": " https://leetcode.com/problems/smallest-common-region"
  },
  "68": {
    "Name": "Text Justification",
    "Acceptance": "27.7%",
    "Difficulty": "Hard",
    "Frequency": "2.4560547921829063",
    "Link": " https://leetcode.com/problems/text-justification"
  },
  "1235": {
    "Name": "Maximum Profit in Job Scheduling",
    "Acceptance": "44.0%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-profit-in-job-scheduling"
  },
  "39": {
    "Name": "Combination Sum",
    "Acceptance": "56.1%",
    "Difficulty": "Medium",
    "Frequency": "0.05030398316850793",
    "Link": " https://leetcode.com/problems/combination-sum"
  },
  "324": {
    "Name": "Wiggle Sort II",
    "Acceptance": "29.9%",
    "Difficulty": "Medium",
    "Frequency": "0.02898753687325229",
    "Link": " https://leetcode.com/problems/wiggle-sort-ii"
  },
  "759": {
    "Name": "Employee Free Time",
    "Acceptance": "66.3%",
    "Difficulty": "Hard",
    "Frequency": "0.10143824284548837",
    "Link": " https://leetcode.com/problems/employee-free-time"
  },
  "280": {
    "Name": "Wiggle Sort",
    "Acceptance": "63.8%",
    "Difficulty": "Medium",
    "Frequency": "0.4358425582560355",
    "Link": " https://leetcode.com/problems/wiggle-sort"
  },
  "341": {
    "Name": "Flatten Nested List Iterator",
    "Acceptance": "52.9%",
    "Difficulty": "Medium",
    "Frequency": "0.04440788848944038",
    "Link": " https://leetcode.com/problems/flatten-nested-list-iterator"
  },
  "751": {
    "Name": "IP to CIDR",
    "Acceptance": "61.7%",
    "Difficulty": "Medium",
    "Frequency": "4.677479721248074",
    "Link": " https://leetcode.com/problems/ip-to-cidr"
  },
  "756": {
    "Name": "Pyramid Transition Matrix",
    "Acceptance": "54.6%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/pyramid-transition-matrix"
  },
  "588": {
    "Name": "Design In-Memory File System",
    "Acceptance": "45.9%",
    "Difficulty": "Hard",
    "Frequency": "0.05841076215641451",
    "Link": " https://leetcode.com/problems/design-in-memory-file-system"
  },
  "843": {
    "Name": "Guess the Word",
    "Acceptance": "46.1%",
    "Difficulty": "Hard",
    "Frequency": "0.17062551703076334",
    "Link": " https://leetcode.com/problems/guess-the-word"
  },
  "622": {
    "Name": "Design Circular Queue",
    "Acceptance": "43.8%",
    "Difficulty": "Medium",
    "Frequency": "0.02134552762022309",
    "Link": " https://leetcode.com/problems/design-circular-queue"
  },
  "212": {
    "Name": "Word Search II",
    "Acceptance": "34.9%",
    "Difficulty": "Hard",
    "Frequency": "0.021038644146708085",
    "Link": " https://leetcode.com/problems/word-search-ii"
  },
  "299": {
    "Name": "Bulls and Cows",
    "Acceptance": "42.4%",
    "Difficulty": "Easy",
    "Frequency": "0.015504186535965254",
    "Link": " https://leetcode.com/problems/bulls-and-cows"
  },
  "211": {
    "Name": "Add and Search Word - Data structure design",
    "Acceptance": "38.1%",
    "Difficulty": "Medium",
    "Frequency": "0.15519944762134272",
    "Link": " https://leetcode.com/problems/add-and-search-word-data-structure-design"
  },
  "953": {
    "Name": "Verifying an Alien Dictionary",
    "Acceptance": "54.1%",
    "Difficulty": "Easy",
    "Frequency": "0.03117337947619734",
    "Link": " https://leetcode.com/problems/verifying-an-alien-dictionary"
  },
  "34": {
    "Name": "Find First and Last Position of Element in Sorted Array",
    "Acceptance": "36.2%",
    "Difficulty": "Medium",
    "Frequency": "0.00915477861600125",
    "Link": " https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array"
  },
  "1058": {
    "Name": "Minimize Rounding Error to Meet Target",
    "Acceptance": "41.7%",
    "Difficulty": "Medium",
    "Frequency": "1.042653635020065",
    "Link": " https://leetcode.com/problems/minimize-rounding-error-to-meet-target"
  },
  "385": {
    "Name": "Mini Parser",
    "Acceptance": "33.8%",
    "Difficulty": "Medium",
    "Frequency": "0.44685032427101873",
    "Link": " https://leetcode.com/problems/mini-parser"
  },
  "160": {
    "Name": "Intersection of Two Linked Lists",
    "Acceptance": "40.6%",
    "Difficulty": "Easy",
    "Frequency": "0.18126267087820316",
    "Link": " https://leetcode.com/problems/intersection-of-two-linked-lists"
  },
  "108": {
    "Name": "Convert Sorted Array to Binary Search Tree",
    "Acceptance": "57.9%",
    "Difficulty": "Easy",
    "Frequency": "0.10267368950715268",
    "Link": " https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree"
  },
  "190": {
    "Name": "Reverse Bits",
    "Acceptance": "39.8%",
    "Difficulty": "Easy",
    "Frequency": "0.0018316700789167337",
    "Link": " https://leetcode.com/problems/reverse-bits"
  },
  "227": {
    "Name": "Basic Calculator II",
    "Acceptance": "36.9%",
    "Difficulty": "Medium",
    "Frequency": "1.831507899537194",
    "Link": " https://leetcode.com/problems/basic-calculator-ii"
  },
  "1017": {
    "Name": "Convert to Base -2",
    "Acceptance": "59.0%",
    "Difficulty": "Medium",
    "Frequency": "0.17904823144898546",
    "Link": " https://leetcode.com/problems/convert-to-base-2"
  },
  "1041": {
    "Name": "Robot Bounded In Circle",
    "Acceptance": "49.6%",
    "Difficulty": "Medium",
    "Frequency": "0.0483770263821056",
    "Link": " https://leetcode.com/problems/robot-bounded-in-circle"
  },
  "1284": {
    "Name": "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix",
    "Acceptance": "69.5%",
    "Difficulty": "Hard",
    "Frequency": "1.076872302031704",
    "Link": " https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"
  },
  "1298": {
    "Name": "Maximum Candies You Can Get from Boxes",
    "Acceptance": "58.8%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes"
  },
  "1310": {
    "Name": "XOR Queries of a Subarray",
    "Acceptance": "68.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/xor-queries-of-a-subarray"
  },
  "961": {
    "Name": "N-Repeated Element in Size 2N Array",
    "Acceptance": "73.7%",
    "Difficulty": "Easy",
    "Frequency": "0.025609594204324387",
    "Link": " https://leetcode.com/problems/n-repeated-element-in-size-2n-array"
  },
  "1223": {
    "Name": "Dice Roll Simulation",
    "Acceptance": "45.6%",
    "Difficulty": "Medium",
    "Frequency": "0.35774963506849783",
    "Link": " https://leetcode.com/problems/dice-roll-simulation"
  },
  "713": {
    "Name": "Subarray Product Less Than K",
    "Acceptance": "39.1%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/subarray-product-less-than-k"
  },
  "1411": {
    "Name": "Number of Ways to Paint N \u00d7 3 Grid",
    "Acceptance": "61.1%",
    "Difficulty": "Hard",
    "Frequency": "0.10135249426028749",
    "Link": " https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid"
  },
  "1177": {
    "Name": "Can Make Palindrome from Substring",
    "Acceptance": "34.6%",
    "Difficulty": "Medium",
    "Frequency": "0.24991141156531438",
    "Link": " https://leetcode.com/problems/can-make-palindrome-from-substring"
  },
  "1319": {
    "Name": "Number of Operations to Make Network Connected",
    "Acceptance": "53.1%",
    "Difficulty": "Medium",
    "Frequency": "0.04587960575069364",
    "Link": " https://leetcode.com/problems/number-of-operations-to-make-network-connected"
  },
  "1048": {
    "Name": "Longest String Chain",
    "Acceptance": "54.7%",
    "Difficulty": "Medium",
    "Frequency": "0.21470136904554477",
    "Link": " https://leetcode.com/problems/longest-string-chain"
  },
  "995": {
    "Name": "Minimum Number of K Consecutive Bit Flips",
    "Acceptance": "46.8%",
    "Difficulty": "Hard",
    "Frequency": "0.08894748601649616",
    "Link": " https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips"
  },
  "443": {
    "Name": "String Compression",
    "Acceptance": "41.3%",
    "Difficulty": "Easy",
    "Frequency": "0.052333720049023605",
    "Link": " https://leetcode.com/problems/string-compression"
  },
  "743": {
    "Name": "Network Delay Time",
    "Acceptance": "45.0%",
    "Difficulty": "Medium",
    "Frequency": "0.012743084194281933",
    "Link": " https://leetcode.com/problems/network-delay-time"
  },
  "677": {
    "Name": "Map Sum Pairs",
    "Acceptance": "53.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/map-sum-pairs"
  },
  "740": {
    "Name": "Delete and Earn",
    "Acceptance": "48.6%",
    "Difficulty": "Medium",
    "Frequency": "0.05109668266230467",
    "Link": " https://leetcode.com/problems/delete-and-earn"
  },
  "1425": {
    "Name": "Constrained Subsequence Sum",
    "Acceptance": "44.1%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/constrained-subsequence-sum"
  },
  "1326": {
    "Name": "Minimum Number of Taps to Open to Water a Garden",
    "Acceptance": "43.6%",
    "Difficulty": "Hard",
    "Frequency": "0.2786048543006643",
    "Link": " https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden"
  },
  "1338": {
    "Name": "Reduce Array Size to The Half",
    "Acceptance": "67.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/reduce-array-size-to-the-half"
  },
  "1370": {
    "Name": "Increasing Decreasing String",
    "Acceptance": "75.7%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/increasing-decreasing-string"
  },
  "992": {
    "Name": "Subarrays with K Different Integers",
    "Acceptance": "48.6%",
    "Difficulty": "Hard",
    "Frequency": "0.03700699810869683",
    "Link": " https://leetcode.com/problems/subarrays-with-k-different-integers"
  },
  "678": {
    "Name": "Valid Parenthesis String",
    "Acceptance": "31.0%",
    "Difficulty": "Medium",
    "Frequency": "0.1879537610768114",
    "Link": " https://leetcode.com/problems/valid-parenthesis-string"
  },
  "173": {
    "Name": "Binary Search Tree Iterator",
    "Acceptance": "56.6%",
    "Difficulty": "Medium",
    "Frequency": "0.8009344168671371",
    "Link": " https://leetcode.com/problems/binary-search-tree-iterator"
  },
  "394": {
    "Name": "Decode String",
    "Acceptance": "50.0%",
    "Difficulty": "Medium",
    "Frequency": "0.008166644000272283",
    "Link": " https://leetcode.com/problems/decode-string"
  },
  "94": {
    "Name": "Binary Tree Inorder Traversal",
    "Acceptance": "63.3%",
    "Difficulty": "Medium",
    "Frequency": "0.007533307577636257",
    "Link": " https://leetcode.com/problems/binary-tree-inorder-traversal"
  },
  "666": {
    "Name": "Path Sum IV",
    "Acceptance": "54.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/path-sum-iv"
  },
  "548": {
    "Name": "Split Array with Equal Sum",
    "Acceptance": "46.4%",
    "Difficulty": "Medium",
    "Frequency": "1.0048321509441844",
    "Link": " https://leetcode.com/problems/split-array-with-equal-sum"
  },
  "555": {
    "Name": "Split Concatenated Strings",
    "Acceptance": "42.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/split-concatenated-strings"
  },
  "937": {
    "Name": "Reorder Data in Log Files",
    "Acceptance": "54.3%",
    "Difficulty": "Easy",
    "Frequency": "0.017971729704467775",
    "Link": " https://leetcode.com/problems/reorder-data-in-log-files"
  },
  "819": {
    "Name": "Most Common Word",
    "Acceptance": "44.8%",
    "Difficulty": "Easy",
    "Frequency": "0.010269666637456105",
    "Link": " https://leetcode.com/problems/most-common-word"
  },
  "763": {
    "Name": "Partition Labels",
    "Acceptance": "76.1%",
    "Difficulty": "Medium",
    "Frequency": "0.008385793376274025",
    "Link": " https://leetcode.com/problems/partition-labels"
  },
  "572": {
    "Name": "Subtree of Another Tree",
    "Acceptance": "44.1%",
    "Difficulty": "Easy",
    "Frequency": "0.08694829147719678",
    "Link": " https://leetcode.com/problems/subtree-of-another-tree"
  },
  "472": {
    "Name": "Concatenated Words",
    "Acceptance": "43.7%",
    "Difficulty": "Hard",
    "Frequency": "0.06120196522807572",
    "Link": " https://leetcode.com/problems/concatenated-words"
  },
  "973": {
    "Name": "K Closest Points to Origin",
    "Acceptance": "63.8%",
    "Difficulty": "Medium",
    "Frequency": "0.021855807808645634",
    "Link": " https://leetcode.com/problems/k-closest-points-to-origin"
  },
  "1167": {
    "Name": "Minimum Cost to Connect Sticks",
    "Acceptance": "62.8%",
    "Difficulty": "Medium",
    "Frequency": "0.03937516523483013",
    "Link": " https://leetcode.com/problems/minimum-cost-to-connect-sticks"
  },
  "957": {
    "Name": "Prison Cells After N Days",
    "Acceptance": "40.7%",
    "Difficulty": "Medium",
    "Frequency": "0.010986103354595014",
    "Link": " https://leetcode.com/problems/prison-cells-after-n-days"
  },
  "1152": {
    "Name": "Analyze User Website Visit Pattern",
    "Acceptance": "43.5%",
    "Difficulty": "Medium",
    "Frequency": "3.092908705843992",
    "Link": " https://leetcode.com/problems/analyze-user-website-visit-pattern"
  },
  "1268": {
    "Name": "Search Suggestions System",
    "Acceptance": "63.2%",
    "Difficulty": "Medium",
    "Frequency": "2.6191388654944228",
    "Link": " https://leetcode.com/problems/search-suggestions-system"
  },
  "297": {
    "Name": "Serialize and Deserialize Binary Tree",
    "Acceptance": "47.5%",
    "Difficulty": "Hard",
    "Frequency": "0.15573832539420163",
    "Link": " https://leetcode.com/problems/serialize-and-deserialize-binary-tree"
  },
  "642": {
    "Name": "Design Search Autocomplete System",
    "Acceptance": "44.7%",
    "Difficulty": "Hard",
    "Frequency": "1.1539027516811295",
    "Link": " https://leetcode.com/problems/design-search-autocomplete-system"
  },
  "348": {
    "Name": "Design Tic-Tac-Toe",
    "Acceptance": "54.3%",
    "Difficulty": "Medium",
    "Frequency": "0.2625527836498761",
    "Link": " https://leetcode.com/problems/design-tic-tac-toe"
  },
  "694": {
    "Name": "Number of Distinct Islands",
    "Acceptance": "56.0%",
    "Difficulty": "Medium",
    "Frequency": "0.18924199963852842",
    "Link": " https://leetcode.com/problems/number-of-distinct-islands"
  },
  "126": {
    "Name": "Word Ladder II",
    "Acceptance": "22.1%",
    "Difficulty": "Hard",
    "Frequency": "0.15135837956172798",
    "Link": " https://leetcode.com/problems/word-ladder-ii"
  },
  "253": {
    "Name": "Meeting Rooms II",
    "Acceptance": "45.7%",
    "Difficulty": "Medium",
    "Frequency": "0.29470460870072",
    "Link": " https://leetcode.com/problems/meeting-rooms-ii"
  },
  "273": {
    "Name": "Integer to English Words",
    "Acceptance": "27.1%",
    "Difficulty": "Hard",
    "Frequency": "0.37861967367115135",
    "Link": " https://leetcode.com/problems/integer-to-english-words"
  },
  "1102": {
    "Name": "Path With Maximum Minimum Value",
    "Acceptance": "49.2%",
    "Difficulty": "Medium",
    "Frequency": "0.1444815825552332",
    "Link": " https://leetcode.com/problems/path-with-maximum-minimum-value"
  },
  "866": {
    "Name": "Prime Palindrome",
    "Acceptance": "24.9%",
    "Difficulty": "Medium",
    "Frequency": "2.426668322236189",
    "Link": " https://leetcode.com/problems/prime-palindrome"
  },
  "1099": {
    "Name": "Two Sum Less Than K",
    "Acceptance": "60.6%",
    "Difficulty": "Easy",
    "Frequency": "0.04510347333459475",
    "Link": " https://leetcode.com/problems/two-sum-less-than-k"
  },
  "863": {
    "Name": "All Nodes Distance K in Binary Tree",
    "Acceptance": "55.4%",
    "Difficulty": "Medium",
    "Frequency": "0.0161554402222852",
    "Link": " https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree"
  },
  "1000": {
    "Name": "Minimum Cost to Merge Stones",
    "Acceptance": "39.8%",
    "Difficulty": "Hard",
    "Frequency": "0.8480760705432095",
    "Link": " https://leetcode.com/problems/minimum-cost-to-merge-stones"
  },
  "909": {
    "Name": "Snakes and Ladders",
    "Acceptance": "38.4%",
    "Difficulty": "Medium",
    "Frequency": "0.08392620769993404",
    "Link": " https://leetcode.com/problems/snakes-and-ladders"
  },
  "733": {
    "Name": "Flood Fill",
    "Acceptance": "55.3%",
    "Difficulty": "Easy",
    "Frequency": "0.09669362480247104",
    "Link": " https://leetcode.com/problems/flood-fill"
  },
  "99": {
    "Name": "Recover Binary Search Tree",
    "Acceptance": "39.7%",
    "Difficulty": "Hard",
    "Frequency": "0.8394185237297231",
    "Link": " https://leetcode.com/problems/recover-binary-search-tree"
  },
  "490": {
    "Name": "The Maze",
    "Acceptance": "51.4%",
    "Difficulty": "Medium",
    "Frequency": "0.24202227192369596",
    "Link": " https://leetcode.com/problems/the-maze"
  },
  "353": {
    "Name": "Design Snake Game",
    "Acceptance": "34.2%",
    "Difficulty": "Medium",
    "Frequency": "0.2144360950070665",
    "Link": " https://leetcode.com/problems/design-snake-game"
  },
  "17": {
    "Name": "Letter Combinations of a Phone Number",
    "Acceptance": "46.8%",
    "Difficulty": "Medium",
    "Frequency": "0.1414394798141693",
    "Link": " https://leetcode.com/problems/letter-combinations-of-a-phone-number"
  },
  "140": {
    "Name": "Word Break II",
    "Acceptance": "32.6%",
    "Difficulty": "Hard",
    "Frequency": "0.010661081786113668",
    "Link": " https://leetcode.com/problems/word-break-ii"
  },
  "1155": {
    "Name": "Number of Dice Rolls With Target Sum",
    "Acceptance": "49.0%",
    "Difficulty": "Medium",
    "Frequency": "0.018904154639152678",
    "Link": " https://leetcode.com/problems/number-of-dice-rolls-with-target-sum"
  },
  "815": {
    "Name": "Bus Routes",
    "Acceptance": "42.5%",
    "Difficulty": "Hard",
    "Frequency": "0.3449091275382815",
    "Link": " https://leetcode.com/problems/bus-routes"
  },
  "772": {
    "Name": "Basic Calculator III",
    "Acceptance": "41.3%",
    "Difficulty": "Hard",
    "Frequency": "1.324801306769502",
    "Link": " https://leetcode.com/problems/basic-calculator-iii"
  },
  "981": {
    "Name": "Time Based Key-Value Store",
    "Acceptance": "53.1%",
    "Difficulty": "Medium",
    "Frequency": "0.17728013452102853",
    "Link": " https://leetcode.com/problems/time-based-key-value-store"
  },
  "456": {
    "Name": "132 Pattern",
    "Acceptance": "28.9%",
    "Difficulty": "Medium",
    "Frequency": "0.029306126585499394",
    "Link": " https://leetcode.com/problems/132-pattern"
  },
  "437": {
    "Name": "Path Sum III",
    "Acceptance": "47.2%",
    "Difficulty": "Medium",
    "Frequency": "0.07021412138431063",
    "Link": " https://leetcode.com/problems/path-sum-iii"
  },
  "503": {
    "Name": "Next Greater Element II",
    "Acceptance": "56.5%",
    "Difficulty": "Medium",
    "Frequency": "0.10814330069305735",
    "Link": " https://leetcode.com/problems/next-greater-element-ii"
  },
  "208": {
    "Name": "Implement Trie (Prefix Tree)",
    "Acceptance": "49.4%",
    "Difficulty": "Medium",
    "Frequency": "0.554408039893292",
    "Link": " https://leetcode.com/problems/implement-trie-prefix-tree"
  },
  "97": {
    "Name": "Interleaving String",
    "Acceptance": "31.5%",
    "Difficulty": "Hard",
    "Frequency": "0.22582867117596545",
    "Link": " https://leetcode.com/problems/interleaving-string"
  },
  "1091": {
    "Name": "Shortest Path in Binary Matrix",
    "Acceptance": "38.2%",
    "Difficulty": "Medium",
    "Frequency": "0.03164821095078173",
    "Link": " https://leetcode.com/problems/shortest-path-in-binary-matrix"
  },
  "980": {
    "Name": "Unique Paths III",
    "Acceptance": "73.3%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/unique-paths-iii"
  },
  "277": {
    "Name": "Find the Celebrity",
    "Acceptance": "41.8%",
    "Difficulty": "Medium",
    "Frequency": "0.06562120535847293",
    "Link": " https://leetcode.com/problems/find-the-celebrity"
  },
  "496": {
    "Name": "Next Greater Element I",
    "Acceptance": "63.8%",
    "Difficulty": "Easy",
    "Frequency": "0.029462032730316202",
    "Link": " https://leetcode.com/problems/next-greater-element-i"
  },
  "1044": {
    "Name": "Longest Duplicate Substring",
    "Acceptance": "31.9%",
    "Difficulty": "Hard",
    "Frequency": "0.1351378186727963",
    "Link": " https://leetcode.com/problems/longest-duplicate-substring"
  },
  "323": {
    "Name": "Number of Connected Components in an Undirected Graph",
    "Acceptance": "56.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph"
  },
  "449": {
    "Name": "Serialize and Deserialize BST",
    "Acceptance": "52.0%",
    "Difficulty": "Medium",
    "Frequency": "0.17895898716948455",
    "Link": " https://leetcode.com/problems/serialize-and-deserialize-bst"
  },
  "403": {
    "Name": "Frog Jump",
    "Acceptance": "39.7%",
    "Difficulty": "Hard",
    "Frequency": "0.504766595745896",
    "Link": " https://leetcode.com/problems/frog-jump"
  },
  "1038": {
    "Name": "Binary Search Tree to Greater Sum Tree",
    "Acceptance": "80.8%",
    "Difficulty": "Medium",
    "Frequency": "0.05637058926920947",
    "Link": " https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree"
  },
  "640": {
    "Name": "Solve the Equation",
    "Acceptance": "42.0%",
    "Difficulty": "Medium",
    "Frequency": "0.8389208480491557",
    "Link": " https://leetcode.com/problems/solve-the-equation"
  },
  "895": {
    "Name": "Maximum Frequency Stack",
    "Acceptance": "60.6%",
    "Difficulty": "Hard",
    "Frequency": "0.33520721431462625",
    "Link": " https://leetcode.com/problems/maximum-frequency-stack"
  },
  "165": {
    "Name": "Compare Version Numbers",
    "Acceptance": "27.4%",
    "Difficulty": "Medium",
    "Frequency": "0.09483978737982436",
    "Link": " https://leetcode.com/problems/compare-version-numbers"
  },
  "210": {
    "Name": "Course Schedule II",
    "Acceptance": "40.7%",
    "Difficulty": "Medium",
    "Frequency": "0.007612921575561963",
    "Link": " https://leetcode.com/problems/course-schedule-ii"
  },
  "767": {
    "Name": "Reorganize String",
    "Acceptance": "48.7%",
    "Difficulty": "Medium",
    "Frequency": "0.1940772649823193",
    "Link": " https://leetcode.com/problems/reorganize-string"
  },
  "1219": {
    "Name": "Path with Maximum Gold",
    "Acceptance": "65.1%",
    "Difficulty": "Medium",
    "Frequency": "0.8196365222988566",
    "Link": " https://leetcode.com/problems/path-with-maximum-gold"
  },
  "109": {
    "Name": "Convert Sorted List to Binary Search Tree",
    "Acceptance": "47.7%",
    "Difficulty": "Medium",
    "Frequency": "0.03220314049463475",
    "Link": " https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree"
  },
  "1214": {
    "Name": "Two Sum BSTs",
    "Acceptance": "67.6%",
    "Difficulty": "Medium",
    "Frequency": "0.9540069312030179",
    "Link": " https://leetcode.com/problems/two-sum-bsts"
  },
  "721": {
    "Name": "Accounts Merge",
    "Acceptance": "48.8%",
    "Difficulty": "Medium",
    "Frequency": "0.07349495575336484",
    "Link": " https://leetcode.com/problems/accounts-merge"
  },
  "445": {
    "Name": "Add Two Numbers II",
    "Acceptance": "54.5%",
    "Difficulty": "Medium",
    "Frequency": "0.046331389773728096",
    "Link": " https://leetcode.com/problems/add-two-numbers-ii"
  },
  "317": {
    "Name": "Shortest Distance from All Buildings",
    "Acceptance": "41.4%",
    "Difficulty": "Hard",
    "Frequency": "0.03795522000043556",
    "Link": " https://leetcode.com/problems/shortest-distance-from-all-buildings"
  },
  "634": {
    "Name": "Find the Derangement of An Array",
    "Acceptance": "40.1%",
    "Difficulty": "Medium",
    "Frequency": "1.3910002521573033",
    "Link": " https://leetcode.com/problems/find-the-derangement-of-an-array"
  },
  "289": {
    "Name": "Game of Life",
    "Acceptance": "54.5%",
    "Difficulty": "Medium",
    "Frequency": "0.01662548684613402",
    "Link": " https://leetcode.com/problems/game-of-life"
  },
  "489": {
    "Name": "Robot Room Cleaner",
    "Acceptance": "69.7%",
    "Difficulty": "Hard",
    "Frequency": "0.16758021585734428",
    "Link": " https://leetcode.com/problems/robot-room-cleaner"
  },
  "207": {
    "Name": "Course Schedule",
    "Acceptance": "43.1%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/course-schedule"
  },
  "770": {
    "Name": "Basic Calculator IV",
    "Acceptance": "48.1%",
    "Difficulty": "Hard",
    "Frequency": "1.9937403768488644",
    "Link": " https://leetcode.com/problems/basic-calculator-iv"
  },
  "480": {
    "Name": "Sliding Window Median",
    "Acceptance": "37.2%",
    "Difficulty": "Hard",
    "Frequency": "0.0743529801177063",
    "Link": " https://leetcode.com/problems/sliding-window-median"
  },
  "1429": {
    "Name": "First Unique Number",
    "Acceptance": "47.0%",
    "Difficulty": "Medium",
    "Frequency": "0.6890063878939139",
    "Link": " https://leetcode.com/problems/first-unique-number"
  },
  "103": {
    "Name": "Binary Tree Zigzag Level Order Traversal",
    "Acceptance": "48.3%",
    "Difficulty": "Medium",
    "Frequency": "0.006735449584647053",
    "Link": " https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal"
  },
  "347": {
    "Name": "Top K Frequent Elements",
    "Acceptance": "61.2%",
    "Difficulty": "Medium",
    "Frequency": "0.3398753854298785",
    "Link": " https://leetcode.com/problems/top-k-frequent-elements"
  },
  "1236": {
    "Name": "Web Crawler",
    "Acceptance": "64.3%",
    "Difficulty": "Medium",
    "Frequency": "0.09531017980432487",
    "Link": " https://leetcode.com/problems/web-crawler"
  },
  "388": {
    "Name": "Longest Absolute File Path",
    "Acceptance": "41.8%",
    "Difficulty": "Medium",
    "Frequency": "0.18128582392042256",
    "Link": " https://leetcode.com/problems/longest-absolute-file-path"
  },
  "352": {
    "Name": "Data Stream as Disjoint Intervals",
    "Acceptance": "47.3%",
    "Difficulty": "Hard",
    "Frequency": "1.0728920448077304",
    "Link": " https://leetcode.com/problems/data-stream-as-disjoint-intervals"
  },
  "188": {
    "Name": "Best Time to Buy and Sell Stock IV",
    "Acceptance": "28.0%",
    "Difficulty": "Hard",
    "Frequency": "1.1638791040687415",
    "Link": " https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv"
  },
  "116": {
    "Name": "Populating Next Right Pointers in Each Node",
    "Acceptance": "45.2%",
    "Difficulty": "Medium",
    "Frequency": "0.06417026482702023",
    "Link": " https://leetcode.com/problems/populating-next-right-pointers-in-each-node"
  },
  "1046": {
    "Name": "Last Stone Weight",
    "Acceptance": "62.2%",
    "Difficulty": "Easy",
    "Frequency": "0.9036810503424428",
    "Link": " https://leetcode.com/problems/last-stone-weight"
  },
  "465": {
    "Name": "Optimal Account Balancing",
    "Acceptance": "46.9%",
    "Difficulty": "Hard",
    "Frequency": "2.3937825793600807",
    "Link": " https://leetcode.com/problems/optimal-account-balancing"
  },
  "384": {
    "Name": "Shuffle an Array",
    "Acceptance": "52.8%",
    "Difficulty": "Medium",
    "Frequency": "0.4860774540767966",
    "Link": " https://leetcode.com/problems/shuffle-an-array"
  },
  "564": {
    "Name": "Find the Closest Palindrome",
    "Acceptance": "19.7%",
    "Difficulty": "Hard",
    "Frequency": "1.686299975418363",
    "Link": " https://leetcode.com/problems/find-the-closest-palindrome"
  },
  "737": {
    "Name": "Sentence Similarity II",
    "Acceptance": "45.8%",
    "Difficulty": "Medium",
    "Frequency": "3.5565631284675816",
    "Link": " https://leetcode.com/problems/sentence-similarity-ii"
  },
  "997": {
    "Name": "Find the Town Judge",
    "Acceptance": "50.1%",
    "Difficulty": "Easy",
    "Frequency": "0.06548984513511495",
    "Link": " https://leetcode.com/problems/find-the-town-judge"
  },
  "735": {
    "Name": "Asteroid Collision",
    "Acceptance": "41.0%",
    "Difficulty": "Medium",
    "Frequency": "0.09542395191890234",
    "Link": " https://leetcode.com/problems/asteroid-collision"
  },
  "675": {
    "Name": "Cut Off Trees for Golf Event",
    "Acceptance": "34.6%",
    "Difficulty": "Hard",
    "Frequency": "3.36225540086527",
    "Link": " https://leetcode.com/problems/cut-off-trees-for-golf-event"
  },
  "1011": {
    "Name": "Capacity To Ship Packages Within D Days",
    "Acceptance": "58.1%",
    "Difficulty": "Medium",
    "Frequency": "0.06649420875558125",
    "Link": " https://leetcode.com/problems/capacity-to-ship-packages-within-d-days"
  },
  "1335": {
    "Name": "Minimum Difficulty of a Job Schedule",
    "Acceptance": "57.6%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule"
  },
  "1197": {
    "Name": "Minimum Knight Moves",
    "Acceptance": "36.1%",
    "Difficulty": "Medium",
    "Frequency": "0.06562120535847293",
    "Link": " https://leetcode.com/problems/minimum-knight-moves"
  },
  "688": {
    "Name": "Knight Probability in Chessboard",
    "Acceptance": "48.9%",
    "Difficulty": "Medium",
    "Frequency": "0.6794349186959634",
    "Link": " https://leetcode.com/problems/knight-probability-in-chessboard"
  },
  "1215": {
    "Name": "Stepping Numbers",
    "Acceptance": "41.6%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/stepping-numbers"
  },
  "1057": {
    "Name": "Campus Bikes",
    "Acceptance": "57.7%",
    "Difficulty": "Medium",
    "Frequency": "4.447943228729954",
    "Link": " https://leetcode.com/problems/campus-bikes"
  },
  "75": {
    "Name": "Sort Colors",
    "Acceptance": "47.3%",
    "Difficulty": "Medium",
    "Frequency": "0.26772773680232625",
    "Link": " https://leetcode.com/problems/sort-colors"
  },
  "1279": {
    "Name": "Traffic Light Controlled Intersection",
    "Acceptance": "74.3%",
    "Difficulty": "Easy",
    "Frequency": "1.8726661078408553",
    "Link": " https://leetcode.com/problems/traffic-light-controlled-intersection"
  },
  "556": {
    "Name": "Next Greater Element III",
    "Acceptance": "31.7%",
    "Difficulty": "Medium",
    "Frequency": "0.04679216150675895",
    "Link": " https://leetcode.com/problems/next-greater-element-iii"
  },
  "978": {
    "Name": "Longest Turbulent Subarray",
    "Acceptance": "46.6%",
    "Difficulty": "Medium",
    "Frequency": "0.046737477851689815",
    "Link": " https://leetcode.com/problems/longest-turbulent-subarray"
  },
  "1032": {
    "Name": "Stream of Characters",
    "Acceptance": "48.3%",
    "Difficulty": "Hard",
    "Frequency": "1.9744627782694404",
    "Link": " https://leetcode.com/problems/stream-of-characters"
  },
  "332": {
    "Name": "Reconstruct Itinerary",
    "Acceptance": "36.7%",
    "Difficulty": "Medium",
    "Frequency": "1.0408834009118708",
    "Link": " https://leetcode.com/problems/reconstruct-itinerary"
  },
  "628": {
    "Name": "Maximum Product of Three Numbers",
    "Acceptance": "47.1%",
    "Difficulty": "Easy",
    "Frequency": "0.03681397312271631",
    "Link": " https://leetcode.com/problems/maximum-product-of-three-numbers"
  },
  "1100": {
    "Name": "Find K-Length Substrings With No Repeated Characters",
    "Acceptance": "72.7%",
    "Difficulty": "Medium",
    "Frequency": "1.184336829809077",
    "Link": " https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters"
  },
  "529": {
    "Name": "Minesweeper",
    "Acceptance": "59.1%",
    "Difficulty": "Medium",
    "Frequency": "2.8156219588928013",
    "Link": " https://leetcode.com/problems/minesweeper"
  },
  "1130": {
    "Name": "Minimum Cost Tree From Leaf Values",
    "Acceptance": "66.1%",
    "Difficulty": "Medium",
    "Frequency": "2.445077590079096",
    "Link": " https://leetcode.com/problems/minimum-cost-tree-from-leaf-values"
  },
  "133": {
    "Name": "Clone Graph",
    "Acceptance": "34.8%",
    "Difficulty": "Medium",
    "Frequency": "0.049801168649527466",
    "Link": " https://leetcode.com/problems/clone-graph"
  },
  "333": {
    "Name": "Largest BST Subtree",
    "Acceptance": "35.8%",
    "Difficulty": "Medium",
    "Frequency": "0.44572532239455054",
    "Link": " https://leetcode.com/problems/largest-bst-subtree"
  },
  "794": {
    "Name": "Valid Tic-Tac-Toe State",
    "Acceptance": "32.6%",
    "Difficulty": "Medium",
    "Frequency": "0.0922312242160336",
    "Link": " https://leetcode.com/problems/valid-tic-tac-toe-state"
  },
  "518": {
    "Name": "Coin Change 2",
    "Acceptance": "50.2%",
    "Difficulty": "Medium",
    "Frequency": "0.07182868392350407",
    "Link": " https://leetcode.com/problems/coin-change-2"
  },
  "901": {
    "Name": "Online Stock Span",
    "Acceptance": "60.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/online-stock-span"
  },
  "135": {
    "Name": "Candy",
    "Acceptance": "31.6%",
    "Difficulty": "Hard",
    "Frequency": "0.17296269248039503",
    "Link": " https://leetcode.com/problems/candy"
  },
  "854": {
    "Name": "K-Similar Strings",
    "Acceptance": "38.2%",
    "Difficulty": "Hard",
    "Frequency": "0.5809557039657982",
    "Link": " https://leetcode.com/problems/k-similar-strings"
  },
  "1244": {
    "Name": "Design A Leaderboard",
    "Acceptance": "60.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/design-a-leaderboard"
  },
  "1229": {
    "Name": "Meeting Scheduler",
    "Acceptance": "52.7%",
    "Difficulty": "Medium",
    "Frequency": "0.053560323833736816",
    "Link": " https://leetcode.com/problems/meeting-scheduler"
  },
  "134": {
    "Name": "Gas Station",
    "Acceptance": "38.5%",
    "Difficulty": "Medium",
    "Frequency": "0.030183377823098576",
    "Link": " https://leetcode.com/problems/gas-station"
  },
  "1031": {
    "Name": "Maximum Sum of Two Non-Overlapping Subarrays",
    "Acceptance": "57.9%",
    "Difficulty": "Medium",
    "Frequency": "0.03711000965123125",
    "Link": " https://leetcode.com/problems/maximum-sum-of-two-non-overlapping-subarrays"
  },
  "1275": {
    "Name": "Find Winner on a Tic Tac Toe Game",
    "Acceptance": "52.8%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game"
  },
  "261": {
    "Name": "Graph Valid Tree",
    "Acceptance": "42.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/graph-valid-tree"
  },
  "417": {
    "Name": "Pacific Atlantic Water Flow",
    "Acceptance": "41.1%",
    "Difficulty": "Medium",
    "Frequency": "0.10008345855698253",
    "Link": " https://leetcode.com/problems/pacific-atlantic-water-flow"
  },
  "410": {
    "Name": "Split Array Largest Sum",
    "Acceptance": "44.5%",
    "Difficulty": "Hard",
    "Frequency": "4.009588512914069",
    "Link": " https://leetcode.com/problems/split-array-largest-sum"
  },
  "1172": {
    "Name": "Dinner Plate Stacks",
    "Acceptance": "38.2%",
    "Difficulty": "Hard",
    "Frequency": "0.2711095169699942",
    "Link": " https://leetcode.com/problems/dinner-plate-stacks"
  },
  "1120": {
    "Name": "Maximum Average Subtree",
    "Acceptance": "61.9%",
    "Difficulty": "Medium",
    "Frequency": "0.2694761079552085",
    "Link": " https://leetcode.com/problems/maximum-average-subtree"
  },
  "409": {
    "Name": "Longest Palindrome",
    "Acceptance": "50.3%",
    "Difficulty": "Easy",
    "Frequency": "0.1461170580676051",
    "Link": " https://leetcode.com/problems/longest-palindrome"
  },
  "426": {
    "Name": "Convert Binary Search Tree to Sorted Doubly Linked List",
    "Acceptance": "59.1%",
    "Difficulty": "Medium",
    "Frequency": "0.05368014946362379",
    "Link": " https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list"
  },
  "1139": {
    "Name": "Largest 1-Bordered Square",
    "Acceptance": "47.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/largest-1-bordered-square"
  },
  "632": {
    "Name": "Smallest Range Covering Elements from K Lists",
    "Acceptance": "52.4%",
    "Difficulty": "Hard",
    "Frequency": "0.15283920422944758",
    "Link": " https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists"
  },
  "466": {
    "Name": "Count The Repetitions",
    "Acceptance": "28.2%",
    "Difficulty": "Hard",
    "Frequency": "0.2561688067457042",
    "Link": " https://leetcode.com/problems/count-the-repetitions"
  },
  "286": {
    "Name": "Walls and Gates",
    "Acceptance": "54.5%",
    "Difficulty": "Medium",
    "Frequency": "1.1385638280265375",
    "Link": " https://leetcode.com/problems/walls-and-gates"
  },
  "187": {
    "Name": "Repeated DNA Sequences",
    "Acceptance": "38.9%",
    "Difficulty": "Medium",
    "Frequency": "0.18218832116655082",
    "Link": " https://leetcode.com/problems/repeated-dna-sequences"
  },
  "1066": {
    "Name": "Campus Bikes II",
    "Acceptance": "54.2%",
    "Difficulty": "Medium",
    "Frequency": "2.7658351992240013",
    "Link": " https://leetcode.com/problems/campus-bikes-ii"
  },
  "153": {
    "Name": "Find Minimum in Rotated Sorted Array",
    "Acceptance": "45.1%",
    "Difficulty": "Medium",
    "Frequency": "0.014939586916186732",
    "Link": " https://leetcode.com/problems/find-minimum-in-rotated-sorted-array"
  },
  "775": {
    "Name": "Global and Local Inversions",
    "Acceptance": "42.1%",
    "Difficulty": "Medium",
    "Frequency": "0.6030598245224211",
    "Link": " https://leetcode.com/problems/global-and-local-inversions"
  },
  "120": {
    "Name": "Triangle",
    "Acceptance": "44.2%",
    "Difficulty": "Medium",
    "Frequency": "0.23887525258068545",
    "Link": " https://leetcode.com/problems/triangle"
  },
  "296": {
    "Name": "Best Meeting Point",
    "Acceptance": "57.5%",
    "Difficulty": "Hard",
    "Frequency": "1.6625988978022896",
    "Link": " https://leetcode.com/problems/best-meeting-point"
  },
  "1188": {
    "Name": "Design Bounded Blocking Queue",
    "Acceptance": "70.5%",
    "Difficulty": "Medium",
    "Frequency": "0.3828597229337993",
    "Link": " https://leetcode.com/problems/design-bounded-blocking-queue"
  },
  "1094": {
    "Name": "Car Pooling",
    "Acceptance": "56.7%",
    "Difficulty": "Medium",
    "Frequency": "0.04016604172533471",
    "Link": " https://leetcode.com/problems/car-pooling"
  },
  "682": {
    "Name": "Baseball Game",
    "Acceptance": "63.7%",
    "Difficulty": "Easy",
    "Frequency": "0.0851175150048191",
    "Link": " https://leetcode.com/problems/baseball-game"
  },
  "1122": {
    "Name": "Relative Sort Array",
    "Acceptance": "67.7%",
    "Difficulty": "Easy",
    "Frequency": "0.019685675071030327",
    "Link": " https://leetcode.com/problems/relative-sort-array"
  },
  "939": {
    "Name": "Minimum Area Rectangle",
    "Acceptance": "51.8%",
    "Difficulty": "Medium",
    "Frequency": "0.03802739558923925",
    "Link": " https://leetcode.com/problems/minimum-area-rectangle"
  },
  "373": {
    "Name": "Find K Pairs with Smallest Sums",
    "Acceptance": "36.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-k-pairs-with-smallest-sums"
  },
  "442": {
    "Name": "Find All Duplicates in an Array",
    "Acceptance": "67.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-all-duplicates-in-an-array"
  },
  "356": {
    "Name": "Line Reflection",
    "Acceptance": "31.8%",
    "Difficulty": "Medium",
    "Frequency": "1.1410897169352259",
    "Link": " https://leetcode.com/problems/line-reflection"
  },
  "1135": {
    "Name": "Connecting Cities With Minimum Cost",
    "Acceptance": "57.5%",
    "Difficulty": "Medium",
    "Frequency": "0.8224378230678087",
    "Link": " https://leetcode.com/problems/connecting-cities-with-minimum-cost"
  },
  "117": {
    "Name": "Populating Next Right Pointers in Each Node II",
    "Acceptance": "39.1%",
    "Difficulty": "Medium",
    "Frequency": "0.011389644764357807",
    "Link": " https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii"
  },
  "123": {
    "Name": "Best Time to Buy and Sell Stock III",
    "Acceptance": "37.5%",
    "Difficulty": "Hard",
    "Frequency": "0.8103008499673461",
    "Link": " https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii"
  },
  "1004": {
    "Name": "Max Consecutive Ones III",
    "Acceptance": "59.1%",
    "Difficulty": "Medium",
    "Frequency": "0.14885037047435706",
    "Link": " https://leetcode.com/problems/max-consecutive-ones-iii"
  },
  "179": {
    "Name": "Largest Number",
    "Acceptance": "28.8%",
    "Difficulty": "Medium",
    "Frequency": "0.07393612143915611",
    "Link": " https://leetcode.com/problems/largest-number"
  },
  "542": {
    "Name": "01 Matrix",
    "Acceptance": "39.8%",
    "Difficulty": "Medium",
    "Frequency": "0.3127505293143989",
    "Link": " https://leetcode.com/problems/01-matrix"
  },
  "1143": {
    "Name": "Longest Common Subsequence",
    "Acceptance": "58.4%",
    "Difficulty": "Medium",
    "Frequency": "0.019772173115579716",
    "Link": " https://leetcode.com/problems/longest-common-subsequence"
  },
  "63": {
    "Name": "Unique Paths II",
    "Acceptance": "34.6%",
    "Difficulty": "Medium",
    "Frequency": "0.01949801804099658",
    "Link": " https://leetcode.com/problems/unique-paths-ii"
  },
  "690": {
    "Name": "Employee Importance",
    "Acceptance": "57.3%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/employee-importance"
  },
  "1315": {
    "Name": "Sum of Nodes with Even-Valued Grandparent",
    "Acceptance": "83.5%",
    "Difficulty": "Medium",
    "Frequency": "0.05317259535592034",
    "Link": " https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent"
  },
  "1360": {
    "Name": "Number of Days Between Two Dates",
    "Acceptance": "48.8%",
    "Difficulty": "Easy",
    "Frequency": "0.03401688527825427",
    "Link": " https://leetcode.com/problems/number-of-days-between-two-dates"
  },
  "272": {
    "Name": "Closest Binary Search Tree Value II",
    "Acceptance": "50.5%",
    "Difficulty": "Hard",
    "Frequency": "4.69866052907543",
    "Link": " https://leetcode.com/problems/closest-binary-search-tree-value-ii"
  },
  "1198": {
    "Name": "Find Smallest Common Element in All Rows",
    "Acceptance": "74.9%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-smallest-common-element-in-all-rows"
  },
  "438": {
    "Name": "Find All Anagrams in a String",
    "Acceptance": "43.3%",
    "Difficulty": "Medium",
    "Frequency": "0.18564799141482685",
    "Link": " https://leetcode.com/problems/find-all-anagrams-in-a-string"
  },
  "262": {
    "Name": "Trips and Users",
    "Acceptance": "32.7%",
    "Difficulty": "Hard",
    "Frequency": "2.179117086708829",
    "Link": " https://leetcode.com/problems/trips-and-users"
  },
  "473": {
    "Name": "Matchsticks to Square",
    "Acceptance": "37.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/matchsticks-to-square"
  },
  "698": {
    "Name": "Partition to K Equal Sum Subsets",
    "Acceptance": "45.0%",
    "Difficulty": "Medium",
    "Frequency": "0.04685917114094188",
    "Link": " https://leetcode.com/problems/partition-to-k-equal-sum-subsets"
  },
  "701": {
    "Name": "Insert into a Binary Search Tree",
    "Acceptance": "77.7%",
    "Difficulty": "Medium",
    "Frequency": "0.22337817376865485",
    "Link": " https://leetcode.com/problems/insert-into-a-binary-search-tree"
  },
  "636": {
    "Name": "Exclusive Time of Functions",
    "Acceptance": "51.9%",
    "Difficulty": "Medium",
    "Frequency": "1.070608304685468",
    "Link": " https://leetcode.com/problems/exclusive-time-of-functions"
  },
  "453": {
    "Name": "Minimum Moves to Equal Array Elements",
    "Acceptance": "50.2%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-moves-to-equal-array-elements"
  },
  "419": {
    "Name": "Battleships in a Board",
    "Acceptance": "70.0%",
    "Difficulty": "Medium",
    "Frequency": "2.2726225948204313",
    "Link": " https://leetcode.com/problems/battleships-in-a-board"
  },
  "1430": {
    "Name": "Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree",
    "Acceptance": "44.8%",
    "Difficulty": "Medium",
    "Frequency": "0.16917873135476025",
    "Link": " https://leetcode.com/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"
  },
  "805": {
    "Name": "Split Array With Same Average",
    "Acceptance": "26.4%",
    "Difficulty": "Hard",
    "Frequency": "0.3416302106614813",
    "Link": " https://leetcode.com/problems/split-array-with-same-average"
  },
  "963": {
    "Name": "Minimum Area Rectangle II",
    "Acceptance": "50.9%",
    "Difficulty": "Medium",
    "Frequency": "2.1572192427225203",
    "Link": " https://leetcode.com/problems/minimum-area-rectangle-ii"
  },
  "785": {
    "Name": "Is Graph Bipartite?",
    "Acceptance": "47.5%",
    "Difficulty": "Medium",
    "Frequency": "0.09684982598991766",
    "Link": " https://leetcode.com/problems/is-graph-bipartite"
  },
  "301": {
    "Name": "Remove Invalid Parentheses",
    "Acceptance": "43.3%",
    "Difficulty": "Hard",
    "Frequency": "0.4217256289799447",
    "Link": " https://leetcode.com/problems/remove-invalid-parentheses"
  },
  "715": {
    "Name": "Range Module",
    "Acceptance": "38.5%",
    "Difficulty": "Hard",
    "Frequency": "0.1636294237818021",
    "Link": " https://leetcode.com/problems/range-module"
  },
  "881": {
    "Name": "Boats to Save People",
    "Acceptance": "46.8%",
    "Difficulty": "Medium",
    "Frequency": "0.09450889771017068",
    "Link": " https://leetcode.com/problems/boats-to-save-people"
  },
  "242": {
    "Name": "Valid Anagram",
    "Acceptance": "56.9%",
    "Difficulty": "Easy",
    "Frequency": "0.025684584297773504",
    "Link": " https://leetcode.com/problems/valid-anagram"
  },
  "653": {
    "Name": "Two Sum IV - Input is a BST",
    "Acceptance": "55.5%",
    "Difficulty": "Easy",
    "Frequency": "0.055724721838100025",
    "Link": " https://leetcode.com/problems/two-sum-iv-input-is-a-bst"
  },
  "540": {
    "Name": "Single Element in a Sorted Array",
    "Acceptance": "57.9%",
    "Difficulty": "Medium",
    "Frequency": "0.042721256704769804",
    "Link": " https://leetcode.com/problems/single-element-in-a-sorted-array"
  },
  "716": {
    "Name": "Max Stack",
    "Acceptance": "42.6%",
    "Difficulty": "Easy",
    "Frequency": "0.042695919196489414",
    "Link": " https://leetcode.com/problems/max-stack"
  },
  "150": {
    "Name": "Evaluate Reverse Polish Notation",
    "Acceptance": "36.3%",
    "Difficulty": "Medium",
    "Frequency": "0.01355493475171521",
    "Link": " https://leetcode.com/problems/evaluate-reverse-polish-notation"
  },
  "611": {
    "Name": "Valid Triangle Number",
    "Acceptance": "48.4%",
    "Difficulty": "Medium",
    "Frequency": "0.04255961441879593",
    "Link": " https://leetcode.com/problems/valid-triangle-number"
  },
  "1373": {
    "Name": "Maximum Sum BST in Binary Tree",
    "Acceptance": "40.2%",
    "Difficulty": "Hard",
    "Frequency": "0.39318708633975535",
    "Link": " https://leetcode.com/problems/maximum-sum-bst-in-binary-tree"
  },
  "335": {
    "Name": "Self Crossing",
    "Acceptance": "28.0%",
    "Difficulty": "Hard",
    "Frequency": "0.921320080279157",
    "Link": " https://leetcode.com/problems/self-crossing"
  },
  "1074": {
    "Name": "Number of Submatrices That Sum to Target",
    "Acceptance": "60.4%",
    "Difficulty": "Hard",
    "Frequency": "1.5295796895872102",
    "Link": " https://leetcode.com/problems/number-of-submatrices-that-sum-to-target"
  },
  "1084": {
    "Name": "Sales Analysis III",
    "Acceptance": "54.3%",
    "Difficulty": "Easy",
    "Frequency": "0.37640587636823386",
    "Link": " https://leetcode.com/problems/sales-analysis-iii"
  },
  "1242": {
    "Name": "Web Crawler Multithreaded",
    "Acceptance": "45.9%",
    "Difficulty": "Medium",
    "Frequency": "0.30961714931803663",
    "Link": " https://leetcode.com/problems/web-crawler-multithreaded"
  },
  "538": {
    "Name": "Convert BST to Greater Tree",
    "Acceptance": "55.4%",
    "Difficulty": "Easy",
    "Frequency": "1.7154361234077207",
    "Link": " https://leetcode.com/problems/convert-bst-to-greater-tree"
  },
  "270": {
    "Name": "Closest Binary Search Tree Value",
    "Acceptance": "48.5%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/closest-binary-search-tree-value"
  },
  "310": {
    "Name": "Minimum Height Trees",
    "Acceptance": "32.3%",
    "Difficulty": "Medium",
    "Frequency": "0.05423015406086025",
    "Link": " https://leetcode.com/problems/minimum-height-trees"
  },
  "1083": {
    "Name": "Sales Analysis II",
    "Acceptance": "50.5%",
    "Difficulty": "Easy",
    "Frequency": "0.7337661087783554",
    "Link": " https://leetcode.com/problems/sales-analysis-ii"
  },
  "354": {
    "Name": "Russian Doll Envelopes",
    "Acceptance": "35.6%",
    "Difficulty": "Hard",
    "Frequency": "0.2883782089226364",
    "Link": " https://leetcode.com/problems/russian-doll-envelopes"
  },
  "130": {
    "Name": "Surrounded Regions",
    "Acceptance": "28.1%",
    "Difficulty": "Medium",
    "Frequency": "0.41116654890890914",
    "Link": " https://leetcode.com/problems/surrounded-regions"
  },
  "349": {
    "Name": "Intersection of Two Arrays",
    "Acceptance": "62.5%",
    "Difficulty": "Easy",
    "Frequency": "0.016239981598488416",
    "Link": " https://leetcode.com/problems/intersection-of-two-arrays"
  },
  "1161": {
    "Name": "Maximum Level Sum of a Binary Tree",
    "Acceptance": "72.2%",
    "Difficulty": "Medium",
    "Frequency": "0.19218058535585741",
    "Link": " https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree"
  },
  "340": {
    "Name": "Longest Substring with At Most K Distinct Characters",
    "Acceptance": "44.1%",
    "Difficulty": "Hard",
    "Frequency": "0.016122880486563188",
    "Link": " https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters"
  },
  "427": {
    "Name": "Construct Quad Tree",
    "Acceptance": "61.4%",
    "Difficulty": "Medium",
    "Frequency": "3.2025777670666282",
    "Link": " https://leetcode.com/problems/construct-quad-tree"
  },
  "1405": {
    "Name": "Longest Happy String",
    "Acceptance": "49.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/longest-happy-string"
  },
  "732": {
    "Name": "My Calendar III",
    "Acceptance": "60.0%",
    "Difficulty": "Hard",
    "Frequency": "0.8286926725561692",
    "Link": " https://leetcode.com/problems/my-calendar-iii"
  },
  "86": {
    "Name": "Partition List",
    "Acceptance": "41.5%",
    "Difficulty": "Medium",
    "Frequency": "0.7022543510090344",
    "Link": " https://leetcode.com/problems/partition-list"
  },
  "1007": {
    "Name": "Minimum Domino Rotations For Equal Row",
    "Acceptance": "50.0%",
    "Difficulty": "Medium",
    "Frequency": "5.347574519736722",
    "Link": " https://leetcode.com/problems/minimum-domino-rotations-for-equal-row"
  },
  "307": {
    "Name": "Range Sum Query - Mutable",
    "Acceptance": "34.6%",
    "Difficulty": "Medium",
    "Frequency": "0.30730282294419214",
    "Link": " https://leetcode.com/problems/range-sum-query-mutable"
  },
  "1117": {
    "Name": "Building H2O",
    "Acceptance": "52.6%",
    "Difficulty": "Medium",
    "Frequency": "0.9829600869737358",
    "Link": " https://leetcode.com/problems/building-h2o"
  },
  "528": {
    "Name": "Random Pick with Weight",
    "Acceptance": "43.9%",
    "Difficulty": "Medium",
    "Frequency": "0.31740043778091953",
    "Link": " https://leetcode.com/problems/random-pick-with-weight"
  },
  "873": {
    "Name": "Length of Longest Fibonacci Subsequence",
    "Acceptance": "48.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/length-of-longest-fibonacci-subsequence"
  },
  "844": {
    "Name": "Backspace String Compare",
    "Acceptance": "46.4%",
    "Difficulty": "Easy",
    "Frequency": "0.0235551325028849",
    "Link": " https://leetcode.com/problems/backspace-string-compare"
  },
  "1375": {
    "Name": "Bulb Switcher III",
    "Acceptance": "62.6%",
    "Difficulty": "Medium",
    "Frequency": "0.29173887314739533",
    "Link": " https://leetcode.com/problems/bulb-switcher-iii"
  },
  "339": {
    "Name": "Nested List Weight Sum",
    "Acceptance": "74.0%",
    "Difficulty": "Easy",
    "Frequency": "0.02960986116720276",
    "Link": " https://leetcode.com/problems/nested-list-weight-sum"
  },
  "451": {
    "Name": "Sort Characters By Frequency",
    "Acceptance": "63.0%",
    "Difficulty": "Medium",
    "Frequency": "0.285942725510602",
    "Link": " https://leetcode.com/problems/sort-characters-by-frequency"
  },
  "1008": {
    "Name": "Construct Binary Search Tree from Preorder Traversal",
    "Acceptance": "78.4%",
    "Difficulty": "Medium",
    "Frequency": "0.04102671995624437",
    "Link": " https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal"
  },
  "321": {
    "Name": "Create Maximum Number",
    "Acceptance": "27.0%",
    "Difficulty": "Hard",
    "Frequency": "0.538996500732687",
    "Link": " https://leetcode.com/problems/create-maximum-number"
  },
  "509": {
    "Name": "Fibonacci Number",
    "Acceptance": "67.2%",
    "Difficulty": "Easy",
    "Frequency": "0.015283027980177014",
    "Link": " https://leetcode.com/problems/fibonacci-number"
  },
  "969": {
    "Name": "Pancake Sorting",
    "Acceptance": "67.5%",
    "Difficulty": "Medium",
    "Frequency": "0.27343004974457946",
    "Link": " https://leetcode.com/problems/pancake-sorting"
  },
  "966": {
    "Name": "Vowel Spellchecker",
    "Acceptance": "47.2%",
    "Difficulty": "Medium",
    "Frequency": "1.030624947683177",
    "Link": " https://leetcode.com/problems/vowel-spellchecker"
  },
  "1153": {
    "Name": "String Transforms Into Another String",
    "Acceptance": "35.8%",
    "Difficulty": "Hard",
    "Frequency": "3.3908912382416454",
    "Link": " https://leetcode.com/problems/string-transforms-into-another-string"
  },
  "498": {
    "Name": "Diagonal Traverse",
    "Acceptance": "48.2%",
    "Difficulty": "Medium",
    "Frequency": "0.15320415822322747",
    "Link": " https://leetcode.com/problems/diagonal-traverse"
  },
  "407": {
    "Name": "Trapping Rain Water II",
    "Acceptance": "42.4%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/trapping-rain-water-ii"
  },
  "1013": {
    "Name": "Partition Array Into Three Parts With Equal Sum",
    "Acceptance": "51.8%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum"
  },
  "986": {
    "Name": "Interval List Intersections",
    "Acceptance": "67.3%",
    "Difficulty": "Medium",
    "Frequency": "1.7189319563632988",
    "Link": " https://leetcode.com/problems/interval-list-intersections"
  },
  "337": {
    "Name": "House Robber III",
    "Acceptance": "50.6%",
    "Difficulty": "Medium",
    "Frequency": "0.10284435451079782",
    "Link": " https://leetcode.com/problems/house-robber-iii"
  },
  "264": {
    "Name": "Ugly Number II",
    "Acceptance": "42.0%",
    "Difficulty": "Medium",
    "Frequency": "0.025923110599373623",
    "Link": " https://leetcode.com/problems/ugly-number-ii"
  },
  "1162": {
    "Name": "As Far from Land as Possible",
    "Acceptance": "43.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/as-far-from-land-as-possible"
  },
  "1202": {
    "Name": "Smallest String With Swaps",
    "Acceptance": "46.5%",
    "Difficulty": "Medium",
    "Frequency": "0.09740053011838201",
    "Link": " https://leetcode.com/problems/smallest-string-with-swaps"
  },
  "849": {
    "Name": "Maximize Distance to Closest Person",
    "Acceptance": "42.6%",
    "Difficulty": "Easy",
    "Frequency": "2.70914942752668",
    "Link": " https://leetcode.com/problems/maximize-distance-to-closest-person"
  },
  "390": {
    "Name": "Elimination Game",
    "Acceptance": "44.5%",
    "Difficulty": "Medium",
    "Frequency": "0.0922312242160336",
    "Link": " https://leetcode.com/problems/elimination-game"
  },
  "579": {
    "Name": "Find Cumulative Salary of an Employee",
    "Acceptance": "37.0%",
    "Difficulty": "Hard",
    "Frequency": "0.3371880562652357",
    "Link": " https://leetcode.com/problems/find-cumulative-salary-of-an-employee"
  },
  "983": {
    "Name": "Minimum Cost For Tickets",
    "Acceptance": "60.5%",
    "Difficulty": "Medium",
    "Frequency": "0.05469163590186561",
    "Link": " https://leetcode.com/problems/minimum-cost-for-tickets"
  },
  "233": {
    "Name": "Number of Digit One",
    "Acceptance": "31.3%",
    "Difficulty": "Hard",
    "Frequency": "0.3343430661930074",
    "Link": " https://leetcode.com/problems/number-of-digit-one"
  },
  "463": {
    "Name": "Island Perimeter",
    "Acceptance": "65.7%",
    "Difficulty": "Easy",
    "Frequency": "0.20102047685235075",
    "Link": " https://leetcode.com/problems/island-perimeter"
  },
  "132": {
    "Name": "Palindrome Partitioning II",
    "Acceptance": "30.2%",
    "Difficulty": "Hard",
    "Frequency": "1.0250591631135415",
    "Link": " https://leetcode.com/problems/palindrome-partitioning-ii"
  },
  "827": {
    "Name": "Making A Large Island",
    "Acceptance": "45.7%",
    "Difficulty": "Hard",
    "Frequency": "0.09287412500644375",
    "Link": " https://leetcode.com/problems/making-a-large-island"
  },
  "1062": {
    "Name": "Longest Repeating Substring",
    "Acceptance": "57.2%",
    "Difficulty": "Medium",
    "Frequency": "0.32609152056665214",
    "Link": " https://leetcode.com/problems/longest-repeating-substring"
  },
  "430": {
    "Name": "Flatten a Multilevel Doubly Linked List",
    "Acceptance": "55.1%",
    "Difficulty": "Medium",
    "Frequency": "0.12213316890521433",
    "Link": " https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list"
  },
  "252": {
    "Name": "Meeting Rooms",
    "Acceptance": "54.6%",
    "Difficulty": "Easy",
    "Frequency": "1.0686699320530313",
    "Link": " https://leetcode.com/problems/meeting-rooms"
  },
  "516": {
    "Name": "Longest Palindromic Subsequence",
    "Acceptance": "53.2%",
    "Difficulty": "Medium",
    "Frequency": "0.014931221774984842",
    "Link": " https://leetcode.com/problems/longest-palindromic-subsequence"
  },
  "243": {
    "Name": "Shortest Word Distance",
    "Acceptance": "61.0%",
    "Difficulty": "Easy",
    "Frequency": "0.08952296190665864",
    "Link": " https://leetcode.com/problems/shortest-word-distance"
  },
  "652": {
    "Name": "Find Duplicate Subtrees",
    "Acceptance": "50.2%",
    "Difficulty": "Medium",
    "Frequency": "0.23015822831359434",
    "Link": " https://leetcode.com/problems/find-duplicate-subtrees"
  },
  "285": {
    "Name": "Inorder Successor in BST",
    "Acceptance": "40.4%",
    "Difficulty": "Medium",
    "Frequency": "0.021266085846178402",
    "Link": " https://leetcode.com/problems/inorder-successor-in-bst"
  },
  "1247": {
    "Name": "Minimum Swaps to Make Strings Equal",
    "Acceptance": "60.1%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-swaps-to-make-strings-equal"
  },
  "916": {
    "Name": "Word Subsets",
    "Acceptance": "47.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/word-subsets"
  },
  "1019": {
    "Name": "Next Greater Node In Linked List",
    "Acceptance": "57.4%",
    "Difficulty": "Medium",
    "Frequency": "0.04795804429616222",
    "Link": " https://leetcode.com/problems/next-greater-node-in-linked-list"
  },
  "1245": {
    "Name": "Tree Diameter",
    "Acceptance": "60.1%",
    "Difficulty": "Medium",
    "Frequency": "0.08338160893905106",
    "Link": " https://leetcode.com/problems/tree-diameter"
  },
  "359": {
    "Name": "Logger Rate Limiter",
    "Acceptance": "70.8%",
    "Difficulty": "Easy",
    "Frequency": "1.4642891467178614",
    "Link": " https://leetcode.com/problems/logger-rate-limiter"
  },
  "581": {
    "Name": "Shortest Unsorted Continuous Subarray",
    "Acceptance": "31.1%",
    "Difficulty": "Easy",
    "Frequency": "0.013342426083839913",
    "Link": " https://leetcode.com/problems/shortest-unsorted-continuous-subarray"
  },
  "350": {
    "Name": "Intersection of Two Arrays II",
    "Acceptance": "51.4%",
    "Difficulty": "Easy",
    "Frequency": "0.011188580169130736",
    "Link": " https://leetcode.com/problems/intersection-of-two-arrays-ii"
  },
  "729": {
    "Name": "My Calendar I",
    "Acceptance": "51.8%",
    "Difficulty": "Medium",
    "Frequency": "0.036433902246102004",
    "Link": " https://leetcode.com/problems/my-calendar-i"
  },
  "1249": {
    "Name": "Minimum Remove to Make Valid Parentheses",
    "Acceptance": "62.5%",
    "Difficulty": "Medium",
    "Frequency": "0.009195467093100304",
    "Link": " https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses"
  },
  "161": {
    "Name": "One Edit Distance",
    "Acceptance": "32.3%",
    "Difficulty": "Medium",
    "Frequency": "0.28698931177288023",
    "Link": " https://leetcode.com/problems/one-edit-distance"
  },
  "1047": {
    "Name": "Remove All Adjacent Duplicates In String",
    "Acceptance": "68.6%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string"
  },
  "69": {
    "Name": "Sqrt(x)",
    "Acceptance": "33.9%",
    "Difficulty": "Easy",
    "Frequency": "0.010949014489670414",
    "Link": " https://leetcode.com/problems/sqrtx"
  },
  "1254": {
    "Name": "Number of Closed Islands",
    "Acceptance": "60.5%",
    "Difficulty": "Medium",
    "Frequency": "0.20312468442371787",
    "Link": " https://leetcode.com/problems/number-of-closed-islands"
  },
  "1104": {
    "Name": "Path In Zigzag Labelled Binary Tree",
    "Acceptance": "72.0%",
    "Difficulty": "Medium",
    "Frequency": "0.07786032177227234",
    "Link": " https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree"
  },
  "1024": {
    "Name": "Video Stitching",
    "Acceptance": "49.2%",
    "Difficulty": "Medium",
    "Frequency": "0.8252998676956634",
    "Link": " https://leetcode.com/problems/video-stitching"
  },
  "129": {
    "Name": "Sum Root to Leaf Numbers",
    "Acceptance": "49.1%",
    "Difficulty": "Medium",
    "Frequency": "0.27802016154004405",
    "Link": " https://leetcode.com/problems/sum-root-to-leaf-numbers"
  },
  "852": {
    "Name": "Peak Index in a Mountain Array",
    "Acceptance": "71.6%",
    "Difficulty": "Easy",
    "Frequency": "0.012618463959211509",
    "Link": " https://leetcode.com/problems/peak-index-in-a-mountain-array"
  },
  "468": {
    "Name": "Validate IP Address",
    "Acceptance": "24.1%",
    "Difficulty": "Medium",
    "Frequency": "0.07598590697792203",
    "Link": " https://leetcode.com/problems/validate-ip-address"
  },
  "183": {
    "Name": "Customers Who Never Order",
    "Acceptance": "53.4%",
    "Difficulty": "Easy",
    "Frequency": "0.4236099358143671",
    "Link": " https://leetcode.com/problems/customers-who-never-order"
  },
  "515": {
    "Name": "Find Largest Value in Each Tree Row",
    "Acceptance": "61.1%",
    "Difficulty": "Medium",
    "Frequency": "0.11375888535665801",
    "Link": " https://leetcode.com/problems/find-largest-value-in-each-tree-row"
  },
  "974": {
    "Name": "Subarray Sums Divisible by K",
    "Acceptance": "48.9%",
    "Difficulty": "Medium",
    "Frequency": "0.03213127818279325",
    "Link": " https://leetcode.com/problems/subarray-sums-divisible-by-k"
  },
  "1022": {
    "Name": "Sum of Root To Leaf Binary Numbers",
    "Acceptance": "67.2%",
    "Difficulty": "Easy",
    "Frequency": "0.6177234187427034",
    "Link": " https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers"
  },
  "209": {
    "Name": "Minimum Size Subarray Sum",
    "Acceptance": "38.2%",
    "Difficulty": "Medium",
    "Frequency": "0.033239453928687726",
    "Link": " https://leetcode.com/problems/minimum-size-subarray-sum"
  },
  "184": {
    "Name": "Department Highest Salary",
    "Acceptance": "36.7%",
    "Difficulty": "Medium",
    "Frequency": "0.018018505502678313",
    "Link": " https://leetcode.com/problems/department-highest-salary"
  },
  "539": {
    "Name": "Minimum Time Difference",
    "Acceptance": "51.5%",
    "Difficulty": "Medium",
    "Frequency": "4.5282542854816565",
    "Link": " https://leetcode.com/problems/minimum-time-difference"
  },
  "860": {
    "Name": "Lemonade Change",
    "Acceptance": "51.6%",
    "Difficulty": "Easy",
    "Frequency": "0.3967602828188025",
    "Link": " https://leetcode.com/problems/lemonade-change"
  },
  "351": {
    "Name": "Android Unlock Patterns",
    "Acceptance": "48.4%",
    "Difficulty": "Medium",
    "Frequency": "0.7857399673877702",
    "Link": " https://leetcode.com/problems/android-unlock-patterns"
  },
  "523": {
    "Name": "Continuous Subarray Sum",
    "Acceptance": "24.6%",
    "Difficulty": "Medium",
    "Frequency": "0.011293174793455513",
    "Link": " https://leetcode.com/problems/continuous-subarray-sum"
  },
  "570": {
    "Name": "Managers with at Least 5 Direct Reports",
    "Acceptance": "66.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/managers-with-at-least-5-direct-reports"
  },
  "1146": {
    "Name": "Snapshot Array",
    "Acceptance": "37.0%",
    "Difficulty": "Medium",
    "Frequency": "0.0317991816929387",
    "Link": " https://leetcode.com/problems/snapshot-array"
  },
  "228": {
    "Name": "Summary Ranges",
    "Acceptance": "39.5%",
    "Difficulty": "Medium",
    "Frequency": "0.44217848445366176",
    "Link": " https://leetcode.com/problems/summary-ranges"
  },
  "90": {
    "Name": "Subsets II",
    "Acceptance": "47.1%",
    "Difficulty": "Medium",
    "Frequency": "0.09830555874512009",
    "Link": " https://leetcode.com/problems/subsets-ii"
  },
  "432": {
    "Name": "All O`one Data Structure",
    "Acceptance": "32.4%",
    "Difficulty": "Hard",
    "Frequency": "0.25091823176225275",
    "Link": " https://leetcode.com/problems/all-oone-data-structure"
  },
  "284": {
    "Name": "Peeking Iterator",
    "Acceptance": "45.7%",
    "Difficulty": "Medium",
    "Frequency": "0.11490387370472609",
    "Link": " https://leetcode.com/problems/peeking-iterator"
  },
  "1081": {
    "Name": "Smallest Subsequence of Distinct Characters",
    "Acceptance": "50.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/smallest-subsequence-of-distinct-characters"
  },
  "232": {
    "Name": "Implement Queue using Stacks",
    "Acceptance": "49.6%",
    "Difficulty": "Easy",
    "Frequency": "0.12455784498557357",
    "Link": " https://leetcode.com/problems/implement-queue-using-stacks"
  },
  "163": {
    "Name": "Missing Ranges",
    "Acceptance": "24.3%",
    "Difficulty": "Medium",
    "Frequency": "0.11821867060119497",
    "Link": " https://leetcode.com/problems/missing-ranges"
  },
  "1060": {
    "Name": "Missing Element in Sorted Array",
    "Acceptance": "54.5%",
    "Difficulty": "Medium",
    "Frequency": "0.017429635135283658",
    "Link": " https://leetcode.com/problems/missing-element-in-sorted-array"
  },
  "584": {
    "Name": "Find Customer Referee",
    "Acceptance": "72.3%",
    "Difficulty": "Easy",
    "Frequency": "0.06592172080482424",
    "Link": " https://leetcode.com/problems/find-customer-referee"
  },
  "662": {
    "Name": "Maximum Width of Binary Tree",
    "Acceptance": "41.0%",
    "Difficulty": "Medium",
    "Frequency": "0.024116924478312346",
    "Link": " https://leetcode.com/problems/maximum-width-of-binary-tree"
  },
  "226": {
    "Name": "Invert Binary Tree",
    "Acceptance": "65.0%",
    "Difficulty": "Easy",
    "Frequency": "0.01235091863400913",
    "Link": " https://leetcode.com/problems/invert-binary-tree"
  },
  "167": {
    "Name": "Two Sum II - Input array is sorted",
    "Acceptance": "54.1%",
    "Difficulty": "Easy",
    "Frequency": "0.005280540323033287",
    "Link": " https://leetcode.com/problems/two-sum-ii-input-array-is-sorted"
  },
  "298": {
    "Name": "Binary Tree Longest Consecutive Sequence",
    "Acceptance": "47.1%",
    "Difficulty": "Medium",
    "Frequency": "0.065169635074581",
    "Link": " https://leetcode.com/problems/binary-tree-longest-consecutive-sequence"
  },
  "1270": {
    "Name": "All People Report to the Given Manager",
    "Acceptance": "87.1%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/all-people-report-to-the-given-manager"
  },
  "1005": {
    "Name": "Maximize Sum Of Array After K Negations",
    "Acceptance": "51.3%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximize-sum-of-array-after-k-negations"
  },
  "702": {
    "Name": "Search in a Sorted Array of Unknown Size",
    "Acceptance": "66.9%",
    "Difficulty": "Medium",
    "Frequency": "0.8458894094501456",
    "Link": " https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size"
  },
  "397": {
    "Name": "Integer Replacement",
    "Acceptance": "32.9%",
    "Difficulty": "Medium",
    "Frequency": "0.342522988151367",
    "Link": " https://leetcode.com/problems/integer-replacement"
  },
  "1299": {
    "Name": "Replace Elements with Greatest Element on Right Side",
    "Acceptance": "75.4%",
    "Difficulty": "Easy",
    "Frequency": "0.11806716692694107",
    "Link": " https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side"
  },
  "801": {
    "Name": "Minimum Swaps To Make Sequences Increasing",
    "Acceptance": "38.9%",
    "Difficulty": "Medium",
    "Frequency": "1.8139622880364348",
    "Link": " https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing"
  },
  "938": {
    "Name": "Range Sum of BST",
    "Acceptance": "81.3%",
    "Difficulty": "Easy",
    "Frequency": "0.027755467721532374",
    "Link": " https://leetcode.com/problems/range-sum-of-bst"
  },
  "567": {
    "Name": "Permutation in String",
    "Acceptance": "44.4%",
    "Difficulty": "Medium",
    "Frequency": "0.12099331128663167",
    "Link": " https://leetcode.com/problems/permutation-in-string"
  },
  "52": {
    "Name": "N-Queens II",
    "Acceptance": "57.9%",
    "Difficulty": "Hard",
    "Frequency": "0.20340920294292344",
    "Link": " https://leetcode.com/problems/n-queens-ii"
  },
  "164": {
    "Name": "Maximum Gap",
    "Acceptance": "35.5%",
    "Difficulty": "Hard",
    "Frequency": "0.669776346792018",
    "Link": " https://leetcode.com/problems/maximum-gap"
  },
  "1233": {
    "Name": "Remove Sub-Folders from the Filesystem",
    "Acceptance": "59.5%",
    "Difficulty": "Medium",
    "Frequency": "0.057076831135436705",
    "Link": " https://leetcode.com/problems/remove-sub-folders-from-the-filesystem"
  },
  "106": {
    "Name": "Construct Binary Tree from Inorder and Postorder Traversal",
    "Acceptance": "47.2%",
    "Difficulty": "Medium",
    "Frequency": "0.00234041415121758",
    "Link": " https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal"
  },
  "586": {
    "Name": "Customer Placing the Largest Number of Orders",
    "Acceptance": "73.0%",
    "Difficulty": "Easy",
    "Frequency": "0.12361395596717664",
    "Link": " https://leetcode.com/problems/customer-placing-the-largest-number-of-orders"
  },
  "862": {
    "Name": "Shortest Subarray with Sum at Least K",
    "Acceptance": "24.6%",
    "Difficulty": "Hard",
    "Frequency": "0.5755650893431007",
    "Link": " https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k"
  },
  "541": {
    "Name": "Reverse String II",
    "Acceptance": "48.4%",
    "Difficulty": "Easy",
    "Frequency": "0.05615948403872344",
    "Link": " https://leetcode.com/problems/reverse-string-ii"
  },
  "951": {
    "Name": "Flip Equivalent Binary Trees",
    "Acceptance": "65.8%",
    "Difficulty": "Medium",
    "Frequency": "2.3261691532245137",
    "Link": " https://leetcode.com/problems/flip-equivalent-binary-trees"
  },
  "421": {
    "Name": "Maximum XOR of Two Numbers in an Array",
    "Acceptance": "53.5%",
    "Difficulty": "Medium",
    "Frequency": "0.7687845947655654",
    "Link": " https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array"
  },
  "366": {
    "Name": "Find Leaves of Binary Tree",
    "Acceptance": "70.6%",
    "Difficulty": "Medium",
    "Frequency": "1.492934381312693",
    "Link": " https://leetcode.com/problems/find-leaves-of-binary-tree"
  },
  "149": {
    "Name": "Max Points on a Line",
    "Acceptance": "16.9%",
    "Difficulty": "Hard",
    "Frequency": "0.9593743180104668",
    "Link": " https://leetcode.com/problems/max-points-on-a-line"
  },
  "222": {
    "Name": "Count Complete Tree Nodes",
    "Acceptance": "46.8%",
    "Difficulty": "Medium",
    "Frequency": "0.029882701600012697",
    "Link": " https://leetcode.com/problems/count-complete-tree-nodes"
  },
  "839": {
    "Name": "Similar String Groups",
    "Acceptance": "38.6%",
    "Difficulty": "Hard",
    "Frequency": "0.11934675763256619",
    "Link": " https://leetcode.com/problems/similar-string-groups"
  },
  "304": {
    "Name": "Range Sum Query 2D - Immutable",
    "Acceptance": "38.6%",
    "Difficulty": "Medium",
    "Frequency": "0.013913267916985026",
    "Link": " https://leetcode.com/problems/range-sum-query-2d-immutable"
  },
  "708": {
    "Name": "Insert into a Sorted Circular Linked List",
    "Acceptance": "31.6%",
    "Difficulty": "Medium",
    "Frequency": "0.6963635371787209",
    "Link": " https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list"
  },
  "1339": {
    "Name": "Maximum Product of Splitted Binary Tree",
    "Acceptance": "37.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-product-of-splitted-binary-tree"
  },
  "382": {
    "Name": "Linked List Random Node",
    "Acceptance": "52.1%",
    "Difficulty": "Medium",
    "Frequency": "1.0518252914636277",
    "Link": " https://leetcode.com/problems/linked-list-random-node"
  },
  "100": {
    "Name": "Same Tree",
    "Acceptance": "53.4%",
    "Difficulty": "Easy",
    "Frequency": "0.05782550765396603",
    "Link": " https://leetcode.com/problems/same-tree"
  },
  "889": {
    "Name": "Construct Binary Tree from Preorder and Postorder Traversal",
    "Acceptance": "66.2%",
    "Difficulty": "Medium",
    "Frequency": "0.10711776476069794",
    "Link": " https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal"
  },
  "1267": {
    "Name": "Count Servers that Communicate",
    "Acceptance": "57.9%",
    "Difficulty": "Medium",
    "Frequency": "0.04902942724031861",
    "Link": " https://leetcode.com/problems/count-servers-that-communicate"
  },
  "189": {
    "Name": "Rotate Array",
    "Acceptance": "34.7%",
    "Difficulty": "Easy",
    "Frequency": "0.06260600694223208",
    "Link": " https://leetcode.com/problems/rotate-array"
  },
  "841": {
    "Name": "Keys and Rooms",
    "Acceptance": "64.3%",
    "Difficulty": "Medium",
    "Frequency": "0.5764125934649795",
    "Link": " https://leetcode.com/problems/keys-and-rooms"
  },
  "486": {
    "Name": "Predict the Winner",
    "Acceptance": "47.9%",
    "Difficulty": "Medium",
    "Frequency": "0.17647417648741714",
    "Link": " https://leetcode.com/problems/predict-the-winner"
  },
  "621": {
    "Name": "Task Scheduler",
    "Acceptance": "50.1%",
    "Difficulty": "Medium",
    "Frequency": "0.005261323957171611",
    "Link": " https://leetcode.com/problems/task-scheduler"
  },
  "1248": {
    "Name": "Count Number of Nice Subarrays",
    "Acceptance": "56.4%",
    "Difficulty": "Medium",
    "Frequency": "0.17228309044709728",
    "Link": " https://leetcode.com/problems/count-number-of-nice-subarrays"
  },
  "609": {
    "Name": "Find Duplicate File in System",
    "Acceptance": "59.5%",
    "Difficulty": "Medium",
    "Frequency": "0.09898183354885093",
    "Link": " https://leetcode.com/problems/find-duplicate-file-in-system"
  },
  "784": {
    "Name": "Letter Case Permutation",
    "Acceptance": "64.6%",
    "Difficulty": "Medium",
    "Frequency": "0.0787033338274549",
    "Link": " https://leetcode.com/problems/letter-case-permutation"
  },
  "325": {
    "Name": "Maximum Size Subarray Sum Equals k",
    "Acceptance": "46.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-size-subarray-sum-equals-k"
  },
  "180": {
    "Name": "Consecutive Numbers",
    "Acceptance": "39.7%",
    "Difficulty": "Medium",
    "Frequency": "0.07851014032375832",
    "Link": " https://leetcode.com/problems/consecutive-numbers"
  },
  "1382": {
    "Name": "Balance a Binary Search Tree",
    "Acceptance": "74.8%",
    "Difficulty": "Medium",
    "Frequency": "0.04480032475536626",
    "Link": " https://leetcode.com/problems/balance-a-binary-search-tree"
  },
  "435": {
    "Name": "Non-overlapping Intervals",
    "Acceptance": "42.9%",
    "Difficulty": "Medium",
    "Frequency": "0.07565042495900788",
    "Link": " https://leetcode.com/problems/non-overlapping-intervals"
  },
  "559": {
    "Name": "Maximum Depth of N-ary Tree",
    "Acceptance": "68.7%",
    "Difficulty": "Easy",
    "Frequency": "0.04319159858277399",
    "Link": " https://leetcode.com/problems/maximum-depth-of-n-ary-tree"
  },
  "727": {
    "Name": "Minimum Window Subsequence",
    "Acceptance": "41.8%",
    "Difficulty": "Hard",
    "Frequency": "0.3290234126082223",
    "Link": " https://leetcode.com/problems/minimum-window-subsequence"
  },
  "266": {
    "Name": "Palindrome Permutation",
    "Acceptance": "61.9%",
    "Difficulty": "Easy",
    "Frequency": "0.091248671465145",
    "Link": " https://leetcode.com/problems/palindrome-permutation"
  },
  "507": {
    "Name": "Perfect Number",
    "Acceptance": "35.5%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/perfect-number"
  },
  "450": {
    "Name": "Delete Node in a BST",
    "Acceptance": "43.1%",
    "Difficulty": "Medium",
    "Frequency": "0.10589656498719952",
    "Link": " https://leetcode.com/problems/delete-node-in-a-bst"
  },
  "918": {
    "Name": "Maximum Sum Circular Subarray",
    "Acceptance": "33.7%",
    "Difficulty": "Medium",
    "Frequency": "0.08881573371064024",
    "Link": " https://leetcode.com/problems/maximum-sum-circular-subarray"
  },
  "406": {
    "Name": "Queue Reconstruction by Height",
    "Acceptance": "66.9%",
    "Difficulty": "Medium",
    "Frequency": "0.10607646342422336",
    "Link": " https://leetcode.com/problems/queue-reconstruction-by-height"
  },
  "637": {
    "Name": "Average of Levels in Binary Tree",
    "Acceptance": "63.1%",
    "Difficulty": "Easy",
    "Frequency": "0.5608230187584083",
    "Link": " https://leetcode.com/problems/average-of-levels-in-binary-tree"
  },
  "1049": {
    "Name": "Last Stone Weight II",
    "Acceptance": "44.2%",
    "Difficulty": "Medium",
    "Frequency": "0.03902934390573525",
    "Link": " https://leetcode.com/problems/last-stone-weight-ii"
  },
  "241": {
    "Name": "Different Ways to Add Parentheses",
    "Acceptance": "55.2%",
    "Difficulty": "Medium",
    "Frequency": "1.6793403602398669",
    "Link": " https://leetcode.com/problems/different-ways-to-add-parentheses"
  },
  "1110": {
    "Name": "Delete Nodes And Return Forest",
    "Acceptance": "67.0%",
    "Difficulty": "Medium",
    "Frequency": "3.4188856985119753",
    "Link": " https://leetcode.com/problems/delete-nodes-and-return-forest"
  },
  "646": {
    "Name": "Maximum Length of Pair Chain",
    "Acceptance": "51.9%",
    "Difficulty": "Medium",
    "Frequency": "0.08112554481236843",
    "Link": " https://leetcode.com/problems/maximum-length-of-pair-chain"
  },
  "626": {
    "Name": "Exchange Seats",
    "Acceptance": "62.3%",
    "Difficulty": "Medium",
    "Frequency": "0.21032769554231237",
    "Link": " https://leetcode.com/problems/exchange-seats"
  },
  "884": {
    "Name": "Uncommon Words from Two Sentences",
    "Acceptance": "63.3%",
    "Difficulty": "Easy",
    "Frequency": "0.036301626676214796",
    "Link": " https://leetcode.com/problems/uncommon-words-from-two-sentences"
  },
  "250": {
    "Name": "Count Univalue Subtrees",
    "Acceptance": "52.0%",
    "Difficulty": "Medium",
    "Frequency": "1.698353993388098",
    "Link": " https://leetcode.com/problems/count-univalue-subtrees"
  },
  "334": {
    "Name": "Increasing Triplet Subsequence",
    "Acceptance": "40.0%",
    "Difficulty": "Medium",
    "Frequency": "0.06039571028973993",
    "Link": " https://leetcode.com/problems/increasing-triplet-subsequence"
  },
  "416": {
    "Name": "Partition Equal Subset Sum",
    "Acceptance": "43.7%",
    "Difficulty": "Medium",
    "Frequency": "0.07230612961778679",
    "Link": " https://leetcode.com/problems/partition-equal-subset-sum"
  },
  "912": {
    "Name": "Sort an Array",
    "Acceptance": "63.9%",
    "Difficulty": "Medium",
    "Frequency": "0.01443026482902881",
    "Link": " https://leetcode.com/problems/sort-an-array"
  },
  "345": {
    "Name": "Reverse Vowels of a String",
    "Acceptance": "44.2%",
    "Difficulty": "Easy",
    "Frequency": "2.8469976121950618",
    "Link": " https://leetcode.com/problems/reverse-vowels-of-a-string"
  },
  "1179": {
    "Name": "Reformat Department Table",
    "Acceptance": "80.6%",
    "Difficulty": "Easy",
    "Frequency": "0.030653741091002412",
    "Link": " https://leetcode.com/problems/reformat-department-table"
  },
  "557": {
    "Name": "Reverse Words in a String III",
    "Acceptance": "69.8%",
    "Difficulty": "Easy",
    "Frequency": "0.03063547953861342",
    "Link": " https://leetcode.com/problems/reverse-words-in-a-string-iii"
  },
  "1027": {
    "Name": "Longest Arithmetic Sequence",
    "Acceptance": "53.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/longest-arithmetic-sequence"
  },
  "671": {
    "Name": "Second Minimum Node In a Binary Tree",
    "Acceptance": "42.7%",
    "Difficulty": "Easy",
    "Frequency": "0.02958795718549609",
    "Link": " https://leetcode.com/problems/second-minimum-node-in-a-binary-tree"
  },
  "452": {
    "Name": "Minimum Number of Arrows to Burst Balloons",
    "Acceptance": "49.6%",
    "Difficulty": "Medium",
    "Frequency": "0.10828689439229534",
    "Link": " https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons"
  },
  "249": {
    "Name": "Group Shifted Strings",
    "Acceptance": "55.1%",
    "Difficulty": "Medium",
    "Frequency": "0.16122347914767343",
    "Link": " https://leetcode.com/problems/group-shifted-strings"
  },
  "796": {
    "Name": "Rotate String",
    "Acceptance": "49.6%",
    "Difficulty": "Easy",
    "Frequency": "0.02701041988276247",
    "Link": " https://leetcode.com/problems/rotate-string"
  },
  "931": {
    "Name": "Minimum Falling Path Sum",
    "Acceptance": "62.5%",
    "Difficulty": "Medium",
    "Frequency": "0.21812080268374587",
    "Link": " https://leetcode.com/problems/minimum-falling-path-sum"
  },
  "158": {
    "Name": "Read N Characters Given Read4 II - Call multiple times",
    "Acceptance": "33.8%",
    "Difficulty": "Hard",
    "Frequency": "0.5089658995317979",
    "Link": " https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times"
  },
  "1395": {
    "Name": "Count Number of Teams",
    "Acceptance": "82.0%",
    "Difficulty": "Medium",
    "Frequency": "0.09817811071565465",
    "Link": " https://leetcode.com/problems/count-number-of-teams"
  },
  "162": {
    "Name": "Find Peak Element",
    "Acceptance": "43.3%",
    "Difficulty": "Medium",
    "Frequency": "0.1162765141658937",
    "Link": " https://leetcode.com/problems/find-peak-element"
  },
  "171": {
    "Name": "Excel Sheet Column Number",
    "Acceptance": "55.9%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/excel-sheet-column-number"
  },
  "714": {
    "Name": "Best Time to Buy and Sell Stock with Transaction Fee",
    "Acceptance": "54.7%",
    "Difficulty": "Medium",
    "Frequency": "0.19966567025192705",
    "Link": " https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee"
  },
  "704": {
    "Name": "Binary Search",
    "Acceptance": "52.1%",
    "Difficulty": "Easy",
    "Frequency": "0.12265353454721256",
    "Link": " https://leetcode.com/problems/binary-search"
  },
  "429": {
    "Name": "N-ary Tree Level Order Traversal",
    "Acceptance": "65.0%",
    "Difficulty": "Medium",
    "Frequency": "0.13727657783562877",
    "Link": " https://leetcode.com/problems/n-ary-tree-level-order-traversal"
  },
  "414": {
    "Name": "Third Maximum Number",
    "Acceptance": "30.5%",
    "Difficulty": "Easy",
    "Frequency": "0.08956753807644377",
    "Link": " https://leetcode.com/problems/third-maximum-number"
  },
  "684": {
    "Name": "Redundant Connection",
    "Acceptance": "57.4%",
    "Difficulty": "Medium",
    "Frequency": "1.7020400393387942",
    "Link": " https://leetcode.com/problems/redundant-connection"
  },
  "1160": {
    "Name": "Find Words That Can Be Formed by Characters",
    "Acceptance": "67.4%",
    "Difficulty": "Easy",
    "Frequency": "0.13367440299301808",
    "Link": " https://leetcode.com/problems/find-words-that-can-be-formed-by-characters"
  },
  "1520": {
    "Name": "Maximum Number of Non-Overlapping Substrings",
    "Acceptance": "32.8%",
    "Difficulty": "Hard",
    "Frequency": "0.021485667755491482",
    "Link": " https://leetcode.com/problems/maximum-number-of-non-overlapping-substrings"
  },
  "905": {
    "Name": "Sort Array By Parity",
    "Acceptance": "74.1%",
    "Difficulty": "Easy",
    "Frequency": "0.03787434929243582",
    "Link": " https://leetcode.com/problems/sort-array-by-parity"
  },
  "921": {
    "Name": "Minimum Add to Make Parentheses Valid",
    "Acceptance": "73.7%",
    "Difficulty": "Medium",
    "Frequency": "0.021425565169310254",
    "Link": " https://leetcode.com/problems/minimum-add-to-make-parentheses-valid"
  },
  "459": {
    "Name": "Repeated Substring Pattern",
    "Acceptance": "42.2%",
    "Difficulty": "Easy",
    "Frequency": "0.04752742385552696",
    "Link": " https://leetcode.com/problems/repeated-substring-pattern"
  },
  "485": {
    "Name": "Max Consecutive Ones",
    "Acceptance": "54.6%",
    "Difficulty": "Easy",
    "Frequency": "0.03276403666757628",
    "Link": " https://leetcode.com/problems/max-consecutive-ones"
  },
  "654": {
    "Name": "Maximum Binary Tree",
    "Acceptance": "79.9%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-binary-tree"
  },
  "60": {
    "Name": "Permutation Sequence",
    "Acceptance": "38.4%",
    "Difficulty": "Hard",
    "Frequency": "0.019268418865877057",
    "Link": " https://leetcode.com/problems/permutation-sequence"
  },
  "43": {
    "Name": "Multiply Strings",
    "Acceptance": "33.9%",
    "Difficulty": "Medium",
    "Frequency": "0.13149814559900883",
    "Link": " https://leetcode.com/problems/multiply-strings"
  },
  "392": {
    "Name": "Is Subsequence",
    "Acceptance": "49.2%",
    "Difficulty": "Easy",
    "Frequency": "0.07897107508821988",
    "Link": " https://leetcode.com/problems/is-subsequence"
  },
  "674": {
    "Name": "Longest Continuous Increasing Subsequence",
    "Acceptance": "45.9%",
    "Difficulty": "Easy",
    "Frequency": "0.01900294712561538",
    "Link": " https://leetcode.com/problems/longest-continuous-increasing-subsequence"
  },
  "965": {
    "Name": "Univalued Binary Tree",
    "Acceptance": "67.7%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/univalued-binary-tree"
  },
  "290": {
    "Name": "Word Pattern",
    "Acceptance": "37.0%",
    "Difficulty": "Easy",
    "Frequency": "0.2601476821005732",
    "Link": " https://leetcode.com/problems/word-pattern"
  },
  "590": {
    "Name": "N-ary Tree Postorder Traversal",
    "Acceptance": "72.1%",
    "Difficulty": "Easy",
    "Frequency": "0.040454954692313666",
    "Link": " https://leetcode.com/problems/n-ary-tree-postorder-traversal"
  },
  "346": {
    "Name": "Moving Average from Data Stream",
    "Acceptance": "70.9%",
    "Difficulty": "Easy",
    "Frequency": "0.43127299206403696",
    "Link": " https://leetcode.com/problems/moving-average-from-data-stream"
  },
  "383": {
    "Name": "Ransom Note",
    "Acceptance": "53.1%",
    "Difficulty": "Easy",
    "Frequency": "0.1053605156578263",
    "Link": " https://leetcode.com/problems/ransom-note"
  },
  "657": {
    "Name": "Robot Return to Origin",
    "Acceptance": "73.5%",
    "Difficulty": "Easy",
    "Frequency": "0.06825676545444917",
    "Link": " https://leetcode.com/problems/robot-return-to-origin"
  },
  "1266": {
    "Name": "Minimum Time Visiting All Points",
    "Acceptance": "79.6%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-time-visiting-all-points"
  },
  "1304": {
    "Name": "Find N Unique Integers Sum up to Zero",
    "Acceptance": "76.3%",
    "Difficulty": "Easy",
    "Frequency": "0.06210765548004028",
    "Link": " https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero"
  },
  "724": {
    "Name": "Find Pivot Index",
    "Acceptance": "44.0%",
    "Difficulty": "Easy",
    "Frequency": "0.05428741283782842",
    "Link": " https://leetcode.com/problems/find-pivot-index"
  },
  "151": {
    "Name": "Reverse Words in a String",
    "Acceptance": "21.9%",
    "Difficulty": "Medium",
    "Frequency": "0.018535861301292162",
    "Link": " https://leetcode.com/problems/reverse-words-in-a-string"
  },
  "144": {
    "Name": "Binary Tree Preorder Traversal",
    "Acceptance": "55.7%",
    "Difficulty": "Medium",
    "Frequency": "0.0722495403534662",
    "Link": " https://leetcode.com/problems/binary-tree-preorder-traversal"
  },
  "303": {
    "Name": "Range Sum Query - Immutable",
    "Acceptance": "44.7%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/range-sum-query-immutable"
  },
  "213": {
    "Name": "House Robber II",
    "Acceptance": "36.5%",
    "Difficulty": "Medium",
    "Frequency": "0.10850742141601913",
    "Link": " https://leetcode.com/problems/house-robber-ii"
  },
  "338": {
    "Name": "Counting Bits",
    "Acceptance": "69.5%",
    "Difficulty": "Medium",
    "Frequency": "0.0428445715346785",
    "Link": " https://leetcode.com/problems/counting-bits"
  },
  "1221": {
    "Name": "Split a String in Balanced Strings",
    "Acceptance": "83.3%",
    "Difficulty": "Easy",
    "Frequency": "0.1319324949716959",
    "Link": " https://leetcode.com/problems/split-a-string-in-balanced-strings"
  },
  "461": {
    "Name": "Hamming Distance",
    "Acceptance": "72.8%",
    "Difficulty": "Easy",
    "Frequency": "0.12570469475928556",
    "Link": " https://leetcode.com/problems/hamming-distance"
  },
  "260": {
    "Name": "Single Number III",
    "Acceptance": "64.3%",
    "Difficulty": "Medium",
    "Frequency": "0.012571824032760881",
    "Link": " https://leetcode.com/problems/single-number-iii"
  },
  "1344": {
    "Name": "Angle Between Hands of a Clock",
    "Acceptance": "61.4%",
    "Difficulty": "Medium",
    "Frequency": "0.023682900893022413",
    "Link": " https://leetcode.com/problems/angle-between-hands-of-a-clock"
  },
  "328": {
    "Name": "Odd Even Linked List",
    "Acceptance": "55.7%",
    "Difficulty": "Medium",
    "Frequency": "1.168614944926649",
    "Link": " https://leetcode.com/problems/odd-even-linked-list"
  },
  "309": {
    "Name": "Best Time to Buy and Sell Stock with Cooldown",
    "Acceptance": "47.4%",
    "Difficulty": "Medium",
    "Frequency": "0.16775633188303693",
    "Link": " https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown"
  },
  "1431": {
    "Name": "Kids With the Greatest Number of Candies",
    "Acceptance": "88.9%",
    "Difficulty": "Easy",
    "Frequency": "0.005927699633275225",
    "Link": " https://leetcode.com/problems/kids-with-the-greatest-number-of-candies"
  },
  "797": {
    "Name": "All Paths From Source to Target",
    "Acceptance": "77.9%",
    "Difficulty": "Medium",
    "Frequency": "0.6133054173259477",
    "Link": " https://leetcode.com/problems/all-paths-from-source-to-target"
  },
  "505": {
    "Name": "The Maze II",
    "Acceptance": "47.7%",
    "Difficulty": "Medium",
    "Frequency": "0.07133147800542972",
    "Link": " https://leetcode.com/problems/the-maze-ii"
  },
  "631": {
    "Name": "Design Excel Sum Formula",
    "Acceptance": "31.6%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/design-excel-sum-formula"
  },
  "711": {
    "Name": "Number of Distinct Islands II",
    "Acceptance": "47.3%",
    "Difficulty": "Hard",
    "Frequency": "2.1972245773362196",
    "Link": " https://leetcode.com/problems/number-of-distinct-islands-ii"
  },
  "943": {
    "Name": "Find the Shortest Superstring",
    "Acceptance": "42.9%",
    "Difficulty": "Hard",
    "Frequency": "2.183127427581185",
    "Link": " https://leetcode.com/problems/find-the-shortest-superstring"
  },
  "558": {
    "Name": "Logical OR of Two Binary Grids Represented as Quad-Trees",
    "Acceptance": "44.6%",
    "Difficulty": "Medium",
    "Frequency": "1.302238508997728",
    "Link": " https://leetcode.com/problems/logical-or-of-two-binary-grids-represented-as-quad-trees"
  },
  "635": {
    "Name": "Design Log Storage System",
    "Acceptance": "58.6%",
    "Difficulty": "Medium",
    "Frequency": "2.6952344479401242",
    "Link": " https://leetcode.com/problems/design-log-storage-system"
  },
  "361": {
    "Name": "Bomb Enemy",
    "Acceptance": "46.0%",
    "Difficulty": "Medium",
    "Frequency": "1.1535711729488671",
    "Link": " https://leetcode.com/problems/bomb-enemy"
  },
  "428": {
    "Name": "Serialize and Deserialize N-ary Tree",
    "Acceptance": "59.4%",
    "Difficulty": "Hard",
    "Frequency": "1.619513564422842",
    "Link": " https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree"
  },
  "710": {
    "Name": "Random Pick with Blacklist",
    "Acceptance": "32.5%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/random-pick-with-blacklist"
  },
  "658": {
    "Name": "Find K Closest Elements",
    "Acceptance": "40.9%",
    "Difficulty": "Medium",
    "Frequency": "0.5351504766219078",
    "Link": " https://leetcode.com/problems/find-k-closest-elements"
  },
  "699": {
    "Name": "Falling Squares",
    "Acceptance": "41.8%",
    "Difficulty": "Hard",
    "Frequency": "0.2856138193877219",
    "Link": " https://leetcode.com/problems/falling-squares"
  },
  "508": {
    "Name": "Most Frequent Subtree Sum",
    "Acceptance": "57.9%",
    "Difficulty": "Medium",
    "Frequency": "0.9932954993707267",
    "Link": " https://leetcode.com/problems/most-frequent-subtree-sum"
  },
  "683": {
    "Name": "K Empty Slots",
    "Acceptance": "35.6%",
    "Difficulty": "Hard",
    "Frequency": "0.25708853309999324",
    "Link": " https://leetcode.com/problems/k-empty-slots"
  },
  "225": {
    "Name": "Implement Stack using Queues",
    "Acceptance": "45.1%",
    "Difficulty": "Easy",
    "Frequency": "0.06160531164682534",
    "Link": " https://leetcode.com/problems/implement-stack-using-queues"
  },
  "369": {
    "Name": "Plus One Linked List",
    "Acceptance": "58.2%",
    "Difficulty": "Medium",
    "Frequency": "2.103037362276518",
    "Link": " https://leetcode.com/problems/plus-one-linked-list"
  },
  "604": {
    "Name": "Design Compressed String Iterator",
    "Acceptance": "37.5%",
    "Difficulty": "Easy",
    "Frequency": "1.33500106673234",
    "Link": " https://leetcode.com/problems/design-compressed-string-iterator"
  },
  "900": {
    "Name": "RLE Iterator",
    "Acceptance": "53.5%",
    "Difficulty": "Medium",
    "Frequency": "0.1884471502206373",
    "Link": " https://leetcode.com/problems/rle-iterator"
  },
  "618": {
    "Name": "Students Report By Geography",
    "Acceptance": "55.0%",
    "Difficulty": "Hard",
    "Frequency": "0.34560472018448546",
    "Link": " https://leetcode.com/problems/students-report-by-geography"
  },
  "244": {
    "Name": "Shortest Word Distance II",
    "Acceptance": "52.3%",
    "Difficulty": "Medium",
    "Frequency": "0.6781843078832329",
    "Link": " https://leetcode.com/problems/shortest-word-distance-ii"
  },
  "847": {
    "Name": "Shortest Path Visiting All Nodes",
    "Acceptance": "52.0%",
    "Difficulty": "Hard",
    "Frequency": "0.1541506798272583",
    "Link": " https://leetcode.com/problems/shortest-path-visiting-all-nodes"
  },
  "919": {
    "Name": "Complete Binary Tree Inserter",
    "Acceptance": "57.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/complete-binary-tree-inserter"
  },
  "731": {
    "Name": "My Calendar II",
    "Acceptance": "49.1%",
    "Difficulty": "Medium",
    "Frequency": "2.894068619777491",
    "Link": " https://leetcode.com/problems/my-calendar-ii"
  },
  "305": {
    "Name": "Number of Islands II",
    "Acceptance": "40.1%",
    "Difficulty": "Hard",
    "Frequency": "2.7873368509214487",
    "Link": " https://leetcode.com/problems/number-of-islands-ii"
  },
  "1059": {
    "Name": "All Paths from Source Lead to Destination",
    "Acceptance": "44.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/all-paths-from-source-lead-to-destination"
  },
  "1086": {
    "Name": "High Five",
    "Acceptance": "79.7%",
    "Difficulty": "Easy",
    "Frequency": "3.081613006775713",
    "Link": " https://leetcode.com/problems/high-five"
  },
  "1026": {
    "Name": "Maximum Difference Between Node and Ancestor",
    "Acceptance": "66.0%",
    "Difficulty": "Medium",
    "Frequency": "0.04467244005159257",
    "Link": " https://leetcode.com/problems/maximum-difference-between-node-and-ancestor"
  },
  "281": {
    "Name": "Zigzag Iterator",
    "Acceptance": "58.4%",
    "Difficulty": "Medium",
    "Frequency": "0.22884157242884745",
    "Link": " https://leetcode.com/problems/zigzag-iterator"
  },
  "742": {
    "Name": "Closest Leaf in a Binary Tree",
    "Acceptance": "43.6%",
    "Difficulty": "Medium",
    "Frequency": "0.7191226669632059",
    "Link": " https://leetcode.com/problems/closest-leaf-in-a-binary-tree"
  },
  "174": {
    "Name": "Dungeon Game",
    "Acceptance": "32.3%",
    "Difficulty": "Hard",
    "Frequency": "1.3665611251341205",
    "Link": " https://leetcode.com/problems/dungeon-game"
  },
  "924": {
    "Name": "Minimize Malware Spread",
    "Acceptance": "42.0%",
    "Difficulty": "Hard",
    "Frequency": "0.3764775712349121",
    "Link": " https://leetcode.com/problems/minimize-malware-spread"
  },
  "267": {
    "Name": "Palindrome Permutation II",
    "Acceptance": "36.4%",
    "Difficulty": "Medium",
    "Frequency": "1.9644220544755755",
    "Link": " https://leetcode.com/problems/palindrome-permutation-ii"
  },
  "393": {
    "Name": "UTF-8 Validation",
    "Acceptance": "37.5%",
    "Difficulty": "Medium",
    "Frequency": "5.339542531545812",
    "Link": " https://leetcode.com/problems/utf-8-validation"
  },
  "1023": {
    "Name": "Camelcase Matching",
    "Acceptance": "57.0%",
    "Difficulty": "Medium",
    "Frequency": "0.65888823073893",
    "Link": " https://leetcode.com/problems/camelcase-matching"
  },
  "807": {
    "Name": "Max Increase to Keep City Skyline",
    "Acceptance": "83.7%",
    "Difficulty": "Medium",
    "Frequency": "1.1546614400537725",
    "Link": " https://leetcode.com/problems/max-increase-to-keep-city-skyline"
  },
  "720": {
    "Name": "Longest Word in Dictionary",
    "Acceptance": "48.2%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/longest-word-in-dictionary"
  },
  "826": {
    "Name": "Most Profit Assigning Work",
    "Acceptance": "38.5%",
    "Difficulty": "Medium",
    "Frequency": "0.09287412500644375",
    "Link": " https://leetcode.com/problems/most-profit-assigning-work"
  },
  "447": {
    "Name": "Number of Boomerangs",
    "Acceptance": "51.8%",
    "Difficulty": "Easy",
    "Frequency": "2.070710491182991",
    "Link": " https://leetcode.com/problems/number-of-boomerangs"
  },
  "358": {
    "Name": "Rearrange String k Distance Apart",
    "Acceptance": "34.9%",
    "Difficulty": "Hard",
    "Frequency": "0.6082477367734591",
    "Link": " https://leetcode.com/problems/rearrange-string-k-distance-apart"
  },
  "549": {
    "Name": "Binary Tree Longest Consecutive Sequence II",
    "Acceptance": "47.0%",
    "Difficulty": "Medium",
    "Frequency": "1.4627859286979625",
    "Link": " https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii"
  },
  "433": {
    "Name": "Minimum Genetic Mutation",
    "Acceptance": "41.8%",
    "Difficulty": "Medium",
    "Frequency": "3.6380005958321364",
    "Link": " https://leetcode.com/problems/minimum-genetic-mutation"
  },
  "942": {
    "Name": "DI String Match",
    "Acceptance": "72.6%",
    "Difficulty": "Easy",
    "Frequency": "0.22018350968573291",
    "Link": " https://leetcode.com/problems/di-string-match"
  },
  "582": {
    "Name": "Kill Process",
    "Acceptance": "60.8%",
    "Difficulty": "Medium",
    "Frequency": "1.29092971360129",
    "Link": " https://leetcode.com/problems/kill-process"
  },
  "871": {
    "Name": "Minimum Number of Refueling Stops",
    "Acceptance": "31.4%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-number-of-refueling-stops"
  },
  "904": {
    "Name": "Fruit Into Baskets",
    "Acceptance": "42.5%",
    "Difficulty": "Medium",
    "Frequency": "5.622005350773675",
    "Link": " https://leetcode.com/problems/fruit-into-baskets"
  },
  "765": {
    "Name": "Couples Holding Hands",
    "Acceptance": "54.3%",
    "Difficulty": "Hard",
    "Frequency": "0.27380672595816385",
    "Link": " https://leetcode.com/problems/couples-holding-hands"
  },
  "1082": {
    "Name": "Sales Analysis I",
    "Acceptance": "71.8%",
    "Difficulty": "Easy",
    "Frequency": "0.07145896398214495",
    "Link": " https://leetcode.com/problems/sales-analysis-i"
  },
  "365": {
    "Name": "Water and Jug Problem",
    "Acceptance": "30.6%",
    "Difficulty": "Medium",
    "Frequency": "1.0087460326577822",
    "Link": " https://leetcode.com/problems/water-and-jug-problem"
  },
  "855": {
    "Name": "Exam Room",
    "Acceptance": "43.1%",
    "Difficulty": "Medium",
    "Frequency": "0.13804422079620546",
    "Link": " https://leetcode.com/problems/exam-room"
  },
  "475": {
    "Name": "Heaters",
    "Acceptance": "33.1%",
    "Difficulty": "Easy",
    "Frequency": "1.7664928396260275",
    "Link": " https://leetcode.com/problems/heaters"
  },
  "783": {
    "Name": "Minimum Distance Between BST Nodes",
    "Acceptance": "52.6%",
    "Difficulty": "Easy",
    "Frequency": "0.026196651946570663",
    "Link": " https://leetcode.com/problems/minimum-distance-between-bst-nodes"
  },
  "979": {
    "Name": "Distribute Coins in Binary Tree",
    "Acceptance": "68.9%",
    "Difficulty": "Medium",
    "Frequency": "0.15348688956060175",
    "Link": " https://leetcode.com/problems/distribute-coins-in-binary-tree"
  },
  "719": {
    "Name": "Find K-th Smallest Pair Distance",
    "Acceptance": "31.5%",
    "Difficulty": "Hard",
    "Frequency": "0.40316361111988513",
    "Link": " https://leetcode.com/problems/find-k-th-smallest-pair-distance"
  },
  "679": {
    "Name": "24 Game",
    "Acceptance": "46.4%",
    "Difficulty": "Hard",
    "Frequency": "0.8636247536746324",
    "Link": " https://leetcode.com/problems/24-game"
  },
  "687": {
    "Name": "Longest Univalue Path",
    "Acceptance": "36.2%",
    "Difficulty": "Easy",
    "Frequency": "2.567963195991046",
    "Link": " https://leetcode.com/problems/longest-univalue-path"
  },
  "791": {
    "Name": "Custom Sort String",
    "Acceptance": "65.7%",
    "Difficulty": "Medium",
    "Frequency": "0.05164658886216683",
    "Link": " https://leetcode.com/problems/custom-sort-string"
  },
  "792": {
    "Name": "Number of Matching Subsequences",
    "Acceptance": "47.4%",
    "Difficulty": "Medium",
    "Frequency": "1.6356226914291674",
    "Link": " https://leetcode.com/problems/number-of-matching-subsequences"
  },
  "493": {
    "Name": "Reverse Pairs",
    "Acceptance": "25.2%",
    "Difficulty": "Hard",
    "Frequency": "0.33395175639587793",
    "Link": " https://leetcode.com/problems/reverse-pairs"
  },
  "532": {
    "Name": "K-diff Pairs in an Array",
    "Acceptance": "31.6%",
    "Difficulty": "Easy",
    "Frequency": "0.20837786270708894",
    "Link": " https://leetcode.com/problems/k-diff-pairs-in-an-array"
  },
  "231": {
    "Name": "Power of Two",
    "Acceptance": "43.7%",
    "Difficulty": "Easy",
    "Frequency": "0.059357559503279325",
    "Link": " https://leetcode.com/problems/power-of-two"
  },
  "376": {
    "Name": "Wiggle Subsequence",
    "Acceptance": "39.6%",
    "Difficulty": "Medium",
    "Frequency": "0.08068891125014274",
    "Link": " https://leetcode.com/problems/wiggle-subsequence"
  },
  "673": {
    "Name": "Number of Longest Increasing Subsequence",
    "Acceptance": "35.7%",
    "Difficulty": "Medium",
    "Frequency": "0.08025695513016742",
    "Link": " https://leetcode.com/problems/number-of-longest-increasing-subsequence"
  },
  "1029": {
    "Name": "Two City Scheduling",
    "Acceptance": "56.1%",
    "Difficulty": "Easy",
    "Frequency": "0.13804422079620546",
    "Link": " https://leetcode.com/problems/two-city-scheduling"
  },
  "705": {
    "Name": "Design HashSet",
    "Acceptance": "64.3%",
    "Difficulty": "Easy",
    "Frequency": "0.19578302313828744",
    "Link": " https://leetcode.com/problems/design-hashset"
  },
  "814": {
    "Name": "Binary Tree Pruning",
    "Acceptance": "74.5%",
    "Difficulty": "Medium",
    "Frequency": "0.03113091859517317",
    "Link": " https://leetcode.com/problems/binary-tree-pruning"
  },
  "319": {
    "Name": "Bulb Switcher",
    "Acceptance": "45.4%",
    "Difficulty": "Medium",
    "Frequency": "0.3156951086794549",
    "Link": " https://leetcode.com/problems/bulb-switcher"
  },
  "501": {
    "Name": "Find Mode in Binary Search Tree",
    "Acceptance": "42.4%",
    "Difficulty": "Easy",
    "Frequency": "0.24083782012126176",
    "Link": " https://leetcode.com/problems/find-mode-in-binary-search-tree"
  },
  "779": {
    "Name": "K-th Symbol in Grammar",
    "Acceptance": "37.2%",
    "Difficulty": "Medium",
    "Frequency": "0.029050699422092676",
    "Link": " https://leetcode.com/problems/k-th-symbol-in-grammar"
  },
  "811": {
    "Name": "Subdomain Visit Count",
    "Acceptance": "69.9%",
    "Difficulty": "Easy",
    "Frequency": "0.35434665417914124",
    "Link": " https://leetcode.com/problems/subdomain-visit-count"
  },
  "311": {
    "Name": "Sparse Matrix Multiplication",
    "Acceptance": "61.9%",
    "Difficulty": "Medium",
    "Frequency": "0.2957254800409785",
    "Link": " https://leetcode.com/problems/sparse-matrix-multiplication"
  },
  "119": {
    "Name": "Pascal's Triangle II",
    "Acceptance": "49.0%",
    "Difficulty": "Easy",
    "Frequency": "0.07211890069342013",
    "Link": " https://leetcode.com/problems/pascals-triangle-ii"
  },
  "752": {
    "Name": "Open the Lock",
    "Acceptance": "51.8%",
    "Difficulty": "Medium",
    "Frequency": "0.09491410658218381",
    "Link": " https://leetcode.com/problems/open-the-lock"
  },
  "605": {
    "Name": "Can Place Flowers",
    "Acceptance": "31.6%",
    "Difficulty": "Easy",
    "Frequency": "0.09086837628235879",
    "Link": " https://leetcode.com/problems/can-place-flowers"
  },
  "216": {
    "Name": "Combination Sum III",
    "Acceptance": "56.6%",
    "Difficulty": "Medium",
    "Frequency": "0.24698514158015275",
    "Link": " https://leetcode.com/problems/combination-sum-iii"
  },
  "746": {
    "Name": "Min Cost Climbing Stairs",
    "Acceptance": "50.3%",
    "Difficulty": "Easy",
    "Frequency": "0.021092884180567165",
    "Link": " https://leetcode.com/problems/min-cost-climbing-stairs"
  },
  "958": {
    "Name": "Check Completeness of a Binary Tree",
    "Acceptance": "52.1%",
    "Difficulty": "Medium",
    "Frequency": "0.12884496089089562",
    "Link": " https://leetcode.com/problems/check-completeness-of-a-binary-tree"
  },
  "377": {
    "Name": "Combination Sum IV",
    "Acceptance": "45.3%",
    "Difficulty": "Medium",
    "Frequency": "0.08101594376008861",
    "Link": " https://leetcode.com/problems/combination-sum-iv"
  },
  "670": {
    "Name": "Maximum Swap",
    "Acceptance": "43.6%",
    "Difficulty": "Medium",
    "Frequency": "0.04630456804168632",
    "Link": " https://leetcode.com/problems/maximum-swap"
  },
  "196": {
    "Name": "Delete Duplicate Emails",
    "Acceptance": "41.1%",
    "Difficulty": "Easy",
    "Frequency": "0.111723209445655",
    "Link": " https://leetcode.com/problems/delete-duplicate-emails"
  },
  "872": {
    "Name": "Leaf-Similar Trees",
    "Acceptance": "64.5%",
    "Difficulty": "Easy",
    "Frequency": "0.03899974309382511",
    "Link": " https://leetcode.com/problems/leaf-similar-trees"
  },
  "707": {
    "Name": "Design Linked List",
    "Acceptance": "24.5%",
    "Difficulty": "Medium",
    "Frequency": "0.015054857167065819",
    "Link": " https://leetcode.com/problems/design-linked-list"
  },
  "367": {
    "Name": "Valid Perfect Square",
    "Acceptance": "41.7%",
    "Difficulty": "Easy",
    "Frequency": "0.16978101623607908",
    "Link": " https://leetcode.com/problems/valid-perfect-square"
  },
  "80": {
    "Name": "Remove Duplicates from Sorted Array II",
    "Acceptance": "44.0%",
    "Difficulty": "Medium",
    "Frequency": "0.014815085785140639",
    "Link": " https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii"
  },
  "371": {
    "Name": "Sum of Two Integers",
    "Acceptance": "50.7%",
    "Difficulty": "Medium",
    "Frequency": "0.013364716132203554",
    "Link": " https://leetcode.com/problems/sum-of-two-integers"
  },
  "172": {
    "Name": "Factorial Trailing Zeroes",
    "Acceptance": "37.8%",
    "Difficulty": "Easy",
    "Frequency": "0.012326812480658571",
    "Link": " https://leetcode.com/problems/factorial-trailing-zeroes"
  },
  "111": {
    "Name": "Minimum Depth of Binary Tree",
    "Acceptance": "37.4%",
    "Difficulty": "Easy",
    "Frequency": "0.05806209779650968",
    "Link": " https://leetcode.com/problems/minimum-depth-of-binary-tree"
  },
  "27": {
    "Name": "Remove Element",
    "Acceptance": "48.2%",
    "Difficulty": "Easy",
    "Frequency": "0.08523043261863501",
    "Link": " https://leetcode.com/problems/remove-element"
  },
  "186": {
    "Name": "Reverse Words in a String II",
    "Acceptance": "43.3%",
    "Difficulty": "Medium",
    "Frequency": "0.05064373281875492",
    "Link": " https://leetcode.com/problems/reverse-words-in-a-string-ii"
  },
  "517": {
    "Name": "Super Washing Machines",
    "Acceptance": "38.3%",
    "Difficulty": "Hard",
    "Frequency": "0.6257058997644127",
    "Link": " https://leetcode.com/problems/super-washing-machines"
  },
  "355": {
    "Name": "Design Twitter",
    "Acceptance": "30.3%",
    "Difficulty": "Medium",
    "Frequency": "1.0346399906708852",
    "Link": " https://leetcode.com/problems/design-twitter"
  },
  "89": {
    "Name": "Gray Code",
    "Acceptance": "49.1%",
    "Difficulty": "Medium",
    "Frequency": "0.8553139353754396",
    "Link": " https://leetcode.com/problems/gray-code"
  },
  "1311": {
    "Name": "Get Watched Videos by Your Friends",
    "Acceptance": "43.1%",
    "Difficulty": "Medium",
    "Frequency": "0.320742934712669",
    "Link": " https://leetcode.com/problems/get-watched-videos-by-your-friends"
  },
  "762": {
    "Name": "Prime Number of Set Bits in Binary Representation",
    "Acceptance": "63.2%",
    "Difficulty": "Easy",
    "Frequency": "0.24779329788232723",
    "Link": " https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation"
  },
  "536": {
    "Name": "Construct Binary Tree from String",
    "Acceptance": "48.3%",
    "Difficulty": "Medium",
    "Frequency": "1.3037077701106166",
    "Link": " https://leetcode.com/problems/construct-binary-tree-from-string"
  },
  "1479": {
    "Name": "Sales by Day of the Week",
    "Acceptance": "83.4%",
    "Difficulty": "Hard",
    "Frequency": "0.1348842676899421",
    "Link": " https://leetcode.com/problems/sales-by-day-of-the-week"
  },
  "890": {
    "Name": "Find and Replace Pattern",
    "Acceptance": "73.4%",
    "Difficulty": "Medium",
    "Frequency": "1.018488356123473",
    "Link": " https://leetcode.com/problems/find-and-replace-pattern"
  },
  "1068": {
    "Name": "Product Sales Analysis I",
    "Acceptance": "83.1%",
    "Difficulty": "Easy",
    "Frequency": "0.11247798342669027",
    "Link": " https://leetcode.com/problems/product-sales-analysis-i"
  },
  "842": {
    "Name": "Split Array into Fibonacci Sequence",
    "Acceptance": "36.3%",
    "Difficulty": "Medium",
    "Frequency": "0.1118483001365689",
    "Link": " https://leetcode.com/problems/split-array-into-fibonacci-sequence"
  },
  "396": {
    "Name": "Rotate Function",
    "Acceptance": "36.3%",
    "Difficulty": "Medium",
    "Frequency": "0.10345133738802471",
    "Link": " https://leetcode.com/problems/rotate-function"
  },
  "661": {
    "Name": "Image Smoother",
    "Acceptance": "51.5%",
    "Difficulty": "Easy",
    "Frequency": "0.21106039931128698",
    "Link": " https://leetcode.com/problems/image-smoother"
  },
  "1337": {
    "Name": "The K Weakest Rows in a Matrix",
    "Acceptance": "68.8%",
    "Difficulty": "Easy",
    "Frequency": "0.06857217312147021",
    "Link": " https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix"
  },
  "1495": {
    "Name": "Friendly Movies Streamed Last Month",
    "Acceptance": "52.6%",
    "Difficulty": "Easy",
    "Frequency": "0.06851994643675606",
    "Link": " https://leetcode.com/problems/friendly-movies-streamed-last-month"
  },
  "1332": {
    "Name": "Remove Palindromic Subsequences",
    "Acceptance": "60.1%",
    "Difficulty": "Easy",
    "Frequency": "0.06581321856957176",
    "Link": " https://leetcode.com/problems/remove-palindromic-subsequences"
  },
  "1251": {
    "Name": "Average Selling Price",
    "Acceptance": "81.6%",
    "Difficulty": "Easy",
    "Frequency": "0.06222847139840936",
    "Link": " https://leetcode.com/problems/average-selling-price"
  },
  "1069": {
    "Name": "Product Sales Analysis II",
    "Acceptance": "82.9%",
    "Difficulty": "Easy",
    "Frequency": "0.06080900459560568",
    "Link": " https://leetcode.com/problems/product-sales-analysis-ii"
  },
  "922": {
    "Name": "Sort Array By Parity II",
    "Acceptance": "69.3%",
    "Difficulty": "Easy",
    "Frequency": "0.057671328304390014",
    "Link": " https://leetcode.com/problems/sort-array-by-parity-ii"
  },
  "1303": {
    "Name": "Find the Team Size",
    "Acceptance": "87.8%",
    "Difficulty": "Easy",
    "Frequency": "0.05155780966485001",
    "Link": " https://leetcode.com/problems/find-the-team-size"
  },
  "1128": {
    "Name": "Number of Equivalent Domino Pairs",
    "Acceptance": "47.3%",
    "Difficulty": "Easy",
    "Frequency": "0.04951506452738057",
    "Link": " https://leetcode.com/problems/number-of-equivalent-domino-pairs"
  },
  "1456": {
    "Name": "Maximum Number of Vowels in a Substring of Given Length",
    "Acceptance": "52.4%",
    "Difficulty": "Medium",
    "Frequency": "0.04220035449037644",
    "Link": " https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length"
  },
  "1511": {
    "Name": "Customer Order Frequency",
    "Acceptance": "76.8%",
    "Difficulty": "Easy",
    "Frequency": "0.0383924310382344",
    "Link": " https://leetcode.com/problems/customer-order-frequency"
  },
  "606": {
    "Name": "Construct String from Binary Tree",
    "Acceptance": "54.1%",
    "Difficulty": "Easy",
    "Frequency": "0.03711000965123125",
    "Link": " https://leetcode.com/problems/construct-string-from-binary-tree"
  },
  "1325": {
    "Name": "Delete Leaves With a Given Value",
    "Acceptance": "73.0%",
    "Difficulty": "Medium",
    "Frequency": "0.07663322602091599",
    "Link": " https://leetcode.com/problems/delete-leaves-with-a-given-value"
  },
  "1351": {
    "Name": "Count Negative Numbers in a Sorted Matrix",
    "Acceptance": "76.5%",
    "Difficulty": "Easy",
    "Frequency": "0.013016779950191773",
    "Link": " https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix"
  },
  "663": {
    "Name": "Equal Tree Partition",
    "Acceptance": "39.5%",
    "Difficulty": "Medium",
    "Frequency": "0.2578291093020998",
    "Link": " https://leetcode.com/problems/equal-tree-partition"
  },
  "537": {
    "Name": "Complex Number Multiplication",
    "Acceptance": "67.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/complex-number-multiplication"
  },
  "553": {
    "Name": "Optimal Division",
    "Acceptance": "56.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/optimal-division"
  },
  "645": {
    "Name": "Set Mismatch",
    "Acceptance": "42.1%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/set-mismatch"
  },
  "738": {
    "Name": "Monotone Increasing Digits",
    "Acceptance": "44.3%",
    "Difficulty": "Medium",
    "Frequency": "0.08479653666007693",
    "Link": " https://leetcode.com/problems/monotone-increasing-digits"
  },
  "776": {
    "Name": "Split BST",
    "Acceptance": "55.8%",
    "Difficulty": "Medium",
    "Frequency": "1.5548904661348721",
    "Link": " https://leetcode.com/problems/split-bst"
  },
  "851": {
    "Name": "Loud and Rich",
    "Acceptance": "51.6%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/loud-and-rich"
  },
  "899": {
    "Name": "Orderly Queue",
    "Acceptance": "52.2%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/orderly-queue"
  },
  "902": {
    "Name": "Numbers At Most N Given Digit Set",
    "Acceptance": "31.5%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/numbers-at-most-n-given-digit-set"
  },
  "1067": {
    "Name": "Digit Count in Range",
    "Acceptance": "40.0%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/digit-count-in-range"
  },
  "1065": {
    "Name": "Index Pairs of a String",
    "Acceptance": "60.7%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/index-pairs-of-a-string"
  },
  "1085": {
    "Name": "Sum of Digits in the Minimum Number",
    "Acceptance": "74.6%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/sum-of-digits-in-the-minimum-number"
  },
  "1118": {
    "Name": "Number of Days in a Month",
    "Acceptance": "57.4%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/number-of-days-in-a-month"
  },
  "1119": {
    "Name": "Remove Vowels from a String",
    "Acceptance": "89.9%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/remove-vowels-from-a-string"
  },
  "1134": {
    "Name": "Armstrong Number",
    "Acceptance": "78.2%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/armstrong-number"
  },
  "1028": {
    "Name": "Recover a Tree From Preorder Traversal",
    "Acceptance": "69.9%",
    "Difficulty": "Hard",
    "Frequency": "0.10734155493596446",
    "Link": " https://leetcode.com/problems/recover-a-tree-from-preorder-traversal"
  },
  "1133": {
    "Name": "Largest Unique Number",
    "Acceptance": "66.8%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/largest-unique-number"
  },
  "1035": {
    "Name": "Uncrossed Lines",
    "Acceptance": "56.1%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/uncrossed-lines"
  },
  "1045": {
    "Name": "Customers Who Bought All Products",
    "Acceptance": "67.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/customers-who-bought-all-products"
  },
  "1050": {
    "Name": "Actors and Directors Who Cooperated At Least Three Times",
    "Acceptance": "71.7%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/actors-and-directors-who-cooperated-at-least-three-times"
  },
  "1054": {
    "Name": "Distant Barcodes",
    "Acceptance": "43.2%",
    "Difficulty": "Medium",
    "Frequency": "0.11855973472455572",
    "Link": " https://leetcode.com/problems/distant-barcodes"
  },
  "1070": {
    "Name": "Product Sales Analysis III",
    "Acceptance": "48.9%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/product-sales-analysis-iii"
  },
  "1080": {
    "Name": "Insufficient Nodes in Root to Leaf Paths",
    "Acceptance": "49.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths"
  },
  "1259": {
    "Name": "Handshakes That Don't Cross",
    "Acceptance": "53.5%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/handshakes-that-dont-cross"
  },
  "1288": {
    "Name": "Remove Covered Intervals",
    "Acceptance": "57.9%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/remove-covered-intervals"
  },
  "1129": {
    "Name": "Shortest Path with Alternating Colors",
    "Acceptance": "38.9%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/shortest-path-with-alternating-colors"
  },
  "1362": {
    "Name": "Closest Divisors",
    "Acceptance": "56.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/closest-divisors"
  },
  "1363": {
    "Name": "Largest Multiple of Three",
    "Acceptance": "33.5%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/largest-multiple-of-three"
  },
  "1175": {
    "Name": "Prime Arrangements",
    "Acceptance": "51.0%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/prime-arrangements"
  },
  "1176": {
    "Name": "Diet Plan Performance",
    "Acceptance": "53.8%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/diet-plan-performance"
  },
  "1255": {
    "Name": "Maximum Score Words Formed by Letters",
    "Acceptance": "69.4%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-score-words-formed-by-letters"
  },
  "1260": {
    "Name": "Shift 2D Grid",
    "Acceptance": "61.4%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/shift-2d-grid"
  },
  "1305": {
    "Name": "All Elements in Two Binary Search Trees",
    "Acceptance": "76.1%",
    "Difficulty": "Medium",
    "Frequency": "0.026282721799194744",
    "Link": " https://leetcode.com/problems/all-elements-in-two-binary-search-trees"
  },
  "1327": {
    "Name": "List the Products Ordered in a Period",
    "Acceptance": "76.4%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/list-the-products-ordered-in-a-period"
  },
  "1350": {
    "Name": "Students With Invalid Departments",
    "Acceptance": "89.5%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/students-with-invalid-departments"
  },
  "1404": {
    "Name": "Number of Steps to Reduce a Number in Binary Representation to One",
    "Acceptance": "50.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one"
  },
  "1408": {
    "Name": "String Matching in an Array",
    "Acceptance": "61.4%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/string-matching-in-an-array"
  },
  "1409": {
    "Name": "Queries on a Permutation With Key",
    "Acceptance": "81.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/queries-on-a-permutation-with-key"
  },
  "1421": {
    "Name": "NPV Queries",
    "Acceptance": "80.6%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/npv-queries"
  },
  "1457": {
    "Name": "Pseudo-Palindromic Paths in a Binary Tree",
    "Acceptance": "67.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree"
  },
  "1489": {
    "Name": "Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree",
    "Acceptance": "50.6%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"
  },
  "1496": {
    "Name": "Path Crossing",
    "Acceptance": "55.9%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/path-crossing"
  },
  "1485": {
    "Name": "Clone Binary Tree With Random Pointer",
    "Acceptance": "81.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/clone-binary-tree-with-random-pointer"
  },
  "1502": {
    "Name": "Can Make Arithmetic Progression From Sequence",
    "Acceptance": "73.3%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence"
  },
  "1490": {
    "Name": "Clone N-ary Tree",
    "Acceptance": "84.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/clone-n-ary-tree"
  },
  "1533": {
    "Name": "Find the Index of the Large Integer",
    "Acceptance": "57.1%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-the-index-of-the-large-integer"
  },
  "1201": {
    "Name": "Ugly Number III",
    "Acceptance": "25.9%",
    "Difficulty": "Medium",
    "Frequency": "0.2586674025861649",
    "Link": " https://leetcode.com/problems/ugly-number-iii"
  },
  "1224": {
    "Name": "Maximum Equal Frequency",
    "Acceptance": "33.5%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-equal-frequency"
  },
  "1521": {
    "Name": "Find a Value of a Mysterious Function Closest to Target",
    "Acceptance": "43.2%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-a-value-of-a-mysterious-function-closest-to-target"
  },
  "1095": {
    "Name": "Find in Mountain Array",
    "Acceptance": "35.8%",
    "Difficulty": "Hard",
    "Frequency": "0.1989185047760601",
    "Link": " https://leetcode.com/problems/find-in-mountain-array"
  },
  "391": {
    "Name": "Perfect Rectangle",
    "Acceptance": "30.5%",
    "Difficulty": "Hard",
    "Frequency": "0.10109611687136877",
    "Link": " https://leetcode.com/problems/perfect-rectangle"
  },
  "1278": {
    "Name": "Palindrome Partitioning III",
    "Acceptance": "59.9%",
    "Difficulty": "Hard",
    "Frequency": "0.17284281283941086",
    "Link": " https://leetcode.com/problems/palindrome-partitioning-iii"
  },
  "821": {
    "Name": "Shortest Distance to a Character",
    "Acceptance": "66.9%",
    "Difficulty": "Easy",
    "Frequency": "0.33395175639587793",
    "Link": " https://leetcode.com/problems/shortest-distance-to-a-character"
  },
  "546": {
    "Name": "Remove Boxes",
    "Acceptance": "42.7%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/remove-boxes"
  },
  "996": {
    "Name": "Number of Squareful Arrays",
    "Acceptance": "47.8%",
    "Difficulty": "Hard",
    "Frequency": "0.28675913745318005",
    "Link": " https://leetcode.com/problems/number-of-squareful-arrays"
  },
  "223": {
    "Name": "Rectangle Area",
    "Acceptance": "37.8%",
    "Difficulty": "Medium",
    "Frequency": "0.10064352577968744",
    "Link": " https://leetcode.com/problems/rectangle-area"
  },
  "837": {
    "Name": "New 21 Game",
    "Acceptance": "34.6%",
    "Difficulty": "Medium",
    "Frequency": "0.09646026618756222",
    "Link": " https://leetcode.com/problems/new-21-game"
  },
  "87": {
    "Name": "Scramble String",
    "Acceptance": "33.7%",
    "Difficulty": "Hard",
    "Frequency": "0.24038535774871578",
    "Link": " https://leetcode.com/problems/scramble-string"
  },
  "193": {
    "Name": "Valid Phone Numbers",
    "Acceptance": "25.3%",
    "Difficulty": "Easy",
    "Frequency": "0.29626581614317243",
    "Link": " https://leetcode.com/problems/valid-phone-numbers"
  },
  "867": {
    "Name": "Transpose Matrix",
    "Acceptance": "62.8%",
    "Difficulty": "Easy",
    "Frequency": "0.031179454774354007",
    "Link": " https://leetcode.com/problems/transpose-matrix"
  },
  "594": {
    "Name": "Longest Harmonious Subsequence",
    "Acceptance": "46.6%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/longest-harmonious-subsequence"
  },
  "256": {
    "Name": "Paint House",
    "Acceptance": "52.1%",
    "Difficulty": "Easy",
    "Frequency": "1.6915174692517947",
    "Link": " https://leetcode.com/problems/paint-house"
  },
  "374": {
    "Name": "Guess Number Higher or Lower",
    "Acceptance": "43.1%",
    "Difficulty": "Easy",
    "Frequency": "0.5030585944283311",
    "Link": " https://leetcode.com/problems/guess-number-higher-or-lower"
  },
  "886": {
    "Name": "Possible Bipartition",
    "Acceptance": "44.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/possible-bipartition"
  },
  "454": {
    "Name": "4Sum II",
    "Acceptance": "53.1%",
    "Difficulty": "Medium",
    "Frequency": "0.1208030670124105",
    "Link": " https://leetcode.com/problems/4sum-ii"
  },
  "479": {
    "Name": "Largest Palindrome Product",
    "Acceptance": "29.0%",
    "Difficulty": "Hard",
    "Frequency": "0.8032907596583713",
    "Link": " https://leetcode.com/problems/largest-palindrome-product"
  },
  "911": {
    "Name": "Online Election",
    "Acceptance": "50.4%",
    "Difficulty": "Medium",
    "Frequency": "2.5785176483169177",
    "Link": " https://leetcode.com/problems/online-election"
  },
  "401": {
    "Name": "Binary Watch",
    "Acceptance": "47.5%",
    "Difficulty": "Easy",
    "Frequency": "2.246794842528927",
    "Link": " https://leetcode.com/problems/binary-watch"
  },
  "470": {
    "Name": "Implement Rand10() Using Rand7()",
    "Acceptance": "46.3%",
    "Difficulty": "Medium",
    "Frequency": "0.7717903078790584",
    "Link": " https://leetcode.com/problems/implement-rand10-using-rand7"
  },
  "282": {
    "Name": "Expression Add Operators",
    "Acceptance": "35.5%",
    "Difficulty": "Hard",
    "Frequency": "0.37930977098051977",
    "Link": " https://leetcode.com/problems/expression-add-operators"
  },
  "907": {
    "Name": "Sum of Subarray Minimums",
    "Acceptance": "32.3%",
    "Difficulty": "Medium",
    "Frequency": "0.08934510033584994",
    "Link": " https://leetcode.com/problems/sum-of-subarray-minimums"
  },
  "530": {
    "Name": "Minimum Absolute Difference in BST",
    "Acceptance": "53.8%",
    "Difficulty": "Easy",
    "Frequency": "0.24715209136621874",
    "Link": " https://leetcode.com/problems/minimum-absolute-difference-in-bst"
  },
  "804": {
    "Name": "Unique Morse Code Words",
    "Acceptance": "77.0%",
    "Difficulty": "Easy",
    "Frequency": "0.7132636772648849",
    "Link": " https://leetcode.com/problems/unique-morse-code-words"
  },
  "326": {
    "Name": "Power of Three",
    "Acceptance": "42.1%",
    "Difficulty": "Easy",
    "Frequency": "0.11585923430189346",
    "Link": " https://leetcode.com/problems/power-of-three"
  },
  "766": {
    "Name": "Toeplitz Matrix",
    "Acceptance": "65.1%",
    "Difficulty": "Easy",
    "Frequency": "2.880131111933709",
    "Link": " https://leetcode.com/problems/toeplitz-matrix"
  },
  "1021": {
    "Name": "Remove Outermost Parentheses",
    "Acceptance": "78.0%",
    "Difficulty": "Easy",
    "Frequency": "0.2893377019690421",
    "Link": " https://leetcode.com/problems/remove-outermost-parentheses"
  },
  "565": {
    "Name": "Array Nesting",
    "Acceptance": "55.5%",
    "Difficulty": "Medium",
    "Frequency": "0.13762137787604775",
    "Link": " https://leetcode.com/problems/array-nesting"
  },
  "1071": {
    "Name": "Greatest Common Divisor of Strings",
    "Acceptance": "52.9%",
    "Difficulty": "Easy",
    "Frequency": "0.4175376893424336",
    "Link": " https://leetcode.com/problems/greatest-common-divisor-of-strings"
  },
  "1366": {
    "Name": "Rank Teams by Votes",
    "Acceptance": "53.8%",
    "Difficulty": "Medium",
    "Frequency": "0.15575452940923282",
    "Link": " https://leetcode.com/problems/rank-teams-by-votes"
  },
  "680": {
    "Name": "Valid Palindrome II",
    "Acceptance": "36.6%",
    "Difficulty": "Easy",
    "Frequency": "0.027583200191427217",
    "Link": " https://leetcode.com/problems/valid-palindrome-ii"
  },
  "1307": {
    "Name": "Verbal Arithmetic Puzzle",
    "Acceptance": "37.7%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/verbal-arithmetic-puzzle"
  },
  "1228": {
    "Name": "Missing Number In Arithmetic Progression",
    "Acceptance": "52.6%",
    "Difficulty": "Easy",
    "Frequency": "0.13219868307194554",
    "Link": " https://leetcode.com/problems/missing-number-in-arithmetic-progression"
  },
  "1200": {
    "Name": "Minimum Absolute Difference",
    "Acceptance": "66.6%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-absolute-difference"
  },
  "488": {
    "Name": "Zuma Game",
    "Acceptance": "39.9%",
    "Difficulty": "Hard",
    "Frequency": "0.3999856423435388",
    "Link": " https://leetcode.com/problems/zuma-game"
  },
  "576": {
    "Name": "Out of Boundary Paths",
    "Acceptance": "35.1%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/out-of-boundary-paths"
  },
  "1396": {
    "Name": "Design Underground System",
    "Acceptance": "64.7%",
    "Difficulty": "Medium",
    "Frequency": "2.7686313817999224",
    "Link": " https://leetcode.com/problems/design-underground-system"
  },
  "1169": {
    "Name": "Invalid Transactions",
    "Acceptance": "31.2%",
    "Difficulty": "Medium",
    "Frequency": "2.1276788037634873",
    "Link": " https://leetcode.com/problems/invalid-transactions"
  },
  "1274": {
    "Name": "Number of Ships in a Rectangle",
    "Acceptance": "66.3%",
    "Difficulty": "Hard",
    "Frequency": "1.6253239794553143",
    "Link": " https://leetcode.com/problems/number-of-ships-in-a-rectangle"
  },
  "1209": {
    "Name": "Remove All Adjacent Duplicates in String II",
    "Acceptance": "56.9%",
    "Difficulty": "Medium",
    "Frequency": "0.02324334737232728",
    "Link": " https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii"
  },
  "723": {
    "Name": "Candy Crush",
    "Acceptance": "69.2%",
    "Difficulty": "Medium",
    "Frequency": "0.1475667107409061",
    "Link": " https://leetcode.com/problems/candy-crush"
  },
  "1472": {
    "Name": "Design Browser History",
    "Acceptance": "64.6%",
    "Difficulty": "Medium",
    "Frequency": "0.5365781198684054",
    "Link": " https://leetcode.com/problems/design-browser-history"
  },
  "422": {
    "Name": "Valid Word Square",
    "Acceptance": "37.7%",
    "Difficulty": "Easy",
    "Frequency": "0.9560140838920023",
    "Link": " https://leetcode.com/problems/valid-word-square"
  },
  "991": {
    "Name": "Broken Calculator",
    "Acceptance": "45.6%",
    "Difficulty": "Medium",
    "Frequency": "0.7270526032311205",
    "Link": " https://leetcode.com/problems/broken-calculator"
  },
  "813": {
    "Name": "Largest Sum of Averages",
    "Acceptance": "49.9%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/largest-sum-of-averages"
  },
  "1297": {
    "Name": "Maximum Number of Occurrences of a Substring",
    "Acceptance": "47.3%",
    "Difficulty": "Medium",
    "Frequency": "0.40882645581086924",
    "Link": " https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring"
  },
  "1347": {
    "Name": "Minimum Number of Steps to Make Two Strings Anagram",
    "Acceptance": "74.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram"
  },
  "1145": {
    "Name": "Binary Tree Coloring Game",
    "Acceptance": "51.2%",
    "Difficulty": "Medium",
    "Frequency": "0.06592172080482424",
    "Link": " https://leetcode.com/problems/binary-tree-coloring-game"
  },
  "1312": {
    "Name": "Minimum Insertion Steps to Make a String Palindrome",
    "Acceptance": "58.1%",
    "Difficulty": "Hard",
    "Frequency": "0.6014387540704463",
    "Link": " https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome"
  },
  "650": {
    "Name": "2 Keys Keyboard",
    "Acceptance": "49.2%",
    "Difficulty": "Medium",
    "Frequency": "0.035910501305770864",
    "Link": " https://leetcode.com/problems/2-keys-keyboard"
  },
  "1123": {
    "Name": "Lowest Common Ancestor of Deepest Leaves",
    "Acceptance": "66.8%",
    "Difficulty": "Medium",
    "Frequency": "0.12035544138590286",
    "Link": " https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves"
  },
  "846": {
    "Name": "Hand of Straights",
    "Acceptance": "54.2%",
    "Difficulty": "Medium",
    "Frequency": "2.8166447091052693",
    "Link": " https://leetcode.com/problems/hand-of-straights"
  },
  "424": {
    "Name": "Longest Repeating Character Replacement",
    "Acceptance": "47.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/longest-repeating-character-replacement"
  },
  "1025": {
    "Name": "Divisor Game",
    "Acceptance": "66.3%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/divisor-game"
  },
  "1480": {
    "Name": "Running Sum of 1d Array",
    "Acceptance": "90.5%",
    "Difficulty": "Easy",
    "Frequency": "0.010437827166841182",
    "Link": " https://leetcode.com/problems/running-sum-of-1d-array"
  },
  "971": {
    "Name": "Flip Binary Tree To Match Preorder Traversal",
    "Acceptance": "45.7%",
    "Difficulty": "Medium",
    "Frequency": "0.1670540846631662",
    "Link": " https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal"
  },
  "510": {
    "Name": "Inorder Successor in BST II",
    "Acceptance": "58.0%",
    "Difficulty": "Medium",
    "Frequency": "0.3274381237537068",
    "Link": " https://leetcode.com/problems/inorder-successor-in-bst-ii"
  },
  "857": {
    "Name": "Minimum Cost to Hire K Workers",
    "Acceptance": "49.6%",
    "Difficulty": "Hard",
    "Frequency": "3.9718459789720417",
    "Link": " https://leetcode.com/problems/minimum-cost-to-hire-k-workers"
  },
  "271": {
    "Name": "Encode and Decode Strings",
    "Acceptance": "31.5%",
    "Difficulty": "Medium",
    "Frequency": "0.07197349962508924",
    "Link": " https://leetcode.com/problems/encode-and-decode-strings"
  },
  "504": {
    "Name": "Base 7",
    "Acceptance": "46.2%",
    "Difficulty": "Easy",
    "Frequency": "0.36260140367638205",
    "Link": " https://leetcode.com/problems/base-7"
  },
  "1105": {
    "Name": "Filling Bookcase Shelves",
    "Acceptance": "58.1%",
    "Difficulty": "Medium",
    "Frequency": "0.06464285626208545",
    "Link": " https://leetcode.com/problems/filling-bookcase-shelves"
  },
  "147": {
    "Name": "Insertion Sort List",
    "Acceptance": "41.1%",
    "Difficulty": "Medium",
    "Frequency": "0.30480732197724425",
    "Link": " https://leetcode.com/problems/insertion-sort-list"
  },
  "513": {
    "Name": "Find Bottom Left Tree Value",
    "Acceptance": "61.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-bottom-left-tree-value"
  },
  "933": {
    "Name": "Number of Recent Calls",
    "Acceptance": "71.9%",
    "Difficulty": "Easy",
    "Frequency": "0.04470017891790688",
    "Link": " https://leetcode.com/problems/number-of-recent-calls"
  },
  "749": {
    "Name": "Contain Virus",
    "Acceptance": "44.6%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/contain-virus"
  },
  "1478": {
    "Name": "Allocate Mailboxes",
    "Acceptance": "54.9%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/allocate-mailboxes"
  },
  "1111": {
    "Name": "Maximum Nesting Depth of Two Valid Parentheses Strings",
    "Acceptance": "70.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings"
  },
  "1034": {
    "Name": "Coloring A Border",
    "Acceptance": "44.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/coloring-a-border"
  },
  "935": {
    "Name": "Knight Dialer",
    "Acceptance": "45.2%",
    "Difficulty": "Medium",
    "Frequency": "0.3429447511268304",
    "Link": " https://leetcode.com/problems/knight-dialer"
  },
  "777": {
    "Name": "Swap Adjacent in LR String",
    "Acceptance": "34.8%",
    "Difficulty": "Medium",
    "Frequency": "3.1073791682365477",
    "Link": " https://leetcode.com/problems/swap-adjacent-in-lr-string"
  },
  "1262": {
    "Name": "Greatest Sum Divisible by Three",
    "Acceptance": "47.6%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/greatest-sum-divisible-by-three"
  },
  "320": {
    "Name": "Generalized Abbreviation",
    "Acceptance": "52.1%",
    "Difficulty": "Medium",
    "Frequency": "2.287272370970718",
    "Link": " https://leetcode.com/problems/generalized-abbreviation"
  },
  "1283": {
    "Name": "Find the Smallest Divisor Given a Threshold",
    "Acceptance": "47.6%",
    "Difficulty": "Medium",
    "Frequency": "0.10450335525513373",
    "Link": " https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold"
  },
  "440": {
    "Name": "K-th Smallest in Lexicographical Order",
    "Acceptance": "29.1%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/k-th-smallest-in-lexicographical-order"
  },
  "1140": {
    "Name": "Stone Game II",
    "Acceptance": "63.3%",
    "Difficulty": "Medium",
    "Frequency": "0.5758202452535439",
    "Link": " https://leetcode.com/problems/stone-game-ii"
  },
  "930": {
    "Name": "Binary Subarrays With Sum",
    "Acceptance": "43.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/binary-subarrays-with-sum"
  },
  "976": {
    "Name": "Largest Perimeter Triangle",
    "Acceptance": "57.6%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/largest-perimeter-triangle"
  },
  "1220": {
    "Name": "Count Vowels Permutation",
    "Acceptance": "54.0%",
    "Difficulty": "Hard",
    "Frequency": "0.6794349186959634",
    "Link": " https://leetcode.com/problems/count-vowels-permutation"
  },
  "1419": {
    "Name": "Minimum Number of Frogs Croaking",
    "Acceptance": "46.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-number-of-frogs-croaking"
  },
  "1390": {
    "Name": "Four Divisors",
    "Acceptance": "38.1%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/four-divisors"
  },
  "1290": {
    "Name": "Convert Binary Number in a Linked List to Integer",
    "Acceptance": "80.4%",
    "Difficulty": "Easy",
    "Frequency": "0.023623145763435913",
    "Link": " https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer"
  },
  "246": {
    "Name": "Strobogrammatic Number",
    "Acceptance": "45.0%",
    "Difficulty": "Easy",
    "Frequency": "3.223628779652069",
    "Link": " https://leetcode.com/problems/strobogrammatic-number"
  },
  "247": {
    "Name": "Strobogrammatic Number II",
    "Acceptance": "47.6%",
    "Difficulty": "Medium",
    "Frequency": "3.2451298570643794",
    "Link": " https://leetcode.com/problems/strobogrammatic-number-ii"
  },
  "829": {
    "Name": "Consecutive Numbers Sum",
    "Acceptance": "37.5%",
    "Difficulty": "Hard",
    "Frequency": "0.05341723749698583",
    "Link": " https://leetcode.com/problems/consecutive-numbers-sum"
  },
  "718": {
    "Name": "Maximum Length of Repeated Subarray",
    "Acceptance": "49.4%",
    "Difficulty": "Medium",
    "Frequency": "0.02699219201435624",
    "Link": " https://leetcode.com/problems/maximum-length-of-repeated-subarray"
  },
  "1515": {
    "Name": "Best Position for a Service Centre",
    "Acceptance": "35.9%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/best-position-for-a-service-centre"
  },
  "761": {
    "Name": "Special Binary String",
    "Acceptance": "54.7%",
    "Difficulty": "Hard",
    "Frequency": "0.3007541540191337",
    "Link": " https://leetcode.com/problems/special-binary-string"
  },
  "697": {
    "Name": "Degree of an Array",
    "Acceptance": "53.8%",
    "Difficulty": "Easy",
    "Frequency": "0.3745732054339119",
    "Link": " https://leetcode.com/problems/degree-of-an-array"
  },
  "1383": {
    "Name": "Maximum Performance of a Team",
    "Acceptance": "31.9%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-performance-of-a-team"
  },
  "476": {
    "Name": "Number Complement",
    "Acceptance": "64.8%",
    "Difficulty": "Easy",
    "Frequency": "0.0620033273052393",
    "Link": " https://leetcode.com/problems/number-complement"
  },
  "1009": {
    "Name": "Complement of Base 10 Integer",
    "Acceptance": "59.6%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/complement-of-base-10-integer"
  },
  "1181": {
    "Name": "Before and After Puzzle",
    "Acceptance": "44.5%",
    "Difficulty": "Medium",
    "Frequency": "5.639540205927847",
    "Link": " https://leetcode.com/problems/before-and-after-puzzle"
  },
  "1330": {
    "Name": "Reverse Subarray To Maximize Array Value",
    "Acceptance": "35.2%",
    "Difficulty": "Hard",
    "Frequency": "0.29849298855599654",
    "Link": " https://leetcode.com/problems/reverse-subarray-to-maximize-array-value"
  },
  "845": {
    "Name": "Longest Mountain in Array",
    "Acceptance": "37.2%",
    "Difficulty": "Medium",
    "Frequency": "0.24328831528748193",
    "Link": " https://leetcode.com/problems/longest-mountain-in-array"
  },
  "1296": {
    "Name": "Divide Array in Sets of K Consecutive Numbers",
    "Acceptance": "53.8%",
    "Difficulty": "Medium",
    "Frequency": "0.7907369966098516",
    "Link": " https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers"
  },
  "920": {
    "Name": "Number of Music Playlists",
    "Acceptance": "46.5%",
    "Difficulty": "Hard",
    "Frequency": "0.5596157879354227",
    "Link": " https://leetcode.com/problems/number-of-music-playlists"
  },
  "780": {
    "Name": "Reaching Points",
    "Acceptance": "29.4%",
    "Difficulty": "Hard",
    "Frequency": "1.277920355988899",
    "Link": " https://leetcode.com/problems/reaching-points"
  },
  "1112": {
    "Name": "Highest Grade For Each Student",
    "Acceptance": "69.5%",
    "Difficulty": "Medium",
    "Frequency": "0.06453852113757116",
    "Link": " https://leetcode.com/problems/highest-grade-for-each-student"
  },
  "945": {
    "Name": "Minimum Increment to Make Array Unique",
    "Acceptance": "46.3%",
    "Difficulty": "Medium",
    "Frequency": "0.27427904232444056",
    "Link": " https://leetcode.com/problems/minimum-increment-to-make-array-unique"
  },
  "1137": {
    "Name": "N-th Tribonacci Number",
    "Acceptance": "55.9%",
    "Difficulty": "Easy",
    "Frequency": "0.02072613051711693",
    "Link": " https://leetcode.com/problems/n-th-tribonacci-number"
  },
  "1258": {
    "Name": "Synonymous Sentences",
    "Acceptance": "64.4%",
    "Difficulty": "Medium",
    "Frequency": "0.6677654778785802",
    "Link": " https://leetcode.com/problems/synonymous-sentences"
  },
  "722": {
    "Name": "Remove Comments",
    "Acceptance": "34.6%",
    "Difficulty": "Medium",
    "Frequency": "0.1529693447814272",
    "Link": " https://leetcode.com/problems/remove-comments"
  },
  "614": {
    "Name": "Second Degree Follower",
    "Acceptance": "30.3%",
    "Difficulty": "Medium",
    "Frequency": "0.7343230947441319",
    "Link": " https://leetcode.com/problems/second-degree-follower"
  },
  "885": {
    "Name": "Spiral Matrix III",
    "Acceptance": "69.4%",
    "Difficulty": "Medium",
    "Frequency": "1.1535711729488671",
    "Link": " https://leetcode.com/problems/spiral-matrix-iii"
  },
  "1358": {
    "Name": "Number of Substrings Containing All Three Characters",
    "Acceptance": "58.2%",
    "Difficulty": "Medium",
    "Frequency": "0.2856959744801515",
    "Link": " https://leetcode.com/problems/number-of-substrings-containing-all-three-characters"
  },
  "1276": {
    "Name": "Number of Burgers with No Waste of Ingredients",
    "Acceptance": "49.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/number-of-burgers-with-no-waste-of-ingredients"
  },
  "364": {
    "Name": "Nested List Weight Sum II",
    "Acceptance": "62.8%",
    "Difficulty": "Medium",
    "Frequency": "5.858903208882962",
    "Link": " https://leetcode.com/problems/nested-list-weight-sum-ii"
  },
  "1293": {
    "Name": "Shortest Path in a Grid with Obstacles Elimination",
    "Acceptance": "42.8%",
    "Difficulty": "Hard",
    "Frequency": "1.3085741032802551",
    "Link": " https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination"
  },
  "1374": {
    "Name": "Generate a String With Characters That Have Odd Counts",
    "Acceptance": "75.4%",
    "Difficulty": "Easy",
    "Frequency": "0.05887900525002278",
    "Link": " https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts"
  },
  "1359": {
    "Name": "Count All Valid Pickup and Delivery Options",
    "Acceptance": "57.9%",
    "Difficulty": "Hard",
    "Frequency": "1.2093743507330705",
    "Link": " https://leetcode.com/problems/count-all-valid-pickup-and-delivery-options"
  },
  "1174": {
    "Name": "Immediate Food Delivery II",
    "Acceptance": "58.5%",
    "Difficulty": "Medium",
    "Frequency": "0.12555653398976382",
    "Link": " https://leetcode.com/problems/immediate-food-delivery-ii"
  },
  "1173": {
    "Name": "Immediate Food Delivery I",
    "Acceptance": "80.4%",
    "Difficulty": "Easy",
    "Frequency": "0.06592172080482424",
    "Link": " https://leetcode.com/problems/immediate-food-delivery-i"
  },
  "757": {
    "Name": "Set Intersection Size At Least Two",
    "Acceptance": "40.1%",
    "Difficulty": "Hard",
    "Frequency": "2.5347203555002196",
    "Link": " https://leetcode.com/problems/set-intersection-size-at-least-two"
  },
  "379": {
    "Name": "Design Phone Directory",
    "Acceptance": "46.8%",
    "Difficulty": "Medium",
    "Frequency": "0.6729444732424258",
    "Link": " https://leetcode.com/problems/design-phone-directory"
  },
  "1178": {
    "Name": "Number of Valid Words for Each Puzzle",
    "Acceptance": "37.8%",
    "Difficulty": "Hard",
    "Frequency": "1.0828639316999706",
    "Link": " https://leetcode.com/problems/number-of-valid-words-for-each-puzzle"
  },
  "928": {
    "Name": "Minimize Malware Spread II",
    "Acceptance": "40.5%",
    "Difficulty": "Hard",
    "Frequency": "1.8341386921969165",
    "Link": " https://leetcode.com/problems/minimize-malware-spread-ii"
  },
  "291": {
    "Name": "Word Pattern II",
    "Acceptance": "43.4%",
    "Difficulty": "Hard",
    "Frequency": "3.0090998629797148",
    "Link": " https://leetcode.com/problems/word-pattern-ii"
  },
  "1001": {
    "Name": "Grid Illumination",
    "Acceptance": "35.9%",
    "Difficulty": "Hard",
    "Frequency": "1.0479685558493548",
    "Link": " https://leetcode.com/problems/grid-illumination"
  },
  "1250": {
    "Name": "Check If It Is a Good Array",
    "Acceptance": "55.7%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/check-if-it-is-a-good-array"
  },
  "968": {
    "Name": "Binary Tree Cameras",
    "Acceptance": "37.5%",
    "Difficulty": "Hard",
    "Frequency": "0.12586422089000404",
    "Link": " https://leetcode.com/problems/binary-tree-cameras"
  },
  "962": {
    "Name": "Maximum Width Ramp",
    "Acceptance": "45.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-width-ramp"
  },
  "1438": {
    "Name": "Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit",
    "Acceptance": "42.1%",
    "Difficulty": "Medium",
    "Frequency": "1.5515720803196904",
    "Link": " https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"
  },
  "868": {
    "Name": "Binary Gap",
    "Acceptance": "60.6%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/binary-gap"
  },
  "1206": {
    "Name": "Design Skiplist",
    "Acceptance": "57.3%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/design-skiplist"
  },
  "306": {
    "Name": "Additive Number",
    "Acceptance": "29.4%",
    "Difficulty": "Medium",
    "Frequency": "0.6788194694611859",
    "Link": " https://leetcode.com/problems/additive-number"
  },
  "1101": {
    "Name": "The Earliest Moment When Everyone Become Friends",
    "Acceptance": "66.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends"
  },
  "1151": {
    "Name": "Minimum Swaps to Group All 1's Together",
    "Acceptance": "59.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together"
  },
  "1328": {
    "Name": "Break a Palindrome",
    "Acceptance": "43.3%",
    "Difficulty": "Medium",
    "Frequency": "0.12838116664820678",
    "Link": " https://leetcode.com/problems/break-a-palindrome"
  },
  "1451": {
    "Name": "Rearrange Words in a Sentence",
    "Acceptance": "54.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/rearrange-words-in-a-sentence"
  },
  "1492": {
    "Name": "The kth Factor of n",
    "Acceptance": "67.9%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/the-kth-factor-of-n"
  },
  "1291": {
    "Name": "Sequential Digits",
    "Acceptance": "53.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/sequential-digits"
  },
  "1428": {
    "Name": "Leftmost Column with at Least a One",
    "Acceptance": "46.8%",
    "Difficulty": "Medium",
    "Frequency": "1.9587705311106522",
    "Link": " https://leetcode.com/problems/leftmost-column-with-at-least-a-one"
  },
  "398": {
    "Name": "Random Pick Index",
    "Acceptance": "56.0%",
    "Difficulty": "Medium",
    "Frequency": "0.04900272661044917",
    "Link": " https://leetcode.com/problems/random-pick-index"
  },
  "689": {
    "Name": "Maximum Sum of 3 Non-Overlapping Subarrays",
    "Acceptance": "46.3%",
    "Difficulty": "Hard",
    "Frequency": "0.3548982185675815",
    "Link": " https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays"
  },
  "896": {
    "Name": "Monotonic Array",
    "Acceptance": "57.9%",
    "Difficulty": "Easy",
    "Frequency": "2.8395358910441173",
    "Link": " https://leetcode.com/problems/monotonic-array"
  },
  "825": {
    "Name": "Friends Of Appropriate Ages",
    "Acceptance": "42.7%",
    "Difficulty": "Medium",
    "Frequency": "2.5148820184509786",
    "Link": " https://leetcode.com/problems/friends-of-appropriate-ages"
  },
  "824": {
    "Name": "Goat Latin",
    "Acceptance": "63.4%",
    "Difficulty": "Easy",
    "Frequency": "0.0317991816929387",
    "Link": " https://leetcode.com/problems/goat-latin"
  },
  "616": {
    "Name": "Add Bold Tag in String",
    "Acceptance": "43.1%",
    "Difficulty": "Medium",
    "Frequency": "0.05421381659414747",
    "Link": " https://leetcode.com/problems/add-bold-tag-in-string"
  },
  "1216": {
    "Name": "Valid Palindrome III",
    "Acceptance": "47.8%",
    "Difficulty": "Hard",
    "Frequency": "0.8187244879431477",
    "Link": " https://leetcode.com/problems/valid-palindrome-iii"
  },
  "157": {
    "Name": "Read N Characters Given Read4",
    "Acceptance": "34.2%",
    "Difficulty": "Easy",
    "Frequency": "2.8620515045754673",
    "Link": " https://leetcode.com/problems/read-n-characters-given-read4"
  },
  "494": {
    "Name": "Target Sum",
    "Acceptance": "46.3%",
    "Difficulty": "Medium",
    "Frequency": "0.04353244473664264",
    "Link": " https://leetcode.com/problems/target-sum"
  },
  "865": {
    "Name": "Smallest Subtree with all the Deepest Nodes",
    "Acceptance": "60.8%",
    "Difficulty": "Medium",
    "Frequency": "1.261481419535249",
    "Link": " https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes"
  },
  "1213": {
    "Name": "Intersection of Three Sorted Arrays",
    "Acceptance": "78.9%",
    "Difficulty": "Easy",
    "Frequency": "0.09643440701660581",
    "Link": " https://leetcode.com/problems/intersection-of-three-sorted-arrays"
  },
  "1269": {
    "Name": "Number of Ways to Stay in the Same Place After Some Steps",
    "Acceptance": "43.2%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps"
  },
  "568": {
    "Name": "Maximum Vacation Days",
    "Acceptance": "40.8%",
    "Difficulty": "Hard",
    "Frequency": "0.4036217896138752",
    "Link": " https://leetcode.com/problems/maximum-vacation-days"
  },
  "934": {
    "Name": "Shortest Bridge",
    "Acceptance": "48.2%",
    "Difficulty": "Medium",
    "Frequency": "0.20666322275821203",
    "Link": " https://leetcode.com/problems/shortest-bridge"
  },
  "408": {
    "Name": "Valid Word Abbreviation",
    "Acceptance": "30.6%",
    "Difficulty": "Easy",
    "Frequency": "0.8465211613190313",
    "Link": " https://leetcode.com/problems/valid-word-abbreviation"
  },
  "400": {
    "Name": "Nth Digit",
    "Acceptance": "31.7%",
    "Difficulty": "Medium",
    "Frequency": "2.1683677508742374",
    "Link": " https://leetcode.com/problems/nth-digit"
  },
  "936": {
    "Name": "Stamping The Sequence",
    "Acceptance": "42.8%",
    "Difficulty": "Hard",
    "Frequency": "0.6737290947028437",
    "Link": " https://leetcode.com/problems/stamping-the-sequence"
  },
  "1424": {
    "Name": "Diagonal Traverse II",
    "Acceptance": "42.4%",
    "Difficulty": "Medium",
    "Frequency": "0.051227589206673384",
    "Link": " https://leetcode.com/problems/diagonal-traverse-ii"
  },
  "676": {
    "Name": "Implement Magic Dictionary",
    "Acceptance": "54.5%",
    "Difficulty": "Medium",
    "Frequency": "0.06995858860691037",
    "Link": " https://leetcode.com/problems/implement-magic-dictionary"
  },
  "730": {
    "Name": "Count Different Palindromic Subsequences",
    "Acceptance": "41.8%",
    "Difficulty": "Hard",
    "Frequency": "0.8032907596583713",
    "Link": " https://leetcode.com/problems/count-different-palindromic-subsequences"
  },
  "1439": {
    "Name": "Find the Kth Smallest Sum of a Matrix With Sorted Rows",
    "Acceptance": "59.5%",
    "Difficulty": "Hard",
    "Frequency": "0.11918851726511835",
    "Link": " https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"
  },
  "405": {
    "Name": "Convert a Number to Hexadecimal",
    "Acceptance": "43.9%",
    "Difficulty": "Easy",
    "Frequency": "0.36886796401660715",
    "Link": " https://leetcode.com/problems/convert-a-number-to-hexadecimal"
  },
  "1053": {
    "Name": "Previous Permutation With One Swap",
    "Acceptance": "48.5%",
    "Difficulty": "Medium",
    "Frequency": "0.20067069546215116",
    "Link": " https://leetcode.com/problems/previous-permutation-with-one-swap"
  },
  "1077": {
    "Name": "Project Employees III",
    "Acceptance": "75.6%",
    "Difficulty": "Medium",
    "Frequency": "0.0907652093142671",
    "Link": " https://leetcode.com/problems/project-employees-iii"
  },
  "1132": {
    "Name": "Reported Posts II",
    "Acceptance": "34.4%",
    "Difficulty": "Medium",
    "Frequency": "0.4643731505984498",
    "Link": " https://leetcode.com/problems/reported-posts-ii"
  },
  "788": {
    "Name": "Rotated Digits",
    "Acceptance": "57.1%",
    "Difficulty": "Easy",
    "Frequency": "0.03980625040041967",
    "Link": " https://leetcode.com/problems/rotated-digits"
  },
  "1113": {
    "Name": "Reported Posts",
    "Acceptance": "64.1%",
    "Difficulty": "Easy",
    "Frequency": "0.8873031950009028",
    "Link": " https://leetcode.com/problems/reported-posts"
  },
  "550": {
    "Name": "Game Play Analysis IV",
    "Acceptance": "45.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/game-play-analysis-iv"
  },
  "1055": {
    "Name": "Shortest Way to Form String",
    "Acceptance": "56.9%",
    "Difficulty": "Medium",
    "Frequency": "3.49457016302794",
    "Link": " https://leetcode.com/problems/shortest-way-to-form-string"
  },
  "778": {
    "Name": "Swim in Rising Water",
    "Acceptance": "53.1%",
    "Difficulty": "Hard",
    "Frequency": "0.5398245209836887",
    "Link": " https://leetcode.com/problems/swim-in-rising-water"
  },
  "491": {
    "Name": "Increasing Subsequences",
    "Acceptance": "46.1%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/increasing-subsequences"
  },
  "597": {
    "Name": "Friend Requests I: Overall Acceptance Rate",
    "Acceptance": "41.0%",
    "Difficulty": "Easy",
    "Frequency": "2.027359179427378",
    "Link": " https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate"
  },
  "593": {
    "Name": "Valid Square",
    "Acceptance": "43.1%",
    "Difficulty": "Medium",
    "Frequency": "2.012428334541107",
    "Link": " https://leetcode.com/problems/valid-square"
  },
  "1498": {
    "Name": "Number of Subsequences That Satisfy the Given Sum Condition",
    "Acceptance": "36.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition"
  },
  "887": {
    "Name": "Super Egg Drop",
    "Acceptance": "27.1%",
    "Difficulty": "Hard",
    "Frequency": "0.7550319038990971",
    "Link": " https://leetcode.com/problems/super-egg-drop"
  },
  "1287": {
    "Name": "Element Appearing More Than 25% In Sorted Array",
    "Acceptance": "60.2%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array"
  },
  "1379": {
    "Name": "Find a Corresponding Node of a Binary Tree in a Clone of That Tree",
    "Acceptance": "83.8%",
    "Difficulty": "Medium",
    "Frequency": "0.10186917331721722",
    "Link": " https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"
  },
  "1528": {
    "Name": "Shuffle String",
    "Acceptance": "86.1%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/shuffle-string"
  },
  "477": {
    "Name": "Total Hamming Distance",
    "Acceptance": "50.4%",
    "Difficulty": "Medium",
    "Frequency": "0.19966567025192705",
    "Link": " https://leetcode.com/problems/total-hamming-distance"
  },
  "248": {
    "Name": "Strobogrammatic Number III",
    "Acceptance": "39.6%",
    "Difficulty": "Hard",
    "Frequency": "3.8637103391787333",
    "Link": " https://leetcode.com/problems/strobogrammatic-number-iii"
  },
  "691": {
    "Name": "Stickers to Spell Word",
    "Acceptance": "42.9%",
    "Difficulty": "Hard",
    "Frequency": "1.614456743546043",
    "Link": " https://leetcode.com/problems/stickers-to-spell-word"
  },
  "308": {
    "Name": "Range Sum Query 2D - Mutable",
    "Acceptance": "35.6%",
    "Difficulty": "Hard",
    "Frequency": "0.24116205681688807",
    "Link": " https://leetcode.com/problems/range-sum-query-2d-mutable"
  },
  "641": {
    "Name": "Design Circular Deque",
    "Acceptance": "52.7%",
    "Difficulty": "Medium",
    "Frequency": "0.29571424414904524",
    "Link": " https://leetcode.com/problems/design-circular-deque"
  },
  "602": {
    "Name": "Friend Requests II: Who Has the Most Friends",
    "Acceptance": "53.4%",
    "Difficulty": "Medium",
    "Frequency": "1.7191182434527041",
    "Link": " https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends"
  },
  "478": {
    "Name": "Generate Random Point in a Circle",
    "Acceptance": "38.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/generate-random-point-in-a-circle"
  },
  "360": {
    "Name": "Sort Transformed Array",
    "Acceptance": "48.8%",
    "Difficulty": "Medium",
    "Frequency": "3.0831372738512024",
    "Link": " https://leetcode.com/problems/sort-transformed-array"
  },
  "848": {
    "Name": "Shifting Letters",
    "Acceptance": "44.6%",
    "Difficulty": "Medium",
    "Frequency": "0.11918851726511835",
    "Link": " https://leetcode.com/problems/shifting-letters"
  },
  "655": {
    "Name": "Print Binary Tree",
    "Acceptance": "55.0%",
    "Difficulty": "Medium",
    "Frequency": "1.9142294173827312",
    "Link": " https://leetcode.com/problems/print-binary-tree"
  },
  "1003": {
    "Name": "Check If Word Is Valid After Substitutions",
    "Acceptance": "55.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/check-if-word-is-valid-after-substitutions"
  },
  "639": {
    "Name": "Decode Ways II",
    "Acceptance": "26.6%",
    "Difficulty": "Hard",
    "Frequency": "0.1599143845440084",
    "Link": " https://leetcode.com/problems/decode-ways-ii"
  },
  "363": {
    "Name": "Max Sum of Rectangle No Larger Than K",
    "Acceptance": "37.3%",
    "Difficulty": "Hard",
    "Frequency": "2.7093314312582586",
    "Link": " https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k"
  },
  "1142": {
    "Name": "User Activity for the Past 30 Days II",
    "Acceptance": "34.5%",
    "Difficulty": "Easy",
    "Frequency": "0.46937947443508493",
    "Link": " https://leetcode.com/problems/user-activity-for-the-past-30-days-ii"
  },
  "832": {
    "Name": "Flipping an Image",
    "Acceptance": "76.2%",
    "Difficulty": "Easy",
    "Frequency": "0.057363394879920204",
    "Link": " https://leetcode.com/problems/flipping-an-image"
  },
  "1264": {
    "Name": "Page Recommendations",
    "Acceptance": "67.6%",
    "Difficulty": "Medium",
    "Frequency": "0.39931124253378614",
    "Link": " https://leetcode.com/problems/page-recommendations"
  },
  "750": {
    "Name": "Number Of Corner Rectangles",
    "Acceptance": "66.4%",
    "Difficulty": "Medium",
    "Frequency": "3.2461546717211958",
    "Link": " https://leetcode.com/problems/number-of-corner-rectangles"
  },
  "578": {
    "Name": "Get Highest Answer Rate Question",
    "Acceptance": "39.3%",
    "Difficulty": "Medium",
    "Frequency": "0.20157261209600713",
    "Link": " https://leetcode.com/problems/get-highest-answer-rate-question"
  },
  "1043": {
    "Name": "Partition Array for Maximum Sum",
    "Acceptance": "65.2%",
    "Difficulty": "Medium",
    "Frequency": "0.13636827395972229",
    "Link": " https://leetcode.com/problems/partition-array-for-maximum-sum"
  },
  "265": {
    "Name": "Paint House II",
    "Acceptance": "44.6%",
    "Difficulty": "Hard",
    "Frequency": "3.643918157363893",
    "Link": " https://leetcode.com/problems/paint-house-ii"
  },
  "1141": {
    "Name": "User Activity for the Past 30 Days I",
    "Acceptance": "54.1%",
    "Difficulty": "Easy",
    "Frequency": "0.09646026618756222",
    "Link": " https://leetcode.com/problems/user-activity-for-the-past-30-days-i"
  },
  "1241": {
    "Name": "Number of Comments per Post",
    "Acceptance": "67.0%",
    "Difficulty": "Easy",
    "Frequency": "0.0891458495182624",
    "Link": " https://leetcode.com/problems/number-of-comments-per-post"
  },
  "1445": {
    "Name": "Apples & Oranges",
    "Acceptance": "87.1%",
    "Difficulty": "Medium",
    "Frequency": "0.05954139369101661",
    "Link": " https://leetcode.com/problems/apples-oranges"
  },
  "275": {
    "Name": "H-Index II",
    "Acceptance": "36.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/h-index-ii"
  },
  "745": {
    "Name": "Prefix and Suffix Search",
    "Acceptance": "34.1%",
    "Difficulty": "Hard",
    "Frequency": "2.161230974688314",
    "Link": " https://leetcode.com/problems/prefix-and-suffix-search"
  },
  "764": {
    "Name": "Largest Plus Sign",
    "Acceptance": "46.0%",
    "Difficulty": "Medium",
    "Frequency": "0.26159729523649006",
    "Link": " https://leetcode.com/problems/largest-plus-sign"
  },
  "893": {
    "Name": "Groups of Special-Equivalent Strings",
    "Acceptance": "66.5%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/groups-of-special-equivalent-strings"
  },
  "989": {
    "Name": "Add to Array-Form of Integer",
    "Acceptance": "44.2%",
    "Difficulty": "Easy",
    "Frequency": "0.07208884919207953",
    "Link": " https://leetcode.com/problems/add-to-array-form-of-integer"
  },
  "998": {
    "Name": "Maximum Binary Tree II",
    "Acceptance": "63.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-binary-tree-ii"
  },
  "1033": {
    "Name": "Moving Stones Until Consecutive",
    "Acceptance": "41.7%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/moving-stones-until-consecutive"
  },
  "1040": {
    "Name": "Moving Stones Until Consecutive II",
    "Acceptance": "52.9%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/moving-stones-until-consecutive-ii"
  },
  "1075": {
    "Name": "Project Employees I",
    "Acceptance": "64.8%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/project-employees-i"
  },
  "1076": {
    "Name": "Project Employees II",
    "Acceptance": "53.7%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/project-employees-ii"
  },
  "1361": {
    "Name": "Validate Binary Tree Nodes",
    "Acceptance": "48.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/validate-binary-tree-nodes"
  },
  "1211": {
    "Name": "Queries Quality and Percentage",
    "Acceptance": "68.3%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/queries-quality-and-percentage"
  },
  "1225": {
    "Name": "Report Contiguous Dates",
    "Acceptance": "61.1%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/report-contiguous-dates"
  },
  "1322": {
    "Name": "Ads Performance",
    "Acceptance": "57.8%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/ads-performance"
  },
  "1357": {
    "Name": "Apply Discount Every n Orders",
    "Acceptance": "66.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/apply-discount-every-n-orders"
  },
  "1398": {
    "Name": "Customers Who Bought Products A and B but Not C",
    "Acceptance": "80.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/customers-who-bought-products-a-and-b-but-not-c"
  },
  "1443": {
    "Name": "Minimum Time to Collect All Apples in a Tree",
    "Acceptance": "55.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-time-to-collect-all-apples-in-a-tree"
  },
  "1460": {
    "Name": "Make Two Arrays Equal by Reversing Sub-arrays",
    "Acceptance": "73.9%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays"
  },
  "1453": {
    "Name": "Maximum Number of Darts Inside of a Circular Dartboard",
    "Acceptance": "33.7%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-number-of-darts-inside-of-a-circular-dartboard"
  },
  "1522": {
    "Name": "Diameter of N-Ary Tree",
    "Acceptance": "70.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/diameter-of-n-ary-tree"
  },
  "888": {
    "Name": "Fair Candy Swap",
    "Acceptance": "58.5%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/fair-candy-swap"
  },
  "967": {
    "Name": "Numbers With Same Consecutive Differences",
    "Acceptance": "39.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/numbers-with-same-consecutive-differences"
  },
  "982": {
    "Name": "Triples with Bitwise AND Equal To Zero",
    "Acceptance": "55.6%",
    "Difficulty": "Hard",
    "Frequency": "0.5596157879354227",
    "Link": " https://leetcode.com/problems/triples-with-bitwise-and-equal-to-zero"
  },
  "1423": {
    "Name": "Maximum Points You Can Obtain from Cards",
    "Acceptance": "42.6%",
    "Difficulty": "Medium",
    "Frequency": "1.2507878542842488",
    "Link": " https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards"
  },
  "828": {
    "Name": "Count Unique Characters of All Substrings of a Given String",
    "Acceptance": "45.2%",
    "Difficulty": "Hard",
    "Frequency": "0.4064583363781751",
    "Link": " https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string"
  },
  "810": {
    "Name": "Chalkboard XOR Game",
    "Acceptance": "48.2%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/chalkboard-xor-game"
  },
  "623": {
    "Name": "Add One Row to Tree",
    "Acceptance": "49.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/add-one-row-to-tree"
  },
  "441": {
    "Name": "Arranging Coins",
    "Acceptance": "41.9%",
    "Difficulty": "Easy",
    "Frequency": "0.08973851726005694",
    "Link": " https://leetcode.com/problems/arranging-coins"
  },
  "1163": {
    "Name": "Last Substring in Lexicographical Order",
    "Acceptance": "33.9%",
    "Difficulty": "Hard",
    "Frequency": "0.11205740891571739",
    "Link": " https://leetcode.com/problems/last-substring-in-lexicographical-order"
  },
  "524": {
    "Name": "Longest Word in Dictionary through Deleting",
    "Acceptance": "48.4%",
    "Difficulty": "Medium",
    "Frequency": "3.072239528663067",
    "Link": " https://leetcode.com/problems/longest-word-in-dictionary-through-deleting"
  },
  "592": {
    "Name": "Fraction Addition and Subtraction",
    "Acceptance": "49.0%",
    "Difficulty": "Medium",
    "Frequency": "2.1852914017256673",
    "Link": " https://leetcode.com/problems/fraction-addition-and-subtraction"
  },
  "1109": {
    "Name": "Corporate Flight Bookings",
    "Acceptance": "52.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/corporate-flight-bookings"
  },
  "1116": {
    "Name": "Print Zero Even Odd",
    "Acceptance": "56.0%",
    "Difficulty": "Medium",
    "Frequency": "0.08934510033584994",
    "Link": " https://leetcode.com/problems/print-zero-even-odd"
  },
  "1427": {
    "Name": "Perform String Shifts",
    "Acceptance": "53.1%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/perform-string-shifts"
  },
  "1088": {
    "Name": "Confusing Number II",
    "Acceptance": "44.0%",
    "Difficulty": "Hard",
    "Frequency": "3.349904087274605",
    "Link": " https://leetcode.com/problems/confusing-number-ii"
  },
  "809": {
    "Name": "Expressive Words",
    "Acceptance": "47.0%",
    "Difficulty": "Medium",
    "Frequency": "3.640135049976496",
    "Link": " https://leetcode.com/problems/expressive-words"
  },
  "659": {
    "Name": "Split Array into Consecutive Subsequences",
    "Acceptance": "43.7%",
    "Difficulty": "Medium",
    "Frequency": "2.5268382051369156",
    "Link": " https://leetcode.com/problems/split-array-into-consecutive-subsequences"
  },
  "1170": {
    "Name": "Compare Strings by Frequency of the Smallest Character",
    "Acceptance": "58.7%",
    "Difficulty": "Easy",
    "Frequency": "0.060901617340111645",
    "Link": " https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character"
  },
  "946": {
    "Name": "Validate Stack Sequences",
    "Acceptance": "61.9%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/validate-stack-sequences"
  },
  "552": {
    "Name": "Student Attendance Record II",
    "Acceptance": "36.7%",
    "Difficulty": "Hard",
    "Frequency": "0.37292635232139065",
    "Link": " https://leetcode.com/problems/student-attendance-record-ii"
  },
  "1231": {
    "Name": "Divide Chocolate",
    "Acceptance": "52.4%",
    "Difficulty": "Hard",
    "Frequency": "3.208270334389882",
    "Link": " https://leetcode.com/problems/divide-chocolate"
  },
  "835": {
    "Name": "Image Overlap",
    "Acceptance": "58.5%",
    "Difficulty": "Medium",
    "Frequency": "2.2640988039628858",
    "Link": " https://leetcode.com/problems/image-overlap"
  },
  "833": {
    "Name": "Find And Replace in String",
    "Acceptance": "50.4%",
    "Difficulty": "Medium",
    "Frequency": "0.1506602748874898",
    "Link": " https://leetcode.com/problems/find-and-replace-in-string"
  },
  "562": {
    "Name": "Longest Line of Consecutive One in Matrix",
    "Acceptance": "45.9%",
    "Difficulty": "Medium",
    "Frequency": "3.145109674628592",
    "Link": " https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix"
  },
  "1240": {
    "Name": "Tiling a Rectangle with the Fewest Squares",
    "Acceptance": "50.1%",
    "Difficulty": "Hard",
    "Frequency": "1.8643301620628905",
    "Link": " https://leetcode.com/problems/tiling-a-rectangle-with-the-fewest-squares"
  },
  "1320": {
    "Name": "Minimum Distance to Type a Word Using Two Fingers",
    "Acceptance": "62.3%",
    "Difficulty": "Hard",
    "Frequency": "1.0722415922055613",
    "Link": " https://leetcode.com/problems/minimum-distance-to-type-a-word-using-two-fingers"
  },
  "753": {
    "Name": "Cracking the Safe",
    "Acceptance": "50.5%",
    "Difficulty": "Hard",
    "Frequency": "4.6997868127589575",
    "Link": " https://leetcode.com/problems/cracking-the-safe"
  },
  "444": {
    "Name": "Sequence Reconstruction",
    "Acceptance": "22.2%",
    "Difficulty": "Medium",
    "Frequency": "2.217786049374021",
    "Link": " https://leetcode.com/problems/sequence-reconstruction"
  },
  "482": {
    "Name": "License Key Formatting",
    "Acceptance": "43.1%",
    "Difficulty": "Easy",
    "Frequency": "0.024799783060416587",
    "Link": " https://leetcode.com/problems/license-key-formatting"
  },
  "774": {
    "Name": "Minimize Max Distance to Gas Station",
    "Acceptance": "46.9%",
    "Difficulty": "Hard",
    "Frequency": "3.708055318619307",
    "Link": " https://leetcode.com/problems/minimize-max-distance-to-gas-station"
  },
  "1368": {
    "Name": "Minimum Cost to Make at Least One Valid Path in a Grid",
    "Acceptance": "54.3%",
    "Difficulty": "Hard",
    "Frequency": "0.6742532311999836",
    "Link": " https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid"
  },
  "1168": {
    "Name": "Optimize Water Distribution in a Village",
    "Acceptance": "60.9%",
    "Difficulty": "Hard",
    "Frequency": "0.24664152258151367",
    "Link": " https://leetcode.com/problems/optimize-water-distribution-in-a-village"
  },
  "1477": {
    "Name": "Find Two Non-overlapping Sub-arrays Each With Target Sum",
    "Acceptance": "30.0%",
    "Difficulty": "Medium",
    "Frequency": "0.6817741903876753",
    "Link": " https://leetcode.com/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum"
  },
  "1376": {
    "Name": "Time Needed to Inform All Employees",
    "Acceptance": "55.4%",
    "Difficulty": "Medium",
    "Frequency": "1.4230632089069797",
    "Link": " https://leetcode.com/problems/time-needed-to-inform-all-employees"
  },
  "1292": {
    "Name": "Maximum Side Length of a Square with Sum Less than or Equal to Threshold",
    "Acceptance": "48.6%",
    "Difficulty": "Medium",
    "Frequency": "0.9555114450274365",
    "Link": " https://leetcode.com/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"
  },
  "914": {
    "Name": "X of a Kind in a Deck of Cards",
    "Acceptance": "35.1%",
    "Difficulty": "Easy",
    "Frequency": "0.8142316388253827",
    "Link": " https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards"
  },
  "1136": {
    "Name": "Parallel Courses",
    "Acceptance": "61.1%",
    "Difficulty": "Hard",
    "Frequency": "0.2858421455297737",
    "Link": " https://leetcode.com/problems/parallel-courses"
  },
  "818": {
    "Name": "Race Car",
    "Acceptance": "39.0%",
    "Difficulty": "Hard",
    "Frequency": "3.164823517729811",
    "Link": " https://leetcode.com/problems/race-car"
  },
  "471": {
    "Name": "Encode String with Shortest Length",
    "Acceptance": "47.1%",
    "Difficulty": "Hard",
    "Frequency": "3.6265326222967382",
    "Link": " https://leetcode.com/problems/encode-string-with-shortest-length"
  },
  "1087": {
    "Name": "Brace Expansion",
    "Acceptance": "62.7%",
    "Difficulty": "Medium",
    "Frequency": "3.0249257901076283",
    "Link": " https://leetcode.com/problems/brace-expansion"
  },
  "1463": {
    "Name": "Cherry Pickup II",
    "Acceptance": "65.7%",
    "Difficulty": "Hard",
    "Frequency": "0.36745148140812023",
    "Link": " https://leetcode.com/problems/cherry-pickup-ii"
  },
  "1345": {
    "Name": "Jump Game IV",
    "Acceptance": "38.0%",
    "Difficulty": "Hard",
    "Frequency": "0.363133899796418",
    "Link": " https://leetcode.com/problems/jump-game-iv"
  },
  "1125": {
    "Name": "Smallest Sufficient Team",
    "Acceptance": "46.6%",
    "Difficulty": "Hard",
    "Frequency": "0.7472144018302211",
    "Link": " https://leetcode.com/problems/smallest-sufficient-team"
  },
  "803": {
    "Name": "Bricks Falling When Hit",
    "Acceptance": "30.8%",
    "Difficulty": "Hard",
    "Frequency": "3.426856541071048",
    "Link": " https://leetcode.com/problems/bricks-falling-when-hit"
  },
  "850": {
    "Name": "Rectangle Area II",
    "Acceptance": "47.5%",
    "Difficulty": "Hard",
    "Frequency": "0.33395175639587793",
    "Link": " https://leetcode.com/problems/rectangle-area-ii"
  },
  "1277": {
    "Name": "Count Square Submatrices with All Ones",
    "Acceptance": "73.3%",
    "Difficulty": "Medium",
    "Frequency": "0.786569729335201",
    "Link": " https://leetcode.com/problems/count-square-submatrices-with-all-ones"
  },
  "1406": {
    "Name": "Stone Game III",
    "Acceptance": "56.1%",
    "Difficulty": "Hard",
    "Frequency": "1.0667370801376608",
    "Link": " https://leetcode.com/problems/stone-game-iii"
  },
  "913": {
    "Name": "Cat and Mouse",
    "Acceptance": "31.3%",
    "Difficulty": "Hard",
    "Frequency": "2.812298987907346",
    "Link": " https://leetcode.com/problems/cat-and-mouse"
  },
  "1056": {
    "Name": "Confusing Number",
    "Acceptance": "48.6%",
    "Difficulty": "Easy",
    "Frequency": "1.3352447017682632",
    "Link": " https://leetcode.com/problems/confusing-number"
  },
  "947": {
    "Name": "Most Stones Removed with Same Row or Column",
    "Acceptance": "55.2%",
    "Difficulty": "Medium",
    "Frequency": "4.02302290047393",
    "Link": " https://leetcode.com/problems/most-stones-removed-with-same-row-or-column"
  },
  "1203": {
    "Name": "Sort Items by Groups Respecting Dependencies",
    "Acceptance": "47.6%",
    "Difficulty": "Hard",
    "Frequency": "0.2711095169699942",
    "Link": " https://leetcode.com/problems/sort-items-by-groups-respecting-dependencies"
  },
  "1265": {
    "Name": "Print Immutable Linked List in Reverse",
    "Acceptance": "94.6%",
    "Difficulty": "Medium",
    "Frequency": "0.6510759666392583",
    "Link": " https://leetcode.com/problems/print-immutable-linked-list-in-reverse"
  },
  "527": {
    "Name": "Word Abbreviation",
    "Acceptance": "54.3%",
    "Difficulty": "Hard",
    "Frequency": "0.48285177172358457",
    "Link": " https://leetcode.com/problems/word-abbreviation"
  },
  "1157": {
    "Name": "Online Majority Element In Subarray",
    "Acceptance": "39.0%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/online-majority-element-in-subarray"
  },
  "551": {
    "Name": "Student Attendance Record I",
    "Acceptance": "46.0%",
    "Difficulty": "Easy",
    "Frequency": "1.013125564623525",
    "Link": " https://leetcode.com/problems/student-attendance-record-i"
  },
  "1444": {
    "Name": "Number of Ways of Cutting a Pizza",
    "Acceptance": "52.8%",
    "Difficulty": "Hard",
    "Frequency": "0.7225130753643099",
    "Link": " https://leetcode.com/problems/number-of-ways-of-cutting-a-pizza"
  },
  "853": {
    "Name": "Car Fleet",
    "Acceptance": "42.3%",
    "Difficulty": "Medium",
    "Frequency": "1.7747066808453358",
    "Link": " https://leetcode.com/problems/car-fleet"
  },
  "1352": {
    "Name": "Product of the Last K Numbers",
    "Acceptance": "43.6%",
    "Difficulty": "Medium",
    "Frequency": "0.9062105990867559",
    "Link": " https://leetcode.com/problems/product-of-the-last-k-numbers"
  },
  "950": {
    "Name": "Reveal Cards In Increasing Order",
    "Acceptance": "74.6%",
    "Difficulty": "Medium",
    "Frequency": "0.056592185311170023",
    "Link": " https://leetcode.com/problems/reveal-cards-in-increasing-order"
  },
  "817": {
    "Name": "Linked List Components",
    "Acceptance": "57.3%",
    "Difficulty": "Medium",
    "Frequency": "1.9517638243067739",
    "Link": " https://leetcode.com/problems/linked-list-components"
  },
  "894": {
    "Name": "All Possible Full Binary Trees",
    "Acceptance": "75.2%",
    "Difficulty": "Medium",
    "Frequency": "0.052436651273043935",
    "Link": " https://leetcode.com/problems/all-possible-full-binary-trees"
  },
  "418": {
    "Name": "Sentence Screen Fitting",
    "Acceptance": "32.6%",
    "Difficulty": "Medium",
    "Frequency": "0.7267557746113953",
    "Link": " https://leetcode.com/problems/sentence-screen-fitting"
  },
  "1131": {
    "Name": "Maximum of Absolute Value Expression",
    "Acceptance": "53.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-of-absolute-value-expression"
  },
  "840": {
    "Name": "Magic Squares In Grid",
    "Acceptance": "37.3%",
    "Difficulty": "Easy",
    "Frequency": "0.7861804130990654",
    "Link": " https://leetcode.com/problems/magic-squares-in-grid"
  },
  "1466": {
    "Name": "Reorder Routes to Make All Paths Lead to the City Zero",
    "Acceptance": "63.5%",
    "Difficulty": "Medium",
    "Frequency": "0.18400364297693944",
    "Link": " https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero"
  },
  "1165": {
    "Name": "Single-Row Keyboard",
    "Acceptance": "84.8%",
    "Difficulty": "Easy",
    "Frequency": "0.6537757969227267",
    "Link": " https://leetcode.com/problems/single-row-keyboard"
  },
  "288": {
    "Name": "Unique Word Abbreviation",
    "Acceptance": "21.9%",
    "Difficulty": "Medium",
    "Frequency": "5.0829330291948045",
    "Link": " https://leetcode.com/problems/unique-word-abbreviation"
  },
  "802": {
    "Name": "Find Eventual Safe States",
    "Acceptance": "48.9%",
    "Difficulty": "Medium",
    "Frequency": "0.7827313001631441",
    "Link": " https://leetcode.com/problems/find-eventual-safe-states"
  },
  "276": {
    "Name": "Paint Fence",
    "Acceptance": "38.3%",
    "Difficulty": "Easy",
    "Frequency": "2.595102395632224",
    "Link": " https://leetcode.com/problems/paint-fence"
  },
  "925": {
    "Name": "Long Pressed Name",
    "Acceptance": "40.5%",
    "Difficulty": "Easy",
    "Frequency": "0.2342881158672749",
    "Link": " https://leetcode.com/problems/long-pressed-name"
  },
  "1218": {
    "Name": "Longest Arithmetic Subsequence of Given Difference",
    "Acceptance": "44.6%",
    "Difficulty": "Medium",
    "Frequency": "0.12344419109112172",
    "Link": " https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference"
  },
  "1504": {
    "Name": "Count Submatrices With All Ones",
    "Acceptance": "61.7%",
    "Difficulty": "Medium",
    "Frequency": "0.41262219631325453",
    "Link": " https://leetcode.com/problems/count-submatrices-with-all-ones"
  },
  "259": {
    "Name": "3Sum Smaller",
    "Acceptance": "47.6%",
    "Difficulty": "Medium",
    "Frequency": "0.18485641239714268",
    "Link": " https://leetcode.com/problems/3sum-smaller"
  },
  "467": {
    "Name": "Unique Substrings in Wraparound String",
    "Acceptance": "35.6%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/unique-substrings-in-wraparound-string"
  },
  "734": {
    "Name": "Sentence Similarity",
    "Acceptance": "42.1%",
    "Difficulty": "Easy",
    "Frequency": "3.6779039500629285",
    "Link": " https://leetcode.com/problems/sentence-similarity"
  },
  "830": {
    "Name": "Positions of Large Groups",
    "Acceptance": "49.6%",
    "Difficulty": "Easy",
    "Frequency": "0.6410496663405119",
    "Link": " https://leetcode.com/problems/positions-of-large-groups"
  },
  "1237": {
    "Name": "Find Positive Integer Solution for a Given Equation",
    "Acceptance": "69.7%",
    "Difficulty": "Easy",
    "Frequency": "0.27239954676797734",
    "Link": " https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation"
  },
  "769": {
    "Name": "Max Chunks To Make Sorted",
    "Acceptance": "54.8%",
    "Difficulty": "Medium",
    "Frequency": "0.14019808398271194",
    "Link": " https://leetcode.com/problems/max-chunks-to-make-sorted"
  },
  "685": {
    "Name": "Redundant Connection II",
    "Acceptance": "32.4%",
    "Difficulty": "Hard",
    "Frequency": "1.8709822647033896",
    "Link": " https://leetcode.com/problems/redundant-connection-ii"
  },
  "630": {
    "Name": "Course Schedule III",
    "Acceptance": "33.5%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/course-schedule-iii"
  },
  "949": {
    "Name": "Largest Time for Given Digits",
    "Acceptance": "35.8%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/largest-time-for-given-digits"
  },
  "941": {
    "Name": "Valid Mountain Array",
    "Acceptance": "33.2%",
    "Difficulty": "Easy",
    "Frequency": "0.011139073683009305",
    "Link": " https://leetcode.com/problems/valid-mountain-array"
  },
  "1313": {
    "Name": "Decompress Run-Length Encoded List",
    "Acceptance": "85.1%",
    "Difficulty": "Easy",
    "Frequency": "0.012088391385967972",
    "Link": " https://leetcode.com/problems/decompress-run-length-encoded-list"
  },
  "1281": {
    "Name": "Subtract the Product and Sum of Digits of an Integer",
    "Acceptance": "85.2%",
    "Difficulty": "Easy",
    "Frequency": "0.4301109053149923",
    "Link": " https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer"
  },
  "1342": {
    "Name": "Number of Steps to Reduce a Number to Zero",
    "Acceptance": "86.3%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero"
  },
  "975": {
    "Name": "Odd Even Jump",
    "Acceptance": "42.2%",
    "Difficulty": "Hard",
    "Frequency": "4.89330238409204",
    "Link": " https://leetcode.com/problems/odd-even-jump"
  },
  "457": {
    "Name": "Circular Array Loop",
    "Acceptance": "29.4%",
    "Difficulty": "Medium",
    "Frequency": "0.4310822724784647",
    "Link": " https://leetcode.com/problems/circular-array-loop"
  },
  "591": {
    "Name": "Tag Validator",
    "Acceptance": "34.3%",
    "Difficulty": "Hard",
    "Frequency": "1.133098464739279",
    "Link": " https://leetcode.com/problems/tag-validator"
  },
  "484": {
    "Name": "Find Permutation",
    "Acceptance": "60.5%",
    "Difficulty": "Medium",
    "Frequency": "2.1230183588789355",
    "Link": " https://leetcode.com/problems/find-permutation"
  },
  "660": {
    "Name": "Remove 9",
    "Acceptance": "53.3%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/remove-9"
  },
  "370": {
    "Name": "Range Addition",
    "Acceptance": "62.8%",
    "Difficulty": "Medium",
    "Frequency": "1.7002175030641622",
    "Link": " https://leetcode.com/problems/range-addition"
  },
  "497": {
    "Name": "Random Point in Non-overlapping Rectangles",
    "Acceptance": "37.8%",
    "Difficulty": "Medium",
    "Frequency": "1.9573306871741878",
    "Link": " https://leetcode.com/problems/random-point-in-non-overlapping-rectangles"
  },
  "799": {
    "Name": "Champagne Tower",
    "Acceptance": "35.8%",
    "Difficulty": "Medium",
    "Frequency": "0.5900175637637866",
    "Link": " https://leetcode.com/problems/champagne-tower"
  },
  "544": {
    "Name": "Output Contest Matches",
    "Acceptance": "75.3%",
    "Difficulty": "Medium",
    "Frequency": "2.9261234488600074",
    "Link": " https://leetcode.com/problems/output-contest-matches"
  },
  "800": {
    "Name": "Similar RGB Color",
    "Acceptance": "61.4%",
    "Difficulty": "Easy",
    "Frequency": "1.8647846042429448",
    "Link": " https://leetcode.com/problems/similar-rgb-color"
  },
  "302": {
    "Name": "Smallest Rectangle Enclosing Black Pixels",
    "Acceptance": "51.6%",
    "Difficulty": "Hard",
    "Frequency": "1.6453853002424126",
    "Link": " https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels"
  },
  "926": {
    "Name": "Flip String to Monotone Increasing",
    "Acceptance": "52.3%",
    "Difficulty": "Medium",
    "Frequency": "0.40755934971127916",
    "Link": " https://leetcode.com/problems/flip-string-to-monotone-increasing"
  },
  "960": {
    "Name": "Delete Columns to Make Sorted III",
    "Acceptance": "53.6%",
    "Difficulty": "Hard",
    "Frequency": "0.33363937353690887",
    "Link": " https://leetcode.com/problems/delete-columns-to-make-sorted-iii"
  },
  "1036": {
    "Name": "Escape a Large Maze",
    "Acceptance": "35.4%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/escape-a-large-maze"
  },
  "499": {
    "Name": "The Maze III",
    "Acceptance": "41.0%",
    "Difficulty": "Hard",
    "Frequency": "1.5441973905656994",
    "Link": " https://leetcode.com/problems/the-maze-iii"
  },
  "531": {
    "Name": "Lonely Pixel I",
    "Acceptance": "59.0%",
    "Difficulty": "Medium",
    "Frequency": "0.49091031406504926",
    "Link": " https://leetcode.com/problems/lonely-pixel-i"
  },
  "464": {
    "Name": "Can I Win",
    "Acceptance": "28.8%",
    "Difficulty": "Medium",
    "Frequency": "1.506328285095676",
    "Link": " https://leetcode.com/problems/can-i-win"
  },
  "940": {
    "Name": "Distinct Subsequences II",
    "Acceptance": "41.5%",
    "Difficulty": "Hard",
    "Frequency": "0.16917873135476025",
    "Link": " https://leetcode.com/problems/distinct-subsequences-ii"
  },
  "318": {
    "Name": "Maximum Product of Word Lengths",
    "Acceptance": "51.2%",
    "Difficulty": "Medium",
    "Frequency": "2.377626415518863",
    "Link": " https://leetcode.com/problems/maximum-product-of-word-lengths"
  },
  "932": {
    "Name": "Beautiful Array",
    "Acceptance": "58.3%",
    "Difficulty": "Medium",
    "Frequency": "1.016168619457035",
    "Link": " https://leetcode.com/problems/beautiful-array"
  },
  "668": {
    "Name": "Kth Smallest Number in Multiplication Table",
    "Acceptance": "45.6%",
    "Difficulty": "Hard",
    "Frequency": "0.4506902061131003",
    "Link": " https://leetcode.com/problems/kth-smallest-number-in-multiplication-table"
  },
  "156": {
    "Name": "Binary Tree Upside Down",
    "Acceptance": "55.0%",
    "Difficulty": "Medium",
    "Frequency": "4.677621857655682",
    "Link": " https://leetcode.com/problems/binary-tree-upside-down"
  },
  "425": {
    "Name": "Word Squares",
    "Acceptance": "47.7%",
    "Difficulty": "Hard",
    "Frequency": "1.3737846439355526",
    "Link": " https://leetcode.com/problems/word-squares"
  },
  "806": {
    "Name": "Number of Lines To Write String",
    "Acceptance": "64.9%",
    "Difficulty": "Easy",
    "Frequency": "0.5626323814748484",
    "Link": " https://leetcode.com/problems/number-of-lines-to-write-string"
  },
  "834": {
    "Name": "Sum of Distances in Tree",
    "Acceptance": "43.7%",
    "Difficulty": "Hard",
    "Frequency": "0.37918622364432397",
    "Link": " https://leetcode.com/problems/sum-of-distances-in-tree"
  },
  "768": {
    "Name": "Max Chunks To Make Sorted II",
    "Acceptance": "48.7%",
    "Difficulty": "Hard",
    "Frequency": "0.22767870647960103",
    "Link": " https://leetcode.com/problems/max-chunks-to-make-sorted-ii"
  },
  "254": {
    "Name": "Factor Combinations",
    "Acceptance": "46.7%",
    "Difficulty": "Medium",
    "Frequency": "0.9907010014908804",
    "Link": " https://leetcode.com/problems/factor-combinations"
  },
  "748": {
    "Name": "Shortest Completing Word",
    "Acceptance": "56.7%",
    "Difficulty": "Easy",
    "Frequency": "0.6677617158657754",
    "Link": " https://leetcode.com/problems/shortest-completing-word"
  },
  "747": {
    "Name": "Largest Number At Least Twice of Others",
    "Acceptance": "42.0%",
    "Difficulty": "Easy",
    "Frequency": "0.23732818630616617",
    "Link": " https://leetcode.com/problems/largest-number-at-least-twice-of-others"
  },
  "917": {
    "Name": "Reverse Only Letters",
    "Acceptance": "58.0%",
    "Difficulty": "Easy",
    "Frequency": "0.0286552557603761",
    "Link": " https://leetcode.com/problems/reverse-only-letters"
  },
  "717": {
    "Name": "1-bit and 2-bit Characters",
    "Acceptance": "48.8%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/1-bit-and-2-bit-characters"
  },
  "294": {
    "Name": "Flip Game II",
    "Acceptance": "50.0%",
    "Difficulty": "Medium",
    "Frequency": "2.87957606515677",
    "Link": " https://leetcode.com/problems/flip-game-ii"
  },
  "293": {
    "Name": "Flip Game",
    "Acceptance": "60.7%",
    "Difficulty": "Easy",
    "Frequency": "2.0049678986989146",
    "Link": " https://leetcode.com/problems/flip-game"
  },
  "411": {
    "Name": "Minimum Unique Word Abbreviation",
    "Acceptance": "36.3%",
    "Difficulty": "Hard",
    "Frequency": "1.843584537092641",
    "Link": " https://leetcode.com/problems/minimum-unique-word-abbreviation"
  },
  "469": {
    "Name": "Convex Polygon",
    "Acceptance": "37.0%",
    "Difficulty": "Medium",
    "Frequency": "1.3618033411115948",
    "Link": " https://leetcode.com/problems/convex-polygon"
  },
  "327": {
    "Name": "Count of Range Sum",
    "Acceptance": "35.2%",
    "Difficulty": "Hard",
    "Frequency": "1.3151273131514118",
    "Link": " https://leetcode.com/problems/count-of-range-sum"
  },
  "760": {
    "Name": "Find Anagram Mappings",
    "Acceptance": "81.1%",
    "Difficulty": "Easy",
    "Frequency": "1.28919687074147",
    "Link": " https://leetcode.com/problems/find-anagram-mappings"
  },
  "1547": {
    "Name": "Minimum Cost to Cut a Stick",
    "Acceptance": "47.2%",
    "Difficulty": "Hard",
    "Frequency": "1.209837923778334",
    "Link": " https://leetcode.com/problems/minimum-cost-to-cut-a-stick"
  },
  "1121": {
    "Name": "Divide Array Into Increasing Sequences",
    "Acceptance": "56.9%",
    "Difficulty": "Hard",
    "Frequency": "0.8873031950009028",
    "Link": " https://leetcode.com/problems/divide-array-into-increasing-sequences"
  },
  "587": {
    "Name": "Erect the Fence",
    "Acceptance": "35.9%",
    "Difficulty": "Hard",
    "Frequency": "0.6234672599219555",
    "Link": " https://leetcode.com/problems/erect-the-fence"
  },
  "790": {
    "Name": "Domino and Tromino Tiling",
    "Acceptance": "39.2%",
    "Difficulty": "Medium",
    "Frequency": "0.3856624808119847",
    "Link": " https://leetcode.com/problems/domino-and-tromino-tiling"
  },
  "859": {
    "Name": "Buddy Strings",
    "Acceptance": "27.4%",
    "Difficulty": "Easy",
    "Frequency": "0.34855697583628487",
    "Link": " https://leetcode.com/problems/buddy-strings"
  },
  "483": {
    "Name": "Smallest Good Base",
    "Acceptance": "35.7%",
    "Difficulty": "Hard",
    "Frequency": "0.3393540829961018",
    "Link": " https://leetcode.com/problems/smallest-good-base"
  },
  "758": {
    "Name": "Bold Words in String",
    "Acceptance": "46.0%",
    "Difficulty": "Easy",
    "Frequency": "0.2835752904991275",
    "Link": " https://leetcode.com/problems/bold-words-in-string"
  },
  "313": {
    "Name": "Super Ugly Number",
    "Acceptance": "45.0%",
    "Difficulty": "Medium",
    "Frequency": "0.22252030417655333",
    "Link": " https://leetcode.com/problems/super-ugly-number"
  },
  "952": {
    "Name": "Largest Component Size by Common Factor",
    "Acceptance": "30.3%",
    "Difficulty": "Hard",
    "Frequency": "0.20692071580732246",
    "Link": " https://leetcode.com/problems/largest-component-size-by-common-factor"
  },
  "1138": {
    "Name": "Alphabet Board Path",
    "Acceptance": "48.4%",
    "Difficulty": "Medium",
    "Frequency": "0.06635853611859671",
    "Link": " https://leetcode.com/problems/alphabet-board-path"
  },
  "1286": {
    "Name": "Iterator for Combination",
    "Acceptance": "68.2%",
    "Difficulty": "Medium",
    "Frequency": "0.1950000150537256",
    "Link": " https://leetcode.com/problems/iterator-for-combination"
  },
  "331": {
    "Name": "Verify Preorder Serialization of a Binary Tree",
    "Acceptance": "40.4%",
    "Difficulty": "Medium",
    "Frequency": "0.17152193955024905",
    "Link": " https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree"
  },
  "330": {
    "Name": "Patching Array",
    "Acceptance": "34.5%",
    "Difficulty": "Hard",
    "Frequency": "0.1670540846631662",
    "Link": " https://leetcode.com/problems/patching-array"
  },
  "1483": {
    "Name": "Kth Ancestor of a Tree Node",
    "Acceptance": "27.6%",
    "Difficulty": "Hard",
    "Frequency": "0.14588927347112293",
    "Link": " https://leetcode.com/problems/kth-ancestor-of-a-tree-node"
  },
  "948": {
    "Name": "Bag of Tokens",
    "Acceptance": "40.8%",
    "Difficulty": "Medium",
    "Frequency": "0.1157359520346586",
    "Link": " https://leetcode.com/problems/bag-of-tokens"
  },
  "812": {
    "Name": "Largest Triangle Area",
    "Acceptance": "58.3%",
    "Difficulty": "Easy",
    "Frequency": "0.11506932978478719",
    "Link": " https://leetcode.com/problems/largest-triangle-area"
  },
  "487": {
    "Name": "Max Consecutive Ones II",
    "Acceptance": "48.5%",
    "Difficulty": "Medium",
    "Frequency": "0.10973238837921641",
    "Link": " https://leetcode.com/problems/max-consecutive-ones-ii"
  },
  "1447": {
    "Name": "Simplified Fractions",
    "Acceptance": "61.0%",
    "Difficulty": "Medium",
    "Frequency": "0.1090999130829226",
    "Link": " https://leetcode.com/problems/simplified-fractions"
  },
  "583": {
    "Name": "Delete Operation for Two Strings",
    "Acceptance": "48.6%",
    "Difficulty": "Medium",
    "Frequency": "0.09510858722224913",
    "Link": " https://leetcode.com/problems/delete-operation-for-two-strings"
  },
  "474": {
    "Name": "Ones and Zeroes",
    "Acceptance": "42.8%",
    "Difficulty": "Medium",
    "Frequency": "0.08829260714567831",
    "Link": " https://leetcode.com/problems/ones-and-zeroes"
  },
  "1300": {
    "Name": "Sum of Mutated Array Closest to Target",
    "Acceptance": "44.2%",
    "Difficulty": "Medium",
    "Frequency": "0.07008120825318372",
    "Link": " https://leetcode.com/problems/sum-of-mutated-array-closest-to-target"
  },
  "357": {
    "Name": "Count Numbers with Unique Digits",
    "Acceptance": "48.4%",
    "Difficulty": "Medium",
    "Frequency": "0.04593229889743518",
    "Link": " https://leetcode.com/problems/count-numbers-with-unique-digits"
  },
  "643": {
    "Name": "Maximum Average Subarray I",
    "Acceptance": "41.5%",
    "Difficulty": "Easy",
    "Frequency": "0.08105244450653293",
    "Link": " https://leetcode.com/problems/maximum-average-subarray-i"
  },
  "1079": {
    "Name": "Letter Tile Possibilities",
    "Acceptance": "75.4%",
    "Difficulty": "Medium",
    "Frequency": "0.07350246199292652",
    "Link": " https://leetcode.com/problems/letter-tile-possibilities"
  },
  "1089": {
    "Name": "Duplicate Zeros",
    "Acceptance": "52.9%",
    "Difficulty": "Easy",
    "Frequency": "0.019397159882735136",
    "Link": " https://leetcode.com/problems/duplicate-zeros"
  },
  "1530": {
    "Name": "Number of Good Leaf Nodes Pairs",
    "Acceptance": "53.6%",
    "Difficulty": "Medium",
    "Frequency": "0.005780362915499436",
    "Link": " https://leetcode.com/problems/number-of-good-leaf-nodes-pairs"
  },
  "644": {
    "Name": "Maximum Average Subarray II",
    "Acceptance": "32.0%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-average-subarray-ii"
  },
  "481": {
    "Name": "Magical String",
    "Acceptance": "47.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/magical-string"
  },
  "506": {
    "Name": "Relative Ranks",
    "Acceptance": "50.5%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/relative-ranks"
  },
  "514": {
    "Name": "Freedom Trail",
    "Acceptance": "43.0%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/freedom-trail"
  },
  "520": {
    "Name": "Detect Capital",
    "Acceptance": "54.2%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/detect-capital"
  },
  "521": {
    "Name": "Longest Uncommon Subsequence I ",
    "Acceptance": "57.6%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/longest-uncommon-subsequence-i"
  },
  "522": {
    "Name": "Longest Uncommon Subsequence II",
    "Acceptance": "34.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/longest-uncommon-subsequence-ii"
  },
  "526": {
    "Name": "Beautiful Arrangement",
    "Acceptance": "57.8%",
    "Difficulty": "Medium",
    "Frequency": "0.995199193294679",
    "Link": " https://leetcode.com/problems/beautiful-arrangement"
  },
  "533": {
    "Name": "Lonely Pixel II",
    "Acceptance": "47.9%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/lonely-pixel-ii"
  },
  "569": {
    "Name": "Median Employee Salary",
    "Acceptance": "57.7%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/median-employee-salary"
  },
  "638": {
    "Name": "Shopping Offers",
    "Acceptance": "51.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/shopping-offers"
  },
  "651": {
    "Name": "4 Keys Keyboard",
    "Acceptance": "52.5%",
    "Difficulty": "Medium",
    "Frequency": "0.8425641237370047",
    "Link": " https://leetcode.com/problems/4-keys-keyboard"
  },
  "656": {
    "Name": "Coin Path",
    "Acceptance": "29.0%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/coin-path"
  },
  "667": {
    "Name": "Beautiful Arrangement II",
    "Acceptance": "54.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/beautiful-arrangement-ii"
  },
  "782": {
    "Name": "Transform to Chessboard",
    "Acceptance": "46.5%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/transform-to-chessboard"
  },
  "789": {
    "Name": "Escape The Ghosts",
    "Acceptance": "57.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/escape-the-ghosts"
  },
  "808": {
    "Name": "Soup Servings",
    "Acceptance": "39.9%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/soup-servings"
  },
  "816": {
    "Name": "Ambiguous Coordinates",
    "Acceptance": "47.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/ambiguous-coordinates"
  },
  "838": {
    "Name": "Push Dominoes",
    "Acceptance": "48.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/push-dominoes"
  },
  "879": {
    "Name": "Profitable Schemes",
    "Acceptance": "39.8%",
    "Difficulty": "Hard",
    "Frequency": "0.5560675878793254",
    "Link": " https://leetcode.com/problems/profitable-schemes"
  },
  "519": {
    "Name": "Random Flip Matrix",
    "Acceptance": "36.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/random-flip-matrix"
  },
  "906": {
    "Name": "Super Palindromes",
    "Acceptance": "32.7%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/super-palindromes"
  },
  "944": {
    "Name": "Delete Columns to Make Sorted",
    "Acceptance": "70.3%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/delete-columns-to-make-sorted"
  },
  "954": {
    "Name": "Array of Doubled Pairs",
    "Acceptance": "35.6%",
    "Difficulty": "Medium",
    "Frequency": "0.20294084399669032",
    "Link": " https://leetcode.com/problems/array-of-doubled-pairs"
  },
  "955": {
    "Name": "Delete Columns to Make Sorted II",
    "Acceptance": "33.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/delete-columns-to-make-sorted-ii"
  },
  "988": {
    "Name": "Smallest String Starting From Leaf",
    "Acceptance": "46.1%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/smallest-string-starting-from-leaf"
  },
  "1012": {
    "Name": "Numbers With Repeated Digits",
    "Acceptance": "37.5%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/numbers-with-repeated-digits"
  },
  "1015": {
    "Name": "Smallest Integer Divisible by K",
    "Acceptance": "32.1%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/smallest-integer-divisible-by-k"
  },
  "1016": {
    "Name": "Binary String With Substrings Representing 1 To N",
    "Acceptance": "58.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/binary-string-with-substrings-representing-1-to-n"
  },
  "1020": {
    "Name": "Number of Enclaves",
    "Acceptance": "57.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/number-of-enclaves"
  },
  "1037": {
    "Name": "Valid Boomerang",
    "Acceptance": "37.9%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/valid-boomerang"
  },
  "1182": {
    "Name": "Shortest Distance to Target Color",
    "Acceptance": "52.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/shortest-distance-to-target-color"
  },
  "1199": {
    "Name": "Minimum Time to Build Blocks",
    "Acceptance": "37.4%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-time-to-build-blocks"
  },
  "1078": {
    "Name": "Occurrences After Bigram",
    "Acceptance": "64.7%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/occurrences-after-bigram"
  },
  "1090": {
    "Name": "Largest Values From Labels",
    "Acceptance": "58.9%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/largest-values-from-labels"
  },
  "1272": {
    "Name": "Remove Interval",
    "Acceptance": "58.6%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/remove-interval"
  },
  "1289": {
    "Name": "Minimum Falling Path Sum II",
    "Acceptance": "60.9%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-falling-path-sum-ii"
  },
  "1314": {
    "Name": "Matrix Block Sum",
    "Acceptance": "73.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/matrix-block-sum"
  },
  "1316": {
    "Name": "Distinct Echo Substrings",
    "Acceptance": "46.4%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/distinct-echo-substrings"
  },
  "1144": {
    "Name": "Decrease Elements To Make Array Zigzag",
    "Acceptance": "45.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/decrease-elements-to-make-array-zigzag"
  },
  "1147": {
    "Name": "Longest Chunked Palindrome Decomposition",
    "Acceptance": "58.6%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/longest-chunked-palindrome-decomposition"
  },
  "1302": {
    "Name": "Deepest Leaves Sum",
    "Acceptance": "83.6%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/deepest-leaves-sum"
  },
  "1331": {
    "Name": "Rank Transform of an Array",
    "Acceptance": "58.0%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/rank-transform-of-an-array"
  },
  "1184": {
    "Name": "Distance Between Bus Stops",
    "Acceptance": "54.5%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/distance-between-bus-stops"
  },
  "1207": {
    "Name": "Unique Number of Occurrences",
    "Acceptance": "71.6%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/unique-number-of-occurrences"
  },
  "1514": {
    "Name": "Path with Maximum Probability",
    "Acceptance": "36.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/path-with-maximum-probability"
  },
  "1261": {
    "Name": "Find Elements in a Contaminated Binary Tree",
    "Acceptance": "74.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree"
  },
  "1346": {
    "Name": "Check If N and Its Double Exist",
    "Acceptance": "37.9%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/check-if-n-and-its-double-exist"
  },
  "1387": {
    "Name": "Sort Integers by The Power Value",
    "Acceptance": "70.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/sort-integers-by-the-power-value"
  },
  "1388": {
    "Name": "Pizza With 3n Slices",
    "Acceptance": "44.7%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/pizza-with-3n-slices"
  },
  "1377": {
    "Name": "Frog Position After T Seconds",
    "Acceptance": "33.6%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/frog-position-after-t-seconds"
  },
  "1401": {
    "Name": "Circle and Rectangle Overlapping",
    "Acceptance": "41.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/circle-and-rectangle-overlapping"
  },
  "1392": {
    "Name": "Longest Happy Prefix",
    "Acceptance": "40.1%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/longest-happy-prefix"
  },
  "1414": {
    "Name": "Find the Minimum Number of Fibonacci Numbers Whose Sum Is K",
    "Acceptance": "63.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"
  },
  "1422": {
    "Name": "Maximum Score After Splitting a String",
    "Acceptance": "54.7%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-score-after-splitting-a-string"
  },
  "1449": {
    "Name": "Form Largest Integer With Digits That Add up to Target",
    "Acceptance": "41.8%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/form-largest-integer-with-digits-that-add-up-to-target"
  },
  "1441": {
    "Name": "Build an Array With Stack Operations",
    "Acceptance": "68.7%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/build-an-array-with-stack-operations"
  },
  "1461": {
    "Name": "Check If a String Contains All Binary Codes of Size K",
    "Acceptance": "44.6%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k"
  },
  "1452": {
    "Name": "People Whose List of Favorite Companies Is Not a Subset of Another List",
    "Acceptance": "53.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"
  },
  "1471": {
    "Name": "The k Strongest Values in an Array",
    "Acceptance": "57.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/the-k-strongest-values-in-an-array"
  },
  "1494": {
    "Name": "Parallel Courses II",
    "Acceptance": "32.0%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/parallel-courses-ii"
  },
  "1482": {
    "Name": "Minimum Number of Days to Make m Bouquets",
    "Acceptance": "45.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets"
  },
  "1488": {
    "Name": "Avoid Flood in The City",
    "Acceptance": "25.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/avoid-flood-in-the-city"
  },
  "1508": {
    "Name": "Range Sum of Sorted Subarray Sums",
    "Acceptance": "68.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/range-sum-of-sorted-subarray-sums"
  },
  "1509": {
    "Name": "Minimum Difference Between Largest and Smallest Value in Three Moves",
    "Acceptance": "51.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves"
  },
  "1499": {
    "Name": "Max Value of Equation",
    "Acceptance": "44.4%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/max-value-of-equation"
  },
  "1503": {
    "Name": "Last Moment Before All Ants Fall Out of a Plank",
    "Acceptance": "51.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/last-moment-before-all-ants-fall-out-of-a-plank"
  },
  "1525": {
    "Name": "Number of Good Ways to Split a String",
    "Acceptance": "69.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/number-of-good-ways-to-split-a-string"
  },
  "1526": {
    "Name": "Minimum Number of Increments on Subarrays to Form a Target Array",
    "Acceptance": "57.7%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array"
  },
  "1513": {
    "Name": "Number of Substrings With Only 1s",
    "Acceptance": "40.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/number-of-substrings-with-only-1s"
  },
  "1546": {
    "Name": "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target",
    "Acceptance": "40.6%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"
  },
  "1506": {
    "Name": "Find Root of N-Ary Tree",
    "Acceptance": "80.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-root-of-n-ary-tree"
  },
  "1516": {
    "Name": "Move Sub-Tree of N-Ary Tree",
    "Acceptance": "60.1%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/move-sub-tree-of-n-ary-tree"
  },
  "1544": {
    "Name": "Make The String Great",
    "Acceptance": "54.4%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/make-the-string-great"
  },
  "1538": {
    "Name": "Guess the Majority in a Hidden Array",
    "Acceptance": "63.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/guess-the-majority-in-a-hidden-array"
  },
  "915": {
    "Name": "Partition Array into Disjoint Intervals",
    "Acceptance": "45.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/partition-array-into-disjoint-intervals"
  },
  "984": {
    "Name": "String Without AAA or BBB",
    "Acceptance": "37.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/string-without-aaa-or-bbb"
  },
  "1253": {
    "Name": "Reconstruct a 2-Row Binary Matrix",
    "Acceptance": "40.4%",
    "Difficulty": "Medium",
    "Frequency": "0.16098937604759944",
    "Link": " https://leetcode.com/problems/reconstruct-a-2-row-binary-matrix"
  },
  "1073": {
    "Name": "Adding Two Negabinary Numbers",
    "Acceptance": "34.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/adding-two-negabinary-numbers"
  },
  "511": {
    "Name": "Game Play Analysis I",
    "Acceptance": "80.8%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/game-play-analysis-i"
  },
  "512": {
    "Name": "Game Play Analysis II",
    "Acceptance": "55.5%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/game-play-analysis-ii"
  },
  "534": {
    "Name": "Game Play Analysis III",
    "Acceptance": "76.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/game-play-analysis-iii"
  },
  "1097": {
    "Name": "Game Play Analysis V",
    "Acceptance": "54.5%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/game-play-analysis-v"
  },
  "696": {
    "Name": "Count Binary Substrings",
    "Acceptance": "56.0%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/count-binary-substrings"
  },
  "1239": {
    "Name": "Maximum Length of a Concatenated String with Unique Characters",
    "Acceptance": "47.8%",
    "Difficulty": "Medium",
    "Frequency": "0.0766985653316095",
    "Link": " https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters"
  },
  "927": {
    "Name": "Three Equal Parts",
    "Acceptance": "33.6%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/three-equal-parts"
  },
  "1323": {
    "Name": "Maximum 69 Number",
    "Acceptance": "77.9%",
    "Difficulty": "Easy",
    "Frequency": "0.01658412801553527",
    "Link": " https://leetcode.com/problems/maximum-69-number"
  },
  "1317": {
    "Name": "Convert Integer to the Sum of Two No-Zero Integers",
    "Acceptance": "56.8%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers"
  },
  "1063": {
    "Name": "Number of Valid Subarrays",
    "Acceptance": "71.1%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/number-of-valid-subarrays"
  },
  "1355": {
    "Name": "Activity Participants",
    "Acceptance": "69.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/activity-participants"
  },
  "861": {
    "Name": "Score After Flipping Matrix",
    "Acceptance": "72.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/score-after-flipping-matrix"
  },
  "563": {
    "Name": "Binary Tree Tilt",
    "Acceptance": "48.7%",
    "Difficulty": "Easy",
    "Frequency": "0.40185220095239377",
    "Link": " https://leetcode.com/problems/binary-tree-tilt"
  },
  "985": {
    "Name": "Sum of Even Numbers After Queries",
    "Acceptance": "61.3%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/sum-of-even-numbers-after-queries"
  },
  "1124": {
    "Name": "Longest Well-Performing Interval",
    "Acceptance": "32.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/longest-well-performing-interval"
  },
  "1540": {
    "Name": "Can Convert String in K Moves",
    "Acceptance": "27.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/can-convert-string-in-k-moves"
  },
  "754": {
    "Name": "Reach a Number",
    "Acceptance": "34.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/reach-a-number"
  },
  "598": {
    "Name": "Range Addition II",
    "Acceptance": "49.6%",
    "Difficulty": "Easy",
    "Frequency": "1.5459245067117746",
    "Link": " https://leetcode.com/problems/range-addition-ii"
  },
  "874": {
    "Name": "Walking Robot Simulation",
    "Acceptance": "35.2%",
    "Difficulty": "Easy",
    "Frequency": "0.09860197680453955",
    "Link": " https://leetcode.com/problems/walking-robot-simulation"
  },
  "1210": {
    "Name": "Minimum Moves to Reach Target with Rotations",
    "Acceptance": "45.2%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-moves-to-reach-target-with-rotations"
  },
  "1042": {
    "Name": "Flower Planting With No Adjacent",
    "Acceptance": "48.5%",
    "Difficulty": "Easy",
    "Frequency": "0.125457954276896",
    "Link": " https://leetcode.com/problems/flower-planting-with-no-adjacent"
  },
  "170": {
    "Name": "Two Sum III - Data structure design",
    "Acceptance": "33.5%",
    "Difficulty": "Easy",
    "Frequency": "5.339976985176443",
    "Link": " https://leetcode.com/problems/two-sum-iii-data-structure-design"
  },
  "744": {
    "Name": "Find Smallest Letter Greater Than Target",
    "Acceptance": "45.4%",
    "Difficulty": "Easy",
    "Frequency": "0.8539612853364241",
    "Link": " https://leetcode.com/problems/find-smallest-letter-greater-than-target"
  },
  "1148": {
    "Name": "Article Views I",
    "Acceptance": "75.8%",
    "Difficulty": "Easy",
    "Frequency": "0.15441568579144338",
    "Link": " https://leetcode.com/problems/article-views-i"
  },
  "245": {
    "Name": "Shortest Word Distance III",
    "Acceptance": "55.3%",
    "Difficulty": "Medium",
    "Frequency": "2.4804776643766675",
    "Link": " https://leetcode.com/problems/shortest-word-distance-iii"
  },
  "633": {
    "Name": "Sum of Square Numbers",
    "Acceptance": "32.2%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/sum-of-square-numbers"
  },
  "1107": {
    "Name": "New Users Daily Count",
    "Acceptance": "45.1%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/new-users-daily-count"
  },
  "1127": {
    "Name": "User Purchase Platform",
    "Acceptance": "48.9%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/user-purchase-platform"
  },
  "1149": {
    "Name": "Article Views II",
    "Acceptance": "48.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/article-views-ii"
  },
  "1343": {
    "Name": "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold",
    "Acceptance": "64.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"
  },
  "575": {
    "Name": "Distribute Candies",
    "Acceptance": "61.4%",
    "Difficulty": "Easy",
    "Frequency": "0.030890487019338404",
    "Link": " https://leetcode.com/problems/distribute-candies"
  },
  "1336": {
    "Name": "Number of Transactions per Visit",
    "Acceptance": "43.7%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/number-of-transactions-per-visit"
  },
  "255": {
    "Name": "Verify Preorder Sequence in Binary Search Tree",
    "Acceptance": "45.7%",
    "Difficulty": "Medium",
    "Frequency": "0.1348842676899421",
    "Link": " https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree"
  },
  "500": {
    "Name": "Keyboard Row",
    "Acceptance": "64.7%",
    "Difficulty": "Easy",
    "Frequency": "0.9589833161754686",
    "Link": " https://leetcode.com/problems/keyboard-row"
  },
  "566": {
    "Name": "Reshape the Matrix",
    "Acceptance": "60.5%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/reshape-the-matrix"
  },
  "1222": {
    "Name": "Queens That Can Attack the King",
    "Acceptance": "68.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/queens-that-can-attack-the-king"
  },
  "1246": {
    "Name": "Palindrome Removal",
    "Acceptance": "46.0%",
    "Difficulty": "Hard",
    "Frequency": "0.875792939010168",
    "Link": " https://leetcode.com/problems/palindrome-removal"
  },
  "1156": {
    "Name": "Swap For Longest Repeated Character Substring",
    "Acceptance": "49.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/swap-for-longest-repeated-character-substring"
  },
  "1185": {
    "Name": "Day of the Week",
    "Acceptance": "64.0%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/day-of-the-week"
  },
  "431": {
    "Name": "Encode N-ary Tree to Binary Tree",
    "Acceptance": "70.8%",
    "Difficulty": "Hard",
    "Frequency": "0.3308542443169896",
    "Link": " https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree"
  },
  "1381": {
    "Name": "Design a Stack With Increment Operation",
    "Acceptance": "74.7%",
    "Difficulty": "Medium",
    "Frequency": "0.1453140980267603",
    "Link": " https://leetcode.com/problems/design-a-stack-with-increment-operation"
  },
  "612": {
    "Name": "Shortest Distance in a Plane",
    "Acceptance": "59.5%",
    "Difficulty": "Medium",
    "Frequency": "0.1271551754852466",
    "Link": " https://leetcode.com/problems/shortest-distance-in-a-plane"
  },
  "1386": {
    "Name": "Cinema Seat Allocation",
    "Acceptance": "34.8%",
    "Difficulty": "Medium",
    "Frequency": "0.10648348040245009",
    "Link": " https://leetcode.com/problems/cinema-seat-allocation"
  },
  "1324": {
    "Name": "Print Words Vertically",
    "Acceptance": "57.9%",
    "Difficulty": "Medium",
    "Frequency": "0.09055957704572704",
    "Link": " https://leetcode.com/problems/print-words-vertically"
  },
  "1092": {
    "Name": "Shortest Common Supersequence ",
    "Acceptance": "51.6%",
    "Difficulty": "Hard",
    "Frequency": "0.053488684950986194",
    "Link": " https://leetcode.com/problems/shortest-common-supersequence"
  },
  "672": {
    "Name": "Bulb Switcher II",
    "Acceptance": "50.9%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/bulb-switcher-ii"
  },
  "972": {
    "Name": "Equal Rational Numbers",
    "Acceptance": "41.6%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/equal-rational-numbers"
  },
  "1006": {
    "Name": "Clumsy Factorial",
    "Acceptance": "53.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/clumsy-factorial"
  },
  "1093": {
    "Name": "Statistics from a Large Sample",
    "Acceptance": "48.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/statistics-from-a-large-sample"
  },
  "1273": {
    "Name": "Delete Tree Nodes",
    "Acceptance": "63.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/delete-tree-nodes"
  },
  "1285": {
    "Name": "Find the Start and End Number of Continuous Ranges",
    "Acceptance": "83.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-the-start-and-end-number-of-continuous-ranges"
  },
  "1306": {
    "Name": "Jump Game III",
    "Acceptance": "60.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/jump-game-iii"
  },
  "1318": {
    "Name": "Minimum Flips to Make a OR b Equal to c",
    "Acceptance": "62.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c"
  },
  "1371": {
    "Name": "Find the Longest Substring Containing Vowels in Even Counts",
    "Acceptance": "58.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts"
  },
  "1369": {
    "Name": "Get the Second Most Recent Activity",
    "Acceptance": "65.1%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/get-the-second-most-recent-activity"
  },
  "1394": {
    "Name": "Find Lucky Integer in an Array",
    "Acceptance": "64.4%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-lucky-integer-in-an-array"
  },
  "1415": {
    "Name": "The k-th Lexicographical String of All Happy Strings of Length n",
    "Acceptance": "70.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"
  },
  "1417": {
    "Name": "Reformat The String",
    "Acceptance": "55.0%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/reformat-the-string"
  },
  "1448": {
    "Name": "Count Good Nodes in Binary Tree",
    "Acceptance": "70.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/count-good-nodes-in-binary-tree"
  },
  "1458": {
    "Name": "Max Dot Product of Two Subsequences",
    "Acceptance": "41.7%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/max-dot-product-of-two-subsequences"
  },
  "1469": {
    "Name": "Find All The Lonely Nodes",
    "Acceptance": "81.4%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-all-the-lonely-nodes"
  },
  "1510": {
    "Name": "Stone Game IV",
    "Acceptance": "50.3%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/stone-game-iv"
  },
  "1474": {
    "Name": "Delete N Nodes After M Nodes of a Linked List",
    "Acceptance": "74.2%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list"
  },
  "1523": {
    "Name": "Count Odd Numbers in an Interval Range",
    "Acceptance": "55.8%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/count-odd-numbers-in-an-interval-range"
  },
  "1518": {
    "Name": "Water Bottles",
    "Acceptance": "63.1%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/water-bottles"
  },
  "1539": {
    "Name": "Kth Missing Positive Number",
    "Acceptance": "52.3%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/kth-missing-positive-number"
  },
  "1227": {
    "Name": "Airplane Seat Assignment Probability",
    "Acceptance": "61.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/airplane-seat-assignment-probability"
  },
  "1217": {
    "Name": "Play with Chips",
    "Acceptance": "64.2%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/play-with-chips"
  },
  "880": {
    "Name": "Decoded String at Index",
    "Acceptance": "24.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/decoded-string-at-index"
  },
  "664": {
    "Name": "Strange Printer",
    "Acceptance": "40.2%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/strange-printer"
  },
  "577": {
    "Name": "Employee Bonus",
    "Acceptance": "68.2%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/employee-bonus"
  },
  "1491": {
    "Name": "Average Salary Excluding the Minimum and Maximum Salary",
    "Acceptance": "70.3%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary"
  },
  "1052": {
    "Name": "Grumpy Bookstore Owner",
    "Acceptance": "55.4%",
    "Difficulty": "Medium",
    "Frequency": "0.8402346949345842",
    "Link": " https://leetcode.com/problems/grumpy-bookstore-owner"
  },
  "1212": {
    "Name": "Team Scores in Football Tournament",
    "Acceptance": "55.8%",
    "Difficulty": "Medium",
    "Frequency": "1.1574169741354225",
    "Link": " https://leetcode.com/problems/team-scores-in-football-tournament"
  },
  "599": {
    "Name": "Minimum Index Sum of Two Lists",
    "Acceptance": "50.7%",
    "Difficulty": "Easy",
    "Frequency": "2.30819311902822",
    "Link": " https://leetcode.com/problems/minimum-index-sum-of-two-lists"
  },
  "1380": {
    "Name": "Lucky Numbers in a Matrix",
    "Acceptance": "71.5%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/lucky-numbers-in-a-matrix"
  },
  "1410": {
    "Name": "HTML Entity Parser",
    "Acceptance": "54.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/html-entity-parser"
  },
  "1232": {
    "Name": "Check If It Is a Straight Line",
    "Acceptance": "45.3%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/check-if-it-is-a-straight-line"
  },
  "1473": {
    "Name": "Paint House III",
    "Acceptance": "48.1%",
    "Difficulty": "Hard",
    "Frequency": "0.6775218626568644",
    "Link": " https://leetcode.com/problems/paint-house-iii"
  },
  "1497": {
    "Name": "Check If Array Pairs Are Divisible by k",
    "Acceptance": "41.1%",
    "Difficulty": "Medium",
    "Frequency": "0.30887395064431883",
    "Link": " https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k"
  },
  "571": {
    "Name": "Find Median Given Frequency of Numbers",
    "Acceptance": "44.7%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-median-given-frequency-of-numbers"
  },
  "600": {
    "Name": "Non-negative Integers without Consecutive Ones",
    "Acceptance": "34.1%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/non-negative-integers-without-consecutive-ones"
  },
  "1294": {
    "Name": "Weather Type in Each Country",
    "Acceptance": "63.1%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/weather-type-in-each-country"
  },
  "1321": {
    "Name": "Restaurant Growth",
    "Acceptance": "67.9%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/restaurant-growth"
  },
  "1378": {
    "Name": "Replace Employee ID With The Unique Identifier",
    "Acceptance": "87.6%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/replace-employee-id-with-the-unique-identifier"
  },
  "1407": {
    "Name": "Top Travellers",
    "Acceptance": "82.1%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/top-travellers"
  },
  "1440": {
    "Name": "Evaluate Boolean Expression",
    "Acceptance": "70.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/evaluate-boolean-expression"
  },
  "786": {
    "Name": "K-th Smallest Prime Fraction",
    "Acceptance": "41.0%",
    "Difficulty": "Hard",
    "Frequency": "0.2608348224155929",
    "Link": " https://leetcode.com/problems/k-th-smallest-prime-fraction"
  },
  "1159": {
    "Name": "Market Analysis II",
    "Acceptance": "52.9%",
    "Difficulty": "Hard",
    "Frequency": "0.15535044001916237",
    "Link": " https://leetcode.com/problems/market-analysis-ii"
  },
  "1158": {
    "Name": "Market Analysis I",
    "Acceptance": "61.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/market-analysis-i"
  },
  "1183": {
    "Name": "Maximum Number of Ones",
    "Acceptance": "54.5%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-number-of-ones"
  },
  "1309": {
    "Name": "Decrypt String from Alphabet to Integer Mapping",
    "Acceptance": "76.8%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping"
  },
  "1329": {
    "Name": "Sort the Matrix Diagonally",
    "Acceptance": "78.4%",
    "Difficulty": "Medium",
    "Frequency": "0.14787032803970862",
    "Link": " https://leetcode.com/problems/sort-the-matrix-diagonally"
  },
  "923": {
    "Name": "3Sum With Multiplicity",
    "Acceptance": "35.7%",
    "Difficulty": "Medium",
    "Frequency": "3.6540779400095724",
    "Link": " https://leetcode.com/problems/3sum-with-multiplicity"
  },
  "1256": {
    "Name": "Encode Number",
    "Acceptance": "66.1%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/encode-number"
  },
  "1295": {
    "Name": "Find Numbers with Even Number of Digits",
    "Acceptance": "81.5%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-numbers-with-even-number-of-digits"
  },
  "1354": {
    "Name": "Construct Target Array With Multiple Sums",
    "Acceptance": "31.9%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/construct-target-array-with-multiple-sums"
  },
  "495": {
    "Name": "Teemo Attacking",
    "Acceptance": "53.6%",
    "Difficulty": "Medium",
    "Frequency": "0.08934510033584994",
    "Link": " https://leetcode.com/problems/teemo-attacking"
  },
  "1391": {
    "Name": "Check if There is a Valid Path in a Grid",
    "Acceptance": "44.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/check-if-there-is-a-valid-path-in-a-grid"
  },
  "1393": {
    "Name": "Capital Gain/Loss",
    "Acceptance": "89.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/capital-gainloss"
  },
  "1282": {
    "Name": "Group the People Given the Group Size They Belong To",
    "Acceptance": "83.9%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to"
  },
  "1280": {
    "Name": "Students and Examinations",
    "Acceptance": "72.2%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/students-and-examinations"
  },
  "1364": {
    "Name": "Number of Trusted Contacts of a Customer",
    "Acceptance": "75.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/number-of-trusted-contacts-of-a-customer"
  },
  "1150": {
    "Name": "Check If a Number Is Majority Element in a Sorted Array",
    "Acceptance": "59.2%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array"
  },
  "1301": {
    "Name": "Number of Paths with Max Score",
    "Acceptance": "37.3%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/number-of-paths-with-max-score"
  },
  "1464": {
    "Name": "Maximum Product of Two Elements in an Array",
    "Acceptance": "78.1%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array"
  },
  "1519": {
    "Name": "Number of Nodes in the Sub-Tree With the Same Label",
    "Acceptance": "35.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/number-of-nodes-in-the-sub-tree-with-the-same-label"
  },
  "1349": {
    "Name": "Maximum Students Taking Exam",
    "Acceptance": "42.0%",
    "Difficulty": "Hard",
    "Frequency": "0.290115411660895",
    "Link": " https://leetcode.com/problems/maximum-students-taking-exam"
  },
  "1341": {
    "Name": "Movie Rating",
    "Acceptance": "56.6%",
    "Difficulty": "Medium",
    "Frequency": "0.20386340056870947",
    "Link": " https://leetcode.com/problems/movie-rating"
  },
  "891": {
    "Name": "Sum of Subsequence Widths",
    "Acceptance": "31.9%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/sum-of-subsequence-widths"
  },
  "439": {
    "Name": "Ternary Expression Parser",
    "Acceptance": "55.9%",
    "Difficulty": "Medium",
    "Frequency": "0.5705448584676129",
    "Link": " https://leetcode.com/problems/ternary-expression-parser"
  },
  "964": {
    "Name": "Least Operators to Express Number",
    "Acceptance": "43.8%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/least-operators-to-express-number"
  },
  "999": {
    "Name": "Available Captures for Rook",
    "Acceptance": "66.7%",
    "Difficulty": "Easy",
    "Frequency": "0.4868470419092762",
    "Link": " https://leetcode.com/problems/available-captures-for-rook"
  },
  "573": {
    "Name": "Squirrel Simulation",
    "Acceptance": "55.6%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/squirrel-simulation"
  },
  "990": {
    "Name": "Satisfiability of Equality Equations",
    "Acceptance": "45.0%",
    "Difficulty": "Medium",
    "Frequency": "0.14565275315686743",
    "Link": " https://leetcode.com/problems/satisfiability-of-equality-equations"
  },
  "625": {
    "Name": "Minimum Factorization",
    "Acceptance": "32.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-factorization"
  },
  "1189": {
    "Name": "Maximum Number of Balloons",
    "Acceptance": "61.2%",
    "Difficulty": "Easy",
    "Frequency": "0.11874571021547974",
    "Link": " https://leetcode.com/problems/maximum-number-of-balloons"
  },
  "1208": {
    "Name": "Get Equal Substrings Within Budget",
    "Acceptance": "41.9%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/get-equal-substrings-within-budget"
  },
  "712": {
    "Name": "Minimum ASCII Delete Sum for Two Strings",
    "Acceptance": "58.5%",
    "Difficulty": "Medium",
    "Frequency": "0.7008055099863686",
    "Link": " https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings"
  },
  "1534": {
    "Name": "Count Good Triplets",
    "Acceptance": "79.6%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/count-good-triplets"
  },
  "1507": {
    "Name": "Reformat Date",
    "Acceptance": "60.5%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/reformat-date"
  },
  "1230": {
    "Name": "Toss Strange Coins",
    "Acceptance": "48.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/toss-strange-coins"
  },
  "1435": {
    "Name": "Create a Session Bar Chart",
    "Acceptance": "76.9%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/create-a-session-bar-chart"
  },
  "1500": {
    "Name": "Design a File Sharing System",
    "Acceptance": "45.8%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/design-a-file-sharing-system"
  },
  "608": {
    "Name": "Tree Node",
    "Acceptance": "67.1%",
    "Difficulty": "Medium",
    "Frequency": "1.204906947317733",
    "Link": " https://leetcode.com/problems/tree-node"
  },
  "585": {
    "Name": "Investments in 2016",
    "Acceptance": "54.7%",
    "Difficulty": "Medium",
    "Frequency": "0.9249487946172696",
    "Link": " https://leetcode.com/problems/investments-in-2016"
  },
  "831": {
    "Name": "Masking Personal Information",
    "Acceptance": "44.1%",
    "Difficulty": "Medium",
    "Frequency": "0.5705448584676129",
    "Link": " https://leetcode.com/problems/masking-personal-information"
  },
  "580": {
    "Name": "Count Student Number in Departments",
    "Acceptance": "48.7%",
    "Difficulty": "Medium",
    "Frequency": "0.487438691067837",
    "Link": " https://leetcode.com/problems/count-student-number-in-departments"
  },
  "1348": {
    "Name": "Tweet Counts Per Frequency",
    "Acceptance": "29.0%",
    "Difficulty": "Medium",
    "Frequency": "0.25131442828090605",
    "Link": " https://leetcode.com/problems/tweet-counts-per-frequency"
  },
  "1459": {
    "Name": "Rectangles Area",
    "Acceptance": "61.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/rectangles-area"
  },
  "342": {
    "Name": "Power of Four",
    "Acceptance": "41.6%",
    "Difficulty": "Easy",
    "Frequency": "0.5106053351870626",
    "Link": " https://leetcode.com/problems/power-of-four"
  },
  "1186": {
    "Name": "Maximum Subarray Sum with One Deletion",
    "Acceptance": "37.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-subarray-sum-with-one-deletion"
  },
  "959": {
    "Name": "Regions Cut By Slashes",
    "Acceptance": "66.2%",
    "Difficulty": "Medium",
    "Frequency": "0.1507867227152846",
    "Link": " https://leetcode.com/problems/regions-cut-by-slashes"
  },
  "1171": {
    "Name": "Remove Zero Sum Consecutive Nodes from Linked List",
    "Acceptance": "41.4%",
    "Difficulty": "Medium",
    "Frequency": "0.06025919151819684",
    "Link": " https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list"
  },
  "648": {
    "Name": "Replace Words",
    "Acceptance": "56.6%",
    "Difficulty": "Medium",
    "Frequency": "0.051162052179868224",
    "Link": " https://leetcode.com/problems/replace-words"
  },
  "1385": {
    "Name": "Find the Distance Value Between Two Arrays",
    "Acceptance": "67.0%",
    "Difficulty": "Easy",
    "Frequency": "0.04668292188270772",
    "Link": " https://leetcode.com/problems/find-the-distance-value-between-two-arrays"
  },
  "1064": {
    "Name": "Fixed Point",
    "Acceptance": "66.5%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/fixed-point"
  },
  "1039": {
    "Name": "Minimum Score Triangulation of Polygon",
    "Acceptance": "49.1%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/minimum-score-triangulation-of-polygon"
  },
  "1334": {
    "Name": "Find the City With the Smallest Number of Neighbors at a Threshold Distance",
    "Acceptance": "44.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"
  },
  "1400": {
    "Name": "Construct K Palindrome Strings",
    "Acceptance": "60.4%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/construct-k-palindrome-strings"
  },
  "1462": {
    "Name": "Course Schedule IV",
    "Acceptance": "41.9%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/course-schedule-iv"
  },
  "1437": {
    "Name": "Check If All 1's Are at Least Length K Places Away",
    "Acceptance": "63.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away"
  },
  "649": {
    "Name": "Dota2 Senate",
    "Acceptance": "39.2%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/dota2-senate"
  },
  "1271": {
    "Name": "Hexspeak",
    "Acceptance": "54.2%",
    "Difficulty": "Easy",
    "Frequency": "0.7407752295491999",
    "Link": " https://leetcode.com/problems/hexspeak"
  },
  "1243": {
    "Name": "Array Transformation",
    "Acceptance": "51.1%",
    "Difficulty": "Easy",
    "Frequency": "0.9978075895461441",
    "Link": " https://leetcode.com/problems/array-transformation"
  },
  "1180": {
    "Name": "Count Substrings with Only One Distinct Letter",
    "Acceptance": "77.0%",
    "Difficulty": "Easy",
    "Frequency": "0.7095409903356217",
    "Link": " https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter"
  },
  "1196": {
    "Name": "How Many Apples Can You Put into the Basket",
    "Acceptance": "67.9%",
    "Difficulty": "Easy",
    "Frequency": "0.668121812993005",
    "Link": " https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket"
  },
  "1353": {
    "Name": "Maximum Number of Events That Can Be Attended",
    "Acceptance": "30.5%",
    "Difficulty": "Medium",
    "Frequency": "0.29912265485367395",
    "Link": " https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended"
  },
  "1389": {
    "Name": "Create Target Array in the Given Order",
    "Acceptance": "84.2%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/create-target-array-in-the-given-order"
  },
  "1238": {
    "Name": "Circular Permutation in Binary Representation",
    "Acceptance": "65.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/circular-permutation-in-binary-representation"
  },
  "1204": {
    "Name": "Last Person to Fit in the Elevator",
    "Acceptance": "69.8%",
    "Difficulty": "Medium",
    "Frequency": "0.3042113744029915",
    "Link": " https://leetcode.com/problems/last-person-to-fit-in-the-elevator"
  },
  "1194": {
    "Name": "Tournament Winners",
    "Acceptance": "52.9%",
    "Difficulty": "Hard",
    "Frequency": "0.4149438520627081",
    "Link": " https://leetcode.com/problems/tournament-winners"
  },
  "1014": {
    "Name": "Best Sightseeing Pair",
    "Acceptance": "52.5%",
    "Difficulty": "Medium",
    "Frequency": "0.0903548750399561",
    "Link": " https://leetcode.com/problems/best-sightseeing-pair"
  },
  "1193": {
    "Name": "Monthly Transactions I",
    "Acceptance": "68.3%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/monthly-transactions-i"
  },
  "781": {
    "Name": "Rabbits in Forest",
    "Acceptance": "54.5%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/rabbits-in-forest"
  },
  "1205": {
    "Name": "Monthly Transactions II",
    "Acceptance": "45.0%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/monthly-transactions-ii"
  },
  "629": {
    "Name": "K Inverse Pairs Array",
    "Acceptance": "31.1%",
    "Difficulty": "Hard",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/k-inverse-pairs-array"
  },
  "624": {
    "Name": "Maximum Distance in Arrays",
    "Acceptance": "38.9%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/maximum-distance-in-arrays"
  },
  "693": {
    "Name": "Binary Number with Alternating Bits",
    "Acceptance": "59.4%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/binary-number-with-alternating-bits"
  },
  "1030": {
    "Name": "Matrix Cells in Distance Order",
    "Acceptance": "65.6%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/matrix-cells-in-distance-order"
  },
  "1493": {
    "Name": "Longest Subarray of 1's After Deleting One Element",
    "Acceptance": "59.7%",
    "Difficulty": "Medium",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element"
  },
  "1126": {
    "Name": "Active Businesses",
    "Acceptance": "68.5%",
    "Difficulty": "Medium",
    "Frequency": "0.3208150073042144",
    "Link": " https://leetcode.com/problems/active-businesses"
  },
  "1333": {
    "Name": "Filter Restaurants by Vegan-Friendly",
    "Acceptance": " Price and Distance",
    "Difficulty": "54.6%",
    "Frequency": "Medium",
    "Link": "0.263911853117869",
    "null": [
      " https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance"
    ]
  },
  "1436": {
    "Name": "Destination City",
    "Acceptance": "77.3%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/destination-city"
  },
  "1455": {
    "Name": "Check If a Word Occurs As a Prefix of Any Word in a Sentence",
    "Acceptance": "64.6%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"
  },
  "1154": {
    "Name": "Day of the Year",
    "Acceptance": "49.3%",
    "Difficulty": "Easy",
    "Frequency": "0",
    "Link": " https://leetcode.com/problems/day-of-the-year"
  }
}