Skip to content

Instantly share code, notes, and snippets.

@athulmurali

athulmurali/Amazon_q.json

Last active July 11, 2019 22:56
Show Gist options
  • Save athulmurali/c77866aef5e146da3384b92433bcad7a to your computer and use it in GitHub Desktop.
Save athulmurali/c77866aef5e146da3384b92433bcad7a to your computer and use it in GitHub Desktop.
Download ZIP
Amazon_questions
Raw
Amazon_q.json
{
"Amazon": [
[
"1",
"Two Sum",
"44.3%",
"Easy"
],
[
"2",
"Add Two Numbers",
"31.3%",
"Medium"
],
[
"3",
"Longest Substring Without Repeating Characters",
"28.5%",
"Medium"
],
[
"4",
"Median of Two Sorted Arrays",
"26.6%",
"Hard"
],
[
"5",
"Longest Palindromic Substring",
"27.5%",
"Medium"
],
[
"6",
"ZigZag Conversion",
"32.3%",
"Medium"
],
[
"7",
"Reverse Integer",
"25.4%",
"Easy"
],
[
"8",
"String to Integer (atoi)",
"14.7%",
"Medium"
],
[
"9",
"Palindrome Number",
"43.8%",
"Easy"
],
[
"10",
"Regular Expression Matching",
"25.4%",
"Hard"
],
[
"11",
"Container With Most Water",
"45.2%",
"Medium"
],
[
"12",
"Integer to Roman",
"51.3%",
"Medium"
],
[
"13",
"Roman to Integer",
"52.7%",
"Easy"
],
[
"14",
"Longest Common Prefix",
"33.7%",
"Easy"
],
[
"15",
"3Sum",
"24.2%",
"Medium"
],
[
"16",
"3Sum Closest",
"45.8%",
"Medium"
],
[
"17",
"Letter Combinations of a Phone Number",
"42.0%",
"Medium"
],
[
"18",
"4Sum",
"30.9%",
"Medium"
],
[
"19",
"Remove Nth Node From End of List",
"34.4%",
"Medium"
],
[
"20",
"Valid Parentheses",
"36.8%",
"Easy"
],
[
"21",
"Merge Two Sorted Lists",
"47.8%",
"Easy"
],
[
"22",
"Generate Parentheses",
"55.6%",
"Medium"
],
[
"23",
"Merge k Sorted Lists",
"35.0%",
"Hard"
],
[
"24",
"Swap Nodes in Pairs",
"45.2%",
"Medium"
],
[
"25",
"Reverse Nodes in k-Group",
"36.9%",
"Hard"
],
[
"26",
"Remove Duplicates from Sorted Array",
"41.1%",
"Easy"
],
[
"27",
"Remove Element",
"44.9%",
"Easy"
],
[
"28",
"Implement strStr()",
"32.3%",
"Easy"
],
[
"30",
"Substring with Concatenation of All Words",
"23.8%",
"Hard"
],
[
"31",
"Next Permutation",
"30.7%",
"Medium"
],
[
"32",
"Longest Valid Parentheses",
"25.7%",
"Hard"
],
[
"33",
"Search in Rotated Sorted Array",
"33.0%",
"Medium"
],
[
"34",
"Find First and Last Position of Element in Sorted Array",
"33.8%",
"Medium"
],
[
"35",
"Search Insert Position",
"41.0%",
"Easy"
],
[
"36",
"Valid Sudoku",
"43.6%",
"Medium"
],
[
"37",
"Sudoku Solver",
"37.5%",
"Hard"
],
[
"39",
"Combination Sum",
"49.2%",
"Medium"
],
[
"40",
"Combination Sum II",
"42.2%",
"Medium"
],
[
"41",
"First Missing Positive",
"29.1%",
"Hard"
],
[
"42",
"Trapping Rain Water",
"43.6%",
"Hard"
],
[
"44",
"Wildcard Matching",
"23.0%",
"Hard"
],
[
"45",
"Jump Game II",
"28.3%",
"Hard"
],
[
"46",
"Permutations",
"55.9%",
"Medium"
],
[
"47",
"Permutations II",
"41.0%",
"Medium"
],
[
"48",
"Rotate Image",
"49.2%",
"Medium"
],
[
"49",
"Group Anagrams",
"47.5%",
"Medium"
],
[
"50",
"Pow(x, n)",
"28.2%",
"Medium"
],
[
"51",
"N-Queens",
"39.9%",
"Hard"
],
[
"53",
"Maximum Subarray",
"43.9%",
"Easy"
],
[
"54",
"Spiral Matrix",
"30.7%",
"Medium"
],
[
"55",
"Jump Game",
"32.1%",
"Medium"
],
[
"56",
"Merge Intervals",
"35.9%",
"Medium"
],
[
"57",
"Insert Interval",
"31.4%",
"Hard"
],
[
"59",
"Spiral Matrix II",
"47.1%",
"Medium"
],
[
"60",
"Permutation Sequence",
"33.4%",
"Medium"
],
[
"61",
"Rotate List",
"27.4%",
"Medium"
],
[
"62",
"Unique Paths",
"48.0%",
"Medium"
],
[
"63",
"Unique Paths II",
"33.5%",
"Medium"
],
[
"64",
"Minimum Path Sum",
"47.4%",
"Medium"
],
[
"65",
"Valid Number",
"14.1%",
"Hard"
],
[
"66",
"Plus One",
"41.4%",
"Easy"
],
[
"67",
"Add Binary",
"39.6%",
"Easy"
],
[
"68",
"Text Justification",
"23.6%",
"Hard"
],
[
"69",
"Sqrt(x)",
"31.6%",
"Easy"
],
[
"70",
"Climbing Stairs",
"44.4%",
"Easy"
],
[
"71",
"Simplify Path",
"29.0%",
"Medium"
],
[
"72",
"Edit Distance",
"38.2%",
"Hard"
],
[
"74",
"Search a 2D Matrix",
"35.0%",
"Medium"
],
[
"75",
"Sort Colors",
"42.5%",
"Medium"
],
[
"76",
"Minimum Window Substring",
"31.2%",
"Hard"
],
[
"77",
"Combinations",
"48.3%",
"Medium"
],
[
"78",
"Subsets",
"53.5%",
"Medium"
],
[
"79",
"Word Search",
"31.6%",
"Medium"
],
[
"81",
"Search in Rotated Sorted Array II",
"32.7%",
"Medium"
],
[
"83",
"Remove Duplicates from Sorted List",
"42.9%",
"Easy"
],
[
"84",
"Largest Rectangle in Histogram",
"31.5%",
"Hard"
],
[
"85",
"Maximal Rectangle",
"33.7%",
"Hard"
],
[
"86",
"Partition List",
"37.6%",
"Medium"
],
[
"88",
"Merge Sorted Array",
"36.1%",
"Easy"
],
[
"90",
"Subsets II",
"42.8%",
"Medium"
],
[
"91",
"Decode Ways",
"22.5%",
"Medium"
],
[
"92",
"Reverse Linked List II",
"35.3%",
"Medium"
],
[
"93",
"Restore IP Addresses",
"31.8%",
"Medium"
],
[
"94",
"Binary Tree Inorder Traversal",
"57.2%",
"Medium"
],
[
"95",
"Unique Binary Search Trees II",
"36.1%",
"Medium"
],
[
"96",
"Unique Binary Search Trees",
"46.7%",
"Medium"
],
[
"97",
"Interleaving String",
"28.3%",
"Hard"
],
[
"98",
"Validate Binary Search Tree",
"25.9%",
"Medium"
],
[
"99",
"Recover Binary Search Tree",
"35.0%",
"Hard"
],
[
"100",
"Same Tree",
"50.2%",
"Easy"
],
[
"101",
"Symmetric Tree",
"43.7%",
"Easy"
],
[
"102",
"Binary Tree Level Order Traversal",
"49.0%",
"Medium"
],
[
"103",
"Binary Tree Zigzag Level Order Traversal",
"42.2%",
"Medium"
],
[
"104",
"Maximum Depth of Binary Tree",
"61.0%",
"Easy"
],
[
"105",
"Construct Binary Tree from Preorder and Inorder Traversal",
"41.7%",
"Medium"
],
[
"106",
"Construct Binary Tree from Inorder and Postorder Traversal",
"39.8%",
"Medium"
],
[
"108",
"Convert Sorted Array to Binary Search Tree",
"51.3%",
"Easy"
],
[
"110",
"Balanced Binary Tree",
"41.2%",
"Easy"
],
[
"111",
"Minimum Depth of Binary Tree",
"35.5%",
"Easy"
],
[
"112",
"Path Sum",
"38.1%",
"Easy"
],
[
"113",
"Path Sum II",
"41.1%",
"Medium"
],
[
"114",
"Flatten Binary Tree to Linked List",
"42.9%",
"Medium"
],
[
"115",
"Distinct Subsequences",
"35.3%",
"Hard"
],
[
"116",
"Populating Next Right Pointers in Each Node",
"38.3%",
"Medium"
],
[
"117",
"Populating Next Right Pointers in Each Node II",
"34.7%",
"Medium"
],
[
"118",
"Pascal's Triangle",
"46.6%",
"Easy"
],
[
"120",
"Triangle",
"39.8%",
"Medium"
],
[
"121",
"Best Time to Buy and Sell Stock",
"47.6%",
"Easy"
],
[
"122",
"Best Time to Buy and Sell Stock II",
"52.3%",
"Easy"
],
[
"124",
"Binary Tree Maximum Path Sum",
"30.3%",
"Hard"
],
[
"125",
"Valid Palindrome",
"31.5%",
"Easy"
],
[
"126",
"Word Ladder II",
"18.0%",
"Hard"
],
[
"127",
"Word Ladder",
"24.5%",
"Medium"
],
[
"128",
"Longest Consecutive Sequence",
"42.0%",
"Hard"
],
[
"129",
"Sum Root to Leaf Numbers",
"42.9%",
"Medium"
],
[
"131",
"Palindrome Partitioning",
"41.4%",
"Medium"
],
[
"133",
"Clone Graph",
"27.0%",
"Medium"
],
[
"134",
"Gas Station",
"34.2%",
"Medium"
],
[
"135",
"Candy",
"28.7%",
"Hard"
],
[
"136",
"Single Number",
"60.6%",
"Easy"
],
[
"137",
"Single Number II",
"46.3%",
"Medium"
],
[
"138",
"Copy List with Random Pointer",
"27.6%",
"Medium"
],
[
"139",
"Word Break",
"35.7%",
"Medium"
],
[
"140",
"Word Break II",
"27.6%",
"Hard"
],
[
"141",
"Linked List Cycle",
"37.3%",
"Easy"
],
[
"142",
"Linked List Cycle II",
"32.5%",
"Medium"
],
[
"143",
"Reorder List",
"31.3%",
"Medium"
],
[
"145",
"Binary Tree Postorder Traversal",
"49.0%",
"Hard"
],
[
"146",
"LRU Cache",
"26.0%",
"Medium"
],
[
"148",
"Sort List",
"35.9%",
"Medium"
],
[
"149",
"Max Points on a Line",
"15.9%",
"Hard"
],
[
"150",
"Evaluate Reverse Polish Notation",
"32.5%",
"Medium"
],
[
"151",
"Reverse Words in a String",
"17.1%",
"Medium"
],
[
"152",
"Maximum Product Subarray",
"29.5%",
"Medium"
],
[
"153",
"Find Minimum in Rotated Sorted Array",
"43.1%",
"Medium"
],
[
"155",
"Min Stack",
"37.6%",
"Easy"
],
[
"159",
"Longest Substring with At Most Two Distinct Characters",
"47.3%",
"Hard"
],
[
"160",
"Intersection of Two Linked Lists",
"34.4%",
"Easy"
],
[
"161",
"One Edit Distance",
"31.7%",
"Medium"
],
[
"162",
"Find Peak Element",
"41.4%",
"Medium"
],
[
"164",
"Maximum Gap",
"32.8%",
"Hard"
],
[
"165",
"Compare Version Numbers",
"23.9%",
"Medium"
],
[
"167",
"Two Sum II - Input array is sorted",
"50.7%",
"Easy"
],
[
"169",
"Majority Element",
"53.1%",
"Easy"
],
[
"171",
"Excel Sheet Column Number",
"51.8%",
"Easy"
],
[
"173",
"Binary Search Tree Iterator",
"49.2%",
"Medium"
],
[
"175",
"Combine Two Tables",
"52.6%",
"Easy"
],
[
"176",
"Second Highest Salary",
"27.6%",
"Easy"
],
[
"177",
"Nth Highest Salary",
"26.7%",
"Medium"
],
[
"178",
"Rank Scores",
"37.2%",
"Medium"
],
[
"179",
"Largest Number",
"26.0%",
"Medium"
],
[
"183",
"Customers Who Never Order",
"45.5%",
"Easy"
],
[
"185",
"Department Top Three Salaries",
"26.6%",
"Hard"
],
[
"188",
"Best Time to Buy and Sell Stock IV",
"26.5%",
"Hard"
],
[
"189",
"Rotate Array",
"30.5%",
"Easy"
],
[
"190",
"Reverse Bits",
"31.8%",
"Easy"
],
[
"193",
"Valid Phone Numbers",
"25.3%",
"Easy"
],
[
"198",
"House Robber",
"41.1%",
"Easy"
],
[
"199",
"Binary Tree Right Side View",
"48.4%",
"Medium"
],
[
"200",
"Number of Islands",
"41.9%",
"Medium"
],
[
"203",
"Remove Linked List Elements",
"36.0%",
"Easy"
],
[
"204",
"Count Primes",
"29.3%",
"Easy"
],
[
"205",
"Isomorphic Strings",
"37.6%",
"Easy"
],
[
"206",
"Reverse Linked List",
"55.4%",
"Easy"
],
[
"207",
"Course Schedule",
"38.2%",
"Medium"
],
[
"208",
"Implement Trie (Prefix Tree)",
"39.1%",
"Medium"
],
[
"210",
"Course Schedule II",
"35.3%",
"Medium"
],
[
"211",
"Add and Search Word - Data structure design",
"30.7%",
"Medium"
],
[
"212",
"Word Search II",
"29.1%",
"Hard"
],
[
"215",
"Kth Largest Element in an Array",
"48.4%",
"Medium"
],
[
"217",
"Contains Duplicate",
"52.4%",
"Easy"
],
[
"218",
"The Skyline Problem",
"31.9%",
"Hard"
],
[
"221",
"Maximal Square",
"33.3%",
"Medium"
],
[
"222",
"Count Complete Tree Nodes",
"34.5%",
"Medium"
],
[
"223",
"Rectangle Area",
"36.0%",
"Medium"
],
[
"224",
"Basic Calculator",
"33.1%",
"Hard"
],
[
"225",
"Implement Stack using Queues",
"39.7%",
"Easy"
],
[
"226",
"Invert Binary Tree",
"58.6%",
"Easy"
],
[
"227",
"Basic Calculator II",
"33.7%",
"Medium"
],
[
"228",
"Summary Ranges",
"36.2%",
"Medium"
],
[
"229",
"Majority Element II",
"32.4%",
"Medium"
],
[
"230",
"Kth Smallest Element in a BST",
"52.0%",
"Medium"
],
[
"231",
"Power of Two",
"42.1%",
"Easy"
],
[
"232",
"Implement Queue using Stacks",
"43.8%",
"Easy"
],
[
"234",
"Palindrome Linked List",
"36.4%",
"Easy"
],
[
"235",
"Lowest Common Ancestor of a Binary Search Tree",
"45.1%",
"Easy"
],
[
"236",
"Lowest Common Ancestor of a Binary Tree",
"38.0%",
"Medium"
],
[
"238",
"Product of Array Except Self",
"55.5%",
"Medium"
],
[
"239",
"Sliding Window Maximum",
"38.5%",
"Hard"
],
[
"240",
"Search a 2D Matrix II",
"41.0%",
"Medium"
],
[
"242",
"Valid Anagram",
"52.6%",
"Easy"
],
[
"250",
"Count Univalue Subtrees",
"49.2%",
"Medium"
],
[
"252",
"Meeting Rooms",
"52.3%",
"Easy"
],
[
"253",
"Meeting Rooms II",
"43.1%",
"Medium"
],
[
"257",
"Binary Tree Paths",
"46.4%",
"Easy"
],
[
"261",
"Graph Valid Tree",
"40.1%",
"Medium"
],
[
"264",
"Ugly Number II",
"36.7%",
"Medium"
],
[
"266",
"Palindrome Permutation",
"60.2%",
"Easy"
],
[
"267",
"Palindrome Permutation II",
"33.9%",
"Medium"
],
[
"268",
"Missing Number",
"48.7%",
"Easy"
],
[
"269",
"Alien Dictionary",
"31.3%",
"Hard"
],
[
"270",
"Closest Binary Search Tree Value",
"44.0%",
"Easy"
],
[
"272",
"Closest Binary Search Tree Value II",
"45.4%",
"Hard"
],
[
"273",
"Integer to English Words",
"24.5%",
"Hard"
],
[
"277",
"Find the Celebrity",
"37.2%",
"Medium"
],
[
"279",
"Perfect Squares",
"42.3%",
"Medium"
],
[
"283",
"Move Zeroes",
"54.6%",
"Easy"
],
[
"284",
"Peeking Iterator",
"40.9%",
"Medium"
],
[
"285",
"Inorder Successor in BST",
"35.1%",
"Medium"
],
[
"286",
"Walls and Gates",
"49.8%",
"Medium"
],
[
"287",
"Find the Duplicate Number",
"50.0%",
"Medium"
],
[
"289",
"Game of Life",
"46.0%",
"Medium"
],
[
"290",
"Word Pattern",
"35.2%",
"Easy"
],
[
"295",
"Find Median from Data Stream",
"37.2%",
"Hard"
],
[
"297",
"Serialize and Deserialize Binary Tree",
"41.4%",
"Hard"
],
[
"298",
"Binary Tree Longest Consecutive Sequence",
"44.2%",
"Medium"
],
[
"299",
"Bulls and Cows",
"39.8%",
"Medium"
],
[
"300",
"Longest Increasing Subsequence",
"41.0%",
"Medium"
],
[
"301",
"Remove Invalid Parentheses",
"39.5%",
"Hard"
],
[
"304",
"Range Sum Query 2D - Immutable",
"32.7%",
"Medium"
],
[
"309",
"Best Time to Buy and Sell Stock with Cooldown",
"44.2%",
"Medium"
],
[
"312",
"Burst Balloons",
"47.6%",
"Hard"
],
[
"314",
"Binary Tree Vertical Order Traversal",
"41.2%",
"Medium"
],
[
"315",
"Count of Smaller Numbers After Self",
"38.5%",
"Hard"
],
[
"316",
"Remove Duplicate Letters",
"32.9%",
"Hard"
],
[
"322",
"Coin Change",
"30.9%",
"Medium"
],
[
"323",
"Number of Connected Components in an Undirected Graph",
"52.3%",
"Medium"
],
[
"325",
"Maximum Size Subarray Sum Equals k",
"44.8%",
"Medium"
],
[
"328",
"Odd Even Linked List",
"49.6%",
"Medium"
],
[
"329",
"Longest Increasing Path in a Matrix",
"40.3%",
"Hard"
],
[
"332",
"Reconstruct Itinerary",
"31.8%",
"Medium"
],
[
"333",
"Largest BST Subtree",
"33.3%",
"Medium"
],
[
"334",
"Increasing Triplet Subsequence",
"39.4%",
"Medium"
],
[
"336",
"Palindrome Pairs",
"31.2%",
"Hard"
],
[
"337",
"House Robber III",
"48.3%",
"Medium"
],
[
"339",
"Nested List Weight Sum",
"68.6%",
"Easy"
],
[
"340",
"Longest Substring with At Most K Distinct Characters",
"40.1%",
"Hard"
],
[
"341",
"Flatten Nested List Iterator",
"48.3%",
"Medium"
],
[
"344",
"Reverse String",
"63.5%",
"Easy"
],
[
"346",
"Moving Average from Data Stream",
"66.5%",
"Easy"
],
[
"347",
"Top K Frequent Elements",
"55.4%",
"Medium"
],
[
"348",
"Design Tic-Tac-Toe",
"50.0%",
"Medium"
],
[
"349",
"Intersection of Two Arrays",
"55.2%",
"Easy"
],
[
"350",
"Intersection of Two Arrays II",
"48.2%",
"Easy"
],
[
"352",
"Data Stream as Disjoint Intervals",
"43.7%",
"Hard"
],
[
"353",
"Design Snake Game",
"30.8%",
"Medium"
],
[
"355",
"Design Twitter",
"27.6%",
"Medium"
],
[
"361",
"Bomb Enemy",
"43.6%",
"Medium"
],
[
"362",
"Design Hit Counter",
"59.3%",
"Medium"
],
[
"366",
"Find Leaves of Binary Tree",
"66.1%",
"Medium"
],
[
"373",
"Find K Pairs with Smallest Sums",
"34.0%",
"Medium"
],
[
"378",
"Kth Smallest Element in a Sorted Matrix",
"49.8%",
"Medium"
],
[
"380",
"Insert Delete GetRandom O(1)",
"43.1%",
"Medium"
],
[
"384",
"Shuffle an Array",
"50.3%",
"Medium"
],
[
"387",
"First Unique Character in a String",
"50.3%",
"Easy"
],
[
"388",
"Longest Absolute File Path",
"39.3%",
"Medium"
],
[
"394",
"Decode String",
"45.3%",
"Medium"
],
[
"397",
"Integer Replacement",
"31.5%",
"Medium"
],
[
"399",
"Evaluate Division",
"47.8%",
"Medium"
],
[
"402",
"Remove K Digits",
"26.8%",
"Medium"
],
[
"403",
"Frog Jump",
"36.4%",
"Hard"
],
[
"404",
"Sum of Left Leaves",
"49.3%",
"Easy"
],
[
"407",
"Trapping Rain Water II",
"39.4%",
"Hard"
],
[
"409",
"Longest Palindrome",
"48.2%",
"Easy"
],
[
"412",
"Fizz Buzz",
"59.7%",
"Easy"
],
[
"417",
"Pacific Atlantic Water Flow",
"37.7%",
"Medium"
],
[
"419",
"Battleships in a Board",
"65.9%",
"Medium"
],
[
"432",
"All O`one Data Structure",
"29.8%",
"Hard"
],
[
"435",
"Non-overlapping Intervals",
"41.7%",
"Medium"
],
[
"438",
"Find All Anagrams in a String",
"37.6%",
"Easy"
],
[
"442",
"Find All Duplicates in an Array",
"61.4%",
"Medium"
],
[
"443",
"String Compression",
"37.9%",
"Easy"
],
[
"445",
"Add Two Numbers II",
"50.4%",
"Medium"
],
[
"449",
"Serialize and Deserialize BST",
"47.6%",
"Medium"
],
[
"450",
"Delete Node in a BST",
"40.2%",
"Medium"
],
[
"451",
"Sort Characters By Frequency",
"56.4%",
"Medium"
],
[
"460",
"LFU Cache",
"29.1%",
"Hard"
],
[
"463",
"Island Perimeter",
"61.2%",
"Easy"
],
[
"468",
"Validate IP Address",
"21.4%",
"Medium"
],
[
"472",
"Concatenated Words",
"35.2%",
"Hard"
],
[
"480",
"Sliding Window Median",
"32.9%",
"Hard"
],
[
"485",
"Max Consecutive Ones",
"55.2%",
"Easy"
],
[
"490",
"The Maze",
"47.7%",
"Medium"
],
[
"496",
"Next Greater Element I",
"59.8%",
"Easy"
],
[
"498",
"Diagonal Traverse",
"45.5%",
"Medium"
],
[
"503",
"Next Greater Element II",
"51.3%",
"Medium"
],
[
"505",
"The Maze II",
"44.2%",
"Medium"
],
[
"507",
"Perfect Number",
"34.5%",
"Easy"
],
[
"508",
"Most Frequent Subtree Sum",
"54.8%",
"Medium"
],
[
"516",
"Longest Palindromic Subsequence",
"47.2%",
"Medium"
],
[
"518",
"Coin Change 2",
"43.2%",
"Medium"
],
[
"525",
"Contiguous Array",
"42.9%",
"Medium"
],
[
"529",
"Minesweeper",
"53.3%",
"Medium"
],
[
"538",
"Convert BST to Greater Tree",
"51.4%",
"Easy"
],
[
"540",
"Single Element in a Sorted Array",
"57.4%",
"Medium"
],
[
"543",
"Diameter of Binary Tree",
"47.0%",
"Easy"
],
[
"545",
"Boundary of Binary Tree",
"35.3%",
"Medium"
],
[
"547",
"Friend Circles",
"54.0%",
"Medium"
],
[
"556",
"Next Greater Element III",
"30.1%",
"Medium"
],
[
"560",
"Subarray Sum Equals K",
"42.4%",
"Medium"
],
[
"561",
"Array Partition I",
"69.4%",
"Easy"
],
[
"564",
"Find the Closest Palindrome",
"18.9%",
"Hard"
],
[
"572",
"Subtree of Another Tree",
"41.8%",
"Easy"
],
[
"581",
"Shortest Unsorted Continuous Subarray",
"30.2%",
"Easy"
],
[
"588",
"Design In-Memory File System",
"40.2%",
"Hard"
],
[
"595",
"Big Countries",
"74.1%",
"Easy"
],
[
"599",
"Minimum Index Sum of Two Lists",
"48.2%",
"Easy"
],
[
"609",
"Find Duplicate File in System",
"55.6%",
"Medium"
],
[
"617",
"Merge Two Binary Trees",
"70.5%",
"Easy"
],
[
"621",
"Task Scheduler",
"45.7%",
"Medium"
],
[
"628",
"Maximum Product of Three Numbers",
"46.2%",
"Easy"
],
[
"635",
"Design Log Storage System",
"54.6%",
"Medium"
],
[
"636",
"Exclusive Time of Functions",
"48.8%",
"Medium"
],
[
"637",
"Average of Levels in Binary Tree",
"59.1%",
"Easy"
],
[
"640",
"Solve the Equation",
"40.4%",
"Medium"
],
[
"642",
"Design Search Autocomplete System",
"38.2%",
"Hard"
],
[
"647",
"Palindromic Substrings",
"57.3%",
"Medium"
],
[
"652",
"Find Duplicate Subtrees",
"45.9%",
"Medium"
],
[
"653",
"Two Sum IV - Input is a BST",
"52.7%",
"Easy"
],
[
"658",
"Find K Closest Elements",
"38.2%",
"Medium"
],
[
"662",
"Maximum Width of Binary Tree",
"39.5%",
"Medium"
],
[
"675",
"Cut Off Trees for Golf Event",
"30.8%",
"Hard"
],
[
"678",
"Valid Parenthesis String",
"32.9%",
"Medium"
],
[
"682",
"Baseball Game",
"61.3%",
"Easy"
],
[
"687",
"Longest Univalue Path",
"34.0%",
"Easy"
],
[
"688",
"Knight Probability in Chessboard",
"44.7%",
"Medium"
],
[
"692",
"Top K Frequent Words",
"46.1%",
"Medium"
],
[
"694",
"Number of Distinct Islands",
"51.5%",
"Medium"
],
[
"695",
"Max Area of Island",
"57.7%",
"Medium"
],
[
"716",
"Max Stack",
"40.3%",
"Easy"
],
[
"726",
"Number of Atoms",
"45.0%",
"Hard"
],
[
"729",
"My Calendar I",
"47.7%",
"Medium"
],
[
"731",
"My Calendar II",
"44.9%",
"Medium"
],
[
"733",
"Flood Fill",
"51.1%",
"Easy"
],
[
"739",
"Daily Temperatures",
"60.2%",
"Medium"
],
[
"742",
"Closest Leaf in a Binary Tree",
"39.4%",
"Medium"
],
[
"743",
"Network Delay Time",
"42.6%",
"Medium"
],
[
"426",
"Convert Binary Search Tree to Sorted Doubly Linked List",
"52.6%",
"Medium"
],
[
"759",
"Employee Free Time",
"61.6%",
"Hard"
],
[
"428",
"Serialize and Deserialize N-ary Tree",
"54.5%",
"Hard"
],
[
"430",
"Flatten a Multilevel Doubly Linked List",
"42.7%",
"Medium"
],
[
"763",
"Partition Labels",
"70.9%",
"Medium"
],
[
"559",
"Maximum Depth of N-ary Tree",
"65.7%",
"Easy"
],
[
"767",
"Reorganize String",
"42.8%",
"Medium"
],
[
"771",
"Jewels and Stones",
"83.2%",
"Easy"
],
[
"772",
"Basic Calculator III",
"43.2%",
"Hard"
],
[
"773",
"Sliding Puzzle",
"53.1%",
"Hard"
],
[
"703",
"Kth Largest Element in a Stream",
"46.6%",
"Easy"
],
[
"778",
"Swim in Rising Water",
"47.9%",
"Hard"
],
[
"780",
"Reaching Points",
"27.7%",
"Hard"
],
[
"785",
"Is Graph Bipartite?",
"43.6%",
"Medium"
],
[
"787",
"Cheapest Flights Within K Stops",
"35.3%",
"Medium"
],
[
"792",
"Number of Matching Subsequences",
"43.5%",
"Medium"
],
[
"797",
"All Paths From Source to Target",
"70.8%",
"Medium"
],
[
"706",
"Design HashMap",
"56.5%",
"Easy"
],
[
"807",
"Max Increase to Keep City Skyline",
"81.7%",
"Medium"
],
[
"819",
"Most Common Word",
"42.3%",
"Easy"
],
[
"707",
"Design Linked List",
"21.6%",
"Easy"
],
[
"708",
"Insert into a Cyclic Sorted List",
"29.3%",
"Medium"
],
[
"622",
"Design Circular Queue",
"39.8%",
"Medium"
],
[
"489",
"Robot Room Cleaner",
"64.9%",
"Hard"
],
[
"836",
"Rectangle Overlap",
"46.7%",
"Easy"
],
[
"843",
"Guess the Word",
"43.8%",
"Hard"
],
[
"847",
"Shortest Path Visiting All Nodes",
"47.2%",
"Hard"
],
[
"863",
"All Nodes Distance K in Binary Tree",
"48.0%",
"Medium"
],
[
"710",
"Random Pick with Blacklist",
"31.3%",
"Hard"
],
[
"877",
"Stone Game",
"61.4%",
"Medium"
],
[
"528",
"Random Pick with Weight",
"42.8%",
"Medium"
],
[
"895",
"Maximum Frequency Stack",
"56.5%",
"Hard"
],
[
"900",
"RLE Iterator",
"50.4%",
"Medium"
],
[
"904",
"Fruit Into Baskets",
"41.6%",
"Medium"
],
[
"905",
"Sort Array By Parity",
"72.6%",
"Easy"
],
[
"907",
"Sum of Subarray Minimums",
"27.7%",
"Medium"
],
[
"909",
"Snakes and Ladders",
"33.9%",
"Medium"
],
[
"924",
"Minimize Malware Spread",
"40.2%",
"Hard"
],
[
"929",
"Unique Email Addresses",
"70.3%",
"Easy"
],
[
"937",
"Reorder Log Files",
"56.8%",
"Easy"
],
[
"938",
"Range Sum of BST",
"78.6%",
"Easy"
],
[
"942",
"DI String Match",
"70.1%",
"Easy"
],
[
"957",
"Prison Cells After N Days",
"38.2%",
"Medium"
],
[
"509",
"Fibonacci Number",
"66.6%",
"Easy"
],
[
"973",
"K Closest Points to Origin",
"62.0%",
"Medium"
],
[
"977",
"Squares of a Sorted Array",
"72.1%",
"Easy"
],
[
"978",
"Longest Turbulent Subarray",
"45.5%",
"Medium"
],
[
"979",
"Distribute Coins in Binary Tree",
"67.2%",
"Medium"
],
[
"980",
"Unique Paths III",
"71.2%",
"Hard"
],
[
"983",
"Minimum Cost For Tickets",
"57.2%",
"Medium"
],
[
"987",
"Vertical Order Traversal of a Binary Tree",
"31.9%",
"Medium"
],
[
"992",
"Subarrays with K Different Integers",
"45.2%",
"Hard"
],
[
"993",
"Cousins in Binary Tree",
"52.3%",
"Easy"
],
[
"994",
"Rotting Oranges",
"46.5%",
"Easy"
],
[
"997",
"Find the Town Judge",
"49.2%",
"Easy"
],
[
"1000",
"Minimum Cost to Merge Stones",
"32.3%",
"Hard"
],
[
"1010",
"Pairs of Songs With Total Durations Divisible by 60",
"45.7%",
"Easy"
],
[
"1019",
"Next Greater Node In Linked List",
"56.5%",
"Medium"
],
[
"1086",
"High Five",
"76.0%",
"Easy"
],
[
"1022",
"Sum of Root To Leaf Binary Numbers",
"56.3%",
"Easy"
],
[
"1023",
"Camelcase Matching",
"56.3%",
"Medium"
],
[
"1026",
"Maximum Difference Between Node and Ancestor",
"60.0%",
"Medium"
],
[
"1029",
"Two City Scheduling",
"54.1%",
"Easy"
],
[
"1032",
"Stream of Characters",
"41.3%",
"Hard"
],
[
"1044",
"Longest Duplicate Substring",
"22.7%",
"Hard"
],
[
"1051",
"Height Checker",
"69.4%",
"Easy"
],
[
"1091",
"Shortest Path in Binary Matrix",
"36.1%",
"Medium"
],
[
"1083",
"Sales Analysis II",
"54.1%",
"Easy"
]
]
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment