3851 lines
762 KiB
JSON
3851 lines
762 KiB
JSON
{"id":1,"frontendId":1,"title":"Two Sum","titleSlug":"two-sum","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":2,"frontendId":2,"title":"Add Two Numbers","titleSlug":"add-two-numbers","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","math","recursion"]}
|
||
{"id":3,"frontendId":3,"title":"Longest Substring Without Repeating Characters","titleSlug":"longest-substring-without-repeating-characters","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":4,"frontendId":4,"title":"Median of Two Sorted Arrays","titleSlug":"median-of-two-sorted-arrays","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","divide-and-conquer"]}
|
||
{"id":5,"frontendId":5,"title":"Longest Palindromic Substring","titleSlug":"longest-palindromic-substring","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string","dynamic-programming"]}
|
||
{"id":6,"frontendId":6,"title":"Zigzag Conversion","titleSlug":"zigzag-conversion","difficulty":"MEDIUM","paidOnly":false,"tags":["string"]}
|
||
{"id":7,"frontendId":7,"title":"Reverse Integer","titleSlug":"reverse-integer","difficulty":"MEDIUM","paidOnly":false,"tags":["math"]}
|
||
{"id":8,"frontendId":8,"title":"String to Integer (atoi)","titleSlug":"string-to-integer-atoi","difficulty":"MEDIUM","paidOnly":false,"tags":["string"]}
|
||
{"id":9,"frontendId":9,"title":"Palindrome Number","titleSlug":"palindrome-number","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":10,"frontendId":10,"title":"Regular Expression Matching","titleSlug":"regular-expression-matching","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming","recursion"]}
|
||
{"id":11,"frontendId":11,"title":"Container With Most Water","titleSlug":"container-with-most-water","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","greedy"]}
|
||
{"id":12,"frontendId":12,"title":"Integer to Roman","titleSlug":"integer-to-roman","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","math","string"]}
|
||
{"id":13,"frontendId":13,"title":"Roman to Integer","titleSlug":"roman-to-integer","difficulty":"EASY","paidOnly":false,"tags":["hash-table","math","string"]}
|
||
{"id":14,"frontendId":14,"title":"Longest Common Prefix","titleSlug":"longest-common-prefix","difficulty":"EASY","paidOnly":false,"tags":["array","string","trie"]}
|
||
{"id":15,"frontendId":15,"title":"3Sum","titleSlug":"3sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","sorting"]}
|
||
{"id":16,"frontendId":16,"title":"3Sum Closest","titleSlug":"3sum-closest","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","sorting"]}
|
||
{"id":17,"frontendId":17,"title":"Letter Combinations of a Phone Number","titleSlug":"letter-combinations-of-a-phone-number","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","backtracking"]}
|
||
{"id":18,"frontendId":18,"title":"4Sum","titleSlug":"4sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","sorting"]}
|
||
{"id":19,"frontendId":19,"title":"Remove Nth Node From End of List","titleSlug":"remove-nth-node-from-end-of-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","two-pointers"]}
|
||
{"id":20,"frontendId":20,"title":"Valid Parentheses","titleSlug":"valid-parentheses","difficulty":"EASY","paidOnly":false,"tags":["string","stack"]}
|
||
{"id":21,"frontendId":21,"title":"Merge Two Sorted Lists","titleSlug":"merge-two-sorted-lists","difficulty":"EASY","paidOnly":false,"tags":["linked-list","recursion"]}
|
||
{"id":22,"frontendId":22,"title":"Generate Parentheses","titleSlug":"generate-parentheses","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming","backtracking"]}
|
||
{"id":23,"frontendId":23,"title":"Merge k Sorted Lists","titleSlug":"merge-k-sorted-lists","difficulty":"HARD","paidOnly":false,"tags":["linked-list","divide-and-conquer","heap-priority-queue","merge-sort"]}
|
||
{"id":24,"frontendId":24,"title":"Swap Nodes in Pairs","titleSlug":"swap-nodes-in-pairs","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","recursion"]}
|
||
{"id":25,"frontendId":25,"title":"Reverse Nodes in k-Group","titleSlug":"reverse-nodes-in-k-group","difficulty":"HARD","paidOnly":false,"tags":["linked-list","recursion"]}
|
||
{"id":26,"frontendId":26,"title":"Remove Duplicates from Sorted Array","titleSlug":"remove-duplicates-from-sorted-array","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers"]}
|
||
{"id":27,"frontendId":27,"title":"Remove Element","titleSlug":"remove-element","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers"]}
|
||
{"id":28,"frontendId":28,"title":"Find the Index of the First Occurrence in a String","titleSlug":"find-the-index-of-the-first-occurrence-in-a-string","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string","string-matching"]}
|
||
{"id":29,"frontendId":29,"title":"Divide Two Integers","titleSlug":"divide-two-integers","difficulty":"MEDIUM","paidOnly":false,"tags":["math","bit-manipulation"]}
|
||
{"id":30,"frontendId":30,"title":"Substring with Concatenation of All Words","titleSlug":"substring-with-concatenation-of-all-words","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":31,"frontendId":31,"title":"Next Permutation","titleSlug":"next-permutation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers"]}
|
||
{"id":32,"frontendId":32,"title":"Longest Valid Parentheses","titleSlug":"longest-valid-parentheses","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming","stack"]}
|
||
{"id":33,"frontendId":33,"title":"Search in Rotated Sorted Array","titleSlug":"search-in-rotated-sorted-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":34,"frontendId":34,"title":"Find First and Last Position of Element in Sorted Array","titleSlug":"find-first-and-last-position-of-element-in-sorted-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":35,"frontendId":35,"title":"Search Insert Position","titleSlug":"search-insert-position","difficulty":"EASY","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":36,"frontendId":36,"title":"Valid Sudoku","titleSlug":"valid-sudoku","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","matrix"]}
|
||
{"id":37,"frontendId":37,"title":"Sudoku Solver","titleSlug":"sudoku-solver","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","backtracking","matrix"]}
|
||
{"id":38,"frontendId":38,"title":"Count and Say","titleSlug":"count-and-say","difficulty":"MEDIUM","paidOnly":false,"tags":["string"]}
|
||
{"id":39,"frontendId":39,"title":"Combination Sum","titleSlug":"combination-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","backtracking"]}
|
||
{"id":40,"frontendId":40,"title":"Combination Sum II","titleSlug":"combination-sum-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","backtracking"]}
|
||
{"id":41,"frontendId":41,"title":"First Missing Positive","titleSlug":"first-missing-positive","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":42,"frontendId":42,"title":"Trapping Rain Water","titleSlug":"trapping-rain-water","difficulty":"HARD","paidOnly":false,"tags":["array","two-pointers","dynamic-programming","stack","monotonic-stack"]}
|
||
{"id":43,"frontendId":43,"title":"Multiply Strings","titleSlug":"multiply-strings","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string","simulation"]}
|
||
{"id":44,"frontendId":44,"title":"Wildcard Matching","titleSlug":"wildcard-matching","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming","greedy","recursion"]}
|
||
{"id":45,"frontendId":45,"title":"Jump Game II","titleSlug":"jump-game-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","greedy"]}
|
||
{"id":46,"frontendId":46,"title":"Permutations","titleSlug":"permutations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","backtracking"]}
|
||
{"id":47,"frontendId":47,"title":"Permutations II","titleSlug":"permutations-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","backtracking","sorting"]}
|
||
{"id":48,"frontendId":48,"title":"Rotate Image","titleSlug":"rotate-image","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","matrix"]}
|
||
{"id":49,"frontendId":49,"title":"Group Anagrams","titleSlug":"group-anagrams","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","sorting"]}
|
||
{"id":50,"frontendId":50,"title":"Pow(x, n)","titleSlug":"powx-n","difficulty":"MEDIUM","paidOnly":false,"tags":["math","recursion"]}
|
||
{"id":51,"frontendId":51,"title":"N-Queens","titleSlug":"n-queens","difficulty":"HARD","paidOnly":false,"tags":["array","backtracking"]}
|
||
{"id":52,"frontendId":52,"title":"N-Queens II","titleSlug":"n-queens-ii","difficulty":"HARD","paidOnly":false,"tags":["backtracking"]}
|
||
{"id":53,"frontendId":53,"title":"Maximum Subarray","titleSlug":"maximum-subarray","difficulty":"MEDIUM","paidOnly":false,"tags":["array","divide-and-conquer","dynamic-programming"]}
|
||
{"id":54,"frontendId":54,"title":"Spiral Matrix","titleSlug":"spiral-matrix","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","simulation"]}
|
||
{"id":55,"frontendId":55,"title":"Jump Game","titleSlug":"jump-game","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","greedy"]}
|
||
{"id":56,"frontendId":56,"title":"Merge Intervals","titleSlug":"merge-intervals","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":57,"frontendId":57,"title":"Insert Interval","titleSlug":"insert-interval","difficulty":"MEDIUM","paidOnly":false,"tags":["array"]}
|
||
{"id":58,"frontendId":58,"title":"Length of Last Word","titleSlug":"length-of-last-word","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":59,"frontendId":59,"title":"Spiral Matrix II","titleSlug":"spiral-matrix-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","simulation"]}
|
||
{"id":60,"frontendId":60,"title":"Permutation Sequence","titleSlug":"permutation-sequence","difficulty":"HARD","paidOnly":false,"tags":["math","recursion"]}
|
||
{"id":61,"frontendId":61,"title":"Rotate List","titleSlug":"rotate-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","two-pointers"]}
|
||
{"id":62,"frontendId":62,"title":"Unique Paths","titleSlug":"unique-paths","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming","combinatorics"]}
|
||
{"id":63,"frontendId":63,"title":"Unique Paths II","titleSlug":"unique-paths-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":64,"frontendId":64,"title":"Minimum Path Sum","titleSlug":"minimum-path-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":65,"frontendId":65,"title":"Valid Number","titleSlug":"valid-number","difficulty":"HARD","paidOnly":false,"tags":["string"]}
|
||
{"id":66,"frontendId":66,"title":"Plus One","titleSlug":"plus-one","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
|
||
{"id":67,"frontendId":67,"title":"Add Binary","titleSlug":"add-binary","difficulty":"EASY","paidOnly":false,"tags":["math","string","bit-manipulation","simulation"]}
|
||
{"id":68,"frontendId":68,"title":"Text Justification","titleSlug":"text-justification","difficulty":"HARD","paidOnly":false,"tags":["array","string","simulation"]}
|
||
{"id":69,"frontendId":69,"title":"Sqrt(x)","titleSlug":"sqrtx","difficulty":"EASY","paidOnly":false,"tags":["math","binary-search"]}
|
||
{"id":70,"frontendId":70,"title":"Climbing Stairs","titleSlug":"climbing-stairs","difficulty":"EASY","paidOnly":false,"tags":["math","dynamic-programming","memoization"]}
|
||
{"id":71,"frontendId":71,"title":"Simplify Path","titleSlug":"simplify-path","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack"]}
|
||
{"id":72,"frontendId":72,"title":"Edit Distance","titleSlug":"edit-distance","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":73,"frontendId":73,"title":"Set Matrix Zeroes","titleSlug":"set-matrix-zeroes","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","matrix"]}
|
||
{"id":74,"frontendId":74,"title":"Search a 2D Matrix","titleSlug":"search-a-2d-matrix","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","matrix"]}
|
||
{"id":75,"frontendId":75,"title":"Sort Colors","titleSlug":"sort-colors","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","sorting"]}
|
||
{"id":76,"frontendId":76,"title":"Minimum Window Substring","titleSlug":"minimum-window-substring","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":77,"frontendId":77,"title":"Combinations","titleSlug":"combinations","difficulty":"MEDIUM","paidOnly":false,"tags":["backtracking"]}
|
||
{"id":78,"frontendId":78,"title":"Subsets","titleSlug":"subsets","difficulty":"MEDIUM","paidOnly":false,"tags":["array","backtracking","bit-manipulation"]}
|
||
{"id":79,"frontendId":79,"title":"Word Search","titleSlug":"word-search","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","backtracking","depth-first-search","matrix"]}
|
||
{"id":80,"frontendId":80,"title":"Remove Duplicates from Sorted Array II","titleSlug":"remove-duplicates-from-sorted-array-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers"]}
|
||
{"id":81,"frontendId":81,"title":"Search in Rotated Sorted Array II","titleSlug":"search-in-rotated-sorted-array-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":82,"frontendId":82,"title":"Remove Duplicates from Sorted List II","titleSlug":"remove-duplicates-from-sorted-list-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","two-pointers"]}
|
||
{"id":83,"frontendId":83,"title":"Remove Duplicates from Sorted List","titleSlug":"remove-duplicates-from-sorted-list","difficulty":"EASY","paidOnly":false,"tags":["linked-list"]}
|
||
{"id":84,"frontendId":84,"title":"Largest Rectangle in Histogram","titleSlug":"largest-rectangle-in-histogram","difficulty":"HARD","paidOnly":false,"tags":["array","stack","monotonic-stack"]}
|
||
{"id":85,"frontendId":85,"title":"Maximal Rectangle","titleSlug":"maximal-rectangle","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","stack","matrix","monotonic-stack"]}
|
||
{"id":86,"frontendId":86,"title":"Partition List","titleSlug":"partition-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","two-pointers"]}
|
||
{"id":87,"frontendId":87,"title":"Scramble String","titleSlug":"scramble-string","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":88,"frontendId":88,"title":"Merge Sorted Array","titleSlug":"merge-sorted-array","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","sorting"]}
|
||
{"id":89,"frontendId":89,"title":"Gray Code","titleSlug":"gray-code","difficulty":"MEDIUM","paidOnly":false,"tags":["math","backtracking","bit-manipulation"]}
|
||
{"id":90,"frontendId":90,"title":"Subsets II","titleSlug":"subsets-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","backtracking","bit-manipulation"]}
|
||
{"id":91,"frontendId":91,"title":"Decode Ways","titleSlug":"decode-ways","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":92,"frontendId":92,"title":"Reverse Linked List II","titleSlug":"reverse-linked-list-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list"]}
|
||
{"id":93,"frontendId":93,"title":"Restore IP Addresses","titleSlug":"restore-ip-addresses","difficulty":"MEDIUM","paidOnly":false,"tags":["string","backtracking"]}
|
||
{"id":94,"frontendId":94,"title":"Binary Tree Inorder Traversal","titleSlug":"binary-tree-inorder-traversal","difficulty":"EASY","paidOnly":false,"tags":["stack","tree","depth-first-search","binary-tree"]}
|
||
{"id":95,"frontendId":95,"title":"Unique Binary Search Trees II","titleSlug":"unique-binary-search-trees-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming","backtracking","tree","binary-search-tree","binary-tree"]}
|
||
{"id":96,"frontendId":96,"title":"Unique Binary Search Trees","titleSlug":"unique-binary-search-trees","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming","tree","binary-search-tree","binary-tree"]}
|
||
{"id":97,"frontendId":97,"title":"Interleaving String","titleSlug":"interleaving-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":98,"frontendId":98,"title":"Validate Binary Search Tree","titleSlug":"validate-binary-search-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":99,"frontendId":99,"title":"Recover Binary Search Tree","titleSlug":"recover-binary-search-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":100,"frontendId":100,"title":"Same Tree","titleSlug":"same-tree","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":101,"frontendId":101,"title":"Symmetric Tree","titleSlug":"symmetric-tree","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":102,"frontendId":102,"title":"Binary Tree Level Order Traversal","titleSlug":"binary-tree-level-order-traversal","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","breadth-first-search","binary-tree"]}
|
||
{"id":103,"frontendId":103,"title":"Binary Tree Zigzag Level Order Traversal","titleSlug":"binary-tree-zigzag-level-order-traversal","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","breadth-first-search","binary-tree"]}
|
||
{"id":104,"frontendId":104,"title":"Maximum Depth of Binary Tree","titleSlug":"maximum-depth-of-binary-tree","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":105,"frontendId":105,"title":"Construct Binary Tree from Preorder and Inorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","divide-and-conquer","tree","binary-tree"]}
|
||
{"id":106,"frontendId":106,"title":"Construct Binary Tree from Inorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","divide-and-conquer","tree","binary-tree"]}
|
||
{"id":107,"frontendId":107,"title":"Binary Tree Level Order Traversal II","titleSlug":"binary-tree-level-order-traversal-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","breadth-first-search","binary-tree"]}
|
||
{"id":108,"frontendId":108,"title":"Convert Sorted Array to Binary Search Tree","titleSlug":"convert-sorted-array-to-binary-search-tree","difficulty":"EASY","paidOnly":false,"tags":["array","divide-and-conquer","tree","binary-search-tree","binary-tree"]}
|
||
{"id":109,"frontendId":109,"title":"Convert Sorted List to Binary Search Tree","titleSlug":"convert-sorted-list-to-binary-search-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","divide-and-conquer","tree","binary-search-tree","binary-tree"]}
|
||
{"id":110,"frontendId":110,"title":"Balanced Binary Tree","titleSlug":"balanced-binary-tree","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":111,"frontendId":111,"title":"Minimum Depth of Binary Tree","titleSlug":"minimum-depth-of-binary-tree","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":112,"frontendId":112,"title":"Path Sum","titleSlug":"path-sum","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":113,"frontendId":113,"title":"Path Sum II","titleSlug":"path-sum-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["backtracking","tree","depth-first-search","binary-tree"]}
|
||
{"id":114,"frontendId":114,"title":"Flatten Binary Tree to Linked List","titleSlug":"flatten-binary-tree-to-linked-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","stack","tree","depth-first-search","binary-tree"]}
|
||
{"id":115,"frontendId":115,"title":"Distinct Subsequences","titleSlug":"distinct-subsequences","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":116,"frontendId":116,"title":"Populating Next Right Pointers in Each Node","titleSlug":"populating-next-right-pointers-in-each-node","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":117,"frontendId":117,"title":"Populating Next Right Pointers in Each Node II","titleSlug":"populating-next-right-pointers-in-each-node-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":118,"frontendId":118,"title":"Pascal's Triangle","titleSlug":"pascals-triangle","difficulty":"EASY","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":119,"frontendId":119,"title":"Pascal's Triangle II","titleSlug":"pascals-triangle-ii","difficulty":"EASY","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":120,"frontendId":120,"title":"Triangle","titleSlug":"triangle","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":121,"frontendId":121,"title":"Best Time to Buy and Sell Stock","titleSlug":"best-time-to-buy-and-sell-stock","difficulty":"EASY","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":122,"frontendId":122,"title":"Best Time to Buy and Sell Stock II","titleSlug":"best-time-to-buy-and-sell-stock-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","greedy"]}
|
||
{"id":123,"frontendId":123,"title":"Best Time to Buy and Sell Stock III","titleSlug":"best-time-to-buy-and-sell-stock-iii","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":124,"frontendId":124,"title":"Binary Tree Maximum Path Sum","titleSlug":"binary-tree-maximum-path-sum","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","tree","depth-first-search","binary-tree"]}
|
||
{"id":125,"frontendId":125,"title":"Valid Palindrome","titleSlug":"valid-palindrome","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":126,"frontendId":126,"title":"Word Ladder II","titleSlug":"word-ladder-ii","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","backtracking","breadth-first-search"]}
|
||
{"id":127,"frontendId":127,"title":"Word Ladder","titleSlug":"word-ladder","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","breadth-first-search"]}
|
||
{"id":128,"frontendId":128,"title":"Longest Consecutive Sequence","titleSlug":"longest-consecutive-sequence","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","union-find"]}
|
||
{"id":129,"frontendId":129,"title":"Sum Root to Leaf Numbers","titleSlug":"sum-root-to-leaf-numbers","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":130,"frontendId":130,"title":"Surrounded Regions","titleSlug":"surrounded-regions","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","union-find","matrix"]}
|
||
{"id":131,"frontendId":131,"title":"Palindrome Partitioning","titleSlug":"palindrome-partitioning","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming","backtracking"]}
|
||
{"id":132,"frontendId":132,"title":"Palindrome Partitioning II","titleSlug":"palindrome-partitioning-ii","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":133,"frontendId":133,"title":"Clone Graph","titleSlug":"clone-graph","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","depth-first-search","breadth-first-search","graph"]}
|
||
{"id":134,"frontendId":134,"title":"Gas Station","titleSlug":"gas-station","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":135,"frontendId":135,"title":"Candy","titleSlug":"candy","difficulty":"HARD","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":136,"frontendId":136,"title":"Single Number","titleSlug":"single-number","difficulty":"EASY","paidOnly":false,"tags":["array","bit-manipulation"]}
|
||
{"id":137,"frontendId":137,"title":"Single Number II","titleSlug":"single-number-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation"]}
|
||
{"id":138,"frontendId":138,"title":"Copy List with Random Pointer","titleSlug":"copy-list-with-random-pointer","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","linked-list"]}
|
||
{"id":139,"frontendId":139,"title":"Word Break","titleSlug":"word-break","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","dynamic-programming","trie","memoization"]}
|
||
{"id":140,"frontendId":140,"title":"Word Break II","titleSlug":"word-break-ii","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","string","dynamic-programming","backtracking","trie","memoization"]}
|
||
{"id":141,"frontendId":141,"title":"Linked List Cycle","titleSlug":"linked-list-cycle","difficulty":"EASY","paidOnly":false,"tags":["hash-table","linked-list","two-pointers"]}
|
||
{"id":142,"frontendId":142,"title":"Linked List Cycle II","titleSlug":"linked-list-cycle-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","linked-list","two-pointers"]}
|
||
{"id":143,"frontendId":143,"title":"Reorder List","titleSlug":"reorder-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","two-pointers","stack","recursion"]}
|
||
{"id":144,"frontendId":144,"title":"Binary Tree Preorder Traversal","titleSlug":"binary-tree-preorder-traversal","difficulty":"EASY","paidOnly":false,"tags":["stack","tree","depth-first-search","binary-tree"]}
|
||
{"id":145,"frontendId":145,"title":"Binary Tree Postorder Traversal","titleSlug":"binary-tree-postorder-traversal","difficulty":"EASY","paidOnly":false,"tags":["stack","tree","depth-first-search","binary-tree"]}
|
||
{"id":146,"frontendId":146,"title":"LRU Cache","titleSlug":"lru-cache","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","linked-list","design","doubly-linked-list"]}
|
||
{"id":147,"frontendId":147,"title":"Insertion Sort List","titleSlug":"insertion-sort-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","sorting"]}
|
||
{"id":148,"frontendId":148,"title":"Sort List","titleSlug":"sort-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","two-pointers","divide-and-conquer","sorting","merge-sort"]}
|
||
{"id":149,"frontendId":149,"title":"Max Points on a Line","titleSlug":"max-points-on-a-line","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","geometry"]}
|
||
{"id":150,"frontendId":150,"title":"Evaluate Reverse Polish Notation","titleSlug":"evaluate-reverse-polish-notation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","stack"]}
|
||
{"id":151,"frontendId":151,"title":"Reverse Words in a String","titleSlug":"reverse-words-in-a-string","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":152,"frontendId":152,"title":"Maximum Product Subarray","titleSlug":"maximum-product-subarray","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":153,"frontendId":153,"title":"Find Minimum in Rotated Sorted Array","titleSlug":"find-minimum-in-rotated-sorted-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":154,"frontendId":154,"title":"Find Minimum in Rotated Sorted Array II","titleSlug":"find-minimum-in-rotated-sorted-array-ii","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":155,"frontendId":155,"title":"Min Stack","titleSlug":"min-stack","difficulty":"MEDIUM","paidOnly":false,"tags":["stack","design"]}
|
||
{"id":156,"frontendId":156,"title":"Binary Tree Upside Down","titleSlug":"binary-tree-upside-down","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":157,"frontendId":157,"title":"Read N Characters Given Read4","titleSlug":"read-n-characters-given-read4","difficulty":"EASY","paidOnly":true,"tags":["array","simulation","interactive"]}
|
||
{"id":158,"frontendId":158,"title":"Read N Characters Given read4 II - Call Multiple Times","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times","difficulty":"HARD","paidOnly":true,"tags":["array","simulation","interactive"]}
|
||
{"id":159,"frontendId":159,"title":"Longest Substring with At Most Two Distinct Characters","titleSlug":"longest-substring-with-at-most-two-distinct-characters","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":160,"frontendId":160,"title":"Intersection of Two Linked Lists","titleSlug":"intersection-of-two-linked-lists","difficulty":"EASY","paidOnly":false,"tags":["hash-table","linked-list","two-pointers"]}
|
||
{"id":161,"frontendId":161,"title":"One Edit Distance","titleSlug":"one-edit-distance","difficulty":"MEDIUM","paidOnly":true,"tags":["two-pointers","string"]}
|
||
{"id":162,"frontendId":162,"title":"Find Peak Element","titleSlug":"find-peak-element","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":163,"frontendId":163,"title":"Missing Ranges","titleSlug":"missing-ranges","difficulty":"EASY","paidOnly":true,"tags":["array"]}
|
||
{"id":164,"frontendId":164,"title":"Maximum Gap","titleSlug":"maximum-gap","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting","bucket-sort","radix-sort"]}
|
||
{"id":165,"frontendId":165,"title":"Compare Version Numbers","titleSlug":"compare-version-numbers","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":166,"frontendId":166,"title":"Fraction to Recurring Decimal","titleSlug":"fraction-to-recurring-decimal","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","math","string"]}
|
||
{"id":167,"frontendId":167,"title":"Two Sum II - Input Array Is Sorted","titleSlug":"two-sum-ii-input-array-is-sorted","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search"]}
|
||
{"id":168,"frontendId":168,"title":"Excel Sheet Column Title","titleSlug":"excel-sheet-column-title","difficulty":"EASY","paidOnly":false,"tags":["math","string"]}
|
||
{"id":169,"frontendId":169,"title":"Majority Element","titleSlug":"majority-element","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","divide-and-conquer","sorting","counting"]}
|
||
{"id":170,"frontendId":170,"title":"Two Sum III - Data structure design","titleSlug":"two-sum-iii-data-structure-design","difficulty":"EASY","paidOnly":true,"tags":["array","hash-table","two-pointers","design","data-stream"]}
|
||
{"id":171,"frontendId":171,"title":"Excel Sheet Column Number","titleSlug":"excel-sheet-column-number","difficulty":"EASY","paidOnly":false,"tags":["math","string"]}
|
||
{"id":172,"frontendId":172,"title":"Factorial Trailing Zeroes","titleSlug":"factorial-trailing-zeroes","difficulty":"MEDIUM","paidOnly":false,"tags":["math"]}
|
||
{"id":173,"frontendId":173,"title":"Binary Search Tree Iterator","titleSlug":"binary-search-tree-iterator","difficulty":"MEDIUM","paidOnly":false,"tags":["stack","tree","design","binary-search-tree","binary-tree","iterator"]}
|
||
{"id":174,"frontendId":174,"title":"Dungeon Game","titleSlug":"dungeon-game","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":175,"frontendId":175,"title":"Combine Two Tables","titleSlug":"combine-two-tables","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":176,"frontendId":176,"title":"Second Highest Salary","titleSlug":"second-highest-salary","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":177,"frontendId":177,"title":"Nth Highest Salary","titleSlug":"nth-highest-salary","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":178,"frontendId":178,"title":"Rank Scores","titleSlug":"rank-scores","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":179,"frontendId":179,"title":"Largest Number","titleSlug":"largest-number","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","greedy","sorting"]}
|
||
{"id":180,"frontendId":180,"title":"Consecutive Numbers","titleSlug":"consecutive-numbers","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":181,"frontendId":181,"title":"Employees Earning More Than Their Managers","titleSlug":"employees-earning-more-than-their-managers","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":182,"frontendId":182,"title":"Duplicate Emails","titleSlug":"duplicate-emails","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":183,"frontendId":183,"title":"Customers Who Never Order","titleSlug":"customers-who-never-order","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":184,"frontendId":184,"title":"Department Highest Salary","titleSlug":"department-highest-salary","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":185,"frontendId":185,"title":"Department Top Three Salaries","titleSlug":"department-top-three-salaries","difficulty":"HARD","paidOnly":false,"tags":["database"]}
|
||
{"id":186,"frontendId":186,"title":"Reverse Words in a String II","titleSlug":"reverse-words-in-a-string-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["two-pointers","string"]}
|
||
{"id":187,"frontendId":187,"title":"Repeated DNA Sequences","titleSlug":"repeated-dna-sequences","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","bit-manipulation","sliding-window","rolling-hash","hash-function"]}
|
||
{"id":188,"frontendId":188,"title":"Best Time to Buy and Sell Stock IV","titleSlug":"best-time-to-buy-and-sell-stock-iv","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":189,"frontendId":189,"title":"Rotate Array","titleSlug":"rotate-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","two-pointers"]}
|
||
{"id":190,"frontendId":190,"title":"Reverse Bits","titleSlug":"reverse-bits","difficulty":"EASY","paidOnly":false,"tags":["divide-and-conquer","bit-manipulation"]}
|
||
{"id":191,"frontendId":191,"title":"Number of 1 Bits","titleSlug":"number-of-1-bits","difficulty":"EASY","paidOnly":false,"tags":["divide-and-conquer","bit-manipulation"]}
|
||
{"id":192,"frontendId":192,"title":"Word Frequency","titleSlug":"word-frequency","difficulty":"MEDIUM","paidOnly":false,"tags":["shell"]}
|
||
{"id":193,"frontendId":193,"title":"Valid Phone Numbers","titleSlug":"valid-phone-numbers","difficulty":"EASY","paidOnly":false,"tags":["shell"]}
|
||
{"id":194,"frontendId":194,"title":"Transpose File","titleSlug":"transpose-file","difficulty":"MEDIUM","paidOnly":false,"tags":["shell"]}
|
||
{"id":195,"frontendId":195,"title":"Tenth Line","titleSlug":"tenth-line","difficulty":"EASY","paidOnly":false,"tags":["shell"]}
|
||
{"id":196,"frontendId":196,"title":"Delete Duplicate Emails","titleSlug":"delete-duplicate-emails","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":197,"frontendId":197,"title":"Rising Temperature","titleSlug":"rising-temperature","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":198,"frontendId":198,"title":"House Robber","titleSlug":"house-robber","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":199,"frontendId":199,"title":"Binary Tree Right Side View","titleSlug":"binary-tree-right-side-view","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":200,"frontendId":200,"title":"Number of Islands","titleSlug":"number-of-islands","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","union-find","matrix"]}
|
||
{"id":201,"frontendId":201,"title":"Bitwise AND of Numbers Range","titleSlug":"bitwise-and-of-numbers-range","difficulty":"MEDIUM","paidOnly":false,"tags":["bit-manipulation"]}
|
||
{"id":202,"frontendId":202,"title":"Happy Number","titleSlug":"happy-number","difficulty":"EASY","paidOnly":false,"tags":["hash-table","math","two-pointers"]}
|
||
{"id":203,"frontendId":203,"title":"Remove Linked List Elements","titleSlug":"remove-linked-list-elements","difficulty":"EASY","paidOnly":false,"tags":["linked-list","recursion"]}
|
||
{"id":204,"frontendId":204,"title":"Count Primes","titleSlug":"count-primes","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","enumeration","number-theory"]}
|
||
{"id":205,"frontendId":205,"title":"Isomorphic Strings","titleSlug":"isomorphic-strings","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":206,"frontendId":206,"title":"Reverse Linked List","titleSlug":"reverse-linked-list","difficulty":"EASY","paidOnly":false,"tags":["linked-list","recursion"]}
|
||
{"id":207,"frontendId":207,"title":"Course Schedule","titleSlug":"course-schedule","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","graph","topological-sort"]}
|
||
{"id":208,"frontendId":208,"title":"Implement Trie (Prefix Tree)","titleSlug":"implement-trie-prefix-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","design","trie"]}
|
||
{"id":209,"frontendId":209,"title":"Minimum Size Subarray Sum","titleSlug":"minimum-size-subarray-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","sliding-window","prefix-sum"]}
|
||
{"id":210,"frontendId":210,"title":"Course Schedule II","titleSlug":"course-schedule-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","graph","topological-sort"]}
|
||
{"id":211,"frontendId":211,"title":"Design Add and Search Words Data Structure","titleSlug":"design-add-and-search-words-data-structure","difficulty":"MEDIUM","paidOnly":false,"tags":["string","depth-first-search","design","trie"]}
|
||
{"id":212,"frontendId":212,"title":"Word Search II","titleSlug":"word-search-ii","difficulty":"HARD","paidOnly":false,"tags":["array","string","backtracking","trie","matrix"]}
|
||
{"id":213,"frontendId":213,"title":"House Robber II","titleSlug":"house-robber-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":214,"frontendId":214,"title":"Shortest Palindrome","titleSlug":"shortest-palindrome","difficulty":"HARD","paidOnly":false,"tags":["string","rolling-hash","string-matching","hash-function"]}
|
||
{"id":215,"frontendId":215,"title":"Kth Largest Element in an Array","titleSlug":"kth-largest-element-in-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","divide-and-conquer","sorting","heap-priority-queue","quickselect"]}
|
||
{"id":216,"frontendId":216,"title":"Combination Sum III","titleSlug":"combination-sum-iii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","backtracking"]}
|
||
{"id":217,"frontendId":217,"title":"Contains Duplicate","titleSlug":"contains-duplicate","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sorting"]}
|
||
{"id":218,"frontendId":218,"title":"The Skyline Problem","titleSlug":"the-skyline-problem","difficulty":"HARD","paidOnly":false,"tags":["array","divide-and-conquer","binary-indexed-tree","segment-tree","line-sweep","sorting","heap-priority-queue","ordered-set"]}
|
||
{"id":219,"frontendId":219,"title":"Contains Duplicate II","titleSlug":"contains-duplicate-ii","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sliding-window"]}
|
||
{"id":220,"frontendId":220,"title":"Contains Duplicate III","titleSlug":"contains-duplicate-iii","difficulty":"HARD","paidOnly":false,"tags":["array","sliding-window","sorting","bucket-sort","ordered-set"]}
|
||
{"id":221,"frontendId":221,"title":"Maximal Square","titleSlug":"maximal-square","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":222,"frontendId":222,"title":"Count Complete Tree Nodes","titleSlug":"count-complete-tree-nodes","difficulty":"EASY","paidOnly":false,"tags":["binary-search","bit-manipulation","tree","binary-tree"]}
|
||
{"id":223,"frontendId":223,"title":"Rectangle Area","titleSlug":"rectangle-area","difficulty":"MEDIUM","paidOnly":false,"tags":["math","geometry"]}
|
||
{"id":224,"frontendId":224,"title":"Basic Calculator","titleSlug":"basic-calculator","difficulty":"HARD","paidOnly":false,"tags":["math","string","stack","recursion"]}
|
||
{"id":225,"frontendId":225,"title":"Implement Stack using Queues","titleSlug":"implement-stack-using-queues","difficulty":"EASY","paidOnly":false,"tags":["stack","design","queue"]}
|
||
{"id":226,"frontendId":226,"title":"Invert Binary Tree","titleSlug":"invert-binary-tree","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":227,"frontendId":227,"title":"Basic Calculator II","titleSlug":"basic-calculator-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string","stack"]}
|
||
{"id":228,"frontendId":228,"title":"Summary Ranges","titleSlug":"summary-ranges","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":229,"frontendId":229,"title":"Majority Element II","titleSlug":"majority-element-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sorting","counting"]}
|
||
{"id":230,"frontendId":230,"title":"Kth Smallest Element in a BST","titleSlug":"kth-smallest-element-in-a-bst","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":231,"frontendId":231,"title":"Power of Two","titleSlug":"power-of-two","difficulty":"EASY","paidOnly":false,"tags":["math","bit-manipulation","recursion"]}
|
||
{"id":232,"frontendId":232,"title":"Implement Queue using Stacks","titleSlug":"implement-queue-using-stacks","difficulty":"EASY","paidOnly":false,"tags":["stack","design","queue"]}
|
||
{"id":233,"frontendId":233,"title":"Number of Digit One","titleSlug":"number-of-digit-one","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming","recursion"]}
|
||
{"id":234,"frontendId":234,"title":"Palindrome Linked List","titleSlug":"palindrome-linked-list","difficulty":"EASY","paidOnly":false,"tags":["linked-list","two-pointers","stack","recursion"]}
|
||
{"id":235,"frontendId":235,"title":"Lowest Common Ancestor of a Binary Search Tree","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":236,"frontendId":236,"title":"Lowest Common Ancestor of a Binary Tree","titleSlug":"lowest-common-ancestor-of-a-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":237,"frontendId":237,"title":"Delete Node in a Linked List","titleSlug":"delete-node-in-a-linked-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list"]}
|
||
{"id":238,"frontendId":238,"title":"Product of Array Except Self","titleSlug":"product-of-array-except-self","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":239,"frontendId":239,"title":"Sliding Window Maximum","titleSlug":"sliding-window-maximum","difficulty":"HARD","paidOnly":false,"tags":["array","queue","sliding-window","heap-priority-queue","monotonic-queue"]}
|
||
{"id":240,"frontendId":240,"title":"Search a 2D Matrix II","titleSlug":"search-a-2d-matrix-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","divide-and-conquer","matrix"]}
|
||
{"id":241,"frontendId":241,"title":"Different Ways to Add Parentheses","titleSlug":"different-ways-to-add-parentheses","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string","dynamic-programming","recursion","memoization"]}
|
||
{"id":242,"frontendId":242,"title":"Valid Anagram","titleSlug":"valid-anagram","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","sorting"]}
|
||
{"id":243,"frontendId":243,"title":"Shortest Word Distance","titleSlug":"shortest-word-distance","difficulty":"EASY","paidOnly":true,"tags":["array","string"]}
|
||
{"id":244,"frontendId":244,"title":"Shortest Word Distance II","titleSlug":"shortest-word-distance-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","two-pointers","string","design"]}
|
||
{"id":245,"frontendId":245,"title":"Shortest Word Distance III","titleSlug":"shortest-word-distance-iii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","string"]}
|
||
{"id":246,"frontendId":246,"title":"Strobogrammatic Number","titleSlug":"strobogrammatic-number","difficulty":"EASY","paidOnly":true,"tags":["hash-table","two-pointers","string"]}
|
||
{"id":247,"frontendId":247,"title":"Strobogrammatic Number II","titleSlug":"strobogrammatic-number-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","string","recursion"]}
|
||
{"id":248,"frontendId":248,"title":"Strobogrammatic Number III","titleSlug":"strobogrammatic-number-iii","difficulty":"HARD","paidOnly":true,"tags":["array","string","recursion"]}
|
||
{"id":249,"frontendId":249,"title":"Group Shifted Strings","titleSlug":"group-shifted-strings","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","string"]}
|
||
{"id":250,"frontendId":250,"title":"Count Univalue Subtrees","titleSlug":"count-univalue-subtrees","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":251,"frontendId":251,"title":"Flatten 2D Vector","titleSlug":"flatten-2d-vector","difficulty":"MEDIUM","paidOnly":true,"tags":["array","two-pointers","design","iterator"]}
|
||
{"id":252,"frontendId":252,"title":"Meeting Rooms","titleSlug":"meeting-rooms","difficulty":"EASY","paidOnly":true,"tags":["array","sorting"]}
|
||
{"id":253,"frontendId":253,"title":"Meeting Rooms II","titleSlug":"meeting-rooms-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","two-pointers","greedy","sorting","heap-priority-queue","prefix-sum"]}
|
||
{"id":254,"frontendId":254,"title":"Factor Combinations","titleSlug":"factor-combinations","difficulty":"MEDIUM","paidOnly":true,"tags":["backtracking"]}
|
||
{"id":255,"frontendId":255,"title":"Verify Preorder Sequence in Binary Search Tree","titleSlug":"verify-preorder-sequence-in-binary-search-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["array","stack","tree","binary-search-tree","recursion","monotonic-stack","binary-tree"]}
|
||
{"id":256,"frontendId":256,"title":"Paint House","titleSlug":"paint-house","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming"]}
|
||
{"id":257,"frontendId":257,"title":"Binary Tree Paths","titleSlug":"binary-tree-paths","difficulty":"EASY","paidOnly":false,"tags":["string","backtracking","tree","depth-first-search","binary-tree"]}
|
||
{"id":258,"frontendId":258,"title":"Add Digits","titleSlug":"add-digits","difficulty":"EASY","paidOnly":false,"tags":["math","simulation","number-theory"]}
|
||
{"id":259,"frontendId":259,"title":"3Sum Smaller","titleSlug":"3sum-smaller","difficulty":"MEDIUM","paidOnly":true,"tags":["array","two-pointers","binary-search","sorting"]}
|
||
{"id":260,"frontendId":260,"title":"Single Number III","titleSlug":"single-number-iii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation"]}
|
||
{"id":261,"frontendId":261,"title":"Graph Valid Tree","titleSlug":"graph-valid-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":262,"frontendId":262,"title":"Trips and Users","titleSlug":"trips-and-users","difficulty":"HARD","paidOnly":false,"tags":["database"]}
|
||
{"id":263,"frontendId":263,"title":"Ugly Number","titleSlug":"ugly-number","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":264,"frontendId":264,"title":"Ugly Number II","titleSlug":"ugly-number-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","math","dynamic-programming","heap-priority-queue"]}
|
||
{"id":265,"frontendId":265,"title":"Paint House II","titleSlug":"paint-house-ii","difficulty":"HARD","paidOnly":true,"tags":["array","dynamic-programming"]}
|
||
{"id":266,"frontendId":266,"title":"Palindrome Permutation","titleSlug":"palindrome-permutation","difficulty":"EASY","paidOnly":true,"tags":["hash-table","string","bit-manipulation"]}
|
||
{"id":267,"frontendId":267,"title":"Palindrome Permutation II","titleSlug":"palindrome-permutation-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","backtracking"]}
|
||
{"id":268,"frontendId":268,"title":"Missing Number","titleSlug":"missing-number","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","math","binary-search","bit-manipulation","sorting"]}
|
||
{"id":269,"frontendId":269,"title":"Alien Dictionary","titleSlug":"alien-dictionary","difficulty":"HARD","paidOnly":true,"tags":["array","string","depth-first-search","breadth-first-search","graph","topological-sort"]}
|
||
{"id":270,"frontendId":270,"title":"Closest Binary Search Tree Value","titleSlug":"closest-binary-search-tree-value","difficulty":"EASY","paidOnly":true,"tags":["binary-search","tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":271,"frontendId":271,"title":"Encode and Decode Strings","titleSlug":"encode-and-decode-strings","difficulty":"MEDIUM","paidOnly":true,"tags":["array","string","design"]}
|
||
{"id":272,"frontendId":272,"title":"Closest Binary Search Tree Value II","titleSlug":"closest-binary-search-tree-value-ii","difficulty":"HARD","paidOnly":true,"tags":["two-pointers","stack","tree","depth-first-search","binary-search-tree","heap-priority-queue","binary-tree"]}
|
||
{"id":273,"frontendId":273,"title":"Integer to English Words","titleSlug":"integer-to-english-words","difficulty":"HARD","paidOnly":false,"tags":["math","string","recursion"]}
|
||
{"id":274,"frontendId":274,"title":"H-Index","titleSlug":"h-index","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting","counting-sort"]}
|
||
{"id":275,"frontendId":275,"title":"H-Index II","titleSlug":"h-index-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":276,"frontendId":276,"title":"Paint Fence","titleSlug":"paint-fence","difficulty":"MEDIUM","paidOnly":true,"tags":["dynamic-programming"]}
|
||
{"id":277,"frontendId":277,"title":"Find the Celebrity","titleSlug":"find-the-celebrity","difficulty":"MEDIUM","paidOnly":true,"tags":["two-pointers","graph","interactive"]}
|
||
{"id":278,"frontendId":278,"title":"First Bad Version","titleSlug":"first-bad-version","difficulty":"EASY","paidOnly":false,"tags":["binary-search","interactive"]}
|
||
{"id":279,"frontendId":279,"title":"Perfect Squares","titleSlug":"perfect-squares","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming","breadth-first-search"]}
|
||
{"id":280,"frontendId":280,"title":"Wiggle Sort","titleSlug":"wiggle-sort","difficulty":"MEDIUM","paidOnly":true,"tags":["array","greedy","sorting"]}
|
||
{"id":281,"frontendId":281,"title":"Zigzag Iterator","titleSlug":"zigzag-iterator","difficulty":"MEDIUM","paidOnly":true,"tags":["array","design","queue","iterator"]}
|
||
{"id":282,"frontendId":282,"title":"Expression Add Operators","titleSlug":"expression-add-operators","difficulty":"HARD","paidOnly":false,"tags":["math","string","backtracking"]}
|
||
{"id":283,"frontendId":283,"title":"Move Zeroes","titleSlug":"move-zeroes","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers"]}
|
||
{"id":284,"frontendId":284,"title":"Peeking Iterator","titleSlug":"peeking-iterator","difficulty":"MEDIUM","paidOnly":false,"tags":["array","design","iterator"]}
|
||
{"id":285,"frontendId":285,"title":"Inorder Successor in BST","titleSlug":"inorder-successor-in-bst","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":286,"frontendId":286,"title":"Walls and Gates","titleSlug":"walls-and-gates","difficulty":"MEDIUM","paidOnly":true,"tags":["array","breadth-first-search","matrix"]}
|
||
{"id":287,"frontendId":287,"title":"Find the Duplicate Number","titleSlug":"find-the-duplicate-number","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","bit-manipulation"]}
|
||
{"id":288,"frontendId":288,"title":"Unique Word Abbreviation","titleSlug":"unique-word-abbreviation","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","string","design"]}
|
||
{"id":289,"frontendId":289,"title":"Game of Life","titleSlug":"game-of-life","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","simulation"]}
|
||
{"id":290,"frontendId":290,"title":"Word Pattern","titleSlug":"word-pattern","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":291,"frontendId":291,"title":"Word Pattern II","titleSlug":"word-pattern-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","backtracking"]}
|
||
{"id":292,"frontendId":292,"title":"Nim Game","titleSlug":"nim-game","difficulty":"EASY","paidOnly":false,"tags":["math","brainteaser","game-theory"]}
|
||
{"id":293,"frontendId":293,"title":"Flip Game","titleSlug":"flip-game","difficulty":"EASY","paidOnly":true,"tags":["string"]}
|
||
{"id":294,"frontendId":294,"title":"Flip Game II","titleSlug":"flip-game-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["math","dynamic-programming","backtracking","memoization","game-theory"]}
|
||
{"id":295,"frontendId":295,"title":"Find Median from Data Stream","titleSlug":"find-median-from-data-stream","difficulty":"HARD","paidOnly":false,"tags":["two-pointers","design","sorting","heap-priority-queue","data-stream"]}
|
||
{"id":296,"frontendId":296,"title":"Best Meeting Point","titleSlug":"best-meeting-point","difficulty":"HARD","paidOnly":true,"tags":["array","math","sorting","matrix"]}
|
||
{"id":297,"frontendId":297,"title":"Serialize and Deserialize Binary Tree","titleSlug":"serialize-and-deserialize-binary-tree","difficulty":"HARD","paidOnly":false,"tags":["string","tree","depth-first-search","breadth-first-search","design","binary-tree"]}
|
||
{"id":298,"frontendId":298,"title":"Binary Tree Longest Consecutive Sequence","titleSlug":"binary-tree-longest-consecutive-sequence","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":299,"frontendId":299,"title":"Bulls and Cows","titleSlug":"bulls-and-cows","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":300,"frontendId":300,"title":"Longest Increasing Subsequence","titleSlug":"longest-increasing-subsequence","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","dynamic-programming"]}
|
||
{"id":301,"frontendId":301,"title":"Remove Invalid Parentheses","titleSlug":"remove-invalid-parentheses","difficulty":"HARD","paidOnly":false,"tags":["string","backtracking","breadth-first-search"]}
|
||
{"id":302,"frontendId":302,"title":"Smallest Rectangle Enclosing Black Pixels","titleSlug":"smallest-rectangle-enclosing-black-pixels","difficulty":"HARD","paidOnly":true,"tags":["array","binary-search","depth-first-search","breadth-first-search","matrix"]}
|
||
{"id":303,"frontendId":303,"title":"Range Sum Query - Immutable","titleSlug":"range-sum-query-immutable","difficulty":"EASY","paidOnly":false,"tags":["array","design","prefix-sum"]}
|
||
{"id":304,"frontendId":304,"title":"Range Sum Query 2D - Immutable","titleSlug":"range-sum-query-2d-immutable","difficulty":"MEDIUM","paidOnly":false,"tags":["array","design","matrix","prefix-sum"]}
|
||
{"id":305,"frontendId":305,"title":"Number of Islands II","titleSlug":"number-of-islands-ii","difficulty":"HARD","paidOnly":true,"tags":["array","hash-table","union-find"]}
|
||
{"id":306,"frontendId":306,"title":"Additive Number","titleSlug":"additive-number","difficulty":"MEDIUM","paidOnly":false,"tags":["string","backtracking"]}
|
||
{"id":307,"frontendId":307,"title":"Range Sum Query - Mutable","titleSlug":"range-sum-query-mutable","difficulty":"MEDIUM","paidOnly":false,"tags":["array","divide-and-conquer","design","binary-indexed-tree","segment-tree"]}
|
||
{"id":308,"frontendId":308,"title":"Range Sum Query 2D - Mutable","titleSlug":"range-sum-query-2d-mutable","difficulty":"MEDIUM","paidOnly":true,"tags":["array","design","binary-indexed-tree","segment-tree","matrix"]}
|
||
{"id":309,"frontendId":309,"title":"Best Time to Buy and Sell Stock with Cooldown","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":310,"frontendId":310,"title":"Minimum Height Trees","titleSlug":"minimum-height-trees","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","graph","topological-sort"]}
|
||
{"id":311,"frontendId":311,"title":"Sparse Matrix Multiplication","titleSlug":"sparse-matrix-multiplication","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","matrix"]}
|
||
{"id":312,"frontendId":312,"title":"Burst Balloons","titleSlug":"burst-balloons","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":313,"frontendId":313,"title":"Super Ugly Number","titleSlug":"super-ugly-number","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","dynamic-programming"]}
|
||
{"id":314,"frontendId":314,"title":"Binary Tree Vertical Order Traversal","titleSlug":"binary-tree-vertical-order-traversal","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","tree","depth-first-search","breadth-first-search","sorting","binary-tree"]}
|
||
{"id":315,"frontendId":315,"title":"Count of Smaller Numbers After Self","titleSlug":"count-of-smaller-numbers-after-self","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","divide-and-conquer","binary-indexed-tree","segment-tree","merge-sort","ordered-set"]}
|
||
{"id":316,"frontendId":316,"title":"Remove Duplicate Letters","titleSlug":"remove-duplicate-letters","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","greedy","monotonic-stack"]}
|
||
{"id":317,"frontendId":317,"title":"Shortest Distance from All Buildings","titleSlug":"shortest-distance-from-all-buildings","difficulty":"HARD","paidOnly":true,"tags":["array","breadth-first-search","matrix"]}
|
||
{"id":318,"frontendId":318,"title":"Maximum Product of Word Lengths","titleSlug":"maximum-product-of-word-lengths","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","bit-manipulation"]}
|
||
{"id":319,"frontendId":319,"title":"Bulb Switcher","titleSlug":"bulb-switcher","difficulty":"MEDIUM","paidOnly":false,"tags":["math","brainteaser"]}
|
||
{"id":320,"frontendId":320,"title":"Generalized Abbreviation","titleSlug":"generalized-abbreviation","difficulty":"MEDIUM","paidOnly":true,"tags":["string","backtracking","bit-manipulation"]}
|
||
{"id":321,"frontendId":321,"title":"Create Maximum Number","titleSlug":"create-maximum-number","difficulty":"HARD","paidOnly":false,"tags":["array","two-pointers","stack","greedy","monotonic-stack"]}
|
||
{"id":322,"frontendId":322,"title":"Coin Change","titleSlug":"coin-change","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","breadth-first-search"]}
|
||
{"id":323,"frontendId":323,"title":"Number of Connected Components in an Undirected Graph","titleSlug":"number-of-connected-components-in-an-undirected-graph","difficulty":"MEDIUM","paidOnly":true,"tags":["depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":324,"frontendId":324,"title":"Wiggle Sort II","titleSlug":"wiggle-sort-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","divide-and-conquer","greedy","sorting","quickselect"]}
|
||
{"id":325,"frontendId":325,"title":"Maximum Size Subarray Sum Equals k","titleSlug":"maximum-size-subarray-sum-equals-k","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":326,"frontendId":326,"title":"Power of Three","titleSlug":"power-of-three","difficulty":"EASY","paidOnly":false,"tags":["math","recursion"]}
|
||
{"id":327,"frontendId":327,"title":"Count of Range Sum","titleSlug":"count-of-range-sum","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","divide-and-conquer","binary-indexed-tree","segment-tree","merge-sort","ordered-set"]}
|
||
{"id":328,"frontendId":328,"title":"Odd Even Linked List","titleSlug":"odd-even-linked-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list"]}
|
||
{"id":329,"frontendId":329,"title":"Longest Increasing Path in a Matrix","titleSlug":"longest-increasing-path-in-a-matrix","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","depth-first-search","breadth-first-search","graph","topological-sort","memoization","matrix"]}
|
||
{"id":330,"frontendId":330,"title":"Patching Array","titleSlug":"patching-array","difficulty":"HARD","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":331,"frontendId":331,"title":"Verify Preorder Serialization of a Binary Tree","titleSlug":"verify-preorder-serialization-of-a-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","tree","binary-tree"]}
|
||
{"id":332,"frontendId":332,"title":"Reconstruct Itinerary","titleSlug":"reconstruct-itinerary","difficulty":"HARD","paidOnly":false,"tags":["array","string","depth-first-search","graph","sorting","heap-priority-queue","eulerian-circuit"]}
|
||
{"id":333,"frontendId":333,"title":"Largest BST Subtree","titleSlug":"largest-bst-subtree","difficulty":"MEDIUM","paidOnly":true,"tags":["dynamic-programming","tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":334,"frontendId":334,"title":"Increasing Triplet Subsequence","titleSlug":"increasing-triplet-subsequence","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":335,"frontendId":335,"title":"Self Crossing","titleSlug":"self-crossing","difficulty":"HARD","paidOnly":false,"tags":["array","math","geometry"]}
|
||
{"id":336,"frontendId":336,"title":"Palindrome Pairs","titleSlug":"palindrome-pairs","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","string","trie"]}
|
||
{"id":337,"frontendId":337,"title":"House Robber III","titleSlug":"house-robber-iii","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming","tree","depth-first-search","binary-tree"]}
|
||
{"id":338,"frontendId":338,"title":"Counting Bits","titleSlug":"counting-bits","difficulty":"EASY","paidOnly":false,"tags":["dynamic-programming","bit-manipulation"]}
|
||
{"id":339,"frontendId":339,"title":"Nested List Weight Sum","titleSlug":"nested-list-weight-sum","difficulty":"MEDIUM","paidOnly":true,"tags":["depth-first-search","breadth-first-search"]}
|
||
{"id":340,"frontendId":340,"title":"Longest Substring with At Most K Distinct Characters","titleSlug":"longest-substring-with-at-most-k-distinct-characters","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":341,"frontendId":341,"title":"Flatten Nested List Iterator","titleSlug":"flatten-nested-list-iterator","difficulty":"MEDIUM","paidOnly":false,"tags":["stack","tree","depth-first-search","design","queue","iterator"]}
|
||
{"id":342,"frontendId":342,"title":"Power of Four","titleSlug":"power-of-four","difficulty":"EASY","paidOnly":false,"tags":["math","bit-manipulation","recursion"]}
|
||
{"id":343,"frontendId":343,"title":"Integer Break","titleSlug":"integer-break","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming"]}
|
||
{"id":344,"frontendId":344,"title":"Reverse String","titleSlug":"reverse-string","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":345,"frontendId":345,"title":"Reverse Vowels of a String","titleSlug":"reverse-vowels-of-a-string","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":346,"frontendId":346,"title":"Moving Average from Data Stream","titleSlug":"moving-average-from-data-stream","difficulty":"EASY","paidOnly":true,"tags":["array","design","queue","data-stream"]}
|
||
{"id":347,"frontendId":347,"title":"Top K Frequent Elements","titleSlug":"top-k-frequent-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","divide-and-conquer","sorting","heap-priority-queue","bucket-sort","counting","quickselect"]}
|
||
{"id":348,"frontendId":348,"title":"Design Tic-Tac-Toe","titleSlug":"design-tic-tac-toe","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","design","matrix","simulation"]}
|
||
{"id":349,"frontendId":349,"title":"Intersection of Two Arrays","titleSlug":"intersection-of-two-arrays","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","two-pointers","binary-search","sorting"]}
|
||
{"id":350,"frontendId":350,"title":"Intersection of Two Arrays II","titleSlug":"intersection-of-two-arrays-ii","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","two-pointers","binary-search","sorting"]}
|
||
{"id":351,"frontendId":351,"title":"Android Unlock Patterns","titleSlug":"android-unlock-patterns","difficulty":"MEDIUM","paidOnly":true,"tags":["dynamic-programming","backtracking","bit-manipulation","bitmask"]}
|
||
{"id":352,"frontendId":352,"title":"Data Stream as Disjoint Intervals","titleSlug":"data-stream-as-disjoint-intervals","difficulty":"HARD","paidOnly":false,"tags":["hash-table","binary-search","union-find","design","data-stream","ordered-set"]}
|
||
{"id":353,"frontendId":353,"title":"Design Snake Game","titleSlug":"design-snake-game","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","design","queue","simulation"]}
|
||
{"id":354,"frontendId":354,"title":"Russian Doll Envelopes","titleSlug":"russian-doll-envelopes","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","dynamic-programming","sorting"]}
|
||
{"id":355,"frontendId":355,"title":"Design Twitter","titleSlug":"design-twitter","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","linked-list","design","heap-priority-queue"]}
|
||
{"id":356,"frontendId":356,"title":"Line Reflection","titleSlug":"line-reflection","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","math"]}
|
||
{"id":357,"frontendId":357,"title":"Count Numbers with Unique Digits","titleSlug":"count-numbers-with-unique-digits","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming","backtracking"]}
|
||
{"id":358,"frontendId":358,"title":"Rearrange String k Distance Apart","titleSlug":"rearrange-string-k-distance-apart","difficulty":"HARD","paidOnly":true,"tags":["hash-table","string","greedy","sorting","heap-priority-queue","counting"]}
|
||
{"id":359,"frontendId":359,"title":"Logger Rate Limiter","titleSlug":"logger-rate-limiter","difficulty":"EASY","paidOnly":true,"tags":["hash-table","design","data-stream"]}
|
||
{"id":360,"frontendId":360,"title":"Sort Transformed Array","titleSlug":"sort-transformed-array","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","two-pointers","sorting"]}
|
||
{"id":361,"frontendId":361,"title":"Bomb Enemy","titleSlug":"bomb-enemy","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":362,"frontendId":362,"title":"Design Hit Counter","titleSlug":"design-hit-counter","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search","design","queue","data-stream"]}
|
||
{"id":363,"frontendId":363,"title":"Max Sum of Rectangle No Larger Than K","titleSlug":"max-sum-of-rectangle-no-larger-than-k","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","matrix","prefix-sum","ordered-set"]}
|
||
{"id":364,"frontendId":364,"title":"Nested List Weight Sum II","titleSlug":"nested-list-weight-sum-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["stack","depth-first-search","breadth-first-search"]}
|
||
{"id":365,"frontendId":365,"title":"Water and Jug Problem","titleSlug":"water-and-jug-problem","difficulty":"MEDIUM","paidOnly":false,"tags":["math","depth-first-search","breadth-first-search"]}
|
||
{"id":366,"frontendId":366,"title":"Find Leaves of Binary Tree","titleSlug":"find-leaves-of-binary-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":367,"frontendId":367,"title":"Valid Perfect Square","titleSlug":"valid-perfect-square","difficulty":"EASY","paidOnly":false,"tags":["math","binary-search"]}
|
||
{"id":368,"frontendId":368,"title":"Largest Divisible Subset","titleSlug":"largest-divisible-subset","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","dynamic-programming","sorting"]}
|
||
{"id":369,"frontendId":369,"title":"Plus One Linked List","titleSlug":"plus-one-linked-list","difficulty":"MEDIUM","paidOnly":true,"tags":["linked-list","math"]}
|
||
{"id":370,"frontendId":370,"title":"Range Addition","titleSlug":"range-addition","difficulty":"MEDIUM","paidOnly":true,"tags":["array","prefix-sum"]}
|
||
{"id":371,"frontendId":371,"title":"Sum of Two Integers","titleSlug":"sum-of-two-integers","difficulty":"MEDIUM","paidOnly":false,"tags":["math","bit-manipulation"]}
|
||
{"id":372,"frontendId":372,"title":"Super Pow","titleSlug":"super-pow","difficulty":"MEDIUM","paidOnly":false,"tags":["math","divide-and-conquer"]}
|
||
{"id":373,"frontendId":373,"title":"Find K Pairs with Smallest Sums","titleSlug":"find-k-pairs-with-smallest-sums","difficulty":"MEDIUM","paidOnly":false,"tags":["array","heap-priority-queue"]}
|
||
{"id":374,"frontendId":374,"title":"Guess Number Higher or Lower","titleSlug":"guess-number-higher-or-lower","difficulty":"EASY","paidOnly":false,"tags":["binary-search","interactive"]}
|
||
{"id":375,"frontendId":375,"title":"Guess Number Higher or Lower II","titleSlug":"guess-number-higher-or-lower-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming","game-theory"]}
|
||
{"id":376,"frontendId":376,"title":"Wiggle Subsequence","titleSlug":"wiggle-subsequence","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","greedy"]}
|
||
{"id":377,"frontendId":377,"title":"Combination Sum IV","titleSlug":"combination-sum-iv","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":378,"frontendId":378,"title":"Kth Smallest Element in a Sorted Matrix","titleSlug":"kth-smallest-element-in-a-sorted-matrix","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","sorting","heap-priority-queue","matrix"]}
|
||
{"id":379,"frontendId":379,"title":"Design Phone Directory","titleSlug":"design-phone-directory","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","linked-list","design","queue"]}
|
||
{"id":380,"frontendId":380,"title":"Insert Delete GetRandom O(1)","titleSlug":"insert-delete-getrandom-o1","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","design","randomized"]}
|
||
{"id":381,"frontendId":381,"title":"Insert Delete GetRandom O(1) - Duplicates allowed","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","design","randomized"]}
|
||
{"id":382,"frontendId":382,"title":"Linked List Random Node","titleSlug":"linked-list-random-node","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","math","reservoir-sampling","randomized"]}
|
||
{"id":383,"frontendId":383,"title":"Ransom Note","titleSlug":"ransom-note","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":384,"frontendId":384,"title":"Shuffle an Array","titleSlug":"shuffle-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","design","randomized"]}
|
||
{"id":385,"frontendId":385,"title":"Mini Parser","titleSlug":"mini-parser","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","depth-first-search"]}
|
||
{"id":386,"frontendId":386,"title":"Lexicographical Numbers","titleSlug":"lexicographical-numbers","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","trie"]}
|
||
{"id":387,"frontendId":387,"title":"First Unique Character in a String","titleSlug":"first-unique-character-in-a-string","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","queue","counting"]}
|
||
{"id":388,"frontendId":388,"title":"Longest Absolute File Path","titleSlug":"longest-absolute-file-path","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","depth-first-search"]}
|
||
{"id":389,"frontendId":389,"title":"Find the Difference","titleSlug":"find-the-difference","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","bit-manipulation","sorting"]}
|
||
{"id":390,"frontendId":390,"title":"Elimination Game","titleSlug":"elimination-game","difficulty":"MEDIUM","paidOnly":false,"tags":["math","recursion"]}
|
||
{"id":391,"frontendId":391,"title":"Perfect Rectangle","titleSlug":"perfect-rectangle","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","geometry","line-sweep"]}
|
||
{"id":392,"frontendId":392,"title":"Is Subsequence","titleSlug":"is-subsequence","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string","dynamic-programming"]}
|
||
{"id":393,"frontendId":393,"title":"UTF-8 Validation","titleSlug":"utf-8-validation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation"]}
|
||
{"id":394,"frontendId":394,"title":"Decode String","titleSlug":"decode-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","recursion"]}
|
||
{"id":395,"frontendId":395,"title":"Longest Substring with At Least K Repeating Characters","titleSlug":"longest-substring-with-at-least-k-repeating-characters","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","divide-and-conquer","sliding-window"]}
|
||
{"id":396,"frontendId":396,"title":"Rotate Function","titleSlug":"rotate-function","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","dynamic-programming"]}
|
||
{"id":397,"frontendId":397,"title":"Integer Replacement","titleSlug":"integer-replacement","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming","greedy","bit-manipulation","memoization"]}
|
||
{"id":398,"frontendId":398,"title":"Random Pick Index","titleSlug":"random-pick-index","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","math","reservoir-sampling","randomized"]}
|
||
{"id":399,"frontendId":399,"title":"Evaluate Division","titleSlug":"evaluate-division","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","depth-first-search","breadth-first-search","union-find","graph","shortest-path"]}
|
||
{"id":400,"frontendId":400,"title":"Nth Digit","titleSlug":"nth-digit","difficulty":"MEDIUM","paidOnly":false,"tags":["math","binary-search"]}
|
||
{"id":401,"frontendId":401,"title":"Binary Watch","titleSlug":"binary-watch","difficulty":"EASY","paidOnly":false,"tags":["backtracking","bit-manipulation"]}
|
||
{"id":402,"frontendId":402,"title":"Remove K Digits","titleSlug":"remove-k-digits","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","greedy","monotonic-stack"]}
|
||
{"id":403,"frontendId":403,"title":"Frog Jump","titleSlug":"frog-jump","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":404,"frontendId":404,"title":"Sum of Left Leaves","titleSlug":"sum-of-left-leaves","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":405,"frontendId":405,"title":"Convert a Number to Hexadecimal","titleSlug":"convert-a-number-to-hexadecimal","difficulty":"EASY","paidOnly":false,"tags":["math","string","bit-manipulation"]}
|
||
{"id":406,"frontendId":406,"title":"Queue Reconstruction by Height","titleSlug":"queue-reconstruction-by-height","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-indexed-tree","segment-tree","sorting"]}
|
||
{"id":407,"frontendId":407,"title":"Trapping Rain Water II","titleSlug":"trapping-rain-water-ii","difficulty":"HARD","paidOnly":false,"tags":["array","breadth-first-search","heap-priority-queue","matrix"]}
|
||
{"id":408,"frontendId":408,"title":"Valid Word Abbreviation","titleSlug":"valid-word-abbreviation","difficulty":"EASY","paidOnly":true,"tags":["two-pointers","string"]}
|
||
{"id":409,"frontendId":409,"title":"Longest Palindrome","titleSlug":"longest-palindrome","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","greedy"]}
|
||
{"id":410,"frontendId":410,"title":"Split Array Largest Sum","titleSlug":"split-array-largest-sum","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","dynamic-programming","greedy","prefix-sum"]}
|
||
{"id":411,"frontendId":411,"title":"Minimum Unique Word Abbreviation","titleSlug":"minimum-unique-word-abbreviation","difficulty":"HARD","paidOnly":true,"tags":["array","string","backtracking","bit-manipulation"]}
|
||
{"id":412,"frontendId":412,"title":"Fizz Buzz","titleSlug":"fizz-buzz","difficulty":"EASY","paidOnly":false,"tags":["math","string","simulation"]}
|
||
{"id":413,"frontendId":413,"title":"Arithmetic Slices","titleSlug":"arithmetic-slices","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","sliding-window"]}
|
||
{"id":414,"frontendId":414,"title":"Third Maximum Number","titleSlug":"third-maximum-number","difficulty":"EASY","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":415,"frontendId":415,"title":"Add Strings","titleSlug":"add-strings","difficulty":"EASY","paidOnly":false,"tags":["math","string","simulation"]}
|
||
{"id":416,"frontendId":416,"title":"Partition Equal Subset Sum","titleSlug":"partition-equal-subset-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":417,"frontendId":417,"title":"Pacific Atlantic Water Flow","titleSlug":"pacific-atlantic-water-flow","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","matrix"]}
|
||
{"id":418,"frontendId":418,"title":"Sentence Screen Fitting","titleSlug":"sentence-screen-fitting","difficulty":"MEDIUM","paidOnly":true,"tags":["array","string","dynamic-programming"]}
|
||
{"id":419,"frontendId":419,"title":"Battleships in a Board","titleSlug":"battleships-in-a-board","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","matrix"]}
|
||
{"id":420,"frontendId":420,"title":"Strong Password Checker","titleSlug":"strong-password-checker","difficulty":"HARD","paidOnly":false,"tags":["string","greedy","heap-priority-queue"]}
|
||
{"id":421,"frontendId":421,"title":"Maximum XOR of Two Numbers in an Array","titleSlug":"maximum-xor-of-two-numbers-in-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","bit-manipulation","trie"]}
|
||
{"id":422,"frontendId":422,"title":"Valid Word Square","titleSlug":"valid-word-square","difficulty":"EASY","paidOnly":true,"tags":["array","matrix"]}
|
||
{"id":423,"frontendId":423,"title":"Reconstruct Original Digits from English","titleSlug":"reconstruct-original-digits-from-english","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","math","string"]}
|
||
{"id":424,"frontendId":424,"title":"Longest Repeating Character Replacement","titleSlug":"longest-repeating-character-replacement","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":425,"frontendId":425,"title":"Word Squares","titleSlug":"word-squares","difficulty":"HARD","paidOnly":true,"tags":["array","string","backtracking","trie"]}
|
||
{"id":432,"frontendId":432,"title":"All O`one Data Structure","titleSlug":"all-oone-data-structure","difficulty":"HARD","paidOnly":false,"tags":["hash-table","linked-list","design","doubly-linked-list"]}
|
||
{"id":433,"frontendId":433,"title":"Minimum Genetic Mutation","titleSlug":"minimum-genetic-mutation","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","breadth-first-search"]}
|
||
{"id":434,"frontendId":434,"title":"Number of Segments in a String","titleSlug":"number-of-segments-in-a-string","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":435,"frontendId":435,"title":"Non-overlapping Intervals","titleSlug":"non-overlapping-intervals","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","greedy","sorting"]}
|
||
{"id":436,"frontendId":436,"title":"Find Right Interval","titleSlug":"find-right-interval","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","sorting"]}
|
||
{"id":437,"frontendId":437,"title":"Path Sum III","titleSlug":"path-sum-iii","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":438,"frontendId":438,"title":"Find All Anagrams in a String","titleSlug":"find-all-anagrams-in-a-string","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":439,"frontendId":439,"title":"Ternary Expression Parser","titleSlug":"ternary-expression-parser","difficulty":"MEDIUM","paidOnly":true,"tags":["string","stack","recursion"]}
|
||
{"id":440,"frontendId":440,"title":"K-th Smallest in Lexicographical Order","titleSlug":"k-th-smallest-in-lexicographical-order","difficulty":"HARD","paidOnly":false,"tags":["trie"]}
|
||
{"id":441,"frontendId":441,"title":"Arranging Coins","titleSlug":"arranging-coins","difficulty":"EASY","paidOnly":false,"tags":["math","binary-search"]}
|
||
{"id":442,"frontendId":442,"title":"Find All Duplicates in an Array","titleSlug":"find-all-duplicates-in-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sorting"]}
|
||
{"id":443,"frontendId":443,"title":"String Compression","titleSlug":"string-compression","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":444,"frontendId":444,"title":"Sequence Reconstruction","titleSlug":"sequence-reconstruction","difficulty":"MEDIUM","paidOnly":true,"tags":["array","graph","topological-sort"]}
|
||
{"id":445,"frontendId":445,"title":"Add Two Numbers II","titleSlug":"add-two-numbers-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","math","stack"]}
|
||
{"id":446,"frontendId":446,"title":"Arithmetic Slices II - Subsequence","titleSlug":"arithmetic-slices-ii-subsequence","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":447,"frontendId":447,"title":"Number of Boomerangs","titleSlug":"number-of-boomerangs","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math"]}
|
||
{"id":448,"frontendId":448,"title":"Find All Numbers Disappeared in an Array","titleSlug":"find-all-numbers-disappeared-in-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":449,"frontendId":449,"title":"Serialize and Deserialize BST","titleSlug":"serialize-and-deserialize-bst","difficulty":"MEDIUM","paidOnly":false,"tags":["string","tree","depth-first-search","breadth-first-search","design","binary-search-tree","binary-tree"]}
|
||
{"id":450,"frontendId":450,"title":"Delete Node in a BST","titleSlug":"delete-node-in-a-bst","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","binary-search-tree","binary-tree"]}
|
||
{"id":451,"frontendId":451,"title":"Sort Characters By Frequency","titleSlug":"sort-characters-by-frequency","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sorting","heap-priority-queue","bucket-sort","counting"]}
|
||
{"id":452,"frontendId":452,"title":"Minimum Number of Arrows to Burst Balloons","titleSlug":"minimum-number-of-arrows-to-burst-balloons","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":453,"frontendId":453,"title":"Minimum Moves to Equal Array Elements","titleSlug":"minimum-moves-to-equal-array-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math"]}
|
||
{"id":454,"frontendId":454,"title":"4Sum II","titleSlug":"4sum-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":455,"frontendId":455,"title":"Assign Cookies","titleSlug":"assign-cookies","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","greedy","sorting"]}
|
||
{"id":456,"frontendId":456,"title":"132 Pattern","titleSlug":"132-pattern","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","stack","monotonic-stack","ordered-set"]}
|
||
{"id":457,"frontendId":457,"title":"Circular Array Loop","titleSlug":"circular-array-loop","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","two-pointers"]}
|
||
{"id":458,"frontendId":458,"title":"Poor Pigs","titleSlug":"poor-pigs","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming","combinatorics"]}
|
||
{"id":459,"frontendId":459,"title":"Repeated Substring Pattern","titleSlug":"repeated-substring-pattern","difficulty":"EASY","paidOnly":false,"tags":["string","string-matching"]}
|
||
{"id":460,"frontendId":460,"title":"LFU Cache","titleSlug":"lfu-cache","difficulty":"HARD","paidOnly":false,"tags":["hash-table","linked-list","design","doubly-linked-list"]}
|
||
{"id":461,"frontendId":461,"title":"Hamming Distance","titleSlug":"hamming-distance","difficulty":"EASY","paidOnly":false,"tags":["bit-manipulation"]}
|
||
{"id":462,"frontendId":462,"title":"Minimum Moves to Equal Array Elements II","titleSlug":"minimum-moves-to-equal-array-elements-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","sorting"]}
|
||
{"id":463,"frontendId":463,"title":"Island Perimeter","titleSlug":"island-perimeter","difficulty":"EASY","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","matrix"]}
|
||
{"id":464,"frontendId":464,"title":"Can I Win","titleSlug":"can-i-win","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming","bit-manipulation","memoization","game-theory","bitmask"]}
|
||
{"id":465,"frontendId":465,"title":"Optimal Account Balancing","titleSlug":"optimal-account-balancing","difficulty":"HARD","paidOnly":true,"tags":["array","dynamic-programming","backtracking","bit-manipulation","bitmask"]}
|
||
{"id":466,"frontendId":466,"title":"Count The Repetitions","titleSlug":"count-the-repetitions","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":467,"frontendId":467,"title":"Unique Substrings in Wraparound String","titleSlug":"unique-substrings-in-wraparound-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":468,"frontendId":468,"title":"Validate IP Address","titleSlug":"validate-ip-address","difficulty":"MEDIUM","paidOnly":false,"tags":["string"]}
|
||
{"id":469,"frontendId":469,"title":"Convex Polygon","titleSlug":"convex-polygon","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","geometry"]}
|
||
{"id":471,"frontendId":471,"title":"Encode String with Shortest Length","titleSlug":"encode-string-with-shortest-length","difficulty":"HARD","paidOnly":true,"tags":["string","dynamic-programming"]}
|
||
{"id":472,"frontendId":472,"title":"Concatenated Words","titleSlug":"concatenated-words","difficulty":"HARD","paidOnly":false,"tags":["array","string","dynamic-programming","depth-first-search","trie","sorting"]}
|
||
{"id":473,"frontendId":473,"title":"Matchsticks to Square","titleSlug":"matchsticks-to-square","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","backtracking","bit-manipulation","bitmask"]}
|
||
{"id":474,"frontendId":474,"title":"Ones and Zeroes","titleSlug":"ones-and-zeroes","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","dynamic-programming"]}
|
||
{"id":475,"frontendId":475,"title":"Heaters","titleSlug":"heaters","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","sorting"]}
|
||
{"id":476,"frontendId":476,"title":"Number Complement","titleSlug":"number-complement","difficulty":"EASY","paidOnly":false,"tags":["bit-manipulation"]}
|
||
{"id":477,"frontendId":477,"title":"Total Hamming Distance","titleSlug":"total-hamming-distance","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","bit-manipulation"]}
|
||
{"id":479,"frontendId":479,"title":"Largest Palindrome Product","titleSlug":"largest-palindrome-product","difficulty":"HARD","paidOnly":false,"tags":["math","enumeration"]}
|
||
{"id":480,"frontendId":480,"title":"Sliding Window Median","titleSlug":"sliding-window-median","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","sliding-window","heap-priority-queue"]}
|
||
{"id":481,"frontendId":481,"title":"Magical String","titleSlug":"magical-string","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":482,"frontendId":482,"title":"License Key Formatting","titleSlug":"license-key-formatting","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":483,"frontendId":483,"title":"Smallest Good Base","titleSlug":"smallest-good-base","difficulty":"HARD","paidOnly":false,"tags":["math","binary-search"]}
|
||
{"id":484,"frontendId":484,"title":"Find Permutation","titleSlug":"find-permutation","difficulty":"MEDIUM","paidOnly":true,"tags":["array","string","stack","greedy"]}
|
||
{"id":485,"frontendId":485,"title":"Max Consecutive Ones","titleSlug":"max-consecutive-ones","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":486,"frontendId":486,"title":"Predict the Winner","titleSlug":"predict-the-winner","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","dynamic-programming","recursion","game-theory"]}
|
||
{"id":487,"frontendId":487,"title":"Max Consecutive Ones II","titleSlug":"max-consecutive-ones-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming","sliding-window"]}
|
||
{"id":488,"frontendId":488,"title":"Zuma Game","titleSlug":"zuma-game","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming","stack","breadth-first-search","memoization"]}
|
||
{"id":489,"frontendId":1643,"title":"Kth Smallest Instructions","titleSlug":"kth-smallest-instructions","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","combinatorics"]}
|
||
{"id":490,"frontendId":490,"title":"The Maze","titleSlug":"the-maze","difficulty":"MEDIUM","paidOnly":true,"tags":["array","depth-first-search","breadth-first-search","matrix"]}
|
||
{"id":491,"frontendId":491,"title":"Non-decreasing Subsequences","titleSlug":"non-decreasing-subsequences","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","backtracking","bit-manipulation"]}
|
||
{"id":492,"frontendId":492,"title":"Construct the Rectangle","titleSlug":"construct-the-rectangle","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":493,"frontendId":493,"title":"Reverse Pairs","titleSlug":"reverse-pairs","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","divide-and-conquer","binary-indexed-tree","segment-tree","merge-sort","ordered-set"]}
|
||
{"id":494,"frontendId":494,"title":"Target Sum","titleSlug":"target-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","backtracking"]}
|
||
{"id":495,"frontendId":495,"title":"Teemo Attacking","titleSlug":"teemo-attacking","difficulty":"EASY","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":496,"frontendId":496,"title":"Next Greater Element I","titleSlug":"next-greater-element-i","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","stack","monotonic-stack"]}
|
||
{"id":498,"frontendId":498,"title":"Diagonal Traverse","titleSlug":"diagonal-traverse","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","simulation"]}
|
||
{"id":499,"frontendId":499,"title":"The Maze III","titleSlug":"the-maze-iii","difficulty":"HARD","paidOnly":true,"tags":["array","string","depth-first-search","breadth-first-search","graph","heap-priority-queue","matrix","shortest-path"]}
|
||
{"id":500,"frontendId":500,"title":"Keyboard Row","titleSlug":"keyboard-row","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":501,"frontendId":501,"title":"Find Mode in Binary Search Tree","titleSlug":"find-mode-in-binary-search-tree","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":502,"frontendId":502,"title":"IPO","titleSlug":"ipo","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","sorting","heap-priority-queue"]}
|
||
{"id":503,"frontendId":503,"title":"Next Greater Element II","titleSlug":"next-greater-element-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","monotonic-stack"]}
|
||
{"id":504,"frontendId":504,"title":"Base 7","titleSlug":"base-7","difficulty":"EASY","paidOnly":false,"tags":["math","string"]}
|
||
{"id":505,"frontendId":505,"title":"The Maze II","titleSlug":"the-maze-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","depth-first-search","breadth-first-search","graph","heap-priority-queue","matrix","shortest-path"]}
|
||
{"id":506,"frontendId":506,"title":"Relative Ranks","titleSlug":"relative-ranks","difficulty":"EASY","paidOnly":false,"tags":["array","sorting","heap-priority-queue"]}
|
||
{"id":507,"frontendId":507,"title":"Perfect Number","titleSlug":"perfect-number","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":508,"frontendId":508,"title":"Most Frequent Subtree Sum","titleSlug":"most-frequent-subtree-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","tree","depth-first-search","binary-tree"]}
|
||
{"id":509,"frontendId":510,"title":"Inorder Successor in BST II","titleSlug":"inorder-successor-in-bst-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","binary-search-tree","binary-tree"]}
|
||
{"id":510,"frontendId":2031,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","binary-search","divide-and-conquer","binary-indexed-tree","segment-tree","merge-sort","ordered-set"]}
|
||
{"id":511,"frontendId":1059,"title":"All Paths from Source Lead to Destination","titleSlug":"all-paths-from-source-lead-to-destination","difficulty":"MEDIUM","paidOnly":true,"tags":["graph","topological-sort"]}
|
||
{"id":512,"frontendId":2036,"title":"Maximum Alternating Subarray Sum","titleSlug":"maximum-alternating-subarray-sum","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming"]}
|
||
{"id":513,"frontendId":513,"title":"Find Bottom Left Tree Value","titleSlug":"find-bottom-left-tree-value","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":514,"frontendId":514,"title":"Freedom Trail","titleSlug":"freedom-trail","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming","depth-first-search","breadth-first-search"]}
|
||
{"id":515,"frontendId":515,"title":"Find Largest Value in Each Tree Row","titleSlug":"find-largest-value-in-each-tree-row","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":516,"frontendId":516,"title":"Longest Palindromic Subsequence","titleSlug":"longest-palindromic-subsequence","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":517,"frontendId":517,"title":"Super Washing Machines","titleSlug":"super-washing-machines","difficulty":"HARD","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":518,"frontendId":518,"title":"Coin Change II","titleSlug":"coin-change-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":519,"frontendId":1983,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":520,"frontendId":520,"title":"Detect Capital","titleSlug":"detect-capital","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":521,"frontendId":521,"title":"Longest Uncommon Subsequence I","titleSlug":"longest-uncommon-subsequence-i","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":522,"frontendId":522,"title":"Longest Uncommon Subsequence II","titleSlug":"longest-uncommon-subsequence-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","two-pointers","string","sorting"]}
|
||
{"id":523,"frontendId":523,"title":"Continuous Subarray Sum","titleSlug":"continuous-subarray-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","prefix-sum"]}
|
||
{"id":524,"frontendId":524,"title":"Longest Word in Dictionary through Deleting","titleSlug":"longest-word-in-dictionary-through-deleting","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","string","sorting"]}
|
||
{"id":525,"frontendId":525,"title":"Contiguous Array","titleSlug":"contiguous-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":526,"frontendId":526,"title":"Beautiful Arrangement","titleSlug":"beautiful-arrangement","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","backtracking","bit-manipulation","bitmask"]}
|
||
{"id":527,"frontendId":527,"title":"Word Abbreviation","titleSlug":"word-abbreviation","difficulty":"HARD","paidOnly":true,"tags":["array","string","greedy","trie","sorting"]}
|
||
{"id":528,"frontendId":1721,"title":"Swapping Nodes in a Linked List","titleSlug":"swapping-nodes-in-a-linked-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","two-pointers"]}
|
||
{"id":529,"frontendId":529,"title":"Minesweeper","titleSlug":"minesweeper","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","matrix"]}
|
||
{"id":530,"frontendId":530,"title":"Minimum Absolute Difference in BST","titleSlug":"minimum-absolute-difference-in-bst","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":531,"frontendId":531,"title":"Lonely Pixel I","titleSlug":"lonely-pixel-i","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","matrix"]}
|
||
{"id":532,"frontendId":532,"title":"K-diff Pairs in an Array","titleSlug":"k-diff-pairs-in-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","two-pointers","binary-search","sorting"]}
|
||
{"id":533,"frontendId":533,"title":"Lonely Pixel II","titleSlug":"lonely-pixel-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","matrix"]}
|
||
{"id":535,"frontendId":535,"title":"Encode and Decode TinyURL","titleSlug":"encode-and-decode-tinyurl","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","design","hash-function"]}
|
||
{"id":536,"frontendId":536,"title":"Construct Binary Tree from String","titleSlug":"construct-binary-tree-from-string","difficulty":"MEDIUM","paidOnly":true,"tags":["string","stack","tree","depth-first-search","binary-tree"]}
|
||
{"id":537,"frontendId":537,"title":"Complex Number Multiplication","titleSlug":"complex-number-multiplication","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string","simulation"]}
|
||
{"id":538,"frontendId":538,"title":"Convert BST to Greater Tree","titleSlug":"convert-bst-to-greater-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":539,"frontendId":539,"title":"Minimum Time Difference","titleSlug":"minimum-time-difference","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","string","sorting"]}
|
||
{"id":540,"frontendId":540,"title":"Single Element in a Sorted Array","titleSlug":"single-element-in-a-sorted-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":541,"frontendId":541,"title":"Reverse String II","titleSlug":"reverse-string-ii","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":542,"frontendId":542,"title":"01 Matrix","titleSlug":"01-matrix","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","breadth-first-search","matrix"]}
|
||
{"id":543,"frontendId":543,"title":"Diameter of Binary Tree","titleSlug":"diameter-of-binary-tree","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":544,"frontendId":544,"title":"Output Contest Matches","titleSlug":"output-contest-matches","difficulty":"MEDIUM","paidOnly":true,"tags":["string","recursion","simulation"]}
|
||
{"id":545,"frontendId":545,"title":"Boundary of Binary Tree","titleSlug":"boundary-of-binary-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":546,"frontendId":546,"title":"Remove Boxes","titleSlug":"remove-boxes","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","memoization"]}
|
||
{"id":547,"frontendId":547,"title":"Number of Provinces","titleSlug":"number-of-provinces","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":548,"frontendId":548,"title":"Split Array with Equal Sum","titleSlug":"split-array-with-equal-sum","difficulty":"HARD","paidOnly":true,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":549,"frontendId":549,"title":"Binary Tree Longest Consecutive Sequence II","titleSlug":"binary-tree-longest-consecutive-sequence-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":550,"frontendId":1730,"title":"Shortest Path to Get Food","titleSlug":"shortest-path-to-get-food","difficulty":"MEDIUM","paidOnly":true,"tags":["array","breadth-first-search","matrix"]}
|
||
{"id":551,"frontendId":551,"title":"Student Attendance Record I","titleSlug":"student-attendance-record-i","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":552,"frontendId":552,"title":"Student Attendance Record II","titleSlug":"student-attendance-record-ii","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":553,"frontendId":553,"title":"Optimal Division","titleSlug":"optimal-division","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","dynamic-programming"]}
|
||
{"id":554,"frontendId":554,"title":"Brick Wall","titleSlug":"brick-wall","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":555,"frontendId":555,"title":"Split Concatenated Strings","titleSlug":"split-concatenated-strings","difficulty":"MEDIUM","paidOnly":true,"tags":["array","string","greedy"]}
|
||
{"id":556,"frontendId":556,"title":"Next Greater Element III","titleSlug":"next-greater-element-iii","difficulty":"MEDIUM","paidOnly":false,"tags":["math","two-pointers","string"]}
|
||
{"id":557,"frontendId":557,"title":"Reverse Words in a String III","titleSlug":"reverse-words-in-a-string-iii","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":560,"frontendId":560,"title":"Subarray Sum Equals K","titleSlug":"subarray-sum-equals-k","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":561,"frontendId":561,"title":"Array Partition","titleSlug":"array-partition","difficulty":"EASY","paidOnly":false,"tags":["array","greedy","sorting","counting-sort"]}
|
||
{"id":562,"frontendId":562,"title":"Longest Line of Consecutive One in Matrix","titleSlug":"longest-line-of-consecutive-one-in-matrix","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":563,"frontendId":563,"title":"Binary Tree Tilt","titleSlug":"binary-tree-tilt","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":564,"frontendId":564,"title":"Find the Closest Palindrome","titleSlug":"find-the-closest-palindrome","difficulty":"HARD","paidOnly":false,"tags":["math","string"]}
|
||
{"id":565,"frontendId":565,"title":"Array Nesting","titleSlug":"array-nesting","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search"]}
|
||
{"id":566,"frontendId":566,"title":"Reshape the Matrix","titleSlug":"reshape-the-matrix","difficulty":"EASY","paidOnly":false,"tags":["array","matrix","simulation"]}
|
||
{"id":567,"frontendId":567,"title":"Permutation in String","titleSlug":"permutation-in-string","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","two-pointers","string","sliding-window"]}
|
||
{"id":568,"frontendId":568,"title":"Maximum Vacation Days","titleSlug":"maximum-vacation-days","difficulty":"HARD","paidOnly":true,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":569,"frontendId":569,"title":"Median Employee Salary","titleSlug":"median-employee-salary","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":570,"frontendId":570,"title":"Managers with at Least 5 Direct Reports","titleSlug":"managers-with-at-least-5-direct-reports","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":571,"frontendId":571,"title":"Find Median Given Frequency of Numbers","titleSlug":"find-median-given-frequency-of-numbers","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":572,"frontendId":572,"title":"Subtree of Another Tree","titleSlug":"subtree-of-another-tree","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","string-matching","binary-tree","hash-function"]}
|
||
{"id":573,"frontendId":573,"title":"Squirrel Simulation","titleSlug":"squirrel-simulation","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math"]}
|
||
{"id":574,"frontendId":574,"title":"Winning Candidate","titleSlug":"winning-candidate","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":575,"frontendId":575,"title":"Distribute Candies","titleSlug":"distribute-candies","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":576,"frontendId":576,"title":"Out of Boundary Paths","titleSlug":"out-of-boundary-paths","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":577,"frontendId":577,"title":"Employee Bonus","titleSlug":"employee-bonus","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":578,"frontendId":578,"title":"Get Highest Answer Rate Question","titleSlug":"get-highest-answer-rate-question","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":579,"frontendId":579,"title":"Find Cumulative Salary of an Employee","titleSlug":"find-cumulative-salary-of-an-employee","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":580,"frontendId":580,"title":"Count Student Number in Departments","titleSlug":"count-student-number-in-departments","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":581,"frontendId":581,"title":"Shortest Unsorted Continuous Subarray","titleSlug":"shortest-unsorted-continuous-subarray","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","stack","greedy","sorting","monotonic-stack"]}
|
||
{"id":582,"frontendId":582,"title":"Kill Process","titleSlug":"kill-process","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","tree","depth-first-search","breadth-first-search"]}
|
||
{"id":583,"frontendId":583,"title":"Delete Operation for Two Strings","titleSlug":"delete-operation-for-two-strings","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":584,"frontendId":584,"title":"Find Customer Referee","titleSlug":"find-customer-referee","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":585,"frontendId":585,"title":"Investments in 2016","titleSlug":"investments-in-2016","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":586,"frontendId":586,"title":"Customer Placing the Largest Number of Orders","titleSlug":"customer-placing-the-largest-number-of-orders","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":587,"frontendId":587,"title":"Erect the Fence","titleSlug":"erect-the-fence","difficulty":"HARD","paidOnly":false,"tags":["array","math","geometry"]}
|
||
{"id":588,"frontendId":588,"title":"Design In-Memory File System","titleSlug":"design-in-memory-file-system","difficulty":"HARD","paidOnly":true,"tags":["hash-table","string","design","trie","sorting"]}
|
||
{"id":591,"frontendId":591,"title":"Tag Validator","titleSlug":"tag-validator","difficulty":"HARD","paidOnly":false,"tags":["string","stack"]}
|
||
{"id":592,"frontendId":592,"title":"Fraction Addition and Subtraction","titleSlug":"fraction-addition-and-subtraction","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string","simulation"]}
|
||
{"id":593,"frontendId":593,"title":"Valid Square","titleSlug":"valid-square","difficulty":"MEDIUM","paidOnly":false,"tags":["math","geometry"]}
|
||
{"id":594,"frontendId":594,"title":"Longest Harmonious Subsequence","titleSlug":"longest-harmonious-subsequence","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sliding-window","sorting","counting"]}
|
||
{"id":595,"frontendId":595,"title":"Big Countries","titleSlug":"big-countries","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":596,"frontendId":596,"title":"Classes With at Least 5 Students","titleSlug":"classes-with-at-least-5-students","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":597,"frontendId":597,"title":"Friend Requests I: Overall Acceptance Rate","titleSlug":"friend-requests-i-overall-acceptance-rate","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":598,"frontendId":598,"title":"Range Addition II","titleSlug":"range-addition-ii","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
|
||
{"id":599,"frontendId":599,"title":"Minimum Index Sum of Two Lists","titleSlug":"minimum-index-sum-of-two-lists","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":600,"frontendId":600,"title":"Non-negative Integers without Consecutive Ones","titleSlug":"non-negative-integers-without-consecutive-ones","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":601,"frontendId":601,"title":"Human Traffic of Stadium","titleSlug":"human-traffic-of-stadium","difficulty":"HARD","paidOnly":false,"tags":["database"]}
|
||
{"id":602,"frontendId":602,"title":"Friend Requests II: Who Has the Most Friends","titleSlug":"friend-requests-ii-who-has-the-most-friends","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":603,"frontendId":603,"title":"Consecutive Available Seats","titleSlug":"consecutive-available-seats","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":604,"frontendId":604,"title":"Design Compressed String Iterator","titleSlug":"design-compressed-string-iterator","difficulty":"EASY","paidOnly":true,"tags":["array","string","design","iterator"]}
|
||
{"id":605,"frontendId":605,"title":"Can Place Flowers","titleSlug":"can-place-flowers","difficulty":"EASY","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":606,"frontendId":606,"title":"Construct String from Binary Tree","titleSlug":"construct-string-from-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["string","tree","depth-first-search","binary-tree"]}
|
||
{"id":607,"frontendId":607,"title":"Sales Person","titleSlug":"sales-person","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":608,"frontendId":608,"title":"Tree Node","titleSlug":"tree-node","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":609,"frontendId":609,"title":"Find Duplicate File in System","titleSlug":"find-duplicate-file-in-system","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":610,"frontendId":610,"title":"Triangle Judgement","titleSlug":"triangle-judgement","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":611,"frontendId":611,"title":"Valid Triangle Number","titleSlug":"valid-triangle-number","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","greedy","sorting"]}
|
||
{"id":612,"frontendId":612,"title":"Shortest Distance in a Plane","titleSlug":"shortest-distance-in-a-plane","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":613,"frontendId":613,"title":"Shortest Distance in a Line","titleSlug":"shortest-distance-in-a-line","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":614,"frontendId":614,"title":"Second Degree Follower","titleSlug":"second-degree-follower","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":615,"frontendId":615,"title":"Average Salary: Departments VS Company","titleSlug":"average-salary-departments-vs-company","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":616,"frontendId":616,"title":"Add Bold Tag in String","titleSlug":"add-bold-tag-in-string","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","string","trie","string-matching"]}
|
||
{"id":617,"frontendId":617,"title":"Merge Two Binary Trees","titleSlug":"merge-two-binary-trees","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":618,"frontendId":618,"title":"Students Report By Geography","titleSlug":"students-report-by-geography","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":619,"frontendId":619,"title":"Biggest Single Number","titleSlug":"biggest-single-number","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":620,"frontendId":620,"title":"Not Boring Movies","titleSlug":"not-boring-movies","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":621,"frontendId":621,"title":"Task Scheduler","titleSlug":"task-scheduler","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","sorting","heap-priority-queue","counting"]}
|
||
{"id":623,"frontendId":623,"title":"Add One Row to Tree","titleSlug":"add-one-row-to-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":624,"frontendId":624,"title":"Maximum Distance in Arrays","titleSlug":"maximum-distance-in-arrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":625,"frontendId":625,"title":"Minimum Factorization","titleSlug":"minimum-factorization","difficulty":"MEDIUM","paidOnly":true,"tags":["math","greedy"]}
|
||
{"id":626,"frontendId":626,"title":"Exchange Seats","titleSlug":"exchange-seats","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":627,"frontendId":627,"title":"Swap Sex of Employees","titleSlug":"swap-sex-of-employees","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":628,"frontendId":628,"title":"Maximum Product of Three Numbers","titleSlug":"maximum-product-of-three-numbers","difficulty":"EASY","paidOnly":false,"tags":["array","math","sorting"]}
|
||
{"id":629,"frontendId":629,"title":"K Inverse Pairs Array","titleSlug":"k-inverse-pairs-array","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":630,"frontendId":630,"title":"Course Schedule III","titleSlug":"course-schedule-iii","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","sorting","heap-priority-queue"]}
|
||
{"id":631,"frontendId":631,"title":"Design Excel Sum Formula","titleSlug":"design-excel-sum-formula","difficulty":"HARD","paidOnly":true,"tags":["array","hash-table","string","graph","design","topological-sort","matrix"]}
|
||
{"id":632,"frontendId":632,"title":"Smallest Range Covering Elements from K Lists","titleSlug":"smallest-range-covering-elements-from-k-lists","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","greedy","sliding-window","sorting","heap-priority-queue"]}
|
||
{"id":633,"frontendId":633,"title":"Sum of Square Numbers","titleSlug":"sum-of-square-numbers","difficulty":"MEDIUM","paidOnly":false,"tags":["math","two-pointers","binary-search"]}
|
||
{"id":634,"frontendId":634,"title":"Find the Derangement of An Array","titleSlug":"find-the-derangement-of-an-array","difficulty":"MEDIUM","paidOnly":true,"tags":["math","dynamic-programming","combinatorics"]}
|
||
{"id":635,"frontendId":635,"title":"Design Log Storage System","titleSlug":"design-log-storage-system","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","design","ordered-set"]}
|
||
{"id":636,"frontendId":636,"title":"Exclusive Time of Functions","titleSlug":"exclusive-time-of-functions","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack"]}
|
||
{"id":637,"frontendId":637,"title":"Average of Levels in Binary Tree","titleSlug":"average-of-levels-in-binary-tree","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":638,"frontendId":638,"title":"Shopping Offers","titleSlug":"shopping-offers","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","backtracking","bit-manipulation","memoization","bitmask"]}
|
||
{"id":639,"frontendId":639,"title":"Decode Ways II","titleSlug":"decode-ways-ii","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":640,"frontendId":640,"title":"Solve the Equation","titleSlug":"solve-the-equation","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string","simulation"]}
|
||
{"id":642,"frontendId":642,"title":"Design Search Autocomplete System","titleSlug":"design-search-autocomplete-system","difficulty":"HARD","paidOnly":true,"tags":["string","depth-first-search","design","trie","sorting","heap-priority-queue","data-stream"]}
|
||
{"id":643,"frontendId":643,"title":"Maximum Average Subarray I","titleSlug":"maximum-average-subarray-i","difficulty":"EASY","paidOnly":false,"tags":["array","sliding-window"]}
|
||
{"id":644,"frontendId":644,"title":"Maximum Average Subarray II","titleSlug":"maximum-average-subarray-ii","difficulty":"HARD","paidOnly":true,"tags":["array","binary-search","prefix-sum"]}
|
||
{"id":645,"frontendId":645,"title":"Set Mismatch","titleSlug":"set-mismatch","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","bit-manipulation","sorting"]}
|
||
{"id":646,"frontendId":646,"title":"Maximum Length of Pair Chain","titleSlug":"maximum-length-of-pair-chain","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","greedy","sorting"]}
|
||
{"id":647,"frontendId":647,"title":"Palindromic Substrings","titleSlug":"palindromic-substrings","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string","dynamic-programming"]}
|
||
{"id":648,"frontendId":648,"title":"Replace Words","titleSlug":"replace-words","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","trie"]}
|
||
{"id":649,"frontendId":649,"title":"Dota2 Senate","titleSlug":"dota2-senate","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy","queue"]}
|
||
{"id":650,"frontendId":650,"title":"2 Keys Keyboard","titleSlug":"2-keys-keyboard","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming"]}
|
||
{"id":651,"frontendId":651,"title":"4 Keys Keyboard","titleSlug":"4-keys-keyboard","difficulty":"MEDIUM","paidOnly":true,"tags":["math","dynamic-programming"]}
|
||
{"id":652,"frontendId":652,"title":"Find Duplicate Subtrees","titleSlug":"find-duplicate-subtrees","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","tree","depth-first-search","binary-tree"]}
|
||
{"id":653,"frontendId":653,"title":"Two Sum IV - Input is a BST","titleSlug":"two-sum-iv-input-is-a-bst","difficulty":"EASY","paidOnly":false,"tags":["hash-table","two-pointers","tree","depth-first-search","breadth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":654,"frontendId":654,"title":"Maximum Binary Tree","titleSlug":"maximum-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["array","divide-and-conquer","stack","tree","monotonic-stack","binary-tree"]}
|
||
{"id":655,"frontendId":655,"title":"Print Binary Tree","titleSlug":"print-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":656,"frontendId":656,"title":"Coin Path","titleSlug":"coin-path","difficulty":"HARD","paidOnly":true,"tags":["array","dynamic-programming"]}
|
||
{"id":657,"frontendId":657,"title":"Robot Return to Origin","titleSlug":"robot-return-to-origin","difficulty":"EASY","paidOnly":false,"tags":["string","simulation"]}
|
||
{"id":658,"frontendId":658,"title":"Find K Closest Elements","titleSlug":"find-k-closest-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","sliding-window","sorting","heap-priority-queue"]}
|
||
{"id":659,"frontendId":659,"title":"Split Array into Consecutive Subsequences","titleSlug":"split-array-into-consecutive-subsequences","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","heap-priority-queue"]}
|
||
{"id":660,"frontendId":660,"title":"Remove 9","titleSlug":"remove-9","difficulty":"HARD","paidOnly":true,"tags":["math"]}
|
||
{"id":661,"frontendId":661,"title":"Image Smoother","titleSlug":"image-smoother","difficulty":"EASY","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":662,"frontendId":662,"title":"Maximum Width of Binary Tree","titleSlug":"maximum-width-of-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":663,"frontendId":663,"title":"Equal Tree Partition","titleSlug":"equal-tree-partition","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":664,"frontendId":664,"title":"Strange Printer","titleSlug":"strange-printer","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":665,"frontendId":665,"title":"Non-decreasing Array","titleSlug":"non-decreasing-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array"]}
|
||
{"id":666,"frontendId":666,"title":"Path Sum IV","titleSlug":"path-sum-iv","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","tree","depth-first-search","binary-tree"]}
|
||
{"id":667,"frontendId":667,"title":"Beautiful Arrangement II","titleSlug":"beautiful-arrangement-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math"]}
|
||
{"id":668,"frontendId":668,"title":"Kth Smallest Number in Multiplication Table","titleSlug":"kth-smallest-number-in-multiplication-table","difficulty":"HARD","paidOnly":false,"tags":["math","binary-search"]}
|
||
{"id":669,"frontendId":669,"title":"Trim a Binary Search Tree","titleSlug":"trim-a-binary-search-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":670,"frontendId":670,"title":"Maximum Swap","titleSlug":"maximum-swap","difficulty":"MEDIUM","paidOnly":false,"tags":["math","greedy"]}
|
||
{"id":671,"frontendId":671,"title":"Second Minimum Node In a Binary Tree","titleSlug":"second-minimum-node-in-a-binary-tree","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":672,"frontendId":672,"title":"Bulb Switcher II","titleSlug":"bulb-switcher-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["math","bit-manipulation","depth-first-search","breadth-first-search"]}
|
||
{"id":673,"frontendId":673,"title":"Number of Longest Increasing Subsequence","titleSlug":"number-of-longest-increasing-subsequence","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","binary-indexed-tree","segment-tree"]}
|
||
{"id":674,"frontendId":674,"title":"Longest Continuous Increasing Subsequence","titleSlug":"longest-continuous-increasing-subsequence","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":675,"frontendId":675,"title":"Cut Off Trees for Golf Event","titleSlug":"cut-off-trees-for-golf-event","difficulty":"HARD","paidOnly":false,"tags":["array","breadth-first-search","heap-priority-queue","matrix"]}
|
||
{"id":676,"frontendId":676,"title":"Implement Magic Dictionary","titleSlug":"implement-magic-dictionary","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","depth-first-search","design","trie"]}
|
||
{"id":677,"frontendId":677,"title":"Map Sum Pairs","titleSlug":"map-sum-pairs","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","design","trie"]}
|
||
{"id":678,"frontendId":678,"title":"Valid Parenthesis String","titleSlug":"valid-parenthesis-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming","stack","greedy"]}
|
||
{"id":679,"frontendId":679,"title":"24 Game","titleSlug":"24-game","difficulty":"HARD","paidOnly":false,"tags":["array","math","backtracking"]}
|
||
{"id":680,"frontendId":680,"title":"Valid Palindrome II","titleSlug":"valid-palindrome-ii","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string","greedy"]}
|
||
{"id":681,"frontendId":681,"title":"Next Closest Time","titleSlug":"next-closest-time","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","backtracking","enumeration"]}
|
||
{"id":682,"frontendId":682,"title":"Baseball Game","titleSlug":"baseball-game","difficulty":"EASY","paidOnly":false,"tags":["array","stack","simulation"]}
|
||
{"id":683,"frontendId":683,"title":"K Empty Slots","titleSlug":"k-empty-slots","difficulty":"HARD","paidOnly":true,"tags":["array","binary-indexed-tree","segment-tree","queue","sliding-window","heap-priority-queue","ordered-set","monotonic-queue"]}
|
||
{"id":684,"frontendId":684,"title":"Redundant Connection","titleSlug":"redundant-connection","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":685,"frontendId":685,"title":"Redundant Connection II","titleSlug":"redundant-connection-ii","difficulty":"HARD","paidOnly":false,"tags":["depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":686,"frontendId":686,"title":"Repeated String Match","titleSlug":"repeated-string-match","difficulty":"MEDIUM","paidOnly":false,"tags":["string","string-matching"]}
|
||
{"id":687,"frontendId":687,"title":"Longest Univalue Path","titleSlug":"longest-univalue-path","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":688,"frontendId":688,"title":"Knight Probability in Chessboard","titleSlug":"knight-probability-in-chessboard","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":689,"frontendId":689,"title":"Maximum Sum of 3 Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","sliding-window","prefix-sum"]}
|
||
{"id":690,"frontendId":690,"title":"Employee Importance","titleSlug":"employee-importance","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","tree","depth-first-search","breadth-first-search"]}
|
||
{"id":691,"frontendId":691,"title":"Stickers to Spell Word","titleSlug":"stickers-to-spell-word","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","string","dynamic-programming","backtracking","bit-manipulation","memoization","bitmask"]}
|
||
{"id":692,"frontendId":692,"title":"Top K Frequent Words","titleSlug":"top-k-frequent-words","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","trie","sorting","heap-priority-queue","bucket-sort","counting"]}
|
||
{"id":693,"frontendId":693,"title":"Binary Number with Alternating Bits","titleSlug":"binary-number-with-alternating-bits","difficulty":"EASY","paidOnly":false,"tags":["bit-manipulation"]}
|
||
{"id":694,"frontendId":694,"title":"Number of Distinct Islands","titleSlug":"number-of-distinct-islands","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","depth-first-search","breadth-first-search","union-find","sorting","matrix","hash-function"]}
|
||
{"id":695,"frontendId":695,"title":"Max Area of Island","titleSlug":"max-area-of-island","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","union-find","matrix"]}
|
||
{"id":696,"frontendId":696,"title":"Count Binary Substrings","titleSlug":"count-binary-substrings","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":697,"frontendId":697,"title":"Degree of an Array","titleSlug":"degree-of-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":698,"frontendId":698,"title":"Partition to K Equal Sum Subsets","titleSlug":"partition-to-k-equal-sum-subsets","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","backtracking","bit-manipulation","memoization","bitmask"]}
|
||
{"id":699,"frontendId":699,"title":"Falling Squares","titleSlug":"falling-squares","difficulty":"HARD","paidOnly":false,"tags":["array","segment-tree","ordered-set"]}
|
||
{"id":711,"frontendId":711,"title":"Number of Distinct Islands II","titleSlug":"number-of-distinct-islands-ii","difficulty":"HARD","paidOnly":true,"tags":["array","hash-table","depth-first-search","breadth-first-search","union-find","sorting","matrix","hash-function"]}
|
||
{"id":712,"frontendId":712,"title":"Minimum ASCII Delete Sum for Two Strings","titleSlug":"minimum-ascii-delete-sum-for-two-strings","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":713,"frontendId":713,"title":"Subarray Product Less Than K","titleSlug":"subarray-product-less-than-k","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","sliding-window","prefix-sum"]}
|
||
{"id":714,"frontendId":714,"title":"Best Time to Buy and Sell Stock with Transaction Fee","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","greedy"]}
|
||
{"id":715,"frontendId":715,"title":"Range Module","titleSlug":"range-module","difficulty":"HARD","paidOnly":false,"tags":["design","segment-tree","ordered-set"]}
|
||
{"id":716,"frontendId":716,"title":"Max Stack","titleSlug":"max-stack","difficulty":"HARD","paidOnly":true,"tags":["linked-list","stack","design","doubly-linked-list","ordered-set"]}
|
||
{"id":717,"frontendId":717,"title":"1-bit and 2-bit Characters","titleSlug":"1-bit-and-2-bit-characters","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":718,"frontendId":718,"title":"Maximum Length of Repeated Subarray","titleSlug":"maximum-length-of-repeated-subarray","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","dynamic-programming","sliding-window","rolling-hash","hash-function"]}
|
||
{"id":719,"frontendId":719,"title":"Find K-th Smallest Pair Distance","titleSlug":"find-k-th-smallest-pair-distance","difficulty":"HARD","paidOnly":false,"tags":["array","two-pointers","binary-search","sorting"]}
|
||
{"id":720,"frontendId":720,"title":"Longest Word in Dictionary","titleSlug":"longest-word-in-dictionary","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","trie","sorting"]}
|
||
{"id":721,"frontendId":721,"title":"Accounts Merge","titleSlug":"accounts-merge","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","depth-first-search","breadth-first-search","union-find","sorting"]}
|
||
{"id":722,"frontendId":722,"title":"Remove Comments","titleSlug":"remove-comments","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string"]}
|
||
{"id":723,"frontendId":723,"title":"Candy Crush","titleSlug":"candy-crush","difficulty":"MEDIUM","paidOnly":true,"tags":["array","two-pointers","matrix","simulation"]}
|
||
{"id":724,"frontendId":724,"title":"Find Pivot Index","titleSlug":"find-pivot-index","difficulty":"EASY","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":725,"frontendId":725,"title":"Split Linked List in Parts","titleSlug":"split-linked-list-in-parts","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list"]}
|
||
{"id":726,"frontendId":726,"title":"Number of Atoms","titleSlug":"number-of-atoms","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","stack","sorting"]}
|
||
{"id":727,"frontendId":727,"title":"Minimum Window Subsequence","titleSlug":"minimum-window-subsequence","difficulty":"HARD","paidOnly":true,"tags":["string","dynamic-programming","sliding-window"]}
|
||
{"id":728,"frontendId":728,"title":"Self Dividing Numbers","titleSlug":"self-dividing-numbers","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":729,"frontendId":729,"title":"My Calendar I","titleSlug":"my-calendar-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","design","segment-tree","ordered-set"]}
|
||
{"id":730,"frontendId":730,"title":"Count Different Palindromic Subsequences","titleSlug":"count-different-palindromic-subsequences","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":731,"frontendId":731,"title":"My Calendar II","titleSlug":"my-calendar-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","design","segment-tree","prefix-sum","ordered-set"]}
|
||
{"id":732,"frontendId":732,"title":"My Calendar III","titleSlug":"my-calendar-iii","difficulty":"HARD","paidOnly":false,"tags":["binary-search","design","segment-tree","prefix-sum","ordered-set"]}
|
||
{"id":733,"frontendId":733,"title":"Flood Fill","titleSlug":"flood-fill","difficulty":"EASY","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","matrix"]}
|
||
{"id":734,"frontendId":734,"title":"Sentence Similarity","titleSlug":"sentence-similarity","difficulty":"EASY","paidOnly":true,"tags":["array","hash-table","string"]}
|
||
{"id":735,"frontendId":735,"title":"Asteroid Collision","titleSlug":"asteroid-collision","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","simulation"]}
|
||
{"id":736,"frontendId":736,"title":"Parse Lisp Expression","titleSlug":"parse-lisp-expression","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","stack","recursion"]}
|
||
{"id":737,"frontendId":737,"title":"Sentence Similarity II","titleSlug":"sentence-similarity-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","string","depth-first-search","breadth-first-search","union-find"]}
|
||
{"id":738,"frontendId":738,"title":"Monotone Increasing Digits","titleSlug":"monotone-increasing-digits","difficulty":"MEDIUM","paidOnly":false,"tags":["math","greedy"]}
|
||
{"id":739,"frontendId":739,"title":"Daily Temperatures","titleSlug":"daily-temperatures","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","monotonic-stack"]}
|
||
{"id":740,"frontendId":740,"title":"Delete and Earn","titleSlug":"delete-and-earn","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","dynamic-programming"]}
|
||
{"id":741,"frontendId":741,"title":"Cherry Pickup","titleSlug":"cherry-pickup","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":742,"frontendId":709,"title":"To Lower Case","titleSlug":"to-lower-case","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":743,"frontendId":742,"title":"Closest Leaf in a Binary Tree","titleSlug":"closest-leaf-in-a-binary-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":744,"frontendId":743,"title":"Network Delay Time","titleSlug":"network-delay-time","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","graph","heap-priority-queue","shortest-path"]}
|
||
{"id":745,"frontendId":744,"title":"Find Smallest Letter Greater Than Target","titleSlug":"find-smallest-letter-greater-than-target","difficulty":"EASY","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":746,"frontendId":745,"title":"Prefix and Suffix Search","titleSlug":"prefix-and-suffix-search","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","string","design","trie"]}
|
||
{"id":747,"frontendId":746,"title":"Min Cost Climbing Stairs","titleSlug":"min-cost-climbing-stairs","difficulty":"EASY","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":748,"frontendId":747,"title":"Largest Number At Least Twice of Others","titleSlug":"largest-number-at-least-twice-of-others","difficulty":"EASY","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":749,"frontendId":748,"title":"Shortest Completing Word","titleSlug":"shortest-completing-word","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":750,"frontendId":749,"title":"Contain Virus","titleSlug":"contain-virus","difficulty":"HARD","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","matrix","simulation"]}
|
||
{"id":751,"frontendId":750,"title":"Number Of Corner Rectangles","titleSlug":"number-of-corner-rectangles","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","dynamic-programming","matrix"]}
|
||
{"id":752,"frontendId":751,"title":"IP to CIDR","titleSlug":"ip-to-cidr","difficulty":"MEDIUM","paidOnly":true,"tags":["string","bit-manipulation"]}
|
||
{"id":753,"frontendId":752,"title":"Open the Lock","titleSlug":"open-the-lock","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","breadth-first-search"]}
|
||
{"id":754,"frontendId":753,"title":"Cracking the Safe","titleSlug":"cracking-the-safe","difficulty":"HARD","paidOnly":false,"tags":["string","depth-first-search","graph","eulerian-circuit"]}
|
||
{"id":755,"frontendId":754,"title":"Reach a Number","titleSlug":"reach-a-number","difficulty":"MEDIUM","paidOnly":false,"tags":["math","binary-search"]}
|
||
{"id":756,"frontendId":755,"title":"Pour Water","titleSlug":"pour-water","difficulty":"MEDIUM","paidOnly":true,"tags":["array","simulation"]}
|
||
{"id":757,"frontendId":756,"title":"Pyramid Transition Matrix","titleSlug":"pyramid-transition-matrix","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","backtracking","bit-manipulation"]}
|
||
{"id":758,"frontendId":426,"title":"Convert Binary Search Tree to Sorted Doubly Linked List","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list","difficulty":"MEDIUM","paidOnly":true,"tags":["linked-list","stack","tree","depth-first-search","binary-search-tree","binary-tree","doubly-linked-list"]}
|
||
{"id":759,"frontendId":757,"title":"Set Intersection Size At Least Two","titleSlug":"set-intersection-size-at-least-two","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":760,"frontendId":758,"title":"Bold Words in String","titleSlug":"bold-words-in-string","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","string","trie","string-matching"]}
|
||
{"id":761,"frontendId":759,"title":"Employee Free Time","titleSlug":"employee-free-time","difficulty":"HARD","paidOnly":true,"tags":["array","line-sweep","sorting","heap-priority-queue"]}
|
||
{"id":762,"frontendId":760,"title":"Find Anagram Mappings","titleSlug":"find-anagram-mappings","difficulty":"EASY","paidOnly":true,"tags":["array","hash-table"]}
|
||
{"id":763,"frontendId":761,"title":"Special Binary String","titleSlug":"special-binary-string","difficulty":"HARD","paidOnly":false,"tags":["string","divide-and-conquer","sorting"]}
|
||
{"id":764,"frontendId":429,"title":"N-ary Tree Level Order Traversal","titleSlug":"n-ary-tree-level-order-traversal","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","breadth-first-search"]}
|
||
{"id":765,"frontendId":428,"title":"Serialize and Deserialize N-ary Tree","titleSlug":"serialize-and-deserialize-n-ary-tree","difficulty":"HARD","paidOnly":true,"tags":["string","tree","depth-first-search","breadth-first-search"]}
|
||
{"id":766,"frontendId":430,"title":"Flatten a Multilevel Doubly Linked List","titleSlug":"flatten-a-multilevel-doubly-linked-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","depth-first-search","doubly-linked-list"]}
|
||
{"id":767,"frontendId":762,"title":"Prime Number of Set Bits in Binary Representation","titleSlug":"prime-number-of-set-bits-in-binary-representation","difficulty":"EASY","paidOnly":false,"tags":["math","bit-manipulation"]}
|
||
{"id":768,"frontendId":763,"title":"Partition Labels","titleSlug":"partition-labels","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","two-pointers","string","greedy"]}
|
||
{"id":769,"frontendId":764,"title":"Largest Plus Sign","titleSlug":"largest-plus-sign","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":770,"frontendId":765,"title":"Couples Holding Hands","titleSlug":"couples-holding-hands","difficulty":"HARD","paidOnly":false,"tags":["greedy","depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":771,"frontendId":431,"title":"Encode N-ary Tree to Binary Tree","titleSlug":"encode-n-ary-tree-to-binary-tree","difficulty":"HARD","paidOnly":true,"tags":["tree","depth-first-search","breadth-first-search","design","binary-tree"]}
|
||
{"id":772,"frontendId":427,"title":"Construct Quad Tree","titleSlug":"construct-quad-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["array","divide-and-conquer","tree","matrix"]}
|
||
{"id":773,"frontendId":558,"title":"Logical OR of Two Binary Grids Represented as Quad-Trees","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees","difficulty":"MEDIUM","paidOnly":false,"tags":["divide-and-conquer","tree"]}
|
||
{"id":774,"frontendId":559,"title":"Maximum Depth of N-ary Tree","titleSlug":"maximum-depth-of-n-ary-tree","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search"]}
|
||
{"id":775,"frontendId":589,"title":"N-ary Tree Preorder Traversal","titleSlug":"n-ary-tree-preorder-traversal","difficulty":"EASY","paidOnly":false,"tags":["stack","tree","depth-first-search"]}
|
||
{"id":776,"frontendId":590,"title":"N-ary Tree Postorder Traversal","titleSlug":"n-ary-tree-postorder-traversal","difficulty":"EASY","paidOnly":false,"tags":["stack","tree","depth-first-search"]}
|
||
{"id":777,"frontendId":766,"title":"Toeplitz Matrix","titleSlug":"toeplitz-matrix","difficulty":"EASY","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":778,"frontendId":767,"title":"Reorganize String","titleSlug":"reorganize-string","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","greedy","sorting","heap-priority-queue","counting"]}
|
||
{"id":779,"frontendId":768,"title":"Max Chunks To Make Sorted II","titleSlug":"max-chunks-to-make-sorted-ii","difficulty":"HARD","paidOnly":false,"tags":["array","stack","greedy","sorting","monotonic-stack"]}
|
||
{"id":780,"frontendId":769,"title":"Max Chunks To Make Sorted","titleSlug":"max-chunks-to-make-sorted","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","greedy","sorting","monotonic-stack"]}
|
||
{"id":781,"frontendId":770,"title":"Basic Calculator IV","titleSlug":"basic-calculator-iv","difficulty":"HARD","paidOnly":false,"tags":["hash-table","math","string","stack","recursion"]}
|
||
{"id":782,"frontendId":771,"title":"Jewels and Stones","titleSlug":"jewels-and-stones","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":783,"frontendId":700,"title":"Search in a Binary Search Tree","titleSlug":"search-in-a-binary-search-tree","difficulty":"EASY","paidOnly":false,"tags":["tree","binary-search-tree","binary-tree"]}
|
||
{"id":784,"frontendId":701,"title":"Insert into a Binary Search Tree","titleSlug":"insert-into-a-binary-search-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","binary-search-tree","binary-tree"]}
|
||
{"id":785,"frontendId":772,"title":"Basic Calculator III","titleSlug":"basic-calculator-iii","difficulty":"HARD","paidOnly":true,"tags":["math","string","stack","recursion"]}
|
||
{"id":786,"frontendId":702,"title":"Search in a Sorted Array of Unknown Size","titleSlug":"search-in-a-sorted-array-of-unknown-size","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search","interactive"]}
|
||
{"id":787,"frontendId":773,"title":"Sliding Puzzle","titleSlug":"sliding-puzzle","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","backtracking","breadth-first-search","memoization","matrix"]}
|
||
{"id":788,"frontendId":774,"title":"Minimize Max Distance to Gas Station","titleSlug":"minimize-max-distance-to-gas-station","difficulty":"HARD","paidOnly":true,"tags":["array","binary-search"]}
|
||
{"id":789,"frontendId":703,"title":"Kth Largest Element in a Stream","titleSlug":"kth-largest-element-in-a-stream","difficulty":"EASY","paidOnly":false,"tags":["tree","design","binary-search-tree","heap-priority-queue","binary-tree","data-stream"]}
|
||
{"id":790,"frontendId":775,"title":"Global and Local Inversions","titleSlug":"global-and-local-inversions","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math"]}
|
||
{"id":791,"frontendId":776,"title":"Split BST","titleSlug":"split-bst","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","binary-search-tree","recursion","binary-tree"]}
|
||
{"id":792,"frontendId":704,"title":"Binary Search","titleSlug":"binary-search","difficulty":"EASY","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":793,"frontendId":777,"title":"Swap Adjacent in LR String","titleSlug":"swap-adjacent-in-lr-string","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":794,"frontendId":778,"title":"Swim in Rising Water","titleSlug":"swim-in-rising-water","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","depth-first-search","breadth-first-search","union-find","heap-priority-queue","matrix"]}
|
||
{"id":795,"frontendId":779,"title":"K-th Symbol in Grammar","titleSlug":"k-th-symbol-in-grammar","difficulty":"MEDIUM","paidOnly":false,"tags":["math","bit-manipulation","recursion"]}
|
||
{"id":796,"frontendId":780,"title":"Reaching Points","titleSlug":"reaching-points","difficulty":"HARD","paidOnly":false,"tags":["math"]}
|
||
{"id":797,"frontendId":781,"title":"Rabbits in Forest","titleSlug":"rabbits-in-forest","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","greedy"]}
|
||
{"id":798,"frontendId":782,"title":"Transform to Chessboard","titleSlug":"transform-to-chessboard","difficulty":"HARD","paidOnly":false,"tags":["array","math","bit-manipulation","matrix"]}
|
||
{"id":799,"frontendId":783,"title":"Minimum Distance Between BST Nodes","titleSlug":"minimum-distance-between-bst-nodes","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":800,"frontendId":784,"title":"Letter Case Permutation","titleSlug":"letter-case-permutation","difficulty":"MEDIUM","paidOnly":false,"tags":["string","backtracking","bit-manipulation"]}
|
||
{"id":801,"frontendId":785,"title":"Is Graph Bipartite?","titleSlug":"is-graph-bipartite","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":802,"frontendId":786,"title":"K-th Smallest Prime Fraction","titleSlug":"k-th-smallest-prime-fraction","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","sorting","heap-priority-queue"]}
|
||
{"id":803,"frontendId":787,"title":"Cheapest Flights Within K Stops","titleSlug":"cheapest-flights-within-k-stops","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming","depth-first-search","breadth-first-search","graph","heap-priority-queue","shortest-path"]}
|
||
{"id":804,"frontendId":788,"title":"Rotated Digits","titleSlug":"rotated-digits","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming"]}
|
||
{"id":805,"frontendId":789,"title":"Escape The Ghosts","titleSlug":"escape-the-ghosts","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math"]}
|
||
{"id":806,"frontendId":790,"title":"Domino and Tromino Tiling","titleSlug":"domino-and-tromino-tiling","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":807,"frontendId":791,"title":"Custom Sort String","titleSlug":"custom-sort-string","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sorting"]}
|
||
{"id":808,"frontendId":792,"title":"Number of Matching Subsequences","titleSlug":"number-of-matching-subsequences","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","binary-search","dynamic-programming","trie","sorting"]}
|
||
{"id":809,"frontendId":793,"title":"Preimage Size of Factorial Zeroes Function","titleSlug":"preimage-size-of-factorial-zeroes-function","difficulty":"HARD","paidOnly":false,"tags":["math","binary-search"]}
|
||
{"id":810,"frontendId":794,"title":"Valid Tic-Tac-Toe State","titleSlug":"valid-tic-tac-toe-state","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":811,"frontendId":795,"title":"Number of Subarrays with Bounded Maximum","titleSlug":"number-of-subarrays-with-bounded-maximum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers"]}
|
||
{"id":812,"frontendId":796,"title":"Rotate String","titleSlug":"rotate-string","difficulty":"EASY","paidOnly":false,"tags":["string","string-matching"]}
|
||
{"id":813,"frontendId":797,"title":"All Paths From Source to Target","titleSlug":"all-paths-from-source-to-target","difficulty":"MEDIUM","paidOnly":false,"tags":["backtracking","depth-first-search","breadth-first-search","graph"]}
|
||
{"id":814,"frontendId":798,"title":"Smallest Rotation with Highest Score","titleSlug":"smallest-rotation-with-highest-score","difficulty":"HARD","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":815,"frontendId":799,"title":"Champagne Tower","titleSlug":"champagne-tower","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":816,"frontendId":705,"title":"Design HashSet","titleSlug":"design-hashset","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","linked-list","design","hash-function"]}
|
||
{"id":817,"frontendId":706,"title":"Design HashMap","titleSlug":"design-hashmap","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","linked-list","design","hash-function"]}
|
||
{"id":818,"frontendId":800,"title":"Similar RGB Color","titleSlug":"similar-rgb-color","difficulty":"EASY","paidOnly":true,"tags":["math","string","enumeration"]}
|
||
{"id":819,"frontendId":801,"title":"Minimum Swaps To Make Sequences Increasing","titleSlug":"minimum-swaps-to-make-sequences-increasing","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":820,"frontendId":802,"title":"Find Eventual Safe States","titleSlug":"find-eventual-safe-states","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","graph","topological-sort"]}
|
||
{"id":821,"frontendId":803,"title":"Bricks Falling When Hit","titleSlug":"bricks-falling-when-hit","difficulty":"HARD","paidOnly":false,"tags":["array","union-find","matrix"]}
|
||
{"id":822,"frontendId":804,"title":"Unique Morse Code Words","titleSlug":"unique-morse-code-words","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":823,"frontendId":805,"title":"Split Array With Same Average","titleSlug":"split-array-with-same-average","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","dynamic-programming","bit-manipulation","bitmask"]}
|
||
{"id":824,"frontendId":806,"title":"Number of Lines To Write String","titleSlug":"number-of-lines-to-write-string","difficulty":"EASY","paidOnly":false,"tags":["array","string"]}
|
||
{"id":825,"frontendId":807,"title":"Max Increase to Keep City Skyline","titleSlug":"max-increase-to-keep-city-skyline","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","matrix"]}
|
||
{"id":826,"frontendId":808,"title":"Soup Servings","titleSlug":"soup-servings","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming","probability-and-statistics"]}
|
||
{"id":827,"frontendId":809,"title":"Expressive Words","titleSlug":"expressive-words","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","string"]}
|
||
{"id":828,"frontendId":810,"title":"Chalkboard XOR Game","titleSlug":"chalkboard-xor-game","difficulty":"HARD","paidOnly":false,"tags":["array","math","bit-manipulation","brainteaser","game-theory"]}
|
||
{"id":829,"frontendId":811,"title":"Subdomain Visit Count","titleSlug":"subdomain-visit-count","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","counting"]}
|
||
{"id":830,"frontendId":812,"title":"Largest Triangle Area","titleSlug":"largest-triangle-area","difficulty":"EASY","paidOnly":false,"tags":["array","math","geometry"]}
|
||
{"id":831,"frontendId":813,"title":"Largest Sum of Averages","titleSlug":"largest-sum-of-averages","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","prefix-sum"]}
|
||
{"id":832,"frontendId":814,"title":"Binary Tree Pruning","titleSlug":"binary-tree-pruning","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":833,"frontendId":815,"title":"Bus Routes","titleSlug":"bus-routes","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","breadth-first-search"]}
|
||
{"id":834,"frontendId":816,"title":"Ambiguous Coordinates","titleSlug":"ambiguous-coordinates","difficulty":"MEDIUM","paidOnly":false,"tags":["string","backtracking","enumeration"]}
|
||
{"id":835,"frontendId":817,"title":"Linked List Components","titleSlug":"linked-list-components","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","linked-list"]}
|
||
{"id":836,"frontendId":818,"title":"Race Car","titleSlug":"race-car","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":837,"frontendId":819,"title":"Most Common Word","titleSlug":"most-common-word","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string","counting"]}
|
||
{"id":838,"frontendId":707,"title":"Design Linked List","titleSlug":"design-linked-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","design"]}
|
||
{"id":839,"frontendId":820,"title":"Short Encoding of Words","titleSlug":"short-encoding-of-words","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","trie"]}
|
||
{"id":841,"frontendId":821,"title":"Shortest Distance to a Character","titleSlug":"shortest-distance-to-a-character","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","string"]}
|
||
{"id":842,"frontendId":822,"title":"Card Flipping Game","titleSlug":"card-flipping-game","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":843,"frontendId":823,"title":"Binary Trees With Factors","titleSlug":"binary-trees-with-factors","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","dynamic-programming","sorting"]}
|
||
{"id":850,"frontendId":708,"title":"Insert into a Sorted Circular Linked List","titleSlug":"insert-into-a-sorted-circular-linked-list","difficulty":"MEDIUM","paidOnly":true,"tags":["linked-list"]}
|
||
{"id":851,"frontendId":824,"title":"Goat Latin","titleSlug":"goat-latin","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":852,"frontendId":825,"title":"Friends Of Appropriate Ages","titleSlug":"friends-of-appropriate-ages","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","sorting"]}
|
||
{"id":853,"frontendId":826,"title":"Most Profit Assigning Work","titleSlug":"most-profit-assigning-work","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","greedy","sorting"]}
|
||
{"id":854,"frontendId":827,"title":"Making A Large Island","titleSlug":"making-a-large-island","difficulty":"HARD","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","union-find","matrix"]}
|
||
{"id":855,"frontendId":828,"title":"Count Unique Characters of All Substrings of a Given String","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","dynamic-programming"]}
|
||
{"id":856,"frontendId":829,"title":"Consecutive Numbers Sum","titleSlug":"consecutive-numbers-sum","difficulty":"HARD","paidOnly":false,"tags":["math","enumeration"]}
|
||
{"id":857,"frontendId":830,"title":"Positions of Large Groups","titleSlug":"positions-of-large-groups","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":858,"frontendId":831,"title":"Masking Personal Information","titleSlug":"masking-personal-information","difficulty":"MEDIUM","paidOnly":false,"tags":["string"]}
|
||
{"id":859,"frontendId":641,"title":"Design Circular Deque","titleSlug":"design-circular-deque","difficulty":"MEDIUM","paidOnly":false,"tags":["array","linked-list","design","queue"]}
|
||
{"id":860,"frontendId":622,"title":"Design Circular Queue","titleSlug":"design-circular-queue","difficulty":"MEDIUM","paidOnly":false,"tags":["array","linked-list","design","queue"]}
|
||
{"id":861,"frontendId":832,"title":"Flipping an Image","titleSlug":"flipping-an-image","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","bit-manipulation","matrix","simulation"]}
|
||
{"id":862,"frontendId":833,"title":"Find And Replace in String","titleSlug":"find-and-replace-in-string","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","sorting"]}
|
||
{"id":863,"frontendId":834,"title":"Sum of Distances in Tree","titleSlug":"sum-of-distances-in-tree","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","tree","depth-first-search","graph"]}
|
||
{"id":864,"frontendId":835,"title":"Image Overlap","titleSlug":"image-overlap","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":865,"frontendId":489,"title":"Robot Room Cleaner","titleSlug":"robot-room-cleaner","difficulty":"HARD","paidOnly":true,"tags":["backtracking","interactive"]}
|
||
{"id":866,"frontendId":836,"title":"Rectangle Overlap","titleSlug":"rectangle-overlap","difficulty":"EASY","paidOnly":false,"tags":["math","geometry"]}
|
||
{"id":867,"frontendId":837,"title":"New 21 Game","titleSlug":"new-21-game","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming","sliding-window","probability-and-statistics"]}
|
||
{"id":868,"frontendId":838,"title":"Push Dominoes","titleSlug":"push-dominoes","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string","dynamic-programming"]}
|
||
{"id":869,"frontendId":839,"title":"Similar String Groups","titleSlug":"similar-string-groups","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","string","depth-first-search","breadth-first-search","union-find"]}
|
||
{"id":870,"frontendId":840,"title":"Magic Squares In Grid","titleSlug":"magic-squares-in-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","matrix"]}
|
||
{"id":871,"frontendId":841,"title":"Keys and Rooms","titleSlug":"keys-and-rooms","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","graph"]}
|
||
{"id":872,"frontendId":842,"title":"Split Array into Fibonacci Sequence","titleSlug":"split-array-into-fibonacci-sequence","difficulty":"MEDIUM","paidOnly":false,"tags":["string","backtracking"]}
|
||
{"id":873,"frontendId":843,"title":"Guess the Word","titleSlug":"guess-the-word","difficulty":"HARD","paidOnly":false,"tags":["array","math","string","interactive","game-theory"]}
|
||
{"id":874,"frontendId":844,"title":"Backspace String Compare","titleSlug":"backspace-string-compare","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string","stack","simulation"]}
|
||
{"id":875,"frontendId":845,"title":"Longest Mountain in Array","titleSlug":"longest-mountain-in-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","dynamic-programming","enumeration"]}
|
||
{"id":876,"frontendId":846,"title":"Hand of Straights","titleSlug":"hand-of-straights","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","sorting"]}
|
||
{"id":877,"frontendId":847,"title":"Shortest Path Visiting All Nodes","titleSlug":"shortest-path-visiting-all-nodes","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","bit-manipulation","breadth-first-search","graph","bitmask"]}
|
||
{"id":878,"frontendId":848,"title":"Shifting Letters","titleSlug":"shifting-letters","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","prefix-sum"]}
|
||
{"id":879,"frontendId":849,"title":"Maximize Distance to Closest Person","titleSlug":"maximize-distance-to-closest-person","difficulty":"MEDIUM","paidOnly":false,"tags":["array"]}
|
||
{"id":880,"frontendId":850,"title":"Rectangle Area II","titleSlug":"rectangle-area-ii","difficulty":"HARD","paidOnly":false,"tags":["array","segment-tree","line-sweep","ordered-set"]}
|
||
{"id":881,"frontendId":851,"title":"Loud and Rich","titleSlug":"loud-and-rich","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","graph","topological-sort"]}
|
||
{"id":882,"frontendId":852,"title":"Peak Index in a Mountain Array","titleSlug":"peak-index-in-a-mountain-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":883,"frontendId":853,"title":"Car Fleet","titleSlug":"car-fleet","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","sorting","monotonic-stack"]}
|
||
{"id":884,"frontendId":854,"title":"K-Similar Strings","titleSlug":"k-similar-strings","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","breadth-first-search"]}
|
||
{"id":885,"frontendId":855,"title":"Exam Room","titleSlug":"exam-room","difficulty":"MEDIUM","paidOnly":false,"tags":["design","heap-priority-queue","ordered-set"]}
|
||
{"id":886,"frontendId":856,"title":"Score of Parentheses","titleSlug":"score-of-parentheses","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack"]}
|
||
{"id":887,"frontendId":857,"title":"Minimum Cost to Hire K Workers","titleSlug":"minimum-cost-to-hire-k-workers","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","sorting","heap-priority-queue"]}
|
||
{"id":888,"frontendId":858,"title":"Mirror Reflection","titleSlug":"mirror-reflection","difficulty":"MEDIUM","paidOnly":false,"tags":["math","geometry","number-theory"]}
|
||
{"id":889,"frontendId":859,"title":"Buddy Strings","titleSlug":"buddy-strings","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":890,"frontendId":860,"title":"Lemonade Change","titleSlug":"lemonade-change","difficulty":"EASY","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":891,"frontendId":861,"title":"Score After Flipping Matrix","titleSlug":"score-after-flipping-matrix","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","bit-manipulation","matrix"]}
|
||
{"id":892,"frontendId":862,"title":"Shortest Subarray with Sum at Least K","titleSlug":"shortest-subarray-with-sum-at-least-k","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","queue","sliding-window","heap-priority-queue","prefix-sum","monotonic-queue"]}
|
||
{"id":893,"frontendId":863,"title":"All Nodes Distance K in Binary Tree","titleSlug":"all-nodes-distance-k-in-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":894,"frontendId":710,"title":"Random Pick with Blacklist","titleSlug":"random-pick-with-blacklist","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","binary-search","sorting","randomized"]}
|
||
{"id":895,"frontendId":864,"title":"Shortest Path to Get All Keys","titleSlug":"shortest-path-to-get-all-keys","difficulty":"HARD","paidOnly":false,"tags":["array","bit-manipulation","breadth-first-search","matrix"]}
|
||
{"id":896,"frontendId":865,"title":"Smallest Subtree with all the Deepest Nodes","titleSlug":"smallest-subtree-with-all-the-deepest-nodes","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":897,"frontendId":866,"title":"Prime Palindrome","titleSlug":"prime-palindrome","difficulty":"MEDIUM","paidOnly":false,"tags":["math","number-theory"]}
|
||
{"id":898,"frontendId":867,"title":"Transpose Matrix","titleSlug":"transpose-matrix","difficulty":"EASY","paidOnly":false,"tags":["array","matrix","simulation"]}
|
||
{"id":899,"frontendId":868,"title":"Binary Gap","titleSlug":"binary-gap","difficulty":"EASY","paidOnly":false,"tags":["bit-manipulation"]}
|
||
{"id":900,"frontendId":869,"title":"Reordered Power of 2","titleSlug":"reordered-power-of-2","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","math","sorting","counting","enumeration"]}
|
||
{"id":901,"frontendId":870,"title":"Advantage Shuffle","titleSlug":"advantage-shuffle","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","greedy","sorting"]}
|
||
{"id":902,"frontendId":871,"title":"Minimum Number of Refueling Stops","titleSlug":"minimum-number-of-refueling-stops","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","greedy","heap-priority-queue"]}
|
||
{"id":903,"frontendId":470,"title":"Implement Rand10() Using Rand7()","titleSlug":"implement-rand10-using-rand7","difficulty":"MEDIUM","paidOnly":false,"tags":["math","rejection-sampling","randomized","probability-and-statistics"]}
|
||
{"id":904,"frontendId":872,"title":"Leaf-Similar Trees","titleSlug":"leaf-similar-trees","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":905,"frontendId":873,"title":"Length of Longest Fibonacci Subsequence","titleSlug":"length-of-longest-fibonacci-subsequence","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","dynamic-programming"]}
|
||
{"id":906,"frontendId":874,"title":"Walking Robot Simulation","titleSlug":"walking-robot-simulation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","simulation"]}
|
||
{"id":907,"frontendId":875,"title":"Koko Eating Bananas","titleSlug":"koko-eating-bananas","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":908,"frontendId":876,"title":"Middle of the Linked List","titleSlug":"middle-of-the-linked-list","difficulty":"EASY","paidOnly":false,"tags":["linked-list","two-pointers"]}
|
||
{"id":909,"frontendId":877,"title":"Stone Game","titleSlug":"stone-game","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","dynamic-programming","game-theory"]}
|
||
{"id":910,"frontendId":878,"title":"Nth Magical Number","titleSlug":"nth-magical-number","difficulty":"HARD","paidOnly":false,"tags":["math","binary-search"]}
|
||
{"id":911,"frontendId":879,"title":"Profitable Schemes","titleSlug":"profitable-schemes","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":912,"frontendId":528,"title":"Random Pick with Weight","titleSlug":"random-pick-with-weight","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","binary-search","prefix-sum","randomized"]}
|
||
{"id":913,"frontendId":519,"title":"Random Flip Matrix","titleSlug":"random-flip-matrix","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","math","reservoir-sampling","randomized"]}
|
||
{"id":914,"frontendId":497,"title":"Random Point in Non-overlapping Rectangles","titleSlug":"random-point-in-non-overlapping-rectangles","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","binary-search","reservoir-sampling","prefix-sum","ordered-set","randomized"]}
|
||
{"id":915,"frontendId":478,"title":"Generate Random Point in a Circle","titleSlug":"generate-random-point-in-a-circle","difficulty":"MEDIUM","paidOnly":false,"tags":["math","geometry","rejection-sampling","randomized"]}
|
||
{"id":916,"frontendId":880,"title":"Decoded String at Index","titleSlug":"decoded-string-at-index","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack"]}
|
||
{"id":917,"frontendId":881,"title":"Boats to Save People","titleSlug":"boats-to-save-people","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","greedy","sorting"]}
|
||
{"id":918,"frontendId":882,"title":"Reachable Nodes In Subdivided Graph","titleSlug":"reachable-nodes-in-subdivided-graph","difficulty":"HARD","paidOnly":false,"tags":["graph","heap-priority-queue","shortest-path"]}
|
||
{"id":919,"frontendId":883,"title":"Projection Area of 3D Shapes","titleSlug":"projection-area-of-3d-shapes","difficulty":"EASY","paidOnly":false,"tags":["array","math","geometry","matrix"]}
|
||
{"id":920,"frontendId":884,"title":"Uncommon Words from Two Sentences","titleSlug":"uncommon-words-from-two-sentences","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":921,"frontendId":885,"title":"Spiral Matrix III","titleSlug":"spiral-matrix-iii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","simulation"]}
|
||
{"id":922,"frontendId":886,"title":"Possible Bipartition","titleSlug":"possible-bipartition","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":923,"frontendId":887,"title":"Super Egg Drop","titleSlug":"super-egg-drop","difficulty":"HARD","paidOnly":false,"tags":["math","binary-search","dynamic-programming"]}
|
||
{"id":924,"frontendId":888,"title":"Fair Candy Swap","titleSlug":"fair-candy-swap","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","binary-search","sorting"]}
|
||
{"id":925,"frontendId":889,"title":"Construct Binary Tree from Preorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","divide-and-conquer","tree","binary-tree"]}
|
||
{"id":926,"frontendId":890,"title":"Find and Replace Pattern","titleSlug":"find-and-replace-pattern","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":927,"frontendId":891,"title":"Sum of Subsequence Widths","titleSlug":"sum-of-subsequence-widths","difficulty":"HARD","paidOnly":false,"tags":["array","math","sorting"]}
|
||
{"id":928,"frontendId":892,"title":"Surface Area of 3D Shapes","titleSlug":"surface-area-of-3d-shapes","difficulty":"EASY","paidOnly":false,"tags":["array","math","geometry","matrix"]}
|
||
{"id":929,"frontendId":893,"title":"Groups of Special-Equivalent Strings","titleSlug":"groups-of-special-equivalent-strings","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","sorting"]}
|
||
{"id":930,"frontendId":894,"title":"All Possible Full Binary Trees","titleSlug":"all-possible-full-binary-trees","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming","tree","recursion","memoization","binary-tree"]}
|
||
{"id":931,"frontendId":895,"title":"Maximum Frequency Stack","titleSlug":"maximum-frequency-stack","difficulty":"HARD","paidOnly":false,"tags":["hash-table","stack","design","ordered-set"]}
|
||
{"id":932,"frontendId":896,"title":"Monotonic Array","titleSlug":"monotonic-array","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":933,"frontendId":897,"title":"Increasing Order Search Tree","titleSlug":"increasing-order-search-tree","difficulty":"EASY","paidOnly":false,"tags":["stack","tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":934,"frontendId":898,"title":"Bitwise ORs of Subarrays","titleSlug":"bitwise-ors-of-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation"]}
|
||
{"id":935,"frontendId":899,"title":"Orderly Queue","titleSlug":"orderly-queue","difficulty":"HARD","paidOnly":false,"tags":["math","string","sorting"]}
|
||
{"id":936,"frontendId":900,"title":"RLE Iterator","titleSlug":"rle-iterator","difficulty":"MEDIUM","paidOnly":false,"tags":["array","design","counting","iterator"]}
|
||
{"id":937,"frontendId":901,"title":"Online Stock Span","titleSlug":"online-stock-span","difficulty":"MEDIUM","paidOnly":false,"tags":["stack","design","monotonic-stack","data-stream"]}
|
||
{"id":938,"frontendId":902,"title":"Numbers At Most N Given Digit Set","titleSlug":"numbers-at-most-n-given-digit-set","difficulty":"HARD","paidOnly":false,"tags":["array","math","string","binary-search","dynamic-programming"]}
|
||
{"id":939,"frontendId":903,"title":"Valid Permutations for DI Sequence","titleSlug":"valid-permutations-for-di-sequence","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming","prefix-sum"]}
|
||
{"id":940,"frontendId":904,"title":"Fruit Into Baskets","titleSlug":"fruit-into-baskets","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sliding-window"]}
|
||
{"id":941,"frontendId":905,"title":"Sort Array By Parity","titleSlug":"sort-array-by-parity","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","sorting"]}
|
||
{"id":942,"frontendId":906,"title":"Super Palindromes","titleSlug":"super-palindromes","difficulty":"HARD","paidOnly":false,"tags":["math","string","enumeration"]}
|
||
{"id":943,"frontendId":907,"title":"Sum of Subarray Minimums","titleSlug":"sum-of-subarray-minimums","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","stack","monotonic-stack"]}
|
||
{"id":944,"frontendId":908,"title":"Smallest Range I","titleSlug":"smallest-range-i","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
|
||
{"id":945,"frontendId":909,"title":"Snakes and Ladders","titleSlug":"snakes-and-ladders","difficulty":"MEDIUM","paidOnly":false,"tags":["array","breadth-first-search","matrix"]}
|
||
{"id":946,"frontendId":910,"title":"Smallest Range II","titleSlug":"smallest-range-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","greedy","sorting"]}
|
||
{"id":947,"frontendId":911,"title":"Online Election","titleSlug":"online-election","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","binary-search","design"]}
|
||
{"id":948,"frontendId":912,"title":"Sort an Array","titleSlug":"sort-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","divide-and-conquer","sorting","heap-priority-queue","merge-sort","bucket-sort","radix-sort","counting-sort"]}
|
||
{"id":949,"frontendId":913,"title":"Cat and Mouse","titleSlug":"cat-and-mouse","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming","graph","topological-sort","memoization","game-theory"]}
|
||
{"id":950,"frontendId":914,"title":"X of a Kind in a Deck of Cards","titleSlug":"x-of-a-kind-in-a-deck-of-cards","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","math","counting","number-theory"]}
|
||
{"id":951,"frontendId":915,"title":"Partition Array into Disjoint Intervals","titleSlug":"partition-array-into-disjoint-intervals","difficulty":"MEDIUM","paidOnly":false,"tags":["array"]}
|
||
{"id":952,"frontendId":916,"title":"Word Subsets","titleSlug":"word-subsets","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":953,"frontendId":917,"title":"Reverse Only Letters","titleSlug":"reverse-only-letters","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":954,"frontendId":918,"title":"Maximum Sum Circular Subarray","titleSlug":"maximum-sum-circular-subarray","difficulty":"MEDIUM","paidOnly":false,"tags":["array","divide-and-conquer","dynamic-programming","queue","monotonic-queue"]}
|
||
{"id":955,"frontendId":919,"title":"Complete Binary Tree Inserter","titleSlug":"complete-binary-tree-inserter","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","breadth-first-search","design","binary-tree"]}
|
||
{"id":956,"frontendId":920,"title":"Number of Music Playlists","titleSlug":"number-of-music-playlists","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming","combinatorics"]}
|
||
{"id":957,"frontendId":921,"title":"Minimum Add to Make Parentheses Valid","titleSlug":"minimum-add-to-make-parentheses-valid","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","greedy"]}
|
||
{"id":958,"frontendId":922,"title":"Sort Array By Parity II","titleSlug":"sort-array-by-parity-ii","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","sorting"]}
|
||
{"id":959,"frontendId":923,"title":"3Sum With Multiplicity","titleSlug":"3sum-with-multiplicity","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","two-pointers","sorting","counting"]}
|
||
{"id":960,"frontendId":924,"title":"Minimize Malware Spread","titleSlug":"minimize-malware-spread","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":961,"frontendId":925,"title":"Long Pressed Name","titleSlug":"long-pressed-name","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":962,"frontendId":926,"title":"Flip String to Monotone Increasing","titleSlug":"flip-string-to-monotone-increasing","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":963,"frontendId":927,"title":"Three Equal Parts","titleSlug":"three-equal-parts","difficulty":"HARD","paidOnly":false,"tags":["array","math"]}
|
||
{"id":964,"frontendId":928,"title":"Minimize Malware Spread II","titleSlug":"minimize-malware-spread-ii","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":965,"frontendId":929,"title":"Unique Email Addresses","titleSlug":"unique-email-addresses","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":966,"frontendId":930,"title":"Binary Subarrays With Sum","titleSlug":"binary-subarrays-with-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sliding-window","prefix-sum"]}
|
||
{"id":967,"frontendId":931,"title":"Minimum Falling Path Sum","titleSlug":"minimum-falling-path-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":968,"frontendId":932,"title":"Beautiful Array","titleSlug":"beautiful-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","divide-and-conquer"]}
|
||
{"id":969,"frontendId":933,"title":"Number of Recent Calls","titleSlug":"number-of-recent-calls","difficulty":"EASY","paidOnly":false,"tags":["design","queue","data-stream"]}
|
||
{"id":971,"frontendId":934,"title":"Shortest Bridge","titleSlug":"shortest-bridge","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","matrix"]}
|
||
{"id":972,"frontendId":935,"title":"Knight Dialer","titleSlug":"knight-dialer","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":973,"frontendId":936,"title":"Stamping The Sequence","titleSlug":"stamping-the-sequence","difficulty":"HARD","paidOnly":false,"tags":["string","stack","greedy","queue"]}
|
||
{"id":974,"frontendId":937,"title":"Reorder Data in Log Files","titleSlug":"reorder-data-in-log-files","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","sorting"]}
|
||
{"id":975,"frontendId":938,"title":"Range Sum of BST","titleSlug":"range-sum-of-bst","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":976,"frontendId":939,"title":"Minimum Area Rectangle","titleSlug":"minimum-area-rectangle","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","geometry","sorting"]}
|
||
{"id":977,"frontendId":940,"title":"Distinct Subsequences II","titleSlug":"distinct-subsequences-ii","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":978,"frontendId":941,"title":"Valid Mountain Array","titleSlug":"valid-mountain-array","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":979,"frontendId":942,"title":"DI String Match","titleSlug":"di-string-match","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","string","greedy"]}
|
||
{"id":980,"frontendId":943,"title":"Find the Shortest Superstring","titleSlug":"find-the-shortest-superstring","difficulty":"HARD","paidOnly":false,"tags":["array","string","dynamic-programming","bit-manipulation","bitmask"]}
|
||
{"id":981,"frontendId":944,"title":"Delete Columns to Make Sorted","titleSlug":"delete-columns-to-make-sorted","difficulty":"EASY","paidOnly":false,"tags":["array","string"]}
|
||
{"id":982,"frontendId":945,"title":"Minimum Increment to Make Array Unique","titleSlug":"minimum-increment-to-make-array-unique","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting","counting"]}
|
||
{"id":983,"frontendId":946,"title":"Validate Stack Sequences","titleSlug":"validate-stack-sequences","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","simulation"]}
|
||
{"id":984,"frontendId":947,"title":"Most Stones Removed with Same Row or Column","titleSlug":"most-stones-removed-with-same-row-or-column","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","depth-first-search","union-find","graph"]}
|
||
{"id":985,"frontendId":948,"title":"Bag of Tokens","titleSlug":"bag-of-tokens","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","greedy","sorting"]}
|
||
{"id":986,"frontendId":949,"title":"Largest Time for Given Digits","titleSlug":"largest-time-for-given-digits","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","backtracking","enumeration"]}
|
||
{"id":987,"frontendId":950,"title":"Reveal Cards In Increasing Order","titleSlug":"reveal-cards-in-increasing-order","difficulty":"MEDIUM","paidOnly":false,"tags":["array","queue","sorting","simulation"]}
|
||
{"id":988,"frontendId":951,"title":"Flip Equivalent Binary Trees","titleSlug":"flip-equivalent-binary-trees","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":989,"frontendId":952,"title":"Largest Component Size by Common Factor","titleSlug":"largest-component-size-by-common-factor","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","union-find","number-theory"]}
|
||
{"id":990,"frontendId":953,"title":"Verifying an Alien Dictionary","titleSlug":"verifying-an-alien-dictionary","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":991,"frontendId":954,"title":"Array of Doubled Pairs","titleSlug":"array-of-doubled-pairs","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","sorting"]}
|
||
{"id":992,"frontendId":955,"title":"Delete Columns to Make Sorted II","titleSlug":"delete-columns-to-make-sorted-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","greedy"]}
|
||
{"id":993,"frontendId":956,"title":"Tallest Billboard","titleSlug":"tallest-billboard","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":994,"frontendId":957,"title":"Prison Cells After N Days","titleSlug":"prison-cells-after-n-days","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","bit-manipulation"]}
|
||
{"id":998,"frontendId":958,"title":"Check Completeness of a Binary Tree","titleSlug":"check-completeness-of-a-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","breadth-first-search","binary-tree"]}
|
||
{"id":999,"frontendId":959,"title":"Regions Cut By Slashes","titleSlug":"regions-cut-by-slashes","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","depth-first-search","breadth-first-search","union-find","matrix"]}
|
||
{"id":1000,"frontendId":960,"title":"Delete Columns to Make Sorted III","titleSlug":"delete-columns-to-make-sorted-iii","difficulty":"HARD","paidOnly":false,"tags":["array","string","dynamic-programming"]}
|
||
{"id":1001,"frontendId":961,"title":"N-Repeated Element in Size 2N Array","titleSlug":"n-repeated-element-in-size-2n-array","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":1002,"frontendId":962,"title":"Maximum Width Ramp","titleSlug":"maximum-width-ramp","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","stack","monotonic-stack"]}
|
||
{"id":1003,"frontendId":963,"title":"Minimum Area Rectangle II","titleSlug":"minimum-area-rectangle-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","geometry"]}
|
||
{"id":1004,"frontendId":964,"title":"Least Operators to Express Number","titleSlug":"least-operators-to-express-number","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming","memoization"]}
|
||
{"id":1005,"frontendId":965,"title":"Univalued Binary Tree","titleSlug":"univalued-binary-tree","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":1006,"frontendId":966,"title":"Vowel Spellchecker","titleSlug":"vowel-spellchecker","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":1007,"frontendId":967,"title":"Numbers With Same Consecutive Differences","titleSlug":"numbers-with-same-consecutive-differences","difficulty":"MEDIUM","paidOnly":false,"tags":["backtracking","breadth-first-search"]}
|
||
{"id":1008,"frontendId":968,"title":"Binary Tree Cameras","titleSlug":"binary-tree-cameras","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","tree","depth-first-search","binary-tree"]}
|
||
{"id":1009,"frontendId":969,"title":"Pancake Sorting","titleSlug":"pancake-sorting","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","greedy","sorting"]}
|
||
{"id":1010,"frontendId":970,"title":"Powerful Integers","titleSlug":"powerful-integers","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","math","enumeration"]}
|
||
{"id":1011,"frontendId":971,"title":"Flip Binary Tree To Match Preorder Traversal","titleSlug":"flip-binary-tree-to-match-preorder-traversal","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":1012,"frontendId":972,"title":"Equal Rational Numbers","titleSlug":"equal-rational-numbers","difficulty":"HARD","paidOnly":false,"tags":["math","string"]}
|
||
{"id":1013,"frontendId":509,"title":"Fibonacci Number","titleSlug":"fibonacci-number","difficulty":"EASY","paidOnly":false,"tags":["math","dynamic-programming","recursion","memoization"]}
|
||
{"id":1014,"frontendId":973,"title":"K Closest Points to Origin","titleSlug":"k-closest-points-to-origin","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","divide-and-conquer","geometry","sorting","heap-priority-queue","quickselect"]}
|
||
{"id":1016,"frontendId":974,"title":"Subarray Sums Divisible by K","titleSlug":"subarray-sums-divisible-by-k","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":1017,"frontendId":975,"title":"Odd Even Jump","titleSlug":"odd-even-jump","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","stack","sorting","monotonic-stack","ordered-set"]}
|
||
{"id":1018,"frontendId":976,"title":"Largest Perimeter Triangle","titleSlug":"largest-perimeter-triangle","difficulty":"EASY","paidOnly":false,"tags":["array","math","greedy","sorting"]}
|
||
{"id":1019,"frontendId":977,"title":"Squares of a Sorted Array","titleSlug":"squares-of-a-sorted-array","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","sorting"]}
|
||
{"id":1020,"frontendId":978,"title":"Longest Turbulent Subarray","titleSlug":"longest-turbulent-subarray","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","sliding-window"]}
|
||
{"id":1021,"frontendId":979,"title":"Distribute Coins in Binary Tree","titleSlug":"distribute-coins-in-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":1022,"frontendId":980,"title":"Unique Paths III","titleSlug":"unique-paths-iii","difficulty":"HARD","paidOnly":false,"tags":["array","backtracking","bit-manipulation","matrix"]}
|
||
{"id":1023,"frontendId":981,"title":"Time Based Key-Value Store","titleSlug":"time-based-key-value-store","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","binary-search","design"]}
|
||
{"id":1024,"frontendId":982,"title":"Triples with Bitwise AND Equal To Zero","titleSlug":"triples-with-bitwise-and-equal-to-zero","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","bit-manipulation"]}
|
||
{"id":1025,"frontendId":983,"title":"Minimum Cost For Tickets","titleSlug":"minimum-cost-for-tickets","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":1026,"frontendId":984,"title":"String Without AAA or BBB","titleSlug":"string-without-aaa-or-bbb","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":1027,"frontendId":985,"title":"Sum of Even Numbers After Queries","titleSlug":"sum-of-even-numbers-after-queries","difficulty":"MEDIUM","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":1028,"frontendId":986,"title":"Interval List Intersections","titleSlug":"interval-list-intersections","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","line-sweep"]}
|
||
{"id":1029,"frontendId":987,"title":"Vertical Order Traversal of a Binary Tree","titleSlug":"vertical-order-traversal-of-a-binary-tree","difficulty":"HARD","paidOnly":false,"tags":["hash-table","tree","depth-first-search","breadth-first-search","sorting","binary-tree"]}
|
||
{"id":1030,"frontendId":988,"title":"Smallest String Starting From Leaf","titleSlug":"smallest-string-starting-from-leaf","difficulty":"MEDIUM","paidOnly":false,"tags":["string","backtracking","tree","depth-first-search","binary-tree"]}
|
||
{"id":1031,"frontendId":989,"title":"Add to Array-Form of Integer","titleSlug":"add-to-array-form-of-integer","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
|
||
{"id":1032,"frontendId":990,"title":"Satisfiability of Equality Equations","titleSlug":"satisfiability-of-equality-equations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","union-find","graph"]}
|
||
{"id":1033,"frontendId":991,"title":"Broken Calculator","titleSlug":"broken-calculator","difficulty":"MEDIUM","paidOnly":false,"tags":["math","greedy"]}
|
||
{"id":1034,"frontendId":992,"title":"Subarrays with K Different Integers","titleSlug":"subarrays-with-k-different-integers","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","sliding-window","counting"]}
|
||
{"id":1035,"frontendId":993,"title":"Cousins in Binary Tree","titleSlug":"cousins-in-binary-tree","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":1036,"frontendId":994,"title":"Rotting Oranges","titleSlug":"rotting-oranges","difficulty":"MEDIUM","paidOnly":false,"tags":["array","breadth-first-search","matrix"]}
|
||
{"id":1037,"frontendId":995,"title":"Minimum Number of K Consecutive Bit Flips","titleSlug":"minimum-number-of-k-consecutive-bit-flips","difficulty":"HARD","paidOnly":false,"tags":["array","bit-manipulation","queue","sliding-window","prefix-sum"]}
|
||
{"id":1038,"frontendId":996,"title":"Number of Squareful Arrays","titleSlug":"number-of-squareful-arrays","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","dynamic-programming","backtracking","bit-manipulation","bitmask"]}
|
||
{"id":1039,"frontendId":997,"title":"Find the Town Judge","titleSlug":"find-the-town-judge","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","graph"]}
|
||
{"id":1040,"frontendId":998,"title":"Maximum Binary Tree II","titleSlug":"maximum-binary-tree-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","binary-tree"]}
|
||
{"id":1041,"frontendId":999,"title":"Available Captures for Rook","titleSlug":"available-captures-for-rook","difficulty":"EASY","paidOnly":false,"tags":["array","matrix","simulation"]}
|
||
{"id":1042,"frontendId":1000,"title":"Minimum Cost to Merge Stones","titleSlug":"minimum-cost-to-merge-stones","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","prefix-sum"]}
|
||
{"id":1043,"frontendId":1001,"title":"Grid Illumination","titleSlug":"grid-illumination","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":1044,"frontendId":1002,"title":"Find Common Characters","titleSlug":"find-common-characters","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":1045,"frontendId":1003,"title":"Check If Word Is Valid After Substitutions","titleSlug":"check-if-word-is-valid-after-substitutions","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack"]}
|
||
{"id":1046,"frontendId":1004,"title":"Max Consecutive Ones III","titleSlug":"max-consecutive-ones-iii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","sliding-window","prefix-sum"]}
|
||
{"id":1047,"frontendId":1005,"title":"Maximize Sum Of Array After K Negations","titleSlug":"maximize-sum-of-array-after-k-negations","difficulty":"EASY","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":1048,"frontendId":1006,"title":"Clumsy Factorial","titleSlug":"clumsy-factorial","difficulty":"MEDIUM","paidOnly":false,"tags":["math","stack","simulation"]}
|
||
{"id":1049,"frontendId":1007,"title":"Minimum Domino Rotations For Equal Row","titleSlug":"minimum-domino-rotations-for-equal-row","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":1050,"frontendId":1008,"title":"Construct Binary Search Tree from Preorder Traversal","titleSlug":"construct-binary-search-tree-from-preorder-traversal","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","tree","binary-search-tree","monotonic-stack","binary-tree"]}
|
||
{"id":1051,"frontendId":1055,"title":"Shortest Way to Form String","titleSlug":"shortest-way-to-form-string","difficulty":"MEDIUM","paidOnly":true,"tags":["two-pointers","string","binary-search","greedy"]}
|
||
{"id":1052,"frontendId":1057,"title":"Campus Bikes","titleSlug":"campus-bikes","difficulty":"MEDIUM","paidOnly":true,"tags":["array","sorting","heap-priority-queue"]}
|
||
{"id":1053,"frontendId":1058,"title":"Minimize Rounding Error to Meet Target","titleSlug":"minimize-rounding-error-to-meet-target","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","string","greedy","sorting"]}
|
||
{"id":1054,"frontendId":1009,"title":"Complement of Base 10 Integer","titleSlug":"complement-of-base-10-integer","difficulty":"EASY","paidOnly":false,"tags":["bit-manipulation"]}
|
||
{"id":1055,"frontendId":1010,"title":"Pairs of Songs With Total Durations Divisible by 60","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":1056,"frontendId":1011,"title":"Capacity To Ship Packages Within D Days","titleSlug":"capacity-to-ship-packages-within-d-days","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":1057,"frontendId":1012,"title":"Numbers With Repeated Digits","titleSlug":"numbers-with-repeated-digits","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming"]}
|
||
{"id":1058,"frontendId":1061,"title":"Lexicographically Smallest Equivalent String","titleSlug":"lexicographically-smallest-equivalent-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","union-find"]}
|
||
{"id":1059,"frontendId":1060,"title":"Missing Element in Sorted Array","titleSlug":"missing-element-in-sorted-array","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search"]}
|
||
{"id":1060,"frontendId":1062,"title":"Longest Repeating Substring","titleSlug":"longest-repeating-substring","difficulty":"MEDIUM","paidOnly":true,"tags":["string","binary-search","dynamic-programming","rolling-hash","suffix-array","hash-function"]}
|
||
{"id":1061,"frontendId":1063,"title":"Number of Valid Subarrays","titleSlug":"number-of-valid-subarrays","difficulty":"HARD","paidOnly":true,"tags":["array","stack","monotonic-stack"]}
|
||
{"id":1062,"frontendId":1013,"title":"Partition Array Into Three Parts With Equal Sum","titleSlug":"partition-array-into-three-parts-with-equal-sum","difficulty":"EASY","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":1063,"frontendId":1014,"title":"Best Sightseeing Pair","titleSlug":"best-sightseeing-pair","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":1064,"frontendId":1015,"title":"Smallest Integer Divisible by K","titleSlug":"smallest-integer-divisible-by-k","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","math"]}
|
||
{"id":1065,"frontendId":1016,"title":"Binary String With Substrings Representing 1 To N","titleSlug":"binary-string-with-substrings-representing-1-to-n","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","bit-manipulation","sliding-window"]}
|
||
{"id":1066,"frontendId":1064,"title":"Fixed Point","titleSlug":"fixed-point","difficulty":"EASY","paidOnly":true,"tags":["array","binary-search"]}
|
||
{"id":1067,"frontendId":1066,"title":"Campus Bikes II","titleSlug":"campus-bikes-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming","backtracking","bit-manipulation","bitmask"]}
|
||
{"id":1068,"frontendId":1067,"title":"Digit Count in Range","titleSlug":"digit-count-in-range","difficulty":"HARD","paidOnly":true,"tags":["math","dynamic-programming"]}
|
||
{"id":1069,"frontendId":1056,"title":"Confusing Number","titleSlug":"confusing-number","difficulty":"EASY","paidOnly":true,"tags":["math"]}
|
||
{"id":1070,"frontendId":1017,"title":"Convert to Base -2","titleSlug":"convert-to-base-2","difficulty":"MEDIUM","paidOnly":false,"tags":["math"]}
|
||
{"id":1071,"frontendId":1018,"title":"Binary Prefix Divisible By 5","titleSlug":"binary-prefix-divisible-by-5","difficulty":"EASY","paidOnly":false,"tags":["array","bit-manipulation"]}
|
||
{"id":1072,"frontendId":1019,"title":"Next Greater Node In Linked List","titleSlug":"next-greater-node-in-linked-list","difficulty":"MEDIUM","paidOnly":false,"tags":["array","linked-list","stack","monotonic-stack"]}
|
||
{"id":1073,"frontendId":1020,"title":"Number of Enclaves","titleSlug":"number-of-enclaves","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","union-find","matrix"]}
|
||
{"id":1074,"frontendId":1086,"title":"High Five","titleSlug":"high-five","difficulty":"EASY","paidOnly":true,"tags":["array","hash-table","sorting","heap-priority-queue"]}
|
||
{"id":1075,"frontendId":1065,"title":"Index Pairs of a String","titleSlug":"index-pairs-of-a-string","difficulty":"EASY","paidOnly":true,"tags":["array","string","trie","sorting"]}
|
||
{"id":1076,"frontendId":1087,"title":"Brace Expansion","titleSlug":"brace-expansion","difficulty":"MEDIUM","paidOnly":true,"tags":["string","backtracking","stack","breadth-first-search","sorting"]}
|
||
{"id":1077,"frontendId":1088,"title":"Confusing Number II","titleSlug":"confusing-number-ii","difficulty":"HARD","paidOnly":true,"tags":["math","backtracking"]}
|
||
{"id":1078,"frontendId":1021,"title":"Remove Outermost Parentheses","titleSlug":"remove-outermost-parentheses","difficulty":"EASY","paidOnly":false,"tags":["string","stack"]}
|
||
{"id":1079,"frontendId":1022,"title":"Sum of Root To Leaf Binary Numbers","titleSlug":"sum-of-root-to-leaf-binary-numbers","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":1080,"frontendId":1023,"title":"Camelcase Matching","titleSlug":"camelcase-matching","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","string","trie","string-matching"]}
|
||
{"id":1081,"frontendId":1024,"title":"Video Stitching","titleSlug":"video-stitching","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","greedy"]}
|
||
{"id":1082,"frontendId":1085,"title":"Sum of Digits in the Minimum Number","titleSlug":"sum-of-digits-in-the-minimum-number","difficulty":"EASY","paidOnly":true,"tags":["array","math"]}
|
||
{"id":1083,"frontendId":1099,"title":"Two Sum Less Than K","titleSlug":"two-sum-less-than-k","difficulty":"EASY","paidOnly":true,"tags":["array","two-pointers","binary-search","sorting"]}
|
||
{"id":1084,"frontendId":1100,"title":"Find K-Length Substrings With No Repeated Characters","titleSlug":"find-k-length-substrings-with-no-repeated-characters","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":1085,"frontendId":1101,"title":"The Earliest Moment When Everyone Become Friends","titleSlug":"the-earliest-moment-when-everyone-become-friends","difficulty":"MEDIUM","paidOnly":true,"tags":["array","union-find","sorting"]}
|
||
{"id":1086,"frontendId":1025,"title":"Divisor Game","titleSlug":"divisor-game","difficulty":"EASY","paidOnly":false,"tags":["math","dynamic-programming","brainteaser","game-theory"]}
|
||
{"id":1087,"frontendId":1027,"title":"Longest Arithmetic Subsequence","titleSlug":"longest-arithmetic-subsequence","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","binary-search","dynamic-programming"]}
|
||
{"id":1088,"frontendId":1118,"title":"Number of Days in a Month","titleSlug":"number-of-days-in-a-month","difficulty":"EASY","paidOnly":true,"tags":["math"]}
|
||
{"id":1089,"frontendId":1119,"title":"Remove Vowels from a String","titleSlug":"remove-vowels-from-a-string","difficulty":"EASY","paidOnly":true,"tags":["string"]}
|
||
{"id":1090,"frontendId":1134,"title":"Armstrong Number","titleSlug":"armstrong-number","difficulty":"EASY","paidOnly":true,"tags":["math"]}
|
||
{"id":1091,"frontendId":1120,"title":"Maximum Average Subtree","titleSlug":"maximum-average-subtree","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":1092,"frontendId":1026,"title":"Maximum Difference Between Node and Ancestor","titleSlug":"maximum-difference-between-node-and-ancestor","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":1093,"frontendId":1028,"title":"Recover a Tree From Preorder Traversal","titleSlug":"recover-a-tree-from-preorder-traversal","difficulty":"HARD","paidOnly":false,"tags":["string","tree","depth-first-search","binary-tree"]}
|
||
{"id":1094,"frontendId":1030,"title":"Matrix Cells in Distance Order","titleSlug":"matrix-cells-in-distance-order","difficulty":"EASY","paidOnly":false,"tags":["array","math","geometry","sorting","matrix"]}
|
||
{"id":1095,"frontendId":1029,"title":"Two City Scheduling","titleSlug":"two-city-scheduling","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":1096,"frontendId":1031,"title":"Maximum Sum of Two Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","sliding-window"]}
|
||
{"id":1097,"frontendId":1032,"title":"Stream of Characters","titleSlug":"stream-of-characters","difficulty":"HARD","paidOnly":false,"tags":["array","string","design","trie","data-stream"]}
|
||
{"id":1098,"frontendId":1133,"title":"Largest Unique Number","titleSlug":"largest-unique-number","difficulty":"EASY","paidOnly":true,"tags":["array","hash-table","sorting"]}
|
||
{"id":1099,"frontendId":1102,"title":"Path With Maximum Minimum Value","titleSlug":"path-with-maximum-minimum-value","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search","depth-first-search","breadth-first-search","union-find","heap-priority-queue","matrix"]}
|
||
{"id":1100,"frontendId":1135,"title":"Connecting Cities With Minimum Cost","titleSlug":"connecting-cities-with-minimum-cost","difficulty":"MEDIUM","paidOnly":true,"tags":["union-find","graph","heap-priority-queue","minimum-spanning-tree"]}
|
||
{"id":1101,"frontendId":1136,"title":"Parallel Courses","titleSlug":"parallel-courses","difficulty":"MEDIUM","paidOnly":true,"tags":["graph","topological-sort"]}
|
||
{"id":1102,"frontendId":1150,"title":"Check If a Number Is Majority Element in a Sorted Array","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array","difficulty":"EASY","paidOnly":true,"tags":["array","binary-search"]}
|
||
{"id":1103,"frontendId":1033,"title":"Moving Stones Until Consecutive","titleSlug":"moving-stones-until-consecutive","difficulty":"MEDIUM","paidOnly":false,"tags":["math","brainteaser"]}
|
||
{"id":1104,"frontendId":1034,"title":"Coloring A Border","titleSlug":"coloring-a-border","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","matrix"]}
|
||
{"id":1105,"frontendId":1035,"title":"Uncrossed Lines","titleSlug":"uncrossed-lines","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":1106,"frontendId":1036,"title":"Escape a Large Maze","titleSlug":"escape-a-large-maze","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","depth-first-search","breadth-first-search"]}
|
||
{"id":1107,"frontendId":1151,"title":"Minimum Swaps to Group All 1's Together","titleSlug":"minimum-swaps-to-group-all-1s-together","difficulty":"MEDIUM","paidOnly":true,"tags":["array","sliding-window"]}
|
||
{"id":1108,"frontendId":1152,"title":"Analyze User Website Visit Pattern","titleSlug":"analyze-user-website-visit-pattern","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","string","sorting"]}
|
||
{"id":1111,"frontendId":1039,"title":"Minimum Score Triangulation of Polygon","titleSlug":"minimum-score-triangulation-of-polygon","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":1112,"frontendId":1160,"title":"Find Words That Can Be Formed by Characters","titleSlug":"find-words-that-can-be-formed-by-characters","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string","counting"]}
|
||
{"id":1113,"frontendId":1040,"title":"Moving Stones Until Consecutive II","titleSlug":"moving-stones-until-consecutive-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","sliding-window","sorting"]}
|
||
{"id":1114,"frontendId":1038,"title":"Binary Search Tree to Greater Sum Tree","titleSlug":"binary-search-tree-to-greater-sum-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":1115,"frontendId":1037,"title":"Valid Boomerang","titleSlug":"valid-boomerang","difficulty":"EASY","paidOnly":false,"tags":["array","math","geometry"]}
|
||
{"id":1116,"frontendId":1161,"title":"Maximum Level Sum of a Binary Tree","titleSlug":"maximum-level-sum-of-a-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":1117,"frontendId":1162,"title":"As Far from Land as Possible","titleSlug":"as-far-from-land-as-possible","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","breadth-first-search","matrix"]}
|
||
{"id":1118,"frontendId":1121,"title":"Divide Array Into Increasing Sequences","titleSlug":"divide-array-into-increasing-sequences","difficulty":"HARD","paidOnly":true,"tags":["array","counting"]}
|
||
{"id":1119,"frontendId":1041,"title":"Robot Bounded In Circle","titleSlug":"robot-bounded-in-circle","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string","simulation"]}
|
||
{"id":1120,"frontendId":1042,"title":"Flower Planting With No Adjacent","titleSlug":"flower-planting-with-no-adjacent","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","graph"]}
|
||
{"id":1121,"frontendId":1043,"title":"Partition Array for Maximum Sum","titleSlug":"partition-array-for-maximum-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":1122,"frontendId":1044,"title":"Longest Duplicate Substring","titleSlug":"longest-duplicate-substring","difficulty":"HARD","paidOnly":false,"tags":["string","binary-search","sliding-window","rolling-hash","suffix-array","hash-function"]}
|
||
{"id":1123,"frontendId":1165,"title":"Single-Row Keyboard","titleSlug":"single-row-keyboard","difficulty":"EASY","paidOnly":true,"tags":["hash-table","string"]}
|
||
{"id":1124,"frontendId":1153,"title":"String Transforms Into Another String","titleSlug":"string-transforms-into-another-string","difficulty":"HARD","paidOnly":true,"tags":["hash-table","string","graph"]}
|
||
{"id":1125,"frontendId":1166,"title":"Design File System","titleSlug":"design-file-system","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","design","trie"]}
|
||
{"id":1126,"frontendId":1167,"title":"Minimum Cost to Connect Sticks","titleSlug":"minimum-cost-to-connect-sticks","difficulty":"MEDIUM","paidOnly":true,"tags":["array","greedy","heap-priority-queue"]}
|
||
{"id":1127,"frontendId":1046,"title":"Last Stone Weight","titleSlug":"last-stone-weight","difficulty":"EASY","paidOnly":false,"tags":["array","heap-priority-queue"]}
|
||
{"id":1128,"frontendId":1047,"title":"Remove All Adjacent Duplicates In String","titleSlug":"remove-all-adjacent-duplicates-in-string","difficulty":"EASY","paidOnly":false,"tags":["string","stack"]}
|
||
{"id":1129,"frontendId":1048,"title":"Longest String Chain","titleSlug":"longest-string-chain","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","two-pointers","string","dynamic-programming","sorting"]}
|
||
{"id":1130,"frontendId":1049,"title":"Last Stone Weight II","titleSlug":"last-stone-weight-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":1131,"frontendId":1180,"title":"Count Substrings with Only One Distinct Letter","titleSlug":"count-substrings-with-only-one-distinct-letter","difficulty":"EASY","paidOnly":true,"tags":["math","string"]}
|
||
{"id":1132,"frontendId":1181,"title":"Before and After Puzzle","titleSlug":"before-and-after-puzzle","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","string","sorting"]}
|
||
{"id":1133,"frontendId":1163,"title":"Last Substring in Lexicographical Order","titleSlug":"last-substring-in-lexicographical-order","difficulty":"HARD","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":1134,"frontendId":1182,"title":"Shortest Distance to Target Color","titleSlug":"shortest-distance-to-target-color","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search","dynamic-programming"]}
|
||
{"id":1135,"frontendId":1045,"title":"Customers Who Bought All Products","titleSlug":"customers-who-bought-all-products","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":1136,"frontendId":1050,"title":"Actors and Directors Who Cooperated At Least Three Times","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1137,"frontendId":1051,"title":"Height Checker","titleSlug":"height-checker","difficulty":"EASY","paidOnly":false,"tags":["array","sorting","counting-sort"]}
|
||
{"id":1138,"frontendId":1052,"title":"Grumpy Bookstore Owner","titleSlug":"grumpy-bookstore-owner","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sliding-window"]}
|
||
{"id":1139,"frontendId":1053,"title":"Previous Permutation With One Swap","titleSlug":"previous-permutation-with-one-swap","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":1140,"frontendId":1054,"title":"Distant Barcodes","titleSlug":"distant-barcodes","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","sorting","heap-priority-queue","counting"]}
|
||
{"id":1141,"frontendId":1196,"title":"How Many Apples Can You Put into the Basket","titleSlug":"how-many-apples-can-you-put-into-the-basket","difficulty":"EASY","paidOnly":true,"tags":["array","greedy","sorting"]}
|
||
{"id":1142,"frontendId":1197,"title":"Minimum Knight Moves","titleSlug":"minimum-knight-moves","difficulty":"MEDIUM","paidOnly":true,"tags":["breadth-first-search"]}
|
||
{"id":1143,"frontendId":1198,"title":"Find Smallest Common Element in All Rows","titleSlug":"find-smallest-common-element-in-all-rows","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","binary-search","matrix","counting"]}
|
||
{"id":1144,"frontendId":1168,"title":"Optimize Water Distribution in a Village","titleSlug":"optimize-water-distribution-in-a-village","difficulty":"HARD","paidOnly":true,"tags":["union-find","graph","heap-priority-queue","minimum-spanning-tree"]}
|
||
{"id":1145,"frontendId":1074,"title":"Number of Submatrices That Sum to Target","titleSlug":"number-of-submatrices-that-sum-to-target","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","matrix","prefix-sum"]}
|
||
{"id":1146,"frontendId":1071,"title":"Greatest Common Divisor of Strings","titleSlug":"greatest-common-divisor-of-strings","difficulty":"EASY","paidOnly":false,"tags":["math","string"]}
|
||
{"id":1147,"frontendId":1072,"title":"Flip Columns For Maximum Number of Equal Rows","titleSlug":"flip-columns-for-maximum-number-of-equal-rows","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","matrix"]}
|
||
{"id":1148,"frontendId":1073,"title":"Adding Two Negabinary Numbers","titleSlug":"adding-two-negabinary-numbers","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math"]}
|
||
{"id":1149,"frontendId":1213,"title":"Intersection of Three Sorted Arrays","titleSlug":"intersection-of-three-sorted-arrays","difficulty":"EASY","paidOnly":true,"tags":["array","hash-table","binary-search","counting"]}
|
||
{"id":1150,"frontendId":1214,"title":"Two Sum BSTs","titleSlug":"two-sum-bsts","difficulty":"MEDIUM","paidOnly":true,"tags":["two-pointers","binary-search","stack","tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":1151,"frontendId":1215,"title":"Stepping Numbers","titleSlug":"stepping-numbers","difficulty":"MEDIUM","paidOnly":true,"tags":["math","backtracking","breadth-first-search"]}
|
||
{"id":1152,"frontendId":1183,"title":"Maximum Number of Ones","titleSlug":"maximum-number-of-ones","difficulty":"HARD","paidOnly":true,"tags":["math","greedy","sorting","heap-priority-queue"]}
|
||
{"id":1153,"frontendId":1068,"title":"Product Sales Analysis I","titleSlug":"product-sales-analysis-i","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1154,"frontendId":1069,"title":"Product Sales Analysis II","titleSlug":"product-sales-analysis-ii","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1155,"frontendId":1070,"title":"Product Sales Analysis III","titleSlug":"product-sales-analysis-iii","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":1156,"frontendId":1078,"title":"Occurrences After Bigram","titleSlug":"occurrences-after-bigram","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":1157,"frontendId":1080,"title":"Insufficient Nodes in Root to Leaf Paths","titleSlug":"insufficient-nodes-in-root-to-leaf-paths","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":1159,"frontendId":1081,"title":"Smallest Subsequence of Distinct Characters","titleSlug":"smallest-subsequence-of-distinct-characters","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","greedy","monotonic-stack"]}
|
||
{"id":1160,"frontendId":1079,"title":"Letter Tile Possibilities","titleSlug":"letter-tile-possibilities","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","backtracking","counting"]}
|
||
{"id":1161,"frontendId":1075,"title":"Project Employees I","titleSlug":"project-employees-i","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1162,"frontendId":1076,"title":"Project Employees II","titleSlug":"project-employees-ii","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1163,"frontendId":1077,"title":"Project Employees III","titleSlug":"project-employees-iii","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1164,"frontendId":1228,"title":"Missing Number In Arithmetic Progression","titleSlug":"missing-number-in-arithmetic-progression","difficulty":"EASY","paidOnly":true,"tags":["array","math"]}
|
||
{"id":1165,"frontendId":1229,"title":"Meeting Scheduler","titleSlug":"meeting-scheduler","difficulty":"MEDIUM","paidOnly":true,"tags":["array","two-pointers","sorting"]}
|
||
{"id":1166,"frontendId":1230,"title":"Toss Strange Coins","titleSlug":"toss-strange-coins","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","dynamic-programming","probability-and-statistics"]}
|
||
{"id":1167,"frontendId":1199,"title":"Minimum Time to Build Blocks","titleSlug":"minimum-time-to-build-blocks","difficulty":"HARD","paidOnly":true,"tags":["array","math","greedy","heap-priority-queue"]}
|
||
{"id":1168,"frontendId":1089,"title":"Duplicate Zeros","titleSlug":"duplicate-zeros","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers"]}
|
||
{"id":1169,"frontendId":1090,"title":"Largest Values From Labels","titleSlug":"largest-values-from-labels","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","sorting","counting"]}
|
||
{"id":1170,"frontendId":1092,"title":"Shortest Common Supersequence ","titleSlug":"shortest-common-supersequence","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":1171,"frontendId":1091,"title":"Shortest Path in Binary Matrix","titleSlug":"shortest-path-in-binary-matrix","difficulty":"MEDIUM","paidOnly":false,"tags":["array","breadth-first-search","matrix"]}
|
||
{"id":1172,"frontendId":1082,"title":"Sales Analysis I","titleSlug":"sales-analysis-i","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1173,"frontendId":1083,"title":"Sales Analysis II","titleSlug":"sales-analysis-ii","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1174,"frontendId":1084,"title":"Sales Analysis III","titleSlug":"sales-analysis-iii","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1175,"frontendId":1243,"title":"Array Transformation","titleSlug":"array-transformation","difficulty":"EASY","paidOnly":true,"tags":["array","simulation"]}
|
||
{"id":1176,"frontendId":1244,"title":"Design A Leaderboard","titleSlug":"design-a-leaderboard","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","design","sorting"]}
|
||
{"id":1177,"frontendId":1245,"title":"Tree Diameter","titleSlug":"tree-diameter","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","breadth-first-search","graph","topological-sort"]}
|
||
{"id":1178,"frontendId":1216,"title":"Valid Palindrome III","titleSlug":"valid-palindrome-iii","difficulty":"HARD","paidOnly":true,"tags":["string","dynamic-programming"]}
|
||
{"id":1179,"frontendId":511,"title":"Game Play Analysis I","titleSlug":"game-play-analysis-i","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1180,"frontendId":512,"title":"Game Play Analysis II","titleSlug":"game-play-analysis-ii","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1181,"frontendId":534,"title":"Game Play Analysis III","titleSlug":"game-play-analysis-iii","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1182,"frontendId":550,"title":"Game Play Analysis IV","titleSlug":"game-play-analysis-iv","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":1183,"frontendId":1093,"title":"Statistics from a Large Sample","titleSlug":"statistics-from-a-large-sample","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","probability-and-statistics"]}
|
||
{"id":1184,"frontendId":1094,"title":"Car Pooling","titleSlug":"car-pooling","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting","heap-priority-queue","simulation","prefix-sum"]}
|
||
{"id":1185,"frontendId":1095,"title":"Find in Mountain Array","titleSlug":"find-in-mountain-array","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","interactive"]}
|
||
{"id":1186,"frontendId":1117,"title":"Building H2O","titleSlug":"building-h2o","difficulty":"MEDIUM","paidOnly":false,"tags":["concurrency"]}
|
||
{"id":1187,"frontendId":1115,"title":"Print FooBar Alternately","titleSlug":"print-foobar-alternately","difficulty":"MEDIUM","paidOnly":false,"tags":["concurrency"]}
|
||
{"id":1188,"frontendId":1096,"title":"Brace Expansion II","titleSlug":"brace-expansion-ii","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","backtracking","stack","breadth-first-search","sorting"]}
|
||
{"id":1189,"frontendId":1256,"title":"Encode Number","titleSlug":"encode-number","difficulty":"MEDIUM","paidOnly":true,"tags":["math","string","bit-manipulation"]}
|
||
{"id":1190,"frontendId":1257,"title":"Smallest Common Region","titleSlug":"smallest-common-region","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","string","tree","depth-first-search","breadth-first-search"]}
|
||
{"id":1191,"frontendId":1258,"title":"Synonymous Sentences","titleSlug":"synonymous-sentences","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","string","backtracking","sort","union-find"]}
|
||
{"id":1192,"frontendId":1231,"title":"Divide Chocolate","titleSlug":"divide-chocolate","difficulty":"HARD","paidOnly":true,"tags":["array","binary-search"]}
|
||
{"id":1193,"frontendId":1097,"title":"Game Play Analysis V","titleSlug":"game-play-analysis-v","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":1194,"frontendId":1104,"title":"Path In Zigzag Labelled Binary Tree","titleSlug":"path-in-zigzag-labelled-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["math","tree","binary-tree"]}
|
||
{"id":1195,"frontendId":1103,"title":"Distribute Candies to People","titleSlug":"distribute-candies-to-people","difficulty":"EASY","paidOnly":false,"tags":["math","simulation"]}
|
||
{"id":1196,"frontendId":1105,"title":"Filling Bookcase Shelves","titleSlug":"filling-bookcase-shelves","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":1197,"frontendId":1106,"title":"Parsing A Boolean Expression","titleSlug":"parsing-a-boolean-expression","difficulty":"HARD","paidOnly":false,"tags":["string","stack","recursion"]}
|
||
{"id":1198,"frontendId":1098,"title":"Unpopular Books","titleSlug":"unpopular-books","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1199,"frontendId":1271,"title":"Hexspeak","titleSlug":"hexspeak","difficulty":"EASY","paidOnly":true,"tags":["math","string"]}
|
||
{"id":1200,"frontendId":1272,"title":"Remove Interval","titleSlug":"remove-interval","difficulty":"MEDIUM","paidOnly":true,"tags":["array"]}
|
||
{"id":1201,"frontendId":1273,"title":"Delete Tree Nodes","titleSlug":"delete-tree-nodes","difficulty":"MEDIUM","paidOnly":true,"tags":["array","tree","depth-first-search","breadth-first-search"]}
|
||
{"id":1202,"frontendId":1246,"title":"Palindrome Removal","titleSlug":"palindrome-removal","difficulty":"HARD","paidOnly":true,"tags":["array","dynamic-programming"]}
|
||
{"id":1203,"frontendId":1114,"title":"Print in Order","titleSlug":"print-in-order","difficulty":"EASY","paidOnly":false,"tags":["concurrency"]}
|
||
{"id":1204,"frontendId":1107,"title":"New Users Daily Count","titleSlug":"new-users-daily-count","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1205,"frontendId":1108,"title":"Defanging an IP Address","titleSlug":"defanging-an-ip-address","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":1206,"frontendId":1109,"title":"Corporate Flight Bookings","titleSlug":"corporate-flight-bookings","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":1207,"frontendId":1110,"title":"Delete Nodes And Return Forest","titleSlug":"delete-nodes-and-return-forest","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","tree","depth-first-search","binary-tree"]}
|
||
{"id":1208,"frontendId":1111,"title":"Maximum Nesting Depth of Two Valid Parentheses Strings","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack"]}
|
||
{"id":1209,"frontendId":1188,"title":"Design Bounded Blocking Queue","titleSlug":"design-bounded-blocking-queue","difficulty":"MEDIUM","paidOnly":true,"tags":["concurrency"]}
|
||
{"id":1210,"frontendId":1619,"title":"Mean of Array After Removing Some Elements","titleSlug":"mean-of-array-after-removing-some-elements","difficulty":"EASY","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":1211,"frontendId":1286,"title":"Iterator for Combination","titleSlug":"iterator-for-combination","difficulty":"MEDIUM","paidOnly":false,"tags":["string","backtracking","design","iterator"]}
|
||
{"id":1212,"frontendId":1291,"title":"Sequential Digits","titleSlug":"sequential-digits","difficulty":"MEDIUM","paidOnly":false,"tags":["enumeration"]}
|
||
{"id":1213,"frontendId":1259,"title":"Handshakes That Don't Cross","titleSlug":"handshakes-that-dont-cross","difficulty":"HARD","paidOnly":true,"tags":["math","dynamic-programming"]}
|
||
{"id":1214,"frontendId":1112,"title":"Highest Grade For Each Student","titleSlug":"highest-grade-for-each-student","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1215,"frontendId":1113,"title":"Reported Posts","titleSlug":"reported-posts","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1216,"frontendId":1116,"title":"Print Zero Even Odd","titleSlug":"print-zero-even-odd","difficulty":"MEDIUM","paidOnly":false,"tags":["concurrency"]}
|
||
{"id":1217,"frontendId":1122,"title":"Relative Sort Array","titleSlug":"relative-sort-array","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sorting","counting-sort"]}
|
||
{"id":1218,"frontendId":1123,"title":"Lowest Common Ancestor of Deepest Leaves","titleSlug":"lowest-common-ancestor-of-deepest-leaves","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":1219,"frontendId":1124,"title":"Longest Well-Performing Interval","titleSlug":"longest-well-performing-interval","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","stack","monotonic-stack","prefix-sum"]}
|
||
{"id":1220,"frontendId":1125,"title":"Smallest Sufficient Team","titleSlug":"smallest-sufficient-team","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","bitmask"]}
|
||
{"id":1221,"frontendId":1287,"title":"Element Appearing More Than 25% In Sorted Array","titleSlug":"element-appearing-more-than-25-in-sorted-array","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":1222,"frontendId":1288,"title":"Remove Covered Intervals","titleSlug":"remove-covered-intervals","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":1223,"frontendId":1627,"title":"Graph Connectivity With Threshold","titleSlug":"graph-connectivity-with-threshold","difficulty":"HARD","paidOnly":false,"tags":["array","math","union-find","number-theory"]}
|
||
{"id":1224,"frontendId":1289,"title":"Minimum Falling Path Sum II","titleSlug":"minimum-falling-path-sum-ii","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":1225,"frontendId":1126,"title":"Active Businesses","titleSlug":"active-businesses","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1226,"frontendId":1127,"title":"User Purchase Platform","titleSlug":"user-purchase-platform","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":1227,"frontendId":1128,"title":"Number of Equivalent Domino Pairs","titleSlug":"number-of-equivalent-domino-pairs","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":1228,"frontendId":1130,"title":"Minimum Cost Tree From Leaf Values","titleSlug":"minimum-cost-tree-from-leaf-values","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","stack","greedy","monotonic-stack"]}
|
||
{"id":1229,"frontendId":1129,"title":"Shortest Path with Alternating Colors","titleSlug":"shortest-path-with-alternating-colors","difficulty":"MEDIUM","paidOnly":false,"tags":["breadth-first-search","graph"]}
|
||
{"id":1230,"frontendId":1131,"title":"Maximum of Absolute Value Expression","titleSlug":"maximum-of-absolute-value-expression","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math"]}
|
||
{"id":1231,"frontendId":1299,"title":"Replace Elements with Greatest Element on Right Side","titleSlug":"replace-elements-with-greatest-element-on-right-side","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":1232,"frontendId":1300,"title":"Sum of Mutated Array Closest to Target","titleSlug":"sum-of-mutated-array-closest-to-target","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","sorting"]}
|
||
{"id":1233,"frontendId":1274,"title":"Number of Ships in a Rectangle","titleSlug":"number-of-ships-in-a-rectangle","difficulty":"HARD","paidOnly":true,"tags":["array","divide-and-conquer","interactive"]}
|
||
{"id":1234,"frontendId":1301,"title":"Number of Paths with Max Score","titleSlug":"number-of-paths-with-max-score","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":1236,"frontendId":1137,"title":"N-th Tribonacci Number","titleSlug":"n-th-tribonacci-number","difficulty":"EASY","paidOnly":false,"tags":["math","dynamic-programming","memoization"]}
|
||
{"id":1237,"frontendId":1132,"title":"Reported Posts II","titleSlug":"reported-posts-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1238,"frontendId":1138,"title":"Alphabet Board Path","titleSlug":"alphabet-board-path","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":1239,"frontendId":1139,"title":"Largest 1-Bordered Square","titleSlug":"largest-1-bordered-square","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":1240,"frontendId":1140,"title":"Stone Game II","titleSlug":"stone-game-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","dynamic-programming","prefix-sum","game-theory"]}
|
||
{"id":1241,"frontendId":1313,"title":"Decompress Run-Length Encoded List","titleSlug":"decompress-run-length-encoded-list","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":1242,"frontendId":1314,"title":"Matrix Block Sum","titleSlug":"matrix-block-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","prefix-sum"]}
|
||
{"id":1243,"frontendId":1315,"title":"Sum of Nodes with Even-Valued Grandparent","titleSlug":"sum-of-nodes-with-even-valued-grandparent","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":1244,"frontendId":1316,"title":"Distinct Echo Substrings","titleSlug":"distinct-echo-substrings","difficulty":"HARD","paidOnly":false,"tags":["string","trie","rolling-hash","hash-function"]}
|
||
{"id":1245,"frontendId":1141,"title":"User Activity for the Past 30 Days I","titleSlug":"user-activity-for-the-past-30-days-i","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1246,"frontendId":1142,"title":"User Activity for the Past 30 Days II","titleSlug":"user-activity-for-the-past-30-days-ii","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1247,"frontendId":1144,"title":"Decrease Elements To Make Array Zigzag","titleSlug":"decrease-elements-to-make-array-zigzag","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":1248,"frontendId":1145,"title":"Binary Tree Coloring Game","titleSlug":"binary-tree-coloring-game","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":1249,"frontendId":1146,"title":"Snapshot Array","titleSlug":"snapshot-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","binary-search","design"]}
|
||
{"id":1250,"frontendId":1143,"title":"Longest Common Subsequence","titleSlug":"longest-common-subsequence","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":1251,"frontendId":1147,"title":"Longest Chunked Palindrome Decomposition","titleSlug":"longest-chunked-palindrome-decomposition","difficulty":"HARD","paidOnly":false,"tags":["two-pointers","string","dynamic-programming","greedy","rolling-hash","hash-function"]}
|
||
{"id":1252,"frontendId":1328,"title":"Break a Palindrome","titleSlug":"break-a-palindrome","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":1253,"frontendId":1329,"title":"Sort the Matrix Diagonally","titleSlug":"sort-the-matrix-diagonally","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting","matrix"]}
|
||
{"id":1254,"frontendId":1302,"title":"Deepest Leaves Sum","titleSlug":"deepest-leaves-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":1255,"frontendId":1330,"title":"Reverse Subarray To Maximize Array Value","titleSlug":"reverse-subarray-to-maximize-array-value","difficulty":"HARD","paidOnly":false,"tags":["array","math","greedy"]}
|
||
{"id":1256,"frontendId":1331,"title":"Rank Transform of an Array","titleSlug":"rank-transform-of-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sorting"]}
|
||
{"id":1257,"frontendId":1632,"title":"Rank Transform of a Matrix","titleSlug":"rank-transform-of-a-matrix","difficulty":"HARD","paidOnly":false,"tags":["array","union-find","graph","topological-sort","sorting","matrix"]}
|
||
{"id":1258,"frontendId":1148,"title":"Article Views I","titleSlug":"article-views-i","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1259,"frontendId":1149,"title":"Article Views II","titleSlug":"article-views-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1260,"frontendId":1154,"title":"Day of the Year","titleSlug":"day-of-the-year","difficulty":"EASY","paidOnly":false,"tags":["math","string"]}
|
||
{"id":1261,"frontendId":1156,"title":"Swap For Longest Repeated Character Substring","titleSlug":"swap-for-longest-repeated-character-substring","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":1262,"frontendId":1157,"title":"Online Majority Element In Subarray","titleSlug":"online-majority-element-in-subarray","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","design","binary-indexed-tree","segment-tree"]}
|
||
{"id":1263,"frontendId":1155,"title":"Number of Dice Rolls With Target Sum","titleSlug":"number-of-dice-rolls-with-target-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":1264,"frontendId":1935,"title":"Maximum Number of Words You Can Type","titleSlug":"maximum-number-of-words-you-can-type","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":1267,"frontendId":1171,"title":"Remove Zero Sum Consecutive Nodes from Linked List","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","linked-list"]}
|
||
{"id":1268,"frontendId":1158,"title":"Market Analysis I","titleSlug":"market-analysis-i","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":1269,"frontendId":1159,"title":"Market Analysis II","titleSlug":"market-analysis-ii","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":1270,"frontendId":1172,"title":"Dinner Plate Stacks","titleSlug":"dinner-plate-stacks","difficulty":"HARD","paidOnly":false,"tags":["hash-table","stack","design","heap-priority-queue"]}
|
||
{"id":1271,"frontendId":1236,"title":"Web Crawler","titleSlug":"web-crawler","difficulty":"MEDIUM","paidOnly":true,"tags":["string","depth-first-search","breadth-first-search","interactive"]}
|
||
{"id":1272,"frontendId":1169,"title":"Invalid Transactions","titleSlug":"invalid-transactions","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","sorting"]}
|
||
{"id":1273,"frontendId":1170,"title":"Compare Strings by Frequency of the Smallest Character","titleSlug":"compare-strings-by-frequency-of-the-smallest-character","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","binary-search","sorting"]}
|
||
{"id":1274,"frontendId":1360,"title":"Number of Days Between Two Dates","titleSlug":"number-of-days-between-two-dates","difficulty":"EASY","paidOnly":false,"tags":["math","string"]}
|
||
{"id":1275,"frontendId":1361,"title":"Validate Binary Tree Nodes","titleSlug":"validate-binary-tree-nodes","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","union-find","graph","binary-tree"]}
|
||
{"id":1276,"frontendId":1362,"title":"Closest Divisors","titleSlug":"closest-divisors","difficulty":"MEDIUM","paidOnly":false,"tags":["math"]}
|
||
{"id":1277,"frontendId":1363,"title":"Largest Multiple of Three","titleSlug":"largest-multiple-of-three","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","greedy","sorting"]}
|
||
{"id":1278,"frontendId":1164,"title":"Product Price at a Given Date","titleSlug":"product-price-at-a-given-date","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":1279,"frontendId":1175,"title":"Prime Arrangements","titleSlug":"prime-arrangements","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":1280,"frontendId":1176,"title":"Diet Plan Performance","titleSlug":"diet-plan-performance","difficulty":"EASY","paidOnly":true,"tags":["array","sliding-window"]}
|
||
{"id":1281,"frontendId":1177,"title":"Can Make Palindrome from Substring","titleSlug":"can-make-palindrome-from-substring","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","bit-manipulation","prefix-sum"]}
|
||
{"id":1282,"frontendId":1178,"title":"Number of Valid Words for Each Puzzle","titleSlug":"number-of-valid-words-for-each-puzzle","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","string","bit-manipulation","trie"]}
|
||
{"id":1283,"frontendId":1507,"title":"Reformat Date","titleSlug":"reformat-date","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":1284,"frontendId":1390,"title":"Four Divisors","titleSlug":"four-divisors","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math"]}
|
||
{"id":1285,"frontendId":1382,"title":"Balance a Binary Search Tree","titleSlug":"balance-a-binary-search-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["divide-and-conquer","greedy","tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":1286,"frontendId":1425,"title":"Constrained Subsequence Sum","titleSlug":"constrained-subsequence-sum","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","queue","sliding-window","heap-priority-queue","monotonic-queue"]}
|
||
{"id":1287,"frontendId":1184,"title":"Distance Between Bus Stops","titleSlug":"distance-between-bus-stops","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":1288,"frontendId":1186,"title":"Maximum Subarray Sum with One Deletion","titleSlug":"maximum-subarray-sum-with-one-deletion","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":1289,"frontendId":1185,"title":"Day of the Week","titleSlug":"day-of-the-week","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":1290,"frontendId":1187,"title":"Make Array Strictly Increasing","titleSlug":"make-array-strictly-increasing","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","dynamic-programming","sorting"]}
|
||
{"id":1291,"frontendId":1173,"title":"Immediate Food Delivery I","titleSlug":"immediate-food-delivery-i","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1292,"frontendId":1174,"title":"Immediate Food Delivery II","titleSlug":"immediate-food-delivery-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":1293,"frontendId":1550,"title":"Three Consecutive Odds","titleSlug":"three-consecutive-odds","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":1294,"frontendId":2080,"title":"Range Frequency Queries","titleSlug":"range-frequency-queries","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","binary-search","design","segment-tree"]}
|
||
{"id":1295,"frontendId":1954,"title":"Minimum Garden Perimeter to Collect Enough Apples","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples","difficulty":"MEDIUM","paidOnly":false,"tags":["math","binary-search"]}
|
||
{"id":1296,"frontendId":1483,"title":"Kth Ancestor of a Tree Node","titleSlug":"kth-ancestor-of-a-tree-node","difficulty":"HARD","paidOnly":false,"tags":["binary-search","dynamic-programming","bit-manipulation","tree","depth-first-search","breadth-first-search","design"]}
|
||
{"id":1297,"frontendId":1189,"title":"Maximum Number of Balloons","titleSlug":"maximum-number-of-balloons","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":1298,"frontendId":1190,"title":"Reverse Substrings Between Each Pair of Parentheses","titleSlug":"reverse-substrings-between-each-pair-of-parentheses","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack"]}
|
||
{"id":1299,"frontendId":1191,"title":"K-Concatenation Maximum Sum","titleSlug":"k-concatenation-maximum-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":1300,"frontendId":1192,"title":"Critical Connections in a Network","titleSlug":"critical-connections-in-a-network","difficulty":"HARD","paidOnly":false,"tags":["depth-first-search","graph","biconnected-component"]}
|
||
{"id":1301,"frontendId":1179,"title":"Reformat Department Table","titleSlug":"reformat-department-table","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1302,"frontendId":1957,"title":"Delete Characters to Make Fancy String","titleSlug":"delete-characters-to-make-fancy-string","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":1303,"frontendId":2139,"title":"Minimum Moves to Reach Target Score","titleSlug":"minimum-moves-to-reach-target-score","difficulty":"MEDIUM","paidOnly":false,"tags":["math","greedy"]}
|
||
{"id":1304,"frontendId":1405,"title":"Longest Happy String","titleSlug":"longest-happy-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy","heap-priority-queue"]}
|
||
{"id":1305,"frontendId":1944,"title":"Number of Visible People in a Queue","titleSlug":"number-of-visible-people-in-a-queue","difficulty":"HARD","paidOnly":false,"tags":["array","stack","monotonic-stack"]}
|
||
{"id":1306,"frontendId":1200,"title":"Minimum Absolute Difference","titleSlug":"minimum-absolute-difference","difficulty":"EASY","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":1307,"frontendId":1201,"title":"Ugly Number III","titleSlug":"ugly-number-iii","difficulty":"MEDIUM","paidOnly":false,"tags":["math","binary-search","combinatorics","number-theory"]}
|
||
{"id":1308,"frontendId":1202,"title":"Smallest String With Swaps","titleSlug":"smallest-string-with-swaps","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","depth-first-search","breadth-first-search","union-find","sorting"]}
|
||
{"id":1309,"frontendId":1203,"title":"Sort Items by Groups Respecting Dependencies","titleSlug":"sort-items-by-groups-respecting-dependencies","difficulty":"HARD","paidOnly":false,"tags":["depth-first-search","breadth-first-search","graph","topological-sort"]}
|
||
{"id":1310,"frontendId":2079,"title":"Watering Plants","titleSlug":"watering-plants","difficulty":"MEDIUM","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":1311,"frontendId":1895,"title":"Largest Magic Square","titleSlug":"largest-magic-square","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","prefix-sum"]}
|
||
{"id":1312,"frontendId":2201,"title":"Count Artifacts That Can Be Extracted","titleSlug":"count-artifacts-that-can-be-extracted","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","simulation"]}
|
||
{"id":1313,"frontendId":1916,"title":"Count Ways to Build Rooms in an Ant Colony","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","tree","depth-first-search","graph","topological-sort","combinatorics"]}
|
||
{"id":1316,"frontendId":1195,"title":"Fizz Buzz Multithreaded","titleSlug":"fizz-buzz-multithreaded","difficulty":"MEDIUM","paidOnly":false,"tags":["concurrency"]}
|
||
{"id":1317,"frontendId":1193,"title":"Monthly Transactions I","titleSlug":"monthly-transactions-i","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":1318,"frontendId":1194,"title":"Tournament Winners","titleSlug":"tournament-winners","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":1319,"frontendId":1207,"title":"Unique Number of Occurrences","titleSlug":"unique-number-of-occurrences","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":1320,"frontendId":1209,"title":"Remove All Adjacent Duplicates in String II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack"]}
|
||
{"id":1321,"frontendId":1208,"title":"Get Equal Substrings Within Budget","titleSlug":"get-equal-substrings-within-budget","difficulty":"MEDIUM","paidOnly":false,"tags":["string","binary-search","sliding-window","prefix-sum"]}
|
||
{"id":1322,"frontendId":1210,"title":"Minimum Moves to Reach Target with Rotations","titleSlug":"minimum-moves-to-reach-target-with-rotations","difficulty":"HARD","paidOnly":false,"tags":["array","breadth-first-search","matrix"]}
|
||
{"id":1324,"frontendId":1706,"title":"Where Will the Ball Fall","titleSlug":"where-will-the-ball-fall","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","simulation"]}
|
||
{"id":1325,"frontendId":1514,"title":"Path with Maximum Probability","titleSlug":"path-with-maximum-probability","difficulty":"MEDIUM","paidOnly":false,"tags":["array","graph","heap-priority-queue","shortest-path"]}
|
||
{"id":1326,"frontendId":1862,"title":"Sum of Floored Pairs","titleSlug":"sum-of-floored-pairs","difficulty":"HARD","paidOnly":false,"tags":["array","math","binary-search","counting","enumeration","prefix-sum"]}
|
||
{"id":1327,"frontendId":1204,"title":"Last Person to Fit in the Bus","titleSlug":"last-person-to-fit-in-the-bus","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":1328,"frontendId":1205,"title":"Monthly Transactions II","titleSlug":"monthly-transactions-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1329,"frontendId":1217,"title":"Minimum Cost to Move Chips to The Same Position","titleSlug":"minimum-cost-to-move-chips-to-the-same-position","difficulty":"EASY","paidOnly":false,"tags":["array","math","greedy"]}
|
||
{"id":1330,"frontendId":1218,"title":"Longest Arithmetic Subsequence of Given Difference","titleSlug":"longest-arithmetic-subsequence-of-given-difference","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","dynamic-programming"]}
|
||
{"id":1331,"frontendId":1219,"title":"Path with Maximum Gold","titleSlug":"path-with-maximum-gold","difficulty":"MEDIUM","paidOnly":false,"tags":["array","backtracking","matrix"]}
|
||
{"id":1332,"frontendId":1220,"title":"Count Vowels Permutation","titleSlug":"count-vowels-permutation","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":1333,"frontendId":2191,"title":"Sort the Jumbled Numbers","titleSlug":"sort-the-jumbled-numbers","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":1334,"frontendId":2310,"title":"Sum of Numbers With Units Digit K","titleSlug":"sum-of-numbers-with-units-digit-k","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming","greedy","enumeration"]}
|
||
{"id":1335,"frontendId":2226,"title":"Maximum Candies Allocated to K Children","titleSlug":"maximum-candies-allocated-to-k-children","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":1336,"frontendId":1960,"title":"Maximum Product of the Length of Two Palindromic Substrings","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings","difficulty":"HARD","paidOnly":false,"tags":["two-pointers","string","rolling-hash","hash-function"]}
|
||
{"id":1337,"frontendId":1206,"title":"Design Skiplist","titleSlug":"design-skiplist","difficulty":"HARD","paidOnly":false,"tags":["linked-list","design"]}
|
||
{"id":1338,"frontendId":1211,"title":"Queries Quality and Percentage","titleSlug":"queries-quality-and-percentage","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1339,"frontendId":1212,"title":"Team Scores in Football Tournament","titleSlug":"team-scores-in-football-tournament","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1340,"frontendId":1226,"title":"The Dining Philosophers","titleSlug":"the-dining-philosophers","difficulty":"MEDIUM","paidOnly":false,"tags":["concurrency"]}
|
||
{"id":1341,"frontendId":1221,"title":"Split a String in Balanced Strings","titleSlug":"split-a-string-in-balanced-strings","difficulty":"EASY","paidOnly":false,"tags":["string","greedy","counting"]}
|
||
{"id":1342,"frontendId":1222,"title":"Queens That Can Attack the King","titleSlug":"queens-that-can-attack-the-king","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","simulation"]}
|
||
{"id":1343,"frontendId":1223,"title":"Dice Roll Simulation","titleSlug":"dice-roll-simulation","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":1344,"frontendId":1224,"title":"Maximum Equal Frequency","titleSlug":"maximum-equal-frequency","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":1345,"frontendId":1427,"title":"Perform String Shifts","titleSlug":"perform-string-shifts","difficulty":"EASY","paidOnly":true,"tags":["array","math","string"]}
|
||
{"id":1346,"frontendId":2202,"title":"Maximize the Topmost Element After K Moves","titleSlug":"maximize-the-topmost-element-after-k-moves","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":1347,"frontendId":2204,"title":"Distance to a Cycle in Undirected Graph","titleSlug":"distance-to-a-cycle-in-undirected-graph","difficulty":"HARD","paidOnly":true,"tags":["depth-first-search","breadth-first-search","graph","topological-sort"]}
|
||
{"id":1348,"frontendId":2321,"title":"Maximum Score Of Spliced Array","titleSlug":"maximum-score-of-spliced-array","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":1349,"frontendId":1232,"title":"Check If It Is a Straight Line","titleSlug":"check-if-it-is-a-straight-line","difficulty":"EASY","paidOnly":false,"tags":["array","math","geometry"]}
|
||
{"id":1350,"frontendId":1233,"title":"Remove Sub-Folders from the Filesystem","titleSlug":"remove-sub-folders-from-the-filesystem","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","depth-first-search","trie"]}
|
||
{"id":1351,"frontendId":1234,"title":"Replace the Substring for Balanced String","titleSlug":"replace-the-substring-for-balanced-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","sliding-window"]}
|
||
{"id":1352,"frontendId":1235,"title":"Maximum Profit in Job Scheduling","titleSlug":"maximum-profit-in-job-scheduling","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","dynamic-programming","sorting"]}
|
||
{"id":1353,"frontendId":2273,"title":"Find Resultant Array After Removing Anagrams","titleSlug":"find-resultant-array-after-removing-anagrams","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string","sorting"]}
|
||
{"id":1354,"frontendId":2225,"title":"Find Players With Zero or One Losses","titleSlug":"find-players-with-zero-or-one-losses","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sorting","counting"]}
|
||
{"id":1355,"frontendId":2216,"title":"Minimum Deletions to Make Array Beautiful","titleSlug":"minimum-deletions-to-make-array-beautiful","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","greedy"]}
|
||
{"id":1356,"frontendId":2193,"title":"Minimum Number of Moves to Make Palindrome","titleSlug":"minimum-number-of-moves-to-make-palindrome","difficulty":"HARD","paidOnly":false,"tags":["two-pointers","string","greedy","binary-indexed-tree"]}
|
||
{"id":1357,"frontendId":1225,"title":"Report Contiguous Dates","titleSlug":"report-contiguous-dates","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":1358,"frontendId":1237,"title":"Find Positive Integer Solution for a Given Equation","titleSlug":"find-positive-integer-solution-for-a-given-equation","difficulty":"MEDIUM","paidOnly":false,"tags":["math","two-pointers","binary-search","interactive"]}
|
||
{"id":1359,"frontendId":1238,"title":"Circular Permutation in Binary Representation","titleSlug":"circular-permutation-in-binary-representation","difficulty":"MEDIUM","paidOnly":false,"tags":["math","backtracking","bit-manipulation"]}
|
||
{"id":1360,"frontendId":1239,"title":"Maximum Length of a Concatenated String with Unique Characters","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","backtracking","bit-manipulation"]}
|
||
{"id":1361,"frontendId":1240,"title":"Tiling a Rectangle with the Fewest Squares","titleSlug":"tiling-a-rectangle-with-the-fewest-squares","difficulty":"HARD","paidOnly":false,"tags":["backtracking"]}
|
||
{"id":1362,"frontendId":1227,"title":"Airplane Seat Assignment Probability","titleSlug":"airplane-seat-assignment-probability","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming","brainteaser","probability-and-statistics"]}
|
||
{"id":1363,"frontendId":2309,"title":"Greatest English Letter in Upper and Lower Case","titleSlug":"greatest-english-letter-in-upper-and-lower-case","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","enumeration"]}
|
||
{"id":1364,"frontendId":1726,"title":"Tuple with Same Product","titleSlug":"tuple-with-same-product","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":1366,"frontendId":1429,"title":"First Unique Number","titleSlug":"first-unique-number","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","design","queue","data-stream"]}
|
||
{"id":1367,"frontendId":1691,"title":"Maximum Height by Stacking Cuboids ","titleSlug":"maximum-height-by-stacking-cuboids","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","sorting"]}
|
||
{"id":1368,"frontendId":1242,"title":"Web Crawler Multithreaded","titleSlug":"web-crawler-multithreaded","difficulty":"MEDIUM","paidOnly":true,"tags":["depth-first-search","breadth-first-search","concurrency"]}
|
||
{"id":1369,"frontendId":1247,"title":"Minimum Swaps to Make Strings Equal","titleSlug":"minimum-swaps-to-make-strings-equal","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string","greedy"]}
|
||
{"id":1370,"frontendId":1248,"title":"Count Number of Nice Subarrays","titleSlug":"count-number-of-nice-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","sliding-window","prefix-sum"]}
|
||
{"id":1371,"frontendId":1249,"title":"Minimum Remove to Make Valid Parentheses","titleSlug":"minimum-remove-to-make-valid-parentheses","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack"]}
|
||
{"id":1372,"frontendId":1250,"title":"Check If It Is a Good Array","titleSlug":"check-if-it-is-a-good-array","difficulty":"HARD","paidOnly":false,"tags":["array","math","number-theory"]}
|
||
{"id":1374,"frontendId":1428,"title":"Leftmost Column with at Least a One","titleSlug":"leftmost-column-with-at-least-a-one","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search","matrix","interactive"]}
|
||
{"id":1375,"frontendId":2217,"title":"Find Palindrome With Fixed Length","titleSlug":"find-palindrome-with-fixed-length","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math"]}
|
||
{"id":1376,"frontendId":2312,"title":"Selling Pieces of Wood","titleSlug":"selling-pieces-of-wood","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","memoization"]}
|
||
{"id":1377,"frontendId":1241,"title":"Number of Comments per Post","titleSlug":"number-of-comments-per-post","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1378,"frontendId":1252,"title":"Cells with Odd Values in a Matrix","titleSlug":"cells-with-odd-values-in-a-matrix","difficulty":"EASY","paidOnly":false,"tags":["array","math","simulation"]}
|
||
{"id":1379,"frontendId":1253,"title":"Reconstruct a 2-Row Binary Matrix","titleSlug":"reconstruct-a-2-row-binary-matrix","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","matrix"]}
|
||
{"id":1380,"frontendId":1254,"title":"Number of Closed Islands","titleSlug":"number-of-closed-islands","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","union-find","matrix"]}
|
||
{"id":1381,"frontendId":1255,"title":"Maximum Score Words Formed by Letters","titleSlug":"maximum-score-words-formed-by-letters","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","string","dynamic-programming","backtracking","bit-manipulation","counting","bitmask"]}
|
||
{"id":1382,"frontendId":2303,"title":"Calculate Amount Paid in Taxes","titleSlug":"calculate-amount-paid-in-taxes","difficulty":"EASY","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":1383,"frontendId":2198,"title":"Number of Single Divisor Triplets","titleSlug":"number-of-single-divisor-triplets","difficulty":"MEDIUM","paidOnly":true,"tags":["array","counting","enumeration"]}
|
||
{"id":1384,"frontendId":1618,"title":"Maximum Font to Fit a Sentence in a Screen","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen","difficulty":"MEDIUM","paidOnly":true,"tags":["array","string","binary-search","interactive"]}
|
||
{"id":1385,"frontendId":2189,"title":"Number of Ways to Build House of Cards","titleSlug":"number-of-ways-to-build-house-of-cards","difficulty":"MEDIUM","paidOnly":true,"tags":["math","dynamic-programming"]}
|
||
{"id":1386,"frontendId":1260,"title":"Shift 2D Grid","titleSlug":"shift-2d-grid","difficulty":"EASY","paidOnly":false,"tags":["array","matrix","simulation"]}
|
||
{"id":1387,"frontendId":1261,"title":"Find Elements in a Contaminated Binary Tree","titleSlug":"find-elements-in-a-contaminated-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","tree","depth-first-search","breadth-first-search","design","binary-tree"]}
|
||
{"id":1388,"frontendId":1262,"title":"Greatest Sum Divisible by Three","titleSlug":"greatest-sum-divisible-by-three","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","greedy","sorting"]}
|
||
{"id":1389,"frontendId":1263,"title":"Minimum Moves to Move a Box to Their Target Location","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location","difficulty":"HARD","paidOnly":false,"tags":["array","breadth-first-search","heap-priority-queue","matrix"]}
|
||
{"id":1390,"frontendId":1251,"title":"Average Selling Price","titleSlug":"average-selling-price","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1391,"frontendId":1426,"title":"Counting Elements","titleSlug":"counting-elements","difficulty":"EASY","paidOnly":true,"tags":["array","hash-table"]}
|
||
{"id":1392,"frontendId":2215,"title":"Find the Difference of Two Arrays","titleSlug":"find-the-difference-of-two-arrays","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":1393,"frontendId":2218,"title":"Maximum Value of K Coins From Piles","titleSlug":"maximum-value-of-k-coins-from-piles","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","prefix-sum"]}
|
||
{"id":1394,"frontendId":2304,"title":"Minimum Path Cost in a Grid","titleSlug":"minimum-path-cost-in-a-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":1395,"frontendId":1266,"title":"Minimum Time Visiting All Points","titleSlug":"minimum-time-visiting-all-points","difficulty":"EASY","paidOnly":false,"tags":["array","math","geometry"]}
|
||
{"id":1396,"frontendId":1267,"title":"Count Servers that Communicate","titleSlug":"count-servers-that-communicate","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","union-find","matrix","counting"]}
|
||
{"id":1397,"frontendId":1268,"title":"Search Suggestions System","titleSlug":"search-suggestions-system","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","binary-search","trie","sorting","heap-priority-queue"]}
|
||
{"id":1398,"frontendId":1269,"title":"Number of Ways to Stay in the Same Place After Some Steps","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":1399,"frontendId":1264,"title":"Page Recommendations","titleSlug":"page-recommendations","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1400,"frontendId":1275,"title":"Find Winner on a Tic Tac Toe Game","titleSlug":"find-winner-on-a-tic-tac-toe-game","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","matrix","simulation"]}
|
||
{"id":1401,"frontendId":1276,"title":"Number of Burgers with No Waste of Ingredients","titleSlug":"number-of-burgers-with-no-waste-of-ingredients","difficulty":"MEDIUM","paidOnly":false,"tags":["math"]}
|
||
{"id":1402,"frontendId":1277,"title":"Count Square Submatrices with All Ones","titleSlug":"count-square-submatrices-with-all-ones","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":1403,"frontendId":1278,"title":"Palindrome Partitioning III","titleSlug":"palindrome-partitioning-iii","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":1404,"frontendId":1265,"title":"Print Immutable Linked List in Reverse","titleSlug":"print-immutable-linked-list-in-reverse","difficulty":"MEDIUM","paidOnly":true,"tags":["linked-list","two-pointers","stack","recursion"]}
|
||
{"id":1405,"frontendId":1270,"title":"All People Report to the Given Manager","titleSlug":"all-people-report-to-the-given-manager","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1406,"frontendId":1281,"title":"Subtract the Product and Sum of Digits of an Integer","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":1407,"frontendId":1282,"title":"Group the People Given the Group Size They Belong To","titleSlug":"group-the-people-given-the-group-size-they-belong-to","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy"]}
|
||
{"id":1408,"frontendId":1283,"title":"Find the Smallest Divisor Given a Threshold","titleSlug":"find-the-smallest-divisor-given-a-threshold","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":1409,"frontendId":1284,"title":"Minimum Number of Flips to Convert Binary Matrix to Zero Matrix","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","bit-manipulation","breadth-first-search","matrix"]}
|
||
{"id":1410,"frontendId":1279,"title":"Traffic Light Controlled Intersection","titleSlug":"traffic-light-controlled-intersection","difficulty":"EASY","paidOnly":true,"tags":["concurrency"]}
|
||
{"id":1411,"frontendId":1290,"title":"Convert Binary Number in a Linked List to Integer","titleSlug":"convert-binary-number-in-a-linked-list-to-integer","difficulty":"EASY","paidOnly":false,"tags":["linked-list","math"]}
|
||
{"id":1413,"frontendId":1292,"title":"Maximum Side Length of a Square with Sum Less than or Equal to Threshold","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","matrix","prefix-sum"]}
|
||
{"id":1414,"frontendId":1293,"title":"Shortest Path in a Grid with Obstacles Elimination","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination","difficulty":"HARD","paidOnly":false,"tags":["array","breadth-first-search","matrix"]}
|
||
{"id":1415,"frontendId":1280,"title":"Students and Examinations","titleSlug":"students-and-examinations","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1416,"frontendId":2229,"title":"Check if an Array Is Consecutive","titleSlug":"check-if-an-array-is-consecutive","difficulty":"EASY","paidOnly":true,"tags":["array","hash-table","sorting"]}
|
||
{"id":1418,"frontendId":2305,"title":"Fair Distribution of Cookies","titleSlug":"fair-distribution-of-cookies","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","backtracking","bit-manipulation","bitmask"]}
|
||
{"id":1419,"frontendId":2263,"title":"Make Array Non-decreasing or Non-increasing","titleSlug":"make-array-non-decreasing-or-non-increasing","difficulty":"HARD","paidOnly":true,"tags":["array","dynamic-programming","greedy","heap-priority-queue"]}
|
||
{"id":1420,"frontendId":1285,"title":"Find the Start and End Number of Continuous Ranges","titleSlug":"find-the-start-and-end-number-of-continuous-ranges","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1421,"frontendId":1295,"title":"Find Numbers with Even Number of Digits","titleSlug":"find-numbers-with-even-number-of-digits","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
|
||
{"id":1422,"frontendId":1296,"title":"Divide Array in Sets of K Consecutive Numbers","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","sorting"]}
|
||
{"id":1423,"frontendId":1297,"title":"Maximum Number of Occurrences of a Substring","titleSlug":"maximum-number-of-occurrences-of-a-substring","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":1424,"frontendId":1298,"title":"Maximum Candies You Can Get from Boxes","titleSlug":"maximum-candies-you-can-get-from-boxes","difficulty":"HARD","paidOnly":false,"tags":["array","breadth-first-search","graph"]}
|
||
{"id":1425,"frontendId":1294,"title":"Weather Type in Each Country","titleSlug":"weather-type-in-each-country","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1426,"frontendId":1304,"title":"Find N Unique Integers Sum up to Zero","titleSlug":"find-n-unique-integers-sum-up-to-zero","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
|
||
{"id":1427,"frontendId":1305,"title":"All Elements in Two Binary Search Trees","titleSlug":"all-elements-in-two-binary-search-trees","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-search-tree","sorting","binary-tree"]}
|
||
{"id":1428,"frontendId":1306,"title":"Jump Game III","titleSlug":"jump-game-iii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search"]}
|
||
{"id":1429,"frontendId":1307,"title":"Verbal Arithmetic Puzzle","titleSlug":"verbal-arithmetic-puzzle","difficulty":"HARD","paidOnly":false,"tags":["array","math","string","backtracking"]}
|
||
{"id":1430,"frontendId":2269,"title":"Find the K-Beauty of a Number","titleSlug":"find-the-k-beauty-of-a-number","difficulty":"EASY","paidOnly":false,"tags":["math","string","sliding-window"]}
|
||
{"id":1431,"frontendId":2192,"title":"All Ancestors of a Node in a Directed Acyclic Graph","titleSlug":"all-ancestors-of-a-node-in-a-directed-acyclic-graph","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","graph","topological-sort"]}
|
||
{"id":1432,"frontendId":1430,"title":"Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":1433,"frontendId":2227,"title":"Encrypt and Decrypt Strings","titleSlug":"encrypt-and-decrypt-strings","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","string","design","trie"]}
|
||
{"id":1434,"frontendId":1309,"title":"Decrypt String from Alphabet to Integer Mapping","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":1435,"frontendId":1310,"title":"XOR Queries of a Subarray","titleSlug":"xor-queries-of-a-subarray","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation","prefix-sum"]}
|
||
{"id":1436,"frontendId":1311,"title":"Get Watched Videos by Your Friends","titleSlug":"get-watched-videos-by-your-friends","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","breadth-first-search","graph","sorting"]}
|
||
{"id":1437,"frontendId":1312,"title":"Minimum Insertion Steps to Make a String Palindrome","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":1438,"frontendId":1303,"title":"Find the Team Size","titleSlug":"find-the-team-size","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1439,"frontendId":1308,"title":"Running Total for Different Genders","titleSlug":"running-total-for-different-genders","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1440,"frontendId":1317,"title":"Convert Integer to the Sum of Two No-Zero Integers","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":1441,"frontendId":1318,"title":"Minimum Flips to Make a OR b Equal to c","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c","difficulty":"MEDIUM","paidOnly":false,"tags":["bit-manipulation"]}
|
||
{"id":1442,"frontendId":1319,"title":"Number of Operations to Make Network Connected","titleSlug":"number-of-operations-to-make-network-connected","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":1443,"frontendId":1320,"title":"Minimum Distance to Type a Word Using Two Fingers","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":1444,"frontendId":1342,"title":"Number of Steps to Reduce a Number to Zero","titleSlug":"number-of-steps-to-reduce-a-number-to-zero","difficulty":"EASY","paidOnly":false,"tags":["math","bit-manipulation"]}
|
||
{"id":1445,"frontendId":1343,"title":"Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sliding-window"]}
|
||
{"id":1446,"frontendId":1344,"title":"Angle Between Hands of a Clock","titleSlug":"angle-between-hands-of-a-clock","difficulty":"MEDIUM","paidOnly":false,"tags":["math"]}
|
||
{"id":1447,"frontendId":1345,"title":"Jump Game IV","titleSlug":"jump-game-iv","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","breadth-first-search"]}
|
||
{"id":1448,"frontendId":1323,"title":"Maximum 69 Number","titleSlug":"maximum-69-number","difficulty":"EASY","paidOnly":false,"tags":["math","greedy"]}
|
||
{"id":1449,"frontendId":1324,"title":"Print Words Vertically","titleSlug":"print-words-vertically","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","simulation"]}
|
||
{"id":1450,"frontendId":1325,"title":"Delete Leaves With a Given Value","titleSlug":"delete-leaves-with-a-given-value","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":1451,"frontendId":1326,"title":"Minimum Number of Taps to Open to Water a Garden","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","greedy"]}
|
||
{"id":1452,"frontendId":1321,"title":"Restaurant Growth","titleSlug":"restaurant-growth","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":1453,"frontendId":1322,"title":"Ads Performance","titleSlug":"ads-performance","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1454,"frontendId":1332,"title":"Remove Palindromic Subsequences","titleSlug":"remove-palindromic-subsequences","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":1455,"frontendId":1333,"title":"Filter Restaurants by Vegan-Friendly, Price and Distance","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":1456,"frontendId":1334,"title":"Find the City With the Smallest Number of Neighbors at a Threshold Distance","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming","graph","shortest-path"]}
|
||
{"id":1457,"frontendId":1335,"title":"Minimum Difficulty of a Job Schedule","titleSlug":"minimum-difficulty-of-a-job-schedule","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":1458,"frontendId":1356,"title":"Sort Integers by The Number of 1 Bits","titleSlug":"sort-integers-by-the-number-of-1-bits","difficulty":"EASY","paidOnly":false,"tags":["array","bit-manipulation","sorting","counting"]}
|
||
{"id":1459,"frontendId":1357,"title":"Apply Discount Every n Orders","titleSlug":"apply-discount-every-n-orders","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","design"]}
|
||
{"id":1460,"frontendId":1358,"title":"Number of Substrings Containing All Three Characters","titleSlug":"number-of-substrings-containing-all-three-characters","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":1461,"frontendId":1359,"title":"Count All Valid Pickup and Delivery Options","titleSlug":"count-all-valid-pickup-and-delivery-options","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming","combinatorics"]}
|
||
{"id":1462,"frontendId":1327,"title":"List the Products Ordered in a Period","titleSlug":"list-the-products-ordered-in-a-period","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1463,"frontendId":1337,"title":"The K Weakest Rows in a Matrix","titleSlug":"the-k-weakest-rows-in-a-matrix","difficulty":"EASY","paidOnly":false,"tags":["array","binary-search","sorting","heap-priority-queue","matrix"]}
|
||
{"id":1464,"frontendId":1338,"title":"Reduce Array Size to The Half","titleSlug":"reduce-array-size-to-the-half","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","sorting","heap-priority-queue"]}
|
||
{"id":1465,"frontendId":1339,"title":"Maximum Product of Splitted Binary Tree","titleSlug":"maximum-product-of-splitted-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":1466,"frontendId":1340,"title":"Jump Game V","titleSlug":"jump-game-v","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","sorting"]}
|
||
{"id":1467,"frontendId":1336,"title":"Number of Transactions per Visit","titleSlug":"number-of-transactions-per-visit","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":1468,"frontendId":1346,"title":"Check If N and Its Double Exist","titleSlug":"check-if-n-and-its-double-exist","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","two-pointers","binary-search","sorting"]}
|
||
{"id":1469,"frontendId":1347,"title":"Minimum Number of Steps to Make Two Strings Anagram","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":1470,"frontendId":1348,"title":"Tweet Counts Per Frequency","titleSlug":"tweet-counts-per-frequency","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","binary-search","design","sorting","ordered-set"]}
|
||
{"id":1471,"frontendId":1349,"title":"Maximum Students Taking Exam","titleSlug":"maximum-students-taking-exam","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","matrix","bitmask"]}
|
||
{"id":1472,"frontendId":1370,"title":"Increasing Decreasing String","titleSlug":"increasing-decreasing-string","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":1473,"frontendId":1371,"title":"Find the Longest Substring Containing Vowels in Even Counts","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","bit-manipulation","prefix-sum"]}
|
||
{"id":1474,"frontendId":1372,"title":"Longest ZigZag Path in a Binary Tree","titleSlug":"longest-zigzag-path-in-a-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming","tree","depth-first-search","binary-tree"]}
|
||
{"id":1475,"frontendId":1373,"title":"Maximum Sum BST in Binary Tree","titleSlug":"maximum-sum-bst-in-binary-tree","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":1476,"frontendId":1351,"title":"Count Negative Numbers in a Sorted Matrix","titleSlug":"count-negative-numbers-in-a-sorted-matrix","difficulty":"EASY","paidOnly":false,"tags":["array","binary-search","matrix"]}
|
||
{"id":1477,"frontendId":1352,"title":"Product of the Last K Numbers","titleSlug":"product-of-the-last-k-numbers","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","design","data-stream","prefix-sum"]}
|
||
{"id":1478,"frontendId":1353,"title":"Maximum Number of Events That Can Be Attended","titleSlug":"maximum-number-of-events-that-can-be-attended","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting","heap-priority-queue"]}
|
||
{"id":1479,"frontendId":1354,"title":"Construct Target Array With Multiple Sums","titleSlug":"construct-target-array-with-multiple-sums","difficulty":"HARD","paidOnly":false,"tags":["array","heap-priority-queue"]}
|
||
{"id":1480,"frontendId":1341,"title":"Movie Rating","titleSlug":"movie-rating","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":1481,"frontendId":1350,"title":"Students With Invalid Departments","titleSlug":"students-with-invalid-departments","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1482,"frontendId":1365,"title":"How Many Numbers Are Smaller Than the Current Number","titleSlug":"how-many-numbers-are-smaller-than-the-current-number","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sorting","counting-sort"]}
|
||
{"id":1483,"frontendId":1366,"title":"Rank Teams by Votes","titleSlug":"rank-teams-by-votes","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","sorting","counting"]}
|
||
{"id":1484,"frontendId":1367,"title":"Linked List in Binary Tree","titleSlug":"linked-list-in-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","tree","depth-first-search","binary-tree"]}
|
||
{"id":1485,"frontendId":1368,"title":"Minimum Cost to Make at Least One Valid Path in a Grid","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid","difficulty":"HARD","paidOnly":false,"tags":["array","breadth-first-search","graph","heap-priority-queue","matrix","shortest-path"]}
|
||
{"id":1486,"frontendId":1385,"title":"Find the Distance Value Between Two Arrays","titleSlug":"find-the-distance-value-between-two-arrays","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","binary-search","sorting"]}
|
||
{"id":1487,"frontendId":1386,"title":"Cinema Seat Allocation","titleSlug":"cinema-seat-allocation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","bit-manipulation"]}
|
||
{"id":1488,"frontendId":1387,"title":"Sort Integers by The Power Value","titleSlug":"sort-integers-by-the-power-value","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming","memoization","sorting"]}
|
||
{"id":1489,"frontendId":1388,"title":"Pizza With 3n Slices","titleSlug":"pizza-with-3n-slices","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","greedy","heap-priority-queue"]}
|
||
{"id":1490,"frontendId":1374,"title":"Generate a String With Characters That Have Odd Counts","titleSlug":"generate-a-string-with-characters-that-have-odd-counts","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":1491,"frontendId":1375,"title":"Number of Times Binary String Is Prefix-Aligned","titleSlug":"number-of-times-binary-string-is-prefix-aligned","difficulty":"MEDIUM","paidOnly":false,"tags":["array"]}
|
||
{"id":1492,"frontendId":1376,"title":"Time Needed to Inform All Employees","titleSlug":"time-needed-to-inform-all-employees","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search"]}
|
||
{"id":1493,"frontendId":1377,"title":"Frog Position After T Seconds","titleSlug":"frog-position-after-t-seconds","difficulty":"HARD","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","graph"]}
|
||
{"id":1494,"frontendId":1355,"title":"Activity Participants","titleSlug":"activity-participants","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1495,"frontendId":1364,"title":"Number of Trusted Contacts of a Customer","titleSlug":"number-of-trusted-contacts-of-a-customer","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1496,"frontendId":1380,"title":"Lucky Numbers in a Matrix","titleSlug":"lucky-numbers-in-a-matrix","difficulty":"EASY","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":1497,"frontendId":1381,"title":"Design a Stack With Increment Operation","titleSlug":"design-a-stack-with-increment-operation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","design"]}
|
||
{"id":1498,"frontendId":1379,"title":"Find a Corresponding Node of a Binary Tree in a Clone of That Tree","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":1499,"frontendId":1383,"title":"Maximum Performance of a Team","titleSlug":"maximum-performance-of-a-team","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","sorting","heap-priority-queue"]}
|
||
{"id":1500,"frontendId":1399,"title":"Count Largest Group","titleSlug":"count-largest-group","difficulty":"EASY","paidOnly":false,"tags":["hash-table","math","counting"]}
|
||
{"id":1501,"frontendId":1401,"title":"Circle and Rectangle Overlapping","titleSlug":"circle-and-rectangle-overlapping","difficulty":"MEDIUM","paidOnly":false,"tags":["math","geometry"]}
|
||
{"id":1502,"frontendId":1400,"title":"Construct K Palindrome Strings","titleSlug":"construct-k-palindrome-strings","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","greedy","counting"]}
|
||
{"id":1503,"frontendId":1402,"title":"Reducing Dishes","titleSlug":"reducing-dishes","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","greedy","sorting"]}
|
||
{"id":1504,"frontendId":1369,"title":"Get the Second Most Recent Activity","titleSlug":"get-the-second-most-recent-activity","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":1505,"frontendId":1389,"title":"Create Target Array in the Given Order","titleSlug":"create-target-array-in-the-given-order","difficulty":"EASY","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":1507,"frontendId":1391,"title":"Check if There is a Valid Path in a Grid","titleSlug":"check-if-there-is-a-valid-path-in-a-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","union-find","matrix"]}
|
||
{"id":1508,"frontendId":1392,"title":"Longest Happy Prefix","titleSlug":"longest-happy-prefix","difficulty":"HARD","paidOnly":false,"tags":["string","rolling-hash","string-matching","hash-function"]}
|
||
{"id":1509,"frontendId":1378,"title":"Replace Employee ID With The Unique Identifier","titleSlug":"replace-employee-id-with-the-unique-identifier","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1510,"frontendId":1394,"title":"Find Lucky Integer in an Array","titleSlug":"find-lucky-integer-in-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":1511,"frontendId":1395,"title":"Count Number of Teams","titleSlug":"count-number-of-teams","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","binary-indexed-tree","segment-tree"]}
|
||
{"id":1512,"frontendId":1396,"title":"Design Underground System","titleSlug":"design-underground-system","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","design"]}
|
||
{"id":1513,"frontendId":1397,"title":"Find All Good Strings","titleSlug":"find-all-good-strings","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming","string-matching"]}
|
||
{"id":1514,"frontendId":1413,"title":"Minimum Value to Get Positive Step by Step Sum","titleSlug":"minimum-value-to-get-positive-step-by-step-sum","difficulty":"EASY","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":1515,"frontendId":1414,"title":"Find the Minimum Number of Fibonacci Numbers Whose Sum Is K","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k","difficulty":"MEDIUM","paidOnly":false,"tags":["math","greedy"]}
|
||
{"id":1516,"frontendId":1415,"title":"The k-th Lexicographical String of All Happy Strings of Length n","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n","difficulty":"MEDIUM","paidOnly":false,"tags":["string","backtracking"]}
|
||
{"id":1517,"frontendId":1416,"title":"Restore The Array","titleSlug":"restore-the-array","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":1518,"frontendId":1384,"title":"Total Sales Amount by Year","titleSlug":"total-sales-amount-by-year","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":1519,"frontendId":1403,"title":"Minimum Subsequence in Non-Increasing Order","titleSlug":"minimum-subsequence-in-non-increasing-order","difficulty":"EASY","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":1520,"frontendId":1404,"title":"Number of Steps to Reduce a Number in Binary Representation to One","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one","difficulty":"MEDIUM","paidOnly":false,"tags":["string","bit-manipulation","simulation"]}
|
||
{"id":1522,"frontendId":1406,"title":"Stone Game III","titleSlug":"stone-game-iii","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","game-theory"]}
|
||
{"id":1523,"frontendId":1393,"title":"Capital Gain/Loss","titleSlug":"capital-gainloss","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":1524,"frontendId":1408,"title":"String Matching in an Array","titleSlug":"string-matching-in-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","string","string-matching"]}
|
||
{"id":1525,"frontendId":1409,"title":"Queries on a Permutation With Key","titleSlug":"queries-on-a-permutation-with-key","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-indexed-tree","simulation"]}
|
||
{"id":1526,"frontendId":1410,"title":"HTML Entity Parser","titleSlug":"html-entity-parser","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":1527,"frontendId":1411,"title":"Number of Ways to Paint N × 3 Grid","titleSlug":"number-of-ways-to-paint-n-3-grid","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":1528,"frontendId":1431,"title":"Kids With the Greatest Number of Candies","titleSlug":"kids-with-the-greatest-number-of-candies","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":1529,"frontendId":1432,"title":"Max Difference You Can Get From Changing an Integer","titleSlug":"max-difference-you-can-get-from-changing-an-integer","difficulty":"MEDIUM","paidOnly":false,"tags":["math","greedy"]}
|
||
{"id":1530,"frontendId":1433,"title":"Check If a String Can Break Another String","titleSlug":"check-if-a-string-can-break-another-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy","sorting"]}
|
||
{"id":1531,"frontendId":1434,"title":"Number of Ways to Wear Different Hats to Each Other","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","bitmask"]}
|
||
{"id":1532,"frontendId":1417,"title":"Reformat The String","titleSlug":"reformat-the-string","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":1533,"frontendId":1418,"title":"Display Table of Food Orders in a Restaurant","titleSlug":"display-table-of-food-orders-in-a-restaurant","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","sorting","ordered-set"]}
|
||
{"id":1534,"frontendId":1419,"title":"Minimum Number of Frogs Croaking","titleSlug":"minimum-number-of-frogs-croaking","difficulty":"MEDIUM","paidOnly":false,"tags":["string","counting"]}
|
||
{"id":1535,"frontendId":1420,"title":"Build Array Where You Can Find The Maximum Exactly K Comparisons","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","prefix-sum"]}
|
||
{"id":1536,"frontendId":1398,"title":"Customers Who Bought Products A and B but Not C","titleSlug":"customers-who-bought-products-a-and-b-but-not-c","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1537,"frontendId":1422,"title":"Maximum Score After Splitting a String","titleSlug":"maximum-score-after-splitting-a-string","difficulty":"EASY","paidOnly":false,"tags":["string","prefix-sum"]}
|
||
{"id":1538,"frontendId":1423,"title":"Maximum Points You Can Obtain from Cards","titleSlug":"maximum-points-you-can-obtain-from-cards","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sliding-window","prefix-sum"]}
|
||
{"id":1539,"frontendId":1424,"title":"Diagonal Traverse II","titleSlug":"diagonal-traverse-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting","heap-priority-queue"]}
|
||
{"id":1541,"frontendId":1407,"title":"Top Travellers","titleSlug":"top-travellers","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1542,"frontendId":1446,"title":"Consecutive Characters","titleSlug":"consecutive-characters","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":1543,"frontendId":1447,"title":"Simplified Fractions","titleSlug":"simplified-fractions","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string","number-theory"]}
|
||
{"id":1544,"frontendId":1448,"title":"Count Good Nodes in Binary Tree","titleSlug":"count-good-nodes-in-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":1545,"frontendId":1449,"title":"Form Largest Integer With Digits That Add up to Target","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":1546,"frontendId":1412,"title":"Find the Quiet Students in All Exams","titleSlug":"find-the-quiet-students-in-all-exams","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":1547,"frontendId":1436,"title":"Destination City","titleSlug":"destination-city","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":1548,"frontendId":1437,"title":"Check If All 1's Are at Least Length K Places Away","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":1549,"frontendId":1438,"title":"Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit","difficulty":"MEDIUM","paidOnly":false,"tags":["array","queue","sliding-window","heap-priority-queue","ordered-set","monotonic-queue"]}
|
||
{"id":1550,"frontendId":1439,"title":"Find the Kth Smallest Sum of a Matrix With Sorted Rows","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","heap-priority-queue","matrix"]}
|
||
{"id":1551,"frontendId":1421,"title":"NPV Queries","titleSlug":"npv-queries","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1552,"frontendId":1441,"title":"Build an Array With Stack Operations","titleSlug":"build-an-array-with-stack-operations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","simulation"]}
|
||
{"id":1553,"frontendId":1442,"title":"Count Triplets That Can Form Two Arrays of Equal XOR","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","bit-manipulation","prefix-sum"]}
|
||
{"id":1554,"frontendId":1443,"title":"Minimum Time to Collect All Apples in a Tree","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","tree","depth-first-search","breadth-first-search"]}
|
||
{"id":1555,"frontendId":1444,"title":"Number of Ways of Cutting a Pizza","titleSlug":"number-of-ways-of-cutting-a-pizza","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","memoization","matrix","prefix-sum"]}
|
||
{"id":1556,"frontendId":1460,"title":"Make Two Arrays Equal by Reversing Subarrays","titleSlug":"make-two-arrays-equal-by-reversing-subarrays","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sorting"]}
|
||
{"id":1557,"frontendId":1461,"title":"Check If a String Contains All Binary Codes of Size K","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","bit-manipulation","rolling-hash","hash-function"]}
|
||
{"id":1558,"frontendId":1462,"title":"Course Schedule IV","titleSlug":"course-schedule-iv","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","graph","topological-sort"]}
|
||
{"id":1559,"frontendId":1463,"title":"Cherry Pickup II","titleSlug":"cherry-pickup-ii","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":1560,"frontendId":1450,"title":"Number of Students Doing Homework at a Given Time","titleSlug":"number-of-students-doing-homework-at-a-given-time","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":1561,"frontendId":1451,"title":"Rearrange Words in a Sentence","titleSlug":"rearrange-words-in-a-sentence","difficulty":"MEDIUM","paidOnly":false,"tags":["string","sorting"]}
|
||
{"id":1562,"frontendId":1452,"title":"People Whose List of Favorite Companies Is Not a Subset of Another List","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":1563,"frontendId":1453,"title":"Maximum Number of Darts Inside of a Circular Dartboard","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard","difficulty":"HARD","paidOnly":false,"tags":["array","math","geometry"]}
|
||
{"id":1564,"frontendId":1435,"title":"Create a Session Bar Chart","titleSlug":"create-a-session-bar-chart","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1565,"frontendId":1440,"title":"Evaluate Boolean Expression","titleSlug":"evaluate-boolean-expression","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1566,"frontendId":1455,"title":"Check If a Word Occurs As a Prefix of Any Word in a Sentence","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string","string-matching"]}
|
||
{"id":1567,"frontendId":1456,"title":"Maximum Number of Vowels in a Substring of Given Length","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length","difficulty":"MEDIUM","paidOnly":false,"tags":["string","sliding-window"]}
|
||
{"id":1568,"frontendId":1457,"title":"Pseudo-Palindromic Paths in a Binary Tree","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["bit-manipulation","tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":1569,"frontendId":1458,"title":"Max Dot Product of Two Subsequences","titleSlug":"max-dot-product-of-two-subsequences","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":1570,"frontendId":1475,"title":"Final Prices With a Special Discount in a Shop","titleSlug":"final-prices-with-a-special-discount-in-a-shop","difficulty":"EASY","paidOnly":false,"tags":["array","stack","monotonic-stack"]}
|
||
{"id":1571,"frontendId":1478,"title":"Allocate Mailboxes","titleSlug":"allocate-mailboxes","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","sorting"]}
|
||
{"id":1572,"frontendId":1476,"title":"Subrectangle Queries","titleSlug":"subrectangle-queries","difficulty":"MEDIUM","paidOnly":false,"tags":["array","design","matrix"]}
|
||
{"id":1573,"frontendId":1477,"title":"Find Two Non-overlapping Sub-arrays Each With Target Sum","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","binary-search","dynamic-programming","sliding-window"]}
|
||
{"id":1574,"frontendId":1464,"title":"Maximum Product of Two Elements in an Array","titleSlug":"maximum-product-of-two-elements-in-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","sorting","heap-priority-queue"]}
|
||
{"id":1575,"frontendId":1465,"title":"Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":1576,"frontendId":1466,"title":"Reorder Routes to Make All Paths Lead to the City Zero","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","graph"]}
|
||
{"id":1577,"frontendId":1467,"title":"Probability of a Two Boxes Having The Same Number of Distinct Balls","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","backtracking","combinatorics","probability-and-statistics"]}
|
||
{"id":1578,"frontendId":1445,"title":"Apples & Oranges","titleSlug":"apples-oranges","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1579,"frontendId":1454,"title":"Active Users","titleSlug":"active-users","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1580,"frontendId":1470,"title":"Shuffle the Array","titleSlug":"shuffle-the-array","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":1581,"frontendId":1471,"title":"The k Strongest Values in an Array","titleSlug":"the-k-strongest-values-in-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","sorting"]}
|
||
{"id":1582,"frontendId":1472,"title":"Design Browser History","titleSlug":"design-browser-history","difficulty":"MEDIUM","paidOnly":false,"tags":["array","linked-list","stack","design","doubly-linked-list","data-stream"]}
|
||
{"id":1583,"frontendId":1473,"title":"Paint House III","titleSlug":"paint-house-iii","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":1584,"frontendId":1491,"title":"Average Salary Excluding the Minimum and Maximum Salary","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary","difficulty":"EASY","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":1585,"frontendId":1492,"title":"The kth Factor of n","titleSlug":"the-kth-factor-of-n","difficulty":"MEDIUM","paidOnly":false,"tags":["math","number-theory"]}
|
||
{"id":1586,"frontendId":1493,"title":"Longest Subarray of 1's After Deleting One Element","titleSlug":"longest-subarray-of-1s-after-deleting-one-element","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","sliding-window"]}
|
||
{"id":1587,"frontendId":1494,"title":"Parallel Courses II","titleSlug":"parallel-courses-ii","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","bit-manipulation","graph","bitmask"]}
|
||
{"id":1603,"frontendId":1480,"title":"Running Sum of 1d Array","titleSlug":"running-sum-of-1d-array","difficulty":"EASY","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":1604,"frontendId":1481,"title":"Least Number of Unique Integers after K Removals","titleSlug":"least-number-of-unique-integers-after-k-removals","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","sorting","counting"]}
|
||
{"id":1605,"frontendId":1482,"title":"Minimum Number of Days to Make m Bouquets","titleSlug":"minimum-number-of-days-to-make-m-bouquets","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":1607,"frontendId":1459,"title":"Rectangles Area","titleSlug":"rectangles-area","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1608,"frontendId":1468,"title":"Calculate Salaries","titleSlug":"calculate-salaries","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1609,"frontendId":1469,"title":"Find All The Lonely Nodes","titleSlug":"find-all-the-lonely-nodes","difficulty":"EASY","paidOnly":true,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":1610,"frontendId":1486,"title":"XOR Operation in an Array","titleSlug":"xor-operation-in-an-array","difficulty":"EASY","paidOnly":false,"tags":["math","bit-manipulation"]}
|
||
{"id":1611,"frontendId":1487,"title":"Making File Names Unique","titleSlug":"making-file-names-unique","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":1612,"frontendId":1488,"title":"Avoid Flood in The City","titleSlug":"avoid-flood-in-the-city","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","binary-search","greedy","heap-priority-queue"]}
|
||
{"id":1613,"frontendId":1489,"title":"Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree","difficulty":"HARD","paidOnly":false,"tags":["union-find","graph","sorting","minimum-spanning-tree","strongly-connected-component"]}
|
||
{"id":1615,"frontendId":1508,"title":"Range Sum of Sorted Subarray Sums","titleSlug":"range-sum-of-sorted-subarray-sums","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","sorting","prefix-sum"]}
|
||
{"id":1616,"frontendId":1509,"title":"Minimum Difference Between Largest and Smallest Value in Three Moves","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":1617,"frontendId":1510,"title":"Stone Game IV","titleSlug":"stone-game-iv","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming","game-theory"]}
|
||
{"id":1618,"frontendId":1474,"title":"Delete N Nodes After M Nodes of a Linked List","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list","difficulty":"EASY","paidOnly":true,"tags":["linked-list"]}
|
||
{"id":1619,"frontendId":1496,"title":"Path Crossing","titleSlug":"path-crossing","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":1620,"frontendId":1497,"title":"Check If Array Pairs Are Divisible by k","titleSlug":"check-if-array-pairs-are-divisible-by-k","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":1621,"frontendId":1498,"title":"Number of Subsequences That Satisfy the Given Sum Condition","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","sorting"]}
|
||
{"id":1622,"frontendId":1499,"title":"Max Value of Equation","titleSlug":"max-value-of-equation","difficulty":"HARD","paidOnly":false,"tags":["array","queue","sliding-window","heap-priority-queue","monotonic-queue"]}
|
||
{"id":1623,"frontendId":1479,"title":"Sales by Day of the Week","titleSlug":"sales-by-day-of-the-week","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":1624,"frontendId":1485,"title":"Clone Binary Tree With Random Pointer","titleSlug":"clone-binary-tree-with-random-pointer","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":1625,"frontendId":1484,"title":"Group Sold Products By The Date","titleSlug":"group-sold-products-by-the-date","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1626,"frontendId":1502,"title":"Can Make Arithmetic Progression From Sequence","titleSlug":"can-make-arithmetic-progression-from-sequence","difficulty":"EASY","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":1627,"frontendId":1503,"title":"Last Moment Before All Ants Fall Out of a Plank","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank","difficulty":"MEDIUM","paidOnly":false,"tags":["array","brainteaser","simulation"]}
|
||
{"id":1628,"frontendId":1504,"title":"Count Submatrices With All Ones","titleSlug":"count-submatrices-with-all-ones","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","stack","matrix","monotonic-stack"]}
|
||
{"id":1629,"frontendId":1505,"title":"Minimum Possible Integer After at Most K Adjacent Swaps On Digits","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits","difficulty":"HARD","paidOnly":false,"tags":["string","greedy","binary-indexed-tree","segment-tree"]}
|
||
{"id":1630,"frontendId":1523,"title":"Count Odd Numbers in an Interval Range","titleSlug":"count-odd-numbers-in-an-interval-range","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":1631,"frontendId":1524,"title":"Number of Sub-arrays With Odd Sum","titleSlug":"number-of-sub-arrays-with-odd-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","dynamic-programming","prefix-sum"]}
|
||
{"id":1632,"frontendId":1525,"title":"Number of Good Ways to Split a String","titleSlug":"number-of-good-ways-to-split-a-string","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","dynamic-programming","bit-manipulation"]}
|
||
{"id":1633,"frontendId":1526,"title":"Minimum Number of Increments on Subarrays to Form a Target Array","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","stack","greedy","monotonic-stack"]}
|
||
{"id":1634,"frontendId":1490,"title":"Clone N-ary Tree","titleSlug":"clone-n-ary-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","tree","depth-first-search","breadth-first-search"]}
|
||
{"id":1635,"frontendId":1512,"title":"Number of Good Pairs","titleSlug":"number-of-good-pairs","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","math","counting"]}
|
||
{"id":1636,"frontendId":1513,"title":"Number of Substrings With Only 1s","titleSlug":"number-of-substrings-with-only-1s","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string"]}
|
||
{"id":1637,"frontendId":1531,"title":"String Compression II","titleSlug":"string-compression-ii","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":1638,"frontendId":1515,"title":"Best Position for a Service Centre","titleSlug":"best-position-for-a-service-centre","difficulty":"HARD","paidOnly":false,"tags":["array","math","geometry","randomized"]}
|
||
{"id":1639,"frontendId":1495,"title":"Friendly Movies Streamed Last Month","titleSlug":"friendly-movies-streamed-last-month","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1640,"frontendId":1500,"title":"Design a File Sharing System","titleSlug":"design-a-file-sharing-system","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","design","sorting","heap-priority-queue","data-stream"]}
|
||
{"id":1641,"frontendId":1501,"title":"Countries You Can Safely Invest In","titleSlug":"countries-you-can-safely-invest-in","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1642,"frontendId":1518,"title":"Water Bottles","titleSlug":"water-bottles","difficulty":"EASY","paidOnly":false,"tags":["math","simulation"]}
|
||
{"id":1643,"frontendId":1519,"title":"Number of Nodes in the Sub-Tree With the Same Label","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","tree","depth-first-search","breadth-first-search","counting"]}
|
||
{"id":1644,"frontendId":1520,"title":"Maximum Number of Non-Overlapping Substrings","titleSlug":"maximum-number-of-non-overlapping-substrings","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","greedy","sorting"]}
|
||
{"id":1645,"frontendId":1521,"title":"Find a Value of a Mysterious Function Closest to Target","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","bit-manipulation","segment-tree"]}
|
||
{"id":1646,"frontendId":1539,"title":"Kth Missing Positive Number","titleSlug":"kth-missing-positive-number","difficulty":"EASY","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":1647,"frontendId":1540,"title":"Can Convert String in K Moves","titleSlug":"can-convert-string-in-k-moves","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":1648,"frontendId":1541,"title":"Minimum Insertions to Balance a Parentheses String","titleSlug":"minimum-insertions-to-balance-a-parentheses-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","greedy"]}
|
||
{"id":1649,"frontendId":1546,"title":"Maximum Number of Non-Overlapping Subarrays With Sum Equals Target","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","prefix-sum"]}
|
||
{"id":1650,"frontendId":1506,"title":"Find Root of N-Ary Tree","titleSlug":"find-root-of-n-ary-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","bit-manipulation","tree","depth-first-search"]}
|
||
{"id":1651,"frontendId":1528,"title":"Shuffle String","titleSlug":"shuffle-string","difficulty":"EASY","paidOnly":false,"tags":["array","string"]}
|
||
{"id":1652,"frontendId":1529,"title":"Minimum Suffix Flips","titleSlug":"minimum-suffix-flips","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":1653,"frontendId":1530,"title":"Number of Good Leaf Nodes Pairs","titleSlug":"number-of-good-leaf-nodes-pairs","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":1654,"frontendId":1511,"title":"Customer Order Frequency","titleSlug":"customer-order-frequency","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1655,"frontendId":1516,"title":"Move Sub-Tree of N-Ary Tree","titleSlug":"move-sub-tree-of-n-ary-tree","difficulty":"HARD","paidOnly":true,"tags":["tree","depth-first-search"]}
|
||
{"id":1656,"frontendId":1534,"title":"Count Good Triplets","titleSlug":"count-good-triplets","difficulty":"EASY","paidOnly":false,"tags":["array","enumeration"]}
|
||
{"id":1657,"frontendId":1535,"title":"Find the Winner of an Array Game","titleSlug":"find-the-winner-of-an-array-game","difficulty":"MEDIUM","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":1658,"frontendId":1536,"title":"Minimum Swaps to Arrange a Binary Grid","titleSlug":"minimum-swaps-to-arrange-a-binary-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","matrix"]}
|
||
{"id":1659,"frontendId":1537,"title":"Get the Maximum Score","titleSlug":"get-the-maximum-score","difficulty":"HARD","paidOnly":false,"tags":["array","two-pointers","dynamic-programming","greedy"]}
|
||
{"id":1660,"frontendId":1556,"title":"Thousand Separator","titleSlug":"thousand-separator","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":1661,"frontendId":1557,"title":"Minimum Number of Vertices to Reach All Nodes","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes","difficulty":"MEDIUM","paidOnly":false,"tags":["graph"]}
|
||
{"id":1662,"frontendId":1558,"title":"Minimum Numbers of Function Calls to Make Target Array","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","bit-manipulation"]}
|
||
{"id":1663,"frontendId":1559,"title":"Detect Cycles in 2D Grid","titleSlug":"detect-cycles-in-2d-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","union-find","matrix"]}
|
||
{"id":1664,"frontendId":1517,"title":"Find Users With Valid E-Mails","titleSlug":"find-users-with-valid-e-mails","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1665,"frontendId":1522,"title":"Diameter of N-Ary Tree","titleSlug":"diameter-of-n-ary-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search"]}
|
||
{"id":1666,"frontendId":1544,"title":"Make The String Great","titleSlug":"make-the-string-great","difficulty":"EASY","paidOnly":false,"tags":["string","stack"]}
|
||
{"id":1667,"frontendId":1545,"title":"Find Kth Bit in Nth Binary String","titleSlug":"find-kth-bit-in-nth-binary-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","recursion","simulation"]}
|
||
{"id":1668,"frontendId":1542,"title":"Find Longest Awesome Substring","titleSlug":"find-longest-awesome-substring","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","bit-manipulation"]}
|
||
{"id":1669,"frontendId":1547,"title":"Minimum Cost to Cut a Stick","titleSlug":"minimum-cost-to-cut-a-stick","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","sorting"]}
|
||
{"id":1670,"frontendId":1527,"title":"Patients With a Condition","titleSlug":"patients-with-a-condition","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1671,"frontendId":1532,"title":"The Most Recent Three Orders","titleSlug":"the-most-recent-three-orders","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1672,"frontendId":1533,"title":"Find the Index of the Large Integer","titleSlug":"find-the-index-of-the-large-integer","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search","interactive"]}
|
||
{"id":1674,"frontendId":1551,"title":"Minimum Operations to Make Array Equal","titleSlug":"minimum-operations-to-make-array-equal","difficulty":"MEDIUM","paidOnly":false,"tags":["math"]}
|
||
{"id":1675,"frontendId":1552,"title":"Magnetic Force Between Two Balls","titleSlug":"magnetic-force-between-two-balls","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","sorting"]}
|
||
{"id":1676,"frontendId":1553,"title":"Minimum Number of Days to Eat N Oranges","titleSlug":"minimum-number-of-days-to-eat-n-oranges","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","memoization"]}
|
||
{"id":1677,"frontendId":1572,"title":"Matrix Diagonal Sum","titleSlug":"matrix-diagonal-sum","difficulty":"EASY","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":1678,"frontendId":1573,"title":"Number of Ways to Split a String","titleSlug":"number-of-ways-to-split-a-string","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string"]}
|
||
{"id":1679,"frontendId":1574,"title":"Shortest Subarray to be Removed to Make Array Sorted","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","stack","monotonic-stack"]}
|
||
{"id":1680,"frontendId":1575,"title":"Count All Possible Routes","titleSlug":"count-all-possible-routes","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","memoization"]}
|
||
{"id":1681,"frontendId":1538,"title":"Guess the Majority in a Hidden Array","titleSlug":"guess-the-majority-in-a-hidden-array","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","interactive"]}
|
||
{"id":1682,"frontendId":1560,"title":"Most Visited Sector in a Circular Track","titleSlug":"most-visited-sector-in-a-circular-track","difficulty":"EASY","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":1683,"frontendId":1561,"title":"Maximum Number of Coins You Can Get","titleSlug":"maximum-number-of-coins-you-can-get","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","greedy","sorting","game-theory"]}
|
||
{"id":1684,"frontendId":1562,"title":"Find Latest Group of Size M","titleSlug":"find-latest-group-of-size-m","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","binary-search","simulation"]}
|
||
{"id":1685,"frontendId":1563,"title":"Stone Game V","titleSlug":"stone-game-v","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","game-theory"]}
|
||
{"id":1686,"frontendId":1543,"title":"Fix Product Name Format","titleSlug":"fix-product-name-format","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1687,"frontendId":1548,"title":"The Most Similar Path in a Graph","titleSlug":"the-most-similar-path-in-a-graph","difficulty":"HARD","paidOnly":true,"tags":["dynamic-programming","graph"]}
|
||
{"id":1688,"frontendId":1549,"title":"The Most Recent Orders for Each Product","titleSlug":"the-most-recent-orders-for-each-product","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1689,"frontendId":1566,"title":"Detect Pattern of Length M Repeated K or More Times","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times","difficulty":"EASY","paidOnly":false,"tags":["array","enumeration"]}
|
||
{"id":1690,"frontendId":1567,"title":"Maximum Length of Subarray With Positive Product","titleSlug":"maximum-length-of-subarray-with-positive-product","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","greedy"]}
|
||
{"id":1691,"frontendId":1568,"title":"Minimum Number of Days to Disconnect Island","titleSlug":"minimum-number-of-days-to-disconnect-island","difficulty":"HARD","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","matrix","strongly-connected-component"]}
|
||
{"id":1692,"frontendId":1569,"title":"Number of Ways to Reorder Array to Get Same BST","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst","difficulty":"HARD","paidOnly":false,"tags":["array","math","divide-and-conquer","dynamic-programming","tree","union-find","binary-search-tree","memoization","combinatorics","binary-tree"]}
|
||
{"id":1693,"frontendId":1588,"title":"Sum of All Odd Length Subarrays","titleSlug":"sum-of-all-odd-length-subarrays","difficulty":"EASY","paidOnly":false,"tags":["array","math","prefix-sum"]}
|
||
{"id":1694,"frontendId":1590,"title":"Make Sum Divisible by P","titleSlug":"make-sum-divisible-by-p","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":1695,"frontendId":1589,"title":"Maximum Sum Obtained of Any Permutation","titleSlug":"maximum-sum-obtained-of-any-permutation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting","prefix-sum"]}
|
||
{"id":1696,"frontendId":1591,"title":"Strange Printer II","titleSlug":"strange-printer-ii","difficulty":"HARD","paidOnly":false,"tags":["array","graph","topological-sort","matrix"]}
|
||
{"id":1697,"frontendId":1554,"title":"Strings Differ by One Character","titleSlug":"strings-differ-by-one-character","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","rolling-hash","hash-function"]}
|
||
{"id":1698,"frontendId":1576,"title":"Replace All ?'s to Avoid Consecutive Repeating Characters","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":1699,"frontendId":1577,"title":"Number of Ways Where Square of Number Is Equal to Product of Two Numbers","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","two-pointers"]}
|
||
{"id":1700,"frontendId":1578,"title":"Minimum Time to Make Rope Colorful","titleSlug":"minimum-time-to-make-rope-colorful","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","dynamic-programming","greedy"]}
|
||
{"id":1701,"frontendId":1579,"title":"Remove Max Number of Edges to Keep Graph Fully Traversable","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable","difficulty":"HARD","paidOnly":false,"tags":["union-find","graph"]}
|
||
{"id":1702,"frontendId":1555,"title":"Bank Account Summary","titleSlug":"bank-account-summary","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1703,"frontendId":1564,"title":"Put Boxes Into the Warehouse I","titleSlug":"put-boxes-into-the-warehouse-i","difficulty":"MEDIUM","paidOnly":true,"tags":["array","greedy","sorting"]}
|
||
{"id":1704,"frontendId":1582,"title":"Special Positions in a Binary Matrix","titleSlug":"special-positions-in-a-binary-matrix","difficulty":"EASY","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":1705,"frontendId":1583,"title":"Count Unhappy Friends","titleSlug":"count-unhappy-friends","difficulty":"MEDIUM","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":1706,"frontendId":1584,"title":"Min Cost to Connect All Points","titleSlug":"min-cost-to-connect-all-points","difficulty":"MEDIUM","paidOnly":false,"tags":["array","union-find","graph","minimum-spanning-tree"]}
|
||
{"id":1707,"frontendId":1585,"title":"Check If String Is Transformable With Substring Sort Operations","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations","difficulty":"HARD","paidOnly":false,"tags":["string","greedy","sorting"]}
|
||
{"id":1708,"frontendId":1603,"title":"Design Parking System","titleSlug":"design-parking-system","difficulty":"EASY","paidOnly":false,"tags":["design","simulation","counting"]}
|
||
{"id":1709,"frontendId":1604,"title":"Alert Using Same Key-Card Three or More Times in a One Hour Period","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","sorting"]}
|
||
{"id":1710,"frontendId":1606,"title":"Find Servers That Handled Most Number of Requests","titleSlug":"find-servers-that-handled-most-number-of-requests","difficulty":"HARD","paidOnly":false,"tags":["array","heap-priority-queue","simulation","ordered-set"]}
|
||
{"id":1711,"frontendId":1605,"title":"Find Valid Matrix Given Row and Column Sums","titleSlug":"find-valid-matrix-given-row-and-column-sums","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","matrix"]}
|
||
{"id":1712,"frontendId":1565,"title":"Unique Orders and Customers Per Month","titleSlug":"unique-orders-and-customers-per-month","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1713,"frontendId":1570,"title":"Dot Product of Two Sparse Vectors","titleSlug":"dot-product-of-two-sparse-vectors","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","two-pointers","design"]}
|
||
{"id":1714,"frontendId":1592,"title":"Rearrange Spaces Between Words","titleSlug":"rearrange-spaces-between-words","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":1715,"frontendId":1593,"title":"Split a String Into the Max Number of Unique Substrings","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","backtracking"]}
|
||
{"id":1716,"frontendId":1594,"title":"Maximum Non Negative Product in a Matrix","titleSlug":"maximum-non-negative-product-in-a-matrix","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":1717,"frontendId":1595,"title":"Minimum Cost to Connect Two Groups of Points","titleSlug":"minimum-cost-to-connect-two-groups-of-points","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","matrix","bitmask"]}
|
||
{"id":1718,"frontendId":1571,"title":"Warehouse Manager","titleSlug":"warehouse-manager","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1719,"frontendId":1580,"title":"Put Boxes Into the Warehouse II","titleSlug":"put-boxes-into-the-warehouse-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","greedy","sorting"]}
|
||
{"id":1720,"frontendId":1598,"title":"Crawler Log Folder","titleSlug":"crawler-log-folder","difficulty":"EASY","paidOnly":false,"tags":["array","string","stack"]}
|
||
{"id":1721,"frontendId":1599,"title":"Maximum Profit of Operating a Centennial Wheel","titleSlug":"maximum-profit-of-operating-a-centennial-wheel","difficulty":"MEDIUM","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":1722,"frontendId":1600,"title":"Throne Inheritance","titleSlug":"throne-inheritance","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","tree","depth-first-search","design"]}
|
||
{"id":1723,"frontendId":1601,"title":"Maximum Number of Achievable Transfer Requests","titleSlug":"maximum-number-of-achievable-transfer-requests","difficulty":"HARD","paidOnly":false,"tags":["array","backtracking","bit-manipulation","enumeration"]}
|
||
{"id":1724,"frontendId":1581,"title":"Customer Who Visited but Did Not Make Any Transactions","titleSlug":"customer-who-visited-but-did-not-make-any-transactions","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1725,"frontendId":1621,"title":"Number of Sets of K Non-Overlapping Line Segments","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming","combinatorics","prefix-sum"]}
|
||
{"id":1726,"frontendId":1620,"title":"Coordinate With Maximum Network Quality","titleSlug":"coordinate-with-maximum-network-quality","difficulty":"MEDIUM","paidOnly":false,"tags":["array","enumeration"]}
|
||
{"id":1727,"frontendId":1728,"title":"Cat and Mouse II","titleSlug":"cat-and-mouse-ii","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","graph","topological-sort","memoization","matrix","game-theory"]}
|
||
{"id":1728,"frontendId":1622,"title":"Fancy Sequence","titleSlug":"fancy-sequence","difficulty":"HARD","paidOnly":false,"tags":["math","design","segment-tree"]}
|
||
{"id":1729,"frontendId":1586,"title":"Binary Search Tree Iterator II","titleSlug":"binary-search-tree-iterator-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["stack","tree","design","binary-search-tree","binary-tree","iterator"]}
|
||
{"id":1730,"frontendId":1608,"title":"Special Array With X Elements Greater Than or Equal X","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x","difficulty":"EASY","paidOnly":false,"tags":["array","binary-search","sorting"]}
|
||
{"id":1731,"frontendId":1609,"title":"Even Odd Tree","titleSlug":"even-odd-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","breadth-first-search","binary-tree"]}
|
||
{"id":1732,"frontendId":1611,"title":"Minimum One Bit Operations to Make Integers Zero","titleSlug":"minimum-one-bit-operations-to-make-integers-zero","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming","bit-manipulation","recursion","memoization"]}
|
||
{"id":1733,"frontendId":1610,"title":"Maximum Number of Visible Points","titleSlug":"maximum-number-of-visible-points","difficulty":"HARD","paidOnly":false,"tags":["array","math","geometry","sliding-window","sorting"]}
|
||
{"id":1734,"frontendId":1587,"title":"Bank Account Summary II","titleSlug":"bank-account-summary-ii","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1735,"frontendId":1596,"title":"The Most Frequently Ordered Products for Each Customer","titleSlug":"the-most-frequently-ordered-products-for-each-customer","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1736,"frontendId":1597,"title":"Build Binary Expression Tree From Infix Expression","titleSlug":"build-binary-expression-tree-from-infix-expression","difficulty":"HARD","paidOnly":true,"tags":["string","stack","tree","binary-tree"]}
|
||
{"id":1737,"frontendId":1614,"title":"Maximum Nesting Depth of the Parentheses","titleSlug":"maximum-nesting-depth-of-the-parentheses","difficulty":"EASY","paidOnly":false,"tags":["string","stack"]}
|
||
{"id":1738,"frontendId":1615,"title":"Maximal Network Rank","titleSlug":"maximal-network-rank","difficulty":"MEDIUM","paidOnly":false,"tags":["graph"]}
|
||
{"id":1739,"frontendId":1616,"title":"Split Two Strings to Make Palindrome","titleSlug":"split-two-strings-to-make-palindrome","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":1740,"frontendId":1617,"title":"Count Subtrees With Max Distance Between Cities","titleSlug":"count-subtrees-with-max-distance-between-cities","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","bit-manipulation","tree","enumeration","bitmask"]}
|
||
{"id":1741,"frontendId":1636,"title":"Sort Array by Increasing Frequency","titleSlug":"sort-array-by-increasing-frequency","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sorting"]}
|
||
{"id":1742,"frontendId":1637,"title":"Widest Vertical Area Between Two Points Containing No Points","titleSlug":"widest-vertical-area-between-two-points-containing-no-points","difficulty":"EASY","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":1743,"frontendId":1638,"title":"Count Substrings That Differ by One Character","titleSlug":"count-substrings-that-differ-by-one-character","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","dynamic-programming","enumeration"]}
|
||
{"id":1744,"frontendId":1639,"title":"Number of Ways to Form a Target String Given a Dictionary","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary","difficulty":"HARD","paidOnly":false,"tags":["array","string","dynamic-programming"]}
|
||
{"id":1745,"frontendId":1602,"title":"Find Nearest Right Node in Binary Tree","titleSlug":"find-nearest-right-node-in-binary-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","breadth-first-search","binary-tree"]}
|
||
{"id":1746,"frontendId":1624,"title":"Largest Substring Between Two Equal Characters","titleSlug":"largest-substring-between-two-equal-characters","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":1747,"frontendId":1625,"title":"Lexicographically Smallest String After Applying Operations","titleSlug":"lexicographically-smallest-string-after-applying-operations","difficulty":"MEDIUM","paidOnly":false,"tags":["string","depth-first-search","breadth-first-search","enumeration"]}
|
||
{"id":1748,"frontendId":1626,"title":"Best Team With No Conflicts","titleSlug":"best-team-with-no-conflicts","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","sorting"]}
|
||
{"id":1749,"frontendId":1607,"title":"Sellers With No Sales","titleSlug":"sellers-with-no-sales","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1750,"frontendId":1612,"title":"Check If Two Expression Trees are Equivalent","titleSlug":"check-if-two-expression-trees-are-equivalent","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","tree","depth-first-search","binary-tree","counting"]}
|
||
{"id":1751,"frontendId":1629,"title":"Slowest Key","titleSlug":"slowest-key","difficulty":"EASY","paidOnly":false,"tags":["array","string"]}
|
||
{"id":1752,"frontendId":1630,"title":"Arithmetic Subarrays","titleSlug":"arithmetic-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sorting"]}
|
||
{"id":1753,"frontendId":1631,"title":"Path With Minimum Effort","titleSlug":"path-with-minimum-effort","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","depth-first-search","breadth-first-search","union-find","heap-priority-queue","matrix"]}
|
||
{"id":1755,"frontendId":1652,"title":"Defuse the Bomb","titleSlug":"defuse-the-bomb","difficulty":"EASY","paidOnly":false,"tags":["array","sliding-window"]}
|
||
{"id":1756,"frontendId":1653,"title":"Minimum Deletions to Make String Balanced","titleSlug":"minimum-deletions-to-make-string-balanced","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming","stack"]}
|
||
{"id":1757,"frontendId":1654,"title":"Minimum Jumps to Reach Home","titleSlug":"minimum-jumps-to-reach-home","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","breadth-first-search"]}
|
||
{"id":1758,"frontendId":1655,"title":"Distribute Repeating Integers","titleSlug":"distribute-repeating-integers","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","dynamic-programming","backtracking","bit-manipulation","counting","bitmask"]}
|
||
{"id":1759,"frontendId":1613,"title":"Find the Missing IDs","titleSlug":"find-the-missing-ids","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1760,"frontendId":1640,"title":"Check Array Formation Through Concatenation","titleSlug":"check-array-formation-through-concatenation","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":1761,"frontendId":1641,"title":"Count Sorted Vowel Strings","titleSlug":"count-sorted-vowel-strings","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming","combinatorics"]}
|
||
{"id":1762,"frontendId":1642,"title":"Furthest Building You Can Reach","titleSlug":"furthest-building-you-can-reach","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","heap-priority-queue"]}
|
||
{"id":1763,"frontendId":1623,"title":"All Valid Triplets That Can Represent a Country","titleSlug":"all-valid-triplets-that-can-represent-a-country","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1764,"frontendId":1668,"title":"Maximum Repeating Substring","titleSlug":"maximum-repeating-substring","difficulty":"EASY","paidOnly":false,"tags":["string","dynamic-programming","string-matching"]}
|
||
{"id":1765,"frontendId":1669,"title":"Merge In Between Linked Lists","titleSlug":"merge-in-between-linked-lists","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list"]}
|
||
{"id":1766,"frontendId":1671,"title":"Minimum Number of Removals to Make Mountain Array","titleSlug":"minimum-number-of-removals-to-make-mountain-array","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","dynamic-programming","greedy"]}
|
||
{"id":1767,"frontendId":1670,"title":"Design Front Middle Back Queue","titleSlug":"design-front-middle-back-queue","difficulty":"MEDIUM","paidOnly":false,"tags":["array","linked-list","design","queue","doubly-linked-list","data-stream"]}
|
||
{"id":1768,"frontendId":1628,"title":"Design an Expression Tree With Evaluate Function","titleSlug":"design-an-expression-tree-with-evaluate-function","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","stack","tree","design","binary-tree"]}
|
||
{"id":1769,"frontendId":1646,"title":"Get Maximum in Generated Array","titleSlug":"get-maximum-in-generated-array","difficulty":"EASY","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":1770,"frontendId":1647,"title":"Minimum Deletions to Make Character Frequencies Unique","titleSlug":"minimum-deletions-to-make-character-frequencies-unique","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","greedy","sorting"]}
|
||
{"id":1771,"frontendId":1648,"title":"Sell Diminishing-Valued Colored Balls","titleSlug":"sell-diminishing-valued-colored-balls","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","binary-search","greedy","sorting","heap-priority-queue"]}
|
||
{"id":1772,"frontendId":1649,"title":"Create Sorted Array through Instructions","titleSlug":"create-sorted-array-through-instructions","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","divide-and-conquer","binary-indexed-tree","segment-tree","merge-sort","ordered-set"]}
|
||
{"id":1773,"frontendId":1633,"title":"Percentage of Users Attended a Contest","titleSlug":"percentage-of-users-attended-a-contest","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1774,"frontendId":1634,"title":"Add Two Polynomials Represented as Linked Lists","titleSlug":"add-two-polynomials-represented-as-linked-lists","difficulty":"MEDIUM","paidOnly":true,"tags":["linked-list","math","two-pointers"]}
|
||
{"id":1775,"frontendId":1656,"title":"Design an Ordered Stream","titleSlug":"design-an-ordered-stream","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","design","data-stream"]}
|
||
{"id":1776,"frontendId":1658,"title":"Minimum Operations to Reduce X to Zero","titleSlug":"minimum-operations-to-reduce-x-to-zero","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","binary-search","sliding-window","prefix-sum"]}
|
||
{"id":1777,"frontendId":1657,"title":"Determine if Two Strings Are Close","titleSlug":"determine-if-two-strings-are-close","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sorting","counting"]}
|
||
{"id":1778,"frontendId":1659,"title":"Maximize Grid Happiness","titleSlug":"maximize-grid-happiness","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","bit-manipulation","memoization","bitmask"]}
|
||
{"id":1779,"frontendId":1635,"title":"Hopper Company Queries I","titleSlug":"hopper-company-queries-i","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":1780,"frontendId":1644,"title":"Lowest Common Ancestor of a Binary Tree II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":1781,"frontendId":1662,"title":"Check If Two String Arrays are Equivalent","titleSlug":"check-if-two-string-arrays-are-equivalent","difficulty":"EASY","paidOnly":false,"tags":["array","string"]}
|
||
{"id":1782,"frontendId":1663,"title":"Smallest String With A Given Numeric Value","titleSlug":"smallest-string-with-a-given-numeric-value","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":1783,"frontendId":1664,"title":"Ways to Make a Fair Array","titleSlug":"ways-to-make-a-fair-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":1784,"frontendId":1665,"title":"Minimum Initial Energy to Finish Tasks","titleSlug":"minimum-initial-energy-to-finish-tasks","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":1785,"frontendId":1645,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":1786,"frontendId":1684,"title":"Count the Number of Consistent Strings","titleSlug":"count-the-number-of-consistent-strings","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string","bit-manipulation","counting"]}
|
||
{"id":1787,"frontendId":1685,"title":"Sum of Absolute Differences in a Sorted Array","titleSlug":"sum-of-absolute-differences-in-a-sorted-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","prefix-sum"]}
|
||
{"id":1788,"frontendId":1686,"title":"Stone Game VI","titleSlug":"stone-game-vi","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","greedy","sorting","heap-priority-queue","game-theory"]}
|
||
{"id":1789,"frontendId":1687,"title":"Delivering Boxes from Storage to Ports","titleSlug":"delivering-boxes-from-storage-to-ports","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","segment-tree","queue","heap-priority-queue","prefix-sum","monotonic-queue"]}
|
||
{"id":1790,"frontendId":1650,"title":"Lowest Common Ancestor of a Binary Tree III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","two-pointers","tree","binary-tree"]}
|
||
{"id":1791,"frontendId":1672,"title":"Richest Customer Wealth","titleSlug":"richest-customer-wealth","difficulty":"EASY","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":1792,"frontendId":1673,"title":"Find the Most Competitive Subsequence","titleSlug":"find-the-most-competitive-subsequence","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","greedy","monotonic-stack"]}
|
||
{"id":1793,"frontendId":1674,"title":"Minimum Moves to Make Array Complementary","titleSlug":"minimum-moves-to-make-array-complementary","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":1794,"frontendId":1675,"title":"Minimize Deviation in Array","titleSlug":"minimize-deviation-in-array","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","heap-priority-queue","ordered-set"]}
|
||
{"id":1795,"frontendId":1651,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":1796,"frontendId":1660,"title":"Correct a Binary Tree","titleSlug":"correct-a-binary-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":1797,"frontendId":1678,"title":"Goal Parser Interpretation","titleSlug":"goal-parser-interpretation","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":1798,"frontendId":1679,"title":"Max Number of K-Sum Pairs","titleSlug":"max-number-of-k-sum-pairs","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","two-pointers","sorting"]}
|
||
{"id":1799,"frontendId":1681,"title":"Minimum Incompatibility","titleSlug":"minimum-incompatibility","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","dynamic-programming","bit-manipulation","bitmask"]}
|
||
{"id":1800,"frontendId":1680,"title":"Concatenation of Consecutive Binary Numbers","titleSlug":"concatenation-of-consecutive-binary-numbers","difficulty":"MEDIUM","paidOnly":false,"tags":["math","bit-manipulation","simulation"]}
|
||
{"id":1801,"frontendId":1661,"title":"Average Time of Process per Machine","titleSlug":"average-time-of-process-per-machine","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1802,"frontendId":1700,"title":"Number of Students Unable to Eat Lunch","titleSlug":"number-of-students-unable-to-eat-lunch","difficulty":"EASY","paidOnly":false,"tags":["array","stack","queue","simulation"]}
|
||
{"id":1803,"frontendId":1701,"title":"Average Waiting Time","titleSlug":"average-waiting-time","difficulty":"MEDIUM","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":1804,"frontendId":1702,"title":"Maximum Binary String After Change","titleSlug":"maximum-binary-string-after-change","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":1805,"frontendId":1703,"title":"Minimum Adjacent Swaps for K Consecutive Ones","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","sliding-window","prefix-sum"]}
|
||
{"id":1806,"frontendId":1688,"title":"Count of Matches in Tournament","titleSlug":"count-of-matches-in-tournament","difficulty":"EASY","paidOnly":false,"tags":["math","simulation"]}
|
||
{"id":1807,"frontendId":1689,"title":"Partitioning Into Minimum Number Of Deci-Binary Numbers","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":1808,"frontendId":1690,"title":"Stone Game VII","titleSlug":"stone-game-vii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","dynamic-programming","game-theory"]}
|
||
{"id":1809,"frontendId":1714,"title":"Sum Of Special Evenly-Spaced Elements In Array","titleSlug":"sum-of-special-evenly-spaced-elements-in-array","difficulty":"HARD","paidOnly":true,"tags":["array","dynamic-programming"]}
|
||
{"id":1810,"frontendId":1666,"title":"Change the Root of a Binary Tree","titleSlug":"change-the-root-of-a-binary-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":1811,"frontendId":1667,"title":"Fix Names in a Table","titleSlug":"fix-names-in-a-table","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1812,"frontendId":1694,"title":"Reformat Phone Number","titleSlug":"reformat-phone-number","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":1813,"frontendId":1695,"title":"Maximum Erasure Value","titleSlug":"maximum-erasure-value","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sliding-window"]}
|
||
{"id":1814,"frontendId":1696,"title":"Jump Game VI","titleSlug":"jump-game-vi","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","queue","heap-priority-queue","monotonic-queue"]}
|
||
{"id":1815,"frontendId":1697,"title":"Checking Existence of Edge Length Limited Paths","titleSlug":"checking-existence-of-edge-length-limited-paths","difficulty":"HARD","paidOnly":false,"tags":["array","two-pointers","union-find","graph","sorting"]}
|
||
{"id":1816,"frontendId":1676,"title":"Lowest Common Ancestor of a Binary Tree IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","tree","depth-first-search","binary-tree"]}
|
||
{"id":1817,"frontendId":1716,"title":"Calculate Money in Leetcode Bank","titleSlug":"calculate-money-in-leetcode-bank","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":1818,"frontendId":1717,"title":"Maximum Score From Removing Substrings","titleSlug":"maximum-score-from-removing-substrings","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","greedy"]}
|
||
{"id":1819,"frontendId":1718,"title":"Construct the Lexicographically Largest Valid Sequence","titleSlug":"construct-the-lexicographically-largest-valid-sequence","difficulty":"MEDIUM","paidOnly":false,"tags":["array","backtracking"]}
|
||
{"id":1820,"frontendId":1719,"title":"Number Of Ways To Reconstruct A Tree","titleSlug":"number-of-ways-to-reconstruct-a-tree","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","tree","graph","simulation"]}
|
||
{"id":1821,"frontendId":1677,"title":"Product's Worth Over Invoices","titleSlug":"products-worth-over-invoices","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1822,"frontendId":1682,"title":"Longest Palindromic Subsequence II","titleSlug":"longest-palindromic-subsequence-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["string","dynamic-programming"]}
|
||
{"id":1823,"frontendId":1704,"title":"Determine if String Halves Are Alike","titleSlug":"determine-if-string-halves-are-alike","difficulty":"EASY","paidOnly":false,"tags":["string","counting"]}
|
||
{"id":1824,"frontendId":1705,"title":"Maximum Number of Eaten Apples","titleSlug":"maximum-number-of-eaten-apples","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","heap-priority-queue"]}
|
||
{"id":1825,"frontendId":1723,"title":"Find Minimum Time to Finish All Jobs","titleSlug":"find-minimum-time-to-finish-all-jobs","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","backtracking","bit-manipulation","bitmask"]}
|
||
{"id":1826,"frontendId":1707,"title":"Maximum XOR With an Element From Array","titleSlug":"maximum-xor-with-an-element-from-array","difficulty":"HARD","paidOnly":false,"tags":["array","bit-manipulation","trie"]}
|
||
{"id":1827,"frontendId":1683,"title":"Invalid Tweets","titleSlug":"invalid-tweets","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1828,"frontendId":1692,"title":"Count Ways to Distribute Candies","titleSlug":"count-ways-to-distribute-candies","difficulty":"HARD","paidOnly":true,"tags":["dynamic-programming"]}
|
||
{"id":1829,"frontendId":1710,"title":"Maximum Units on a Truck","titleSlug":"maximum-units-on-a-truck","difficulty":"EASY","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":1830,"frontendId":1711,"title":"Count Good Meals","titleSlug":"count-good-meals","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":1831,"frontendId":1712,"title":"Ways to Split Array Into Three Subarrays","titleSlug":"ways-to-split-array-into-three-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","prefix-sum"]}
|
||
{"id":1832,"frontendId":1713,"title":"Minimum Operations to Make a Subsequence","titleSlug":"minimum-operations-to-make-a-subsequence","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","binary-search","greedy"]}
|
||
{"id":1833,"frontendId":1732,"title":"Find the Highest Altitude","titleSlug":"find-the-highest-altitude","difficulty":"EASY","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":1834,"frontendId":1733,"title":"Minimum Number of People to Teach","titleSlug":"minimum-number-of-people-to-teach","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy"]}
|
||
{"id":1835,"frontendId":1734,"title":"Decode XORed Permutation","titleSlug":"decode-xored-permutation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation"]}
|
||
{"id":1836,"frontendId":1735,"title":"Count Ways to Make Array With Product","titleSlug":"count-ways-to-make-array-with-product","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","combinatorics","number-theory"]}
|
||
{"id":1837,"frontendId":1693,"title":"Daily Leads and Partners","titleSlug":"daily-leads-and-partners","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1838,"frontendId":1698,"title":"Number of Distinct Substrings in a String","titleSlug":"number-of-distinct-substrings-in-a-string","difficulty":"MEDIUM","paidOnly":true,"tags":["string","trie","rolling-hash","suffix-array","hash-function"]}
|
||
{"id":1839,"frontendId":1720,"title":"Decode XORed Array","titleSlug":"decode-xored-array","difficulty":"EASY","paidOnly":false,"tags":["array","bit-manipulation"]}
|
||
{"id":1840,"frontendId":1722,"title":"Minimize Hamming Distance After Swap Operations","titleSlug":"minimize-hamming-distance-after-swap-operations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","union-find"]}
|
||
{"id":1842,"frontendId":1699,"title":"Number of Calls Between Two Persons","titleSlug":"number-of-calls-between-two-persons","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1843,"frontendId":1725,"title":"Number Of Rectangles That Can Form The Largest Square","titleSlug":"number-of-rectangles-that-can-form-the-largest-square","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":1844,"frontendId":1742,"title":"Maximum Number of Balls in a Box","titleSlug":"maximum-number-of-balls-in-a-box","difficulty":"EASY","paidOnly":false,"tags":["hash-table","math","counting"]}
|
||
{"id":1845,"frontendId":1727,"title":"Largest Submatrix With Rearrangements","titleSlug":"largest-submatrix-with-rearrangements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting","matrix"]}
|
||
{"id":1847,"frontendId":1708,"title":"Largest Subarray Length K","titleSlug":"largest-subarray-length-k","difficulty":"EASY","paidOnly":true,"tags":["array","greedy"]}
|
||
{"id":1848,"frontendId":1748,"title":"Sum of Unique Elements","titleSlug":"sum-of-unique-elements","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":1849,"frontendId":1749,"title":"Maximum Absolute Sum of Any Subarray","titleSlug":"maximum-absolute-sum-of-any-subarray","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":1850,"frontendId":1750,"title":"Minimum Length of String After Deleting Similar Ends","titleSlug":"minimum-length-of-string-after-deleting-similar-ends","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":1851,"frontendId":1751,"title":"Maximum Number of Events That Can Be Attended II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","dynamic-programming","sorting"]}
|
||
{"id":1852,"frontendId":1709,"title":"Biggest Window Between Visits","titleSlug":"biggest-window-between-visits","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1858,"frontendId":1736,"title":"Latest Time by Replacing Hidden Digits","titleSlug":"latest-time-by-replacing-hidden-digits","difficulty":"EASY","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":1859,"frontendId":1737,"title":"Change Minimum Characters to Satisfy One of Three Conditions","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","counting","prefix-sum"]}
|
||
{"id":1860,"frontendId":1738,"title":"Find Kth Largest XOR Coordinate Value","titleSlug":"find-kth-largest-xor-coordinate-value","difficulty":"MEDIUM","paidOnly":false,"tags":["array","divide-and-conquer","bit-manipulation","sorting","heap-priority-queue","matrix","prefix-sum","quickselect"]}
|
||
{"id":1861,"frontendId":1739,"title":"Building Boxes","titleSlug":"building-boxes","difficulty":"HARD","paidOnly":false,"tags":["math","binary-search","greedy"]}
|
||
{"id":1862,"frontendId":1715,"title":"Count Apples and Oranges","titleSlug":"count-apples-and-oranges","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1865,"frontendId":1724,"title":"Checking Existence of Edge Length Limited Paths II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii","difficulty":"HARD","paidOnly":true,"tags":["depth-first-search","union-find","graph","design","sorting","heap-priority-queue","minimum-spanning-tree"]}
|
||
{"id":1866,"frontendId":1743,"title":"Restore the Array From Adjacent Pairs","titleSlug":"restore-the-array-from-adjacent-pairs","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","depth-first-search"]}
|
||
{"id":1871,"frontendId":1745,"title":"Palindrome Partitioning IV","titleSlug":"palindrome-partitioning-iv","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":1872,"frontendId":1744,"title":"Can You Eat Your Favorite Candy on Your Favorite Day?","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":1873,"frontendId":1763,"title":"Longest Nice Substring","titleSlug":"longest-nice-substring","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","divide-and-conquer","bit-manipulation","sliding-window"]}
|
||
{"id":1874,"frontendId":1764,"title":"Form Array by Concatenating Subarrays of Another Array","titleSlug":"form-array-by-concatenating-subarrays-of-another-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","greedy","string-matching"]}
|
||
{"id":1875,"frontendId":1766,"title":"Tree of Coprimes","titleSlug":"tree-of-coprimes","difficulty":"HARD","paidOnly":false,"tags":["array","math","tree","depth-first-search","number-theory"]}
|
||
{"id":1876,"frontendId":1765,"title":"Map of Highest Peak","titleSlug":"map-of-highest-peak","difficulty":"MEDIUM","paidOnly":false,"tags":["array","breadth-first-search","matrix"]}
|
||
{"id":1877,"frontendId":1729,"title":"Find Followers Count","titleSlug":"find-followers-count","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1878,"frontendId":1752,"title":"Check if Array Is Sorted and Rotated","titleSlug":"check-if-array-is-sorted-and-rotated","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":1879,"frontendId":1753,"title":"Maximum Score From Removing Stones","titleSlug":"maximum-score-from-removing-stones","difficulty":"MEDIUM","paidOnly":false,"tags":["math","greedy","heap-priority-queue"]}
|
||
{"id":1880,"frontendId":1754,"title":"Largest Merge Of Two Strings","titleSlug":"largest-merge-of-two-strings","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string","greedy"]}
|
||
{"id":1881,"frontendId":1755,"title":"Closest Subsequence Sum","titleSlug":"closest-subsequence-sum","difficulty":"HARD","paidOnly":false,"tags":["array","two-pointers","dynamic-programming","bit-manipulation","sorting","bitmask"]}
|
||
{"id":1882,"frontendId":1731,"title":"The Number of Employees Which Report to Each Employee","titleSlug":"the-number-of-employees-which-report-to-each-employee","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1883,"frontendId":1740,"title":"Find Distance in a Binary Tree","titleSlug":"find-distance-in-a-binary-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":1884,"frontendId":1758,"title":"Minimum Changes To Make Alternating Binary String","titleSlug":"minimum-changes-to-make-alternating-binary-string","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":1885,"frontendId":1759,"title":"Count Number of Homogenous Substrings","titleSlug":"count-number-of-homogenous-substrings","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string"]}
|
||
{"id":1886,"frontendId":1760,"title":"Minimum Limit of Balls in a Bag","titleSlug":"minimum-limit-of-balls-in-a-bag","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":1887,"frontendId":1761,"title":"Minimum Degree of a Connected Trio in a Graph","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph","difficulty":"HARD","paidOnly":false,"tags":["graph","enumeration"]}
|
||
{"id":1888,"frontendId":1779,"title":"Find Nearest Point That Has the Same X or Y Coordinate","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":1889,"frontendId":1780,"title":"Check if Number is a Sum of Powers of Three","titleSlug":"check-if-number-is-a-sum-of-powers-of-three","difficulty":"MEDIUM","paidOnly":false,"tags":["math"]}
|
||
{"id":1890,"frontendId":1781,"title":"Sum of Beauty of All Substrings","titleSlug":"sum-of-beauty-of-all-substrings","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":1891,"frontendId":1782,"title":"Count Pairs Of Nodes","titleSlug":"count-pairs-of-nodes","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","two-pointers","binary-search","graph","sorting","counting"]}
|
||
{"id":1892,"frontendId":1741,"title":"Find Total Time Spent by Each Employee","titleSlug":"find-total-time-spent-by-each-employee","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1893,"frontendId":1746,"title":"Maximum Subarray Sum After One Operation","titleSlug":"maximum-subarray-sum-after-one-operation","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming"]}
|
||
{"id":1894,"frontendId":1768,"title":"Merge Strings Alternately","titleSlug":"merge-strings-alternately","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":1895,"frontendId":1769,"title":"Minimum Number of Operations to Move All Balls to Each Box","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","prefix-sum"]}
|
||
{"id":1896,"frontendId":1770,"title":"Maximum Score from Performing Multiplication Operations","titleSlug":"maximum-score-from-performing-multiplication-operations","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":1897,"frontendId":1771,"title":"Maximize Palindrome Length From Subsequences","titleSlug":"maximize-palindrome-length-from-subsequences","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":1898,"frontendId":1747,"title":"Leetflex Banned Accounts","titleSlug":"leetflex-banned-accounts","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1899,"frontendId":1773,"title":"Count Items Matching a Rule","titleSlug":"count-items-matching-a-rule","difficulty":"EASY","paidOnly":false,"tags":["array","string"]}
|
||
{"id":1900,"frontendId":1774,"title":"Closest Dessert Cost","titleSlug":"closest-dessert-cost","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","backtracking"]}
|
||
{"id":1901,"frontendId":1775,"title":"Equal Sum Arrays With Minimum Number of Operations","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","counting"]}
|
||
{"id":1902,"frontendId":1776,"title":"Car Fleet II","titleSlug":"car-fleet-ii","difficulty":"HARD","paidOnly":false,"tags":["array","math","stack","heap-priority-queue","monotonic-stack"]}
|
||
{"id":1903,"frontendId":1756,"title":"Design Most Recently Used Queue","titleSlug":"design-most-recently-used-queue","difficulty":"MEDIUM","paidOnly":true,"tags":["array","linked-list","divide-and-conquer","design","simulation","doubly-linked-list"]}
|
||
{"id":1904,"frontendId":1796,"title":"Second Largest Digit in a String","titleSlug":"second-largest-digit-in-a-string","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":1905,"frontendId":1797,"title":"Design Authentication Manager","titleSlug":"design-authentication-manager","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","linked-list","design","doubly-linked-list"]}
|
||
{"id":1906,"frontendId":1799,"title":"Maximize Score After N Operations","titleSlug":"maximize-score-after-n-operations","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","backtracking","bit-manipulation","number-theory","bitmask"]}
|
||
{"id":1907,"frontendId":1803,"title":"Count Pairs With XOR in a Range","titleSlug":"count-pairs-with-xor-in-a-range","difficulty":"HARD","paidOnly":false,"tags":["array","bit-manipulation","trie"]}
|
||
{"id":1908,"frontendId":1757,"title":"Recyclable and Low Fat Products","titleSlug":"recyclable-and-low-fat-products","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1909,"frontendId":1762,"title":"Buildings With an Ocean View","titleSlug":"buildings-with-an-ocean-view","difficulty":"MEDIUM","paidOnly":true,"tags":["array","stack","monotonic-stack"]}
|
||
{"id":1910,"frontendId":1784,"title":"Check if Binary String Has at Most One Segment of Ones","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":1911,"frontendId":1785,"title":"Minimum Elements to Add to Form a Given Sum","titleSlug":"minimum-elements-to-add-to-form-a-given-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":1912,"frontendId":1786,"title":"Number of Restricted Paths From First to Last Node","titleSlug":"number-of-restricted-paths-from-first-to-last-node","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming","graph","topological-sort","heap-priority-queue","shortest-path"]}
|
||
{"id":1913,"frontendId":1787,"title":"Make the XOR of All Segments Equal to Zero","titleSlug":"make-the-xor-of-all-segments-equal-to-zero","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","dynamic-programming","bit-manipulation","counting"]}
|
||
{"id":1914,"frontendId":1767,"title":"Find the Subtasks That Did Not Execute","titleSlug":"find-the-subtasks-that-did-not-execute","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":1915,"frontendId":1790,"title":"Check if One String Swap Can Make Strings Equal","titleSlug":"check-if-one-string-swap-can-make-strings-equal","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":1916,"frontendId":1791,"title":"Find Center of Star Graph","titleSlug":"find-center-of-star-graph","difficulty":"EASY","paidOnly":false,"tags":["graph"]}
|
||
{"id":1917,"frontendId":1792,"title":"Maximum Average Pass Ratio","titleSlug":"maximum-average-pass-ratio","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","heap-priority-queue"]}
|
||
{"id":1918,"frontendId":1793,"title":"Maximum Score of a Good Subarray","titleSlug":"maximum-score-of-a-good-subarray","difficulty":"HARD","paidOnly":false,"tags":["array","two-pointers","binary-search","stack","monotonic-stack"]}
|
||
{"id":1919,"frontendId":1772,"title":"Sort Features by Popularity","titleSlug":"sort-features-by-popularity","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","string","sorting"]}
|
||
{"id":1920,"frontendId":1812,"title":"Determine Color of a Chessboard Square","titleSlug":"determine-color-of-a-chessboard-square","difficulty":"EASY","paidOnly":false,"tags":["math","string"]}
|
||
{"id":1923,"frontendId":1813,"title":"Sentence Similarity III","titleSlug":"sentence-similarity-iii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","string"]}
|
||
{"id":1924,"frontendId":1815,"title":"Maximum Number of Groups Getting Fresh Donuts","titleSlug":"maximum-number-of-groups-getting-fresh-donuts","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","memoization","bitmask"]}
|
||
{"id":1925,"frontendId":1814,"title":"Count Nice Pairs in an Array","titleSlug":"count-nice-pairs-in-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","counting"]}
|
||
{"id":1926,"frontendId":1777,"title":"Product's Price for Each Store","titleSlug":"products-price-for-each-store","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1927,"frontendId":1800,"title":"Maximum Ascending Subarray Sum","titleSlug":"maximum-ascending-subarray-sum","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":1928,"frontendId":1801,"title":"Number of Orders in the Backlog","titleSlug":"number-of-orders-in-the-backlog","difficulty":"MEDIUM","paidOnly":false,"tags":["array","heap-priority-queue","simulation"]}
|
||
{"id":1929,"frontendId":1802,"title":"Maximum Value at a Given Index in a Bounded Array","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array","difficulty":"MEDIUM","paidOnly":false,"tags":["math","binary-search","greedy"]}
|
||
{"id":1930,"frontendId":1798,"title":"Maximum Number of Consecutive Values You Can Make","titleSlug":"maximum-number-of-consecutive-values-you-can-make","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":1931,"frontendId":1778,"title":"Shortest Path in a Hidden Grid","titleSlug":"shortest-path-in-a-hidden-grid","difficulty":"MEDIUM","paidOnly":true,"tags":["array","depth-first-search","breadth-first-search","matrix","interactive"]}
|
||
{"id":1932,"frontendId":1783,"title":"Grand Slam Titles","titleSlug":"grand-slam-titles","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1933,"frontendId":1805,"title":"Number of Different Integers in a String","titleSlug":"number-of-different-integers-in-a-string","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":1934,"frontendId":1807,"title":"Evaluate the Bracket Pairs of a String","titleSlug":"evaluate-the-bracket-pairs-of-a-string","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":1935,"frontendId":1806,"title":"Minimum Number of Operations to Reinitialize a Permutation","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","simulation"]}
|
||
{"id":1936,"frontendId":1808,"title":"Maximize Number of Nice Divisors","titleSlug":"maximize-number-of-nice-divisors","difficulty":"HARD","paidOnly":false,"tags":["math","recursion","number-theory"]}
|
||
{"id":1937,"frontendId":1788,"title":"Maximize the Beauty of the Garden","titleSlug":"maximize-the-beauty-of-the-garden","difficulty":"HARD","paidOnly":true,"tags":["array","hash-table","greedy","prefix-sum"]}
|
||
{"id":1938,"frontendId":1827,"title":"Minimum Operations to Make the Array Increasing","titleSlug":"minimum-operations-to-make-the-array-increasing","difficulty":"EASY","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":1939,"frontendId":1828,"title":"Queries on Number of Points Inside a Circle","titleSlug":"queries-on-number-of-points-inside-a-circle","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","geometry"]}
|
||
{"id":1940,"frontendId":1829,"title":"Maximum XOR for Each Query","titleSlug":"maximum-xor-for-each-query","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation","prefix-sum"]}
|
||
{"id":1941,"frontendId":1830,"title":"Minimum Number of Operations to Make String Sorted","titleSlug":"minimum-number-of-operations-to-make-string-sorted","difficulty":"HARD","paidOnly":false,"tags":["hash-table","math","string","combinatorics","counting"]}
|
||
{"id":1942,"frontendId":1789,"title":"Primary Department for Each Employee","titleSlug":"primary-department-for-each-employee","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1943,"frontendId":1794,"title":"Count Pairs of Equal Substrings With Minimum Difference","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","greedy"]}
|
||
{"id":1944,"frontendId":1816,"title":"Truncate Sentence","titleSlug":"truncate-sentence","difficulty":"EASY","paidOnly":false,"tags":["array","string"]}
|
||
{"id":1945,"frontendId":1817,"title":"Finding the Users Active Minutes","titleSlug":"finding-the-users-active-minutes","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":1946,"frontendId":1818,"title":"Minimum Absolute Sum Difference","titleSlug":"minimum-absolute-sum-difference","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","sorting","ordered-set"]}
|
||
{"id":1947,"frontendId":1819,"title":"Number of Different Subsequences GCDs","titleSlug":"number-of-different-subsequences-gcds","difficulty":"HARD","paidOnly":false,"tags":["array","math","counting","number-theory"]}
|
||
{"id":1948,"frontendId":1795,"title":"Rearrange Products Table","titleSlug":"rearrange-products-table","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":1949,"frontendId":1804,"title":"Implement Trie II (Prefix Tree)","titleSlug":"implement-trie-ii-prefix-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","design","trie"]}
|
||
{"id":1950,"frontendId":1822,"title":"Sign of the Product of an Array","titleSlug":"sign-of-the-product-of-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
|
||
{"id":1951,"frontendId":1823,"title":"Find the Winner of the Circular Game","titleSlug":"find-the-winner-of-the-circular-game","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","recursion","queue","simulation"]}
|
||
{"id":1952,"frontendId":1824,"title":"Minimum Sideway Jumps","titleSlug":"minimum-sideway-jumps","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","greedy"]}
|
||
{"id":1953,"frontendId":1825,"title":"Finding MK Average","titleSlug":"finding-mk-average","difficulty":"HARD","paidOnly":false,"tags":["design","queue","heap-priority-queue","data-stream","ordered-set"]}
|
||
{"id":1954,"frontendId":1844,"title":"Replace All Digits with Characters","titleSlug":"replace-all-digits-with-characters","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":1955,"frontendId":1845,"title":"Seat Reservation Manager","titleSlug":"seat-reservation-manager","difficulty":"MEDIUM","paidOnly":false,"tags":["design","heap-priority-queue"]}
|
||
{"id":1956,"frontendId":1846,"title":"Maximum Element After Decreasing and Rearranging","titleSlug":"maximum-element-after-decreasing-and-rearranging","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":1957,"frontendId":1847,"title":"Closest Room","titleSlug":"closest-room","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","sorting","ordered-set"]}
|
||
{"id":1958,"frontendId":1809,"title":"Ad-Free Sessions","titleSlug":"ad-free-sessions","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1959,"frontendId":1810,"title":"Minimum Path Cost in a Hidden Grid","titleSlug":"minimum-path-cost-in-a-hidden-grid","difficulty":"MEDIUM","paidOnly":true,"tags":["array","depth-first-search","breadth-first-search","graph","heap-priority-queue","matrix","interactive","shortest-path"]}
|
||
{"id":1960,"frontendId":1832,"title":"Check if the Sentence Is Pangram","titleSlug":"check-if-the-sentence-is-pangram","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":1961,"frontendId":1833,"title":"Maximum Ice Cream Bars","titleSlug":"maximum-ice-cream-bars","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting","counting-sort"]}
|
||
{"id":1962,"frontendId":1834,"title":"Single-Threaded CPU","titleSlug":"single-threaded-cpu","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting","heap-priority-queue"]}
|
||
{"id":1963,"frontendId":1835,"title":"Find XOR Sum of All Pairs Bitwise AND","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and","difficulty":"HARD","paidOnly":false,"tags":["array","math","bit-manipulation"]}
|
||
{"id":1964,"frontendId":1811,"title":"Find Interview Candidates","titleSlug":"find-interview-candidates","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1965,"frontendId":1837,"title":"Sum of Digits in Base K","titleSlug":"sum-of-digits-in-base-k","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":1966,"frontendId":1838,"title":"Frequency of the Most Frequent Element","titleSlug":"frequency-of-the-most-frequent-element","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","greedy","sliding-window","sorting","prefix-sum"]}
|
||
{"id":1967,"frontendId":1839,"title":"Longest Substring Of All Vowels in Order","titleSlug":"longest-substring-of-all-vowels-in-order","difficulty":"MEDIUM","paidOnly":false,"tags":["string","sliding-window"]}
|
||
{"id":1968,"frontendId":1840,"title":"Maximum Building Height","titleSlug":"maximum-building-height","difficulty":"HARD","paidOnly":false,"tags":["array","math","sorting"]}
|
||
{"id":1969,"frontendId":1820,"title":"Maximum Number of Accepted Invitations","titleSlug":"maximum-number-of-accepted-invitations","difficulty":"MEDIUM","paidOnly":true,"tags":["array","depth-first-search","graph","matrix"]}
|
||
{"id":1970,"frontendId":1859,"title":"Sorting the Sentence","titleSlug":"sorting-the-sentence","difficulty":"EASY","paidOnly":false,"tags":["string","sorting"]}
|
||
{"id":1971,"frontendId":1860,"title":"Incremental Memory Leak","titleSlug":"incremental-memory-leak","difficulty":"MEDIUM","paidOnly":false,"tags":["math","simulation"]}
|
||
{"id":1972,"frontendId":1861,"title":"Rotating the Box","titleSlug":"rotating-the-box","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","matrix"]}
|
||
{"id":1974,"frontendId":1821,"title":"Find Customers With Positive Revenue this Year","titleSlug":"find-customers-with-positive-revenue-this-year","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":1975,"frontendId":1848,"title":"Minimum Distance to the Target Element","titleSlug":"minimum-distance-to-the-target-element","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":1976,"frontendId":1849,"title":"Splitting a String Into Descending Consecutive Values","titleSlug":"splitting-a-string-into-descending-consecutive-values","difficulty":"MEDIUM","paidOnly":false,"tags":["string","backtracking","enumeration"]}
|
||
{"id":1977,"frontendId":1851,"title":"Minimum Interval to Include Each Query","titleSlug":"minimum-interval-to-include-each-query","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","line-sweep","sorting","heap-priority-queue"]}
|
||
{"id":1978,"frontendId":1850,"title":"Minimum Adjacent Swaps to Reach the Kth Smallest Number","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string","greedy"]}
|
||
{"id":1979,"frontendId":1989,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag","difficulty":"MEDIUM","paidOnly":true,"tags":["array","two-pointers","greedy"]}
|
||
{"id":1980,"frontendId":1826,"title":"Faulty Sensor","titleSlug":"faulty-sensor","difficulty":"EASY","paidOnly":true,"tags":["array","two-pointers"]}
|
||
{"id":1981,"frontendId":1831,"title":"Maximum Transaction Each Day","titleSlug":"maximum-transaction-each-day","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1982,"frontendId":1836,"title":"Remove Duplicates From an Unsorted Linked List","titleSlug":"remove-duplicates-from-an-unsorted-linked-list","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","linked-list"]}
|
||
{"id":1983,"frontendId":1854,"title":"Maximum Population Year","titleSlug":"maximum-population-year","difficulty":"EASY","paidOnly":false,"tags":["array","counting","prefix-sum"]}
|
||
{"id":1984,"frontendId":1855,"title":"Maximum Distance Between a Pair of Values","titleSlug":"maximum-distance-between-a-pair-of-values","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search"]}
|
||
{"id":1985,"frontendId":1856,"title":"Maximum Subarray Min-Product","titleSlug":"maximum-subarray-min-product","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","monotonic-stack","prefix-sum"]}
|
||
{"id":1986,"frontendId":1857,"title":"Largest Color Value in a Directed Graph","titleSlug":"largest-color-value-in-a-directed-graph","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","dynamic-programming","graph","topological-sort","memoization","counting"]}
|
||
{"id":1987,"frontendId":1876,"title":"Substrings of Size Three with Distinct Characters","titleSlug":"substrings-of-size-three-with-distinct-characters","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","sliding-window","counting"]}
|
||
{"id":1988,"frontendId":1877,"title":"Minimize Maximum Pair Sum in Array","titleSlug":"minimize-maximum-pair-sum-in-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","greedy","sorting"]}
|
||
{"id":1989,"frontendId":1879,"title":"Minimum XOR Sum of Two Arrays","titleSlug":"minimum-xor-sum-of-two-arrays","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","bitmask"]}
|
||
{"id":1990,"frontendId":1878,"title":"Get Biggest Three Rhombus Sums in a Grid","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","sorting","heap-priority-queue","matrix","prefix-sum"]}
|
||
{"id":1991,"frontendId":1841,"title":"League Statistics","titleSlug":"league-statistics","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1992,"frontendId":2046,"title":"Sort Linked List Already Sorted Using Absolute Values","titleSlug":"sort-linked-list-already-sorted-using-absolute-values","difficulty":"MEDIUM","paidOnly":true,"tags":["linked-list","two-pointers","sorting"]}
|
||
{"id":1993,"frontendId":1863,"title":"Sum of All Subset XOR Totals","titleSlug":"sum-of-all-subset-xor-totals","difficulty":"EASY","paidOnly":false,"tags":["array","math","backtracking","bit-manipulation","combinatorics","enumeration"]}
|
||
{"id":1994,"frontendId":1864,"title":"Minimum Number of Swaps to Make the Binary String Alternating","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":1995,"frontendId":1865,"title":"Finding Pairs With a Certain Sum","titleSlug":"finding-pairs-with-a-certain-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","design"]}
|
||
{"id":1996,"frontendId":1866,"title":"Number of Ways to Rearrange Sticks With K Sticks Visible","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming","combinatorics"]}
|
||
{"id":1997,"frontendId":1842,"title":"Next Palindrome Using Same Digits","titleSlug":"next-palindrome-using-same-digits","difficulty":"HARD","paidOnly":true,"tags":["two-pointers","string"]}
|
||
{"id":1998,"frontendId":1843,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":1999,"frontendId":1869,"title":"Longer Contiguous Segments of Ones than Zeros","titleSlug":"longer-contiguous-segments-of-ones-than-zeros","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":2000,"frontendId":1870,"title":"Minimum Speed to Arrive on Time","titleSlug":"minimum-speed-to-arrive-on-time","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":2001,"frontendId":1871,"title":"Jump Game VII","titleSlug":"jump-game-vii","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming","sliding-window","prefix-sum"]}
|
||
{"id":2002,"frontendId":1872,"title":"Stone Game VIII","titleSlug":"stone-game-viii","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","prefix-sum","game-theory"]}
|
||
{"id":2003,"frontendId":1852,"title":"Distinct Numbers in Each Subarray","titleSlug":"distinct-numbers-in-each-subarray","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","sliding-window"]}
|
||
{"id":2004,"frontendId":1853,"title":"Convert Date Format","titleSlug":"convert-date-format","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":2005,"frontendId":1893,"title":"Check if All the Integers in a Range Are Covered","titleSlug":"check-if-all-the-integers-in-a-range-are-covered","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":2006,"frontendId":1894,"title":"Find the Student that Will Replace the Chalk","titleSlug":"find-the-student-that-will-replace-the-chalk","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","simulation","prefix-sum"]}
|
||
{"id":2007,"frontendId":2247,"title":"Maximum Cost of Trip With K Highways","titleSlug":"maximum-cost-of-trip-with-k-highways","difficulty":"HARD","paidOnly":true,"tags":["dynamic-programming","bit-manipulation","graph","bitmask"]}
|
||
{"id":2008,"frontendId":1896,"title":"Minimum Cost to Change the Final Value of Expression","titleSlug":"minimum-cost-to-change-the-final-value-of-expression","difficulty":"HARD","paidOnly":false,"tags":["math","string","dynamic-programming","stack"]}
|
||
{"id":2009,"frontendId":1858,"title":"Longest Word With All Prefixes","titleSlug":"longest-word-with-all-prefixes","difficulty":"MEDIUM","paidOnly":true,"tags":["array","string","depth-first-search","trie"]}
|
||
{"id":2010,"frontendId":1880,"title":"Check if Word Equals Summation of Two Words","titleSlug":"check-if-word-equals-summation-of-two-words","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":2011,"frontendId":1881,"title":"Maximum Value after Insertion","titleSlug":"maximum-value-after-insertion","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":2012,"frontendId":1882,"title":"Process Tasks Using Servers","titleSlug":"process-tasks-using-servers","difficulty":"MEDIUM","paidOnly":false,"tags":["array","heap-priority-queue"]}
|
||
{"id":2013,"frontendId":1883,"title":"Minimum Skips to Arrive at Meeting On Time","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":2014,"frontendId":1867,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2015,"frontendId":1886,"title":"Determine Whether Matrix Can Be Obtained By Rotation","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation","difficulty":"EASY","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":2016,"frontendId":1887,"title":"Reduction Operations to Make the Array Elements Equal","titleSlug":"reduction-operations-to-make-the-array-elements-equal","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":2017,"frontendId":1888,"title":"Minimum Number of Flips to Make the Binary String Alternating","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming","sliding-window"]}
|
||
{"id":2018,"frontendId":1889,"title":"Minimum Space Wasted From Packaging","titleSlug":"minimum-space-wasted-from-packaging","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","sorting","prefix-sum"]}
|
||
{"id":2019,"frontendId":1868,"title":"Product of Two Run-Length Encoded Arrays","titleSlug":"product-of-two-run-length-encoded-arrays","difficulty":"MEDIUM","paidOnly":true,"tags":["array","two-pointers"]}
|
||
{"id":2020,"frontendId":1909,"title":"Remove One Element to Make the Array Strictly Increasing","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":2021,"frontendId":1910,"title":"Remove All Occurrences of a Substring","titleSlug":"remove-all-occurrences-of-a-substring","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","simulation"]}
|
||
{"id":2022,"frontendId":1911,"title":"Maximum Alternating Subsequence Sum","titleSlug":"maximum-alternating-subsequence-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":2023,"frontendId":1912,"title":"Design Movie Rental System","titleSlug":"design-movie-rental-system","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","design","heap-priority-queue","ordered-set"]}
|
||
{"id":2024,"frontendId":1873,"title":"Calculate Special Bonus","titleSlug":"calculate-special-bonus","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":2025,"frontendId":1897,"title":"Redistribute Characters to Make All Strings Equal","titleSlug":"redistribute-characters-to-make-all-strings-equal","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":2026,"frontendId":1899,"title":"Merge Triplets to Form Target Triplet","titleSlug":"merge-triplets-to-form-target-triplet","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":2027,"frontendId":1898,"title":"Maximum Number of Removable Characters","titleSlug":"maximum-number-of-removable-characters","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","string","binary-search"]}
|
||
{"id":2028,"frontendId":1900,"title":"The Earliest and Latest Rounds Where Players Compete","titleSlug":"the-earliest-and-latest-rounds-where-players-compete","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","memoization"]}
|
||
{"id":2029,"frontendId":1874,"title":"Minimize Product Sum of Two Arrays","titleSlug":"minimize-product-sum-of-two-arrays","difficulty":"MEDIUM","paidOnly":true,"tags":["array","greedy","sorting"]}
|
||
{"id":2030,"frontendId":1875,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2031,"frontendId":1884,"title":"Egg Drop With 2 Eggs and N Floors","titleSlug":"egg-drop-with-2-eggs-and-n-floors","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming"]}
|
||
{"id":2032,"frontendId":1903,"title":"Largest Odd Number in String","titleSlug":"largest-odd-number-in-string","difficulty":"EASY","paidOnly":false,"tags":["math","string","greedy"]}
|
||
{"id":2033,"frontendId":1904,"title":"The Number of Full Rounds You Have Played","titleSlug":"the-number-of-full-rounds-you-have-played","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string"]}
|
||
{"id":2034,"frontendId":1906,"title":"Minimum Absolute Difference Queries","titleSlug":"minimum-absolute-difference-queries","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":2035,"frontendId":1905,"title":"Count Sub Islands","titleSlug":"count-sub-islands","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","union-find","matrix"]}
|
||
{"id":2036,"frontendId":1885,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays","difficulty":"MEDIUM","paidOnly":true,"tags":["array","two-pointers","binary-search","sorting"]}
|
||
{"id":2037,"frontendId":1925,"title":"Count Square Sum Triples","titleSlug":"count-square-sum-triples","difficulty":"EASY","paidOnly":false,"tags":["math","enumeration"]}
|
||
{"id":2038,"frontendId":1926,"title":"Nearest Exit from Entrance in Maze","titleSlug":"nearest-exit-from-entrance-in-maze","difficulty":"MEDIUM","paidOnly":false,"tags":["array","breadth-first-search","matrix"]}
|
||
{"id":2039,"frontendId":1927,"title":"Sum Game","titleSlug":"sum-game","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string","greedy","game-theory"]}
|
||
{"id":2040,"frontendId":1928,"title":"Minimum Cost to Reach Destination in Time","titleSlug":"minimum-cost-to-reach-destination-in-time","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","graph"]}
|
||
{"id":2041,"frontendId":1890,"title":"The Latest Login in 2020","titleSlug":"the-latest-login-in-2020","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":2042,"frontendId":1913,"title":"Maximum Product Difference Between Two Pairs","titleSlug":"maximum-product-difference-between-two-pairs","difficulty":"EASY","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":2043,"frontendId":1914,"title":"Cyclically Rotating a Grid","titleSlug":"cyclically-rotating-a-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","simulation"]}
|
||
{"id":2044,"frontendId":1915,"title":"Number of Wonderful Substrings","titleSlug":"number-of-wonderful-substrings","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","bit-manipulation","prefix-sum"]}
|
||
{"id":2045,"frontendId":1891,"title":"Cutting Ribbons","titleSlug":"cutting-ribbons","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search"]}
|
||
{"id":2046,"frontendId":1892,"title":"Page Recommendations II","titleSlug":"page-recommendations-ii","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2047,"frontendId":1901,"title":"Find a Peak Element II","titleSlug":"find-a-peak-element-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","matrix"]}
|
||
{"id":2048,"frontendId":1920,"title":"Build Array from Permutation","titleSlug":"build-array-from-permutation","difficulty":"EASY","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":2049,"frontendId":1921,"title":"Eliminate Maximum Number of Monsters","titleSlug":"eliminate-maximum-number-of-monsters","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":2050,"frontendId":1922,"title":"Count Good Numbers","titleSlug":"count-good-numbers","difficulty":"MEDIUM","paidOnly":false,"tags":["math","recursion"]}
|
||
{"id":2051,"frontendId":1923,"title":"Longest Common Subpath","titleSlug":"longest-common-subpath","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","rolling-hash","suffix-array","hash-function"]}
|
||
{"id":2052,"frontendId":1902,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order","difficulty":"MEDIUM","paidOnly":true,"tags":["array","tree","binary-search-tree","binary-tree","ordered-set"]}
|
||
{"id":2053,"frontendId":1941,"title":"Check if All Characters Have Equal Number of Occurrences","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":2054,"frontendId":1942,"title":"The Number of the Smallest Unoccupied Chair","titleSlug":"the-number-of-the-smallest-unoccupied-chair","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","heap-priority-queue"]}
|
||
{"id":2055,"frontendId":1943,"title":"Describe the Painting","titleSlug":"describe-the-painting","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sorting","prefix-sum"]}
|
||
{"id":2056,"frontendId":2297,"title":"Jump Game VIII","titleSlug":"jump-game-viii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming","stack","graph","monotonic-stack","shortest-path"]}
|
||
{"id":2057,"frontendId":1907,"title":"Count Salary Categories","titleSlug":"count-salary-categories","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":2058,"frontendId":1929,"title":"Concatenation of Array","titleSlug":"concatenation-of-array","difficulty":"EASY","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":2059,"frontendId":1930,"title":"Unique Length-3 Palindromic Subsequences","titleSlug":"unique-length-3-palindromic-subsequences","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","bit-manipulation","prefix-sum"]}
|
||
{"id":2060,"frontendId":1932,"title":"Merge BSTs to Create Single BST","titleSlug":"merge-bsts-to-create-single-bst","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":2061,"frontendId":1931,"title":"Painting a Grid With Three Different Colors","titleSlug":"painting-a-grid-with-three-different-colors","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":2062,"frontendId":1908,"title":"Game of Nim","titleSlug":"game-of-nim","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","dynamic-programming","bit-manipulation","brainteaser","game-theory"]}
|
||
{"id":2063,"frontendId":1917,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2064,"frontendId":1919,"title":"Leetcodify Similar Friends","titleSlug":"leetcodify-similar-friends","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2065,"frontendId":2307,"title":"Check for Contradictions in Equations","titleSlug":"check-for-contradictions-in-equations","difficulty":"HARD","paidOnly":true,"tags":["array","depth-first-search","union-find","graph"]}
|
||
{"id":2066,"frontendId":1936,"title":"Add Minimum Number of Rungs","titleSlug":"add-minimum-number-of-rungs","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":2067,"frontendId":1937,"title":"Maximum Number of Points with Cost","titleSlug":"maximum-number-of-points-with-cost","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":2068,"frontendId":1938,"title":"Maximum Genetic Difference Query","titleSlug":"maximum-genetic-difference-query","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","bit-manipulation","depth-first-search","trie"]}
|
||
{"id":2069,"frontendId":1918,"title":"Kth Smallest Subarray Sum","titleSlug":"kth-smallest-subarray-sum","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search","sliding-window"]}
|
||
{"id":2070,"frontendId":1933,"title":"Check if String Is Decomposable Into Value-Equal Substrings","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings","difficulty":"EASY","paidOnly":true,"tags":["string"]}
|
||
{"id":2071,"frontendId":1940,"title":"Longest Common Subsequence Between Sorted Arrays","titleSlug":"longest-common-subsequence-between-sorted-arrays","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","counting"]}
|
||
{"id":2072,"frontendId":1950,"title":"Maximum of Minimum Values in All Subarrays","titleSlug":"maximum-of-minimum-values-in-all-subarrays","difficulty":"MEDIUM","paidOnly":true,"tags":["array","stack","monotonic-stack"]}
|
||
{"id":2073,"frontendId":1956,"title":"Minimum Time For K Virus Variants to Spread","titleSlug":"minimum-time-for-k-virus-variants-to-spread","difficulty":"HARD","paidOnly":true,"tags":["array","math","binary-search","geometry","enumeration"]}
|
||
{"id":2074,"frontendId":1924,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii","difficulty":"HARD","paidOnly":true,"tags":["array","math","geometry"]}
|
||
{"id":2075,"frontendId":2021,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street","difficulty":"MEDIUM","paidOnly":true,"tags":["array","sorting","prefix-sum","ordered-set"]}
|
||
{"id":2076,"frontendId":1945,"title":"Sum of Digits of String After Convert","titleSlug":"sum-of-digits-of-string-after-convert","difficulty":"EASY","paidOnly":false,"tags":["string","simulation"]}
|
||
{"id":2077,"frontendId":1946,"title":"Largest Number After Mutating Substring","titleSlug":"largest-number-after-mutating-substring","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","greedy"]}
|
||
{"id":2078,"frontendId":1947,"title":"Maximum Compatibility Score Sum","titleSlug":"maximum-compatibility-score-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","backtracking","bit-manipulation","bitmask"]}
|
||
{"id":2079,"frontendId":1948,"title":"Delete Duplicate Folders in System","titleSlug":"delete-duplicate-folders-in-system","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","string","trie","hash-function"]}
|
||
{"id":2080,"frontendId":1958,"title":"Check if Move is Legal","titleSlug":"check-if-move-is-legal","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","enumeration"]}
|
||
{"id":2081,"frontendId":1959,"title":"Minimum Total Space Wasted With K Resizing Operations","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","prefix-sum"]}
|
||
{"id":2082,"frontendId":2052,"title":"Minimum Cost to Separate Sentence Into Rows","titleSlug":"minimum-cost-to-separate-sentence-into-rows","difficulty":"MEDIUM","paidOnly":true,"tags":["string","dynamic-programming"]}
|
||
{"id":2083,"frontendId":1952,"title":"Three Divisors","titleSlug":"three-divisors","difficulty":"EASY","paidOnly":false,"tags":["math","enumeration","number-theory"]}
|
||
{"id":2084,"frontendId":1953,"title":"Maximum Number of Weeks for Which You Can Work","titleSlug":"maximum-number-of-weeks-for-which-you-can-work","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":2085,"frontendId":1968,"title":"Array With Elements Not Equal to Average of Neighbors","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":2086,"frontendId":1955,"title":"Count Number of Special Subsequences","titleSlug":"count-number-of-special-subsequences","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":2087,"frontendId":1934,"title":"Confirmation Rate","titleSlug":"confirmation-rate","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":2088,"frontendId":1974,"title":"Minimum Time to Type Word Using Special Typewriter","titleSlug":"minimum-time-to-type-word-using-special-typewriter","difficulty":"EASY","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":2089,"frontendId":1975,"title":"Maximum Matrix Sum","titleSlug":"maximum-matrix-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","matrix"]}
|
||
{"id":2090,"frontendId":1976,"title":"Number of Ways to Arrive at Destination","titleSlug":"number-of-ways-to-arrive-at-destination","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming","graph","topological-sort","shortest-path"]}
|
||
{"id":2091,"frontendId":1977,"title":"Number of Ways to Separate Numbers","titleSlug":"number-of-ways-to-separate-numbers","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming","suffix-array"]}
|
||
{"id":2092,"frontendId":1939,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":2093,"frontendId":1961,"title":"Check If String Is a Prefix of Array","titleSlug":"check-if-string-is-a-prefix-of-array","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","string"]}
|
||
{"id":2094,"frontendId":1962,"title":"Remove Stones to Minimize the Total","titleSlug":"remove-stones-to-minimize-the-total","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","heap-priority-queue"]}
|
||
{"id":2095,"frontendId":1963,"title":"Minimum Number of Swaps to Make the String Balanced","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string","stack","greedy"]}
|
||
{"id":2096,"frontendId":1964,"title":"Find the Longest Valid Obstacle Course at Each Position","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","binary-indexed-tree"]}
|
||
{"id":2097,"frontendId":1949,"title":"Strong Friendship","titleSlug":"strong-friendship","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2098,"frontendId":1951,"title":"All the Pairs With the Maximum Number of Common Followers","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2099,"frontendId":1967,"title":"Number of Strings That Appear as Substrings in Word","titleSlug":"number-of-strings-that-appear-as-substrings-in-word","difficulty":"EASY","paidOnly":false,"tags":["array","string"]}
|
||
{"id":2100,"frontendId":1969,"title":"Minimum Non-Zero Product of the Array Elements","titleSlug":"minimum-non-zero-product-of-the-array-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["math","greedy","recursion"]}
|
||
{"id":2101,"frontendId":1970,"title":"Last Day Where You Can Still Cross","titleSlug":"last-day-where-you-can-still-cross","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","depth-first-search","breadth-first-search","union-find","matrix"]}
|
||
{"id":2102,"frontendId":1991,"title":"Find the Middle Index in Array","titleSlug":"find-the-middle-index-in-array","difficulty":"EASY","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":2103,"frontendId":1992,"title":"Find All Groups of Farmland","titleSlug":"find-all-groups-of-farmland","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","matrix"]}
|
||
{"id":2104,"frontendId":1993,"title":"Operations on Tree","titleSlug":"operations-on-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","tree","depth-first-search","breadth-first-search","design"]}
|
||
{"id":2105,"frontendId":1994,"title":"The Number of Good Subsets","titleSlug":"the-number-of-good-subsets","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","dynamic-programming","bit-manipulation","counting","number-theory","bitmask"]}
|
||
{"id":2106,"frontendId":1979,"title":"Find Greatest Common Divisor of Array","titleSlug":"find-greatest-common-divisor-of-array","difficulty":"EASY","paidOnly":false,"tags":["array","math","number-theory"]}
|
||
{"id":2107,"frontendId":1980,"title":"Find Unique Binary String","titleSlug":"find-unique-binary-string","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","backtracking"]}
|
||
{"id":2108,"frontendId":1981,"title":"Minimize the Difference Between Target and Chosen Elements","titleSlug":"minimize-the-difference-between-target-and-chosen-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":2109,"frontendId":1982,"title":"Find Array Given Subset Sums","titleSlug":"find-array-given-subset-sums","difficulty":"HARD","paidOnly":false,"tags":["array","divide-and-conquer"]}
|
||
{"id":2110,"frontendId":1965,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":2111,"frontendId":1966,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search","stack","monotonic-stack"]}
|
||
{"id":2112,"frontendId":1984,"title":"Minimum Difference Between Highest and Lowest of K Scores","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores","difficulty":"EASY","paidOnly":false,"tags":["array","sliding-window","sorting"]}
|
||
{"id":2113,"frontendId":1985,"title":"Find the Kth Largest Integer in the Array","titleSlug":"find-the-kth-largest-integer-in-the-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","divide-and-conquer","sorting","heap-priority-queue","quickselect"]}
|
||
{"id":2114,"frontendId":1986,"title":"Minimum Number of Work Sessions to Finish the Tasks","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","backtracking","bit-manipulation","bitmask"]}
|
||
{"id":2115,"frontendId":1987,"title":"Number of Unique Good Subsequences","titleSlug":"number-of-unique-good-subsequences","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":2116,"frontendId":2006,"title":"Count Number of Pairs With Absolute Difference K","titleSlug":"count-number-of-pairs-with-absolute-difference-k","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":2117,"frontendId":2007,"title":"Find Original Array From Doubled Array","titleSlug":"find-original-array-from-doubled-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","sorting"]}
|
||
{"id":2118,"frontendId":2008,"title":"Maximum Earnings From Taxi","titleSlug":"maximum-earnings-from-taxi","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","binary-search","dynamic-programming","sorting"]}
|
||
{"id":2119,"frontendId":2009,"title":"Minimum Number of Operations to Make Array Continuous","titleSlug":"minimum-number-of-operations-to-make-array-continuous","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","binary-search","sliding-window"]}
|
||
{"id":2120,"frontendId":1972,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2121,"frontendId":1971,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph","difficulty":"EASY","paidOnly":false,"tags":["depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":2122,"frontendId":1995,"title":"Count Special Quadruplets","titleSlug":"count-special-quadruplets","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","enumeration"]}
|
||
{"id":2123,"frontendId":1996,"title":"The Number of Weak Characters in the Game","titleSlug":"the-number-of-weak-characters-in-the-game","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","greedy","sorting","monotonic-stack"]}
|
||
{"id":2124,"frontendId":1997,"title":"First Day Where You Have Been in All the Rooms","titleSlug":"first-day-where-you-have-been-in-all-the-rooms","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":2125,"frontendId":1998,"title":"GCD Sort of an Array","titleSlug":"gcd-sort-of-an-array","difficulty":"HARD","paidOnly":false,"tags":["array","math","union-find","sorting","number-theory"]}
|
||
{"id":2126,"frontendId":1973,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":2127,"frontendId":1978,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":2128,"frontendId":2000,"title":"Reverse Prefix of Word","titleSlug":"reverse-prefix-of-word","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string","stack"]}
|
||
{"id":2129,"frontendId":2001,"title":"Number of Pairs of Interchangeable Rectangles","titleSlug":"number-of-pairs-of-interchangeable-rectangles","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","counting","number-theory"]}
|
||
{"id":2130,"frontendId":2002,"title":"Maximum Product of the Length of Two Palindromic Subsequences","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming","backtracking","bit-manipulation","bitmask"]}
|
||
{"id":2131,"frontendId":2003,"title":"Smallest Missing Genetic Value in Each Subtree","titleSlug":"smallest-missing-genetic-value-in-each-subtree","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","tree","depth-first-search","union-find"]}
|
||
{"id":2132,"frontendId":2022,"title":"Convert 1D Array Into 2D Array","titleSlug":"convert-1d-array-into-2d-array","difficulty":"EASY","paidOnly":false,"tags":["array","matrix","simulation"]}
|
||
{"id":2133,"frontendId":2023,"title":"Number of Pairs of Strings With Concatenation Equal to Target","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","counting"]}
|
||
{"id":2134,"frontendId":2024,"title":"Maximize the Confusion of an Exam","titleSlug":"maximize-the-confusion-of-an-exam","difficulty":"MEDIUM","paidOnly":false,"tags":["string","binary-search","sliding-window","prefix-sum"]}
|
||
{"id":2135,"frontendId":2025,"title":"Maximum Number of Ways to Partition an Array","titleSlug":"maximum-number-of-ways-to-partition-an-array","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","counting","enumeration","prefix-sum"]}
|
||
{"id":2136,"frontendId":1988,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2137,"frontendId":2011,"title":"Final Value of Variable After Performing Operations","titleSlug":"final-value-of-variable-after-performing-operations","difficulty":"EASY","paidOnly":false,"tags":["array","string","simulation"]}
|
||
{"id":2138,"frontendId":2012,"title":"Sum of Beauty in the Array","titleSlug":"sum-of-beauty-in-the-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array"]}
|
||
{"id":2139,"frontendId":2013,"title":"Detect Squares","titleSlug":"detect-squares","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","design","counting","data-stream"]}
|
||
{"id":2140,"frontendId":2014,"title":"Longest Subsequence Repeated k Times","titleSlug":"longest-subsequence-repeated-k-times","difficulty":"HARD","paidOnly":false,"tags":["hash-table","two-pointers","string","backtracking","counting","enumeration"]}
|
||
{"id":2141,"frontendId":1999,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits","difficulty":"MEDIUM","paidOnly":true,"tags":["math","enumeration"]}
|
||
{"id":2142,"frontendId":2015,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment","difficulty":"MEDIUM","paidOnly":true,"tags":["array","sorting","heap-priority-queue","prefix-sum"]}
|
||
{"id":2143,"frontendId":1990,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2144,"frontendId":2016,"title":"Maximum Difference Between Increasing Elements","titleSlug":"maximum-difference-between-increasing-elements","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":2145,"frontendId":2017,"title":"Grid Game","titleSlug":"grid-game","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","prefix-sum"]}
|
||
{"id":2146,"frontendId":2018,"title":"Check if Word Can Be Placed In Crossword","titleSlug":"check-if-word-can-be-placed-in-crossword","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","enumeration"]}
|
||
{"id":2147,"frontendId":2019,"title":"The Score of Students Solving Math Expression","titleSlug":"the-score-of-students-solving-math-expression","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","string","dynamic-programming","stack","memoization"]}
|
||
{"id":2148,"frontendId":2037,"title":"Minimum Number of Moves to Seat Everyone","titleSlug":"minimum-number-of-moves-to-seat-everyone","difficulty":"EASY","paidOnly":false,"tags":["array","greedy","sorting","counting-sort"]}
|
||
{"id":2149,"frontendId":2038,"title":"Remove Colored Pieces if Both Neighbors are the Same Color","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string","greedy","game-theory"]}
|
||
{"id":2150,"frontendId":2040,"title":"Kth Smallest Product of Two Sorted Arrays","titleSlug":"kth-smallest-product-of-two-sorted-arrays","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":2151,"frontendId":2039,"title":"The Time When the Network Becomes Idle","titleSlug":"the-time-when-the-network-becomes-idle","difficulty":"MEDIUM","paidOnly":false,"tags":["array","breadth-first-search","graph"]}
|
||
{"id":2152,"frontendId":2004,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2153,"frontendId":2005,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree","difficulty":"HARD","paidOnly":true,"tags":["math","dynamic-programming","tree","binary-tree","game-theory"]}
|
||
{"id":2154,"frontendId":2027,"title":"Minimum Moves to Convert String","titleSlug":"minimum-moves-to-convert-string","difficulty":"EASY","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":2155,"frontendId":2028,"title":"Find Missing Observations","titleSlug":"find-missing-observations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","simulation"]}
|
||
{"id":2156,"frontendId":2029,"title":"Stone Game IX","titleSlug":"stone-game-ix","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","greedy","counting","game-theory"]}
|
||
{"id":2157,"frontendId":2030,"title":"Smallest K-Length Subsequence With Occurrences of a Letter","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter","difficulty":"HARD","paidOnly":false,"tags":["string","stack","greedy","monotonic-stack"]}
|
||
{"id":2158,"frontendId":2010,"title":"The Number of Seniors and Juniors to Join the Company II","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company-ii","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2159,"frontendId":2032,"title":"Two Out of Three","titleSlug":"two-out-of-three","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","bit-manipulation"]}
|
||
{"id":2160,"frontendId":2033,"title":"Minimum Operations to Make a Uni-Value Grid","titleSlug":"minimum-operations-to-make-a-uni-value-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","sorting","matrix"]}
|
||
{"id":2161,"frontendId":2034,"title":"Stock Price Fluctuation ","titleSlug":"stock-price-fluctuation","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","design","heap-priority-queue","data-stream","ordered-set"]}
|
||
{"id":2162,"frontendId":2035,"title":"Partition Array Into Two Arrays to Minimize Sum Difference","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference","difficulty":"HARD","paidOnly":false,"tags":["array","two-pointers","binary-search","dynamic-programming","bit-manipulation","sorting","ordered-set","bitmask"]}
|
||
{"id":2163,"frontendId":2053,"title":"Kth Distinct String in an Array","titleSlug":"kth-distinct-string-in-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string","counting"]}
|
||
{"id":2164,"frontendId":2054,"title":"Two Best Non-Overlapping Events","titleSlug":"two-best-non-overlapping-events","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","dynamic-programming","sorting","heap-priority-queue"]}
|
||
{"id":2165,"frontendId":2055,"title":"Plates Between Candles","titleSlug":"plates-between-candles","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","binary-search","prefix-sum"]}
|
||
{"id":2166,"frontendId":2056,"title":"Number of Valid Move Combinations On Chessboard","titleSlug":"number-of-valid-move-combinations-on-chessboard","difficulty":"HARD","paidOnly":false,"tags":["array","string","backtracking","simulation"]}
|
||
{"id":2167,"frontendId":2020,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2168,"frontendId":2042,"title":"Check if Numbers Are Ascending in a Sentence","titleSlug":"check-if-numbers-are-ascending-in-a-sentence","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":2169,"frontendId":2043,"title":"Simple Bank System","titleSlug":"simple-bank-system","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","design","simulation"]}
|
||
{"id":2170,"frontendId":2044,"title":"Count Number of Maximum Bitwise-OR Subsets","titleSlug":"count-number-of-maximum-bitwise-or-subsets","difficulty":"MEDIUM","paidOnly":false,"tags":["array","backtracking","bit-manipulation","enumeration"]}
|
||
{"id":2171,"frontendId":2045,"title":"Second Minimum Time to Reach Destination","titleSlug":"second-minimum-time-to-reach-destination","difficulty":"HARD","paidOnly":false,"tags":["breadth-first-search","graph","shortest-path"]}
|
||
{"id":2172,"frontendId":2026,"title":"Low-Quality Problems","titleSlug":"low-quality-problems","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":2173,"frontendId":2047,"title":"Number of Valid Words in a Sentence","titleSlug":"number-of-valid-words-in-a-sentence","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":2174,"frontendId":2048,"title":"Next Greater Numerically Balanced Number","titleSlug":"next-greater-numerically-balanced-number","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","math","backtracking","counting","enumeration"]}
|
||
{"id":2175,"frontendId":2049,"title":"Count Nodes With the Highest Score","titleSlug":"count-nodes-with-the-highest-score","difficulty":"MEDIUM","paidOnly":false,"tags":["array","tree","depth-first-search","binary-tree"]}
|
||
{"id":2176,"frontendId":2050,"title":"Parallel Courses III","titleSlug":"parallel-courses-iii","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","graph","topological-sort"]}
|
||
{"id":2177,"frontendId":2068,"title":"Check Whether Two Strings are Almost Equivalent","titleSlug":"check-whether-two-strings-are-almost-equivalent","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":2178,"frontendId":2069,"title":"Walking Robot Simulation II","titleSlug":"walking-robot-simulation-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["design","simulation"]}
|
||
{"id":2179,"frontendId":2070,"title":"Most Beautiful Item for Each Query","titleSlug":"most-beautiful-item-for-each-query","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","sorting"]}
|
||
{"id":2180,"frontendId":2071,"title":"Maximum Number of Tasks You Can Assign","titleSlug":"maximum-number-of-tasks-you-can-assign","difficulty":"HARD","paidOnly":false,"tags":["array","two-pointers","binary-search","greedy","queue","sorting","monotonic-queue"]}
|
||
{"id":2181,"frontendId":2057,"title":"Smallest Index With Equal Value","titleSlug":"smallest-index-with-equal-value","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":2182,"frontendId":2058,"title":"Find the Minimum and Maximum Number of Nodes Between Critical Points","titleSlug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list"]}
|
||
{"id":2183,"frontendId":2059,"title":"Minimum Operations to Convert Number","titleSlug":"minimum-operations-to-convert-number","difficulty":"MEDIUM","paidOnly":false,"tags":["array","breadth-first-search"]}
|
||
{"id":2184,"frontendId":2060,"title":"Check if an Original String Exists Given Two Encoded Strings","titleSlug":"check-if-an-original-string-exists-given-two-encoded-strings","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":2185,"frontendId":2041,"title":"Accepted Candidates From the Interviews","titleSlug":"accepted-candidates-from-the-interviews","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2186,"frontendId":2062,"title":"Count Vowel Substrings of a String","titleSlug":"count-vowel-substrings-of-a-string","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":2187,"frontendId":2063,"title":"Vowels of All Substrings","titleSlug":"vowels-of-all-substrings","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string","dynamic-programming","combinatorics"]}
|
||
{"id":2188,"frontendId":2064,"title":"Minimized Maximum of Products Distributed to Any Store","titleSlug":"minimized-maximum-of-products-distributed-to-any-store","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","greedy"]}
|
||
{"id":2189,"frontendId":2065,"title":"Maximum Path Quality of a Graph","titleSlug":"maximum-path-quality-of-a-graph","difficulty":"HARD","paidOnly":false,"tags":["array","backtracking","graph"]}
|
||
{"id":2190,"frontendId":2085,"title":"Count Common Words With One Occurrence","titleSlug":"count-common-words-with-one-occurrence","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string","counting"]}
|
||
{"id":2191,"frontendId":2086,"title":"Minimum Number of Food Buckets to Feed the Hamsters","titleSlug":"minimum-number-of-food-buckets-to-feed-the-hamsters","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming","greedy"]}
|
||
{"id":2192,"frontendId":2087,"title":"Minimum Cost Homecoming of a Robot in a Grid","titleSlug":"minimum-cost-homecoming-of-a-robot-in-a-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":2193,"frontendId":2088,"title":"Count Fertile Pyramids in a Land","titleSlug":"count-fertile-pyramids-in-a-land","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":2194,"frontendId":2051,"title":"The Category of Each Member in the Store","titleSlug":"the-category-of-each-member-in-the-store","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2195,"frontendId":2073,"title":"Time Needed to Buy Tickets","titleSlug":"time-needed-to-buy-tickets","difficulty":"EASY","paidOnly":false,"tags":["array","queue","simulation"]}
|
||
{"id":2196,"frontendId":2074,"title":"Reverse Nodes in Even Length Groups","titleSlug":"reverse-nodes-in-even-length-groups","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list"]}
|
||
{"id":2197,"frontendId":2075,"title":"Decode the Slanted Ciphertext","titleSlug":"decode-the-slanted-ciphertext","difficulty":"MEDIUM","paidOnly":false,"tags":["string","simulation"]}
|
||
{"id":2198,"frontendId":2076,"title":"Process Restricted Friend Requests","titleSlug":"process-restricted-friend-requests","difficulty":"HARD","paidOnly":false,"tags":["union-find","graph"]}
|
||
{"id":2199,"frontendId":2078,"title":"Two Furthest Houses With Different Colors","titleSlug":"two-furthest-houses-with-different-colors","difficulty":"EASY","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":2200,"frontendId":2132,"title":"Stamping the Grid","titleSlug":"stamping-the-grid","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","matrix","prefix-sum"]}
|
||
{"id":2201,"frontendId":2097,"title":"Valid Arrangement of Pairs","titleSlug":"valid-arrangement-of-pairs","difficulty":"HARD","paidOnly":false,"tags":["array","depth-first-search","graph","eulerian-circuit"]}
|
||
{"id":2202,"frontendId":2081,"title":"Sum of k-Mirror Numbers","titleSlug":"sum-of-k-mirror-numbers","difficulty":"HARD","paidOnly":false,"tags":["math","enumeration"]}
|
||
{"id":2203,"frontendId":2061,"title":"Number of Spaces Cleaning Robot Cleaned","titleSlug":"number-of-spaces-cleaning-robot-cleaned","difficulty":"MEDIUM","paidOnly":true,"tags":["array","matrix","simulation"]}
|
||
{"id":2204,"frontendId":2099,"title":"Find Subsequence of Length K With the Largest Sum","titleSlug":"find-subsequence-of-length-k-with-the-largest-sum","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sorting","heap-priority-queue"]}
|
||
{"id":2205,"frontendId":2100,"title":"Find Good Days to Rob the Bank","titleSlug":"find-good-days-to-rob-the-bank","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","prefix-sum"]}
|
||
{"id":2206,"frontendId":2101,"title":"Detonate the Maximum Bombs","titleSlug":"detonate-the-maximum-bombs","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","depth-first-search","breadth-first-search","graph","geometry"]}
|
||
{"id":2207,"frontendId":2102,"title":"Sequentially Ordinal Rank Tracker","titleSlug":"sequentially-ordinal-rank-tracker","difficulty":"HARD","paidOnly":false,"tags":["design","heap-priority-queue","data-stream","ordered-set"]}
|
||
{"id":2208,"frontendId":2066,"title":"Account Balance","titleSlug":"account-balance","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2209,"frontendId":2067,"title":"Number of Equal Count Substrings","titleSlug":"number-of-equal-count-substrings","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","sliding-window","counting"]}
|
||
{"id":2210,"frontendId":2089,"title":"Find Target Indices After Sorting Array","titleSlug":"find-target-indices-after-sorting-array","difficulty":"EASY","paidOnly":false,"tags":["array","binary-search","sorting"]}
|
||
{"id":2211,"frontendId":2090,"title":"K Radius Subarray Averages","titleSlug":"k-radius-subarray-averages","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sliding-window"]}
|
||
{"id":2212,"frontendId":2091,"title":"Removing Minimum and Maximum From Array","titleSlug":"removing-minimum-and-maximum-from-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":2213,"frontendId":2092,"title":"Find All People With Secret","titleSlug":"find-all-people-with-secret","difficulty":"HARD","paidOnly":false,"tags":["depth-first-search","breadth-first-search","union-find","graph","sorting"]}
|
||
{"id":2214,"frontendId":2072,"title":"The Winner University","titleSlug":"the-winner-university","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":2215,"frontendId":2094,"title":"Finding 3-Digit Even Numbers","titleSlug":"finding-3-digit-even-numbers","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","recursion","sorting","enumeration"]}
|
||
{"id":2216,"frontendId":2095,"title":"Delete the Middle Node of a Linked List","titleSlug":"delete-the-middle-node-of-a-linked-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","two-pointers"]}
|
||
{"id":2217,"frontendId":2096,"title":"Step-By-Step Directions From a Binary Tree Node to Another","titleSlug":"step-by-step-directions-from-a-binary-tree-node-to-another","difficulty":"MEDIUM","paidOnly":false,"tags":["string","tree","depth-first-search","binary-tree"]}
|
||
{"id":2218,"frontendId":2077,"title":"Paths in Maze That Lead to Same Room","titleSlug":"paths-in-maze-that-lead-to-same-room","difficulty":"MEDIUM","paidOnly":true,"tags":["graph"]}
|
||
{"id":2219,"frontendId":2114,"title":"Maximum Number of Words Found in Sentences","titleSlug":"maximum-number-of-words-found-in-sentences","difficulty":"EASY","paidOnly":false,"tags":["array","string"]}
|
||
{"id":2220,"frontendId":2115,"title":"Find All Possible Recipes from Given Supplies","titleSlug":"find-all-possible-recipes-from-given-supplies","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","graph","topological-sort"]}
|
||
{"id":2221,"frontendId":2116,"title":"Check if a Parentheses String Can Be Valid","titleSlug":"check-if-a-parentheses-string-can-be-valid","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","greedy"]}
|
||
{"id":2222,"frontendId":2117,"title":"Abbreviating the Product of a Range","titleSlug":"abbreviating-the-product-of-a-range","difficulty":"HARD","paidOnly":false,"tags":["math","number-theory"]}
|
||
{"id":2223,"frontendId":2082,"title":"The Number of Rich Customers","titleSlug":"the-number-of-rich-customers","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":2224,"frontendId":2084,"title":"Drop Type 1 Orders for Customers With Type 0 Orders","titleSlug":"drop-type-1-orders-for-customers-with-type-0-orders","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2225,"frontendId":2083,"title":"Substrings That Begin and End With the Same Letter","titleSlug":"substrings-that-begin-and-end-with-the-same-letter","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","math","string","counting","prefix-sum"]}
|
||
{"id":2226,"frontendId":2103,"title":"Rings and Rods","titleSlug":"rings-and-rods","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":2227,"frontendId":2104,"title":"Sum of Subarray Ranges","titleSlug":"sum-of-subarray-ranges","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","monotonic-stack"]}
|
||
{"id":2228,"frontendId":2105,"title":"Watering Plants II","titleSlug":"watering-plants-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","simulation"]}
|
||
{"id":2229,"frontendId":2106,"title":"Maximum Fruits Harvested After at Most K Steps","titleSlug":"maximum-fruits-harvested-after-at-most-k-steps","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","sliding-window","prefix-sum"]}
|
||
{"id":2230,"frontendId":2093,"title":"Minimum Cost to Reach City With Discounts","titleSlug":"minimum-cost-to-reach-city-with-discounts","difficulty":"MEDIUM","paidOnly":true,"tags":["graph","heap-priority-queue","shortest-path"]}
|
||
{"id":2231,"frontendId":2108,"title":"Find First Palindromic String in the Array","titleSlug":"find-first-palindromic-string-in-the-array","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","string"]}
|
||
{"id":2232,"frontendId":2109,"title":"Adding Spaces to a String","titleSlug":"adding-spaces-to-a-string","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","string","simulation"]}
|
||
{"id":2233,"frontendId":2110,"title":"Number of Smooth Descent Periods of a Stock","titleSlug":"number-of-smooth-descent-periods-of-a-stock","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","two-pointers","dynamic-programming","sliding-window"]}
|
||
{"id":2234,"frontendId":2111,"title":"Minimum Operations to Make the Array K-Increasing","titleSlug":"minimum-operations-to-make-the-array-k-increasing","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":2235,"frontendId":2129,"title":"Capitalize the Title","titleSlug":"capitalize-the-title","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":2236,"frontendId":2130,"title":"Maximum Twin Sum of a Linked List","titleSlug":"maximum-twin-sum-of-a-linked-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","two-pointers","stack"]}
|
||
{"id":2237,"frontendId":2131,"title":"Longest Palindrome by Concatenating Two Letter Words","titleSlug":"longest-palindrome-by-concatenating-two-letter-words","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","greedy","counting"]}
|
||
{"id":2238,"frontendId":2119,"title":"A Number After a Double Reversal","titleSlug":"a-number-after-a-double-reversal","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":2239,"frontendId":2120,"title":"Execution of All Suffix Instructions Staying in a Grid","titleSlug":"execution-of-all-suffix-instructions-staying-in-a-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["string","simulation"]}
|
||
{"id":2240,"frontendId":2121,"title":"Intervals Between Identical Elements","titleSlug":"intervals-between-identical-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":2241,"frontendId":2122,"title":"Recover the Original Array","titleSlug":"recover-the-original-array","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","two-pointers","sorting","enumeration"]}
|
||
{"id":2242,"frontendId":2098,"title":"Subsequence of Size K With the Largest Even Sum","titleSlug":"subsequence-of-size-k-with-the-largest-even-sum","difficulty":"MEDIUM","paidOnly":true,"tags":["array","greedy","sorting"]}
|
||
{"id":2243,"frontendId":2124,"title":"Check if All A's Appears Before All B's","titleSlug":"check-if-all-as-appears-before-all-bs","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":2244,"frontendId":2125,"title":"Number of Laser Beams in a Bank","titleSlug":"number-of-laser-beams-in-a-bank","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","string","matrix"]}
|
||
{"id":2245,"frontendId":2126,"title":"Destroying Asteroids","titleSlug":"destroying-asteroids","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":2246,"frontendId":2127,"title":"Maximum Employees to Be Invited to a Meeting","titleSlug":"maximum-employees-to-be-invited-to-a-meeting","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","depth-first-search","graph","topological-sort"]}
|
||
{"id":2247,"frontendId":2107,"title":"Number of Unique Flavors After Sharing K Candies","titleSlug":"number-of-unique-flavors-after-sharing-k-candies","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","sliding-window"]}
|
||
{"id":2248,"frontendId":2144,"title":"Minimum Cost of Buying Candies With Discount","titleSlug":"minimum-cost-of-buying-candies-with-discount","difficulty":"EASY","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":2249,"frontendId":2145,"title":"Count the Hidden Sequences","titleSlug":"count-the-hidden-sequences","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":2250,"frontendId":2146,"title":"K Highest Ranked Items Within a Price Range","titleSlug":"k-highest-ranked-items-within-a-price-range","difficulty":"MEDIUM","paidOnly":false,"tags":["array","breadth-first-search","sorting","heap-priority-queue","matrix"]}
|
||
{"id":2251,"frontendId":2147,"title":"Number of Ways to Divide a Long Corridor","titleSlug":"number-of-ways-to-divide-a-long-corridor","difficulty":"HARD","paidOnly":false,"tags":["math","string","dynamic-programming"]}
|
||
{"id":2252,"frontendId":2112,"title":"The Airport With the Most Traffic","titleSlug":"the-airport-with-the-most-traffic","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2253,"frontendId":2118,"title":"Build the Equation","titleSlug":"build-the-equation","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2254,"frontendId":2133,"title":"Check if Every Row and Column Contains All Numbers","titleSlug":"check-if-every-row-and-column-contains-all-numbers","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","matrix"]}
|
||
{"id":2255,"frontendId":2134,"title":"Minimum Swaps to Group All 1's Together II","titleSlug":"minimum-swaps-to-group-all-1s-together-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sliding-window"]}
|
||
{"id":2256,"frontendId":2135,"title":"Count Words Obtained After Adding a Letter","titleSlug":"count-words-obtained-after-adding-a-letter","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","bit-manipulation","sorting"]}
|
||
{"id":2257,"frontendId":2136,"title":"Earliest Possible Day of Full Bloom","titleSlug":"earliest-possible-day-of-full-bloom","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":2258,"frontendId":2113,"title":"Elements in Array After Removing and Replacing Elements","titleSlug":"elements-in-array-after-removing-and-replacing-elements","difficulty":"MEDIUM","paidOnly":true,"tags":["array"]}
|
||
{"id":2259,"frontendId":2123,"title":"Minimum Operations to Remove Adjacent Ones in Matrix","titleSlug":"minimum-operations-to-remove-adjacent-ones-in-matrix","difficulty":"HARD","paidOnly":true,"tags":["array","graph","matrix"]}
|
||
{"id":2260,"frontendId":2138,"title":"Divide a String Into Groups of Size k","titleSlug":"divide-a-string-into-groups-of-size-k","difficulty":"EASY","paidOnly":false,"tags":["string","simulation"]}
|
||
{"id":2261,"frontendId":2155,"title":"All Divisions With the Highest Score of a Binary Array","titleSlug":"all-divisions-with-the-highest-score-of-a-binary-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array"]}
|
||
{"id":2262,"frontendId":2140,"title":"Solving Questions With Brainpower","titleSlug":"solving-questions-with-brainpower","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":2263,"frontendId":2141,"title":"Maximum Running Time of N Computers","titleSlug":"maximum-running-time-of-n-computers","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","greedy","sorting"]}
|
||
{"id":2264,"frontendId":2160,"title":"Minimum Sum of Four Digit Number After Splitting Digits","titleSlug":"minimum-sum-of-four-digit-number-after-splitting-digits","difficulty":"EASY","paidOnly":false,"tags":["math","greedy","sorting"]}
|
||
{"id":2265,"frontendId":2161,"title":"Partition Array According to Given Pivot","titleSlug":"partition-array-according-to-given-pivot","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","simulation"]}
|
||
{"id":2266,"frontendId":2162,"title":"Minimum Cost to Set Cooking Time","titleSlug":"minimum-cost-to-set-cooking-time","difficulty":"MEDIUM","paidOnly":false,"tags":["math","enumeration"]}
|
||
{"id":2267,"frontendId":2163,"title":"Minimum Difference in Sums After Removal of Elements","titleSlug":"minimum-difference-in-sums-after-removal-of-elements","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","heap-priority-queue"]}
|
||
{"id":2268,"frontendId":2128,"title":"Remove All Ones With Row and Column Flips","titleSlug":"remove-all-ones-with-row-and-column-flips","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","bit-manipulation","matrix"]}
|
||
{"id":2269,"frontendId":2148,"title":"Count Elements With Strictly Smaller and Greater Elements ","titleSlug":"count-elements-with-strictly-smaller-and-greater-elements","difficulty":"EASY","paidOnly":false,"tags":["array","sorting","counting"]}
|
||
{"id":2270,"frontendId":2150,"title":"Find All Lonely Numbers in the Array","titleSlug":"find-all-lonely-numbers-in-the-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":2271,"frontendId":2149,"title":"Rearrange Array Elements by Sign","titleSlug":"rearrange-array-elements-by-sign","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","simulation"]}
|
||
{"id":2272,"frontendId":2151,"title":"Maximum Good People Based on Statements","titleSlug":"maximum-good-people-based-on-statements","difficulty":"HARD","paidOnly":false,"tags":["array","backtracking","bit-manipulation","enumeration"]}
|
||
{"id":2273,"frontendId":2137,"title":"Pour Water Between Buckets to Make Water Levels Equal","titleSlug":"pour-water-between-buckets-to-make-water-levels-equal","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search"]}
|
||
{"id":2274,"frontendId":2154,"title":"Keep Multiplying Found Values by Two","titleSlug":"keep-multiplying-found-values-by-two","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sorting","simulation"]}
|
||
{"id":2275,"frontendId":2156,"title":"Find Substring With Given Hash Value","titleSlug":"find-substring-with-given-hash-value","difficulty":"HARD","paidOnly":false,"tags":["string","sliding-window","rolling-hash","hash-function"]}
|
||
{"id":2276,"frontendId":2157,"title":"Groups of Strings","titleSlug":"groups-of-strings","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","string","bit-manipulation","union-find"]}
|
||
{"id":2277,"frontendId":2176,"title":"Count Equal and Divisible Pairs in an Array","titleSlug":"count-equal-and-divisible-pairs-in-an-array","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":2278,"frontendId":2177,"title":"Find Three Consecutive Integers That Sum to a Given Number","titleSlug":"find-three-consecutive-integers-that-sum-to-a-given-number","difficulty":"MEDIUM","paidOnly":false,"tags":["math","simulation"]}
|
||
{"id":2279,"frontendId":2178,"title":"Maximum Split of Positive Even Integers","titleSlug":"maximum-split-of-positive-even-integers","difficulty":"MEDIUM","paidOnly":false,"tags":["math","backtracking","greedy"]}
|
||
{"id":2280,"frontendId":2179,"title":"Count Good Triplets in an Array","titleSlug":"count-good-triplets-in-an-array","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","divide-and-conquer","binary-indexed-tree","segment-tree","merge-sort","ordered-set"]}
|
||
{"id":2281,"frontendId":2142,"title":"The Number of Passengers in Each Bus I","titleSlug":"the-number-of-passengers-in-each-bus-i","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2282,"frontendId":2143,"title":"Choose Numbers From Two Arrays in Range","titleSlug":"choose-numbers-from-two-arrays-in-range","difficulty":"HARD","paidOnly":true,"tags":["array","dynamic-programming"]}
|
||
{"id":2283,"frontendId":2164,"title":"Sort Even and Odd Indices Independently","titleSlug":"sort-even-and-odd-indices-independently","difficulty":"EASY","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":2284,"frontendId":2165,"title":"Smallest Value of the Rearranged Number","titleSlug":"smallest-value-of-the-rearranged-number","difficulty":"MEDIUM","paidOnly":false,"tags":["math","sorting"]}
|
||
{"id":2285,"frontendId":2166,"title":"Design Bitset","titleSlug":"design-bitset","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","design"]}
|
||
{"id":2286,"frontendId":2167,"title":"Minimum Time to Remove All Cars Containing Illegal Goods","titleSlug":"minimum-time-to-remove-all-cars-containing-illegal-goods","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":2287,"frontendId":2152,"title":"Minimum Number of Lines to Cover Points","titleSlug":"minimum-number-of-lines-to-cover-points","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","math","dynamic-programming","backtracking","bit-manipulation","geometry","bitmask"]}
|
||
{"id":2288,"frontendId":2169,"title":"Count Operations to Obtain Zero","titleSlug":"count-operations-to-obtain-zero","difficulty":"EASY","paidOnly":false,"tags":["math","simulation"]}
|
||
{"id":2289,"frontendId":2170,"title":"Minimum Operations to Make the Array Alternating","titleSlug":"minimum-operations-to-make-the-array-alternating","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","counting"]}
|
||
{"id":2290,"frontendId":2171,"title":"Removing Minimum Number of Magic Beans","titleSlug":"removing-minimum-number-of-magic-beans","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting","enumeration","prefix-sum"]}
|
||
{"id":2291,"frontendId":2172,"title":"Maximum AND Sum of Array","titleSlug":"maximum-and-sum-of-array","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","bitmask"]}
|
||
{"id":2292,"frontendId":2185,"title":"Counting Words With a Given Prefix","titleSlug":"counting-words-with-a-given-prefix","difficulty":"EASY","paidOnly":false,"tags":["array","string","string-matching"]}
|
||
{"id":2293,"frontendId":2186,"title":"Minimum Number of Steps to Make Two Strings Anagram II","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":2294,"frontendId":2187,"title":"Minimum Time to Complete Trips","titleSlug":"minimum-time-to-complete-trips","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":2295,"frontendId":2188,"title":"Minimum Time to Finish the Race","titleSlug":"minimum-time-to-finish-the-race","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":2296,"frontendId":2153,"title":"The Number of Passengers in Each Bus II","titleSlug":"the-number-of-passengers-in-each-bus-ii","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2297,"frontendId":2158,"title":"Amount of New Area Painted Each Day","titleSlug":"amount-of-new-area-painted-each-day","difficulty":"HARD","paidOnly":true,"tags":["array","segment-tree","ordered-set"]}
|
||
{"id":2298,"frontendId":2180,"title":"Count Integers With Even Digit Sum","titleSlug":"count-integers-with-even-digit-sum","difficulty":"EASY","paidOnly":false,"tags":["math","simulation"]}
|
||
{"id":2299,"frontendId":2181,"title":"Merge Nodes in Between Zeros","titleSlug":"merge-nodes-in-between-zeros","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","simulation"]}
|
||
{"id":2300,"frontendId":2182,"title":"Construct String With Repeat Limit","titleSlug":"construct-string-with-repeat-limit","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","greedy","heap-priority-queue","counting"]}
|
||
{"id":2301,"frontendId":2183,"title":"Count Array Pairs Divisible by K","titleSlug":"count-array-pairs-divisible-by-k","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","counting","number-theory"]}
|
||
{"id":2302,"frontendId":2159,"title":"Order Two Columns Independently","titleSlug":"order-two-columns-independently","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2303,"frontendId":2168,"title":"Unique Substrings With Equal Digit Frequency","titleSlug":"unique-substrings-with-equal-digit-frequency","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","rolling-hash","counting","hash-function"]}
|
||
{"id":2304,"frontendId":2194,"title":"Cells in a Range on an Excel Sheet","titleSlug":"cells-in-a-range-on-an-excel-sheet","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":2305,"frontendId":2195,"title":"Append K Integers With Minimal Sum","titleSlug":"append-k-integers-with-minimal-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","greedy","sorting"]}
|
||
{"id":2306,"frontendId":2196,"title":"Create Binary Tree From Descriptions","titleSlug":"create-binary-tree-from-descriptions","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","tree","binary-tree"]}
|
||
{"id":2307,"frontendId":2197,"title":"Replace Non-Coprime Numbers in Array","titleSlug":"replace-non-coprime-numbers-in-array","difficulty":"HARD","paidOnly":false,"tags":["array","math","stack","number-theory"]}
|
||
{"id":2308,"frontendId":2206,"title":"Divide Array Into Equal Pairs","titleSlug":"divide-array-into-equal-pairs","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","bit-manipulation","counting"]}
|
||
{"id":2309,"frontendId":2207,"title":"Maximize Number of Subsequences in a String","titleSlug":"maximize-number-of-subsequences-in-a-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy","prefix-sum"]}
|
||
{"id":2310,"frontendId":2208,"title":"Minimum Operations to Halve Array Sum","titleSlug":"minimum-operations-to-halve-array-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","heap-priority-queue"]}
|
||
{"id":2311,"frontendId":2209,"title":"Minimum White Tiles After Covering With Carpets","titleSlug":"minimum-white-tiles-after-covering-with-carpets","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming","prefix-sum"]}
|
||
{"id":2312,"frontendId":2190,"title":"Most Frequent Number Following Key In an Array","titleSlug":"most-frequent-number-following-key-in-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":2313,"frontendId":2173,"title":"Longest Winning Streak","titleSlug":"longest-winning-streak","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2314,"frontendId":2174,"title":"Remove All Ones With Row and Column Flips II","titleSlug":"remove-all-ones-with-row-and-column-flips-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","bit-manipulation","breadth-first-search","matrix"]}
|
||
{"id":2315,"frontendId":2175,"title":"The Change in Global Rankings","titleSlug":"the-change-in-global-rankings","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2316,"frontendId":2210,"title":"Count Hills and Valleys in an Array","titleSlug":"count-hills-and-valleys-in-an-array","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":2317,"frontendId":2211,"title":"Count Collisions on a Road","titleSlug":"count-collisions-on-a-road","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","simulation"]}
|
||
{"id":2318,"frontendId":2212,"title":"Maximum Points in an Archery Competition","titleSlug":"maximum-points-in-an-archery-competition","difficulty":"MEDIUM","paidOnly":false,"tags":["array","backtracking","bit-manipulation","enumeration"]}
|
||
{"id":2319,"frontendId":2213,"title":"Longest Substring of One Repeating Character","titleSlug":"longest-substring-of-one-repeating-character","difficulty":"HARD","paidOnly":false,"tags":["array","string","segment-tree","ordered-set"]}
|
||
{"id":2320,"frontendId":2200,"title":"Find All K-Distant Indices in an Array","titleSlug":"find-all-k-distant-indices-in-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers"]}
|
||
{"id":2321,"frontendId":2203,"title":"Minimum Weighted Subgraph With the Required Paths","titleSlug":"minimum-weighted-subgraph-with-the-required-paths","difficulty":"HARD","paidOnly":false,"tags":["graph","heap-priority-queue","shortest-path"]}
|
||
{"id":2322,"frontendId":2184,"title":"Number of Ways to Build Sturdy Brick Wall","titleSlug":"number-of-ways-to-build-sturdy-brick-wall","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming","bit-manipulation","bitmask"]}
|
||
{"id":2323,"frontendId":2220,"title":"Minimum Bit Flips to Convert Number","titleSlug":"minimum-bit-flips-to-convert-number","difficulty":"EASY","paidOnly":false,"tags":["bit-manipulation"]}
|
||
{"id":2324,"frontendId":2221,"title":"Find Triangular Sum of an Array","titleSlug":"find-triangular-sum-of-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","simulation","combinatorics","number-theory"]}
|
||
{"id":2325,"frontendId":2222,"title":"Number of Ways to Select Buildings","titleSlug":"number-of-ways-to-select-buildings","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming","prefix-sum"]}
|
||
{"id":2326,"frontendId":2223,"title":"Sum of Scores of Built Strings","titleSlug":"sum-of-scores-of-built-strings","difficulty":"HARD","paidOnly":false,"tags":["string","binary-search","rolling-hash","suffix-array","string-matching","hash-function"]}
|
||
{"id":2327,"frontendId":2231,"title":"Largest Number After Digit Swaps by Parity","titleSlug":"largest-number-after-digit-swaps-by-parity","difficulty":"EASY","paidOnly":false,"tags":["sorting","heap-priority-queue"]}
|
||
{"id":2328,"frontendId":2232,"title":"Minimize Result by Adding Parentheses to Expression","titleSlug":"minimize-result-by-adding-parentheses-to-expression","difficulty":"MEDIUM","paidOnly":false,"tags":["string","enumeration"]}
|
||
{"id":2329,"frontendId":2233,"title":"Maximum Product After K Increments","titleSlug":"maximum-product-after-k-increments","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","heap-priority-queue"]}
|
||
{"id":2330,"frontendId":2234,"title":"Maximum Total Beauty of the Gardens","titleSlug":"maximum-total-beauty-of-the-gardens","difficulty":"HARD","paidOnly":false,"tags":["array","two-pointers","binary-search","greedy","sorting","enumeration","prefix-sum"]}
|
||
{"id":2331,"frontendId":2248,"title":"Intersection of Multiple Arrays","titleSlug":"intersection-of-multiple-arrays","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sorting","counting"]}
|
||
{"id":2332,"frontendId":2249,"title":"Count Lattice Points Inside a Circle","titleSlug":"count-lattice-points-inside-a-circle","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","geometry","enumeration"]}
|
||
{"id":2333,"frontendId":2250,"title":"Count Number of Rectangles Containing Each Point","titleSlug":"count-number-of-rectangles-containing-each-point","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","binary-search","binary-indexed-tree","sorting"]}
|
||
{"id":2334,"frontendId":2251,"title":"Number of Flowers in Full Bloom","titleSlug":"number-of-flowers-in-full-bloom","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","binary-search","sorting","prefix-sum","ordered-set"]}
|
||
{"id":2335,"frontendId":2199,"title":"Finding the Topic of Each Post","titleSlug":"finding-the-topic-of-each-post","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2336,"frontendId":2205,"title":"The Number of Users That Are Eligible for Discount","titleSlug":"the-number-of-users-that-are-eligible-for-discount","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":2337,"frontendId":2259,"title":"Remove Digit From Number to Maximize Result","titleSlug":"remove-digit-from-number-to-maximize-result","difficulty":"EASY","paidOnly":false,"tags":["string","greedy","enumeration"]}
|
||
{"id":2338,"frontendId":2260,"title":"Minimum Consecutive Cards to Pick Up","titleSlug":"minimum-consecutive-cards-to-pick-up","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sliding-window"]}
|
||
{"id":2339,"frontendId":2261,"title":"K Divisible Elements Subarrays","titleSlug":"k-divisible-elements-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","trie","rolling-hash","hash-function","enumeration"]}
|
||
{"id":2340,"frontendId":2262,"title":"Total Appeal of A String","titleSlug":"total-appeal-of-a-string","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","dynamic-programming"]}
|
||
{"id":2341,"frontendId":2255,"title":"Count Prefixes of a Given String","titleSlug":"count-prefixes-of-a-given-string","difficulty":"EASY","paidOnly":false,"tags":["array","string"]}
|
||
{"id":2342,"frontendId":2256,"title":"Minimum Average Difference","titleSlug":"minimum-average-difference","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":2343,"frontendId":2257,"title":"Count Unguarded Cells in the Grid","titleSlug":"count-unguarded-cells-in-the-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","simulation"]}
|
||
{"id":2344,"frontendId":2258,"title":"Escape the Spreading Fire","titleSlug":"escape-the-spreading-fire","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","breadth-first-search","matrix"]}
|
||
{"id":2345,"frontendId":2224,"title":"Minimum Number of Operations to Convert Time","titleSlug":"minimum-number-of-operations-to-convert-time","difficulty":"EASY","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":2346,"frontendId":2264,"title":"Largest 3-Same-Digit Number in String","titleSlug":"largest-3-same-digit-number-in-string","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":2347,"frontendId":2265,"title":"Count Nodes Equal to Average of Subtree","titleSlug":"count-nodes-equal-to-average-of-subtree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":2348,"frontendId":2266,"title":"Count Number of Texts","titleSlug":"count-number-of-texts","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","math","string","dynamic-programming"]}
|
||
{"id":2349,"frontendId":2267,"title":" Check if There Is a Valid Parentheses String Path","titleSlug":"check-if-there-is-a-valid-parentheses-string-path","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":2350,"frontendId":2239,"title":"Find Closest Number to Zero","titleSlug":"find-closest-number-to-zero","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":2351,"frontendId":2240,"title":"Number of Ways to Buy Pens and Pencils","titleSlug":"number-of-ways-to-buy-pens-and-pencils","difficulty":"MEDIUM","paidOnly":false,"tags":["math","enumeration"]}
|
||
{"id":2352,"frontendId":2241,"title":"Design an ATM Machine","titleSlug":"design-an-atm-machine","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","design"]}
|
||
{"id":2353,"frontendId":2242,"title":"Maximum Score of a Node Sequence","titleSlug":"maximum-score-of-a-node-sequence","difficulty":"HARD","paidOnly":false,"tags":["array","graph","sorting","enumeration"]}
|
||
{"id":2354,"frontendId":2214,"title":"Minimum Health to Beat Game","titleSlug":"minimum-health-to-beat-game","difficulty":"MEDIUM","paidOnly":true,"tags":["array","greedy"]}
|
||
{"id":2355,"frontendId":2274,"title":"Maximum Consecutive Floors Without Special Floors","titleSlug":"maximum-consecutive-floors-without-special-floors","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":2356,"frontendId":2275,"title":"Largest Combination With Bitwise AND Greater Than Zero","titleSlug":"largest-combination-with-bitwise-and-greater-than-zero","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","bit-manipulation","counting"]}
|
||
{"id":2357,"frontendId":2276,"title":"Count Integers in Intervals","titleSlug":"count-integers-in-intervals","difficulty":"HARD","paidOnly":false,"tags":["design","segment-tree","ordered-set"]}
|
||
{"id":2358,"frontendId":2270,"title":"Number of Ways to Split Array","titleSlug":"number-of-ways-to-split-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":2359,"frontendId":2271,"title":"Maximum White Tiles Covered by a Carpet","titleSlug":"maximum-white-tiles-covered-by-a-carpet","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","greedy","sliding-window","sorting","prefix-sum"]}
|
||
{"id":2360,"frontendId":2272,"title":"Substring With Largest Variance","titleSlug":"substring-with-largest-variance","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","dynamic-programming","enumeration"]}
|
||
{"id":2361,"frontendId":2243,"title":"Calculate Digit Sum of a String","titleSlug":"calculate-digit-sum-of-a-string","difficulty":"EASY","paidOnly":false,"tags":["string","simulation"]}
|
||
{"id":2362,"frontendId":2244,"title":"Minimum Rounds to Complete All Tasks","titleSlug":"minimum-rounds-to-complete-all-tasks","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","counting"]}
|
||
{"id":2363,"frontendId":2245,"title":"Maximum Trailing Zeros in a Cornered Path","titleSlug":"maximum-trailing-zeros-in-a-cornered-path","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","prefix-sum"]}
|
||
{"id":2364,"frontendId":2246,"title":"Longest Path With Different Adjacent Characters","titleSlug":"longest-path-with-different-adjacent-characters","difficulty":"HARD","paidOnly":false,"tags":["array","string","tree","depth-first-search","graph","topological-sort"]}
|
||
{"id":2365,"frontendId":2278,"title":"Percentage of Letter in String","titleSlug":"percentage-of-letter-in-string","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":2366,"frontendId":2279,"title":"Maximum Bags With Full Capacity of Rocks","titleSlug":"maximum-bags-with-full-capacity-of-rocks","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":2367,"frontendId":2280,"title":"Minimum Lines to Represent a Line Chart","titleSlug":"minimum-lines-to-represent-a-line-chart","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","geometry","sorting","number-theory"]}
|
||
{"id":2368,"frontendId":2281,"title":"Sum of Total Strength of Wizards","titleSlug":"sum-of-total-strength-of-wizards","difficulty":"HARD","paidOnly":false,"tags":["array","stack","monotonic-stack","prefix-sum"]}
|
||
{"id":2369,"frontendId":2219,"title":"Maximum Sum Score of Array","titleSlug":"maximum-sum-score-of-array","difficulty":"MEDIUM","paidOnly":true,"tags":["array","prefix-sum"]}
|
||
{"id":2370,"frontendId":2228,"title":"Users With Two Purchases Within Seven Days","titleSlug":"users-with-two-purchases-within-seven-days","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2371,"frontendId":2230,"title":"The Users That Are Eligible for Discount","titleSlug":"the-users-that-are-eligible-for-discount","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":2372,"frontendId":2287,"title":"Rearrange Characters to Make Target String","titleSlug":"rearrange-characters-to-make-target-string","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":2373,"frontendId":2288,"title":"Apply Discount to Prices","titleSlug":"apply-discount-to-prices","difficulty":"MEDIUM","paidOnly":false,"tags":["string"]}
|
||
{"id":2374,"frontendId":2289,"title":"Steps to Make Array Non-decreasing","titleSlug":"steps-to-make-array-non-decreasing","difficulty":"MEDIUM","paidOnly":false,"tags":["array","linked-list","dynamic-programming","stack","monotonic-stack","simulation"]}
|
||
{"id":2375,"frontendId":2290,"title":"Minimum Obstacle Removal to Reach Corner","titleSlug":"minimum-obstacle-removal-to-reach-corner","difficulty":"HARD","paidOnly":false,"tags":["array","breadth-first-search","graph","heap-priority-queue","matrix","shortest-path"]}
|
||
{"id":2376,"frontendId":2238,"title":"Number of Times a Driver Was a Passenger","titleSlug":"number-of-times-a-driver-was-a-passenger","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2377,"frontendId":2283,"title":"Check if Number Has Equal Digit Count and Digit Value","titleSlug":"check-if-number-has-equal-digit-count-and-digit-value","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":2378,"frontendId":2284,"title":"Sender With Largest Word Count","titleSlug":"sender-with-largest-word-count","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","counting"]}
|
||
{"id":2379,"frontendId":2285,"title":"Maximum Total Importance of Roads","titleSlug":"maximum-total-importance-of-roads","difficulty":"MEDIUM","paidOnly":false,"tags":["greedy","graph","sorting","heap-priority-queue"]}
|
||
{"id":2380,"frontendId":2286,"title":"Booking Concert Tickets in Groups","titleSlug":"booking-concert-tickets-in-groups","difficulty":"HARD","paidOnly":false,"tags":["binary-search","design","binary-indexed-tree","segment-tree"]}
|
||
{"id":2381,"frontendId":2252,"title":"Dynamic Pivoting of a Table","titleSlug":"dynamic-pivoting-of-a-table","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2382,"frontendId":2253,"title":"Dynamic Unpivoting of a Table","titleSlug":"dynamic-unpivoting-of-a-table","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2383,"frontendId":2235,"title":"Add Two Integers","titleSlug":"add-two-integers","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":2384,"frontendId":2236,"title":"Root Equals Sum of Children","titleSlug":"root-equals-sum-of-children","difficulty":"EASY","paidOnly":false,"tags":["tree","binary-tree"]}
|
||
{"id":2385,"frontendId":2237,"title":"Count Positions on Street With Required Brightness","titleSlug":"count-positions-on-street-with-required-brightness","difficulty":"MEDIUM","paidOnly":true,"tags":["array","prefix-sum"]}
|
||
{"id":2386,"frontendId":2293,"title":"Min Max Game","titleSlug":"min-max-game","difficulty":"EASY","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":2387,"frontendId":2294,"title":"Partition Array Such That Maximum Difference Is K","titleSlug":"partition-array-such-that-maximum-difference-is-k","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":2388,"frontendId":2295,"title":"Replace Elements in an Array","titleSlug":"replace-elements-in-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","simulation"]}
|
||
{"id":2389,"frontendId":2296,"title":"Design a Text Editor","titleSlug":"design-a-text-editor","difficulty":"HARD","paidOnly":false,"tags":["linked-list","string","stack","design","simulation","doubly-linked-list"]}
|
||
{"id":2390,"frontendId":2306,"title":"Naming a Company","titleSlug":"naming-a-company","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","string","bit-manipulation","enumeration"]}
|
||
{"id":2391,"frontendId":2299,"title":"Strong Password Checker II","titleSlug":"strong-password-checker-ii","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":2392,"frontendId":2300,"title":"Successful Pairs of Spells and Potions","titleSlug":"successful-pairs-of-spells-and-potions","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","sorting"]}
|
||
{"id":2393,"frontendId":2301,"title":"Match Substring After Replacement","titleSlug":"match-substring-after-replacement","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","string","string-matching"]}
|
||
{"id":2394,"frontendId":2302,"title":"Count Subarrays With Score Less Than K","titleSlug":"count-subarrays-with-score-less-than-k","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","sliding-window","prefix-sum"]}
|
||
{"id":2395,"frontendId":2311,"title":"Longest Binary Subsequence Less Than or Equal to K","titleSlug":"longest-binary-subsequence-less-than-or-equal-to-k","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming","greedy","memoization"]}
|
||
{"id":2396,"frontendId":2254,"title":"Design Video Sharing Platform","titleSlug":"design-video-sharing-platform","difficulty":"HARD","paidOnly":true,"tags":["hash-table","design","heap-priority-queue"]}
|
||
{"id":2397,"frontendId":2320,"title":"Count Number of Ways to Place Houses","titleSlug":"count-number-of-ways-to-place-houses","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":2398,"frontendId":2319,"title":"Check if Matrix Is X-Matrix","titleSlug":"check-if-matrix-is-x-matrix","difficulty":"EASY","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":2399,"frontendId":2313,"title":"Minimum Flips in Binary Tree to Get Result","titleSlug":"minimum-flips-in-binary-tree-to-get-result","difficulty":"HARD","paidOnly":true,"tags":["dynamic-programming","tree","depth-first-search","binary-tree"]}
|
||
{"id":2400,"frontendId":2322,"title":"Minimum Score After Removals on a Tree","titleSlug":"minimum-score-after-removals-on-a-tree","difficulty":"HARD","paidOnly":false,"tags":["array","bit-manipulation","tree","depth-first-search"]}
|
||
{"id":2401,"frontendId":2315,"title":"Count Asterisks","titleSlug":"count-asterisks","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":2402,"frontendId":2317,"title":"Maximum XOR After Operations ","titleSlug":"maximum-xor-after-operations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","bit-manipulation"]}
|
||
{"id":2403,"frontendId":2316,"title":"Count Unreachable Pairs of Nodes in an Undirected Graph","titleSlug":"count-unreachable-pairs-of-nodes-in-an-undirected-graph","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":2404,"frontendId":2318,"title":"Number of Distinct Roll Sequences","titleSlug":"number-of-distinct-roll-sequences","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","memoization"]}
|
||
{"id":2405,"frontendId":2268,"title":"Minimum Number of Keypresses","titleSlug":"minimum-number-of-keypresses","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","greedy","sorting","counting"]}
|
||
{"id":2406,"frontendId":2325,"title":"Decode the Message","titleSlug":"decode-the-message","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":2408,"frontendId":2327,"title":"Number of People Aware of a Secret","titleSlug":"number-of-people-aware-of-a-secret","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming","queue","simulation"]}
|
||
{"id":2409,"frontendId":2328,"title":"Number of Increasing Paths in a Grid","titleSlug":"number-of-increasing-paths-in-a-grid","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","depth-first-search","breadth-first-search","graph","topological-sort","memoization","matrix"]}
|
||
{"id":2411,"frontendId":2326,"title":"Spiral Matrix IV","titleSlug":"spiral-matrix-iv","difficulty":"MEDIUM","paidOnly":false,"tags":["array","linked-list","matrix","simulation"]}
|
||
{"id":2412,"frontendId":2335,"title":"Minimum Amount of Time to Fill Cups","titleSlug":"minimum-amount-of-time-to-fill-cups","difficulty":"EASY","paidOnly":false,"tags":["array","greedy","sorting","heap-priority-queue"]}
|
||
{"id":2413,"frontendId":2336,"title":"Smallest Number in Infinite Set","titleSlug":"smallest-number-in-infinite-set","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","design","heap-priority-queue","ordered-set"]}
|
||
{"id":2414,"frontendId":2337,"title":"Move Pieces to Obtain a String","titleSlug":"move-pieces-to-obtain-a-string","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":2415,"frontendId":2338,"title":"Count the Number of Ideal Arrays","titleSlug":"count-the-number-of-ideal-arrays","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming","combinatorics","number-theory"]}
|
||
{"id":2416,"frontendId":2331,"title":"Evaluate Boolean Binary Tree","titleSlug":"evaluate-boolean-binary-tree","difficulty":"EASY","paidOnly":false,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":2417,"frontendId":2332,"title":"The Latest Time to Catch a Bus","titleSlug":"the-latest-time-to-catch-a-bus","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","sorting"]}
|
||
{"id":2418,"frontendId":2333,"title":"Minimum Sum of Squared Difference","titleSlug":"minimum-sum-of-squared-difference","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","greedy","sorting","heap-priority-queue"]}
|
||
{"id":2419,"frontendId":2334,"title":"Subarray With Elements Greater Than Varying Threshold","titleSlug":"subarray-with-elements-greater-than-varying-threshold","difficulty":"HARD","paidOnly":false,"tags":["array","stack","union-find","monotonic-stack"]}
|
||
{"id":2420,"frontendId":2277,"title":"Closest Node to Path in Tree","titleSlug":"closest-node-to-path-in-tree","difficulty":"HARD","paidOnly":true,"tags":["array","tree","depth-first-search","breadth-first-search"]}
|
||
{"id":2421,"frontendId":2341,"title":"Maximum Number of Pairs in Array","titleSlug":"maximum-number-of-pairs-in-array","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":2422,"frontendId":2343,"title":"Query Kth Smallest Trimmed Number","titleSlug":"query-kth-smallest-trimmed-number","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","divide-and-conquer","sorting","heap-priority-queue","radix-sort","quickselect"]}
|
||
{"id":2423,"frontendId":2344,"title":"Minimum Deletions to Make Array Divisible","titleSlug":"minimum-deletions-to-make-array-divisible","difficulty":"HARD","paidOnly":false,"tags":["array","math","sorting","heap-priority-queue","number-theory"]}
|
||
{"id":2425,"frontendId":2282,"title":"Number of People That Can Be Seen in a Grid","titleSlug":"number-of-people-that-can-be-seen-in-a-grid","difficulty":"MEDIUM","paidOnly":true,"tags":["array","stack","matrix","monotonic-stack"]}
|
||
{"id":2426,"frontendId":2291,"title":"Maximum Profit From Trading Stocks","titleSlug":"maximum-profit-from-trading-stocks","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming"]}
|
||
{"id":2427,"frontendId":2351,"title":"First Letter to Appear Twice","titleSlug":"first-letter-to-appear-twice","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","bit-manipulation","counting"]}
|
||
{"id":2428,"frontendId":2352,"title":"Equal Row and Column Pairs","titleSlug":"equal-row-and-column-pairs","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","matrix","simulation"]}
|
||
{"id":2429,"frontendId":2353,"title":"Design a Food Rating System","titleSlug":"design-a-food-rating-system","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","design","heap-priority-queue","ordered-set"]}
|
||
{"id":2430,"frontendId":2354,"title":"Number of Excellent Pairs","titleSlug":"number-of-excellent-pairs","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","binary-search","bit-manipulation"]}
|
||
{"id":2431,"frontendId":2292,"title":"Products With Three or More Orders in Two Consecutive Years","titleSlug":"products-with-three-or-more-orders-in-two-consecutive-years","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2432,"frontendId":2348,"title":"Number of Zero-Filled Subarrays","titleSlug":"number-of-zero-filled-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math"]}
|
||
{"id":2433,"frontendId":2347,"title":"Best Poker Hand","titleSlug":"best-poker-hand","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":2434,"frontendId":2349,"title":"Design a Number Container System","titleSlug":"design-a-number-container-system","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","design","heap-priority-queue","ordered-set"]}
|
||
{"id":2435,"frontendId":2350,"title":"Shortest Impossible Sequence of Rolls","titleSlug":"shortest-impossible-sequence-of-rolls","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","greedy"]}
|
||
{"id":2436,"frontendId":2357,"title":"Make Array Zero by Subtracting Equal Amounts","titleSlug":"make-array-zero-by-subtracting-equal-amounts","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","greedy","sorting","heap-priority-queue","simulation"]}
|
||
{"id":2437,"frontendId":2358,"title":"Maximum Number of Groups Entering a Competition","titleSlug":"maximum-number-of-groups-entering-a-competition","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","binary-search","greedy"]}
|
||
{"id":2438,"frontendId":2359,"title":"Find Closest Node to Given Two Nodes","titleSlug":"find-closest-node-to-given-two-nodes","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","graph"]}
|
||
{"id":2439,"frontendId":2360,"title":"Longest Cycle in a Graph","titleSlug":"longest-cycle-in-a-graph","difficulty":"HARD","paidOnly":false,"tags":["depth-first-search","breadth-first-search","graph","topological-sort"]}
|
||
{"id":2440,"frontendId":2298,"title":"Tasks Count in the Weekend","titleSlug":"tasks-count-in-the-weekend","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2441,"frontendId":2308,"title":"Arrange Table by Gender","titleSlug":"arrange-table-by-gender","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2442,"frontendId":2367,"title":"Number of Arithmetic Triplets","titleSlug":"number-of-arithmetic-triplets","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","two-pointers","enumeration"]}
|
||
{"id":2443,"frontendId":2369,"title":"Check if There is a Valid Partition For The Array","titleSlug":"check-if-there-is-a-valid-partition-for-the-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":2444,"frontendId":2370,"title":"Longest Ideal Subsequence","titleSlug":"longest-ideal-subsequence","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","dynamic-programming"]}
|
||
{"id":2445,"frontendId":2368,"title":"Reachable Nodes With Restrictions","titleSlug":"reachable-nodes-with-restrictions","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","tree","depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":2446,"frontendId":2314,"title":"The First Day of the Maximum Recorded Degree in Each City","titleSlug":"the-first-day-of-the-maximum-recorded-degree-in-each-city","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2447,"frontendId":2363,"title":"Merge Similar Items","titleSlug":"merge-similar-items","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sorting","ordered-set"]}
|
||
{"id":2448,"frontendId":2364,"title":"Count Number of Bad Pairs","titleSlug":"count-number-of-bad-pairs","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","counting"]}
|
||
{"id":2449,"frontendId":2398,"title":"Maximum Number of Robots Within Budget","titleSlug":"maximum-number-of-robots-within-budget","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","queue","sliding-window","heap-priority-queue","prefix-sum","monotonic-queue"]}
|
||
{"id":2450,"frontendId":2366,"title":"Minimum Replacements to Sort the Array","titleSlug":"minimum-replacements-to-sort-the-array","difficulty":"HARD","paidOnly":false,"tags":["array","math","greedy"]}
|
||
{"id":2451,"frontendId":2324,"title":"Product Sales Analysis IV","titleSlug":"product-sales-analysis-iv","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2452,"frontendId":2329,"title":"Product Sales Analysis V","titleSlug":"product-sales-analysis-v","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":2453,"frontendId":2339,"title":"All the Matches of the League","titleSlug":"all-the-matches-of-the-league","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":2454,"frontendId":2373,"title":"Largest Local Values in a Matrix","titleSlug":"largest-local-values-in-a-matrix","difficulty":"EASY","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":2455,"frontendId":2374,"title":"Node With Highest Edge Score","titleSlug":"node-with-highest-edge-score","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","graph"]}
|
||
{"id":2456,"frontendId":2375,"title":"Construct Smallest Number From DI String","titleSlug":"construct-smallest-number-from-di-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","backtracking","stack","greedy"]}
|
||
{"id":2457,"frontendId":2376,"title":"Count Special Integers","titleSlug":"count-special-integers","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming"]}
|
||
{"id":2458,"frontendId":2323,"title":"Find Minimum Time to Finish All Jobs II","titleSlug":"find-minimum-time-to-finish-all-jobs-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","greedy","sorting"]}
|
||
{"id":2459,"frontendId":2383,"title":"Minimum Hours of Training to Win a Competition","titleSlug":"minimum-hours-of-training-to-win-a-competition","difficulty":"EASY","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":2461,"frontendId":2385,"title":"Amount of Time for Binary Tree to Be Infected","titleSlug":"amount-of-time-for-binary-tree-to-be-infected","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":2462,"frontendId":2386,"title":"Find the K-Sum of an Array","titleSlug":"find-the-k-sum-of-an-array","difficulty":"HARD","paidOnly":false,"tags":["array","sorting","heap-priority-queue"]}
|
||
{"id":2463,"frontendId":2379,"title":"Minimum Recolors to Get K Consecutive Black Blocks","titleSlug":"minimum-recolors-to-get-k-consecutive-black-blocks","difficulty":"EASY","paidOnly":false,"tags":["string","sliding-window"]}
|
||
{"id":2464,"frontendId":2380,"title":"Time Needed to Rearrange a Binary String","titleSlug":"time-needed-to-rearrange-a-binary-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming","simulation"]}
|
||
{"id":2465,"frontendId":2381,"title":"Shifting Letters II","titleSlug":"shifting-letters-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","prefix-sum"]}
|
||
{"id":2466,"frontendId":2382,"title":"Maximum Segment Sum After Removals","titleSlug":"maximum-segment-sum-after-removals","difficulty":"HARD","paidOnly":false,"tags":["array","union-find","prefix-sum","ordered-set"]}
|
||
{"id":2468,"frontendId":2330,"title":"Valid Palindrome IV","titleSlug":"valid-palindrome-iv","difficulty":"MEDIUM","paidOnly":true,"tags":["two-pointers","string"]}
|
||
{"id":2469,"frontendId":2389,"title":"Longest Subsequence With Limited Sum","titleSlug":"longest-subsequence-with-limited-sum","difficulty":"EASY","paidOnly":false,"tags":["array","binary-search","greedy","sorting","prefix-sum"]}
|
||
{"id":2470,"frontendId":2390,"title":"Removing Stars From a String","titleSlug":"removing-stars-from-a-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","simulation"]}
|
||
{"id":2471,"frontendId":2391,"title":"Minimum Amount of Time to Collect Garbage","titleSlug":"minimum-amount-of-time-to-collect-garbage","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","prefix-sum"]}
|
||
{"id":2472,"frontendId":2392,"title":"Build a Matrix With Conditions","titleSlug":"build-a-matrix-with-conditions","difficulty":"HARD","paidOnly":false,"tags":["array","graph","topological-sort","matrix"]}
|
||
{"id":2473,"frontendId":2342,"title":"Max Sum of a Pair With Equal Sum of Digits","titleSlug":"max-sum-of-a-pair-with-equal-sum-of-digits","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sorting","heap-priority-queue"]}
|
||
{"id":2474,"frontendId":2340,"title":"Minimum Adjacent Swaps to Make a Valid Array","titleSlug":"minimum-adjacent-swaps-to-make-a-valid-array","difficulty":"MEDIUM","paidOnly":true,"tags":["array","greedy"]}
|
||
{"id":2475,"frontendId":2384,"title":"Largest Palindromic Number","titleSlug":"largest-palindromic-number","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","greedy","counting"]}
|
||
{"id":2476,"frontendId":2399,"title":"Check Distances Between Same Letters","titleSlug":"check-distances-between-same-letters","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":2477,"frontendId":2400,"title":"Number of Ways to Reach a Position After Exactly k Steps","titleSlug":"number-of-ways-to-reach-a-position-after-exactly-k-steps","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming","combinatorics"]}
|
||
{"id":2478,"frontendId":2401,"title":"Longest Nice Subarray","titleSlug":"longest-nice-subarray","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation","sliding-window"]}
|
||
{"id":2479,"frontendId":2402,"title":"Meeting Rooms III","titleSlug":"meeting-rooms-iii","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","sorting","heap-priority-queue","simulation"]}
|
||
{"id":2480,"frontendId":2395,"title":"Find Subarrays With Equal Sum","titleSlug":"find-subarrays-with-equal-sum","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":2481,"frontendId":2396,"title":"Strictly Palindromic Number","titleSlug":"strictly-palindromic-number","difficulty":"MEDIUM","paidOnly":false,"tags":["math","two-pointers","brainteaser"]}
|
||
{"id":2482,"frontendId":2397,"title":"Maximum Rows Covered by Columns","titleSlug":"maximum-rows-covered-by-columns","difficulty":"MEDIUM","paidOnly":false,"tags":["array","backtracking","bit-manipulation","matrix","enumeration"]}
|
||
{"id":2483,"frontendId":2365,"title":"Task Scheduler II","titleSlug":"task-scheduler-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","simulation"]}
|
||
{"id":2484,"frontendId":2346,"title":"Compute the Rank as a Percentage","titleSlug":"compute-the-rank-as-a-percentage","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2485,"frontendId":2345,"title":"Finding the Number of Visible Mountains","titleSlug":"finding-the-number-of-visible-mountains","difficulty":"MEDIUM","paidOnly":true,"tags":["array","stack","sorting","monotonic-stack"]}
|
||
{"id":2486,"frontendId":2404,"title":"Most Frequent Even Element","titleSlug":"most-frequent-even-element","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":2487,"frontendId":2405,"title":"Optimal Partition of String","titleSlug":"optimal-partition-of-string","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","greedy"]}
|
||
{"id":2488,"frontendId":2406,"title":"Divide Intervals Into Minimum Number of Groups","titleSlug":"divide-intervals-into-minimum-number-of-groups","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","greedy","sorting","heap-priority-queue","prefix-sum"]}
|
||
{"id":2489,"frontendId":2459,"title":"Sort Array by Moving Items to Empty Space","titleSlug":"sort-array-by-moving-items-to-empty-space","difficulty":"HARD","paidOnly":true,"tags":["array","hash-table","sorting"]}
|
||
{"id":2490,"frontendId":2355,"title":"Maximum Number of Books You Can Take","titleSlug":"maximum-number-of-books-you-can-take","difficulty":"HARD","paidOnly":true,"tags":["array","dynamic-programming","stack","monotonic-stack"]}
|
||
{"id":2491,"frontendId":2413,"title":"Smallest Even Multiple","titleSlug":"smallest-even-multiple","difficulty":"EASY","paidOnly":false,"tags":["math","number-theory"]}
|
||
{"id":2492,"frontendId":2414,"title":"Length of the Longest Alphabetical Continuous Substring","titleSlug":"length-of-the-longest-alphabetical-continuous-substring","difficulty":"MEDIUM","paidOnly":false,"tags":["string"]}
|
||
{"id":2493,"frontendId":2415,"title":"Reverse Odd Levels of Binary Tree","titleSlug":"reverse-odd-levels-of-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":2494,"frontendId":2416,"title":"Sum of Prefix Scores of Strings","titleSlug":"sum-of-prefix-scores-of-strings","difficulty":"HARD","paidOnly":false,"tags":["array","string","trie","counting"]}
|
||
{"id":2495,"frontendId":2356,"title":"Number of Unique Subjects Taught by Each Teacher","titleSlug":"number-of-unique-subjects-taught-by-each-teacher","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":2496,"frontendId":2409,"title":"Count Days Spent Together","titleSlug":"count-days-spent-together","difficulty":"EASY","paidOnly":false,"tags":["math","string"]}
|
||
{"id":2497,"frontendId":2410,"title":"Maximum Matching of Players With Trainers","titleSlug":"maximum-matching-of-players-with-trainers","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","greedy","sorting"]}
|
||
{"id":2498,"frontendId":2411,"title":"Smallest Subarrays With Maximum Bitwise OR","titleSlug":"smallest-subarrays-with-maximum-bitwise-or","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","bit-manipulation","sliding-window"]}
|
||
{"id":2499,"frontendId":2412,"title":"Minimum Money Required Before Transactions","titleSlug":"minimum-money-required-before-transactions","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":2500,"frontendId":2361,"title":"Minimum Costs Using the Train Line","titleSlug":"minimum-costs-using-the-train-line","difficulty":"HARD","paidOnly":true,"tags":["array","dynamic-programming"]}
|
||
{"id":2501,"frontendId":2362,"title":"Generate the Invoice","titleSlug":"generate-the-invoice","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2502,"frontendId":2418,"title":"Sort the People","titleSlug":"sort-the-people","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string","sorting"]}
|
||
{"id":2503,"frontendId":2419,"title":"Longest Subarray With Maximum Bitwise AND","titleSlug":"longest-subarray-with-maximum-bitwise-and","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation","brainteaser"]}
|
||
{"id":2504,"frontendId":2420,"title":"Find All Good Indices","titleSlug":"find-all-good-indices","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","prefix-sum"]}
|
||
{"id":2505,"frontendId":2421,"title":"Number of Good Paths","titleSlug":"number-of-good-paths","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","tree","union-find","graph","sorting"]}
|
||
{"id":2506,"frontendId":2371,"title":"Minimize Maximum Value in a Grid","titleSlug":"minimize-maximum-value-in-a-grid","difficulty":"HARD","paidOnly":true,"tags":["array","union-find","graph","topological-sort","sorting","matrix"]}
|
||
{"id":2507,"frontendId":2427,"title":"Number of Common Factors","titleSlug":"number-of-common-factors","difficulty":"EASY","paidOnly":false,"tags":["math","enumeration","number-theory"]}
|
||
{"id":2508,"frontendId":2428,"title":"Maximum Sum of an Hourglass","titleSlug":"maximum-sum-of-an-hourglass","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","prefix-sum"]}
|
||
{"id":2509,"frontendId":2429,"title":"Minimize XOR","titleSlug":"minimize-xor","difficulty":"MEDIUM","paidOnly":false,"tags":["greedy","bit-manipulation"]}
|
||
{"id":2510,"frontendId":2430,"title":"Maximum Deletions on a String","titleSlug":"maximum-deletions-on-a-string","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming","rolling-hash","string-matching","hash-function"]}
|
||
{"id":2511,"frontendId":2522,"title":"Partition String Into Substrings With Values at Most K","titleSlug":"partition-string-into-substrings-with-values-at-most-k","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming","greedy"]}
|
||
{"id":2512,"frontendId":2424,"title":"Longest Uploaded Prefix","titleSlug":"longest-uploaded-prefix","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","binary-search","union-find","design","binary-indexed-tree","segment-tree","heap-priority-queue","ordered-set"]}
|
||
{"id":2513,"frontendId":2426,"title":"Number of Pairs Satisfying Inequality","titleSlug":"number-of-pairs-satisfying-inequality","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","divide-and-conquer","binary-indexed-tree","segment-tree","merge-sort","ordered-set"]}
|
||
{"id":2515,"frontendId":2372,"title":"Calculate the Influence of Each Salesperson","titleSlug":"calculate-the-influence-of-each-salesperson","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2516,"frontendId":2377,"title":"Sort the Olympic Table","titleSlug":"sort-the-olympic-table","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":2517,"frontendId":2378,"title":"Choose Edges to Maximize Score in a Tree","titleSlug":"choose-edges-to-maximize-score-in-a-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["dynamic-programming","tree","depth-first-search"]}
|
||
{"id":2518,"frontendId":2432,"title":"The Employee That Worked on the Longest Task","titleSlug":"the-employee-that-worked-on-the-longest-task","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":2519,"frontendId":2433,"title":"Find The Original Array of Prefix Xor","titleSlug":"find-the-original-array-of-prefix-xor","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation"]}
|
||
{"id":2520,"frontendId":2434,"title":"Using a Robot to Print the Lexicographically Smallest String","titleSlug":"using-a-robot-to-print-the-lexicographically-smallest-string","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","stack","greedy"]}
|
||
{"id":2521,"frontendId":2435,"title":"Paths in Matrix Whose Sum Is Divisible by K","titleSlug":"paths-in-matrix-whose-sum-is-divisible-by-k","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":2522,"frontendId":2387,"title":"Median of a Row Wise Sorted Matrix","titleSlug":"median-of-a-row-wise-sorted-matrix","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search","matrix"]}
|
||
{"id":2523,"frontendId":2388,"title":"Change Null Values in a Table to the Previous Value","titleSlug":"change-null-values-in-a-table-to-the-previous-value","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2524,"frontendId":2441,"title":"Largest Positive Integer That Exists With Its Negative","titleSlug":"largest-positive-integer-that-exists-with-its-negative","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","two-pointers","sorting"]}
|
||
{"id":2525,"frontendId":2442,"title":"Count Number of Distinct Integers After Reverse Operations","titleSlug":"count-number-of-distinct-integers-after-reverse-operations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","counting"]}
|
||
{"id":2526,"frontendId":2407,"title":"Longest Increasing Subsequence II","titleSlug":"longest-increasing-subsequence-ii","difficulty":"HARD","paidOnly":false,"tags":["array","divide-and-conquer","dynamic-programming","binary-indexed-tree","segment-tree","queue","monotonic-queue"]}
|
||
{"id":2527,"frontendId":2444,"title":"Count Subarrays With Fixed Bounds","titleSlug":"count-subarrays-with-fixed-bounds","difficulty":"HARD","paidOnly":false,"tags":["array","queue","sliding-window","monotonic-queue"]}
|
||
{"id":2528,"frontendId":2437,"title":"Number of Valid Clock Times","titleSlug":"number-of-valid-clock-times","difficulty":"EASY","paidOnly":false,"tags":["string","enumeration"]}
|
||
{"id":2529,"frontendId":2438,"title":"Range Product Queries of Powers","titleSlug":"range-product-queries-of-powers","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation","prefix-sum"]}
|
||
{"id":2530,"frontendId":2439,"title":"Minimize Maximum of Array","titleSlug":"minimize-maximum-of-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","dynamic-programming","greedy","prefix-sum"]}
|
||
{"id":2531,"frontendId":2440,"title":"Create Components With Same Value","titleSlug":"create-components-with-same-value","difficulty":"HARD","paidOnly":false,"tags":["array","math","tree","depth-first-search","enumeration"]}
|
||
{"id":2532,"frontendId":2423,"title":"Remove Letter To Equalize Frequency","titleSlug":"remove-letter-to-equalize-frequency","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":2533,"frontendId":2425,"title":"Bitwise XOR of All Pairings","titleSlug":"bitwise-xor-of-all-pairings","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation","brainteaser"]}
|
||
{"id":2534,"frontendId":2394,"title":"Employees With Deductions","titleSlug":"employees-with-deductions","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2535,"frontendId":2393,"title":"Count Strictly Increasing Subarrays","titleSlug":"count-strictly-increasing-subarrays","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","dynamic-programming"]}
|
||
{"id":2536,"frontendId":2446,"title":"Determine if Two Events Have Conflict","titleSlug":"determine-if-two-events-have-conflict","difficulty":"EASY","paidOnly":false,"tags":["array","string"]}
|
||
{"id":2537,"frontendId":2403,"title":"Minimum Time to Kill All Monsters","titleSlug":"minimum-time-to-kill-all-monsters","difficulty":"HARD","paidOnly":true,"tags":["array","dynamic-programming","bit-manipulation","bitmask"]}
|
||
{"id":2538,"frontendId":2448,"title":"Minimum Cost to Make Array Equal","titleSlug":"minimum-cost-to-make-array-equal","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","greedy","sorting","prefix-sum"]}
|
||
{"id":2539,"frontendId":2449,"title":"Minimum Number of Operations to Make Arrays Similar","titleSlug":"minimum-number-of-operations-to-make-arrays-similar","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":2540,"frontendId":2647,"title":"Color the Triangle Red","titleSlug":"color-the-triangle-red","difficulty":"HARD","paidOnly":true,"tags":["array","math"]}
|
||
{"id":2541,"frontendId":2443,"title":"Sum of Number and Its Reverse","titleSlug":"sum-of-number-and-its-reverse","difficulty":"MEDIUM","paidOnly":false,"tags":["math","enumeration"]}
|
||
{"id":2542,"frontendId":2455,"title":"Average Value of Even Numbers That Are Divisible by Three","titleSlug":"average-value-of-even-numbers-that-are-divisible-by-three","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
|
||
{"id":2543,"frontendId":2456,"title":"Most Popular Video Creator","titleSlug":"most-popular-video-creator","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","sorting","heap-priority-queue"]}
|
||
{"id":2544,"frontendId":2457,"title":"Minimum Addition to Make Integer Beautiful","titleSlug":"minimum-addition-to-make-integer-beautiful","difficulty":"MEDIUM","paidOnly":false,"tags":["math","greedy"]}
|
||
{"id":2545,"frontendId":2458,"title":"Height of Binary Tree After Subtree Removal Queries","titleSlug":"height-of-binary-tree-after-subtree-removal-queries","difficulty":"HARD","paidOnly":false,"tags":["array","tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":2546,"frontendId":2447,"title":"Number of Subarrays With GCD Equal to K","titleSlug":"number-of-subarrays-with-gcd-equal-to-k","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","number-theory"]}
|
||
{"id":2547,"frontendId":2451,"title":"Odd String Difference","titleSlug":"odd-string-difference","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":2548,"frontendId":2453,"title":"Destroy Sequential Targets","titleSlug":"destroy-sequential-targets","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":2549,"frontendId":2454,"title":"Next Greater Element IV","titleSlug":"next-greater-element-iv","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","stack","sorting","heap-priority-queue","monotonic-stack"]}
|
||
{"id":2550,"frontendId":2452,"title":"Words Within Two Edits of Dictionary","titleSlug":"words-within-two-edits-of-dictionary","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","trie"]}
|
||
{"id":2551,"frontendId":2460,"title":"Apply Operations to an Array","titleSlug":"apply-operations-to-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","simulation"]}
|
||
{"id":2552,"frontendId":2461,"title":"Maximum Sum of Distinct Subarrays With Length K","titleSlug":"maximum-sum-of-distinct-subarrays-with-length-k","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sliding-window"]}
|
||
{"id":2553,"frontendId":2462,"title":"Total Cost to Hire K Workers","titleSlug":"total-cost-to-hire-k-workers","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","heap-priority-queue","simulation"]}
|
||
{"id":2554,"frontendId":2463,"title":"Minimum Total Distance Traveled","titleSlug":"minimum-total-distance-traveled","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","sorting"]}
|
||
{"id":2555,"frontendId":2408,"title":"Design SQL","titleSlug":"design-sql","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","string","design"]}
|
||
{"id":2556,"frontendId":2469,"title":"Convert the Temperature","titleSlug":"convert-the-temperature","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":2557,"frontendId":2470,"title":"Number of Subarrays With LCM Equal to K","titleSlug":"number-of-subarrays-with-lcm-equal-to-k","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","number-theory"]}
|
||
{"id":2558,"frontendId":2471,"title":"Minimum Number of Operations to Sort a Binary Tree by Level","titleSlug":"minimum-number-of-operations-to-sort-a-binary-tree-by-level","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","breadth-first-search","binary-tree"]}
|
||
{"id":2559,"frontendId":2472,"title":"Maximum Number of Non-overlapping Palindrome Substrings","titleSlug":"maximum-number-of-non-overlapping-palindrome-substrings","difficulty":"HARD","paidOnly":false,"tags":["two-pointers","string","dynamic-programming","greedy"]}
|
||
{"id":2560,"frontendId":2417,"title":"Closest Fair Integer","titleSlug":"closest-fair-integer","difficulty":"MEDIUM","paidOnly":true,"tags":["math","enumeration"]}
|
||
{"id":2561,"frontendId":2465,"title":"Number of Distinct Averages","titleSlug":"number-of-distinct-averages","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","two-pointers","sorting"]}
|
||
{"id":2562,"frontendId":2466,"title":"Count Ways To Build Good Strings","titleSlug":"count-ways-to-build-good-strings","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":2563,"frontendId":2468,"title":"Split Message Based on Limit","titleSlug":"split-message-based-on-limit","difficulty":"HARD","paidOnly":false,"tags":["string","enumeration"]}
|
||
{"id":2564,"frontendId":2467,"title":"Most Profitable Path in a Tree","titleSlug":"most-profitable-path-in-a-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["array","tree","depth-first-search","breadth-first-search","graph"]}
|
||
{"id":2565,"frontendId":2422,"title":"Merge Operations to Turn Array Into a Palindrome","titleSlug":"merge-operations-to-turn-array-into-a-palindrome","difficulty":"MEDIUM","paidOnly":true,"tags":["array","two-pointers","greedy"]}
|
||
{"id":2566,"frontendId":2475,"title":"Number of Unequal Triplets in Array","titleSlug":"number-of-unequal-triplets-in-array","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sorting"]}
|
||
{"id":2567,"frontendId":2476,"title":"Closest Nodes Queries in a Binary Search Tree","titleSlug":"closest-nodes-queries-in-a-binary-search-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","tree","depth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":2568,"frontendId":2477,"title":"Minimum Fuel Cost to Report to the Capital","titleSlug":"minimum-fuel-cost-to-report-to-the-capital","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","graph"]}
|
||
{"id":2569,"frontendId":2478,"title":"Number of Beautiful Partitions","titleSlug":"number-of-beautiful-partitions","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming","prefix-sum"]}
|
||
{"id":2570,"frontendId":2431,"title":"Maximize Total Tastiness of Purchased Fruits","titleSlug":"maximize-total-tastiness-of-purchased-fruits","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming"]}
|
||
{"id":2571,"frontendId":2485,"title":"Find the Pivot Integer","titleSlug":"find-the-pivot-integer","difficulty":"EASY","paidOnly":false,"tags":["math","prefix-sum"]}
|
||
{"id":2572,"frontendId":2486,"title":"Append Characters to String to Make Subsequence","titleSlug":"append-characters-to-string-to-make-subsequence","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string","greedy"]}
|
||
{"id":2573,"frontendId":2487,"title":"Remove Nodes From Linked List","titleSlug":"remove-nodes-from-linked-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","stack","recursion","monotonic-stack"]}
|
||
{"id":2574,"frontendId":2488,"title":"Count Subarrays With Median K","titleSlug":"count-subarrays-with-median-k","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":2575,"frontendId":2481,"title":"Minimum Cuts to Divide a Circle","titleSlug":"minimum-cuts-to-divide-a-circle","difficulty":"EASY","paidOnly":false,"tags":["math","geometry"]}
|
||
{"id":2576,"frontendId":2483,"title":"Minimum Penalty for a Shop","titleSlug":"minimum-penalty-for-a-shop","difficulty":"MEDIUM","paidOnly":false,"tags":["string","prefix-sum"]}
|
||
{"id":2577,"frontendId":2484,"title":"Count Palindromic Subsequences","titleSlug":"count-palindromic-subsequences","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":2579,"frontendId":2436,"title":"Minimum Split Into Subarrays With GCD Greater Than One","titleSlug":"minimum-split-into-subarrays-with-gcd-greater-than-one","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","dynamic-programming","greedy","number-theory"]}
|
||
{"id":2580,"frontendId":2490,"title":"Circular Sentence","titleSlug":"circular-sentence","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":2581,"frontendId":2491,"title":"Divide Players Into Teams of Equal Skill","titleSlug":"divide-players-into-teams-of-equal-skill","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","two-pointers","sorting"]}
|
||
{"id":2582,"frontendId":2492,"title":"Minimum Score of a Path Between Two Cities","titleSlug":"minimum-score-of-a-path-between-two-cities","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":2583,"frontendId":2493,"title":"Divide Nodes Into the Maximum Number of Groups","titleSlug":"divide-nodes-into-the-maximum-number-of-groups","difficulty":"HARD","paidOnly":false,"tags":["depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":2584,"frontendId":2445,"title":"Number of Nodes With Value One","titleSlug":"number-of-nodes-with-value-one","difficulty":"MEDIUM","paidOnly":true,"tags":["array","tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":2585,"frontendId":2500,"title":"Delete Greatest Value in Each Row","titleSlug":"delete-greatest-value-in-each-row","difficulty":"EASY","paidOnly":false,"tags":["array","sorting","heap-priority-queue","matrix","simulation"]}
|
||
{"id":2586,"frontendId":2501,"title":"Longest Square Streak in an Array","titleSlug":"longest-square-streak-in-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","binary-search","dynamic-programming","sorting"]}
|
||
{"id":2587,"frontendId":2502,"title":"Design Memory Allocator","titleSlug":"design-memory-allocator","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","design","simulation"]}
|
||
{"id":2588,"frontendId":2503,"title":"Maximum Number of Points From Grid Queries","titleSlug":"maximum-number-of-points-from-grid-queries","difficulty":"HARD","paidOnly":false,"tags":["array","two-pointers","breadth-first-search","union-find","sorting","heap-priority-queue","matrix"]}
|
||
{"id":2589,"frontendId":2496,"title":"Maximum Value of a String in an Array","titleSlug":"maximum-value-of-a-string-in-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","string"]}
|
||
{"id":2590,"frontendId":2497,"title":"Maximum Star Sum of a Graph","titleSlug":"maximum-star-sum-of-a-graph","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","graph","sorting","heap-priority-queue"]}
|
||
{"id":2591,"frontendId":2498,"title":"Frog Jump II","titleSlug":"frog-jump-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","greedy"]}
|
||
{"id":2592,"frontendId":2499,"title":"Minimum Total Cost to Make Arrays Unequal","titleSlug":"minimum-total-cost-to-make-arrays-unequal","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","greedy","counting"]}
|
||
{"id":2593,"frontendId":2450,"title":"Number of Distinct Binary Strings After Applying Operations","titleSlug":"number-of-distinct-binary-strings-after-applying-operations","difficulty":"MEDIUM","paidOnly":true,"tags":["math","string"]}
|
||
{"id":2594,"frontendId":2506,"title":"Count Pairs Of Similar Strings","titleSlug":"count-pairs-of-similar-strings","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string","bit-manipulation","counting"]}
|
||
{"id":2595,"frontendId":2507,"title":"Smallest Value After Replacing With Sum of Prime Factors","titleSlug":"smallest-value-after-replacing-with-sum-of-prime-factors","difficulty":"MEDIUM","paidOnly":false,"tags":["math","simulation","number-theory"]}
|
||
{"id":2596,"frontendId":2508,"title":"Add Edges to Make Degrees of All Nodes Even","titleSlug":"add-edges-to-make-degrees-of-all-nodes-even","difficulty":"HARD","paidOnly":false,"tags":["hash-table","graph"]}
|
||
{"id":2597,"frontendId":2509,"title":"Cycle Length Queries in a Tree","titleSlug":"cycle-length-queries-in-a-tree","difficulty":"HARD","paidOnly":false,"tags":["array","tree","binary-tree"]}
|
||
{"id":2598,"frontendId":2515,"title":"Shortest Distance to Target String in a Circular Array","titleSlug":"shortest-distance-to-target-string-in-a-circular-array","difficulty":"EASY","paidOnly":false,"tags":["array","string"]}
|
||
{"id":2599,"frontendId":2516,"title":"Take K of Each Character From Left and Right","titleSlug":"take-k-of-each-character-from-left-and-right","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":2600,"frontendId":2517,"title":"Maximum Tastiness of Candy Basket","titleSlug":"maximum-tastiness-of-candy-basket","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","greedy","sorting"]}
|
||
{"id":2601,"frontendId":2518,"title":"Number of Great Partitions","titleSlug":"number-of-great-partitions","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":2602,"frontendId":2511,"title":"Maximum Enemy Forts That Can Be Captured","titleSlug":"maximum-enemy-forts-that-can-be-captured","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers"]}
|
||
{"id":2603,"frontendId":2512,"title":"Reward Top K Students","titleSlug":"reward-top-k-students","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","sorting","heap-priority-queue"]}
|
||
{"id":2604,"frontendId":2541,"title":"Minimum Operations to Make Array Equal II","titleSlug":"minimum-operations-to-make-array-equal-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","greedy"]}
|
||
{"id":2605,"frontendId":2514,"title":"Count Anagrams","titleSlug":"count-anagrams","difficulty":"HARD","paidOnly":false,"tags":["hash-table","math","string","combinatorics","counting"]}
|
||
{"id":2606,"frontendId":2482,"title":"Difference Between Ones and Zeros in Row and Column","titleSlug":"difference-between-ones-and-zeros-in-row-and-column","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","simulation"]}
|
||
{"id":2607,"frontendId":2464,"title":"Minimum Subarrays in a Valid Split","titleSlug":"minimum-subarrays-in-a-valid-split","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","dynamic-programming","number-theory"]}
|
||
{"id":2608,"frontendId":2520,"title":"Count the Digits That Divide a Number","titleSlug":"count-the-digits-that-divide-a-number","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":2609,"frontendId":2521,"title":"Distinct Prime Factors of Product of Array","titleSlug":"distinct-prime-factors-of-product-of-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","number-theory"]}
|
||
{"id":2610,"frontendId":2523,"title":"Closest Prime Numbers in Range","titleSlug":"closest-prime-numbers-in-range","difficulty":"MEDIUM","paidOnly":false,"tags":["math","number-theory"]}
|
||
{"id":2612,"frontendId":2473,"title":"Minimum Cost to Buy Apples","titleSlug":"minimum-cost-to-buy-apples","difficulty":"MEDIUM","paidOnly":true,"tags":["array","graph","heap-priority-queue","shortest-path"]}
|
||
{"id":2613,"frontendId":2474,"title":"Customers With Strictly Increasing Purchases","titleSlug":"customers-with-strictly-increasing-purchases","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2614,"frontendId":2529,"title":"Maximum Count of Positive Integer and Negative Integer","titleSlug":"maximum-count-of-positive-integer-and-negative-integer","difficulty":"EASY","paidOnly":false,"tags":["array","binary-search","counting"]}
|
||
{"id":2615,"frontendId":2531,"title":"Make Number of Distinct Characters Equal","titleSlug":"make-number-of-distinct-characters-equal","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":2616,"frontendId":2530,"title":"Maximal Score After Applying K Operations","titleSlug":"maximal-score-after-applying-k-operations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","heap-priority-queue"]}
|
||
{"id":2617,"frontendId":2534,"title":"Time Taken to Cross the Door","titleSlug":"time-taken-to-cross-the-door","difficulty":"HARD","paidOnly":true,"tags":["array","queue","simulation"]}
|
||
{"id":2618,"frontendId":2528,"title":"Maximize the Minimum Powered City","titleSlug":"maximize-the-minimum-powered-city","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","greedy","queue","sliding-window","prefix-sum"]}
|
||
{"id":2619,"frontendId":2525,"title":"Categorize Box According to Criteria","titleSlug":"categorize-box-according-to-criteria","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":2620,"frontendId":2526,"title":"Find Consecutive Integers from a Data Stream","titleSlug":"find-consecutive-integers-from-a-data-stream","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","design","queue","counting","data-stream"]}
|
||
{"id":2621,"frontendId":2527,"title":"Find Xor-Beauty of Array","titleSlug":"find-xor-beauty-of-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","bit-manipulation"]}
|
||
{"id":2622,"frontendId":2480,"title":"Form a Chemical Bond","titleSlug":"form-a-chemical-bond","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":2623,"frontendId":2479,"title":"Maximum XOR of Two Non-Overlapping Subtrees","titleSlug":"maximum-xor-of-two-non-overlapping-subtrees","difficulty":"HARD","paidOnly":true,"tags":["tree","depth-first-search","graph","trie"]}
|
||
{"id":2624,"frontendId":2535,"title":"Difference Between Element Sum and Digit Sum of an Array","titleSlug":"difference-between-element-sum-and-digit-sum-of-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
|
||
{"id":2625,"frontendId":2536,"title":"Increment Submatrices by One","titleSlug":"increment-submatrices-by-one","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","prefix-sum"]}
|
||
{"id":2626,"frontendId":2537,"title":"Count the Number of Good Subarrays","titleSlug":"count-the-number-of-good-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sliding-window"]}
|
||
{"id":2627,"frontendId":2538,"title":"Difference Between Maximum and Minimum Price Sum","titleSlug":"difference-between-maximum-and-minimum-price-sum","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","tree","depth-first-search"]}
|
||
{"id":2628,"frontendId":2513,"title":"Minimize the Maximum of Two Arrays","titleSlug":"minimize-the-maximum-of-two-arrays","difficulty":"MEDIUM","paidOnly":false,"tags":["math","binary-search","number-theory"]}
|
||
{"id":2629,"frontendId":2489,"title":"Number of Substrings With Fixed Ratio","titleSlug":"number-of-substrings-with-fixed-ratio","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","math","string","prefix-sum"]}
|
||
{"id":2630,"frontendId":2544,"title":"Alternating Digit Sum","titleSlug":"alternating-digit-sum","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":2631,"frontendId":2545,"title":"Sort the Students by Their Kth Score","titleSlug":"sort-the-students-by-their-kth-score","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting","matrix"]}
|
||
{"id":2632,"frontendId":2546,"title":"Apply Bitwise Operations to Make Strings Equal","titleSlug":"apply-bitwise-operations-to-make-strings-equal","difficulty":"MEDIUM","paidOnly":false,"tags":["string","bit-manipulation"]}
|
||
{"id":2633,"frontendId":2547,"title":"Minimum Cost to Split an Array","titleSlug":"minimum-cost-to-split-an-array","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","dynamic-programming","counting"]}
|
||
{"id":2634,"frontendId":2540,"title":"Minimum Common Value","titleSlug":"minimum-common-value","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","two-pointers","binary-search"]}
|
||
{"id":2635,"frontendId":2543,"title":"Check if Point Is Reachable","titleSlug":"check-if-point-is-reachable","difficulty":"HARD","paidOnly":false,"tags":["math","number-theory"]}
|
||
{"id":2636,"frontendId":2542,"title":"Maximum Subsequence Score","titleSlug":"maximum-subsequence-score","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting","heap-priority-queue"]}
|
||
{"id":2637,"frontendId":2494,"title":"Merge Overlapping Events in the Same Hall","titleSlug":"merge-overlapping-events-in-the-same-hall","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2638,"frontendId":2495,"title":"Number of Subarrays Having Even Product","titleSlug":"number-of-subarrays-having-even-product","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","dynamic-programming"]}
|
||
{"id":2639,"frontendId":2553,"title":"Separate the Digits in an Array","titleSlug":"separate-the-digits-in-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":2640,"frontendId":2554,"title":"Maximum Number of Integers to Choose From a Range I","titleSlug":"maximum-number-of-integers-to-choose-from-a-range-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","binary-search","greedy","sorting"]}
|
||
{"id":2641,"frontendId":2556,"title":"Disconnect Path in a Binary Matrix by at Most One Flip","titleSlug":"disconnect-path-in-a-binary-matrix-by-at-most-one-flip","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","depth-first-search","breadth-first-search","matrix"]}
|
||
{"id":2642,"frontendId":2532,"title":"Time to Cross a Bridge","titleSlug":"time-to-cross-a-bridge","difficulty":"HARD","paidOnly":false,"tags":["array","heap-priority-queue","simulation"]}
|
||
{"id":2643,"frontendId":2504,"title":"Concatenate the Name and the Profession","titleSlug":"concatenate-the-name-and-the-profession","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":2644,"frontendId":2505,"title":"Bitwise OR of All Subsequence Sums","titleSlug":"bitwise-or-of-all-subsequence-sums","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","bit-manipulation","brainteaser","prefix-sum"]}
|
||
{"id":2645,"frontendId":2582,"title":"Pass the Pillow","titleSlug":"pass-the-pillow","difficulty":"EASY","paidOnly":false,"tags":["math","simulation"]}
|
||
{"id":2646,"frontendId":2583,"title":"Kth Largest Sum in a Binary Tree","titleSlug":"kth-largest-sum-in-a-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","breadth-first-search","sorting","binary-tree"]}
|
||
{"id":2647,"frontendId":2584,"title":"Split the Array to Make Coprime Products","titleSlug":"split-the-array-to-make-coprime-products","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","number-theory"]}
|
||
{"id":2648,"frontendId":2585,"title":"Number of Ways to Earn Points","titleSlug":"number-of-ways-to-earn-points","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":2649,"frontendId":2579,"title":"Count Total Number of Colored Cells","titleSlug":"count-total-number-of-colored-cells","difficulty":"MEDIUM","paidOnly":false,"tags":["math"]}
|
||
{"id":2650,"frontendId":2578,"title":"Split With Minimum Sum","titleSlug":"split-with-minimum-sum","difficulty":"EASY","paidOnly":false,"tags":["math","greedy","sorting"]}
|
||
{"id":2651,"frontendId":2580,"title":"Count Ways to Group Overlapping Ranges","titleSlug":"count-ways-to-group-overlapping-ranges","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":2652,"frontendId":2581,"title":"Count Number of Possible Root Nodes","titleSlug":"count-number-of-possible-root-nodes","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","dynamic-programming","tree","depth-first-search"]}
|
||
{"id":2653,"frontendId":2510,"title":"Check if There is a Path With Equal Number of 0's And 1's","titleSlug":"check-if-there-is-a-path-with-equal-number-of-0s-and-1s","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":2654,"frontendId":2586,"title":"Count the Number of Vowel Strings in Range","titleSlug":"count-the-number-of-vowel-strings-in-range","difficulty":"EASY","paidOnly":false,"tags":["array","string","counting"]}
|
||
{"id":2655,"frontendId":2587,"title":"Rearrange Array to Maximize Prefix Score","titleSlug":"rearrange-array-to-maximize-prefix-score","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting","prefix-sum"]}
|
||
{"id":2656,"frontendId":2588,"title":"Count the Number of Beautiful Subarrays","titleSlug":"count-the-number-of-beautiful-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","bit-manipulation","prefix-sum"]}
|
||
{"id":2657,"frontendId":2589,"title":"Minimum Time to Complete All Tasks","titleSlug":"minimum-time-to-complete-all-tasks","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","stack","greedy","sorting"]}
|
||
{"id":2658,"frontendId":2519,"title":"Count the Number of K-Big Indices","titleSlug":"count-the-number-of-k-big-indices","difficulty":"HARD","paidOnly":true,"tags":["array","binary-search","divide-and-conquer","binary-indexed-tree","segment-tree","merge-sort","ordered-set"]}
|
||
{"id":2659,"frontendId":2595,"title":"Number of Even and Odd Bits","titleSlug":"number-of-even-and-odd-bits","difficulty":"EASY","paidOnly":false,"tags":["bit-manipulation"]}
|
||
{"id":2661,"frontendId":2598,"title":"Smallest Missing Non-negative Integer After Operations","titleSlug":"smallest-missing-non-negative-integer-after-operations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","greedy"]}
|
||
{"id":2662,"frontendId":2596,"title":"Check Knight Tour Configuration","titleSlug":"check-knight-tour-configuration","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","matrix","simulation"]}
|
||
{"id":2663,"frontendId":2591,"title":"Distribute Money to Maximum Children","titleSlug":"distribute-money-to-maximum-children","difficulty":"EASY","paidOnly":false,"tags":["math","greedy"]}
|
||
{"id":2664,"frontendId":2592,"title":"Maximize Greatness of an Array","titleSlug":"maximize-greatness-of-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","greedy","sorting"]}
|
||
{"id":2665,"frontendId":2594,"title":"Minimum Time to Repair Cars","titleSlug":"minimum-time-to-repair-cars","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":2666,"frontendId":2604,"title":"Minimum Time to Eat All Grains","titleSlug":"minimum-time-to-eat-all-grains","difficulty":"HARD","paidOnly":true,"tags":["array","two-pointers","binary-search","sorting"]}
|
||
{"id":2667,"frontendId":2524,"title":"Maximum Frequency Score of a Subarray","titleSlug":"maximum-frequency-score-of-a-subarray","difficulty":"HARD","paidOnly":true,"tags":["array","hash-table","math","stack","sliding-window"]}
|
||
{"id":2668,"frontendId":2605,"title":"Form Smallest Number From Two Digit Arrays","titleSlug":"form-smallest-number-from-two-digit-arrays","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","enumeration"]}
|
||
{"id":2669,"frontendId":2606,"title":"Find the Substring With Maximum Cost","titleSlug":"find-the-substring-with-maximum-cost","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","dynamic-programming"]}
|
||
{"id":2670,"frontendId":2607,"title":"Make K-Subarray Sums Equal","titleSlug":"make-k-subarray-sums-equal","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","greedy","sorting","number-theory"]}
|
||
{"id":2671,"frontendId":2608,"title":"Shortest Cycle in a Graph","titleSlug":"shortest-cycle-in-a-graph","difficulty":"HARD","paidOnly":false,"tags":["breadth-first-search","graph"]}
|
||
{"id":2672,"frontendId":2533,"title":"Number of Good Binary Strings","titleSlug":"number-of-good-binary-strings","difficulty":"MEDIUM","paidOnly":true,"tags":["dynamic-programming"]}
|
||
{"id":2673,"frontendId":2555,"title":"Maximize Win From Two Segments","titleSlug":"maximize-win-from-two-segments","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","sliding-window"]}
|
||
{"id":2674,"frontendId":2599,"title":"Make the Prefix Sum Non-negative","titleSlug":"make-the-prefix-sum-non-negative","difficulty":"MEDIUM","paidOnly":true,"tags":["array","greedy","heap-priority-queue"]}
|
||
{"id":2675,"frontendId":2639,"title":"Find the Width of Columns of a Grid","titleSlug":"find-the-width-of-columns-of-a-grid","difficulty":"EASY","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":2676,"frontendId":2640,"title":"Find the Score of All Prefixes of an Array","titleSlug":"find-the-score-of-all-prefixes-of-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":2677,"frontendId":2641,"title":"Cousins in Binary Tree II","titleSlug":"cousins-in-binary-tree-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":2678,"frontendId":2642,"title":"Design Graph With Shortest Path Calculator","titleSlug":"design-graph-with-shortest-path-calculator","difficulty":"HARD","paidOnly":false,"tags":["graph","design","heap-priority-queue","shortest-path"]}
|
||
{"id":2679,"frontendId":2549,"title":"Count Distinct Numbers on Board","titleSlug":"count-distinct-numbers-on-board","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","math","simulation"]}
|
||
{"id":2680,"frontendId":2550,"title":"Count Collisions of Monkeys on a Polygon","titleSlug":"count-collisions-of-monkeys-on-a-polygon","difficulty":"MEDIUM","paidOnly":false,"tags":["math","recursion"]}
|
||
{"id":2681,"frontendId":2551,"title":"Put Marbles in Bags","titleSlug":"put-marbles-in-bags","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","sorting","heap-priority-queue"]}
|
||
{"id":2682,"frontendId":2552,"title":"Count Increasing Quadruplets","titleSlug":"count-increasing-quadruplets","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","binary-indexed-tree","enumeration","prefix-sum"]}
|
||
{"id":2683,"frontendId":2539,"title":"Count the Number of Good Subsequences","titleSlug":"count-the-number-of-good-subsequences","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","math","string","combinatorics","counting"]}
|
||
{"id":2684,"frontendId":2660,"title":"Determine the Winner of a Bowling Game","titleSlug":"determine-the-winner-of-a-bowling-game","difficulty":"EASY","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":2685,"frontendId":2661,"title":"First Completely Painted Row or Column","titleSlug":"first-completely-painted-row-or-column","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","matrix"]}
|
||
{"id":2686,"frontendId":2662,"title":"Minimum Cost of a Path With Special Roads","titleSlug":"minimum-cost-of-a-path-with-special-roads","difficulty":"MEDIUM","paidOnly":false,"tags":["array","graph","heap-priority-queue","shortest-path"]}
|
||
{"id":2687,"frontendId":2663,"title":"Lexicographically Smallest Beautiful String","titleSlug":"lexicographically-smallest-beautiful-string","difficulty":"HARD","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":2688,"frontendId":2590,"title":"Design a Todo List","titleSlug":"design-a-todo-list","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","string","design","sorting"]}
|
||
{"id":2689,"frontendId":2561,"title":"Rearranging Fruits","titleSlug":"rearranging-fruits","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","greedy","sort"]}
|
||
{"id":2690,"frontendId":2560,"title":"House Robber IV","titleSlug":"house-robber-iv","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","dynamic-programming","greedy"]}
|
||
{"id":2691,"frontendId":2559,"title":"Count Vowel Strings in Ranges","titleSlug":"count-vowel-strings-in-ranges","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","prefix-sum"]}
|
||
{"id":2692,"frontendId":2558,"title":"Take Gifts From the Richest Pile","titleSlug":"take-gifts-from-the-richest-pile","difficulty":"EASY","paidOnly":false,"tags":["array","heap-priority-queue","simulation"]}
|
||
{"id":2693,"frontendId":2548,"title":"Maximum Price to Fill a Bag","titleSlug":"maximum-price-to-fill-a-bag","difficulty":"MEDIUM","paidOnly":true,"tags":["array","greedy","sorting"]}
|
||
{"id":2694,"frontendId":2644,"title":"Find the Maximum Divisibility Score","titleSlug":"find-the-maximum-divisibility-score","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":2695,"frontendId":2593,"title":"Find Score of an Array After Marking All Elements","titleSlug":"find-score-of-an-array-after-marking-all-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sorting","heap-priority-queue","simulation"]}
|
||
{"id":2696,"frontendId":2597,"title":"The Number of Beautiful Subsets","titleSlug":"the-number-of-beautiful-subsets","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","dynamic-programming","backtracking","sorting","combinatorics"]}
|
||
{"id":2697,"frontendId":2617,"title":"Minimum Number of Visited Cells in a Grid","titleSlug":"minimum-number-of-visited-cells-in-a-grid","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","stack","breadth-first-search","union-find","heap-priority-queue","matrix","monotonic-stack"]}
|
||
{"id":2698,"frontendId":2562,"title":"Find the Array Concatenation Value","titleSlug":"find-the-array-concatenation-value","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","simulation"]}
|
||
{"id":2699,"frontendId":2563,"title":"Count the Number of Fair Pairs","titleSlug":"count-the-number-of-fair-pairs","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","sorting"]}
|
||
{"id":2700,"frontendId":2564,"title":"Substring XOR Queries","titleSlug":"substring-xor-queries","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","bit-manipulation"]}
|
||
{"id":2701,"frontendId":2565,"title":"Subsequence With the Minimum Score","titleSlug":"subsequence-with-the-minimum-score","difficulty":"HARD","paidOnly":false,"tags":["two-pointers","string","binary-search"]}
|
||
{"id":2702,"frontendId":2557,"title":"Maximum Number of Integers to Choose From a Range II","titleSlug":"maximum-number-of-integers-to-choose-from-a-range-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search","greedy","sorting"]}
|
||
{"id":2703,"frontendId":2569,"title":"Handling Sum Queries After Update","titleSlug":"handling-sum-queries-after-update","difficulty":"HARD","paidOnly":false,"tags":["array","segment-tree"]}
|
||
{"id":2704,"frontendId":2566,"title":"Maximum Difference by Remapping a Digit","titleSlug":"maximum-difference-by-remapping-a-digit","difficulty":"EASY","paidOnly":false,"tags":["math","greedy"]}
|
||
{"id":2705,"frontendId":2568,"title":"Minimum Impossible OR","titleSlug":"minimum-impossible-or","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation","brainteaser"]}
|
||
{"id":2706,"frontendId":2567,"title":"Minimum Score by Changing Two Elements","titleSlug":"minimum-score-by-changing-two-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":2707,"frontendId":2570,"title":"Merge Two 2D Arrays by Summing Values","titleSlug":"merge-two-2d-arrays-by-summing-values","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","two-pointers"]}
|
||
{"id":2708,"frontendId":2573,"title":"Find the String with LCP","titleSlug":"find-the-string-with-lcp","difficulty":"HARD","paidOnly":false,"tags":["array","string","dynamic-programming","greedy","union-find","matrix"]}
|
||
{"id":2709,"frontendId":2572,"title":"Count the Number of Square-Free Subsets","titleSlug":"count-the-number-of-square-free-subsets","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","dynamic-programming","bit-manipulation","bitmask"]}
|
||
{"id":2710,"frontendId":2571,"title":"Minimum Operations to Reduce an Integer to 0","titleSlug":"minimum-operations-to-reduce-an-integer-to-0","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming","greedy","bit-manipulation"]}
|
||
{"id":2711,"frontendId":2577,"title":"Minimum Time to Visit a Cell In a Grid","titleSlug":"minimum-time-to-visit-a-cell-in-a-grid","difficulty":"HARD","paidOnly":false,"tags":["array","breadth-first-search","graph","heap-priority-queue","matrix","shortest-path"]}
|
||
{"id":2712,"frontendId":2576,"title":"Find the Maximum Number of Marked Indices","titleSlug":"find-the-maximum-number-of-marked-indices","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","greedy","sorting"]}
|
||
{"id":2713,"frontendId":2575,"title":"Find the Divisibility Array of a String","titleSlug":"find-the-divisibility-array-of-a-string","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","string"]}
|
||
{"id":2714,"frontendId":2574,"title":"Left and Right Sum Differences","titleSlug":"left-and-right-sum-differences","difficulty":"EASY","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":2715,"frontendId":2600,"title":"K Items With the Maximum Sum","titleSlug":"k-items-with-the-maximum-sum","difficulty":"EASY","paidOnly":false,"tags":["math","greedy"]}
|
||
{"id":2716,"frontendId":2601,"title":"Prime Subtraction Operation","titleSlug":"prime-subtraction-operation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","binary-search","greedy","number-theory"]}
|
||
{"id":2717,"frontendId":2603,"title":"Collect Coins in a Tree","titleSlug":"collect-coins-in-a-tree","difficulty":"HARD","paidOnly":false,"tags":["array","tree","graph","topological-sort"]}
|
||
{"id":2718,"frontendId":2602,"title":"Minimum Operations to Make All Array Elements Equal","titleSlug":"minimum-operations-to-make-all-array-elements-equal","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","sorting","prefix-sum"]}
|
||
{"id":2719,"frontendId":2613,"title":"Beautiful Pairs","titleSlug":"beautiful-pairs","difficulty":"HARD","paidOnly":true,"tags":["array","math","divide-and-conquer","geometry","sorting","ordered-set"]}
|
||
{"id":2720,"frontendId":2616,"title":"Minimize the Maximum Difference of Pairs","titleSlug":"minimize-the-maximum-difference-of-pairs","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","dynamic-programming","greedy","sorting"]}
|
||
{"id":2721,"frontendId":2615,"title":"Sum of Distances","titleSlug":"sum-of-distances","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":2722,"frontendId":2614,"title":"Prime In Diagonal","titleSlug":"prime-in-diagonal","difficulty":"EASY","paidOnly":false,"tags":["array","math","matrix","number-theory"]}
|
||
{"id":2723,"frontendId":2609,"title":"Find the Longest Balanced Substring of a Binary String","titleSlug":"find-the-longest-balanced-substring-of-a-binary-string","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":2724,"frontendId":2610,"title":"Convert an Array Into a 2D Array With Conditions","titleSlug":"convert-an-array-into-a-2d-array-with-conditions","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":2725,"frontendId":2611,"title":"Mice and Cheese","titleSlug":"mice-and-cheese","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting","heap-priority-queue"]}
|
||
{"id":2726,"frontendId":2612,"title":"Minimum Reverse Operations","titleSlug":"minimum-reverse-operations","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","breadth-first-search","union-find","ordered-set"]}
|
||
{"id":2727,"frontendId":2678,"title":"Number of Senior Citizens","titleSlug":"number-of-senior-citizens","difficulty":"EASY","paidOnly":false,"tags":["array","string"]}
|
||
{"id":2728,"frontendId":2679,"title":"Sum in a Matrix","titleSlug":"sum-in-a-matrix","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting","heap-priority-queue","matrix","simulation"]}
|
||
{"id":2729,"frontendId":2702,"title":"Minimum Operations to Make Numbers Non-positive","titleSlug":"minimum-operations-to-make-numbers-non-positive","difficulty":"HARD","paidOnly":true,"tags":["array","binary-search"]}
|
||
{"id":2730,"frontendId":2680,"title":"Maximum OR","titleSlug":"maximum-or","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","bit-manipulation","prefix-sum"]}
|
||
{"id":2731,"frontendId":2623,"title":"Memoize","titleSlug":"memoize","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":2732,"frontendId":2620,"title":"Counter","titleSlug":"counter","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2733,"frontendId":2621,"title":"Sleep","titleSlug":"sleep","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2734,"frontendId":2619,"title":"Array Prototype Last","titleSlug":"array-prototype-last","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2735,"frontendId":2628,"title":"JSON Deep Equal","titleSlug":"json-deep-equal","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":2736,"frontendId":2645,"title":"Minimum Additions to Make Valid String","titleSlug":"minimum-additions-to-make-valid-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming","stack","greedy"]}
|
||
{"id":2737,"frontendId":2643,"title":"Row With Maximum Ones","titleSlug":"row-with-maximum-ones","difficulty":"EASY","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":2738,"frontendId":2638,"title":"Count the Number of K-Free Subsets","titleSlug":"count-the-number-of-k-free-subsets","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","dynamic-programming","sorting","combinatorics"]}
|
||
{"id":2739,"frontendId":2646,"title":"Minimize the Total Price of the Trips","titleSlug":"minimize-the-total-price-of-the-trips","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","tree","depth-first-search","graph"]}
|
||
{"id":2740,"frontendId":2632,"title":"Curry","titleSlug":"curry","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":2741,"frontendId":2629,"title":"Function Composition","titleSlug":"function-composition","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2742,"frontendId":2631,"title":"Group By","titleSlug":"group-by","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":2743,"frontendId":2627,"title":"Debounce","titleSlug":"debounce","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":2744,"frontendId":2630,"title":"Memoize II","titleSlug":"memoize-ii","difficulty":"HARD","paidOnly":false,"tags":[]}
|
||
{"id":2745,"frontendId":2633,"title":"Convert Object to JSON String","titleSlug":"convert-object-to-json-string","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":2746,"frontendId":2634,"title":"Filter Elements from Array","titleSlug":"filter-elements-from-array","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2747,"frontendId":2635,"title":"Apply Transform Over Each Element in Array","titleSlug":"apply-transform-over-each-element-in-array","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2748,"frontendId":2651,"title":"Calculate Delayed Arrival Time","titleSlug":"calculate-delayed-arrival-time","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":2749,"frontendId":2637,"title":"Promise Time Limit","titleSlug":"promise-time-limit","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":2750,"frontendId":2636,"title":"Promise Pool","titleSlug":"promise-pool","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":2751,"frontendId":2653,"title":"Sliding Subarray Beauty","titleSlug":"sliding-subarray-beauty","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sliding-window"]}
|
||
{"id":2752,"frontendId":2652,"title":"Sum Multiples","titleSlug":"sum-multiples","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":2753,"frontendId":2654,"title":"Minimum Number of Operations to Make All Array Elements Equal to 1","titleSlug":"minimum-number-of-operations-to-make-all-array-elements-equal-to-1","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","number-theory"]}
|
||
{"id":2754,"frontendId":2708,"title":"Maximum Strength of a Group","titleSlug":"maximum-strength-of-a-group","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","backtracking","greedy","bit-manipulation","sorting","enumeration"]}
|
||
{"id":2755,"frontendId":2707,"title":"Extra Characters in a String","titleSlug":"extra-characters-in-a-string","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","dynamic-programming","trie"]}
|
||
{"id":2756,"frontendId":2706,"title":"Buy Two Chocolates","titleSlug":"buy-two-chocolates","difficulty":"EASY","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":2757,"frontendId":2719,"title":"Count of Integers","titleSlug":"count-of-integers","difficulty":"HARD","paidOnly":false,"tags":["math","string","dynamic-programming"]}
|
||
{"id":2758,"frontendId":2618,"title":"Check if Object Instance of Class","titleSlug":"check-if-object-instance-of-class","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":2759,"frontendId":2625,"title":"Flatten Deeply Nested Array","titleSlug":"flatten-deeply-nested-array","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":2760,"frontendId":2624,"title":"Snail Traversal","titleSlug":"snail-traversal","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":2761,"frontendId":2626,"title":"Array Reduce Transformation","titleSlug":"array-reduce-transformation","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2762,"frontendId":2622,"title":"Cache With Time Limit","titleSlug":"cache-with-time-limit","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":2764,"frontendId":2658,"title":"Maximum Number of Fish in a Grid","titleSlug":"maximum-number-of-fish-in-a-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","union-find","matrix"]}
|
||
{"id":2765,"frontendId":2659,"title":"Make Array Empty","titleSlug":"make-array-empty","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","greedy","binary-indexed-tree","segment-tree","sorting","ordered-set"]}
|
||
{"id":2766,"frontendId":2657,"title":"Find the Prefix Common Array of Two Arrays","titleSlug":"find-the-prefix-common-array-of-two-arrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","bit-manipulation"]}
|
||
{"id":2767,"frontendId":2656,"title":"Maximum Sum With Exactly K Elements ","titleSlug":"maximum-sum-with-exactly-k-elements","difficulty":"EASY","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":2768,"frontendId":2774,"title":"Array Upper Bound","titleSlug":"array-upper-bound","difficulty":"EASY","paidOnly":true,"tags":[]}
|
||
{"id":2769,"frontendId":2675,"title":"Array of Objects to Matrix","titleSlug":"array-of-objects-to-matrix","difficulty":"HARD","paidOnly":true,"tags":[]}
|
||
{"id":2770,"frontendId":2754,"title":"Bind Function to Context","titleSlug":"bind-function-to-context","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":2771,"frontendId":2676,"title":"Throttle","titleSlug":"throttle","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":2772,"frontendId":2690,"title":"Infinite Method Object","titleSlug":"infinite-method-object","difficulty":"EASY","paidOnly":true,"tags":[]}
|
||
{"id":2773,"frontendId":2691,"title":"Immutability Helper","titleSlug":"immutability-helper","difficulty":"HARD","paidOnly":true,"tags":[]}
|
||
{"id":2774,"frontendId":2700,"title":"Differences Between Two Objects","titleSlug":"differences-between-two-objects","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":2775,"frontendId":2648,"title":"Generate Fibonacci Sequence","titleSlug":"generate-fibonacci-sequence","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2776,"frontendId":2692,"title":"Make Object Immutable","titleSlug":"make-object-immutable","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":2777,"frontendId":2670,"title":"Find the Distinct Difference Array","titleSlug":"find-the-distinct-difference-array","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":2778,"frontendId":2671,"title":"Frequency Tracker","titleSlug":"frequency-tracker","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","design"]}
|
||
{"id":2779,"frontendId":2672,"title":"Number of Adjacent Elements With the Same Color","titleSlug":"number-of-adjacent-elements-with-the-same-color","difficulty":"MEDIUM","paidOnly":false,"tags":["array"]}
|
||
{"id":2780,"frontendId":2673,"title":"Make Costs of Paths Equal in a Binary Tree","titleSlug":"make-costs-of-paths-equal-in-a-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","greedy","tree","binary-tree"]}
|
||
{"id":2781,"frontendId":2775,"title":"Undefined to Null","titleSlug":"undefined-to-null","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":2782,"frontendId":2776,"title":"Convert Callback Based Function to Promise Based Function","titleSlug":"convert-callback-based-function-to-promise-based-function","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":2783,"frontendId":2649,"title":"Nested Array Generator","titleSlug":"nested-array-generator","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":2784,"frontendId":2681,"title":"Power of Heroes","titleSlug":"power-of-heroes","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","sorting","prefix-sum"]}
|
||
{"id":2785,"frontendId":2717,"title":"Semi-Ordered Permutation","titleSlug":"semi-ordered-permutation","difficulty":"EASY","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":2786,"frontendId":2730,"title":"Find the Longest Semi-Repetitive Substring","titleSlug":"find-the-longest-semi-repetitive-substring","difficulty":"MEDIUM","paidOnly":false,"tags":["string","sliding-window"]}
|
||
{"id":2787,"frontendId":2731,"title":"Movement of Robots","titleSlug":"movement-of-robots","difficulty":"MEDIUM","paidOnly":false,"tags":["array","brainteaser","sorting","prefix-sum"]}
|
||
{"id":2788,"frontendId":2650,"title":"Design Cancellable Function","titleSlug":"design-cancellable-function","difficulty":"HARD","paidOnly":false,"tags":[]}
|
||
{"id":2789,"frontendId":2665,"title":"Counter II","titleSlug":"counter-ii","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2790,"frontendId":2693,"title":"Call Function with Custom Context","titleSlug":"call-function-with-custom-context","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":2791,"frontendId":2682,"title":"Find the Losers of the Circular Game","titleSlug":"find-the-losers-of-the-circular-game","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","simulation"]}
|
||
{"id":2792,"frontendId":2683,"title":"Neighboring Bitwise XOR","titleSlug":"neighboring-bitwise-xor","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation"]}
|
||
{"id":2793,"frontendId":2685,"title":"Count the Number of Complete Components","titleSlug":"count-the-number-of-complete-components","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":2794,"frontendId":2684,"title":"Maximum Number of Moves in a Grid","titleSlug":"maximum-number-of-moves-in-a-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":2795,"frontendId":2755,"title":"Deep Merge of Two Objects","titleSlug":"deep-merge-of-two-objects","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":2796,"frontendId":2666,"title":"Allow One Function Call","titleSlug":"allow-one-function-call","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2797,"frontendId":2694,"title":"Event Emitter","titleSlug":"event-emitter","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":2798,"frontendId":2677,"title":"Chunk Array","titleSlug":"chunk-array","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2799,"frontendId":2777,"title":"Date Range Generator","titleSlug":"date-range-generator","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":2800,"frontendId":2696,"title":"Minimum String Length After Removing Substrings","titleSlug":"minimum-string-length-after-removing-substrings","difficulty":"EASY","paidOnly":false,"tags":["string","stack","simulation"]}
|
||
{"id":2801,"frontendId":2711,"title":"Difference of Number of Distinct Values on Diagonals","titleSlug":"difference-of-number-of-distinct-values-on-diagonals","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","matrix"]}
|
||
{"id":2802,"frontendId":2698,"title":"Find the Punishment Number of an Integer","titleSlug":"find-the-punishment-number-of-an-integer","difficulty":"MEDIUM","paidOnly":false,"tags":["math","backtracking"]}
|
||
{"id":2803,"frontendId":2699,"title":"Modify Graph Edge Weights","titleSlug":"modify-graph-edge-weights","difficulty":"HARD","paidOnly":false,"tags":["graph","heap-priority-queue","shortest-path"]}
|
||
{"id":2804,"frontendId":2705,"title":"Compact Object","titleSlug":"compact-object","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":2805,"frontendId":2695,"title":"Array Wrapper","titleSlug":"array-wrapper","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2806,"frontendId":2756,"title":"Query Batching","titleSlug":"query-batching","difficulty":"HARD","paidOnly":true,"tags":[]}
|
||
{"id":2807,"frontendId":2721,"title":"Execute Asynchronous Functions in Parallel","titleSlug":"execute-asynchronous-functions-in-parallel","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":2808,"frontendId":2742,"title":"Painting the Walls","titleSlug":"painting-the-walls","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":2809,"frontendId":2667,"title":"Create Hello World Function","titleSlug":"create-hello-world-function","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2810,"frontendId":2735,"title":"Collecting Chocolates","titleSlug":"collecting-chocolates","difficulty":"MEDIUM","paidOnly":false,"tags":["array","enumeration"]}
|
||
{"id":2811,"frontendId":2829,"title":"Determine the Minimum Sum of a k-avoiding Array","titleSlug":"determine-the-minimum-sum-of-a-k-avoiding-array","difficulty":"MEDIUM","paidOnly":false,"tags":["math","greedy"]}
|
||
{"id":2812,"frontendId":2769,"title":"Find the Maximum Achievable Number","titleSlug":"find-the-maximum-achievable-number","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":2813,"frontendId":2704,"title":"To Be Or Not To Be","titleSlug":"to-be-or-not-to-be","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2814,"frontendId":2757,"title":"Generate Circular Array Values","titleSlug":"generate-circular-array-values","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":2815,"frontendId":2655,"title":"Find Maximal Uncovered Ranges","titleSlug":"find-maximal-uncovered-ranges","difficulty":"MEDIUM","paidOnly":true,"tags":["array","sorting"]}
|
||
{"id":2816,"frontendId":2697,"title":"Lexicographically Smallest Palindrome","titleSlug":"lexicographically-smallest-palindrome","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string","greedy"]}
|
||
{"id":2817,"frontendId":2712,"title":"Minimum Cost to Make All Characters Equal","titleSlug":"minimum-cost-to-make-all-characters-equal","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming","greedy"]}
|
||
{"id":2818,"frontendId":2713,"title":"Maximum Strictly Increasing Cells in a Matrix","titleSlug":"maximum-strictly-increasing-cells-in-a-matrix","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","binary-search","dynamic-programming","memoization","sorting","matrix","ordered-set"]}
|
||
{"id":2819,"frontendId":2710,"title":"Remove Trailing Zeros From a String","titleSlug":"remove-trailing-zeros-from-a-string","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":2820,"frontendId":2703,"title":"Return Length of Arguments Passed","titleSlug":"return-length-of-arguments-passed","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2821,"frontendId":2715,"title":"Timeout Cancellation","titleSlug":"timeout-cancellation","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2822,"frontendId":2758,"title":"Next Day","titleSlug":"next-day","difficulty":"EASY","paidOnly":true,"tags":[]}
|
||
{"id":2823,"frontendId":2664,"title":"The Knight’s Tour","titleSlug":"the-knights-tour","difficulty":"MEDIUM","paidOnly":true,"tags":["array","backtracking","matrix"]}
|
||
{"id":2824,"frontendId":2729,"title":"Check if The Number is Fascinating","titleSlug":"check-if-the-number-is-fascinating","difficulty":"EASY","paidOnly":false,"tags":["hash-table","math"]}
|
||
{"id":2825,"frontendId":2716,"title":"Minimize String Length","titleSlug":"minimize-string-length","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":2826,"frontendId":2732,"title":"Find a Good Subset of the Matrix","titleSlug":"find-a-good-subset-of-the-matrix","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","bit-manipulation","matrix"]}
|
||
{"id":2827,"frontendId":2709,"title":"Greatest Common Divisor Traversal","titleSlug":"greatest-common-divisor-traversal","difficulty":"HARD","paidOnly":false,"tags":["array","math","union-find","number-theory"]}
|
||
{"id":2828,"frontendId":2734,"title":"Lexicographically Smallest String After Substring Operation","titleSlug":"lexicographically-smallest-string-after-substring-operation","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":2829,"frontendId":2668,"title":"Find Latest Salaries","titleSlug":"find-latest-salaries","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":2830,"frontendId":2669,"title":"Count Artist Occurrences On Spotify Ranking List","titleSlug":"count-artist-occurrences-on-spotify-ranking-list","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":2831,"frontendId":2748,"title":"Number of Beautiful Pairs","titleSlug":"number-of-beautiful-pairs","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","math","counting","number-theory"]}
|
||
{"id":2832,"frontendId":2831,"title":"Find the Longest Equal Subarray","titleSlug":"find-the-longest-equal-subarray","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","binary-search","sliding-window"]}
|
||
{"id":2833,"frontendId":2747,"title":"Count Zero Request Servers","titleSlug":"count-zero-request-servers","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sliding-window","sorting"]}
|
||
{"id":2834,"frontendId":2766,"title":"Relocate Marbles","titleSlug":"relocate-marbles","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sorting","simulation"]}
|
||
{"id":2835,"frontendId":2674,"title":"Split a Circular Linked List","titleSlug":"split-a-circular-linked-list","difficulty":"MEDIUM","paidOnly":true,"tags":["linked-list","two-pointers"]}
|
||
{"id":2836,"frontendId":2733,"title":"Neither Minimum nor Maximum","titleSlug":"neither-minimum-nor-maximum","difficulty":"EASY","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":2837,"frontendId":2749,"title":"Minimum Operations to Make the Integer Zero","titleSlug":"minimum-operations-to-make-the-integer-zero","difficulty":"MEDIUM","paidOnly":false,"tags":["bit-manipulation","brainteaser","enumeration"]}
|
||
{"id":2838,"frontendId":2718,"title":"Sum of Matrix After Queries","titleSlug":"sum-of-matrix-after-queries","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":2839,"frontendId":2736,"title":"Maximum Sum Queries","titleSlug":"maximum-sum-queries","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","stack","binary-indexed-tree","segment-tree","sorting","monotonic-stack"]}
|
||
{"id":2840,"frontendId":2686,"title":"Immediate Food Delivery III","titleSlug":"immediate-food-delivery-iii","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2841,"frontendId":2687,"title":"Bikes Last Time Used ","titleSlug":"bikes-last-time-used","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":2842,"frontendId":2688,"title":"Find Active Users","titleSlug":"find-active-users","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2843,"frontendId":2689,"title":"Extract Kth Character From The Rope Tree","titleSlug":"extract-kth-character-from-the-rope-tree","difficulty":"EASY","paidOnly":true,"tags":["tree","depth-first-search","binary-tree"]}
|
||
{"id":2844,"frontendId":2778,"title":"Sum of Squares of Special Elements ","titleSlug":"sum-of-squares-of-special-elements","difficulty":"EASY","paidOnly":false,"tags":["array","enumeration"]}
|
||
{"id":2845,"frontendId":2740,"title":"Find the Value of the Partition","titleSlug":"find-the-value-of-the-partition","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":2846,"frontendId":2751,"title":"Robot Collisions","titleSlug":"robot-collisions","difficulty":"HARD","paidOnly":false,"tags":["array","stack","sorting","simulation"]}
|
||
{"id":2847,"frontendId":2744,"title":"Find Maximum Number of String Pairs","titleSlug":"find-maximum-number-of-string-pairs","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string","simulation"]}
|
||
{"id":2848,"frontendId":2741,"title":"Special Permutations","titleSlug":"special-permutations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","bitmask"]}
|
||
{"id":2849,"frontendId":2763,"title":"Sum of Imbalance Numbers of All Subarrays","titleSlug":"sum-of-imbalance-numbers-of-all-subarrays","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","enumeration"]}
|
||
{"id":2850,"frontendId":2745,"title":"Construct the Longest New String","titleSlug":"construct-the-longest-new-string","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming","greedy","brainteaser"]}
|
||
{"id":2851,"frontendId":2759,"title":"Convert JSON String to Object","titleSlug":"convert-json-string-to-object","difficulty":"HARD","paidOnly":true,"tags":[]}
|
||
{"id":2852,"frontendId":2752,"title":"Customers with Maximum Number of Transactions on Consecutive Days","titleSlug":"customers-with-maximum-number-of-transactions-on-consecutive-days","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2853,"frontendId":2701,"title":"Consecutive Transactions with Increasing Amounts","titleSlug":"consecutive-transactions-with-increasing-amounts","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2854,"frontendId":2746,"title":"Decremental String Concatenation","titleSlug":"decremental-string-concatenation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","dynamic-programming"]}
|
||
{"id":2855,"frontendId":2770,"title":"Maximum Number of Jumps to Reach the Last Index","titleSlug":"maximum-number-of-jumps-to-reach-the-last-index","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":2856,"frontendId":2799,"title":"Count Complete Subarrays in an Array","titleSlug":"count-complete-subarrays-in-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sliding-window"]}
|
||
{"id":2857,"frontendId":2739,"title":"Total Distance Traveled","titleSlug":"total-distance-traveled","difficulty":"EASY","paidOnly":false,"tags":["math","simulation"]}
|
||
{"id":2858,"frontendId":2722,"title":"Join Two Arrays by ID","titleSlug":"join-two-arrays-by-id","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":2859,"frontendId":2723,"title":"Add Two Promises","titleSlug":"add-two-promises","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2860,"frontendId":2724,"title":"Sort By","titleSlug":"sort-by","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2861,"frontendId":2794,"title":"Create Object from Two Arrays","titleSlug":"create-object-from-two-arrays","difficulty":"EASY","paidOnly":true,"tags":[]}
|
||
{"id":2862,"frontendId":2725,"title":"Interval Cancellation","titleSlug":"interval-cancellation","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2863,"frontendId":2726,"title":"Calculator with Method Chaining","titleSlug":"calculator-with-method-chaining","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2864,"frontendId":2727,"title":"Is Object Empty","titleSlug":"is-object-empty","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":2865,"frontendId":2714,"title":"Find Shortest Path with K Hops","titleSlug":"find-shortest-path-with-k-hops","difficulty":"HARD","paidOnly":true,"tags":["graph","heap-priority-queue","shortest-path"]}
|
||
{"id":2866,"frontendId":2760,"title":"Longest Even Odd Subarray With Threshold","titleSlug":"longest-even-odd-subarray-with-threshold","difficulty":"EASY","paidOnly":false,"tags":["array","sliding-window"]}
|
||
{"id":2867,"frontendId":2750,"title":"Ways to Split Array Into Good Subarrays","titleSlug":"ways-to-split-array-into-good-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","dynamic-programming"]}
|
||
{"id":2868,"frontendId":2762,"title":"Continuous Subarrays","titleSlug":"continuous-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","queue","sliding-window","heap-priority-queue","ordered-set","monotonic-queue"]}
|
||
{"id":2869,"frontendId":2771,"title":"Longest Non-decreasing Subarray From Two Arrays","titleSlug":"longest-non-decreasing-subarray-from-two-arrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":2870,"frontendId":2765,"title":"Longest Alternating Subarray","titleSlug":"longest-alternating-subarray","difficulty":"EASY","paidOnly":false,"tags":["array","enumeration"]}
|
||
{"id":2871,"frontendId":2816,"title":"Double a Number Represented as a Linked List","titleSlug":"double-a-number-represented-as-a-linked-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","math","stack"]}
|
||
{"id":2872,"frontendId":2789,"title":"Largest Element in an Array after Merge Operations","titleSlug":"largest-element-in-an-array-after-merge-operations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":2873,"frontendId":2761,"title":"Prime Pairs With Target Sum","titleSlug":"prime-pairs-with-target-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","enumeration","number-theory"]}
|
||
{"id":2874,"frontendId":2720,"title":"Popularity Percentage","titleSlug":"popularity-percentage","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":2875,"frontendId":2728,"title":"Count Houses in a Circular Street","titleSlug":"count-houses-in-a-circular-street","difficulty":"EASY","paidOnly":true,"tags":["array","interactive"]}
|
||
{"id":2876,"frontendId":2798,"title":"Number of Employees Who Met the Target","titleSlug":"number-of-employees-who-met-the-target","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":2877,"frontendId":2800,"title":"Shortest String That Contains Three Strings","titleSlug":"shortest-string-that-contains-three-strings","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy","enumeration"]}
|
||
{"id":2878,"frontendId":2772,"title":"Apply Operations to Make All Array Elements Equal to Zero","titleSlug":"apply-operations-to-make-all-array-elements-equal-to-zero","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":2879,"frontendId":2911,"title":"Minimum Changes to Make K Semi-palindromes","titleSlug":"minimum-changes-to-make-k-semi-palindromes","difficulty":"HARD","paidOnly":false,"tags":["two-pointers","string","dynamic-programming"]}
|
||
{"id":2880,"frontendId":2737,"title":"Find the Closest Marked Node","titleSlug":"find-the-closest-marked-node","difficulty":"MEDIUM","paidOnly":true,"tags":["array","graph","heap-priority-queue","shortest-path"]}
|
||
{"id":2881,"frontendId":2788,"title":"Split Strings by Separator","titleSlug":"split-strings-by-separator","difficulty":"EASY","paidOnly":false,"tags":["array","string"]}
|
||
{"id":2882,"frontendId":2787,"title":"Ways to Express an Integer as Sum of Powers","titleSlug":"ways-to-express-an-integer-as-sum-of-powers","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":2883,"frontendId":2767,"title":"Partition String Into Minimum Beautiful Substrings","titleSlug":"partition-string-into-minimum-beautiful-substrings","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","dynamic-programming","backtracking"]}
|
||
{"id":2884,"frontendId":2781,"title":"Length of the Longest Valid Substring","titleSlug":"length-of-the-longest-valid-substring","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","string","sliding-window"]}
|
||
{"id":2885,"frontendId":2738,"title":"Count Occurrences in Text","titleSlug":"count-occurrences-in-text","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":2886,"frontendId":2810,"title":"Faulty Keyboard","titleSlug":"faulty-keyboard","difficulty":"EASY","paidOnly":false,"tags":["string","simulation"]}
|
||
{"id":2887,"frontendId":2785,"title":"Sort Vowels in a String","titleSlug":"sort-vowels-in-a-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","sorting"]}
|
||
{"id":2888,"frontendId":2780,"title":"Minimum Index of a Valid Split","titleSlug":"minimum-index-of-a-valid-split","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sorting"]}
|
||
{"id":2889,"frontendId":2768,"title":"Number of Black Blocks","titleSlug":"number-of-black-blocks","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","enumeration"]}
|
||
{"id":2890,"frontendId":2743,"title":"Count Substrings Without Repeating Character","titleSlug":"count-substrings-without-repeating-character","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":2891,"frontendId":2779,"title":"Maximum Beauty of an Array After Applying Operation","titleSlug":"maximum-beauty-of-an-array-after-applying-operation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","sliding-window","sorting"]}
|
||
{"id":2892,"frontendId":2784,"title":"Check if Array is Good","titleSlug":"check-if-array-is-good","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sorting"]}
|
||
{"id":2893,"frontendId":2786,"title":"Visit Array Positions to Maximize Score","titleSlug":"visit-array-positions-to-maximize-score","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":2894,"frontendId":2813,"title":"Maximum Elegance of a K-Length Subsequence","titleSlug":"maximum-elegance-of-a-k-length-subsequence","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","stack","greedy","sorting","heap-priority-queue"]}
|
||
{"id":2897,"frontendId":2753,"title":"Count Houses in a Circular Street II","titleSlug":"count-houses-in-a-circular-street-ii","difficulty":"HARD","paidOnly":true,"tags":[]}
|
||
{"id":2898,"frontendId":2795,"title":"Parallel Execution of Promises for Individual Results Retrieval","titleSlug":"parallel-execution-of-promises-for-individual-results-retrieval","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":2899,"frontendId":2796,"title":"Repeat String","titleSlug":"repeat-string","difficulty":"EASY","paidOnly":true,"tags":[]}
|
||
{"id":2900,"frontendId":2797,"title":"Partial Function with Placeholders","titleSlug":"partial-function-with-placeholders","difficulty":"EASY","paidOnly":true,"tags":[]}
|
||
{"id":2901,"frontendId":2803,"title":"Factorial Generator","titleSlug":"factorial-generator","difficulty":"EASY","paidOnly":true,"tags":[]}
|
||
{"id":2902,"frontendId":2815,"title":"Max Pair Sum in an Array","titleSlug":"max-pair-sum-in-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":2903,"frontendId":2807,"title":"Insert Greatest Common Divisors in Linked List","titleSlug":"insert-greatest-common-divisors-in-linked-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","math","number-theory"]}
|
||
{"id":2904,"frontendId":2826,"title":"Sorting Three Groups","titleSlug":"sorting-three-groups","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","dynamic-programming"]}
|
||
{"id":2905,"frontendId":2791,"title":"Count Paths That Can Form a Palindrome in a Tree","titleSlug":"count-paths-that-can-form-a-palindrome-in-a-tree","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","bit-manipulation","tree","depth-first-search","bitmask"]}
|
||
{"id":2907,"frontendId":2804,"title":"Array Prototype ForEach","titleSlug":"array-prototype-foreach","difficulty":"EASY","paidOnly":true,"tags":[]}
|
||
{"id":2908,"frontendId":2805,"title":"Custom Interval","titleSlug":"custom-interval","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":2909,"frontendId":2821,"title":"Delay the Resolution of Each Promise","titleSlug":"delay-the-resolution-of-each-promise","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":2912,"frontendId":2823,"title":"Deep Object Filter","titleSlug":"deep-object-filter","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":2914,"frontendId":2812,"title":"Find the Safest Path in a Grid","titleSlug":"find-the-safest-path-in-a-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","breadth-first-search","union-find","heap-priority-queue","matrix"]}
|
||
{"id":2915,"frontendId":2845,"title":"Count of Interesting Subarrays","titleSlug":"count-of-interesting-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":2916,"frontendId":2811,"title":"Check if it is Possible to Split Array","titleSlug":"check-if-it-is-possible-to-split-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","greedy"]}
|
||
{"id":2917,"frontendId":2824,"title":"Count Pairs Whose Sum is Less than Target","titleSlug":"count-pairs-whose-sum-is-less-than-target","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","binary-search","sorting"]}
|
||
{"id":2918,"frontendId":2764,"title":"Is Array a Preorder of Some Binary Tree","titleSlug":"is-array-a-preorder-of-some-binary-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["stack","tree","depth-first-search","binary-tree"]}
|
||
{"id":2919,"frontendId":2790,"title":"Maximum Number of Groups With Increasing Length","titleSlug":"maximum-number-of-groups-with-increasing-length","difficulty":"HARD","paidOnly":false,"tags":["array","math","binary-search","greedy","sorting"]}
|
||
{"id":2920,"frontendId":2808,"title":"Minimum Seconds to Equalize a Circular Array","titleSlug":"minimum-seconds-to-equalize-a-circular-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":2921,"frontendId":2801,"title":"Count Stepping Numbers in Range","titleSlug":"count-stepping-numbers-in-range","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":2925,"frontendId":2822,"title":"Inversion of Object","titleSlug":"inversion-of-object","difficulty":"EASY","paidOnly":true,"tags":[]}
|
||
{"id":2944,"frontendId":2773,"title":"Height of Special Binary Tree","titleSlug":"height-of-special-binary-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":2952,"frontendId":2809,"title":"Minimum Time to Make Array Sum At Most x","titleSlug":"minimum-time-to-make-array-sum-at-most-x","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","sorting"]}
|
||
{"id":2953,"frontendId":2857,"title":"Count Pairs of Points With Distance k","titleSlug":"count-pairs-of-points-with-distance-k","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","bit-manipulation"]}
|
||
{"id":2954,"frontendId":2841,"title":"Maximum Sum of Almost Unique Subarray","titleSlug":"maximum-sum-of-almost-unique-subarray","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sliding-window"]}
|
||
{"id":2955,"frontendId":2806,"title":"Account Balance After Rounded Purchase","titleSlug":"account-balance-after-rounded-purchase","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":2977,"frontendId":2828,"title":"Check if a String Is an Acronym of Words","titleSlug":"check-if-a-string-is-an-acronym-of-words","difficulty":"EASY","paidOnly":false,"tags":["array","string"]}
|
||
{"id":2978,"frontendId":2840,"title":"Check if Strings Can be Made Equal With Operations II","titleSlug":"check-if-strings-can-be-made-equal-with-operations-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sorting"]}
|
||
{"id":2979,"frontendId":2830,"title":"Maximize the Profit as the Salesman","titleSlug":"maximize-the-profit-as-the-salesman","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","binary-search","dynamic-programming","sorting"]}
|
||
{"id":2995,"frontendId":2782,"title":"Number of Unique Categories","titleSlug":"number-of-unique-categories","difficulty":"MEDIUM","paidOnly":true,"tags":["union-find","interactive","counting"]}
|
||
{"id":2998,"frontendId":2843,"title":" Count Symmetric Integers","titleSlug":"count-symmetric-integers","difficulty":"EASY","paidOnly":false,"tags":["math","enumeration"]}
|
||
{"id":2999,"frontendId":2839,"title":"Check if Strings Can be Made Equal With Operations I","titleSlug":"check-if-strings-can-be-made-equal-with-operations-i","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":3000,"frontendId":2817,"title":"Minimum Absolute Difference Between Elements With Constraint","titleSlug":"minimum-absolute-difference-between-elements-with-constraint","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","ordered-set"]}
|
||
{"id":3001,"frontendId":2818,"title":"Apply Operations to Maximize Score","titleSlug":"apply-operations-to-maximize-score","difficulty":"HARD","paidOnly":false,"tags":["array","math","stack","greedy","sorting","monotonic-stack","number-theory"]}
|
||
{"id":3002,"frontendId":2783,"title":"Flight Occupancy and Waitlist Analysis","titleSlug":"flight-occupancy-and-waitlist-analysis","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3003,"frontendId":2793,"title":"Status of Flight Tickets","titleSlug":"status-of-flight-tickets","difficulty":"HARD","paidOnly":true,"tags":[]}
|
||
{"id":3016,"frontendId":2792,"title":"Count Nodes That Are Great Enough","titleSlug":"count-nodes-that-are-great-enough","difficulty":"HARD","paidOnly":true,"tags":["divide-and-conquer","tree","depth-first-search","binary-tree"]}
|
||
{"id":3017,"frontendId":2827,"title":"Number of Beautiful Integers in the Range","titleSlug":"number-of-beautiful-integers-in-the-range","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming"]}
|
||
{"id":3018,"frontendId":2825,"title":"Make String a Subsequence Using Cyclic Increments","titleSlug":"make-string-a-subsequence-using-cyclic-increments","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":3019,"frontendId":2833,"title":"Furthest Point From Origin","titleSlug":"furthest-point-from-origin","difficulty":"EASY","paidOnly":false,"tags":["string","counting"]}
|
||
{"id":3024,"frontendId":2851,"title":"String Transformation","titleSlug":"string-transformation","difficulty":"HARD","paidOnly":false,"tags":["math","string","dynamic-programming","string-matching"]}
|
||
{"id":3025,"frontendId":2835,"title":"Minimum Operations to Form Subsequence With Target Sum","titleSlug":"minimum-operations-to-form-subsequence-with-target-sum","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","bit-manipulation"]}
|
||
{"id":3026,"frontendId":2834,"title":"Find the Minimum Possible Sum of a Beautiful Array","titleSlug":"find-the-minimum-possible-sum-of-a-beautiful-array","difficulty":"MEDIUM","paidOnly":false,"tags":["math","greedy"]}
|
||
{"id":3030,"frontendId":2802,"title":"Find The K-th Lucky Number","titleSlug":"find-the-k-th-lucky-number","difficulty":"MEDIUM","paidOnly":true,"tags":["math","string","bit-manipulation"]}
|
||
{"id":3031,"frontendId":2906,"title":"Construct Product Matrix","titleSlug":"construct-product-matrix","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","prefix-sum"]}
|
||
{"id":3032,"frontendId":2836,"title":"Maximize Value of Function in a Ball Passing Game","titleSlug":"maximize-value-of-function-in-a-ball-passing-game","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation"]}
|
||
{"id":3033,"frontendId":2896,"title":"Apply Operations to Make Two Strings Equal","titleSlug":"apply-operations-to-make-two-strings-equal","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":3034,"frontendId":2848,"title":"Points That Intersect With Cars","titleSlug":"points-that-intersect-with-cars","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":3043,"frontendId":2814,"title":"Minimum Time Takes to Reach Destination Without Drowning","titleSlug":"minimum-time-takes-to-reach-destination-without-drowning","difficulty":"HARD","paidOnly":true,"tags":["array","breadth-first-search","matrix"]}
|
||
{"id":3044,"frontendId":2869,"title":"Minimum Operations to Collect Elements","titleSlug":"minimum-operations-to-collect-elements","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","bit-manipulation"]}
|
||
{"id":3045,"frontendId":2855,"title":"Minimum Right Shifts to Sort the Array","titleSlug":"minimum-right-shifts-to-sort-the-array","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":3046,"frontendId":2844,"title":"Minimum Operations to Make a Special Number","titleSlug":"minimum-operations-to-make-a-special-number","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string","greedy","enumeration"]}
|
||
{"id":3047,"frontendId":2862,"title":"Maximum Element-Sum of a Complete Subset of Indices","titleSlug":"maximum-element-sum-of-a-complete-subset-of-indices","difficulty":"HARD","paidOnly":false,"tags":["array","math","number-theory"]}
|
||
{"id":3055,"frontendId":2864,"title":"Maximum Odd Binary Number","titleSlug":"maximum-odd-binary-number","difficulty":"EASY","paidOnly":false,"tags":["math","string","greedy"]}
|
||
{"id":3056,"frontendId":2849,"title":"Determine if a Cell Is Reachable at a Given Time","titleSlug":"determine-if-a-cell-is-reachable-at-a-given-time","difficulty":"MEDIUM","paidOnly":false,"tags":["math"]}
|
||
{"id":3057,"frontendId":2842,"title":"Count K-Subsequences of a String With Maximum Beauty","titleSlug":"count-k-subsequences-of-a-string-with-maximum-beauty","difficulty":"HARD","paidOnly":false,"tags":["hash-table","math","string","greedy","sorting","combinatorics"]}
|
||
{"id":3058,"frontendId":2872,"title":"Maximum Number of K-Divisible Components","titleSlug":"maximum-number-of-k-divisible-components","difficulty":"HARD","paidOnly":false,"tags":["tree","depth-first-search"]}
|
||
{"id":3062,"frontendId":2877,"title":"Create a DataFrame from List","titleSlug":"create-a-dataframe-from-list","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":3063,"frontendId":2891,"title":"Method Chaining","titleSlug":"method-chaining","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":3064,"frontendId":2888,"title":"Reshape Data: Concatenate","titleSlug":"reshape-data-concatenate","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":3065,"frontendId":2879,"title":"Display the First Three Rows","titleSlug":"display-the-first-three-rows","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":3066,"frontendId":2881,"title":"Create a New Column","titleSlug":"create-a-new-column","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":3067,"frontendId":2884,"title":"Modify Columns","titleSlug":"modify-columns","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":3068,"frontendId":2885,"title":"Rename Columns","titleSlug":"rename-columns","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":3069,"frontendId":2886,"title":"Change Data Type","titleSlug":"change-data-type","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":3070,"frontendId":2887,"title":"Fill Missing Data","titleSlug":"fill-missing-data","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":3071,"frontendId":2882,"title":"Drop Duplicate Rows","titleSlug":"drop-duplicate-rows","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":3072,"frontendId":2889,"title":"Reshape Data: Pivot","titleSlug":"reshape-data-pivot","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":3073,"frontendId":2890,"title":"Reshape Data: Melt","titleSlug":"reshape-data-melt","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":3074,"frontendId":2880,"title":"Select Data","titleSlug":"select-data","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":3075,"frontendId":2883,"title":"Drop Missing Data","titleSlug":"drop-missing-data","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":3076,"frontendId":2878,"title":"Get the Size of a DataFrame","titleSlug":"get-the-size-of-a-dataframe","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":3077,"frontendId":2819,"title":"Minimum Relative Loss After Buying Chocolates","titleSlug":"minimum-relative-loss-after-buying-chocolates","difficulty":"HARD","paidOnly":true,"tags":["array","binary-search","sorting","prefix-sum"]}
|
||
{"id":3078,"frontendId":2820,"title":"Election Results","titleSlug":"election-results","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":3079,"frontendId":2846,"title":"Minimum Edge Weight Equilibrium Queries in a Tree","titleSlug":"minimum-edge-weight-equilibrium-queries-in-a-tree","difficulty":"HARD","paidOnly":false,"tags":["array","tree","graph","strongly-connected-component"]}
|
||
{"id":3080,"frontendId":2871,"title":"Split Array Into Maximum Number of Subarrays","titleSlug":"split-array-into-maximum-number-of-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","bit-manipulation"]}
|
||
{"id":3081,"frontendId":2856,"title":"Minimum Array Length After Pair Removals","titleSlug":"minimum-array-length-after-pair-removals","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","two-pointers","binary-search","greedy","counting"]}
|
||
{"id":3088,"frontendId":2832,"title":"Maximal Range That Each Element Is Maximum in It","titleSlug":"maximal-range-that-each-element-is-maximum-in-it","difficulty":"MEDIUM","paidOnly":true,"tags":["array","stack","monotonic-stack"]}
|
||
{"id":3091,"frontendId":2902,"title":"Count of Sub-Multisets With Bounded Sum","titleSlug":"count-of-sub-multisets-with-bounded-sum","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","dynamic-programming","sliding-window"]}
|
||
{"id":3092,"frontendId":2850,"title":"Minimum Moves to Spread Stones Over Grid","titleSlug":"minimum-moves-to-spread-stones-over-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","backtracking","bit-manipulation","matrix","bitmask"]}
|
||
{"id":3093,"frontendId":2859,"title":"Sum of Values at Indices With K Set Bits","titleSlug":"sum-of-values-at-indices-with-k-set-bits","difficulty":"EASY","paidOnly":false,"tags":["array","bit-manipulation"]}
|
||
{"id":3094,"frontendId":2870,"title":"Minimum Number of Operations to Make Array Empty","titleSlug":"minimum-number-of-operations-to-make-array-empty","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","counting"]}
|
||
{"id":3095,"frontendId":2861,"title":"Maximum Number of Alloys","titleSlug":"maximum-number-of-alloys","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":3097,"frontendId":2837,"title":"Total Traveled Distance","titleSlug":"total-traveled-distance","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":3101,"frontendId":2838,"title":"Maximum Coins Heroes Can Collect","titleSlug":"maximum-coins-heroes-can-collect","difficulty":"MEDIUM","paidOnly":true,"tags":["array","two-pointers","binary-search","sorting","prefix-sum"]}
|
||
{"id":3104,"frontendId":2860,"title":"Happy Students","titleSlug":"happy-students","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting","enumeration"]}
|
||
{"id":3105,"frontendId":2858,"title":"Minimum Edge Reversals So Every Node Is Reachable","titleSlug":"minimum-edge-reversals-so-every-node-is-reachable","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","depth-first-search","breadth-first-search","graph"]}
|
||
{"id":3106,"frontendId":2915,"title":"Length of the Longest Subsequence That Sums to Target","titleSlug":"length-of-the-longest-subsequence-that-sums-to-target","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3107,"frontendId":2931,"title":"Maximum Spending After Buying Items","titleSlug":"maximum-spending-after-buying-items","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","sorting","heap-priority-queue","matrix"]}
|
||
{"id":3111,"frontendId":2847,"title":"Smallest Number With Given Digit Product","titleSlug":"smallest-number-with-given-digit-product","difficulty":"MEDIUM","paidOnly":true,"tags":["math","greedy"]}
|
||
{"id":3112,"frontendId":2867,"title":"Count Valid Paths in a Tree","titleSlug":"count-valid-paths-in-a-tree","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming","tree","depth-first-search","number-theory"]}
|
||
{"id":3113,"frontendId":2866,"title":"Beautiful Towers II","titleSlug":"beautiful-towers-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","monotonic-stack"]}
|
||
{"id":3114,"frontendId":2865,"title":"Beautiful Towers I","titleSlug":"beautiful-towers-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","monotonic-stack"]}
|
||
{"id":3139,"frontendId":2916,"title":"Subarrays Distinct Element Sum of Squares II","titleSlug":"subarrays-distinct-element-sum-of-squares-ii","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","binary-indexed-tree","segment-tree"]}
|
||
{"id":3140,"frontendId":2876,"title":"Count Visited Nodes in a Directed Graph","titleSlug":"count-visited-nodes-in-a-directed-graph","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","graph","memoization"]}
|
||
{"id":3141,"frontendId":2875,"title":"Minimum Size Subarray in Infinite Array","titleSlug":"minimum-size-subarray-in-infinite-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sliding-window","prefix-sum"]}
|
||
{"id":3142,"frontendId":2901,"title":"Longest Unequal Adjacent Groups Subsequence II","titleSlug":"longest-unequal-adjacent-groups-subsequence-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","dynamic-programming"]}
|
||
{"id":3143,"frontendId":2900,"title":"Longest Unequal Adjacent Groups Subsequence I","titleSlug":"longest-unequal-adjacent-groups-subsequence-i","difficulty":"EASY","paidOnly":false,"tags":["array","string","dynamic-programming","greedy"]}
|
||
{"id":3148,"frontendId":2852,"title":"Sum of Remoteness of All Cells","titleSlug":"sum-of-remoteness-of-all-cells","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","depth-first-search","breadth-first-search","union-find","matrix"]}
|
||
{"id":3150,"frontendId":2904,"title":"Shortest and Lexicographically Smallest Beautiful String","titleSlug":"shortest-and-lexicographically-smallest-beautiful-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","sliding-window"]}
|
||
{"id":3151,"frontendId":2895,"title":"Minimum Processing Time","titleSlug":"minimum-processing-time","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":3152,"frontendId":2874,"title":"Maximum Value of an Ordered Triplet II","titleSlug":"maximum-value-of-an-ordered-triplet-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array"]}
|
||
{"id":3153,"frontendId":2897,"title":"Apply Operations on Array to Maximize Sum of Squares","titleSlug":"apply-operations-on-array-to-maximize-sum-of-squares","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","greedy","bit-manipulation"]}
|
||
{"id":3154,"frontendId":2873,"title":"Maximum Value of an Ordered Triplet I","titleSlug":"maximum-value-of-an-ordered-triplet-i","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":3155,"frontendId":2853,"title":"Highest Salaries Difference","titleSlug":"highest-salaries-difference","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":3156,"frontendId":2854,"title":"Rolling Average Steps","titleSlug":"rolling-average-steps","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3158,"frontendId":2863,"title":"Maximum Length of Semi-Decreasing Subarrays","titleSlug":"maximum-length-of-semi-decreasing-subarrays","difficulty":"MEDIUM","paidOnly":true,"tags":["array","stack","sorting","monotonic-stack"]}
|
||
{"id":3160,"frontendId":2893,"title":"Calculate Orders Within Each Interval","titleSlug":"calculate-orders-within-each-interval","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3163,"frontendId":2913,"title":"Subarrays Distinct Element Sum of Squares I","titleSlug":"subarrays-distinct-element-sum-of-squares-i","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":3164,"frontendId":2899,"title":"Last Visited Integers","titleSlug":"last-visited-integers","difficulty":"EASY","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":3165,"frontendId":2903,"title":"Find Indices With Index and Value Difference I","titleSlug":"find-indices-with-index-and-value-difference-i","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers"]}
|
||
{"id":3166,"frontendId":2910,"title":"Minimum Number of Groups to Create a Valid Assignment","titleSlug":"minimum-number-of-groups-to-create-a-valid-assignment","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy"]}
|
||
{"id":3170,"frontendId":2905,"title":"Find Indices With Index and Value Difference II","titleSlug":"find-indices-with-index-and-value-difference-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers"]}
|
||
{"id":3171,"frontendId":2918,"title":"Minimum Equal Sum of Two Arrays After Replacing Zeros","titleSlug":"minimum-equal-sum-of-two-arrays-after-replacing-zeros","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":3172,"frontendId":2894,"title":"Divisible and Non-divisible Sums Difference","titleSlug":"divisible-and-non-divisible-sums-difference","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":3173,"frontendId":2868,"title":"The Wording Game","titleSlug":"the-wording-game","difficulty":"HARD","paidOnly":true,"tags":["array","math","two-pointers","string","greedy","game-theory"]}
|
||
{"id":3174,"frontendId":2914,"title":"Minimum Number of Changes to Make Binary String Beautiful","titleSlug":"minimum-number-of-changes-to-make-binary-string-beautiful","difficulty":"MEDIUM","paidOnly":false,"tags":["string"]}
|
||
{"id":3176,"frontendId":2908,"title":"Minimum Sum of Mountain Triplets I","titleSlug":"minimum-sum-of-mountain-triplets-i","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":3177,"frontendId":2892,"title":"Minimizing Array After Replacing Pairs With Their Product","titleSlug":"minimizing-array-after-replacing-pairs-with-their-product","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming","greedy"]}
|
||
{"id":3178,"frontendId":2919,"title":"Minimum Increment Operations to Make Array Beautiful","titleSlug":"minimum-increment-operations-to-make-array-beautiful","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3179,"frontendId":2920,"title":"Maximum Points After Collecting Coins From All Nodes","titleSlug":"maximum-points-after-collecting-coins-from-all-nodes","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","tree","depth-first-search","memoization"]}
|
||
{"id":3181,"frontendId":2940,"title":"Find Building Where Alice and Bob Can Meet","titleSlug":"find-building-where-alice-and-bob-can-meet","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","stack","binary-indexed-tree","segment-tree","heap-priority-queue","monotonic-stack"]}
|
||
{"id":3182,"frontendId":2898,"title":"Maximum Linear Stock Score","titleSlug":"maximum-linear-stock-score","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table"]}
|
||
{"id":3183,"frontendId":2917,"title":"Find the K-or of an Array","titleSlug":"find-the-k-or-of-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","bit-manipulation"]}
|
||
{"id":3184,"frontendId":2926,"title":"Maximum Balanced Subsequence Sum","titleSlug":"maximum-balanced-subsequence-sum","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","dynamic-programming","binary-indexed-tree","segment-tree"]}
|
||
{"id":3186,"frontendId":2909,"title":"Minimum Sum of Mountain Triplets II","titleSlug":"minimum-sum-of-mountain-triplets-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array"]}
|
||
{"id":3187,"frontendId":2907,"title":"Maximum Profitable Triplets With Increasing Prices I","titleSlug":"maximum-profitable-triplets-with-increasing-prices-i","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-indexed-tree","segment-tree"]}
|
||
{"id":3188,"frontendId":2923,"title":"Find Champion I","titleSlug":"find-champion-i","difficulty":"EASY","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":3189,"frontendId":2924,"title":"Find Champion II","titleSlug":"find-champion-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["graph"]}
|
||
{"id":3190,"frontendId":2934,"title":"Minimum Operations to Maximize Last Elements in Arrays","titleSlug":"minimum-operations-to-maximize-last-elements-in-arrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","enumeration"]}
|
||
{"id":3191,"frontendId":2925,"title":"Maximum Score After Applying Operations on a Tree","titleSlug":"maximum-score-after-applying-operations-on-a-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming","tree","depth-first-search"]}
|
||
{"id":3192,"frontendId":2939,"title":"Maximum Xor Product","titleSlug":"maximum-xor-product","difficulty":"MEDIUM","paidOnly":false,"tags":["math","greedy","bit-manipulation"]}
|
||
{"id":3193,"frontendId":2932,"title":"Maximum Strong Pair XOR I","titleSlug":"maximum-strong-pair-xor-i","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","bit-manipulation","trie","sliding-window"]}
|
||
{"id":3194,"frontendId":2942,"title":"Find Words Containing Character","titleSlug":"find-words-containing-character","difficulty":"EASY","paidOnly":false,"tags":["array","string"]}
|
||
{"id":3195,"frontendId":2938,"title":"Separate Black and White Balls","titleSlug":"separate-black-and-white-balls","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string","greedy"]}
|
||
{"id":3196,"frontendId":2968,"title":"Apply Operations to Maximize Frequency Score","titleSlug":"apply-operations-to-maximize-frequency-score","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","sliding-window","sorting","prefix-sum"]}
|
||
{"id":3197,"frontendId":2935,"title":"Maximum Strong Pair XOR II","titleSlug":"maximum-strong-pair-xor-ii","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","bit-manipulation","trie","sliding-window"]}
|
||
{"id":3198,"frontendId":2912,"title":"Number of Ways to Reach Destination in the Grid","titleSlug":"number-of-ways-to-reach-destination-in-the-grid","difficulty":"HARD","paidOnly":true,"tags":["math","dynamic-programming","combinatorics"]}
|
||
{"id":3199,"frontendId":2928,"title":"Distribute Candies Among Children I","titleSlug":"distribute-candies-among-children-i","difficulty":"EASY","paidOnly":false,"tags":["math","combinatorics","enumeration"]}
|
||
{"id":3200,"frontendId":2930,"title":"Number of Strings Which Can Be Rearranged to Contain Substring","titleSlug":"number-of-strings-which-can-be-rearranged-to-contain-substring","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming","combinatorics"]}
|
||
{"id":3201,"frontendId":2929,"title":"Distribute Candies Among Children II","titleSlug":"distribute-candies-among-children-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["math","combinatorics","enumeration"]}
|
||
{"id":3202,"frontendId":2933,"title":"High-Access Employees","titleSlug":"high-access-employees","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","sorting"]}
|
||
{"id":3203,"frontendId":2983,"title":"Palindrome Rearrangement Queries","titleSlug":"palindrome-rearrangement-queries","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","prefix-sum"]}
|
||
{"id":3204,"frontendId":2921,"title":"Maximum Profitable Triplets With Increasing Prices II","titleSlug":"maximum-profitable-triplets-with-increasing-prices-ii","difficulty":"HARD","paidOnly":true,"tags":["array","binary-indexed-tree","segment-tree"]}
|
||
{"id":3205,"frontendId":2922,"title":"Market Analysis III","titleSlug":"market-analysis-iii","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3206,"frontendId":2956,"title":"Find Common Elements Between Two Arrays","titleSlug":"find-common-elements-between-two-arrays","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":3207,"frontendId":2937,"title":"Make Three Strings Equal","titleSlug":"make-three-strings-equal","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":3208,"frontendId":2949,"title":"Count Beautiful Substrings II","titleSlug":"count-beautiful-substrings-ii","difficulty":"HARD","paidOnly":false,"tags":["hash-table","math","string","number-theory","prefix-sum"]}
|
||
{"id":3209,"frontendId":2944,"title":"Minimum Number of Coins for Fruits","titleSlug":"minimum-number-of-coins-for-fruits","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","queue","heap-priority-queue","monotonic-queue"]}
|
||
{"id":3210,"frontendId":2947,"title":"Count Beautiful Substrings I","titleSlug":"count-beautiful-substrings-i","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","math","string","enumeration","number-theory","prefix-sum"]}
|
||
{"id":3211,"frontendId":2945,"title":"Find Maximum Non-decreasing Array Length","titleSlug":"find-maximum-non-decreasing-array-length","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","dynamic-programming","stack","queue","monotonic-stack","monotonic-queue"]}
|
||
{"id":3212,"frontendId":2963,"title":"Count the Number of Good Partitions","titleSlug":"count-the-number-of-good-partitions","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","combinatorics"]}
|
||
{"id":3213,"frontendId":2962,"title":"Count Subarrays Where Max Element Appears at Least K Times","titleSlug":"count-subarrays-where-max-element-appears-at-least-k-times","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sliding-window"]}
|
||
{"id":3214,"frontendId":2943,"title":"Maximize Area of Square Hole in Grid","titleSlug":"maximize-area-of-square-hole-in-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":3215,"frontendId":2946,"title":"Matrix Similarity After Cyclic Shifts","titleSlug":"matrix-similarity-after-cyclic-shifts","difficulty":"EASY","paidOnly":false,"tags":["array","math","matrix","simulation"]}
|
||
{"id":3216,"frontendId":2927,"title":"Distribute Candies Among Children III","titleSlug":"distribute-candies-among-children-iii","difficulty":"HARD","paidOnly":true,"tags":["math","combinatorics"]}
|
||
{"id":3217,"frontendId":2959,"title":"Number of Possible Sets of Closing Branches","titleSlug":"number-of-possible-sets-of-closing-branches","difficulty":"HARD","paidOnly":false,"tags":["bit-manipulation","graph","heap-priority-queue","enumeration","shortest-path"]}
|
||
{"id":3218,"frontendId":2973,"title":"Find Number of Coins to Place in Tree Nodes","titleSlug":"find-number-of-coins-to-place-in-tree-nodes","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","tree","depth-first-search","sorting","heap-priority-queue"]}
|
||
{"id":3219,"frontendId":2948,"title":"Make Lexicographically Smallest Array by Swapping Elements","titleSlug":"make-lexicographically-smallest-array-by-swapping-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","union-find","sorting"]}
|
||
{"id":3220,"frontendId":2960,"title":"Count Tested Devices After Test Operations","titleSlug":"count-tested-devices-after-test-operations","difficulty":"EASY","paidOnly":false,"tags":["array","simulation","counting"]}
|
||
{"id":3221,"frontendId":2951,"title":"Find the Peaks","titleSlug":"find-the-peaks","difficulty":"EASY","paidOnly":false,"tags":["array","enumeration"]}
|
||
{"id":3222,"frontendId":2936,"title":"Number of Equal Numbers Blocks","titleSlug":"number-of-equal-numbers-blocks","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search","interactive"]}
|
||
{"id":3223,"frontendId":2953,"title":"Count Complete Substrings","titleSlug":"count-complete-substrings","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":3224,"frontendId":2954,"title":"Count the Number of Infection Sequences","titleSlug":"count-the-number-of-infection-sequences","difficulty":"HARD","paidOnly":false,"tags":["array","math","combinatorics"]}
|
||
{"id":3225,"frontendId":2958,"title":"Length of Longest Subarray With at Most K Frequency","titleSlug":"length-of-longest-subarray-with-at-most-k-frequency","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sliding-window"]}
|
||
{"id":3226,"frontendId":2974,"title":"Minimum Number Game","titleSlug":"minimum-number-game","difficulty":"EASY","paidOnly":false,"tags":["array","sorting","heap-priority-queue","simulation"]}
|
||
{"id":3227,"frontendId":2965,"title":"Find Missing and Repeated Values","titleSlug":"find-missing-and-repeated-values","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","math","matrix"]}
|
||
{"id":3228,"frontendId":3002,"title":"Maximum Size of a Set After Removals","titleSlug":"maximum-size-of-a-set-after-removals","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy"]}
|
||
{"id":3229,"frontendId":2967,"title":"Minimum Cost to Make Array Equalindromic","titleSlug":"minimum-cost-to-make-array-equalindromic","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","binary-search","greedy","sorting"]}
|
||
{"id":3230,"frontendId":2957,"title":"Remove Adjacent Almost-Equal Characters","titleSlug":"remove-adjacent-almost-equal-characters","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming","greedy"]}
|
||
{"id":3231,"frontendId":2952,"title":"Minimum Number of Coins to be Added","titleSlug":"minimum-number-of-coins-to-be-added","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":3232,"frontendId":2941,"title":"Maximum GCD-Sum of a Subarray","titleSlug":"maximum-gcd-sum-of-a-subarray","difficulty":"HARD","paidOnly":true,"tags":["array","math","binary-search","number-theory"]}
|
||
{"id":3233,"frontendId":3003,"title":"Maximize the Number of Partitions After Operations","titleSlug":"maximize-the-number-of-partitions-after-operations","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming","bit-manipulation","bitmask"]}
|
||
{"id":3234,"frontendId":2961,"title":"Double Modular Exponentiation","titleSlug":"double-modular-exponentiation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","simulation"]}
|
||
{"id":3235,"frontendId":2976,"title":"Minimum Cost to Convert String I","titleSlug":"minimum-cost-to-convert-string-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","graph","shortest-path"]}
|
||
{"id":3236,"frontendId":2996,"title":"Smallest Missing Integer Greater Than Sequential Prefix Sum","titleSlug":"smallest-missing-integer-greater-than-sequential-prefix-sum","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sorting"]}
|
||
{"id":3237,"frontendId":2950,"title":"Number of Divisible Substrings","titleSlug":"number-of-divisible-substrings","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","counting","prefix-sum"]}
|
||
{"id":3238,"frontendId":2977,"title":"Minimum Cost to Convert String II","titleSlug":"minimum-cost-to-convert-string-ii","difficulty":"HARD","paidOnly":false,"tags":["array","string","dynamic-programming","graph","trie","shortest-path"]}
|
||
{"id":3239,"frontendId":2998,"title":"Minimum Number of Operations to Make X and Y Equal","titleSlug":"minimum-number-of-operations-to-make-x-and-y-equal","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming","breadth-first-search","memoization"]}
|
||
{"id":3240,"frontendId":3007,"title":"Maximum Number That Sum of the Prices Is Less Than or Equal to K","titleSlug":"maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k","difficulty":"MEDIUM","paidOnly":false,"tags":["math","binary-search","dynamic-programming","bit-manipulation"]}
|
||
{"id":3241,"frontendId":2966,"title":"Divide Array Into Arrays With Max Difference","titleSlug":"divide-array-into-arrays-with-max-difference","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":3242,"frontendId":3005,"title":"Count Elements With Maximum Frequency","titleSlug":"count-elements-with-maximum-frequency","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":3243,"frontendId":2999,"title":"Count the Number of Powerful Integers","titleSlug":"count-the-number-of-powerful-integers","difficulty":"HARD","paidOnly":false,"tags":["math","string","dynamic-programming"]}
|
||
{"id":3244,"frontendId":3012,"title":"Minimize Length of Array Using Operations","titleSlug":"minimize-length-of-array-using-operations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","greedy","number-theory"]}
|
||
{"id":3245,"frontendId":3006,"title":"Find Beautiful Indices in the Given Array I","titleSlug":"find-beautiful-indices-in-the-given-array-i","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string","binary-search","rolling-hash","string-matching","hash-function"]}
|
||
{"id":3246,"frontendId":2980,"title":"Check if Bitwise OR Has Trailing Zeros","titleSlug":"check-if-bitwise-or-has-trailing-zeros","difficulty":"EASY","paidOnly":false,"tags":["array","bit-manipulation"]}
|
||
{"id":3247,"frontendId":2955,"title":"Number of Same-End Substrings","titleSlug":"number-of-same-end-substrings","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","string","counting","prefix-sum"]}
|
||
{"id":3248,"frontendId":2972,"title":"Count the Number of Incremovable Subarrays II","titleSlug":"count-the-number-of-incremovable-subarrays-ii","difficulty":"HARD","paidOnly":false,"tags":["array","two-pointers","binary-search"]}
|
||
{"id":3249,"frontendId":2997,"title":"Minimum Number of Operations to Make Array XOR Equal to K","titleSlug":"minimum-number-of-operations-to-make-array-xor-equal-to-k","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation"]}
|
||
{"id":3250,"frontendId":2975,"title":"Maximum Square Area by Removing Fences From a Field","titleSlug":"maximum-square-area-by-removing-fences-from-a-field","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","enumeration"]}
|
||
{"id":3251,"frontendId":3000,"title":"Maximum Area of Longest Diagonal Rectangle","titleSlug":"maximum-area-of-longest-diagonal-rectangle","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":3252,"frontendId":2970,"title":"Count the Number of Incremovable Subarrays I","titleSlug":"count-the-number-of-incremovable-subarrays-i","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","binary-search","enumeration"]}
|
||
{"id":3253,"frontendId":2978,"title":"Symmetric Coordinates","titleSlug":"symmetric-coordinates","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3254,"frontendId":2964,"title":"Number of Divisible Triplet Sums","titleSlug":"number-of-divisible-triplet-sums","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table"]}
|
||
{"id":3255,"frontendId":3050,"title":"Pizza Toppings Cost Analysis","titleSlug":"pizza-toppings-cost-analysis","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3256,"frontendId":3051,"title":"Find Candidates for Data Scientist Position","titleSlug":"find-candidates-for-data-scientist-position","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":3257,"frontendId":3052,"title":"Maximize Items","titleSlug":"maximize-items","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":3258,"frontendId":3053,"title":"Classifying Triangles by Lengths","titleSlug":"classifying-triangles-by-lengths","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":3259,"frontendId":3054,"title":"Binary Tree Nodes","titleSlug":"binary-tree-nodes","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3260,"frontendId":3013,"title":"Divide an Array Into Subarrays With Minimum Cost II","titleSlug":"divide-an-array-into-subarrays-with-minimum-cost-ii","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","sliding-window","heap-priority-queue"]}
|
||
{"id":3261,"frontendId":3022,"title":"Minimize OR of Remaining Elements Using Operations","titleSlug":"minimize-or-of-remaining-elements-using-operations","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","bit-manipulation"]}
|
||
{"id":3262,"frontendId":2971,"title":"Find Polygon With the Largest Perimeter","titleSlug":"find-polygon-with-the-largest-perimeter","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting","prefix-sum"]}
|
||
{"id":3263,"frontendId":3010,"title":"Divide an Array Into Subarrays With Minimum Cost I","titleSlug":"divide-an-array-into-subarrays-with-minimum-cost-i","difficulty":"EASY","paidOnly":false,"tags":["array","sorting","enumeration"]}
|
||
{"id":3264,"frontendId":3207,"title":"Maximum Points After Enemy Battles","titleSlug":"maximum-points-after-enemy-battles","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":3265,"frontendId":3026,"title":"Maximum Good Subarray Sum","titleSlug":"maximum-good-subarray-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":3266,"frontendId":2982,"title":"Find Longest Special Substring That Occurs Thrice II","titleSlug":"find-longest-special-substring-that-occurs-thrice-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","binary-search","sliding-window","counting"]}
|
||
{"id":3267,"frontendId":2981,"title":"Find Longest Special Substring That Occurs Thrice I","titleSlug":"find-longest-special-substring-that-occurs-thrice-i","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","binary-search","sliding-window","counting"]}
|
||
{"id":3268,"frontendId":2969,"title":"Minimum Number of Coins for Fruits II","titleSlug":"minimum-number-of-coins-for-fruits-ii","difficulty":"HARD","paidOnly":true,"tags":["array","dynamic-programming","queue","heap-priority-queue","monotonic-queue"]}
|
||
{"id":3269,"frontendId":3034,"title":"Number of Subarrays That Match a Pattern I","titleSlug":"number-of-subarrays-that-match-a-pattern-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","rolling-hash","string-matching","hash-function"]}
|
||
{"id":3270,"frontendId":3001,"title":"Minimum Moves to Capture The Queen","titleSlug":"minimum-moves-to-capture-the-queen","difficulty":"MEDIUM","paidOnly":false,"tags":["math","enumeration"]}
|
||
{"id":3271,"frontendId":3015,"title":"Count the Number of Houses at a Certain Distance I","titleSlug":"count-the-number-of-houses-at-a-certain-distance-i","difficulty":"MEDIUM","paidOnly":false,"tags":["breadth-first-search","graph","prefix-sum"]}
|
||
{"id":3272,"frontendId":3030,"title":"Find the Grid of Region Average","titleSlug":"find-the-grid-of-region-average","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":3273,"frontendId":2979,"title":"Most Expensive Item That Can Not Be Bought","titleSlug":"most-expensive-item-that-can-not-be-bought","difficulty":"MEDIUM","paidOnly":true,"tags":["math","dynamic-programming","number-theory"]}
|
||
{"id":3275,"frontendId":3014,"title":"Minimum Number of Pushes to Type Word I","titleSlug":"minimum-number-of-pushes-to-type-word-i","difficulty":"EASY","paidOnly":false,"tags":["math","string","greedy"]}
|
||
{"id":3276,"frontendId":3016,"title":"Minimum Number of Pushes to Type Word II","titleSlug":"minimum-number-of-pushes-to-type-word-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","greedy","sorting","counting"]}
|
||
{"id":3277,"frontendId":3027,"title":"Find the Number of Ways to Place People II","titleSlug":"find-the-number-of-ways-to-place-people-ii","difficulty":"HARD","paidOnly":false,"tags":["array","math","geometry","sorting","enumeration"]}
|
||
{"id":3278,"frontendId":3025,"title":"Find the Number of Ways to Place People I","titleSlug":"find-the-number-of-ways-to-place-people-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","geometry","sorting","enumeration"]}
|
||
{"id":3279,"frontendId":3021,"title":"Alice and Bob Playing Flower Game","titleSlug":"alice-and-bob-playing-flower-game","difficulty":"MEDIUM","paidOnly":false,"tags":["math"]}
|
||
{"id":3281,"frontendId":2984,"title":"Find Peak Calling Hours for Each City","titleSlug":"find-peak-calling-hours-for-each-city","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3282,"frontendId":2985,"title":"Calculate Compressed Mean","titleSlug":"calculate-compressed-mean","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":3283,"frontendId":2986,"title":"Find Third Transaction","titleSlug":"find-third-transaction","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3284,"frontendId":2987,"title":"Find Expensive Cities","titleSlug":"find-expensive-cities","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":3285,"frontendId":2988,"title":"Manager of the Largest Department","titleSlug":"manager-of-the-largest-department","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3286,"frontendId":2989,"title":"Class Performance","titleSlug":"class-performance","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3287,"frontendId":2990,"title":"Loan Types","titleSlug":"loan-types","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":3288,"frontendId":2991,"title":"Top Three Wineries ","titleSlug":"top-three-wineries","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":3289,"frontendId":3049,"title":"Earliest Second to Mark Indices II","titleSlug":"earliest-second-to-mark-indices-ii","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","greedy","heap-priority-queue"]}
|
||
{"id":3290,"frontendId":3036,"title":"Number of Subarrays That Match a Pattern II","titleSlug":"number-of-subarrays-that-match-a-pattern-ii","difficulty":"HARD","paidOnly":false,"tags":["array","rolling-hash","string-matching","hash-function"]}
|
||
{"id":3291,"frontendId":3011,"title":"Find if Array Can Be Sorted","titleSlug":"find-if-array-can-be-sorted","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation","sorting"]}
|
||
{"id":3292,"frontendId":3048,"title":"Earliest Second to Mark Indices I","titleSlug":"earliest-second-to-mark-indices-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":3294,"frontendId":2992,"title":"Number of Self-Divisible Permutations","titleSlug":"number-of-self-divisible-permutations","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","dynamic-programming","backtracking","bit-manipulation","number-theory","bitmask"]}
|
||
{"id":3296,"frontendId":3031,"title":"Minimum Time to Revert Word to Initial State II","titleSlug":"minimum-time-to-revert-word-to-initial-state-ii","difficulty":"HARD","paidOnly":false,"tags":["string","rolling-hash","string-matching","hash-function"]}
|
||
{"id":3297,"frontendId":3029,"title":"Minimum Time to Revert Word to Initial State I","titleSlug":"minimum-time-to-revert-word-to-initial-state-i","difficulty":"MEDIUM","paidOnly":false,"tags":["string","rolling-hash","string-matching","hash-function"]}
|
||
{"id":3298,"frontendId":3041,"title":"Maximize Consecutive Elements in an Array After Modification","titleSlug":"maximize-consecutive-elements-in-an-array-after-modification","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","sorting"]}
|
||
{"id":3299,"frontendId":3020,"title":"Find the Maximum Number of Elements in Subset","titleSlug":"find-the-maximum-number-of-elements-in-subset","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","enumeration"]}
|
||
{"id":3300,"frontendId":2993,"title":"Friday Purchases I","titleSlug":"friday-purchases-i","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3301,"frontendId":2994,"title":"Friday Purchases II ","titleSlug":"friday-purchases-ii","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":3302,"frontendId":2995,"title":"Viewers Turned Streamers","titleSlug":"viewers-turned-streamers","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":3303,"frontendId":3008,"title":"Find Beautiful Indices in the Given Array II","titleSlug":"find-beautiful-indices-in-the-given-array-ii","difficulty":"HARD","paidOnly":false,"tags":["two-pointers","string","binary-search","rolling-hash","string-matching","hash-function"]}
|
||
{"id":3304,"frontendId":3004,"title":"Maximum Subtree of the Same Color","titleSlug":"maximum-subtree-of-the-same-color","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming","tree","depth-first-search"]}
|
||
{"id":3305,"frontendId":3045,"title":"Count Prefix and Suffix Pairs II","titleSlug":"count-prefix-and-suffix-pairs-ii","difficulty":"HARD","paidOnly":false,"tags":["array","string","trie","rolling-hash","string-matching","hash-function"]}
|
||
{"id":3306,"frontendId":3080,"title":"Mark Elements on Array by Performing Queries","titleSlug":"mark-elements-on-array-by-performing-queries","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sorting","heap-priority-queue","simulation"]}
|
||
{"id":3307,"frontendId":3068,"title":"Find the Maximum Sum of Node Values","titleSlug":"find-the-maximum-sum-of-node-values","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","greedy","bit-manipulation","tree","sorting"]}
|
||
{"id":3308,"frontendId":3039,"title":"Apply Operations to Make String Empty","titleSlug":"apply-operations-to-make-string-empty","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sorting","counting"]}
|
||
{"id":3309,"frontendId":3042,"title":"Count Prefix and Suffix Pairs I","titleSlug":"count-prefix-and-suffix-pairs-i","difficulty":"EASY","paidOnly":false,"tags":["array","string","trie","rolling-hash","string-matching","hash-function"]}
|
||
{"id":3310,"frontendId":3017,"title":"Count the Number of Houses at a Certain Distance II","titleSlug":"count-the-number-of-houses-at-a-certain-distance-ii","difficulty":"HARD","paidOnly":false,"tags":["graph","prefix-sum"]}
|
||
{"id":3311,"frontendId":3028,"title":"Ant on the Boundary","titleSlug":"ant-on-the-boundary","difficulty":"EASY","paidOnly":false,"tags":["array","simulation","prefix-sum"]}
|
||
{"id":3312,"frontendId":3019,"title":"Number of Changing Keys","titleSlug":"number-of-changing-keys","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":3313,"frontendId":3077,"title":"Maximum Strength of K Disjoint Subarrays","titleSlug":"maximum-strength-of-k-disjoint-subarrays","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","prefix-sum"]}
|
||
{"id":3314,"frontendId":3044,"title":"Most Frequent Prime","titleSlug":"most-frequent-prime","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","matrix","counting","enumeration","number-theory"]}
|
||
{"id":3315,"frontendId":3009,"title":"Maximum Number of Intersections on the Chart","titleSlug":"maximum-number-of-intersections-on-the-chart","difficulty":"HARD","paidOnly":true,"tags":["array","hash-table","math","binary-indexed-tree","geometry","line-sweep","sorting"]}
|
||
{"id":3316,"frontendId":3098,"title":"Find the Sum of Subsequence Powers","titleSlug":"find-the-sum-of-subsequence-powers","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","sorting"]}
|
||
{"id":3317,"frontendId":3035,"title":"Maximum Palindromes After Operations","titleSlug":"maximum-palindromes-after-operations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","greedy","sorting","counting"]}
|
||
{"id":3318,"frontendId":3040,"title":"Maximum Number of Operations With the Same Score II","titleSlug":"maximum-number-of-operations-with-the-same-score-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","memoization"]}
|
||
{"id":3320,"frontendId":3038,"title":"Maximum Number of Operations With the Same Score I","titleSlug":"maximum-number-of-operations-with-the-same-score-i","difficulty":"EASY","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":3321,"frontendId":3024,"title":"Type of Triangle","titleSlug":"type-of-triangle","difficulty":"EASY","paidOnly":false,"tags":["array","math","sorting"]}
|
||
{"id":3323,"frontendId":3018,"title":"Maximum Number of Removal Queries That Can Be Processed I","titleSlug":"maximum-number-of-removal-queries-that-can-be-processed-i","difficulty":"HARD","paidOnly":true,"tags":["array","dynamic-programming"]}
|
||
{"id":3324,"frontendId":3046,"title":"Split the Array","titleSlug":"split-the-array","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":3325,"frontendId":3047,"title":"Find the Largest Area of Square Inside Two Rectangles","titleSlug":"find-the-largest-area-of-square-inside-two-rectangles","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","geometry"]}
|
||
{"id":3326,"frontendId":3067,"title":"Count Pairs of Connectable Servers in a Weighted Tree Network","titleSlug":"count-pairs-of-connectable-servers-in-a-weighted-tree-network","difficulty":"MEDIUM","paidOnly":false,"tags":["array","tree","depth-first-search"]}
|
||
{"id":3327,"frontendId":3086,"title":"Minimum Moves to Pick K Ones","titleSlug":"minimum-moves-to-pick-k-ones","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","sliding-window","prefix-sum"]}
|
||
{"id":3328,"frontendId":3091,"title":"Apply Operations to Make Sum of Array Greater Than or Equal to k","titleSlug":"apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k","difficulty":"MEDIUM","paidOnly":false,"tags":["math","greedy","enumeration"]}
|
||
{"id":3329,"frontendId":3043,"title":"Find the Length of the Longest Common Prefix","titleSlug":"find-the-length-of-the-longest-common-prefix","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","trie"]}
|
||
{"id":3330,"frontendId":3033,"title":"Modify the Matrix","titleSlug":"modify-the-matrix","difficulty":"EASY","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":3331,"frontendId":3065,"title":"Minimum Operations to Exceed Threshold Value I","titleSlug":"minimum-operations-to-exceed-threshold-value-i","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":3332,"frontendId":3066,"title":"Minimum Operations to Exceed Threshold Value II","titleSlug":"minimum-operations-to-exceed-threshold-value-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","heap-priority-queue","simulation"]}
|
||
{"id":3333,"frontendId":3023,"title":"Find Pattern in Infinite Stream I","titleSlug":"find-pattern-in-infinite-stream-i","difficulty":"MEDIUM","paidOnly":true,"tags":["array","sliding-window","rolling-hash","string-matching","interactive","hash-function"]}
|
||
{"id":3334,"frontendId":3074,"title":"Apple Redistribution into Boxes","titleSlug":"apple-redistribution-into-boxes","difficulty":"EASY","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":3335,"frontendId":3071,"title":"Minimum Operations to Write the Letter Y on a Grid","titleSlug":"minimum-operations-to-write-the-letter-y-on-a-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","matrix","counting"]}
|
||
{"id":3336,"frontendId":3100,"title":"Water Bottles II","titleSlug":"water-bottles-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["math","simulation"]}
|
||
{"id":3337,"frontendId":3084,"title":"Count Substrings Starting and Ending with Given Character","titleSlug":"count-substrings-starting-and-ending-with-given-character","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string","counting"]}
|
||
{"id":3338,"frontendId":3070,"title":"Count Submatrices with Top-Left Element and Sum Less Than k","titleSlug":"count-submatrices-with-top-left-element-and-sum-less-than-k","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","prefix-sum"]}
|
||
{"id":3339,"frontendId":3055,"title":"Top Percentile Fraud","titleSlug":"top-percentile-fraud","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3340,"frontendId":3056,"title":"Snaps Analysis","titleSlug":"snaps-analysis","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3343,"frontendId":3032,"title":"Count Numbers With Unique Digits II","titleSlug":"count-numbers-with-unique-digits-ii","difficulty":"EASY","paidOnly":true,"tags":["hash-table","math","dynamic-programming"]}
|
||
{"id":3344,"frontendId":3102,"title":"Minimize Manhattan Distances","titleSlug":"minimize-manhattan-distances","difficulty":"HARD","paidOnly":false,"tags":["array","math","geometry","sorting","ordered-set"]}
|
||
{"id":3345,"frontendId":3082,"title":"Find the Sum of the Power of All Subsequences","titleSlug":"find-the-sum-of-the-power-of-all-subsequences","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3346,"frontendId":3106,"title":"Lexicographically Smallest String After Operations With Constraint","titleSlug":"lexicographically-smallest-string-after-operations-with-constraint","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":3347,"frontendId":3069,"title":"Distribute Elements Into Two Arrays I","titleSlug":"distribute-elements-into-two-arrays-i","difficulty":"EASY","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":3348,"frontendId":3108,"title":"Minimum Cost Walk in Weighted Graph","titleSlug":"minimum-cost-walk-in-weighted-graph","difficulty":"HARD","paidOnly":false,"tags":["array","bit-manipulation","union-find","graph"]}
|
||
{"id":3349,"frontendId":3090,"title":"Maximum Length Substring With Two Occurrences","titleSlug":"maximum-length-substring-with-two-occurrences","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":3350,"frontendId":3072,"title":"Distribute Elements Into Two Arrays II","titleSlug":"distribute-elements-into-two-arrays-ii","difficulty":"HARD","paidOnly":false,"tags":["array","binary-indexed-tree","segment-tree","simulation"]}
|
||
{"id":3351,"frontendId":3075,"title":"Maximize Happiness of Selected Children","titleSlug":"maximize-happiness-of-selected-children","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":3352,"frontendId":3037,"title":"Find Pattern in Infinite Stream II","titleSlug":"find-pattern-in-infinite-stream-ii","difficulty":"HARD","paidOnly":true,"tags":["array","sliding-window","rolling-hash","string-matching","interactive","hash-function"]}
|
||
{"id":3353,"frontendId":3083,"title":"Existence of a Substring in a String and Its Reverse","titleSlug":"existence-of-a-substring-in-a-string-and-its-reverse","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":3354,"frontendId":3081,"title":"Replace Question Marks in String to Minimize Its Value","titleSlug":"replace-question-marks-in-string-to-minimize-its-value","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","greedy","sorting","heap-priority-queue","counting"]}
|
||
{"id":3355,"frontendId":3096,"title":"Minimum Levels to Gain More Points","titleSlug":"minimum-levels-to-gain-more-points","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":3356,"frontendId":3076,"title":"Shortest Uncommon Substring in an Array","titleSlug":"shortest-uncommon-substring-in-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","trie"]}
|
||
{"id":3357,"frontendId":3057,"title":"Employees Project Allocation","titleSlug":"employees-project-allocation","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":3358,"frontendId":3058,"title":"Friends With No Mutual Friends","titleSlug":"friends-with-no-mutual-friends","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3359,"frontendId":3063,"title":"Linked List Frequency","titleSlug":"linked-list-frequency","difficulty":"EASY","paidOnly":true,"tags":["hash-table","linked-list","counting"]}
|
||
{"id":3360,"frontendId":3085,"title":"Minimum Deletions to Make String K-Special","titleSlug":"minimum-deletions-to-make-string-k-special","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","greedy","sorting","counting"]}
|
||
{"id":3361,"frontendId":3114,"title":"Latest Time You Can Obtain After Replacing Characters","titleSlug":"latest-time-you-can-obtain-after-replacing-characters","difficulty":"EASY","paidOnly":false,"tags":["string","enumeration"]}
|
||
{"id":3362,"frontendId":3134,"title":"Find the Median of the Uniqueness Array","titleSlug":"find-the-median-of-the-uniqueness-array","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","binary-search","sliding-window"]}
|
||
{"id":3363,"frontendId":3092,"title":"Most Frequent IDs","titleSlug":"most-frequent-ids","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","heap-priority-queue","ordered-set"]}
|
||
{"id":3364,"frontendId":3117,"title":"Minimum Sum of Values by Dividing Array","titleSlug":"minimum-sum-of-values-by-dividing-array","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","dynamic-programming","bit-manipulation","segment-tree","queue"]}
|
||
{"id":3365,"frontendId":3059,"title":"Find All Unique Email Domains","titleSlug":"find-all-unique-email-domains","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":3366,"frontendId":3060,"title":"User Activities within Time Bounds","titleSlug":"user-activities-within-time-bounds","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":3367,"frontendId":3079,"title":"Find the Sum of Encrypted Integers","titleSlug":"find-the-sum-of-encrypted-integers","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
|
||
{"id":3368,"frontendId":3062,"title":"Winner of the Linked List Game","titleSlug":"winner-of-the-linked-list-game","difficulty":"EASY","paidOnly":true,"tags":["linked-list"]}
|
||
{"id":3369,"frontendId":3061,"title":"Calculate Trapping Rain Water","titleSlug":"calculate-trapping-rain-water","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":3370,"frontendId":3064,"title":"Guess the Number Using Bitwise Questions I","titleSlug":"guess-the-number-using-bitwise-questions-i","difficulty":"MEDIUM","paidOnly":true,"tags":["bit-manipulation","interactive"]}
|
||
{"id":3371,"frontendId":3099,"title":"Harshad Number","titleSlug":"harshad-number","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":3372,"frontendId":3105,"title":"Longest Strictly Increasing or Strictly Decreasing Subarray","titleSlug":"longest-strictly-increasing-or-strictly-decreasing-subarray","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":3373,"frontendId":3115,"title":"Maximum Prime Difference","titleSlug":"maximum-prime-difference","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","number-theory"]}
|
||
{"id":3374,"frontendId":3101,"title":"Count Alternating Subarrays","titleSlug":"count-alternating-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math"]}
|
||
{"id":3375,"frontendId":3116,"title":"Kth Smallest Amount With Single Denomination Combination","titleSlug":"kth-smallest-amount-with-single-denomination-combination","difficulty":"HARD","paidOnly":false,"tags":["array","math","binary-search","bit-manipulation","combinatorics","number-theory"]}
|
||
{"id":3376,"frontendId":3093,"title":"Longest Common Suffix Queries","titleSlug":"longest-common-suffix-queries","difficulty":"HARD","paidOnly":false,"tags":["array","string","trie"]}
|
||
{"id":3378,"frontendId":3073,"title":"Maximum Increasing Triplet Value","titleSlug":"maximum-increasing-triplet-value","difficulty":"MEDIUM","paidOnly":true,"tags":["array","ordered-set"]}
|
||
{"id":3379,"frontendId":3110,"title":"Score of a String","titleSlug":"score-of-a-string","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":3380,"frontendId":3097,"title":"Shortest Subarray With OR at Least K II","titleSlug":"shortest-subarray-with-or-at-least-k-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation","sliding-window"]}
|
||
{"id":3381,"frontendId":3095,"title":"Shortest Subarray With OR at Least K I","titleSlug":"shortest-subarray-with-or-at-least-k-i","difficulty":"EASY","paidOnly":false,"tags":["array","bit-manipulation","sliding-window"]}
|
||
{"id":3382,"frontendId":3113,"title":"Find the Number of Subarrays Where Boundary Elements Are Maximum","titleSlug":"find-the-number-of-subarrays-where-boundary-elements-are-maximum","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","stack","monotonic-stack"]}
|
||
{"id":3383,"frontendId":3147,"title":"Taking Maximum Energy From the Mystic Dungeon","titleSlug":"taking-maximum-energy-from-the-mystic-dungeon","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":3384,"frontendId":3137,"title":"Minimum Number of Operations to Make Word K-Periodic","titleSlug":"minimum-number-of-operations-to-make-word-k-periodic","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":3385,"frontendId":3078,"title":"Match Alphanumerical Pattern in Matrix I","titleSlug":"match-alphanumerical-pattern-in-matrix-i","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","string","matrix"]}
|
||
{"id":3386,"frontendId":3123,"title":"Find Edges in Shortest Paths","titleSlug":"find-edges-in-shortest-paths","difficulty":"HARD","paidOnly":false,"tags":["depth-first-search","breadth-first-search","graph","heap-priority-queue","shortest-path"]}
|
||
{"id":3387,"frontendId":3107,"title":"Minimum Operations to Make Median of Array Equal to K","titleSlug":"minimum-operations-to-make-median-of-array-equal-to-k","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":3388,"frontendId":3128,"title":"Right Triangles","titleSlug":"right-triangles","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","combinatorics","counting"]}
|
||
{"id":3389,"frontendId":3112,"title":"Minimum Time to Visit Disappearing Nodes","titleSlug":"minimum-time-to-visit-disappearing-nodes","difficulty":"MEDIUM","paidOnly":false,"tags":["array","graph","heap-priority-queue","shortest-path"]}
|
||
{"id":3390,"frontendId":3111,"title":"Minimum Rectangles to Cover Points","titleSlug":"minimum-rectangles-to-cover-points","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":3391,"frontendId":3148,"title":"Maximum Difference Score in a Grid","titleSlug":"maximum-difference-score-in-a-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":3392,"frontendId":3087,"title":"Find Trending Hashtags","titleSlug":"find-trending-hashtags","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3393,"frontendId":3088,"title":"Make String Anti-palindrome","titleSlug":"make-string-anti-palindrome","difficulty":"HARD","paidOnly":true,"tags":["string","greedy","sorting","counting-sort"]}
|
||
{"id":3394,"frontendId":3133,"title":"Minimum Array End","titleSlug":"minimum-array-end","difficulty":"MEDIUM","paidOnly":false,"tags":["bit-manipulation"]}
|
||
{"id":3395,"frontendId":3138,"title":"Minimum Length of Anagram Concatenation","titleSlug":"minimum-length-of-anagram-concatenation","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":3396,"frontendId":3136,"title":"Valid Word","titleSlug":"valid-word","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":3397,"frontendId":3131,"title":"Find the Integer Added to Array I","titleSlug":"find-the-integer-added-to-array-i","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":3398,"frontendId":3127,"title":"Make a Square with the Same Color","titleSlug":"make-a-square-with-the-same-color","difficulty":"EASY","paidOnly":false,"tags":["array","matrix","enumeration"]}
|
||
{"id":3399,"frontendId":3132,"title":"Find the Integer Added to Array II","titleSlug":"find-the-integer-added-to-array-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","sorting","enumeration"]}
|
||
{"id":3400,"frontendId":3089,"title":"Find Bursty Behavior","titleSlug":"find-bursty-behavior","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3401,"frontendId":3094,"title":"Guess the Number Using Bitwise Questions II","titleSlug":"guess-the-number-using-bitwise-questions-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["bit-manipulation","interactive"]}
|
||
{"id":3402,"frontendId":3139,"title":"Minimum Cost to Equalize Array","titleSlug":"minimum-cost-to-equalize-array","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","enumeration"]}
|
||
{"id":3403,"frontendId":3144,"title":"Minimum Substring Partition of Equal Character Frequency","titleSlug":"minimum-substring-partition-of-equal-character-frequency","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","dynamic-programming","counting"]}
|
||
{"id":3404,"frontendId":3122,"title":"Minimum Number of Operations to Satisfy Conditions","titleSlug":"minimum-number-of-operations-to-satisfy-conditions","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":3405,"frontendId":3121,"title":"Count the Number of Special Characters II","titleSlug":"count-the-number-of-special-characters-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":3406,"frontendId":3129,"title":"Find All Possible Stable Binary Arrays I","titleSlug":"find-all-possible-stable-binary-arrays-i","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming","prefix-sum"]}
|
||
{"id":3407,"frontendId":3130,"title":"Find All Possible Stable Binary Arrays II","titleSlug":"find-all-possible-stable-binary-arrays-ii","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","prefix-sum"]}
|
||
{"id":3408,"frontendId":3120,"title":"Count the Number of Special Characters I","titleSlug":"count-the-number-of-special-characters-i","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":3409,"frontendId":3103,"title":"Find Trending Hashtags II ","titleSlug":"find-trending-hashtags-ii","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":3410,"frontendId":3104,"title":"Find Longest Self-Contained Substring","titleSlug":"find-longest-self-contained-substring","difficulty":"HARD","paidOnly":true,"tags":["hash-table","string","sorting"]}
|
||
{"id":3411,"frontendId":3145,"title":"Find Products of Elements of Big Array","titleSlug":"find-products-of-elements-of-big-array","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","bit-manipulation"]}
|
||
{"id":3412,"frontendId":3146,"title":"Permutation Difference between Two Strings","titleSlug":"permutation-difference-between-two-strings","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":3413,"frontendId":3175,"title":"Find The First Player to win K Games in a Row","titleSlug":"find-the-first-player-to-win-k-games-in-a-row","difficulty":"MEDIUM","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":3414,"frontendId":3154,"title":"Find Number of Ways to Reach the K-th Stair","titleSlug":"find-number-of-ways-to-reach-the-k-th-stair","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming","bit-manipulation","memoization","combinatorics"]}
|
||
{"id":3415,"frontendId":3142,"title":"Check if Grid Satisfies Conditions","titleSlug":"check-if-grid-satisfies-conditions","difficulty":"EASY","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":3416,"frontendId":3153,"title":"Sum of Digit Differences of All Pairs","titleSlug":"sum-of-digit-differences-of-all-pairs","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","counting"]}
|
||
{"id":3417,"frontendId":3109,"title":"Find the Index of Permutation","titleSlug":"find-the-index-of-permutation","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search","divide-and-conquer","binary-indexed-tree","segment-tree","merge-sort","ordered-set"]}
|
||
{"id":3418,"frontendId":3185,"title":"Count Pairs That Form a Complete Day II","titleSlug":"count-pairs-that-form-a-complete-day-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":3419,"frontendId":3143,"title":"Maximum Points Inside the Square","titleSlug":"maximum-points-inside-the-square","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","binary-search","sorting"]}
|
||
{"id":3420,"frontendId":3159,"title":"Find Occurrences of an Element in an Array","titleSlug":"find-occurrences-of-an-element-in-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":3421,"frontendId":3184,"title":"Count Pairs That Form a Complete Day I","titleSlug":"count-pairs-that-form-a-complete-day-i","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":3422,"frontendId":3179,"title":"Find the N-th Value After K Seconds","titleSlug":"find-the-n-th-value-after-k-seconds","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","simulation","combinatorics","prefix-sum"]}
|
||
{"id":3423,"frontendId":3165,"title":"Maximum Sum of Subsequence With Non-adjacent Elements","titleSlug":"maximum-sum-of-subsequence-with-non-adjacent-elements","difficulty":"HARD","paidOnly":false,"tags":["array","divide-and-conquer","dynamic-programming","segment-tree"]}
|
||
{"id":3424,"frontendId":3118,"title":"Friday Purchase III ","titleSlug":"friday-purchase-iii","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3425,"frontendId":3119,"title":"Maximum Number of Potholes That Can Be Fixed","titleSlug":"maximum-number-of-potholes-that-can-be-fixed","difficulty":"MEDIUM","paidOnly":true,"tags":["string","greedy","sorting"]}
|
||
{"id":3426,"frontendId":3168,"title":"Minimum Number of Chairs in a Waiting Room","titleSlug":"minimum-number-of-chairs-in-a-waiting-room","difficulty":"EASY","paidOnly":false,"tags":["string","simulation"]}
|
||
{"id":3427,"frontendId":3152,"title":"Special Array II","titleSlug":"special-array-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","prefix-sum"]}
|
||
{"id":3428,"frontendId":3158,"title":"Find the XOR of Numbers Which Appear Twice","titleSlug":"find-the-xor-of-numbers-which-appear-twice","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","bit-manipulation"]}
|
||
{"id":3429,"frontendId":3151,"title":"Special Array I","titleSlug":"special-array-i","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":3430,"frontendId":3169,"title":"Count Days Without Meetings","titleSlug":"count-days-without-meetings","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":3431,"frontendId":3149,"title":"Find the Minimum Cost Array Permutation","titleSlug":"find-the-minimum-cost-array-permutation","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","bitmask"]}
|
||
{"id":3432,"frontendId":3124,"title":"Find Longest Calls","titleSlug":"find-longest-calls","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3433,"frontendId":3125,"title":"Maximum Number That Makes Result of Bitwise AND Zero","titleSlug":"maximum-number-that-makes-result-of-bitwise-and-zero","difficulty":"MEDIUM","paidOnly":true,"tags":["string","greedy","sorting"]}
|
||
{"id":3434,"frontendId":3160,"title":"Find the Number of Distinct Colors Among the Balls","titleSlug":"find-the-number-of-distinct-colors-among-the-balls","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","simulation"]}
|
||
{"id":3435,"frontendId":3161,"title":"Block Placement Queries","titleSlug":"block-placement-queries","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","binary-indexed-tree","segment-tree"]}
|
||
{"id":3436,"frontendId":3171,"title":"Find Subarray With Bitwise OR Closest to K","titleSlug":"find-subarray-with-bitwise-or-closest-to-k","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","bit-manipulation","segment-tree"]}
|
||
{"id":3437,"frontendId":3186,"title":"Maximum Total Damage With Spell Casting","titleSlug":"maximum-total-damage-with-spell-casting","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","two-pointers","binary-search","dynamic-programming","sorting","counting"]}
|
||
{"id":3438,"frontendId":3187,"title":"Peaks in Array","titleSlug":"peaks-in-array","difficulty":"HARD","paidOnly":false,"tags":["array","binary-indexed-tree","segment-tree"]}
|
||
{"id":3439,"frontendId":3203,"title":"Find Minimum Diameter After Merging Two Trees","titleSlug":"find-minimum-diameter-after-merging-two-trees","difficulty":"HARD","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search","graph"]}
|
||
{"id":3440,"frontendId":3126,"title":"Server Utilization Time","titleSlug":"server-utilization-time","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3441,"frontendId":3135,"title":"Equalize Strings by Adding or Removing Characters at Ends","titleSlug":"equalize-strings-by-adding-or-removing-characters-at-ends","difficulty":"MEDIUM","paidOnly":true,"tags":["string","binary-search","dynamic-programming","sliding-window","hash-function"]}
|
||
{"id":3442,"frontendId":3180,"title":"Maximum Total Reward Using Operations I","titleSlug":"maximum-total-reward-using-operations-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3443,"frontendId":3181,"title":"Maximum Total Reward Using Operations II","titleSlug":"maximum-total-reward-using-operations-ii","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation"]}
|
||
{"id":3444,"frontendId":3164,"title":"Find the Number of Good Pairs II","titleSlug":"find-the-number-of-good-pairs-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":3445,"frontendId":3170,"title":"Lexicographically Minimum String After Removing Stars","titleSlug":"lexicographically-minimum-string-after-removing-stars","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","stack","greedy","heap-priority-queue"]}
|
||
{"id":3446,"frontendId":3162,"title":"Find the Number of Good Pairs I","titleSlug":"find-the-number-of-good-pairs-i","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":3447,"frontendId":3174,"title":"Clear Digits","titleSlug":"clear-digits","difficulty":"EASY","paidOnly":false,"tags":["string","stack","simulation"]}
|
||
{"id":3448,"frontendId":3140,"title":"Consecutive Available Seats II","titleSlug":"consecutive-available-seats-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3449,"frontendId":3141,"title":"Maximum Hamming Distances","titleSlug":"maximum-hamming-distances","difficulty":"HARD","paidOnly":true,"tags":["array","bit-manipulation","breadth-first-search"]}
|
||
{"id":3450,"frontendId":3178,"title":"Find the Child Who Has the Ball After K Seconds","titleSlug":"find-the-child-who-has-the-ball-after-k-seconds","difficulty":"EASY","paidOnly":false,"tags":["math","simulation"]}
|
||
{"id":3451,"frontendId":3163,"title":"String Compression III","titleSlug":"string-compression-iii","difficulty":"MEDIUM","paidOnly":false,"tags":["string"]}
|
||
{"id":3452,"frontendId":3177,"title":"Find the Maximum Length of a Good Subsequence II","titleSlug":"find-the-maximum-length-of-a-good-subsequence-ii","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","dynamic-programming"]}
|
||
{"id":3453,"frontendId":3211,"title":"Generate Binary Strings Without Adjacent Zeros","titleSlug":"generate-binary-strings-without-adjacent-zeros","difficulty":"MEDIUM","paidOnly":false,"tags":["string","backtracking","bit-manipulation"]}
|
||
{"id":3454,"frontendId":3229,"title":"Minimum Operations to Make Array Equal to Target","titleSlug":"minimum-operations-to-make-array-equal-to-target","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","stack","greedy","monotonic-stack"]}
|
||
{"id":3455,"frontendId":3223,"title":"Minimum Length of String After Operations","titleSlug":"minimum-length-of-string-after-operations","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":3456,"frontendId":3176,"title":"Find the Maximum Length of a Good Subsequence I","titleSlug":"find-the-maximum-length-of-a-good-subsequence-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","dynamic-programming"]}
|
||
{"id":3457,"frontendId":3150,"title":"Invalid Tweets II","titleSlug":"invalid-tweets-ii","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":3458,"frontendId":3155,"title":"Maximum Number of Upgradable Servers","titleSlug":"maximum-number-of-upgradable-servers","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","binary-search"]}
|
||
{"id":3459,"frontendId":3197,"title":"Find the Minimum Area to Cover All Ones II","titleSlug":"find-the-minimum-area-to-cover-all-ones-ii","difficulty":"HARD","paidOnly":false,"tags":["array","matrix","enumeration"]}
|
||
{"id":3460,"frontendId":3193,"title":"Count the Number of Inversions","titleSlug":"count-the-number-of-inversions","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3461,"frontendId":3195,"title":"Find the Minimum Area to Cover All Ones I","titleSlug":"find-the-minimum-area-to-cover-all-ones-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix"]}
|
||
{"id":3462,"frontendId":3227,"title":"Vowels Game in a String","titleSlug":"vowels-game-in-a-string","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string","brainteaser","game-theory"]}
|
||
{"id":3463,"frontendId":3206,"title":"Alternating Groups I","titleSlug":"alternating-groups-i","difficulty":"EASY","paidOnly":false,"tags":["array","sliding-window"]}
|
||
{"id":3464,"frontendId":3196,"title":"Maximize Total Cost of Alternating Subarrays","titleSlug":"maximize-total-cost-of-alternating-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3465,"frontendId":3156,"title":"Employee Task Duration and Concurrent Tasks","titleSlug":"employee-task-duration-and-concurrent-tasks","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":3466,"frontendId":3209,"title":"Number of Subarrays With AND Value of K","titleSlug":"number-of-subarrays-with-and-value-of-k","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","bit-manipulation","segment-tree"]}
|
||
{"id":3467,"frontendId":3157,"title":"Find the Level of Tree with Minimum Sum","titleSlug":"find-the-level-of-tree-with-minimum-sum","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","breadth-first-search","binary-tree"]}
|
||
{"id":3468,"frontendId":3210,"title":"Find the Encrypted String","titleSlug":"find-the-encrypted-string","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":3469,"frontendId":3200,"title":"Maximum Height of a Triangle","titleSlug":"maximum-height-of-a-triangle","difficulty":"EASY","paidOnly":false,"tags":["array","enumeration"]}
|
||
{"id":3470,"frontendId":3225,"title":"Maximum Score From Grid Operations","titleSlug":"maximum-score-from-grid-operations","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","matrix","prefix-sum"]}
|
||
{"id":3471,"frontendId":3194,"title":"Minimum Average of Smallest and Largest Elements","titleSlug":"minimum-average-of-smallest-and-largest-elements","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","sorting"]}
|
||
{"id":3472,"frontendId":3173,"title":"Bitwise OR of Adjacent Elements","titleSlug":"bitwise-or-of-adjacent-elements","difficulty":"EASY","paidOnly":true,"tags":["array","bit-manipulation"]}
|
||
{"id":3473,"frontendId":3166,"title":"Calculate Parking Fees and Duration","titleSlug":"calculate-parking-fees-and-duration","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3474,"frontendId":3167,"title":"Better Compression of String","titleSlug":"better-compression-of-string","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","sorting","counting"]}
|
||
{"id":3475,"frontendId":3191,"title":"Minimum Operations to Make Binary Array Elements Equal to One I","titleSlug":"minimum-operations-to-make-binary-array-elements-equal-to-one-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation","queue","sliding-window","prefix-sum"]}
|
||
{"id":3476,"frontendId":3190,"title":"Find Minimum Operations to Make All Elements Divisible by Three","titleSlug":"find-minimum-operations-to-make-all-elements-divisible-by-three","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
|
||
{"id":3477,"frontendId":3192,"title":"Minimum Operations to Make Binary Array Elements Equal to One II","titleSlug":"minimum-operations-to-make-binary-array-elements-equal-to-one-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","greedy"]}
|
||
{"id":3478,"frontendId":3235,"title":"Check if the Rectangle Corner Is Reachable","titleSlug":"check-if-the-rectangle-corner-is-reachable","difficulty":"HARD","paidOnly":false,"tags":["array","math","depth-first-search","breadth-first-search","union-find","geometry"]}
|
||
{"id":3479,"frontendId":3234,"title":"Count the Number of Substrings With Dominant Ones","titleSlug":"count-the-number-of-substrings-with-dominant-ones","difficulty":"MEDIUM","paidOnly":false,"tags":["string","enumeration"]}
|
||
{"id":3480,"frontendId":3253,"title":"Construct String with Minimum Cost (Easy)","titleSlug":"construct-string-with-minimum-cost-easy","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":3481,"frontendId":3172,"title":"Second Day Verification","titleSlug":"second-day-verification","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":3482,"frontendId":3213,"title":"Construct String with Minimum Cost","titleSlug":"construct-string-with-minimum-cost","difficulty":"HARD","paidOnly":false,"tags":["array","string","dynamic-programming","suffix-array"]}
|
||
{"id":3483,"frontendId":3208,"title":"Alternating Groups II","titleSlug":"alternating-groups-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sliding-window"]}
|
||
{"id":3484,"frontendId":3216,"title":"Lexicographically Smallest String After a Swap","titleSlug":"lexicographically-smallest-string-after-a-swap","difficulty":"EASY","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":3485,"frontendId":3281,"title":"Maximize Score of Numbers in Ranges","titleSlug":"maximize-score-of-numbers-in-ranges","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","greedy","sorting"]}
|
||
{"id":3486,"frontendId":3249,"title":"Count the Number of Good Nodes","titleSlug":"count-the-number-of-good-nodes","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search"]}
|
||
{"id":3487,"frontendId":3316,"title":"Find Maximum Removals From Source String","titleSlug":"find-maximum-removals-from-source-string","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","two-pointers","string","dynamic-programming"]}
|
||
{"id":3488,"frontendId":3182,"title":"Find Top Scoring Students","titleSlug":"find-top-scoring-students","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3489,"frontendId":3183,"title":"The Number of Ways to Make the Sum","titleSlug":"the-number-of-ways-to-make-the-sum","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming"]}
|
||
{"id":3490,"frontendId":3201,"title":"Find the Maximum Length of Valid Subsequence I","titleSlug":"find-the-maximum-length-of-valid-subsequence-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3491,"frontendId":3202,"title":"Find the Maximum Length of Valid Subsequence II","titleSlug":"find-the-maximum-length-of-valid-subsequence-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3492,"frontendId":3212,"title":"Count Submatrices With Equal Frequency of X and Y","titleSlug":"count-submatrices-with-equal-frequency-of-x-and-y","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","prefix-sum"]}
|
||
{"id":3493,"frontendId":3228,"title":"Maximum Number of Operations to Move Ones to the End","titleSlug":"maximum-number-of-operations-to-move-ones-to-the-end","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy","counting"]}
|
||
{"id":3494,"frontendId":3218,"title":"Minimum Cost for Cutting Cake I","titleSlug":"minimum-cost-for-cutting-cake-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","dynamic-programming","greedy","sorting"]}
|
||
{"id":3495,"frontendId":3275,"title":"K-th Nearest Obstacle Queries","titleSlug":"k-th-nearest-obstacle-queries","difficulty":"MEDIUM","paidOnly":false,"tags":["array","heap-priority-queue"]}
|
||
{"id":3496,"frontendId":3296,"title":"Minimum Number of Seconds to Make Mountain Height Zero","titleSlug":"minimum-number-of-seconds-to-make-mountain-height-zero","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","binary-search","greedy","heap-priority-queue"]}
|
||
{"id":3497,"frontendId":3313,"title":"Find the Last Marked Nodes in Tree","titleSlug":"find-the-last-marked-nodes-in-tree","difficulty":"HARD","paidOnly":true,"tags":["tree","depth-first-search"]}
|
||
{"id":3498,"frontendId":3224,"title":"Minimum Array Changes to Make Differences Equal","titleSlug":"minimum-array-changes-to-make-differences-equal","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":3499,"frontendId":3329,"title":"Count Substrings With K-Frequency Characters II","titleSlug":"count-substrings-with-k-frequency-characters-ii","difficulty":"HARD","paidOnly":true,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":3500,"frontendId":3219,"title":"Minimum Cost for Cutting Cake II","titleSlug":"minimum-cost-for-cutting-cake-ii","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":3501,"frontendId":3217,"title":"Delete Nodes From Linked List Present in Array","titleSlug":"delete-nodes-from-linked-list-present-in-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","linked-list"]}
|
||
{"id":3502,"frontendId":3325,"title":"Count Substrings With K-Frequency Characters I","titleSlug":"count-substrings-with-k-frequency-characters-i","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":3503,"frontendId":3188,"title":"Find Top Scoring Students II","titleSlug":"find-top-scoring-students-ii","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":3504,"frontendId":3189,"title":"Minimum Moves to Get a Peaceful Board","titleSlug":"minimum-moves-to-get-a-peaceful-board","difficulty":"MEDIUM","paidOnly":true,"tags":["array","greedy","sorting","counting-sort"]}
|
||
{"id":3505,"frontendId":3198,"title":"Find Cities in Each State","titleSlug":"find-cities-in-each-state","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":3506,"frontendId":3199,"title":"Count Triplets with Even XOR Set Bits I","titleSlug":"count-triplets-with-even-xor-set-bits-i","difficulty":"EASY","paidOnly":true,"tags":["array","bit-manipulation"]}
|
||
{"id":3507,"frontendId":3233,"title":"Find the Count of Numbers Which Are Not Special","titleSlug":"find-the-count-of-numbers-which-are-not-special","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","number-theory"]}
|
||
{"id":3508,"frontendId":3226,"title":"Number of Bit Changes to Make Two Integers Equal","titleSlug":"number-of-bit-changes-to-make-two-integers-equal","difficulty":"EASY","paidOnly":false,"tags":["bit-manipulation"]}
|
||
{"id":3509,"frontendId":3319,"title":"K-th Largest Perfect Subtree Size in Binary Tree","titleSlug":"k-th-largest-perfect-subtree-size-in-binary-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","sorting","binary-tree"]}
|
||
{"id":3510,"frontendId":3301,"title":"Maximize the Total Height of Unique Towers","titleSlug":"maximize-the-total-height-of-unique-towers","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":3511,"frontendId":3222,"title":"Find the Winning Player in Coin Game","titleSlug":"find-the-winning-player-in-coin-game","difficulty":"EASY","paidOnly":false,"tags":["math","simulation","game-theory"]}
|
||
{"id":3512,"frontendId":3204,"title":"Bitwise User Permissions Analysis","titleSlug":"bitwise-user-permissions-analysis","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3513,"frontendId":3205,"title":"Maximum Array Hopping Score I","titleSlug":"maximum-array-hopping-score-i","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming","stack","greedy","monotonic-stack"]}
|
||
{"id":3514,"frontendId":3244,"title":"Shortest Distance After Road Addition Queries II","titleSlug":"shortest-distance-after-road-addition-queries-ii","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","graph","ordered-set"]}
|
||
{"id":3515,"frontendId":3232,"title":"Find if Digit Game Can Be Won","titleSlug":"find-if-digit-game-can-be-won","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
|
||
{"id":3516,"frontendId":3242,"title":"Design Neighbor Sum Service","titleSlug":"design-neighbor-sum-service","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","design","matrix","simulation"]}
|
||
{"id":3517,"frontendId":3243,"title":"Shortest Distance After Road Addition Queries I","titleSlug":"shortest-distance-after-road-addition-queries-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","breadth-first-search","graph"]}
|
||
{"id":3518,"frontendId":3290,"title":"Maximum Multiplication Score","titleSlug":"maximum-multiplication-score","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3519,"frontendId":3238,"title":"Find the Number of Winning Players","titleSlug":"find-the-number-of-winning-players","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":3520,"frontendId":3214,"title":"Year on Year Growth Rate","titleSlug":"year-on-year-growth-rate","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":3521,"frontendId":3215,"title":"Count Triplets with Even XOR Set Bits II","titleSlug":"count-triplets-with-even-xor-set-bits-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","bit-manipulation"]}
|
||
{"id":3522,"frontendId":3254,"title":"Find the Power of K-Size Subarrays I","titleSlug":"find-the-power-of-k-size-subarrays-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sliding-window"]}
|
||
{"id":3523,"frontendId":3255,"title":"Find the Power of K-Size Subarrays II","titleSlug":"find-the-power-of-k-size-subarrays-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sliding-window"]}
|
||
{"id":3524,"frontendId":3240,"title":"Minimum Number of Flips to Make Binary Grid Palindromic II","titleSlug":"minimum-number-of-flips-to-make-binary-grid-palindromic-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","matrix"]}
|
||
{"id":3525,"frontendId":3259,"title":"Maximum Energy Boost From Two Drinks","titleSlug":"maximum-energy-boost-from-two-drinks","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3526,"frontendId":3239,"title":"Minimum Number of Flips to Make Binary Grid Palindromic I","titleSlug":"minimum-number-of-flips-to-make-binary-grid-palindromic-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","matrix"]}
|
||
{"id":3527,"frontendId":3245,"title":"Alternating Groups III","titleSlug":"alternating-groups-iii","difficulty":"HARD","paidOnly":false,"tags":["array","binary-indexed-tree","ordered-set"]}
|
||
{"id":3528,"frontendId":3282,"title":"Reach End of Array With Max Score","titleSlug":"reach-end-of-array-with-max-score","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":3529,"frontendId":3221,"title":"Maximum Array Hopping Score II","titleSlug":"maximum-array-hopping-score-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","stack","greedy","monotonic-stack"]}
|
||
{"id":3530,"frontendId":3220,"title":"Odd and Even Transactions","titleSlug":"odd-and-even-transactions","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":3531,"frontendId":3273,"title":"Minimum Amount of Damage Dealt to Bob","titleSlug":"minimum-amount-of-damage-dealt-to-bob","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":3532,"frontendId":3241,"title":"Time Taken to Mark All Nodes","titleSlug":"time-taken-to-mark-all-nodes","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","tree","depth-first-search","graph"]}
|
||
{"id":3533,"frontendId":3248,"title":"Snake in Matrix","titleSlug":"snake-in-matrix","difficulty":"EASY","paidOnly":false,"tags":["array","string","simulation"]}
|
||
{"id":3534,"frontendId":3265,"title":"Count Almost Equal Pairs I","titleSlug":"count-almost-equal-pairs-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sorting","counting","enumeration"]}
|
||
{"id":3535,"frontendId":3250,"title":"Find the Count of Monotonic Pairs I","titleSlug":"find-the-count-of-monotonic-pairs-i","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","combinatorics","prefix-sum"]}
|
||
{"id":3536,"frontendId":3251,"title":"Find the Count of Monotonic Pairs II","titleSlug":"find-the-count-of-monotonic-pairs-ii","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","combinatorics","prefix-sum"]}
|
||
{"id":3537,"frontendId":3247,"title":"Number of Subsequences with Odd Sum","titleSlug":"number-of-subsequences-with-odd-sum","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","dynamic-programming","combinatorics"]}
|
||
{"id":3538,"frontendId":3237,"title":"Alt and Tab Simulation","titleSlug":"alt-and-tab-simulation","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","simulation"]}
|
||
{"id":3539,"frontendId":3230,"title":"Customer Purchasing Behavior Analysis","titleSlug":"customer-purchasing-behavior-analysis","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3540,"frontendId":3271,"title":"Hash Divided String","titleSlug":"hash-divided-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","simulation"]}
|
||
{"id":3541,"frontendId":3295,"title":"Report Spam Message","titleSlug":"report-spam-message","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string"]}
|
||
{"id":3542,"frontendId":3257,"title":"Maximum Value Sum by Placing Three Rooks II","titleSlug":"maximum-value-sum-by-placing-three-rooks-ii","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","matrix","enumeration"]}
|
||
{"id":3543,"frontendId":3258,"title":"Count Substrings That Satisfy K-Constraint I","titleSlug":"count-substrings-that-satisfy-k-constraint-i","difficulty":"EASY","paidOnly":false,"tags":["string","sliding-window"]}
|
||
{"id":3544,"frontendId":3267,"title":"Count Almost Equal Pairs II","titleSlug":"count-almost-equal-pairs-ii","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","sorting","counting","enumeration"]}
|
||
{"id":3545,"frontendId":3231,"title":"Minimum Number of Increasing Subsequence to Be Removed","titleSlug":"minimum-number-of-increasing-subsequence-to-be-removed","difficulty":"HARD","paidOnly":true,"tags":["array","binary-search"]}
|
||
{"id":3546,"frontendId":3261,"title":"Count Substrings That Satisfy K-Constraint II","titleSlug":"count-substrings-that-satisfy-k-constraint-ii","difficulty":"HARD","paidOnly":false,"tags":["array","string","binary-search","sliding-window","prefix-sum"]}
|
||
{"id":3548,"frontendId":3272,"title":"Find the Count of Good Integers","titleSlug":"find-the-count-of-good-integers","difficulty":"HARD","paidOnly":false,"tags":["hash-table","math","combinatorics","enumeration"]}
|
||
{"id":3549,"frontendId":3236,"title":"CEO Subordinate Hierarchy","titleSlug":"ceo-subordinate-hierarchy","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":3550,"frontendId":3256,"title":"Maximum Value Sum by Placing Three Rooks I","titleSlug":"maximum-value-sum-by-placing-three-rooks-i","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","matrix","enumeration"]}
|
||
{"id":3551,"frontendId":3277,"title":"Maximum XOR Score Subarray Queries","titleSlug":"maximum-xor-score-subarray-queries","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3552,"frontendId":3260,"title":"Find the Largest Palindrome Divisible by K","titleSlug":"find-the-largest-palindrome-divisible-by-k","difficulty":"HARD","paidOnly":false,"tags":["math","string","dynamic-programming","greedy","number-theory"]}
|
||
{"id":3553,"frontendId":3274,"title":"Check if Two Chessboard Squares Have the Same Color","titleSlug":"check-if-two-chessboard-squares-have-the-same-color","difficulty":"EASY","paidOnly":false,"tags":["math","string"]}
|
||
{"id":3554,"frontendId":3246,"title":"Premier League Table Ranking","titleSlug":"premier-league-table-ranking","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":3555,"frontendId":3264,"title":"Final Array State After K Multiplication Operations I","titleSlug":"final-array-state-after-k-multiplication-operations-i","difficulty":"EASY","paidOnly":false,"tags":["array","math","heap-priority-queue","simulation"]}
|
||
{"id":3556,"frontendId":3266,"title":"Final Array State After K Multiplication Operations II","titleSlug":"final-array-state-after-k-multiplication-operations-ii","difficulty":"HARD","paidOnly":false,"tags":["array","heap-priority-queue","simulation"]}
|
||
{"id":3557,"frontendId":3292,"title":"Minimum Number of Valid Strings to Form Target II","titleSlug":"minimum-number-of-valid-strings-to-form-target-ii","difficulty":"HARD","paidOnly":false,"tags":["array","string","binary-search","dynamic-programming","segment-tree","rolling-hash","string-matching","hash-function"]}
|
||
{"id":3558,"frontendId":3286,"title":"Find a Safe Walk Through a Grid","titleSlug":"find-a-safe-walk-through-a-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","breadth-first-search","graph","heap-priority-queue","matrix","shortest-path"]}
|
||
{"id":3559,"frontendId":3291,"title":"Minimum Number of Valid Strings to Form Target I","titleSlug":"minimum-number-of-valid-strings-to-form-target-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","binary-search","dynamic-programming","trie","segment-tree","rolling-hash","string-matching","hash-function"]}
|
||
{"id":3560,"frontendId":3283,"title":"Maximum Number of Moves to Kill All Pawns","titleSlug":"maximum-number-of-moves-to-kill-all-pawns","difficulty":"HARD","paidOnly":false,"tags":["array","math","bit-manipulation","breadth-first-search","game-theory","bitmask"]}
|
||
{"id":3561,"frontendId":3310,"title":"Remove Methods From Project","titleSlug":"remove-methods-from-project","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","graph"]}
|
||
{"id":3562,"frontendId":3414,"title":"Maximum Score of Non-overlapping Intervals","titleSlug":"maximum-score-of-non-overlapping-intervals","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","dynamic-programming","sorting"]}
|
||
{"id":3563,"frontendId":3276,"title":"Select Cells in Grid With Maximum Score","titleSlug":"select-cells-in-grid-with-maximum-score","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","matrix","bitmask"]}
|
||
{"id":3564,"frontendId":3252,"title":"Premier League Table Ranking II","titleSlug":"premier-league-table-ranking-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3565,"frontendId":3323,"title":"Minimize Connected Groups by Inserting Interval","titleSlug":"minimize-connected-groups-by-inserting-interval","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search","sliding-window","sorting"]}
|
||
{"id":3566,"frontendId":3324,"title":"Find the Sequence of Strings Appeared on the Screen","titleSlug":"find-the-sequence-of-strings-appeared-on-the-screen","difficulty":"MEDIUM","paidOnly":false,"tags":["string","simulation"]}
|
||
{"id":3567,"frontendId":3280,"title":"Convert Date to Binary","titleSlug":"convert-date-to-binary","difficulty":"EASY","paidOnly":false,"tags":["math","string"]}
|
||
{"id":3568,"frontendId":3270,"title":"Find the Key of the Numbers","titleSlug":"find-the-key-of-the-numbers","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":3569,"frontendId":3306,"title":"Count of Substrings Containing Every Vowel and K Consonants II","titleSlug":"count-of-substrings-containing-every-vowel-and-k-consonants-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":3570,"frontendId":3305,"title":"Count of Substrings Containing Every Vowel and K Consonants I","titleSlug":"count-of-substrings-containing-every-vowel-and-k-consonants-i","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":3571,"frontendId":3288,"title":"Length of the Longest Increasing Path","titleSlug":"length-of-the-longest-increasing-path","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","sorting"]}
|
||
{"id":3572,"frontendId":3298,"title":"Count Substrings That Can Be Rearranged to Contain a String II","titleSlug":"count-substrings-that-can-be-rearranged-to-contain-a-string-ii","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":3573,"frontendId":3297,"title":"Count Substrings That Can Be Rearranged to Contain a String I","titleSlug":"count-substrings-that-can-be-rearranged-to-contain-a-string-i","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sliding-window"]}
|
||
{"id":3574,"frontendId":3262,"title":"Find Overlapping Shifts","titleSlug":"find-overlapping-shifts","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3575,"frontendId":3287,"title":"Find the Maximum Sequence Value of Array","titleSlug":"find-the-maximum-sequence-value-of-array","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation"]}
|
||
{"id":3576,"frontendId":3331,"title":"Find Subtree Sizes After Changes","titleSlug":"find-subtree-sizes-after-changes","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","tree","depth-first-search"]}
|
||
{"id":3577,"frontendId":3263,"title":"Convert Doubly Linked List to Array I","titleSlug":"convert-doubly-linked-list-to-array-i","difficulty":"EASY","paidOnly":true,"tags":["array","linked-list","doubly-linked-list"]}
|
||
{"id":3578,"frontendId":3311,"title":"Construct 2D Grid Matching Graph Layout","titleSlug":"construct-2d-grid-matching-graph-layout","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","graph","matrix"]}
|
||
{"id":3579,"frontendId":3309,"title":"Maximum Possible Number by Binary Concatenation","titleSlug":"maximum-possible-number-by-binary-concatenation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation","enumeration"]}
|
||
{"id":3580,"frontendId":3303,"title":"Find the Occurrence of First Almost Equal Substring","titleSlug":"find-the-occurrence-of-first-almost-equal-substring","difficulty":"HARD","paidOnly":false,"tags":["string","string-matching"]}
|
||
{"id":3581,"frontendId":3289,"title":"The Two Sneaky Numbers of Digitville","titleSlug":"the-two-sneaky-numbers-of-digitville","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","math"]}
|
||
{"id":3582,"frontendId":3285,"title":"Find Indices of Stable Mountains","titleSlug":"find-indices-of-stable-mountains","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":3583,"frontendId":3312,"title":"Sorted GCD Pair Queries","titleSlug":"sorted-gcd-pair-queries","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","binary-search","combinatorics","counting","number-theory","prefix-sum"]}
|
||
{"id":3584,"frontendId":3302,"title":"Find the Lexicographically Smallest Valid Sequence","titleSlug":"find-the-lexicographically-smallest-valid-sequence","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string","dynamic-programming","greedy"]}
|
||
{"id":3585,"frontendId":3268,"title":"Find Overlapping Shifts II","titleSlug":"find-overlapping-shifts-ii","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":3586,"frontendId":3269,"title":"Constructing Two Increasing Arrays","titleSlug":"constructing-two-increasing-arrays","difficulty":"HARD","paidOnly":true,"tags":["array","dynamic-programming"]}
|
||
{"id":3587,"frontendId":3332,"title":"Maximum Points Tourist Can Earn","titleSlug":"maximum-points-tourist-can-earn","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":3588,"frontendId":3320,"title":"Count The Number of Winning Sequences","titleSlug":"count-the-number-of-winning-sequences","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":3589,"frontendId":3278,"title":"Find Candidates for Data Scientist Position II","titleSlug":"find-candidates-for-data-scientist-position-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3590,"frontendId":3279,"title":"Maximum Total Area Occupied by Pistons","titleSlug":"maximum-total-area-occupied-by-pistons","difficulty":"HARD","paidOnly":true,"tags":["array","hash-table","string","simulation","counting","prefix-sum"]}
|
||
{"id":3591,"frontendId":3361,"title":"Shift Distance Between Two Strings","titleSlug":"shift-distance-between-two-strings","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","prefix-sum"]}
|
||
{"id":3592,"frontendId":3321,"title":"Find X-Sum of All K-Long Subarrays II","titleSlug":"find-x-sum-of-all-k-long-subarrays-ii","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","sliding-window","heap-priority-queue"]}
|
||
{"id":3593,"frontendId":3334,"title":"Find the Maximum Factor Score of Array","titleSlug":"find-the-maximum-factor-score-of-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","number-theory"]}
|
||
{"id":3594,"frontendId":3371,"title":"Identify the Largest Outlier in an Array","titleSlug":"identify-the-largest-outlier-in-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","counting","enumeration"]}
|
||
{"id":3595,"frontendId":3365,"title":"Rearrange K Substrings to Form Target String","titleSlug":"rearrange-k-substrings-to-form-target-string","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sorting"]}
|
||
{"id":3600,"frontendId":3304,"title":"Find the K-th Character in String Game I","titleSlug":"find-the-k-th-character-in-string-game-i","difficulty":"EASY","paidOnly":false,"tags":["math","bit-manipulation","recursion","simulation"]}
|
||
{"id":3601,"frontendId":3307,"title":"Find the K-th Character in String Game II","titleSlug":"find-the-k-th-character-in-string-game-ii","difficulty":"HARD","paidOnly":false,"tags":["math","bit-manipulation","recursion"]}
|
||
{"id":3602,"frontendId":3284,"title":"Sum of Consecutive Subarrays","titleSlug":"sum-of-consecutive-subarrays","difficulty":"MEDIUM","paidOnly":true,"tags":["array","two-pointers","dynamic-programming"]}
|
||
{"id":3603,"frontendId":3327,"title":"Check if DFS Strings Are Palindromes","titleSlug":"check-if-dfs-strings-are-palindromes","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","string","tree","depth-first-search","hash-function"]}
|
||
{"id":3604,"frontendId":3317,"title":"Find the Number of Possible Ways for an Event","titleSlug":"find-the-number-of-possible-ways-for-an-event","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming","combinatorics"]}
|
||
{"id":3605,"frontendId":3314,"title":"Construct the Minimum Bitwise Array I","titleSlug":"construct-the-minimum-bitwise-array-i","difficulty":"EASY","paidOnly":false,"tags":["array","bit-manipulation"]}
|
||
{"id":3606,"frontendId":3300,"title":"Minimum Element After Replacement With Digit Sum","titleSlug":"minimum-element-after-replacement-with-digit-sum","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
|
||
{"id":3607,"frontendId":3326,"title":"Minimum Division Operations to Make Array Non Decreasing","titleSlug":"minimum-division-operations-to-make-array-non-decreasing","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","greedy","number-theory"]}
|
||
{"id":3608,"frontendId":3336,"title":"Find the Number of Subsequences With Equal GCD","titleSlug":"find-the-number-of-subsequences-with-equal-gcd","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","number-theory"]}
|
||
{"id":3609,"frontendId":3293,"title":"Calculate Product Final Price","titleSlug":"calculate-product-final-price","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3610,"frontendId":3318,"title":"Find X-Sum of All K-Long Subarrays I","titleSlug":"find-x-sum-of-all-k-long-subarrays-i","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sliding-window","heap-priority-queue"]}
|
||
{"id":3611,"frontendId":3315,"title":"Construct the Minimum Bitwise Array II","titleSlug":"construct-the-minimum-bitwise-array-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation"]}
|
||
{"id":3612,"frontendId":3349,"title":"Adjacent Increasing Subarrays Detection I","titleSlug":"adjacent-increasing-subarrays-detection-i","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":3613,"frontendId":3387,"title":"Maximize Amount After Two Days of Conversions","titleSlug":"maximize-amount-after-two-days-of-conversions","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","depth-first-search","breadth-first-search","graph"]}
|
||
{"id":3614,"frontendId":3339,"title":"Find the Number of K-Even Arrays","titleSlug":"find-the-number-of-k-even-arrays","difficulty":"MEDIUM","paidOnly":true,"tags":["dynamic-programming"]}
|
||
{"id":3615,"frontendId":3294,"title":"Convert Doubly Linked List to Array II","titleSlug":"convert-doubly-linked-list-to-array-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","linked-list","doubly-linked-list"]}
|
||
{"id":3616,"frontendId":3354,"title":"Make Array Elements Equal to Zero","titleSlug":"make-array-elements-equal-to-zero","difficulty":"EASY","paidOnly":false,"tags":["array","simulation","prefix-sum"]}
|
||
{"id":3617,"frontendId":3330,"title":"Find the Original Typed String I","titleSlug":"find-the-original-typed-string-i","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":3618,"frontendId":3333,"title":"Find the Original Typed String II","titleSlug":"find-the-original-typed-string-ii","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming","prefix-sum"]}
|
||
{"id":3619,"frontendId":3350,"title":"Adjacent Increasing Subarrays Detection II","titleSlug":"adjacent-increasing-subarrays-detection-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":3620,"frontendId":3397,"title":"Maximum Number of Distinct Elements After Operations","titleSlug":"maximum-number-of-distinct-elements-after-operations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":3621,"frontendId":3375,"title":"Minimum Operations to Make Array Values Equal to K","titleSlug":"minimum-operations-to-make-array-values-equal-to-k","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":3622,"frontendId":3346,"title":"Maximum Frequency of an Element After Performing Operations I","titleSlug":"maximum-frequency-of-an-element-after-performing-operations-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","sliding-window","sorting","prefix-sum"]}
|
||
{"id":3623,"frontendId":3299,"title":"Sum of Consecutive Subsequences","titleSlug":"sum-of-consecutive-subsequences","difficulty":"HARD","paidOnly":true,"tags":["array","hash-table","dynamic-programming"]}
|
||
{"id":3624,"frontendId":3308,"title":"Find Top Performing Driver","titleSlug":"find-top-performing-driver","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3625,"frontendId":3360,"title":"Stone Removal Game","titleSlug":"stone-removal-game","difficulty":"EASY","paidOnly":false,"tags":["math","simulation"]}
|
||
{"id":3626,"frontendId":3345,"title":"Smallest Divisible Digit Product I","titleSlug":"smallest-divisible-digit-product-i","difficulty":"EASY","paidOnly":false,"tags":["math","enumeration"]}
|
||
{"id":3627,"frontendId":3341,"title":"Find Minimum Time to Reach Last Room I","titleSlug":"find-minimum-time-to-reach-last-room-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","graph","heap-priority-queue","matrix","shortest-path"]}
|
||
{"id":3628,"frontendId":3342,"title":"Find Minimum Time to Reach Last Room II","titleSlug":"find-minimum-time-to-reach-last-room-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","graph","heap-priority-queue","matrix","shortest-path"]}
|
||
{"id":3629,"frontendId":3335,"title":"Total Characters in String After Transformations I","titleSlug":"total-characters-in-string-after-transformations-i","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","math","string","dynamic-programming","counting"]}
|
||
{"id":3630,"frontendId":3337,"title":"Total Characters in String After Transformations II","titleSlug":"total-characters-in-string-after-transformations-ii","difficulty":"HARD","paidOnly":false,"tags":["hash-table","math","string","dynamic-programming","counting"]}
|
||
{"id":3631,"frontendId":3352,"title":"Count K-Reducible Numbers Less Than N","titleSlug":"count-k-reducible-numbers-less-than-n","difficulty":"HARD","paidOnly":false,"tags":["math","string","dynamic-programming","combinatorics"]}
|
||
{"id":3632,"frontendId":3386,"title":"Button with Longest Push Time","titleSlug":"button-with-longest-push-time","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":3633,"frontendId":3372,"title":"Maximize the Number of Target Nodes After Connecting Trees I","titleSlug":"maximize-the-number-of-target-nodes-after-connecting-trees-i","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search"]}
|
||
{"id":3634,"frontendId":3412,"title":"Find Mirror Score of a String","titleSlug":"find-mirror-score-of-a-string","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","stack","simulation"]}
|
||
{"id":3635,"frontendId":3348,"title":"Smallest Divisible Digit Product II","titleSlug":"smallest-divisible-digit-product-ii","difficulty":"HARD","paidOnly":false,"tags":["math","string","backtracking","greedy","number-theory"]}
|
||
{"id":3636,"frontendId":3340,"title":"Check Balanced String","titleSlug":"check-balanced-string","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":3637,"frontendId":3343,"title":"Count Number of Balanced Permutations","titleSlug":"count-number-of-balanced-permutations","difficulty":"HARD","paidOnly":false,"tags":["math","string","dynamic-programming","combinatorics"]}
|
||
{"id":3638,"frontendId":3389,"title":"Minimum Operations to Make Character Frequencies Equal","titleSlug":"minimum-operations-to-make-character-frequencies-equal","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","dynamic-programming","counting","enumeration"]}
|
||
{"id":3639,"frontendId":3355,"title":"Zero Array Transformation I","titleSlug":"zero-array-transformation-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":3640,"frontendId":3347,"title":"Maximum Frequency of an Element After Performing Operations II","titleSlug":"maximum-frequency-of-an-element-after-performing-operations-ii","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","sliding-window","sorting","prefix-sum"]}
|
||
{"id":3642,"frontendId":3322,"title":"Premier League Table Ranking III","titleSlug":"premier-league-table-ranking-iii","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3643,"frontendId":3356,"title":"Zero Array Transformation II","titleSlug":"zero-array-transformation-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","prefix-sum"]}
|
||
{"id":3644,"frontendId":3364,"title":"Minimum Positive Sum Subarray ","titleSlug":"minimum-positive-sum-subarray","difficulty":"EASY","paidOnly":false,"tags":["array","sliding-window","prefix-sum"]}
|
||
{"id":3645,"frontendId":3373,"title":"Maximize the Number of Target Nodes After Connecting Trees II","titleSlug":"maximize-the-number-of-target-nodes-after-connecting-trees-ii","difficulty":"HARD","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search"]}
|
||
{"id":3646,"frontendId":3351,"title":"Sum of Good Subsequences","titleSlug":"sum-of-good-subsequences","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","dynamic-programming"]}
|
||
{"id":3647,"frontendId":3362,"title":"Zero Array Transformation III","titleSlug":"zero-array-transformation-iii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting","heap-priority-queue","prefix-sum"]}
|
||
{"id":3648,"frontendId":3363,"title":"Find the Maximum Number of Fruits Collected","titleSlug":"find-the-maximum-number-of-fruits-collected","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":3649,"frontendId":3376,"title":"Minimum Time to Break Locks I","titleSlug":"minimum-time-to-break-locks-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","backtracking","bit-manipulation","depth-first-search","bitmask"]}
|
||
{"id":3650,"frontendId":3328,"title":"Find Cities in Each State II","titleSlug":"find-cities-in-each-state-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3651,"frontendId":3379,"title":"Transformed Array","titleSlug":"transformed-array","difficulty":"EASY","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":3652,"frontendId":3359,"title":"Find Sorted Submatrices With Maximum Element at Most K","titleSlug":"find-sorted-submatrices-with-maximum-element-at-most-k","difficulty":"HARD","paidOnly":true,"tags":["array","stack","matrix","monotonic-stack"]}
|
||
{"id":3653,"frontendId":3381,"title":"Maximum Subarray Sum With Length Divisible by K","titleSlug":"maximum-subarray-sum-with-length-divisible-by-k","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":3654,"frontendId":3366,"title":"Minimum Array Sum","titleSlug":"minimum-array-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3655,"frontendId":3377,"title":"Digit Operations to Make Two Integers Equal","titleSlug":"digit-operations-to-make-two-integers-equal","difficulty":"MEDIUM","paidOnly":false,"tags":["math","graph","heap-priority-queue","number-theory","shortest-path"]}
|
||
{"id":3656,"frontendId":3396,"title":"Minimum Number of Operations to Make Elements in Array Distinct","titleSlug":"minimum-number-of-operations-to-make-elements-in-array-distinct","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":3657,"frontendId":3394,"title":"Check if Grid can be Cut into Sections","titleSlug":"check-if-grid-can-be-cut-into-sections","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":3658,"frontendId":3357,"title":"Minimize the Maximum Adjacent Element Difference","titleSlug":"minimize-the-maximum-adjacent-element-difference","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","greedy"]}
|
||
{"id":3659,"frontendId":3393,"title":"Count Paths With the Given XOR Value","titleSlug":"count-paths-with-the-given-xor-value","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","matrix"]}
|
||
{"id":3660,"frontendId":3338,"title":"Second Highest Salary II","titleSlug":"second-highest-salary-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
|
||
{"id":3674,"frontendId":3420,"title":"Count Non-Decreasing Subarrays After K Operations","titleSlug":"count-non-decreasing-subarrays-after-k-operations","difficulty":"HARD","paidOnly":false,"tags":["array","stack","segment-tree","queue","sliding-window","monotonic-stack","monotonic-queue"]}
|
||
{"id":3675,"frontendId":3367,"title":"Maximize Sum of Weights after Edge Removals","titleSlug":"maximize-sum-of-weights-after-edge-removals","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","tree","depth-first-search","sorting"]}
|
||
{"id":3676,"frontendId":3370,"title":"Smallest Number With All Set Bits","titleSlug":"smallest-number-with-all-set-bits","difficulty":"EASY","paidOnly":false,"tags":["math","bit-manipulation"]}
|
||
{"id":3677,"frontendId":3418,"title":"Maximum Amount of Money Robot Can Earn","titleSlug":"maximum-amount-of-money-robot-can-earn","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":3678,"frontendId":3408,"title":"Design Task Manager","titleSlug":"design-task-manager","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","design","heap-priority-queue","ordered-set"]}
|
||
{"id":3679,"frontendId":3344,"title":"Maximum Sized Array","titleSlug":"maximum-sized-array","difficulty":"MEDIUM","paidOnly":true,"tags":["binary-search","bit-manipulation"]}
|
||
{"id":3680,"frontendId":3378,"title":"Count Connected Components in LCM Graph","titleSlug":"count-connected-components-in-lcm-graph","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","union-find","number-theory"]}
|
||
{"id":3681,"frontendId":3380,"title":"Maximum Area Rectangle With Point Constraints I","titleSlug":"maximum-area-rectangle-with-point-constraints-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","binary-indexed-tree","segment-tree","geometry","sorting","enumeration"]}
|
||
{"id":3682,"frontendId":3405,"title":"Count the Number of Arrays with K Matching Adjacent Elements","titleSlug":"count-the-number-of-arrays-with-k-matching-adjacent-elements","difficulty":"HARD","paidOnly":false,"tags":["math","combinatorics"]}
|
||
{"id":3683,"frontendId":3403,"title":"Find the Lexicographically Largest String From the Box I","titleSlug":"find-the-lexicographically-largest-string-from-the-box-i","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string","enumeration"]}
|
||
{"id":3684,"frontendId":3407,"title":"Substring Matching Pattern","titleSlug":"substring-matching-pattern","difficulty":"EASY","paidOnly":false,"tags":["string","string-matching"]}
|
||
{"id":3685,"frontendId":3392,"title":"Count Subarrays of Length Three With a Condition","titleSlug":"count-subarrays-of-length-three-with-a-condition","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":3686,"frontendId":3388,"title":"Count Beautiful Splits in an Array","titleSlug":"count-beautiful-splits-in-an-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3687,"frontendId":3425,"title":"Longest Special Path","titleSlug":"longest-special-path","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","tree","depth-first-search","prefix-sum"]}
|
||
{"id":3688,"frontendId":3410,"title":"Maximize Subarray Sum After Removing All Occurrences of One Element","titleSlug":"maximize-subarray-sum-after-removing-all-occurrences-of-one-element","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","segment-tree"]}
|
||
{"id":3689,"frontendId":3382,"title":"Maximum Area Rectangle With Point Constraints II","titleSlug":"maximum-area-rectangle-with-point-constraints-ii","difficulty":"HARD","paidOnly":false,"tags":["array","math","binary-indexed-tree","segment-tree","geometry","sorting"]}
|
||
{"id":3690,"frontendId":3398,"title":"Smallest Substring With Identical Characters I","titleSlug":"smallest-substring-with-identical-characters-i","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","enumeration"]}
|
||
{"id":3691,"frontendId":3402,"title":"Minimum Operations to Make Columns Strictly Increasing","titleSlug":"minimum-operations-to-make-columns-strictly-increasing","difficulty":"EASY","paidOnly":false,"tags":["array","greedy","matrix"]}
|
||
{"id":3692,"frontendId":3455,"title":"Shortest Matching Substring","titleSlug":"shortest-matching-substring","difficulty":"HARD","paidOnly":false,"tags":["two-pointers","string","binary-search","string-matching"]}
|
||
{"id":3693,"frontendId":3385,"title":"Minimum Time to Break Locks II","titleSlug":"minimum-time-to-break-locks-ii","difficulty":"HARD","paidOnly":true,"tags":["array","depth-first-search","graph"]}
|
||
{"id":3694,"frontendId":3353,"title":"Minimum Total Operations","titleSlug":"minimum-total-operations","difficulty":"EASY","paidOnly":true,"tags":["array"]}
|
||
{"id":3695,"frontendId":3358,"title":"Books with NULL Ratings","titleSlug":"books-with-null-ratings","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":3696,"frontendId":3448,"title":"Count Substrings Divisible By Last Digit","titleSlug":"count-substrings-divisible-by-last-digit","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":3697,"frontendId":3444,"title":"Minimum Increments for Target Multiples in an Array","titleSlug":"minimum-increments-for-target-multiples-in-an-array","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","bit-manipulation","number-theory","bitmask"]}
|
||
{"id":3698,"frontendId":3422,"title":"Minimum Operations to Make Subarray Elements Equal","titleSlug":"minimum-operations-to-make-subarray-elements-equal","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","math","sliding-window","heap-priority-queue"]}
|
||
{"id":3699,"frontendId":3404,"title":"Count Special Subsequences","titleSlug":"count-special-subsequences","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","enumeration"]}
|
||
{"id":3700,"frontendId":3395,"title":"Subsequences with a Unique Middle Mode I","titleSlug":"subsequences-with-a-unique-middle-mode-i","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","combinatorics"]}
|
||
{"id":3701,"frontendId":3441,"title":"Minimum Cost Good Caption","titleSlug":"minimum-cost-good-caption","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":3702,"frontendId":3411,"title":"Maximum Subarray With Equal Products","titleSlug":"maximum-subarray-with-equal-products","difficulty":"EASY","paidOnly":false,"tags":["array","math","sliding-window","enumeration","number-theory"]}
|
||
{"id":3703,"frontendId":3368,"title":"First Letter Capitalization","titleSlug":"first-letter-capitalization","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":3704,"frontendId":3432,"title":"Count Partitions with Even Sum Difference","titleSlug":"count-partitions-with-even-sum-difference","difficulty":"EASY","paidOnly":false,"tags":["array","math","prefix-sum"]}
|
||
{"id":3705,"frontendId":3471,"title":"Find the Largest Almost Missing Integer","titleSlug":"find-the-largest-almost-missing-integer","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":3706,"frontendId":3399,"title":"Smallest Substring With Identical Characters II","titleSlug":"smallest-substring-with-identical-characters-ii","difficulty":"HARD","paidOnly":false,"tags":["string","binary-search"]}
|
||
{"id":3707,"frontendId":3527,"title":"Find the Most Common Response","titleSlug":"find-the-most-common-response","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","counting"]}
|
||
{"id":3708,"frontendId":3417,"title":"Zigzag Grid Traversal With Skip","titleSlug":"zigzag-grid-traversal-with-skip","difficulty":"EASY","paidOnly":false,"tags":["array","matrix","simulation"]}
|
||
{"id":3709,"frontendId":3456,"title":"Find Special Substring of Length K","titleSlug":"find-special-substring-of-length-k","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":3710,"frontendId":3369,"title":"Design an Array Statistics Tracker ","titleSlug":"design-an-array-statistics-tracker","difficulty":"HARD","paidOnly":true,"tags":["hash-table","binary-search","design","queue","heap-priority-queue","data-stream","ordered-set"]}
|
||
{"id":3711,"frontendId":3374,"title":"First Letter Capitalization II","titleSlug":"first-letter-capitalization-ii","difficulty":"HARD","paidOnly":false,"tags":["database"]}
|
||
{"id":3712,"frontendId":3424,"title":"Minimum Cost to Make Arrays Identical","titleSlug":"minimum-cost-to-make-arrays-identical","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":3713,"frontendId":3435,"title":"Frequencies of Shortest Supersequences","titleSlug":"frequencies-of-shortest-supersequences","difficulty":"HARD","paidOnly":false,"tags":["array","string","bit-manipulation","graph","topological-sort","enumeration"]}
|
||
{"id":3714,"frontendId":3428,"title":"Maximum and Minimum Sums of at Most Size K Subsequences","titleSlug":"maximum-and-minimum-sums-of-at-most-size-k-subsequences","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","dynamic-programming","sorting","combinatorics"]}
|
||
{"id":3715,"frontendId":3413,"title":"Maximum Coins From K Consecutive Bags","titleSlug":"maximum-coins-from-k-consecutive-bags","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","greedy","sliding-window","sorting","prefix-sum"]}
|
||
{"id":3716,"frontendId":3409,"title":"Longest Subsequence With Decreasing Adjacent Difference","titleSlug":"longest-subsequence-with-decreasing-adjacent-difference","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3717,"frontendId":3505,"title":"Minimum Operations to Make Elements Within K Subarrays Equal","titleSlug":"minimum-operations-to-make-elements-within-k-subarrays-equal","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","dynamic-programming","sliding-window","heap-priority-queue"]}
|
||
{"id":3718,"frontendId":3383,"title":"Minimum Runes to Add to Cast Spell","titleSlug":"minimum-runes-to-add-to-cast-spell","difficulty":"HARD","paidOnly":true,"tags":["array","depth-first-search","breadth-first-search","union-find","graph","topological-sort"]}
|
||
{"id":3719,"frontendId":3384,"title":"Team Dominance by Pass Success","titleSlug":"team-dominance-by-pass-success","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":3720,"frontendId":3419,"title":"Minimize the Maximum Edge Weight of Graph","titleSlug":"minimize-the-maximum-edge-weight-of-graph","difficulty":"MEDIUM","paidOnly":false,"tags":["binary-search","depth-first-search","breadth-first-search","graph","shortest-path"]}
|
||
{"id":3721,"frontendId":3433,"title":"Count Mentions Per User","titleSlug":"count-mentions-per-user","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","sorting","simulation"]}
|
||
{"id":3722,"frontendId":3473,"title":"Sum of K Subarrays With Length at Least M","titleSlug":"sum-of-k-subarrays-with-length-at-least-m","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","prefix-sum"]}
|
||
{"id":3723,"frontendId":3452,"title":"Sum of Good Numbers","titleSlug":"sum-of-good-numbers","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":3725,"frontendId":3430,"title":"Maximum and Minimum Sums of at Most Size K Subarrays","titleSlug":"maximum-and-minimum-sums-of-at-most-size-k-subarrays","difficulty":"HARD","paidOnly":false,"tags":["array","math","stack","monotonic-stack"]}
|
||
{"id":3726,"frontendId":3390,"title":"Longest Team Pass Streak","titleSlug":"longest-team-pass-streak","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":3729,"frontendId":3528,"title":"Unit Conversion I","titleSlug":"unit-conversion-i","difficulty":"MEDIUM","paidOnly":false,"tags":["depth-first-search","breadth-first-search","graph"]}
|
||
{"id":3731,"frontendId":3427,"title":"Sum of Variable Length Subarrays","titleSlug":"sum-of-variable-length-subarrays","difficulty":"EASY","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":3732,"frontendId":3522,"title":"Calculate Score After Performing Instructions","titleSlug":"calculate-score-after-performing-instructions","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","simulation"]}
|
||
{"id":3733,"frontendId":3459,"title":"Length of Longest V-Shaped Diagonal Segment","titleSlug":"length-of-longest-v-shaped-diagonal-segment","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","memoization","matrix"]}
|
||
{"id":3735,"frontendId":3391,"title":"Design a 3D Binary Matrix with Efficient Layer Tracking","titleSlug":"design-a-3d-binary-matrix-with-efficient-layer-tracking","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","design","heap-priority-queue","matrix","ordered-set"]}
|
||
{"id":3736,"frontendId":3438,"title":"Find Valid Pair of Adjacent Digits in String","titleSlug":"find-valid-pair-of-adjacent-digits-in-string","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":3737,"frontendId":3429,"title":"Paint House IV","titleSlug":"paint-house-iv","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3738,"frontendId":3523,"title":"Make Array Non-decreasing","titleSlug":"make-array-non-decreasing","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","greedy","monotonic-stack"]}
|
||
{"id":3739,"frontendId":3426,"title":"Manhattan Distances of All Arrangements of Pieces","titleSlug":"manhattan-distances-of-all-arrangements-of-pieces","difficulty":"HARD","paidOnly":false,"tags":["math","combinatorics"]}
|
||
{"id":3740,"frontendId":3400,"title":"Maximum Number of Matching Indices After Right Shifts","titleSlug":"maximum-number-of-matching-indices-after-right-shifts","difficulty":"MEDIUM","paidOnly":true,"tags":["array","two-pointers","simulation"]}
|
||
{"id":3741,"frontendId":3440,"title":"Reschedule Meetings for Maximum Free Time II","titleSlug":"reschedule-meetings-for-maximum-free-time-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","enumeration"]}
|
||
{"id":3743,"frontendId":3439,"title":"Reschedule Meetings for Maximum Free Time I","titleSlug":"reschedule-meetings-for-maximum-free-time-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sliding-window"]}
|
||
{"id":3744,"frontendId":3495,"title":"Minimum Operations to Make Array Elements Zero","titleSlug":"minimum-operations-to-make-array-elements-zero","difficulty":"HARD","paidOnly":false,"tags":["array","math","bit-manipulation"]}
|
||
{"id":3746,"frontendId":3401,"title":"Find Circular Gift Exchange Chains","titleSlug":"find-circular-gift-exchange-chains","difficulty":"HARD","paidOnly":true,"tags":["database"]}
|
||
{"id":3747,"frontendId":3423,"title":"Maximum Difference Between Adjacent Elements in a Circular Array","titleSlug":"maximum-difference-between-adjacent-elements-in-a-circular-array","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":3748,"frontendId":3446,"title":"Sort Matrix by Diagonals","titleSlug":"sort-matrix-by-diagonals","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting","matrix"]}
|
||
{"id":3749,"frontendId":3406,"title":"Find the Lexicographically Largest String From the Box II","titleSlug":"find-the-lexicographically-largest-string-from-the-box-ii","difficulty":"HARD","paidOnly":true,"tags":["two-pointers","string"]}
|
||
{"id":3750,"frontendId":3488,"title":"Closest Equal Element Queries","titleSlug":"closest-equal-element-queries","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","binary-search"]}
|
||
{"id":3751,"frontendId":3434,"title":"Maximum Frequency After Subarray Operation","titleSlug":"maximum-frequency-after-subarray-operation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","dynamic-programming","greedy","enumeration","prefix-sum"]}
|
||
{"id":3752,"frontendId":3535,"title":"Unit Conversion II","titleSlug":"unit-conversion-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","depth-first-search","breadth-first-search","graph"]}
|
||
{"id":3753,"frontendId":3442,"title":"Maximum Difference Between Even and Odd Frequency I","titleSlug":"maximum-difference-between-even-and-odd-frequency-i","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":3754,"frontendId":3443,"title":"Maximum Manhattan Distance After K Changes","titleSlug":"maximum-manhattan-distance-after-k-changes","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","math","string","counting"]}
|
||
{"id":3755,"frontendId":3584,"title":"Maximum Product of First and Last Elements of a Subsequence","titleSlug":"maximum-product-of-first-and-last-elements-of-a-subsequence","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers"]}
|
||
{"id":3756,"frontendId":3416,"title":"Subsequences with a Unique Middle Mode II","titleSlug":"subsequences-with-a-unique-middle-mode-ii","difficulty":"HARD","paidOnly":true,"tags":["array","hash-table","math","combinatorics"]}
|
||
{"id":3757,"frontendId":3415,"title":"Find Products with Three Consecutive Digits ","titleSlug":"find-products-with-three-consecutive-digits","difficulty":"EASY","paidOnly":true,"tags":["database"]}
|
||
{"id":3758,"frontendId":3431,"title":"Minimum Unlocked Indices to Sort Nums","titleSlug":"minimum-unlocked-indices-to-sort-nums","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table"]}
|
||
{"id":3759,"frontendId":3478,"title":"Choose K Elements With Maximum Sum","titleSlug":"choose-k-elements-with-maximum-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting","heap-priority-queue"]}
|
||
{"id":3760,"frontendId":3447,"title":"Assign Elements to Groups with Constraints","titleSlug":"assign-elements-to-groups-with-constraints","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":3761,"frontendId":3445,"title":"Maximum Difference Between Even and Odd Frequency II","titleSlug":"maximum-difference-between-even-and-odd-frequency-ii","difficulty":"HARD","paidOnly":false,"tags":["string","sliding-window","enumeration","prefix-sum"]}
|
||
{"id":3762,"frontendId":3449,"title":"Maximize the Minimum Game Score","titleSlug":"maximize-the-minimum-game-score","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","greedy"]}
|
||
{"id":3763,"frontendId":3453,"title":"Separate Squares I","titleSlug":"separate-squares-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":3764,"frontendId":3462,"title":"Maximum Sum With at Most K Elements","titleSlug":"maximum-sum-with-at-most-k-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting","heap-priority-queue","matrix"]}
|
||
{"id":3765,"frontendId":3500,"title":"Minimum Cost to Divide Array Into Subarrays","titleSlug":"minimum-cost-to-divide-array-into-subarrays","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","prefix-sum"]}
|
||
{"id":3766,"frontendId":3627,"title":"Maximum Median Sum of Subsequences of Size 3","titleSlug":"maximum-median-sum-of-subsequences-of-size-3","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","greedy","sorting","game-theory"]}
|
||
{"id":3767,"frontendId":3421,"title":"Find Students Who Improved","titleSlug":"find-students-who-improved","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":3768,"frontendId":3461,"title":"Check If Digits Are Equal in String After Operations I","titleSlug":"check-if-digits-are-equal-in-string-after-operations-i","difficulty":"EASY","paidOnly":false,"tags":["math","string","simulation","combinatorics","number-theory"]}
|
||
{"id":3770,"frontendId":3474,"title":"Lexicographically Smallest Generated String","titleSlug":"lexicographically-smallest-generated-string","difficulty":"HARD","paidOnly":false,"tags":["string","greedy","string-matching"]}
|
||
{"id":3771,"frontendId":3458,"title":"Select K Disjoint Special Substrings","titleSlug":"select-k-disjoint-special-substrings","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","dynamic-programming","greedy","sorting"]}
|
||
{"id":3772,"frontendId":3510,"title":"Minimum Pair Removal to Sort Array II","titleSlug":"minimum-pair-removal-to-sort-array-ii","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","linked-list","heap-priority-queue","simulation","doubly-linked-list","ordered-set"]}
|
||
{"id":3773,"frontendId":3507,"title":"Minimum Pair Removal to Sort Array I","titleSlug":"minimum-pair-removal-to-sort-array-i","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","linked-list","heap-priority-queue","simulation","doubly-linked-list","ordered-set"]}
|
||
{"id":3774,"frontendId":3463,"title":"Check If Digits Are Equal in String After Operations II","titleSlug":"check-if-digits-are-equal-in-string-after-operations-ii","difficulty":"HARD","paidOnly":false,"tags":["math","string","combinatorics","number-theory"]}
|
||
{"id":3775,"frontendId":3454,"title":"Separate Squares II","titleSlug":"separate-squares-ii","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","segment-tree","line-sweep"]}
|
||
{"id":3776,"frontendId":3469,"title":"Find Minimum Cost to Remove Array Elements","titleSlug":"find-minimum-cost-to-remove-array-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3777,"frontendId":3509,"title":"Maximum Product of Subsequences With an Alternating Sum Equal to K","titleSlug":"maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","dynamic-programming"]}
|
||
{"id":3778,"frontendId":3467,"title":"Transform Array by Parity","titleSlug":"transform-array-by-parity","difficulty":"EASY","paidOnly":false,"tags":["array","sorting","counting"]}
|
||
{"id":3779,"frontendId":3457,"title":"Eat Pizzas!","titleSlug":"eat-pizzas","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":3780,"frontendId":3437,"title":"Permutations III","titleSlug":"permutations-iii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","backtracking"]}
|
||
{"id":3781,"frontendId":3464,"title":"Maximize the Distance Between Points on a Square","titleSlug":"maximize-the-distance-between-points-on-a-square","difficulty":"HARD","paidOnly":false,"tags":["array","math","binary-search","geometry","sorting"]}
|
||
{"id":3782,"frontendId":3436,"title":"Find Valid Emails","titleSlug":"find-valid-emails","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":3783,"frontendId":3470,"title":"Permutations IV","titleSlug":"permutations-iv","difficulty":"HARD","paidOnly":false,"tags":["array","math","combinatorics","enumeration"]}
|
||
{"id":3784,"frontendId":3485,"title":"Longest Common Prefix of K Strings After Removal","titleSlug":"longest-common-prefix-of-k-strings-after-removal","difficulty":"HARD","paidOnly":false,"tags":["array","string","trie"]}
|
||
{"id":3785,"frontendId":3468,"title":"Find the Number of Copy Arrays","titleSlug":"find-the-number-of-copy-arrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math"]}
|
||
{"id":3786,"frontendId":3472,"title":"Longest Palindromic Subsequence After at Most K Operations","titleSlug":"longest-palindromic-subsequence-after-at-most-k-operations","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":3787,"frontendId":3450,"title":"Maximum Students on a Single Bench","titleSlug":"maximum-students-on-a-single-bench","difficulty":"EASY","paidOnly":true,"tags":["array","hash-table"]}
|
||
{"id":3788,"frontendId":3487,"title":"Maximum Unique Subarray Sum After Deletion","titleSlug":"maximum-unique-subarray-sum-after-deletion","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","greedy"]}
|
||
{"id":3789,"frontendId":3480,"title":"Maximize Subarrays After Removing One Conflicting Pair","titleSlug":"maximize-subarrays-after-removing-one-conflicting-pair","difficulty":"HARD","paidOnly":false,"tags":["array","segment-tree","enumeration","prefix-sum"]}
|
||
{"id":3790,"frontendId":3477,"title":"Fruits Into Baskets II","titleSlug":"fruits-into-baskets-ii","difficulty":"EASY","paidOnly":false,"tags":["array","binary-search","segment-tree","simulation","ordered-set"]}
|
||
{"id":3791,"frontendId":3479,"title":"Fruits Into Baskets III","titleSlug":"fruits-into-baskets-iii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","segment-tree","ordered-set"]}
|
||
{"id":3792,"frontendId":3451,"title":"Find Invalid IP Addresses","titleSlug":"find-invalid-ip-addresses","difficulty":"HARD","paidOnly":false,"tags":["database"]}
|
||
{"id":3793,"frontendId":3503,"title":"Longest Palindrome After Substring Concatenation I","titleSlug":"longest-palindrome-after-substring-concatenation-i","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string","dynamic-programming","enumeration"]}
|
||
{"id":3794,"frontendId":3494,"title":"Find the Minimum Amount of Time to Brew Potions","titleSlug":"find-the-minimum-amount-of-time-to-brew-potions","difficulty":"MEDIUM","paidOnly":false,"tags":["array","simulation","prefix-sum"]}
|
||
{"id":3795,"frontendId":3489,"title":"Zero Array Transformation IV","titleSlug":"zero-array-transformation-iv","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3796,"frontendId":3460,"title":"Longest Common Prefix After at Most One Removal","titleSlug":"longest-common-prefix-after-at-most-one-removal","difficulty":"MEDIUM","paidOnly":true,"tags":["two-pointers","string"]}
|
||
{"id":3797,"frontendId":3484,"title":"Design Spreadsheet","titleSlug":"design-spreadsheet","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","design","matrix"]}
|
||
{"id":3798,"frontendId":3486,"title":"Longest Special Path II","titleSlug":"longest-special-path-ii","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","tree","depth-first-search","prefix-sum"]}
|
||
{"id":3799,"frontendId":3483,"title":"Unique 3-Digit Even Numbers","titleSlug":"unique-3-digit-even-numbers","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","recursion","enumeration"]}
|
||
{"id":3800,"frontendId":3598,"title":"Longest Common Prefix Between Adjacent Strings After Removals","titleSlug":"longest-common-prefix-between-adjacent-strings-after-removals","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string"]}
|
||
{"id":3801,"frontendId":3490,"title":"Count Beautiful Numbers","titleSlug":"count-beautiful-numbers","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":3803,"frontendId":3465,"title":"Find Products with Valid Serial Numbers","titleSlug":"find-products-with-valid-serial-numbers","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":3804,"frontendId":3501,"title":"Maximize Active Section with Trade II","titleSlug":"maximize-active-section-with-trade-ii","difficulty":"HARD","paidOnly":false,"tags":["array","string","binary-search","segment-tree"]}
|
||
{"id":3805,"frontendId":3499,"title":"Maximize Active Section with Trade I","titleSlug":"maximize-active-section-with-trade-i","difficulty":"MEDIUM","paidOnly":false,"tags":["string","enumeration"]}
|
||
{"id":3806,"frontendId":3466,"title":"Maximum Coin Collection ","titleSlug":"maximum-coin-collection","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming"]}
|
||
{"id":3807,"frontendId":3796,"title":"Find Maximum Value in a Constrained Sequence","titleSlug":"find-maximum-value-in-a-constrained-sequence","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":3808,"frontendId":3504,"title":"Longest Palindrome After Substring Concatenation II","titleSlug":"longest-palindrome-after-substring-concatenation-ii","difficulty":"HARD","paidOnly":false,"tags":["two-pointers","string","dynamic-programming"]}
|
||
{"id":3809,"frontendId":3493,"title":"Properties Graph","titleSlug":"properties-graph","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":3810,"frontendId":3519,"title":"Count Numbers with Non-Decreasing Digits ","titleSlug":"count-numbers-with-non-decreasing-digits","difficulty":"HARD","paidOnly":false,"tags":["math","string","dynamic-programming"]}
|
||
{"id":3811,"frontendId":3498,"title":"Reverse Degree of a String","titleSlug":"reverse-degree-of-a-string","difficulty":"EASY","paidOnly":false,"tags":["string","simulation"]}
|
||
{"id":3812,"frontendId":3517,"title":"Smallest Palindromic Rearrangement I","titleSlug":"smallest-palindromic-rearrangement-i","difficulty":"MEDIUM","paidOnly":false,"tags":["string","sorting","counting-sort"]}
|
||
{"id":3813,"frontendId":3518,"title":"Smallest Palindromic Rearrangement II","titleSlug":"smallest-palindromic-rearrangement-ii","difficulty":"HARD","paidOnly":false,"tags":["hash-table","math","string","combinatorics","counting"]}
|
||
{"id":3814,"frontendId":3506,"title":"Find Time Required to Eliminate Bacterial Strains","titleSlug":"find-time-required-to-eliminate-bacterial-strains","difficulty":"HARD","paidOnly":true,"tags":["array","math","greedy","heap-priority-queue"]}
|
||
{"id":3815,"frontendId":3556,"title":"Sum of Largest Prime Substrings","titleSlug":"sum-of-largest-prime-substrings","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","math","string","sorting","number-theory"]}
|
||
{"id":3816,"frontendId":3475,"title":"DNA Pattern Recognition ","titleSlug":"dna-pattern-recognition","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":3817,"frontendId":3492,"title":"Maximum Containers on a Ship","titleSlug":"maximum-containers-on-a-ship","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":3818,"frontendId":3476,"title":"Maximize Profit from Task Assignment","titleSlug":"maximize-profit-from-task-assignment","difficulty":"MEDIUM","paidOnly":true,"tags":["array","greedy","sorting","heap-priority-queue"]}
|
||
{"id":3819,"frontendId":3531,"title":"Count Covered Buildings","titleSlug":"count-covered-buildings","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sorting"]}
|
||
{"id":3820,"frontendId":3514,"title":"Number of Unique XOR Triplets II","titleSlug":"number-of-unique-xor-triplets-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","bit-manipulation","enumeration"]}
|
||
{"id":3821,"frontendId":3529,"title":"Count Cells in Overlapping Horizontal and Vertical Substrings","titleSlug":"count-cells-in-overlapping-horizontal-and-vertical-substrings","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","rolling-hash","string-matching","matrix","hash-function"]}
|
||
{"id":3822,"frontendId":3537,"title":"Fill a Special Grid","titleSlug":"fill-a-special-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","divide-and-conquer","matrix"]}
|
||
{"id":3823,"frontendId":3619,"title":"Count Islands With Total Value Divisible by K","titleSlug":"count-islands-with-total-value-divisible-by-k","difficulty":"MEDIUM","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","union-find","matrix"]}
|
||
{"id":3824,"frontendId":3513,"title":"Number of Unique XOR Triplets I","titleSlug":"number-of-unique-xor-triplets-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","bit-manipulation"]}
|
||
{"id":3825,"frontendId":3481,"title":"Apply Substitutions","titleSlug":"apply-substitutions","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","string","depth-first-search","breadth-first-search","graph","topological-sort"]}
|
||
{"id":3826,"frontendId":3530,"title":"Maximum Profit from Valid Topological Order in DAG","titleSlug":"maximum-profit-from-valid-topological-order-in-dag","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","graph","topological-sort","bitmask"]}
|
||
{"id":3827,"frontendId":3508,"title":"Implement Router","titleSlug":"implement-router","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","binary-search","design","queue","ordered-set"]}
|
||
{"id":3828,"frontendId":3482,"title":"Analyze Organization Hierarchy","titleSlug":"analyze-organization-hierarchy","difficulty":"HARD","paidOnly":false,"tags":["database"]}
|
||
{"id":3829,"frontendId":3515,"title":"Shortest Path in a Weighted Tree","titleSlug":"shortest-path-in-a-weighted-tree","difficulty":"HARD","paidOnly":false,"tags":["array","tree","depth-first-search","binary-indexed-tree","segment-tree"]}
|
||
{"id":3830,"frontendId":3516,"title":"Find Closest Person","titleSlug":"find-closest-person","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":3831,"frontendId":3524,"title":"Find X Value of Array I","titleSlug":"find-x-value-of-array-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","dynamic-programming"]}
|
||
{"id":3832,"frontendId":3502,"title":"Minimum Cost to Reach Every Position","titleSlug":"minimum-cost-to-reach-every-position","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":3833,"frontendId":3538,"title":"Merge Operations for Minimum Travel Time","titleSlug":"merge-operations-for-minimum-travel-time","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","prefix-sum"]}
|
||
{"id":3834,"frontendId":3542,"title":"Minimum Operations to Convert All Elements to Zero","titleSlug":"minimum-operations-to-convert-all-elements-to-zero","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","stack","greedy","monotonic-stack"]}
|
||
{"id":3835,"frontendId":3578,"title":"Count Partitions With Max-Min Difference at Most K","titleSlug":"count-partitions-with-max-min-difference-at-most-k","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","queue","sliding-window","prefix-sum","monotonic-queue"]}
|
||
{"id":3836,"frontendId":3491,"title":"Phone Number Prefix","titleSlug":"phone-number-prefix","difficulty":"EASY","paidOnly":true,"tags":["array","string","trie","sorting"]}
|
||
{"id":3837,"frontendId":3552,"title":"Grid Teleportation Traversal","titleSlug":"grid-teleportation-traversal","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","breadth-first-search","matrix"]}
|
||
{"id":3838,"frontendId":3532,"title":"Path Existence Queries in a Graph I","titleSlug":"path-existence-queries-in-a-graph-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","binary-search","union-find","graph"]}
|
||
{"id":3839,"frontendId":3496,"title":"Maximize Score After Pair Deletions","titleSlug":"maximize-score-after-pair-deletions","difficulty":"MEDIUM","paidOnly":true,"tags":["array","greedy"]}
|
||
{"id":3840,"frontendId":3525,"title":"Find X Value of Array II","titleSlug":"find-x-value-of-array-ii","difficulty":"HARD","paidOnly":false,"tags":["array","math","segment-tree"]}
|
||
{"id":3841,"frontendId":3533,"title":"Concatenated Divisibility","titleSlug":"concatenated-divisibility","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","bitmask"]}
|
||
{"id":3842,"frontendId":3559,"title":"Number of Ways to Assign Edge Weights II","titleSlug":"number-of-ways-to-assign-edge-weights-ii","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","bit-manipulation","tree","depth-first-search"]}
|
||
{"id":3843,"frontendId":3566,"title":"Partition Array into Two Equal Product Subsets","titleSlug":"partition-array-into-two-equal-product-subsets","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation","recursion","enumeration"]}
|
||
{"id":3844,"frontendId":3558,"title":"Number of Ways to Assign Edge Weights I","titleSlug":"number-of-ways-to-assign-edge-weights-i","difficulty":"MEDIUM","paidOnly":false,"tags":["math","tree","depth-first-search"]}
|
||
{"id":3845,"frontendId":3547,"title":"Maximum Sum of Edge Values in a Graph","titleSlug":"maximum-sum-of-edge-values-in-a-graph","difficulty":"HARD","paidOnly":false,"tags":["math","greedy","graph"]}
|
||
{"id":3846,"frontendId":3512,"title":"Minimum Operations to Make Array Sum Divisible by K","titleSlug":"minimum-operations-to-make-array-sum-divisible-by-k","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
|
||
{"id":3847,"frontendId":3551,"title":"Minimum Swaps to Sort by Digit Sum","titleSlug":"minimum-swaps-to-sort-by-digit-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sorting"]}
|
||
{"id":3848,"frontendId":3497,"title":"Analyze Subscription Conversion ","titleSlug":"analyze-subscription-conversion","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":3849,"frontendId":3546,"title":"Equal Sum Grid Partition I","titleSlug":"equal-sum-grid-partition-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","matrix","enumeration","prefix-sum"]}
|
||
{"id":3850,"frontendId":3548,"title":"Equal Sum Grid Partition II","titleSlug":"equal-sum-grid-partition-ii","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","matrix","enumeration","prefix-sum"]}
|
||
{"id":3851,"frontendId":3539,"title":"Find Sum of Array Product of Magical Sequences","titleSlug":"find-sum-of-array-product-of-magical-sequences","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","bit-manipulation","combinatorics","bitmask"]}
|
||
{"id":3852,"frontendId":3534,"title":"Path Existence Queries in a Graph II","titleSlug":"path-existence-queries-in-a-graph-ii","difficulty":"HARD","paidOnly":false,"tags":["array","two-pointers","binary-search","dynamic-programming","greedy","bit-manipulation","graph","sorting"]}
|
||
{"id":3853,"frontendId":3553,"title":"Minimum Weighted Subgraph With the Required Paths II","titleSlug":"minimum-weighted-subgraph-with-the-required-paths-ii","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","tree","depth-first-search"]}
|
||
{"id":3854,"frontendId":3562,"title":"Maximum Profit from Trading Stocks with Discounts","titleSlug":"maximum-profit-from-trading-stocks-with-discounts","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","tree","depth-first-search"]}
|
||
{"id":3855,"frontendId":3511,"title":"Make a Positive Array","titleSlug":"make-a-positive-array","difficulty":"MEDIUM","paidOnly":true,"tags":["array","greedy","prefix-sum"]}
|
||
{"id":3856,"frontendId":3543,"title":"Maximum Weighted K-Edge Path","titleSlug":"maximum-weighted-k-edge-path","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","dynamic-programming","graph"]}
|
||
{"id":3857,"frontendId":3557,"title":"Find Maximum Number of Non Intersecting Substrings","titleSlug":"find-maximum-number-of-non-intersecting-substrings","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","dynamic-programming","greedy"]}
|
||
{"id":3858,"frontendId":3544,"title":"Subtree Inversion Sum","titleSlug":"subtree-inversion-sum","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","tree","depth-first-search"]}
|
||
{"id":3859,"frontendId":3536,"title":"Maximum Product of Two Digits","titleSlug":"maximum-product-of-two-digits","difficulty":"EASY","paidOnly":false,"tags":["math","sorting"]}
|
||
{"id":3860,"frontendId":3561,"title":"Resulting String After Adjacent Removals","titleSlug":"resulting-string-after-adjacent-removals","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","simulation"]}
|
||
{"id":3861,"frontendId":3520,"title":"Minimum Threshold for Inversion Pairs Count","titleSlug":"minimum-threshold-for-inversion-pairs-count","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search","binary-indexed-tree","segment-tree"]}
|
||
{"id":3862,"frontendId":3526,"title":"Range XOR Queries with Subarray Reversals","titleSlug":"range-xor-queries-with-subarray-reversals","difficulty":"HARD","paidOnly":true,"tags":["array","tree","binary-tree"]}
|
||
{"id":3863,"frontendId":3607,"title":"Power Grid Maintenance","titleSlug":"power-grid-maintenance","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","depth-first-search","breadth-first-search","union-find","graph","heap-priority-queue","ordered-set"]}
|
||
{"id":3864,"frontendId":3577,"title":"Count the Number of Computer Unlocking Permutations","titleSlug":"count-the-number-of-computer-unlocking-permutations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","brainteaser","combinatorics"]}
|
||
{"id":3865,"frontendId":3521,"title":"Find Product Recommendation Pairs","titleSlug":"find-product-recommendation-pairs","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":3866,"frontendId":3579,"title":"Minimum Steps to Convert String with Operations","titleSlug":"minimum-steps-to-convert-string-with-operations","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming","greedy"]}
|
||
{"id":3867,"frontendId":3563,"title":"Lexicographically Smallest String After Adjacent Removals","titleSlug":"lexicographically-smallest-string-after-adjacent-removals","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
|
||
{"id":3868,"frontendId":3588,"title":"Find Maximum Area of a Triangle","titleSlug":"find-maximum-area-of-a-triangle","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","greedy","geometry","enumeration"]}
|
||
{"id":3869,"frontendId":3550,"title":"Smallest Index With Digit Sum Equal to Index","titleSlug":"smallest-index-with-digit-sum-equal-to-index","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
|
||
{"id":3870,"frontendId":3568,"title":"Minimum Moves to Clean the Classroom","titleSlug":"minimum-moves-to-clean-the-classroom","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","bit-manipulation","breadth-first-search","matrix"]}
|
||
{"id":3871,"frontendId":3545,"title":"Minimum Deletions for At Most K Distinct Characters","titleSlug":"minimum-deletions-for-at-most-k-distinct-characters","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","greedy","sorting","counting"]}
|
||
{"id":3872,"frontendId":3541,"title":"Find Most Frequent Vowel and Consonant","titleSlug":"find-most-frequent-vowel-and-consonant","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":3873,"frontendId":3685,"title":"Subsequence Sum After Capping Elements","titleSlug":"subsequence-sum-after-capping-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","dynamic-programming","sorting"]}
|
||
{"id":3875,"frontendId":3575,"title":"Maximum Good Subtree Score","titleSlug":"maximum-good-subtree-score","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","tree","depth-first-search","bitmask"]}
|
||
{"id":3876,"frontendId":3576,"title":"Transform Array to All Equal Elements","titleSlug":"transform-array-to-all-equal-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":3877,"frontendId":3664,"title":"Two-Letter Card Game","titleSlug":"two-letter-card-game","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","counting","enumeration"]}
|
||
{"id":3878,"frontendId":3569,"title":"Maximize Count of Distinct Primes After Split","titleSlug":"maximize-count-of-distinct-primes-after-split","difficulty":"HARD","paidOnly":false,"tags":["array","math","segment-tree","number-theory"]}
|
||
{"id":3879,"frontendId":3560,"title":"Find Minimum Log Transportation Cost","titleSlug":"find-minimum-log-transportation-cost","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":3880,"frontendId":3540,"title":"Minimum Time to Visit All Houses","titleSlug":"minimum-time-to-visit-all-houses","difficulty":"MEDIUM","paidOnly":true,"tags":["array","prefix-sum"]}
|
||
{"id":3881,"frontendId":3613,"title":"Minimize Maximum Component Cost","titleSlug":"minimize-maximum-component-cost","difficulty":"MEDIUM","paidOnly":false,"tags":["binary-search","union-find","graph","sorting"]}
|
||
{"id":3882,"frontendId":3630,"title":"Partition Array for Maximum XOR and AND","titleSlug":"partition-array-for-maximum-xor-and-and","difficulty":"HARD","paidOnly":false,"tags":["array","math","greedy","bit-manipulation","enumeration"]}
|
||
{"id":3883,"frontendId":3549,"title":"Multiply Two Polynomials","titleSlug":"multiply-two-polynomials","difficulty":"HARD","paidOnly":true,"tags":["array","math"]}
|
||
{"id":3884,"frontendId":3567,"title":"Minimum Absolute Difference in Sliding Submatrix","titleSlug":"minimum-absolute-difference-in-sliding-submatrix","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sorting","matrix"]}
|
||
{"id":3885,"frontendId":3583,"title":"Count Special Triplets","titleSlug":"count-special-triplets","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":3886,"frontendId":3623,"title":"Count Number of Trapezoids I","titleSlug":"count-number-of-trapezoids-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","geometry"]}
|
||
{"id":3887,"frontendId":3650,"title":"Minimum Cost Path with Edge Reversals","titleSlug":"minimum-cost-path-with-edge-reversals","difficulty":"MEDIUM","paidOnly":false,"tags":["graph","heap-priority-queue","shortest-path"]}
|
||
{"id":3888,"frontendId":3574,"title":"Maximize Subarray GCD Score","titleSlug":"maximize-subarray-gcd-score","difficulty":"HARD","paidOnly":false,"tags":["array","math","enumeration","number-theory"]}
|
||
{"id":3889,"frontendId":3651,"title":"Minimum Cost Path with Teleportations","titleSlug":"minimum-cost-path-with-teleportations","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":3890,"frontendId":3555,"title":"Smallest Subarray to Sort in Every Sliding Window","titleSlug":"smallest-subarray-to-sort-in-every-sliding-window","difficulty":"MEDIUM","paidOnly":true,"tags":["array","two-pointers","stack","greedy","sorting","monotonic-stack"]}
|
||
{"id":3891,"frontendId":3554,"title":"Find Category Recommendation Pairs","titleSlug":"find-category-recommendation-pairs","difficulty":"HARD","paidOnly":false,"tags":["database"]}
|
||
{"id":3892,"frontendId":3573,"title":"Best Time to Buy and Sell Stock V","titleSlug":"best-time-to-buy-and-sell-stock-v","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3893,"frontendId":3582,"title":"Generate Tag for Video Caption","titleSlug":"generate-tag-for-video-caption","difficulty":"EASY","paidOnly":false,"tags":["string","simulation"]}
|
||
{"id":3894,"frontendId":3572,"title":"Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values","titleSlug":"maximize-ysum-by-picking-a-triplet-of-distinct-xvalues","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","sorting","heap-priority-queue"]}
|
||
{"id":3896,"frontendId":3594,"title":"Minimum Time to Transport All Individuals","titleSlug":"minimum-time-to-transport-all-individuals","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","graph","heap-priority-queue","shortest-path","bitmask"]}
|
||
{"id":3897,"frontendId":3625,"title":"Count Number of Trapezoids II","titleSlug":"count-number-of-trapezoids-ii","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","geometry"]}
|
||
{"id":3898,"frontendId":3564,"title":"Seasonal Sales Analysis","titleSlug":"seasonal-sales-analysis","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":3899,"frontendId":3565,"title":"Sequential Grid Path Cover","titleSlug":"sequential-grid-path-cover","difficulty":"MEDIUM","paidOnly":true,"tags":["array","recursion","matrix"]}
|
||
{"id":3900,"frontendId":3585,"title":"Find Weighted Median Node in Tree","titleSlug":"find-weighted-median-node-in-tree","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","dynamic-programming","bit-manipulation","tree","depth-first-search"]}
|
||
{"id":3902,"frontendId":3600,"title":"Maximize Spanning Tree Stability with Upgrades","titleSlug":"maximize-spanning-tree-stability-with-upgrades","difficulty":"HARD","paidOnly":false,"tags":["binary-search","greedy","union-find","graph","minimum-spanning-tree"]}
|
||
{"id":3903,"frontendId":3592,"title":"Inverse Coin Change","titleSlug":"inverse-coin-change","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3904,"frontendId":3587,"title":"Minimum Adjacent Swaps to Alternate Parity","titleSlug":"minimum-adjacent-swaps-to-alternate-parity","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":3905,"frontendId":3597,"title":"Partition String ","titleSlug":"partition-string","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","trie","simulation"]}
|
||
{"id":3906,"frontendId":3590,"title":"Kth Smallest Path XOR Sum","titleSlug":"kth-smallest-path-xor-sum","difficulty":"HARD","paidOnly":false,"tags":["array","tree","depth-first-search","ordered-set"]}
|
||
{"id":3907,"frontendId":3589,"title":"Count Prime-Gap Balanced Subarrays","titleSlug":"count-prime-gap-balanced-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","queue","sliding-window","number-theory","monotonic-queue"]}
|
||
{"id":3908,"frontendId":3608,"title":"Minimum Time for K Connected Components","titleSlug":"minimum-time-for-k-connected-components","difficulty":"MEDIUM","paidOnly":false,"tags":["binary-search","union-find","graph","sorting"]}
|
||
{"id":3909,"frontendId":3593,"title":"Minimum Increments to Equalize Leaf Paths","titleSlug":"minimum-increments-to-equalize-leaf-paths","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","tree","depth-first-search"]}
|
||
{"id":3910,"frontendId":3570,"title":"Find Books with No Available Copies","titleSlug":"find-books-with-no-available-copies","difficulty":"EASY","paidOnly":false,"tags":["database"]}
|
||
{"id":3911,"frontendId":3571,"title":"Find the Shortest Superstring II","titleSlug":"find-the-shortest-superstring-ii","difficulty":"EASY","paidOnly":true,"tags":["string"]}
|
||
{"id":3912,"frontendId":3602,"title":"Hexadecimal and Hexatrigesimal Conversion","titleSlug":"hexadecimal-and-hexatrigesimal-conversion","difficulty":"EASY","paidOnly":false,"tags":["math","string"]}
|
||
{"id":3913,"frontendId":3599,"title":"Partition Array to Minimize XOR","titleSlug":"partition-array-to-minimize-xor","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","prefix-sum"]}
|
||
{"id":3914,"frontendId":3591,"title":"Check if Any Element Has Prime Frequency","titleSlug":"check-if-any-element-has-prime-frequency","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","math","counting","number-theory"]}
|
||
{"id":3915,"frontendId":3670,"title":"Maximum Product of Two Integers With No Common Bits","titleSlug":"maximum-product-of-two-integers-with-no-common-bits","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation"]}
|
||
{"id":3916,"frontendId":3604,"title":"Minimum Time to Reach Destination in Directed Graph","titleSlug":"minimum-time-to-reach-destination-in-directed-graph","difficulty":"MEDIUM","paidOnly":false,"tags":["graph","heap-priority-queue","shortest-path"]}
|
||
{"id":3918,"frontendId":3622,"title":"Check Divisibility by Digit Sum and Product","titleSlug":"check-divisibility-by-digit-sum-and-product","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":3919,"frontendId":3620,"title":"Network Recovery Pathways","titleSlug":"network-recovery-pathways","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","dynamic-programming","graph","topological-sort","heap-priority-queue","shortest-path"]}
|
||
{"id":3920,"frontendId":3605,"title":"Minimum Stability Factor of Array","titleSlug":"minimum-stability-factor-of-array","difficulty":"HARD","paidOnly":false,"tags":["array","math","binary-search","greedy","segment-tree","number-theory"]}
|
||
{"id":3921,"frontendId":3580,"title":"Find Consistently Improving Employees","titleSlug":"find-consistently-improving-employees","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":3922,"frontendId":3609,"title":"Minimum Moves to Reach Target in Grid","titleSlug":"minimum-moves-to-reach-target-in-grid","difficulty":"HARD","paidOnly":false,"tags":["math"]}
|
||
{"id":3924,"frontendId":3581,"title":"Count Odd Letters from Number","titleSlug":"count-odd-letters-from-number","difficulty":"EASY","paidOnly":true,"tags":["hash-table","string","simulation","counting"]}
|
||
{"id":3925,"frontendId":3596,"title":"Minimum Cost Path with Alternating Directions I","titleSlug":"minimum-cost-path-with-alternating-directions-i","difficulty":"MEDIUM","paidOnly":true,"tags":["math","brainteaser"]}
|
||
{"id":3927,"frontendId":3603,"title":"Minimum Cost Path with Alternating Directions II","titleSlug":"minimum-cost-path-with-alternating-directions-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":3928,"frontendId":3690,"title":"Split and Merge Array Transformation","titleSlug":"split-and-merge-array-transformation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","breadth-first-search"]}
|
||
{"id":3929,"frontendId":3632,"title":"Subarrays with XOR at Least K","titleSlug":"subarrays-with-xor-at-least-k","difficulty":"HARD","paidOnly":true,"tags":["array","bit-manipulation","trie","prefix-sum"]}
|
||
{"id":3930,"frontendId":3615,"title":"Longest Palindromic Path in Graph","titleSlug":"longest-palindromic-path-in-graph","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming","bit-manipulation","graph","bitmask"]}
|
||
{"id":3931,"frontendId":3612,"title":"Process String with Special Operations I","titleSlug":"process-string-with-special-operations-i","difficulty":"MEDIUM","paidOnly":false,"tags":["string","simulation"]}
|
||
{"id":3932,"frontendId":3586,"title":"Find COVID Recovery Patients","titleSlug":"find-covid-recovery-patients","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":3933,"frontendId":3629,"title":"Minimum Jumps to Reach End via Prime Teleportation","titleSlug":"minimum-jumps-to-reach-end-via-prime-teleportation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","breadth-first-search","number-theory"]}
|
||
{"id":3934,"frontendId":3606,"title":"Coupon Code Validator","titleSlug":"coupon-code-validator","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","string","sorting"]}
|
||
{"id":3935,"frontendId":3595,"title":"Once Twice","titleSlug":"once-twice","difficulty":"MEDIUM","paidOnly":true,"tags":["array","bit-manipulation"]}
|
||
{"id":3936,"frontendId":3618,"title":"Split Array by Prime Indices","titleSlug":"split-array-by-prime-indices","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","number-theory"]}
|
||
{"id":3937,"frontendId":3621,"title":"Number of Integers With Popcount-Depth Equal to K I","titleSlug":"number-of-integers-with-popcount-depth-equal-to-k-i","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming","bit-manipulation","combinatorics"]}
|
||
{"id":3938,"frontendId":3665,"title":"Twisted Mirror Path Count","titleSlug":"twisted-mirror-path-count","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":3939,"frontendId":3614,"title":"Process String with Special Operations II","titleSlug":"process-string-with-special-operations-ii","difficulty":"HARD","paidOnly":false,"tags":["string","simulation"]}
|
||
{"id":3941,"frontendId":3624,"title":"Number of Integers With Popcount-Depth Equal to K II","titleSlug":"number-of-integers-with-popcount-depth-equal-to-k-ii","difficulty":"HARD","paidOnly":false,"tags":["array","divide-and-conquer","binary-indexed-tree","segment-tree"]}
|
||
{"id":3942,"frontendId":3601,"title":"Find Drivers with Improved Fuel Efficiency","titleSlug":"find-drivers-with-improved-fuel-efficiency","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":3943,"frontendId":3611,"title":"Find Overbooked Employees","titleSlug":"find-overbooked-employees","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
|
||
{"id":3944,"frontendId":3639,"title":"Minimum Time to Activate String","titleSlug":"minimum-time-to-activate-string","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":3945,"frontendId":3648,"title":"Minimum Sensors to Cover Grid","titleSlug":"minimum-sensors-to-cover-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["math"]}
|
||
{"id":3946,"frontendId":3755,"title":"Find Maximum Balanced XOR Subarray Length","titleSlug":"find-maximum-balanced-xor-subarray-length","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","bit-manipulation","prefix-sum"]}
|
||
{"id":3947,"frontendId":3669,"title":"Balanced K-Factor Decomposition","titleSlug":"balanced-k-factor-decomposition","difficulty":"MEDIUM","paidOnly":false,"tags":["math","backtracking","number-theory"]}
|
||
{"id":3948,"frontendId":3628,"title":"Maximum Number of Subsequences After One Inserting","titleSlug":"maximum-number-of-subsequences-after-one-inserting","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming","greedy","prefix-sum"]}
|
||
{"id":3949,"frontendId":3610,"title":"Minimum Number of Primes to Sum to Target","titleSlug":"minimum-number-of-primes-to-sum-to-target","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","dynamic-programming","number-theory"]}
|
||
{"id":3950,"frontendId":3644,"title":"Maximum K to Sort a Permutation","titleSlug":"maximum-k-to-sort-a-permutation","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation"]}
|
||
{"id":3951,"frontendId":3646,"title":"Next Special Palindrome Number","titleSlug":"next-special-palindrome-number","difficulty":"HARD","paidOnly":false,"tags":["backtracking","bit-manipulation"]}
|
||
{"id":3952,"frontendId":3637,"title":"Trionic Array I","titleSlug":"trionic-array-i","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":3953,"frontendId":3679,"title":" Minimum Discards to Balance Inventory","titleSlug":"minimum-discards-to-balance-inventory","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sliding-window","simulation","counting"]}
|
||
{"id":3954,"frontendId":3638,"title":"Maximum Balanced Shipments","titleSlug":"maximum-balanced-shipments","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","stack","greedy","monotonic-stack"]}
|
||
{"id":3955,"frontendId":3636,"title":"Threshold Majority Queries","titleSlug":"threshold-majority-queries","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","binary-search","divide-and-conquer","counting","prefix-sum"]}
|
||
{"id":3956,"frontendId":3640,"title":"Trionic Array II","titleSlug":"trionic-array-ii","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3957,"frontendId":3715,"title":"Sum of Perfect Square Ancestors","titleSlug":"sum-of-perfect-square-ancestors","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","tree","depth-first-search","counting","number-theory"]}
|
||
{"id":3958,"frontendId":3634,"title":"Minimum Removals to Balance Array","titleSlug":"minimum-removals-to-balance-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","sliding-window","sorting"]}
|
||
{"id":3959,"frontendId":3645,"title":"Maximum Total from Optimal Activation Order","titleSlug":"maximum-total-from-optimal-activation-order","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","greedy","sorting","heap-priority-queue"]}
|
||
{"id":3960,"frontendId":3616,"title":"Number of Student Replacements","titleSlug":"number-of-student-replacements","difficulty":"MEDIUM","paidOnly":true,"tags":["array","simulation"]}
|
||
{"id":3961,"frontendId":3617,"title":"Find Students with Study Spiral Pattern","titleSlug":"find-students-with-study-spiral-pattern","difficulty":"HARD","paidOnly":false,"tags":[]}
|
||
{"id":3962,"frontendId":3699,"title":"Number of ZigZag Arrays I","titleSlug":"number-of-zigzag-arrays-i","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","prefix-sum"]}
|
||
{"id":3963,"frontendId":3649,"title":"Number of Perfect Pairs","titleSlug":"number-of-perfect-pairs","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","two-pointers","sorting"]}
|
||
{"id":3964,"frontendId":3700,"title":"Number of ZigZag Arrays II","titleSlug":"number-of-zigzag-arrays-ii","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming"]}
|
||
{"id":3965,"frontendId":3633,"title":"Earliest Finish Time for Land and Water Rides I","titleSlug":"earliest-finish-time-for-land-and-water-rides-i","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","binary-search","greedy","sorting"]}
|
||
{"id":3966,"frontendId":3654,"title":"Minimum Sum After Divisible Sum Deletions","titleSlug":"minimum-sum-after-divisible-sum-deletions","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","dynamic-programming","prefix-sum"]}
|
||
{"id":3967,"frontendId":3635,"title":"Earliest Finish Time for Land and Water Rides II","titleSlug":"earliest-finish-time-for-land-and-water-rides-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","greedy","sorting"]}
|
||
{"id":3969,"frontendId":3631,"title":"Sort Threats by Severity and Exploitability","titleSlug":"sort-threats-by-severity-and-exploitability","difficulty":"MEDIUM","paidOnly":true,"tags":["array","sorting"]}
|
||
{"id":3971,"frontendId":3626,"title":"Find Stores with Inventory Imbalance","titleSlug":"find-stores-with-inventory-imbalance","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":3973,"frontendId":3643,"title":"Flip Square Submatrix Vertically","titleSlug":"flip-square-submatrix-vertically","difficulty":"EASY","paidOnly":false,"tags":["array","two-pointers","matrix"]}
|
||
{"id":3974,"frontendId":3653,"title":"XOR After Range Multiplication Queries I","titleSlug":"xor-after-range-multiplication-queries-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","divide-and-conquer","simulation"]}
|
||
{"id":3975,"frontendId":3655,"title":"XOR After Range Multiplication Queries II","titleSlug":"xor-after-range-multiplication-queries-ii","difficulty":"HARD","paidOnly":false,"tags":["array","divide-and-conquer"]}
|
||
{"id":3979,"frontendId":3659,"title":"Partition Array Into K-Distinct Groups","titleSlug":"partition-array-into-k-distinct-groups","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":3980,"frontendId":3652,"title":"Best Time to Buy and Sell Stock using Strategy","titleSlug":"best-time-to-buy-and-sell-stock-using-strategy","difficulty":"MEDIUM","paidOnly":false,"tags":["array","sliding-window","prefix-sum"]}
|
||
{"id":3981,"frontendId":3660,"title":"Jump Game IX","titleSlug":"jump-game-ix","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":3982,"frontendId":3661,"title":"Maximum Walls Destroyed by Robots","titleSlug":"maximum-walls-destroyed-by-robots","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","dynamic-programming","sorting"]}
|
||
{"id":3983,"frontendId":3666,"title":"Minimum Operations to Equalize Binary String","titleSlug":"minimum-operations-to-equalize-binary-string","difficulty":"HARD","paidOnly":false,"tags":["math","string","breadth-first-search","union-find","ordered-set"]}
|
||
{"id":3986,"frontendId":3742,"title":"Maximum Path Score in a Grid","titleSlug":"maximum-path-score-in-a-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
|
||
{"id":3987,"frontendId":3647,"title":"Maximum Weight in Two Bags","titleSlug":"maximum-weight-in-two-bags","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming"]}
|
||
{"id":3989,"frontendId":3671,"title":"Sum of Beautiful Subsequences","titleSlug":"sum-of-beautiful-subsequences","difficulty":"HARD","paidOnly":false,"tags":["array","math","binary-indexed-tree","number-theory"]}
|
||
{"id":3990,"frontendId":3681,"title":"Maximum XOR of Subsequences","titleSlug":"maximum-xor-of-subsequences","difficulty":"HARD","paidOnly":false,"tags":["array","math","greedy","bit-manipulation"]}
|
||
{"id":3991,"frontendId":3680,"title":"Generate Schedule","titleSlug":"generate-schedule","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","greedy"]}
|
||
{"id":3992,"frontendId":3641,"title":"Longest Semi-Repeating Subarray","titleSlug":"longest-semi-repeating-subarray","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","sliding-window"]}
|
||
{"id":3994,"frontendId":3663,"title":"Find The Least Frequent Digit","titleSlug":"find-the-least-frequent-digit","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","math","counting"]}
|
||
{"id":3995,"frontendId":3658,"title":"GCD of Odd and Even Sums","titleSlug":"gcd-of-odd-and-even-sums","difficulty":"EASY","paidOnly":false,"tags":["math","number-theory"]}
|
||
{"id":3996,"frontendId":3642,"title":"Find Books with Polarized Opinions","titleSlug":"find-books-with-polarized-opinions","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":3997,"frontendId":3684,"title":"Maximize Sum of At Most K Distinct Elements","titleSlug":"maximize-sum-of-at-most-k-distinct-elements","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","greedy","sorting"]}
|
||
{"id":3998,"frontendId":3674,"title":"Minimum Operations to Equalize Array","titleSlug":"minimum-operations-to-equalize-array","difficulty":"EASY","paidOnly":false,"tags":["array","bit-manipulation","brainteaser"]}
|
||
{"id":3999,"frontendId":3675,"title":"Minimum Operations to Transform String","titleSlug":"minimum-operations-to-transform-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":4000,"frontendId":3676,"title":"Count Bowl Subarrays","titleSlug":"count-bowl-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","monotonic-stack"]}
|
||
{"id":4003,"frontendId":3708,"title":"Longest Fibonacci Subarray","titleSlug":"longest-fibonacci-subarray","difficulty":"MEDIUM","paidOnly":false,"tags":["array"]}
|
||
{"id":4005,"frontendId":3689,"title":"Maximum Total Subarray Value I","titleSlug":"maximum-total-subarray-value-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":4006,"frontendId":3656,"title":"Determine if a Simple Graph Exists","titleSlug":"determine-if-a-simple-graph-exists","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search","graph","sorting","prefix-sum"]}
|
||
{"id":4007,"frontendId":3691,"title":"Maximum Total Subarray Value II","titleSlug":"maximum-total-subarray-value-ii","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","segment-tree","heap-priority-queue"]}
|
||
{"id":4008,"frontendId":3668,"title":"Restore Finishing Order","titleSlug":"restore-finishing-order","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":4009,"frontendId":3688,"title":"Bitwise OR of Even Numbers in an Array","titleSlug":"bitwise-or-of-even-numbers-in-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","bit-manipulation","simulation"]}
|
||
{"id":4010,"frontendId":3695,"title":"Maximize Alternating Sum Using Swaps","titleSlug":"maximize-alternating-sum-using-swaps","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","union-find","sorting"]}
|
||
{"id":4011,"frontendId":3678,"title":"Smallest Absent Positive Greater Than Average","titleSlug":"smallest-absent-positive-greater-than-average","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":4012,"frontendId":3683,"title":"Earliest Time to Finish One Task","titleSlug":"earliest-time-to-finish-one-task","difficulty":"EASY","paidOnly":false,"tags":["array"]}
|
||
{"id":4015,"frontendId":3698,"title":"Split Array With Minimum Difference","titleSlug":"split-array-with-minimum-difference","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":4017,"frontendId":3662,"title":"Filter Characters by Frequency","titleSlug":"filter-characters-by-frequency","difficulty":"EASY","paidOnly":true,"tags":["hash-table","string","counting"]}
|
||
{"id":4018,"frontendId":3776,"title":"Minimum Moves to Balance Circular Array","titleSlug":"minimum-moves-to-balance-circular-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":4019,"frontendId":3703,"title":"Remove K-Balanced Substrings","titleSlug":"remove-k-balanced-substrings","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","simulation"]}
|
||
{"id":4020,"frontendId":3720,"title":"Lexicographically Smallest Permutation Greater Than Target","titleSlug":"lexicographically-smallest-permutation-greater-than-target","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","greedy","counting","enumeration"]}
|
||
{"id":4021,"frontendId":3694,"title":"Distinct Points Reachable After Substring Removal","titleSlug":"distinct-points-reachable-after-substring-removal","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sliding-window","prefix-sum"]}
|
||
{"id":4022,"frontendId":3762,"title":"Minimum Operations to Equalize Subarrays","titleSlug":"minimum-operations-to-equalize-subarrays","difficulty":"HARD","paidOnly":false,"tags":["array","math","binary-search","segment-tree"]}
|
||
{"id":4023,"frontendId":3677,"title":"Count Binary Palindromic Numbers","titleSlug":"count-binary-palindromic-numbers","difficulty":"HARD","paidOnly":false,"tags":["math","bit-manipulation"]}
|
||
{"id":4025,"frontendId":3657,"title":"Find Loyal Customers","titleSlug":"find-loyal-customers","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":4027,"frontendId":3686,"title":"Number of Stable Subsequences","titleSlug":"number-of-stable-subsequences","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":4029,"frontendId":3667,"title":"Sort Array By Absolute Value","titleSlug":"sort-array-by-absolute-value","difficulty":"EASY","paidOnly":true,"tags":["array","math","two-pointers","sorting"]}
|
||
{"id":4030,"frontendId":3743,"title":"Maximize Cyclic Partition Score","titleSlug":"maximize-cyclic-partition-score","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":4032,"frontendId":3825,"title":"Longest Strictly Increasing Subsequence With Non-Zero Bitwise AND","titleSlug":"longest-strictly-increasing-subsequence-with-non-zero-bitwise-and","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","bit-manipulation","enumeration"]}
|
||
{"id":4033,"frontendId":3702,"title":"Longest Subsequence With Non-Zero Bitwise XOR","titleSlug":"longest-subsequence-with-non-zero-bitwise-xor","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation"]}
|
||
{"id":4035,"frontendId":3710,"title":"Maximum Partition Factor","titleSlug":"maximum-partition-factor","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","depth-first-search","breadth-first-search","union-find","graph"]}
|
||
{"id":4036,"frontendId":3672,"title":"Sum of Weighted Modes in Subarrays","titleSlug":"sum-of-weighted-modes-in-subarrays","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","sliding-window","counting","ordered-set"]}
|
||
{"id":4037,"frontendId":3734,"title":"Lexicographically Smallest Palindromic Permutation Greater Than Target","titleSlug":"lexicographically-smallest-palindromic-permutation-greater-than-target","difficulty":"HARD","paidOnly":false,"tags":["two-pointers","string","enumeration"]}
|
||
{"id":4039,"frontendId":3697,"title":"Compute Decimal Representation","titleSlug":"compute-decimal-representation","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
|
||
{"id":4041,"frontendId":3693,"title":"Climbing Stairs II","titleSlug":"climbing-stairs-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":4042,"frontendId":3724,"title":"Minimum Operations to Transform Array","titleSlug":"minimum-operations-to-transform-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
|
||
{"id":4043,"frontendId":3673,"title":"Find Zombie Sessions","titleSlug":"find-zombie-sessions","difficulty":"HARD","paidOnly":false,"tags":[]}
|
||
{"id":4044,"frontendId":3849,"title":"Maximum Bitwise XOR After Rearrangement","titleSlug":"maximum-bitwise-xor-after-rearrangement","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy","bit-manipulation"]}
|
||
{"id":4045,"frontendId":3719,"title":"Longest Balanced Subarray I","titleSlug":"longest-balanced-subarray-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","divide-and-conquer","segment-tree","prefix-sum"]}
|
||
{"id":4047,"frontendId":3721,"title":"Longest Balanced Subarray II","titleSlug":"longest-balanced-subarray-ii","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","divide-and-conquer","segment-tree","prefix-sum"]}
|
||
{"id":4048,"frontendId":3733,"title":"Minimum Time to Complete All Deliveries","titleSlug":"minimum-time-to-complete-all-deliveries","difficulty":"MEDIUM","paidOnly":false,"tags":["math","binary-search"]}
|
||
{"id":4049,"frontendId":3704,"title":"Count No-Zero Pairs That Sum to N","titleSlug":"count-no-zero-pairs-that-sum-to-n","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming"]}
|
||
{"id":4050,"frontendId":3682,"title":"Minimum Index Sum of Common Elements","titleSlug":"minimum-index-sum-of-common-elements","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table"]}
|
||
{"id":4051,"frontendId":3726,"title":"Remove Zeros in Decimal Representation","titleSlug":"remove-zeros-in-decimal-representation","difficulty":"EASY","paidOnly":false,"tags":["math","simulation"]}
|
||
{"id":4052,"frontendId":3707,"title":"Equal Score Substrings","titleSlug":"equal-score-substrings","difficulty":"EASY","paidOnly":false,"tags":["string","prefix-sum"]}
|
||
{"id":4053,"frontendId":3692,"title":"Majority Frequency Characters","titleSlug":"majority-frequency-characters","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string","counting"]}
|
||
{"id":4054,"frontendId":3747,"title":"Count Distinct Integers After Removing Zeros","titleSlug":"count-distinct-integers-after-removing-zeros","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming"]}
|
||
{"id":4055,"frontendId":3713,"title":"Longest Balanced Substring I","titleSlug":"longest-balanced-substring-i","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","counting","enumeration"]}
|
||
{"id":4056,"frontendId":3714,"title":"Longest Balanced Substring II","titleSlug":"longest-balanced-substring-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","prefix-sum"]}
|
||
{"id":4057,"frontendId":3751,"title":"Total Waviness of Numbers in Range I","titleSlug":"total-waviness-of-numbers-in-range-i","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming","enumeration"]}
|
||
{"id":4058,"frontendId":3701,"title":"Compute Alternating Sum","titleSlug":"compute-alternating-sum","difficulty":"EASY","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":4059,"frontendId":3709,"title":"Design Exam Scores Tracker","titleSlug":"design-exam-scores-tracker","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","design","prefix-sum"]}
|
||
{"id":4060,"frontendId":3687,"title":"Library Late Fee Calculator","titleSlug":"library-late-fee-calculator","difficulty":"EASY","paidOnly":true,"tags":["array","simulation"]}
|
||
{"id":4061,"frontendId":3785,"title":"Minimum Swaps to Avoid Forbidden Values","titleSlug":"minimum-swaps-to-avoid-forbidden-values","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","greedy","counting"]}
|
||
{"id":4062,"frontendId":3840,"title":"House Robber V","titleSlug":"house-robber-v","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":4063,"frontendId":3729,"title":"Count Distinct Subarrays Divisible by K in Sorted Array","titleSlug":"count-distinct-subarrays-divisible-by-k-in-sorted-array","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":4064,"frontendId":3777,"title":"Minimum Deletions to Make Alternating Substring","titleSlug":"minimum-deletions-to-make-alternating-substring","difficulty":"HARD","paidOnly":false,"tags":["string","segment-tree"]}
|
||
{"id":4065,"frontendId":3850,"title":"Count Sequences to K","titleSlug":"count-sequences-to-k","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","memoization","number-theory"]}
|
||
{"id":4066,"frontendId":3696,"title":"Maximum Distance Between Unequal Words in Array I","titleSlug":"maximum-distance-between-unequal-words-in-array-i","difficulty":"EASY","paidOnly":true,"tags":["array","string"]}
|
||
{"id":4067,"frontendId":3815,"title":"Design Auction System","titleSlug":"design-auction-system","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","design","heap-priority-queue","ordered-set"]}
|
||
{"id":4068,"frontendId":3712,"title":"Sum of Elements With Frequency Divisible by K","titleSlug":"sum-of-elements-with-frequency-divisible-by-k","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":4069,"frontendId":3725,"title":"Count Ways to Choose Coprime Integers from Rows","titleSlug":"count-ways-to-choose-coprime-integers-from-rows","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","matrix","combinatorics","number-theory"]}
|
||
{"id":4070,"frontendId":3706,"title":"Maximum Distance Between Unequal Words in Array II","titleSlug":"maximum-distance-between-unequal-words-in-array-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["array","string"]}
|
||
{"id":4071,"frontendId":3799,"title":"Word Squares II","titleSlug":"word-squares-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","backtracking","sorting","enumeration"]}
|
||
{"id":4072,"frontendId":3786,"title":"Total Sum of Interaction Cost in Tree Groups","titleSlug":"total-sum-of-interaction-cost-in-tree-groups","difficulty":"HARD","paidOnly":false,"tags":["array","tree","depth-first-search"]}
|
||
{"id":4073,"frontendId":3722,"title":"Lexicographically Smallest String After Reverse","titleSlug":"lexicographically-smallest-string-after-reverse","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","binary-search","enumeration"]}
|
||
{"id":4074,"frontendId":3737,"title":"Count Subarrays With Majority Element I","titleSlug":"count-subarrays-with-majority-element-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","divide-and-conquer","segment-tree","merge-sort","counting","prefix-sum"]}
|
||
{"id":4075,"frontendId":3739,"title":"Count Subarrays With Majority Element II","titleSlug":"count-subarrays-with-majority-element-ii","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","divide-and-conquer","segment-tree","merge-sort","prefix-sum"]}
|
||
{"id":4077,"frontendId":3752,"title":"Lexicographically Smallest Negated Permutation that Sums to Target","titleSlug":"lexicographically-smallest-negated-permutation-that-sums-to-target","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","two-pointers","greedy","sorting"]}
|
||
{"id":4078,"frontendId":3727,"title":"Maximum Alternating Sum of Squares","titleSlug":"maximum-alternating-sum-of-squares","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
|
||
{"id":4079,"frontendId":3814,"title":"Maximum Capacity Within Budget","titleSlug":"maximum-capacity-within-budget","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","sorting"]}
|
||
{"id":4080,"frontendId":3718,"title":"Smallest Missing Multiple of K","titleSlug":"smallest-missing-multiple-of-k","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":4081,"frontendId":3711,"title":"Maximum Transactions Without Negative Balance","titleSlug":"maximum-transactions-without-negative-balance","difficulty":"MEDIUM","paidOnly":true,"tags":["array","greedy","heap-priority-queue"]}
|
||
{"id":4083,"frontendId":3728,"title":"Stable Subarrays With Equal Boundary and Interior Sum","titleSlug":"stable-subarrays-with-equal-boundary-and-interior-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","prefix-sum"]}
|
||
{"id":4084,"frontendId":3723,"title":"Maximize Sum of Squares of Digits","titleSlug":"maximize-sum-of-squares-of-digits","difficulty":"MEDIUM","paidOnly":false,"tags":["math","greedy"]}
|
||
{"id":4085,"frontendId":3770,"title":"Largest Prime from Consecutive Prime Sum","titleSlug":"largest-prime-from-consecutive-prime-sum","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","number-theory"]}
|
||
{"id":4086,"frontendId":3816,"title":"Lexicographically Smallest String After Deleting Duplicate Characters","titleSlug":"lexicographically-smallest-string-after-deleting-duplicate-characters","difficulty":"HARD","paidOnly":false,"tags":["hash-table","string","stack","greedy","monotonic-stack"]}
|
||
{"id":4087,"frontendId":3760,"title":"Maximum Substrings With Distinct Start","titleSlug":"maximum-substrings-with-distinct-start","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":4089,"frontendId":3767,"title":"Maximize Points After Choosing K Tasks","titleSlug":"maximize-points-after-choosing-k-tasks","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting","heap-priority-queue"]}
|
||
{"id":4090,"frontendId":3746,"title":"Minimum String Length After Balanced Removals","titleSlug":"minimum-string-length-after-balanced-removals","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","counting"]}
|
||
{"id":4091,"frontendId":3705,"title":"Find Golden Hour Customers","titleSlug":"find-golden-hour-customers","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":4095,"frontendId":3791,"title":"Number of Balanced Integers in a Range","titleSlug":"number-of-balanced-integers-in-a-range","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming"]}
|
||
{"id":4098,"frontendId":3738,"title":"Longest Non-Decreasing Subarray After Replacing at Most One Element","titleSlug":"longest-non-decreasing-subarray-after-replacing-at-most-one-element","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":4099,"frontendId":3766,"title":"Minimum Operations to Make Binary Palindrome","titleSlug":"minimum-operations-to-make-binary-palindrome","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","bit-manipulation"]}
|
||
{"id":4100,"frontendId":3765,"title":"Complete Prime Number","titleSlug":"complete-prime-number","difficulty":"MEDIUM","paidOnly":false,"tags":["math","enumeration","number-theory"]}
|
||
{"id":4101,"frontendId":3732,"title":"Maximum Product of Three Elements After One Replacement","titleSlug":"maximum-product-of-three-elements-after-one-replacement","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","greedy","sorting"]}
|
||
{"id":4103,"frontendId":3716,"title":"Find Churn Risk Customers","titleSlug":"find-churn-risk-customers","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":4106,"frontendId":3735,"title":"Lexicographically Smallest String After Reverse II","titleSlug":"lexicographically-smallest-string-after-reverse-ii","difficulty":"HARD","paidOnly":true,"tags":["string","binary-search","rolling-hash","suffix-array","hash-function"]}
|
||
{"id":4107,"frontendId":3731,"title":"Find Missing Elements","titleSlug":"find-missing-elements","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sorting"]}
|
||
{"id":4108,"frontendId":3717,"title":"Minimum Operations to Make the Array Beautiful","titleSlug":"minimum-operations-to-make-the-array-beautiful","difficulty":"MEDIUM","paidOnly":true,"tags":["array","dynamic-programming"]}
|
||
{"id":4109,"frontendId":3730,"title":"Maximum Calories Burnt from Jumps","titleSlug":"maximum-calories-burnt-from-jumps","difficulty":"MEDIUM","paidOnly":true,"tags":["array","two-pointers","greedy","sorting"]}
|
||
{"id":4110,"frontendId":3748,"title":"Count Stable Subarrays","titleSlug":"count-stable-subarrays","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","prefix-sum"]}
|
||
{"id":4112,"frontendId":3745,"title":"Maximize Expression of Three Elements","titleSlug":"maximize-expression-of-three-elements","difficulty":"EASY","paidOnly":false,"tags":["array","greedy","sorting","enumeration"]}
|
||
{"id":4113,"frontendId":3744,"title":"Find Kth Character in Expanded String","titleSlug":"find-kth-character-in-expanded-string","difficulty":"MEDIUM","paidOnly":true,"tags":["string"]}
|
||
{"id":4115,"frontendId":3740,"title":"Minimum Distance Between Three Equal Elements I","titleSlug":"minimum-distance-between-three-equal-elements-i","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":4116,"frontendId":3736,"title":"Minimum Moves to Equal Array Elements III","titleSlug":"minimum-moves-to-equal-array-elements-iii","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
|
||
{"id":4118,"frontendId":3829,"title":"Design Ride Sharing System","titleSlug":"design-ride-sharing-system","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","design","queue","data-stream"]}
|
||
{"id":4119,"frontendId":3741,"title":"Minimum Distance Between Three Equal Elements II","titleSlug":"minimum-distance-between-three-equal-elements-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":4121,"frontendId":3826,"title":"Minimum Partition Score","titleSlug":"minimum-partition-score","difficulty":"HARD","paidOnly":false,"tags":["array","divide-and-conquer","dynamic-programming","queue","prefix-sum","monotonic-queue"]}
|
||
{"id":4122,"frontendId":3828,"title":"Final Element After Subarray Deletions","titleSlug":"final-element-after-subarray-deletions","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","brainteaser","game-theory"]}
|
||
{"id":4126,"frontendId":3750,"title":"Minimum Number of Flips to Reverse Binary String","titleSlug":"minimum-number-of-flips-to-reverse-binary-string","difficulty":"EASY","paidOnly":false,"tags":["math","two-pointers","string","bit-manipulation"]}
|
||
{"id":4127,"frontendId":3778,"title":"Minimum Distance Excluding One Maximum Weighted Edge","titleSlug":"minimum-distance-excluding-one-maximum-weighted-edge","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
|
||
{"id":4128,"frontendId":3753,"title":"Total Waviness of Numbers in Range II","titleSlug":"total-waviness-of-numbers-in-range-ii","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming"]}
|
||
{"id":4129,"frontendId":3804,"title":"Number of Centered Subarrays","titleSlug":"number-of-centered-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","enumeration"]}
|
||
{"id":4130,"frontendId":3781,"title":"Maximum Score After Binary Swaps","titleSlug":"maximum-score-after-binary-swaps","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","greedy","heap-priority-queue"]}
|
||
{"id":4132,"frontendId":3802,"title":"Number of Ways to Paint Sheets","titleSlug":"number-of-ways-to-paint-sheets","difficulty":"HARD","paidOnly":true,"tags":[]}
|
||
{"id":4134,"frontendId":3757,"title":"Number of Effective Subsequences","titleSlug":"number-of-effective-subsequences","difficulty":"HARD","paidOnly":false,"tags":["array","math","dynamic-programming","bit-manipulation","combinatorics"]}
|
||
{"id":4135,"frontendId":3754,"title":"Concatenate Non-Zero Digits and Multiply by Sum I","titleSlug":"concatenate-non-zero-digits-and-multiply-by-sum-i","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":4136,"frontendId":3756,"title":"Concatenate Non-Zero Digits and Multiply by Sum II","titleSlug":"concatenate-non-zero-digits-and-multiply-by-sum-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["math","string","prefix-sum"]}
|
||
{"id":4137,"frontendId":3839,"title":"Number of Prefix Connected Groups","titleSlug":"number-of-prefix-connected-groups","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","counting"]}
|
||
{"id":4138,"frontendId":3784,"title":"Minimum Deletion Cost to Make All Characters Equal","titleSlug":"minimum-deletion-cost-to-make-all-characters-equal","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","enumeration"]}
|
||
{"id":4139,"frontendId":3761,"title":"Minimum Absolute Distance Between Mirror Pairs","titleSlug":"minimum-absolute-distance-between-mirror-pairs","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math"]}
|
||
{"id":4140,"frontendId":3749,"title":"Evaluate Valid Expressions","titleSlug":"evaluate-valid-expressions","difficulty":"HARD","paidOnly":true,"tags":["hash-table","math","string","divide-and-conquer","stack"]}
|
||
{"id":4141,"frontendId":3759,"title":"Count Elements With at Least K Greater Values","titleSlug":"count-elements-with-at-least-k-greater-values","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","divide-and-conquer","sorting","quickselect"]}
|
||
{"id":4143,"frontendId":3811,"title":"Number of Alternating XOR Partitions","titleSlug":"number-of-alternating-xor-partitions","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","dynamic-programming","bit-manipulation"]}
|
||
{"id":4144,"frontendId":3801,"title":"Minimum Cost to Merge Sorted Lists","titleSlug":"minimum-cost-to-merge-sorted-lists","difficulty":"HARD","paidOnly":false,"tags":["array","two-pointers","binary-search","dynamic-programming","bit-manipulation"]}
|
||
{"id":4145,"frontendId":3768,"title":"Minimum Inversion Count in Subarrays of Fixed Length","titleSlug":"minimum-inversion-count-in-subarrays-of-fixed-length","difficulty":"HARD","paidOnly":false,"tags":["array","segment-tree","sliding-window"]}
|
||
{"id":4146,"frontendId":3771,"title":"Total Score of Dungeon Runs","titleSlug":"total-score-of-dungeon-runs","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","prefix-sum"]}
|
||
{"id":4147,"frontendId":3789,"title":"Minimum Cost to Acquire Required Items","titleSlug":"minimum-cost-to-acquire-required-items","difficulty":"MEDIUM","paidOnly":false,"tags":["math","greedy"]}
|
||
{"id":4148,"frontendId":3758,"title":"Convert Number Words to Digits","titleSlug":"convert-number-words-to-digits","difficulty":"MEDIUM","paidOnly":true,"tags":["string","trie"]}
|
||
{"id":4150,"frontendId":3769,"title":"Sort Integers by Binary Reflection","titleSlug":"sort-integers-by-binary-reflection","difficulty":"EASY","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":4151,"frontendId":3772,"title":"Maximum Subgraph Score in a Tree","titleSlug":"maximum-subgraph-score-in-a-tree","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","tree","depth-first-search"]}
|
||
{"id":4152,"frontendId":3795,"title":"Minimum Subarray Length With Distinct Sum At Least K","titleSlug":"minimum-subarray-length-with-distinct-sum-at-least-k","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sliding-window"]}
|
||
{"id":4153,"frontendId":3797,"title":"Count Routes to Climb a Rectangular Grid","titleSlug":"count-routes-to-climb-a-rectangular-grid","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","matrix","prefix-sum"]}
|
||
{"id":4154,"frontendId":3806,"title":"Maximum Bitwise AND After Increment Operations","titleSlug":"maximum-bitwise-and-after-increment-operations","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","bit-manipulation","sorting"]}
|
||
{"id":4155,"frontendId":3773,"title":"Maximum Number of Equal Length Runs","titleSlug":"maximum-number-of-equal-length-runs","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string","counting"]}
|
||
{"id":4156,"frontendId":3800,"title":"Minimum Cost to Make Two Binary Strings Equal","titleSlug":"minimum-cost-to-make-two-binary-strings-equal","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy"]}
|
||
{"id":4157,"frontendId":3775,"title":"Reverse Words With Same Vowel Count","titleSlug":"reverse-words-with-same-vowel-count","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string","simulation"]}
|
||
{"id":4158,"frontendId":3774,"title":"Absolute Difference Between Maximum and Minimum K Elements","titleSlug":"absolute-difference-between-maximum-and-minimum-k-elements","difficulty":"EASY","paidOnly":false,"tags":["array","sorting"]}
|
||
{"id":4160,"frontendId":3780,"title":"Maximum Sum of Three Numbers Divisible by Three","titleSlug":"maximum-sum-of-three-numbers-divisible-by-three","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting","heap-priority-queue"]}
|
||
{"id":4162,"frontendId":3779,"title":"Minimum Number of Operations to Have Distinct Elements","titleSlug":"minimum-number-of-operations-to-have-distinct-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table"]}
|
||
{"id":4164,"frontendId":3782,"title":"Last Remaining Integer After Alternating Deletion Operations","titleSlug":"last-remaining-integer-after-alternating-deletion-operations","difficulty":"HARD","paidOnly":false,"tags":["math","recursion"]}
|
||
{"id":4165,"frontendId":3787,"title":"Find Diameter Endpoints of a Tree","titleSlug":"find-diameter-endpoints-of-a-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","breadth-first-search","graph"]}
|
||
{"id":4166,"frontendId":3763,"title":"Maximum Total Sum with Threshold Constraints","titleSlug":"maximum-total-sum-with-threshold-constraints","difficulty":"MEDIUM","paidOnly":true,"tags":["array","greedy","sorting","heap-priority-queue"]}
|
||
{"id":4168,"frontendId":3783,"title":"Mirror Distance of an Integer","titleSlug":"mirror-distance-of-an-integer","difficulty":"EASY","paidOnly":false,"tags":["math"]}
|
||
{"id":4169,"frontendId":3764,"title":"Most Common Course Pairs","titleSlug":"most-common-course-pairs","difficulty":"HARD","paidOnly":false,"tags":[]}
|
||
{"id":4170,"frontendId":3846,"title":"Total Distance to Type a String Using One Finger","titleSlug":"total-distance-to-type-a-string-using-one-finger","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","string"]}
|
||
{"id":4171,"frontendId":3819,"title":"Rotate Non Negative Elements","titleSlug":"rotate-non-negative-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":4172,"frontendId":3792,"title":"Sum of Increasing Product Blocks","titleSlug":"sum-of-increasing-product-blocks","difficulty":"MEDIUM","paidOnly":true,"tags":["math","simulation"]}
|
||
{"id":4173,"frontendId":3788,"title":"Maximum Score of a Split","titleSlug":"maximum-score-of-a-split","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
|
||
{"id":4175,"frontendId":3790,"title":"Smallest All-Ones Multiple","titleSlug":"smallest-all-ones-multiple","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","math"]}
|
||
{"id":4176,"frontendId":3824,"title":"Minimum K to Reduce Array Within Limit","titleSlug":"minimum-k-to-reduce-array-within-limit","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search"]}
|
||
{"id":4177,"frontendId":3794,"title":"Reverse String Prefix","titleSlug":"reverse-string-prefix","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string"]}
|
||
{"id":4178,"frontendId":3813,"title":"Vowel-Consonant Score","titleSlug":"vowel-consonant-score","difficulty":"EASY","paidOnly":false,"tags":["string","simulation"]}
|
||
{"id":4179,"frontendId":3798,"title":"Largest Even Number","titleSlug":"largest-even-number","difficulty":"EASY","paidOnly":false,"tags":["string"]}
|
||
{"id":4180,"frontendId":3820,"title":"Pythagorean Distance Nodes in a Tree","titleSlug":"pythagorean-distance-nodes-in-a-tree","difficulty":"MEDIUM","paidOnly":false,"tags":["tree","breadth-first-search"]}
|
||
{"id":4181,"frontendId":3812,"title":"Minimum Edge Toggles on a Tree","titleSlug":"minimum-edge-toggles-on-a-tree","difficulty":"HARD","paidOnly":false,"tags":["tree","depth-first-search","graph","topological-sort","sorting"]}
|
||
{"id":4183,"frontendId":3805,"title":"Count Caesar Cipher Pairs","titleSlug":"count-caesar-cipher-pairs","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","string","counting"]}
|
||
{"id":4186,"frontendId":3803,"title":"Count Residue Prefixes","titleSlug":"count-residue-prefixes","difficulty":"EASY","paidOnly":false,"tags":["hash-table","string"]}
|
||
{"id":4187,"frontendId":3809,"title":"Best Reachable Tower","titleSlug":"best-reachable-tower","difficulty":"MEDIUM","paidOnly":false,"tags":["array"]}
|
||
{"id":4189,"frontendId":3821,"title":"Find Nth Smallest Integer With K One Bits","titleSlug":"find-nth-smallest-integer-with-k-one-bits","difficulty":"HARD","paidOnly":false,"tags":["math","bit-manipulation","combinatorics"]}
|
||
{"id":4190,"frontendId":3810,"title":"Minimum Operations to Reach Target Array","titleSlug":"minimum-operations-to-reach-target-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy"]}
|
||
{"id":4194,"frontendId":3827,"title":"Count Monobit Integers","titleSlug":"count-monobit-integers","difficulty":"EASY","paidOnly":false,"tags":["bit-manipulation","enumeration"]}
|
||
{"id":4195,"frontendId":3793,"title":"Find Users with High Token Usage","titleSlug":"find-users-with-high-token-usage","difficulty":"EASY","paidOnly":false,"tags":[]}
|
||
{"id":4197,"frontendId":3807,"title":"Minimum Cost to Repair Edges to Traverse a Graph","titleSlug":"minimum-cost-to-repair-edges-to-traverse-a-graph","difficulty":"MEDIUM","paidOnly":true,"tags":["binary-search","breadth-first-search","graph"]}
|
||
{"id":4198,"frontendId":3830,"title":"Longest Alternating Subarray After Removing At Most One Element","titleSlug":"longest-alternating-subarray-after-removing-at-most-one-element","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","enumeration"]}
|
||
{"id":4199,"frontendId":3818,"title":"Minimum Prefix Removal to Make Array Strictly Increasing","titleSlug":"minimum-prefix-removal-to-make-array-strictly-increasing","difficulty":"MEDIUM","paidOnly":false,"tags":["array"]}
|
||
{"id":4200,"frontendId":3823,"title":"Reverse Letters Then Special Characters in a String","titleSlug":"reverse-letters-then-special-characters-in-a-string","difficulty":"EASY","paidOnly":false,"tags":["two-pointers","string","simulation"]}
|
||
{"id":4201,"frontendId":3822,"title":"Design Order Management System","titleSlug":"design-order-management-system","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","design"]}
|
||
{"id":4202,"frontendId":3836,"title":"Maximum Score Using Exactly K Pairs","titleSlug":"maximum-score-using-exactly-k-pairs","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
|
||
{"id":4204,"frontendId":3845,"title":"Maximum Subarray XOR with Bounded Range","titleSlug":"maximum-subarray-xor-with-bounded-range","difficulty":"HARD","paidOnly":false,"tags":["array","bit-manipulation","trie","queue","sliding-window","prefix-sum","monotonic-queue"]}
|
||
{"id":4207,"frontendId":3817,"title":"Good Indices in a Digit String","titleSlug":"good-indices-in-a-digit-string","difficulty":"MEDIUM","paidOnly":true,"tags":["math","string"]}
|
||
{"id":4208,"frontendId":3808,"title":"Find Emotionally Consistent Users","titleSlug":"find-emotionally-consistent-users","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
|
||
{"id":4209,"frontendId":3841,"title":"Palindromic Path Queries in a Tree","titleSlug":"palindromic-path-queries-in-a-tree","difficulty":"HARD","paidOnly":false,"tags":["array","string","divide-and-conquer","tree","segment-tree"]}
|
||
{"id":4210,"frontendId":3831,"title":"Median of a Binary Search Tree Level","titleSlug":"median-of-a-binary-search-tree-level","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","depth-first-search","breadth-first-search","binary-search-tree","binary-tree"]}
|
||
{"id":4211,"frontendId":3835,"title":"Count Subarrays With Cost Less Than or Equal to K","titleSlug":"count-subarrays-with-cost-less-than-or-equal-to-k","difficulty":"MEDIUM","paidOnly":false,"tags":["array","queue","monotonic-queue"]}
|
||
{"id":4212,"frontendId":3842,"title":"Toggle Light Bulbs","titleSlug":"toggle-light-bulbs","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","sorting","simulation"]}
|
||
{"id":4213,"frontendId":3834,"title":"Merge Adjacent Equal Elements","titleSlug":"merge-adjacent-equal-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","simulation"]}
|
||
{"id":4214,"frontendId":3833,"title":"Count Dominant Indices","titleSlug":"count-dominant-indices","difficulty":"EASY","paidOnly":false,"tags":["array","enumeration"]}
|
||
{"id":4216,"frontendId":3838,"title":"Weighted Word Mapping","titleSlug":"weighted-word-mapping","difficulty":"EASY","paidOnly":false,"tags":["array","string","simulation"]}
|
||
{"id":4217,"frontendId":3843,"title":"First Element with Unique Frequency","titleSlug":"first-element-with-unique-frequency","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","counting"]}
|
||
{"id":4221,"frontendId":3844,"title":"Longest Almost-Palindromic Substring","titleSlug":"longest-almost-palindromic-substring","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string","dynamic-programming"]}
|
||
{"id":4224,"frontendId":3847,"title":"Find the Score Difference in a Game","titleSlug":"find-the-score-difference-in-a-game","difficulty":"MEDIUM","paidOnly":false,"tags":["array","simulation"]}
|
||
{"id":4226,"frontendId":3848,"title":"Check Digitorial Permutation","titleSlug":"check-digitorial-permutation","difficulty":"MEDIUM","paidOnly":false,"tags":["math","counting"]}
|
||
{"id":4227,"frontendId":3832,"title":"Find Users with Persistent Behavior Patterns","titleSlug":"find-users-with-persistent-behavior-patterns","difficulty":"HARD","paidOnly":false,"tags":[]}
|
||
{"id":4228,"frontendId":3837,"title":"Delayed Count of Equal Elements","titleSlug":"delayed-count-of-equal-elements","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","counting"]}
|
||
{"id":4250,"frontendId":3851,"title":"Maximum Requests Without Violating the Limit","titleSlug":"maximum-requests-without-violating-the-limit","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","greedy","sliding-window","sorting"]}
|