{"source":{"repository":"doocs/leetcode","commit":"6fc879bc8719ba27d0239db8d0b225d9993f07c8","checked_at":"2026-10-05T17:18:28+00:00"},"tags":["'Sprague–Grundy '","0-1 BFS","0-1 Knapsack","A* Search","Aho-Corasick","Algorithm X","Array","Articulation Point","Backtracking","Bellman–Ford","Biconnected Component","Bidirectional Search","Binary Indexed Tree","Binary Lifting","Binary Search","Binary Search Tree","Binary Tree","Bipartite Graph","Bit Manipulation","Bitmask","Borůvka","Bounded Knapsack","Boyer-Moore Voting","Boyer–Moore","Brainteaser","Breadth-First Search","Bridge","Brute-Force Search","Bubble Sort","Bucket Sort","Bézout's Identity","Cartesian Tree","Closest Pair of Points","Combinatorics","Concurrency","Convex Hull","Counting","Counting Sort","Dancing Links","Data Stream","Database","Depth-First Search","Design","Dijkstra","Dinic","Directed Acyclic Graph","Divide and Conquer","Doubly-Linked List","Dynamic Programming","Edmonds–Karp","Enumeration","Euclidean Algorithm","Euler's Theorem","Euler's Totient Function","Eulerian Circuit","Eulerian Graph","Eulerian Path","Extended Euclidean Algorithm","Extended KMP","Fermat's Little Theorem","Floyd Cycle Detection","Floyd–Warshall","Game Theory","Geometry","Graph","Graph Coloring","Graph Matching","Greatest Common Divisor","Greedy","Hamiltonian Path","Hash Function","Hash Table","Heap (Priority Queue)","Heuristic Search","Hungarian Algorithm","Impartial Game","Inclusion-Exclusion","Interactive","Iterator","JavaScript","K-D Tree","KMP","Knapsack","Kosaraju","Kruskal","Least Common Multiple","Li Chao Tree","Linear Algebra","Linked List","Longest Common Subsequence","Longest Increasing Subsequence","Lowest Common Ancestor","Lyndon Factorization","MPM","Manacher","Math","Matrix","Max Flow","Maximum Matching","Meet in the Middle","Memoization","Merge Sort","Min Cut","Min-Cost Flow","Minimax","Minimum Spanning Tree","Mixed Knapsack","Monotonic Queue","Monotonic Stack","Network Flow","Newton's Method","Nim Game","Number Theory","Ordered Set","Palindromic Tre","Pandas","Parentheses","Perfect Matching","Persistent Data Structure","Pigeonhole Principle","Planar Graph","Polygon","Prefix Sum","Prim","Primality Test","Prime Factorization","Probability and Statistics","Push-Relabel","Queue","Quick Sort","Quickselect","Radix Sort","Randomized","Range Query","Recursion","Rejection Sampling","Reservoir Sampling","Rolling Hash","SSP","Segment Tree","Semi-Eulerian Graph","Shell","Shortest Path","Sieve","Sieve of Eratosthenes","Simulation","Sliding Window","Smallest Enclosing Circle","Smallest Representation","Sort","Sorting","Sparse Table","Splay Tree","Sqrt Decomposition","Stack","String","String Matching","Strongly Connected Component","Suffix Array","Suffix Automato","Suffix Tree","Sweep Line","Tarjan","Ternary Search","Timsort","Topological Sort","Tournament Sort","Treap","Tree","Tree DP","Triangulation","Trie","Two Pointers","Unbounded Knapsack","Union Find","Zero-Sum Game","k-Shortest Paths"],"categories":["Algorithms","Database","JavaScript / TypeScript","Pandas"],"rows":[[1,"Two Sum","two-sum",0,[6,71],[["/patterns/hashing-and-sufficient-summaries/","Ch. 05"],["/worked/two-sum/","Worked lesson"],["/practice/#two-sum","Solution"]]],[2,"Add Two Numbers","add-two-numbers",0,[134,88,95],[["/practice/#add-two-numbers","Solution"]]],[3,"Longest Substring Without Repeating Characters","longest-substring-without-repeating-characters",0,[71,155,146],[["/patterns/sliding-windows-and-monotone-validity/","Ch. 08"],["/worked/longest-substring-without-repeating-characters/","Worked lesson"],["/practice/#longest-substring-without-repeating-characters","Solution"]]],[4,"Median of Two Sorted Arrays","median-of-two-sorted-arrays",0,[6,14,46],[["/practice/#median-of-two-sorted-arrays","Solution"]]],[5,"Longest Palindromic Substring","longest-palindromic-substring",0,[172,155,48,94],[["/patterns/tries-and-string-structure/","Ch. 20"],["/practice/#longest-palindromic-substring","Solution"]]],[6,"Zigzag Conversion","zigzag-conversion",0,[155],[["/practice/#zigzag-conversion","Solution"]]],[7,"Reverse Integer","reverse-integer",0,[95],[["/practice/#reverse-integer","Solution"]]],[8,"String to Integer (atoi)","string-to-integer-atoi",0,[155],[["/practice/#string-to-integer-atoi","Solution"]]],[9,"Palindrome Number","palindrome-number",0,[95],[["/practice/#palindrome-number","Solution"]]],[10,"Regular Expression Matching","regular-expression-matching",0,[134,155,48],[["/practice/#regular-expression-matching","Solution"]]],[11,"Container With Most Water","container-with-most-water",0,[68,6,172],[["/patterns/two-pointers-and-safe-elimination/","Ch. 07"],["/practice/#container-with-most-water","Solution"]]],[12,"Integer to Roman","integer-to-roman",0,[71,95,155],[["/practice/#integer-to-roman","Solution"]]],[13,"Roman to Integer","roman-to-integer",0,[71,95,155],[["/practice/#roman-to-integer","Solution"]]],[14,"Longest Common Prefix","longest-common-prefix",0,[171,6,155],[["/practice/#longest-common-prefix","Solution"]]],[15,"3Sum","3sum",0,[6,172,150],[["/patterns/two-pointers-and-safe-elimination/","Ch. 07"],["/practice/#3sum","Solution"]]],[16,"3Sum Closest","3sum-closest",0,[6,172,150],[["/practice/#3sum-closest","Solution"]]],[17,"Letter Combinations of a Phone Number","letter-combinations-of-a-phone-number",0,[71,155,8],[["/practice/#letter-combinations-of-a-phone-number","Solution"]]],[18,"4Sum","4sum",0,[6,172,150],[["/practice/#4sum","Solution"]]],[19,"Remove Nth Node From End of List","remove-nth-node-from-end-of-list",0,[88,172],[["/patterns/linked-lists-and-recursive-trees/","Ch. 13"],["/practice/#remove-nth-node-from-end-of-list","Solution"]]],[20,"Valid Parentheses","valid-parentheses",0,[154,155,116],[["/patterns/stacks-and-monotonic-deques/","Ch. 10"],["/worked/valid-parentheses/","Worked lesson"],["/practice/#valid-parentheses","Solution"]]],[21,"Merge Two Sorted Lists","merge-two-sorted-lists",0,[134,88],[["/patterns/linked-lists-and-recursive-trees/","Ch. 13"],["/practice/#merge-two-sorted-lists","Solution"]]],[22,"Generate Parentheses","generate-parentheses",0,[155,48,8,116],[["/patterns/backtracking-and-the-search-tree/","Ch. 14"],["/practice/#generate-parentheses","Solution"]]],[23,"Merge k Sorted Lists","merge-k-sorted-lists",0,[88,46,72,101,166],[["/patterns/heaps-and-the-candidate-frontier/","Ch. 11"],["/worked/merge-k-sorted-lists/","Worked lesson"],["/practice/#merge-k-sorted-lists","Solution"]]],[24,"Swap Nodes in Pairs","swap-nodes-in-pairs",0,[134,88],[["/practice/#swap-nodes-in-pairs","Solution"]]],[25,"Reverse Nodes in k-Group","reverse-nodes-in-k-group",0,[134,88],[["/practice/#reverse-nodes-in-k-group","Solution"]]],[26,"Remove Duplicates from Sorted Array","remove-duplicates-from-sorted-array",0,[6,172],[["/patterns/two-pointers-and-safe-elimination/","Ch. 07"],["/practice/#remove-duplicates-from-sorted-array","Solution"]]],[27,"Remove Element","remove-element",0,[6,172],[["/practice/#remove-element","Solution"]]],[28,"Find the Index of the First Occurrence in a String","find-the-index-of-the-first-occurrence-in-a-string",0,[172,155,156,81,23,58],[["/patterns/tries-and-string-structure/","Ch. 20"],["/practice/#find-the-index-of-the-first-occurrence-in-a-string","Solution"]]],[29,"Divide Two Integers","divide-two-integers",0,[18,95],[["/practice/#divide-two-integers","Solution"]]],[30,"Substring with Concatenation of All Words","substring-with-concatenation-of-all-words",0,[71,155,146],[["/practice/#substring-with-concatenation-of-all-words","Solution"]]],[31,"Next Permutation","next-permutation",0,[6,172],[["/practice/#next-permutation","Solution"]]],[32,"Longest Valid Parentheses","longest-valid-parentheses",0,[154,155,48,116],[["/practice/#longest-valid-parentheses","Solution"]]],[33,"Search in Rotated Sorted Array","search-in-rotated-sorted-array",0,[6,14],[["/patterns/binary-search-over-a-boundary/","Ch. 09"],["/practice/#search-in-rotated-sorted-array","Solution"]]],[34,"Find First and Last Position of Element in Sorted Array","find-first-and-last-position-of-element-in-sorted-array",0,[6,14],[["/patterns/binary-search-over-a-boundary/","Ch. 09"],["/practice/#find-first-and-last-position-of-element-in-sorted-array","Solution"]]],[35,"Search Insert Position","search-insert-position",0,[6,14],[["/patterns/binary-search-over-a-boundary/","Ch. 09"],["/worked/search-insert-position/","Worked lesson"],["/practice/#search-insert-position","Solution"]]],[36,"Valid Sudoku","valid-sudoku",0,[6,71,96],[["/practice/#valid-sudoku","Solution"]]],[37,"Sudoku Solver","sudoku-solver",0,[6,71,8,96,5,38],[["/practice/#sudoku-solver","Solution"]]],[38,"Count and Say","count-and-say",0,[155],[["/practice/#count-and-say","Solution"]]],[39,"Combination Sum","combination-sum",0,[6,8],[["/patterns/backtracking-and-the-search-tree/","Ch. 14"],["/practice/#combination-sum","Solution"]]],[40,"Combination Sum II","combination-sum-ii",0,[6,8],[["/practice/#combination-sum-ii","Solution"]]],[41,"First Missing Positive","first-missing-positive",0,[6,71],[["/practice/#first-missing-positive","Solution"]]],[42,"Trapping Rain Water","trapping-rain-water",0,[154,6,172,48,108],[["/worked/trapping-rain-water/","Worked lesson"],["/practice/#trapping-rain-water","Solution"]]],[43,"Multiply Strings","multiply-strings",0,[95,155,145],[["/practice/#multiply-strings","Solution"]]],[44,"Wildcard Matching","wildcard-matching",0,[68,134,155,48],[["/practice/#wildcard-matching","Solution"]]],[45,"Jump Game II","jump-game-ii",0,[68,6,48],[["/patterns/sorting-intervals-and-greedy-choices/","Ch. 12"],["/practice/#jump-game-ii","Solution"]]],[46,"Permutations","permutations",0,[6,8],[["/patterns/backtracking-and-the-search-tree/","Ch. 14"],["/practice/#permutations","Solution"]]],[47,"Permutations II","permutations-ii",0,[6,8,150],[["/patterns/backtracking-and-the-search-tree/","Ch. 14"],["/practice/#permutations-ii","Solution"]]],[48,"Rotate Image","rotate-image",0,[6,95,96],[["/practice/#rotate-image","Solution"]]],[49,"Group Anagrams","group-anagrams",0,[6,71,155,150],[["/patterns/hashing-and-sufficient-summaries/","Ch. 05"],["/worked/group-anagrams/","Worked lesson"],["/practice/#group-anagrams","Solution"]]],[50,"Pow(x, n)","powx-n",0,[134,95],[["/patterns/bits-mathematics-and-small-state-spaces/","Ch. 21"],["/practice/#powx-n","Solution"]]],[51,"N-Queens","n-queens",0,[6,8,5],[["/patterns/backtracking-and-the-search-tree/","Ch. 14"],["/practice/#n-queens","Solution"]]],[52,"N-Queens II","n-queens-ii",0,[8,5],[["/practice/#n-queens-ii","Solution"]]],[53,"Maximum Subarray","maximum-subarray",0,[6,46,48],[["/worked/maximum-subarray/","Worked lesson"],["/practice/#maximum-subarray","Solution"]]],[54,"Spiral Matrix","spiral-matrix",0,[6,96,145],[["/practice/#spiral-matrix","Solution"]]],[55,"Jump Game","jump-game",0,[68,6,48],[["/patterns/sorting-intervals-and-greedy-choices/","Ch. 12"],["/practice/#jump-game","Solution"]]],[56,"Merge Intervals","merge-intervals",0,[6,150,129],[["/patterns/sorting-intervals-and-greedy-choices/","Ch. 12"],["/worked/merge-intervals/","Worked lesson"],["/practice/#merge-intervals","Solution"]]],[57,"Insert Interval","insert-interval",0,[6],[["/patterns/sorting-intervals-and-greedy-choices/","Ch. 12"],["/practice/#insert-interval","Solution"]]],[58,"Length of Last Word","length-of-last-word",0,[155],[["/practice/#length-of-last-word","Solution"]]],[59,"Spiral Matrix II","spiral-matrix-ii",0,[6,96,145],[["/practice/#spiral-matrix-ii","Solution"]]],[60,"Permutation Sequence","permutation-sequence",0,[134,95],[["/practice/#permutation-sequence","Solution"]]],[61,"Rotate List","rotate-list",0,[88,172],[["/practice/#rotate-list","Solution"]]],[62,"Unique Paths","unique-paths",0,[95,48,33],[["/practice/#unique-paths","Solution"]]],[63,"Unique Paths II","unique-paths-ii",0,[6,48,96],[["/practice/#unique-paths-ii","Solution"]]],[64,"Minimum Path Sum","minimum-path-sum",0,[6,48,96],[["/practice/#minimum-path-sum","Solution"]]],[65,"Valid Number","valid-number",0,[155],[["/practice/#valid-number","Solution"]]],[66,"Plus One","plus-one",0,[6,95],[["/practice/#plus-one","Solution"]]],[67,"Add Binary","add-binary",0,[18,95,155,145],[["/practice/#add-binary","Solution"]]],[68,"Text Justification","text-justification",0,[6,155,145],[["/practice/#text-justification","Solution"]]],[69,"Sqrt(x)","sqrtx",0,[95,14,110],[["/practice/#sqrtx","Solution"]]],[70,"Climbing Stairs","climbing-stairs",0,[100,95,48],[["/patterns/dynamic-programming-from-sufficient-state/","Ch. 18"],["/practice/#climbing-stairs","Solution"]]],[71,"Simplify Path","simplify-path",0,[154,155],[["/practice/#simplify-path","Solution"]]],[72,"Edit Distance","edit-distance",0,[155,48],[["/patterns/dynamic-programming-families/","Ch. 19"],["/practice/#edit-distance","Solution"]]],[73,"Set Matrix Zeroes","set-matrix-zeroes",0,[6,71,96],[["/practice/#set-matrix-zeroes","Solution"]]],[74,"Search a 2D Matrix","search-a-2d-matrix",0,[6,14,96],[["/practice/#search-a-2d-matrix","Solution"]]],[75,"Sort Colors","sort-colors",0,[6,172,28,150,129],[["/practice/#sort-colors","Solution"]]],[76,"Minimum Window Substring","minimum-window-substring",0,[71,155,146],[["/patterns/sliding-windows-and-monotone-validity/","Ch. 08"],["/practice/#minimum-window-substring","Solution"]]],[77,"Combinations","combinations",0,[8],[["/practice/#combinations","Solution"]]],[78,"Subsets","subsets",0,[18,6,8],[["/patterns/backtracking-and-the-search-tree/","Ch. 14"],["/patterns/bits-mathematics-and-small-state-spaces/","Ch. 21"],["/practice/#subsets","Solution"]]],[79,"Word Search","word-search",0,[41,6,155,8,96],[["/patterns/backtracking-and-the-search-tree/","Ch. 14"],["/practice/#word-search","Solution"]]],[80,"Remove Duplicates from Sorted Array II","remove-duplicates-from-sorted-array-ii",0,[6,172],[["/practice/#remove-duplicates-from-sorted-array-ii","Solution"]]],[81,"Search in Rotated Sorted Array II","search-in-rotated-sorted-array-ii",0,[6,14],[["/practice/#search-in-rotated-sorted-array-ii","Solution"]]],[82,"Remove Duplicates from Sorted List II","remove-duplicates-from-sorted-list-ii",0,[88,172],[["/practice/#remove-duplicates-from-sorted-list-ii","Solution"]]],[83,"Remove Duplicates from Sorted List","remove-duplicates-from-sorted-list",0,[88],[["/practice/#remove-duplicates-from-sorted-list","Solution"]]],[84,"Largest Rectangle in Histogram","largest-rectangle-in-histogram",0,[154,6,108,133],[["/patterns/stacks-and-monotonic-deques/","Ch. 10"],["/practice/#largest-rectangle-in-histogram","Solution"]]],[85,"Maximal Rectangle","maximal-rectangle",0,[154,6,48,96,108],[["/practice/#maximal-rectangle","Solution"]]],[86,"Partition List","partition-list",0,[88,172],[["/practice/#partition-list","Solution"]]],[87,"Scramble String","scramble-string",0,[155,48],[["/practice/#scramble-string","Solution"]]],[88,"Merge Sorted Array","merge-sorted-array",0,[6,172,150],[["/practice/#merge-sorted-array","Solution"]]],[89,"Gray Code","gray-code",0,[18,95,8],[["/practice/#gray-code","Solution"]]],[90,"Subsets II","subsets-ii",0,[18,6,8],[["/practice/#subsets-ii","Solution"]]],[91,"Decode Ways","decode-ways",0,[155,48],[["/practice/#decode-ways","Solution"]]],[92,"Reverse Linked List II","reverse-linked-list-ii",0,[88],[["/practice/#reverse-linked-list-ii","Solution"]]],[93,"Restore IP Addresses","restore-ip-addresses",0,[155,8],[["/practice/#restore-ip-addresses","Solution"]]],[94,"Binary Tree Inorder Traversal","binary-tree-inorder-traversal",0,[154,168,41,16],[["/practice/#binary-tree-inorder-traversal","Solution"]]],[95,"Unique Binary Search Trees II","unique-binary-search-trees-ii",0,[168,15,48,8,16],[["/practice/#unique-binary-search-trees-ii","Solution"]]],[96,"Unique Binary Search Trees","unique-binary-search-trees",0,[168,15,95,48,16],[["/practice/#unique-binary-search-trees","Solution"]]],[97,"Interleaving String","interleaving-string",0,[155,48],[["/practice/#interleaving-string","Solution"]]],[98,"Validate Binary Search Tree","validate-binary-search-tree",0,[168,41,15,16],[["/patterns/linked-lists-and-recursive-trees/","Ch. 13"],["/worked/validate-binary-search-tree/","Worked lesson"],["/practice/#validate-binary-search-tree","Solution"]]],[99,"Recover Binary Search Tree","recover-binary-search-tree",0,[168,41,15,16],[["/practice/#recover-binary-search-tree","Solution"]]],[100,"Same Tree","same-tree",0,[168,41,25,16],[["/practice/#same-tree","Solution"]]],[101,"Symmetric Tree","symmetric-tree",0,[168,41,25,16],[["/practice/#symmetric-tree","Solution"]]],[102,"Binary Tree Level Order Traversal","binary-tree-level-order-traversal",0,[168,25,16],[["/practice/#binary-tree-level-order-traversal","Solution"]]],[103,"Binary Tree Zigzag Level Order Traversal","binary-tree-zigzag-level-order-traversal",0,[168,25,16],[["/practice/#binary-tree-zigzag-level-order-traversal","Solution"]]],[104,"Maximum Depth of Binary Tree","maximum-depth-of-binary-tree",0,[168,41,25,16],[["/patterns/linked-lists-and-recursive-trees/","Ch. 13"],["/worked/maximum-depth-of-binary-tree/","Worked lesson"],["/practice/#maximum-depth-of-binary-tree","Solution"]]],[105,"Construct Binary Tree from Preorder and Inorder Traversal","construct-binary-tree-from-preorder-and-inorder-traversal",0,[168,6,71,46,16],[["/practice/#construct-binary-tree-from-preorder-and-inorder-traversal","Solution"]]],[106,"Construct Binary Tree from Inorder and Postorder Traversal","construct-binary-tree-from-inorder-and-postorder-traversal",0,[168,6,71,46,16],[["/practice/#construct-binary-tree-from-inorder-and-postorder-traversal","Solution"]]],[107,"Binary Tree Level Order Traversal II","binary-tree-level-order-traversal-ii",0,[168,25,16],[["/practice/#binary-tree-level-order-traversal-ii","Solution"]]],[108,"Convert Sorted Array to Binary Search Tree","convert-sorted-array-to-binary-search-tree",0,[168,15,6,46,16],[["/practice/#convert-sorted-array-to-binary-search-tree","Solution"]]],[109,"Convert Sorted List to Binary Search Tree","convert-sorted-list-to-binary-search-tree",0,[168,15,88,46,16],[["/practice/#convert-sorted-list-to-binary-search-tree","Solution"]]],[110,"Balanced Binary Tree","balanced-binary-tree",0,[168,41,16],[["/patterns/linked-lists-and-recursive-trees/","Ch. 13"],["/worked/balanced-binary-tree/","Worked lesson"],["/practice/#balanced-binary-tree","Solution"]]],[111,"Minimum Depth of Binary Tree","minimum-depth-of-binary-tree",0,[168,41,25,16],[["/practice/#minimum-depth-of-binary-tree","Solution"]]],[112,"Path Sum","path-sum",0,[168,41,25,16],[["/practice/#path-sum","Solution"]]],[113,"Path Sum II","path-sum-ii",0,[168,41,8,16],[["/practice/#path-sum-ii","Solution"]]],[114,"Flatten Binary Tree to Linked List","flatten-binary-tree-to-linked-list",0,[154,168,41,88,16],[["/practice/#flatten-binary-tree-to-linked-list","Solution"]]],[115,"Distinct Subsequences","distinct-subsequences",0,[155,48],[["/practice/#distinct-subsequences","Solution"]]],[116,"Populating Next Right Pointers in Each Node","populating-next-right-pointers-in-each-node",0,[168,41,25,88,16],[["/practice/#populating-next-right-pointers-in-each-node","Solution"]]],[117,"Populating Next Right Pointers in Each Node II","populating-next-right-pointers-in-each-node-ii",0,[168,41,25,88,16],[["/practice/#populating-next-right-pointers-in-each-node-ii","Solution"]]],[118,"Pascal's Triangle","pascals-triangle",0,[6,48],[["/practice/#pascals-triangle","Solution"]]],[119,"Pascal's Triangle II","pascals-triangle-ii",0,[6,48],[["/practice/#pascals-triangle-ii","Solution"]]],[120,"Triangle","triangle",0,[6,48],[["/practice/#triangle","Solution"]]],[121,"Best Time to Buy and Sell Stock","best-time-to-buy-and-sell-stock",0,[6,48],[["/practice/#best-time-to-buy-and-sell-stock","Solution"]]],[122,"Best Time to Buy and Sell Stock II","best-time-to-buy-and-sell-stock-ii",0,[68,6,48],[["/practice/#best-time-to-buy-and-sell-stock-ii","Solution"]]],[123,"Best Time to Buy and Sell Stock III","best-time-to-buy-and-sell-stock-iii",0,[6,48],[["/practice/#best-time-to-buy-and-sell-stock-iii","Solution"]]],[124,"Binary Tree Maximum Path Sum","binary-tree-maximum-path-sum",0,[168,41,48,16,169],[["/practice/#binary-tree-maximum-path-sum","Solution"]]],[125,"Valid Palindrome","valid-palindrome",0,[172,155],[["/practice/#valid-palindrome","Solution"]]],[126,"Word Ladder II","word-ladder-ii",0,[25,71,155,8,11],[["/practice/#word-ladder-ii","Solution"]]],[127,"Word Ladder","word-ladder",0,[25,71,155,11],[["/patterns/graph-modeling-and-traversal/","Ch. 15"],["/practice/#word-ladder","Solution"]]],[128,"Longest Consecutive Sequence","longest-consecutive-sequence",0,[174,6,71],[["/patterns/hashing-and-sufficient-summaries/","Ch. 05"],["/practice/#longest-consecutive-sequence","Solution"]]],[129,"Sum Root to Leaf Numbers","sum-root-to-leaf-numbers",0,[168,41,16],[["/practice/#sum-root-to-leaf-numbers","Solution"]]],[130,"Surrounded Regions","surrounded-regions",0,[41,25,174,6,96],[["/practice/#surrounded-regions","Solution"]]],[131,"Palindrome Partitioning","palindrome-partitioning",0,[155,48,8],[["/patterns/tries-and-string-structure/","Ch. 20"],["/practice/#palindrome-partitioning","Solution"]]],[132,"Palindrome Partitioning II","palindrome-partitioning-ii",0,[155,48],[["/practice/#palindrome-partitioning-ii","Solution"]]],[133,"Clone Graph","clone-graph",0,[41,25,64,71],[["/patterns/graph-modeling-and-traversal/","Ch. 15"],["/practice/#clone-graph","Solution"]]],[134,"Gas Station","gas-station",0,[68,6],[["/practice/#gas-station","Solution"]]],[135,"Candy","candy",0,[68,6],[["/practice/#candy","Solution"]]],[136,"Single Number","single-number",0,[18,6],[["/patterns/bits-mathematics-and-small-state-spaces/","Ch. 21"],["/practice/#single-number","Solution"]]],[137,"Single Number II","single-number-ii",0,[18,6],[["/practice/#single-number-ii","Solution"]]],[138,"Copy List with Random Pointer","copy-list-with-random-pointer",0,[71,88],[["/practice/#copy-list-with-random-pointer","Solution"]]],[139,"Word Break","word-break",0,[171,100,6,71,155,48,27],[["/patterns/dynamic-programming-from-sufficient-state/","Ch. 18"],["/practice/#word-break","Solution"]]],[140,"Word Break II","word-break-ii",0,[171,100,6,71,155,48,8],[["/practice/#word-break-ii","Solution"]]],[141,"Linked List Cycle","linked-list-cycle",0,[71,88,172,60],[["/patterns/two-pointers-and-safe-elimination/","Ch. 07"],["/worked/linked-list-cycle/","Worked lesson"],["/practice/#linked-list-cycle","Solution"]]],[142,"Linked List Cycle II","linked-list-cycle-ii",0,[71,88,172,60],[["/patterns/two-pointers-and-safe-elimination/","Ch. 07"],["/practice/#linked-list-cycle-ii","Solution"]]],[143,"Reorder List","reorder-list",0,[154,134,88,172],[["/practice/#reorder-list","Solution"]]],[144,"Binary Tree Preorder Traversal","binary-tree-preorder-traversal",0,[154,168,41,16],[["/practice/#binary-tree-preorder-traversal","Solution"]]],[145,"Binary Tree Postorder Traversal","binary-tree-postorder-traversal",0,[154,168,41,16],[["/practice/#binary-tree-postorder-traversal","Solution"]]],[146,"LRU Cache","lru-cache",0,[42,71,88,47],[["/patterns/data-structure-design-and-composed-invariants/","Ch. 23"],["/practice/#lru-cache","Solution"]]],[147,"Insertion Sort List","insertion-sort-list",0,[88,150],[["/practice/#insertion-sort-list","Solution"]]],[148,"Sort List","sort-list",0,[88,172,46,150,101],[["/practice/#sort-list","Solution"]]],[149,"Max Points on a Line","max-points-on-a-line",0,[63,6,71,95,67,51],[["/practice/#max-points-on-a-line","Solution"]]],[150,"Evaluate Reverse Polish Notation","evaluate-reverse-polish-notation",0,[154,6,95],[["/practice/#evaluate-reverse-polish-notation","Solution"]]],[151,"Reverse Words in a String","reverse-words-in-a-string",0,[172,155],[["/practice/#reverse-words-in-a-string","Solution"]]],[152,"Maximum Product Subarray","maximum-product-subarray",0,[6,48],[["/practice/#maximum-product-subarray","Solution"]]],[153,"Find Minimum in Rotated Sorted Array","find-minimum-in-rotated-sorted-array",0,[6,14],[["/practice/#find-minimum-in-rotated-sorted-array","Solution"]]],[154,"Find Minimum in Rotated Sorted Array II","find-minimum-in-rotated-sorted-array-ii",0,[6,14],[["/practice/#find-minimum-in-rotated-sorted-array-ii","Solution"]]],[155,"Min Stack","min-stack",0,[154,42],[["/patterns/stacks-and-monotonic-deques/","Ch. 10"],["/patterns/data-structure-design-and-composed-invariants/","Ch. 23"],["/practice/#min-stack","Solution"]]],[156,"Binary Tree Upside Down","binary-tree-upside-down",0,[168,41,16],[["/practice/#binary-tree-upside-down","Solution"]]],[157,"Read N Characters Given Read4","read-n-characters-given-read4",0,[6,77,145],[["/practice/#read-n-characters-given-read4","Solution"]]],[158,"Read N Characters Given read4 II - Call Multiple Times","read-n-characters-given-read4-ii-call-multiple-times",0,[6,77,145],[["/practice/#read-n-characters-given-read4-ii-call-multiple-times","Solution"]]],[159,"Longest Substring with At Most Two Distinct Characters","longest-substring-with-at-most-two-distinct-characters",0,[71,155,146],[["/practice/#longest-substring-with-at-most-two-distinct-characters","Solution"]]],[160,"Intersection of Two Linked Lists","intersection-of-two-linked-lists",0,[71,88,172],[["/practice/#intersection-of-two-linked-lists","Solution"]]],[161,"One Edit Distance","one-edit-distance",0,[172,155],[["/practice/#one-edit-distance","Solution"]]],[162,"Find Peak Element","find-peak-element",0,[6,14],[["/practice/#find-peak-element","Solution"]]],[163,"Missing Ranges","missing-ranges",0,[6],[["/practice/#missing-ranges","Solution"]]],[164,"Maximum Gap","maximum-gap",0,[6,29,131,150,119],[["/practice/#maximum-gap","Solution"]]],[165,"Compare Version Numbers","compare-version-numbers",0,[172,155],[["/practice/#compare-version-numbers","Solution"]]],[166,"Fraction to Recurring Decimal","fraction-to-recurring-decimal",0,[71,95,155],[["/practice/#fraction-to-recurring-decimal","Solution"]]],[167,"Two Sum II - Input Array Is Sorted","two-sum-ii-input-array-is-sorted",0,[6,172,14],[["/patterns/two-pointers-and-safe-elimination/","Ch. 07"],["/worked/two-sum-ii/","Worked lesson"],["/practice/#two-sum-ii-input-array-is-sorted","Solution"]]],[168,"Excel Sheet Column Title","excel-sheet-column-title",0,[95,155],[["/practice/#excel-sheet-column-title","Solution"]]],[169,"Majority Element","majority-element",0,[6,71,46,36,150,22],[["/practice/#majority-element","Solution"]]],[170,"Two Sum III - Data structure design","two-sum-iii-data-structure-design",0,[42,6,71,172,39],[["/practice/#two-sum-iii-data-structure-design","Solution"]]],[171,"Excel Sheet Column Number","excel-sheet-column-number",0,[95,155],[["/practice/#excel-sheet-column-number","Solution"]]],[172,"Factorial Trailing Zeroes","factorial-trailing-zeroes",0,[95],[["/practice/#factorial-trailing-zeroes","Solution"]]],[173,"Binary Search Tree Iterator","binary-search-tree-iterator",0,[154,168,42,15,16,78],[["/practice/#binary-search-tree-iterator","Solution"]]],[174,"Dungeon Game","dungeon-game",0,[6,48,96],[["/practice/#dungeon-game","Solution"]]],[175,"Combine Two Tables","combine-two-tables",1,[40],[["/practice/#combine-two-tables","Solution"]]],[176,"Second Highest Salary","second-highest-salary",1,[40],[["/practice/#second-highest-salary","Solution"]]],[177,"Nth Highest Salary","nth-highest-salary",1,[40],[["/practice/#nth-highest-salary","Solution"]]],[178,"Rank Scores","rank-scores",1,[40],[["/practice/#rank-scores","Solution"]]],[179,"Largest Number","largest-number",0,[68,6,155,150],[["/practice/#largest-number","Solution"]]],[180,"Consecutive Numbers","consecutive-numbers",1,[40],[["/practice/#consecutive-numbers","Solution"]]],[181,"Employees Earning More Than Their Managers","employees-earning-more-than-their-managers",1,[40],[["/practice/#employees-earning-more-than-their-managers","Solution"]]],[182,"Duplicate Emails","duplicate-emails",1,[40],[["/practice/#duplicate-emails","Solution"]]],[183,"Customers Who Never Order","customers-who-never-order",1,[40],[["/practice/#customers-who-never-order","Solution"]]],[184,"Department Highest Salary","department-highest-salary",1,[40],[["/practice/#department-highest-salary","Solution"]]],[185,"Department Top Three Salaries","department-top-three-salaries",1,[40],[["/practice/#department-top-three-salaries","Solution"]]],[186,"Reverse Words in a String II","reverse-words-in-a-string-ii",0,[172,155],[["/practice/#reverse-words-in-a-string-ii","Solution"]]],[187,"Repeated DNA Sequences","repeated-dna-sequences",0,[18,71,155,146,70,137,23,58],[["/practice/#repeated-dna-sequences","Solution"]]],[188,"Best Time to Buy and Sell Stock IV","best-time-to-buy-and-sell-stock-iv",0,[6,48],[["/practice/#best-time-to-buy-and-sell-stock-iv","Solution"]]],[189,"Rotate Array","rotate-array",0,[6,95,172],[["/practice/#rotate-array","Solution"]]],[190,"Reverse Bits","reverse-bits",0,[18,46],[["/practice/#reverse-bits","Solution"]]],[191,"Number of 1 Bits","number-of-1-bits",0,[18,46],[["/patterns/bits-mathematics-and-small-state-spaces/","Ch. 21"],["/practice/#number-of-1-bits","Solution"]]],[192,"Word Frequency","word-frequency",0,[141],[["/practice/#word-frequency","Solution"]]],[193,"Valid Phone Numbers","valid-phone-numbers",0,[141],[["/practice/#valid-phone-numbers","Solution"]]],[194,"Transpose File","transpose-file",0,[141],[["/practice/#transpose-file","Solution"]]],[195,"Tenth Line","tenth-line",0,[141],[["/practice/#tenth-line","Solution"]]],[196,"Delete Duplicate Emails","delete-duplicate-emails",1,[40],[["/practice/#delete-duplicate-emails","Solution"]]],[197,"Rising Temperature","rising-temperature",1,[40],[["/practice/#rising-temperature","Solution"]]],[198,"House Robber","house-robber",0,[6,48],[["/patterns/dynamic-programming-from-sufficient-state/","Ch. 18"],["/worked/house-robber/","Worked lesson"],["/practice/#house-robber","Solution"]]],[199,"Binary Tree Right Side View","binary-tree-right-side-view",0,[168,41,25,16],[["/practice/#binary-tree-right-side-view","Solution"]]],[200,"Number of Islands","number-of-islands",0,[41,25,174,6,96],[["/patterns/graph-modeling-and-traversal/","Ch. 15"],["/worked/number-of-islands/","Worked lesson"],["/practice/#number-of-islands","Solution"]]],[201,"Bitwise AND of Numbers Range","bitwise-and-of-numbers-range",0,[18],[["/patterns/bits-mathematics-and-small-state-spaces/","Ch. 21"],["/practice/#bitwise-and-of-numbers-range","Solution"]]],[202,"Happy Number","happy-number",0,[71,95,172,60],[["/practice/#happy-number","Solution"]]],[203,"Remove Linked List Elements","remove-linked-list-elements",0,[134,88],[["/practice/#remove-linked-list-elements","Solution"]]],[204,"Count Primes","count-primes",0,[6,95,50,112,124,143,144],[["/practice/#count-primes","Solution"]]],[205,"Isomorphic Strings","isomorphic-strings",0,[71,155],[["/practice/#isomorphic-strings","Solution"]]],[206,"Reverse Linked List","reverse-linked-list",0,[134,88],[["/patterns/linked-lists-and-recursive-trees/","Ch. 13"],["/worked/reverse-linked-list/","Worked lesson"],["/practice/#reverse-linked-list","Solution"]]],[207,"Course Schedule","course-schedule",0,[41,25,64,165,45],[["/patterns/dependencies-and-merging-components/","Ch. 16"],["/worked/course-schedule/","Worked lesson"],["/practice/#course-schedule","Solution"]]],[208,"Implement Trie (Prefix Tree)","implement-trie-prefix-tree",0,[42,171,71,155],[["/patterns/tries-and-string-structure/","Ch. 20"],["/practice/#implement-trie-prefix-tree","Solution"]]],[209,"Minimum Size Subarray Sum","minimum-size-subarray-sum",0,[6,14,122,146],[["/patterns/sliding-windows-and-monotone-validity/","Ch. 08"],["/worked/shortest-subarray-reaching-a-sum/","Worked lesson"],["/practice/#minimum-size-subarray-sum","Solution"]]],[210,"Course Schedule II","course-schedule-ii",0,[41,25,64,165],[["/patterns/dependencies-and-merging-components/","Ch. 16"],["/practice/#course-schedule-ii","Solution"]]],[211,"Design Add and Search Words Data Structure","design-add-and-search-words-data-structure",0,[41,42,171,155],[["/patterns/tries-and-string-structure/","Ch. 20"],["/practice/#design-add-and-search-words-data-structure","Solution"]]],[212,"Word Search II","word-search-ii",0,[171,6,155,8,96],[["/patterns/tries-and-string-structure/","Ch. 20"],["/practice/#word-search-ii","Solution"]]],[213,"House Robber II","house-robber-ii",0,[6,48],[["/practice/#house-robber-ii","Solution"]]],[214,"Shortest Palindrome","shortest-palindrome",0,[155,156,94,70,137,81,58],[["/practice/#shortest-palindrome","Solution"]]],[215,"Kth Largest Element in an Array","kth-largest-element-in-an-array",0,[6,46,130,150,72],[["/patterns/heaps-and-the-candidate-frontier/","Ch. 11"],["/worked/kth-largest-element/","Worked lesson"],["/practice/#kth-largest-element-in-an-array","Solution"]]],[216,"Combination Sum III","combination-sum-iii",0,[6,8],[["/practice/#combination-sum-iii","Solution"]]],[217,"Contains Duplicate","contains-duplicate",0,[6,71,150],[["/practice/#contains-duplicate","Solution"]]],[218,"The Skyline Problem","the-skyline-problem",0,[12,139,6,46,113,150,161,72],[["/patterns/range-queries-under-updates/","Ch. 22"],["/practice/#the-skyline-problem","Solution"]]],[219,"Contains Duplicate II","contains-duplicate-ii",0,[6,71,146],[["/practice/#contains-duplicate-ii","Solution"]]],[220,"Contains Duplicate III","contains-duplicate-iii",0,[6,29,113,150,146],[["/practice/#contains-duplicate-iii","Solution"]]],[221,"Maximal Square","maximal-square",0,[6,48,96],[["/practice/#maximal-square","Solution"]]],[222,"Count Complete Tree Nodes","count-complete-tree-nodes",0,[18,168,14,16],[["/practice/#count-complete-tree-nodes","Solution"]]],[223,"Rectangle Area","rectangle-area",0,[63,95],[["/practice/#rectangle-area","Solution"]]],[224,"Basic Calculator","basic-calculator",0,[154,134,95,155],[["/practice/#basic-calculator","Solution"]]],[225,"Implement Stack using Queues","implement-stack-using-queues",0,[154,42,128],[["/practice/#implement-stack-using-queues","Solution"]]],[226,"Invert Binary Tree","invert-binary-tree",0,[168,41,25,16],[["/practice/#invert-binary-tree","Solution"]]],[227,"Basic Calculator II","basic-calculator-ii",0,[154,95,155],[["/practice/#basic-calculator-ii","Solution"]]],[228,"Summary Ranges","summary-ranges",0,[6],[["/practice/#summary-ranges","Solution"]]],[229,"Majority Element II","majority-element-ii",0,[6,71,36,150,22],[["/practice/#majority-element-ii","Solution"]]],[230,"Kth Smallest Element in a BST","kth-smallest-element-in-a-bst",0,[168,41,15,16],[["/practice/#kth-smallest-element-in-a-bst","Solution"]]],[231,"Power of Two","power-of-two",0,[18,134,95],[["/practice/#power-of-two","Solution"]]],[232,"Implement Queue using Stacks","implement-queue-using-stacks",0,[154,42,128],[["/patterns/data-structure-design-and-composed-invariants/","Ch. 23"],["/practice/#implement-queue-using-stacks","Solution"]]],[233,"Number of Digit One","number-of-digit-one",0,[134,95,48],[["/practice/#number-of-digit-one","Solution"]]],[234,"Palindrome Linked List","palindrome-linked-list",0,[154,134,88,172],[["/practice/#palindrome-linked-list","Solution"]]],[235,"Lowest Common Ancestor of a Binary Search Tree","lowest-common-ancestor-of-a-binary-search-tree",0,[168,41,15,16,91,13],[["/practice/#lowest-common-ancestor-of-a-binary-search-tree","Solution"]]],[236,"Lowest Common Ancestor of a Binary Tree","lowest-common-ancestor-of-a-binary-tree",0,[168,41,16,91,13],[["/patterns/linked-lists-and-recursive-trees/","Ch. 13"],["/practice/#lowest-common-ancestor-of-a-binary-tree","Solution"]]],[237,"Delete Node in a Linked List","delete-node-in-a-linked-list",0,[88],[["/practice/#delete-node-in-a-linked-list","Solution"]]],[238,"Product of Array Except Self","product-of-array-except-self",0,[6,122],[["/patterns/prefix-sums-and-algebraic-transformations/","Ch. 06"],["/practice/#product-of-array-except-self","Solution"]]],[239,"Sliding Window Maximum","sliding-window-maximum",0,[128,6,146,107,72,133],[["/patterns/stacks-and-monotonic-deques/","Ch. 10"],["/worked/sliding-window-maximum/","Worked lesson"],["/practice/#sliding-window-maximum","Solution"]]],[240,"Search a 2D Matrix II","search-a-2d-matrix-ii",0,[6,14,46,96],[["/practice/#search-a-2d-matrix-ii","Solution"]]],[241,"Different Ways to Add Parentheses","different-ways-to-add-parentheses",0,[134,100,95,155,48,116],[["/practice/#different-ways-to-add-parentheses","Solution"]]],[242,"Valid Anagram","valid-anagram",0,[71,155,150],[["/patterns/hashing-and-sufficient-summaries/","Ch. 05"],["/worked/valid-anagram/","Worked lesson"],["/practice/#valid-anagram","Solution"]]],[243,"Shortest Word Distance","shortest-word-distance",0,[6,155],[["/practice/#shortest-word-distance","Solution"]]],[244,"Shortest Word Distance II","shortest-word-distance-ii",0,[42,6,71,172,155],[["/practice/#shortest-word-distance-ii","Solution"]]],[245,"Shortest Word Distance III","shortest-word-distance-iii",0,[6,155],[["/practice/#shortest-word-distance-iii","Solution"]]],[246,"Strobogrammatic Number","strobogrammatic-number",0,[71,172,155],[["/practice/#strobogrammatic-number","Solution"]]],[247,"Strobogrammatic Number II","strobogrammatic-number-ii",0,[134,6,155],[["/practice/#strobogrammatic-number-ii","Solution"]]],[248,"Strobogrammatic Number III","strobogrammatic-number-iii",0,[134,6,155],[["/practice/#strobogrammatic-number-iii","Solution"]]],[249,"Group Shifted Strings","group-shifted-strings",0,[6,71,155],[["/practice/#group-shifted-strings","Solution"]]],[250,"Count Univalue Subtrees","count-univalue-subtrees",0,[168,41,16,169],[["/practice/#count-univalue-subtrees","Solution"]]],[251,"Flatten 2D Vector","flatten-2d-vector",0,[42,6,172,78],[["/practice/#flatten-2d-vector","Solution"]]],[252,"Meeting Rooms","meeting-rooms",0,[6,150,129],[["/practice/#meeting-rooms","Solution"]]],[253,"Meeting Rooms II","meeting-rooms-ii",0,[68,6,172,122,150,72],[["/practice/#meeting-rooms-ii","Solution"]]],[254,"Factor Combinations","factor-combinations",0,[8,125],[["/practice/#factor-combinations","Solution"]]],[255,"Verify Preorder Sequence in Binary Search Tree","verify-preorder-sequence-in-binary-search-tree",0,[154,168,15,134,6,16,108],[["/practice/#verify-preorder-sequence-in-binary-search-tree","Solution"]]],[256,"Paint House","paint-house",0,[6,48],[["/practice/#paint-house","Solution"]]],[257,"Binary Tree Paths","binary-tree-paths",0,[168,41,155,8,16],[["/practice/#binary-tree-paths","Solution"]]],[258,"Add Digits","add-digits",0,[95,112,145],[["/practice/#add-digits","Solution"]]],[259,"3Sum Smaller","3sum-smaller",0,[6,172,14,150],[["/practice/#3sum-smaller","Solution"]]],[260,"Single Number III","single-number-iii",0,[18,6],[["/practice/#single-number-iii","Solution"]]],[261,"Graph Valid Tree","graph-valid-tree",0,[41,25,174,64],[["/practice/#graph-valid-tree","Solution"]]],[262,"Trips and Users","trips-and-users",1,[40],[["/practice/#trips-and-users","Solution"]]],[263,"Ugly Number","ugly-number",0,[95],[["/practice/#ugly-number","Solution"]]],[264,"Ugly Number II","ugly-number-ii",0,[71,95,48,72],[["/practice/#ugly-number-ii","Solution"]]],[265,"Paint House II","paint-house-ii",0,[6,48],[["/practice/#paint-house-ii","Solution"]]],[266,"Palindrome Permutation","palindrome-permutation",0,[18,71,155],[["/practice/#palindrome-permutation","Solution"]]],[267,"Palindrome Permutation II","palindrome-permutation-ii",0,[71,155,8],[["/practice/#palindrome-permutation-ii","Solution"]]],[268,"Missing Number","missing-number",0,[18,6,71,95,14,150],[["/practice/#missing-number","Solution"]]],[269,"Alien Dictionary","alien-dictionary",0,[41,25,64,165,6,155,45],[["/practice/#alien-dictionary","Solution"]]],[270,"Closest Binary Search Tree Value","closest-binary-search-tree-value",0,[168,41,15,14,16],[["/practice/#closest-binary-search-tree-value","Solution"]]],[271,"Encode and Decode Strings","encode-and-decode-strings",0,[42,6,155],[["/practice/#encode-and-decode-strings","Solution"]]],[272,"Closest Binary Search Tree Value II","closest-binary-search-tree-value-ii",0,[154,168,41,15,172,16,72],[["/practice/#closest-binary-search-tree-value-ii","Solution"]]],[273,"Integer to English Words","integer-to-english-words",0,[134,95,155],[["/practice/#integer-to-english-words","Solution"]]],[274,"H-Index","h-index",0,[6,37,150],[["/practice/#h-index","Solution"]]],[275,"H-Index II","h-index-ii",0,[6,14],[["/practice/#h-index-ii","Solution"]]],[276,"Paint Fence","paint-fence",0,[48],[["/practice/#paint-fence","Solution"]]],[277,"Find the Celebrity","find-the-celebrity",0,[64,172,77],[["/practice/#find-the-celebrity","Solution"]]],[278,"First Bad Version","first-bad-version",0,[14,77],[["/practice/#first-bad-version","Solution"]]],[279,"Perfect Squares","perfect-squares",0,[25,95,48,82,173],[["/practice/#perfect-squares","Solution"]]],[280,"Wiggle Sort","wiggle-sort",0,[68,6,150],[["/practice/#wiggle-sort","Solution"]]],[281,"Zigzag Iterator","zigzag-iterator",0,[42,128,6,78],[["/practice/#zigzag-iterator","Solution"]]],[282,"Expression Add Operators","expression-add-operators",0,[95,155,8],[["/practice/#expression-add-operators","Solution"]]],[283,"Move Zeroes","move-zeroes",0,[6,172],[["/worked/move-zeroes/","Worked lesson"],["/practice/#move-zeroes","Solution"]]],[284,"Peeking Iterator","peeking-iterator",0,[42,6,78],[["/practice/#peeking-iterator","Solution"]]],[285,"Inorder Successor in BST","inorder-successor-in-bst",0,[168,41,15,16],[["/practice/#inorder-successor-in-bst","Solution"]]],[286,"Walls and Gates","walls-and-gates",0,[25,6,96],[["/practice/#walls-and-gates","Solution"]]],[287,"Find the Duplicate Number","find-the-duplicate-number",0,[18,6,172,14,60,119],[["/practice/#find-the-duplicate-number","Solution"]]],[288,"Unique Word Abbreviation","unique-word-abbreviation",0,[42,6,71,155],[["/practice/#unique-word-abbreviation","Solution"]]],[289,"Game of Life","game-of-life",0,[6,96,145],[["/practice/#game-of-life","Solution"]]],[290,"Word Pattern","word-pattern",0,[71,155],[["/practice/#word-pattern","Solution"]]],[291,"Word Pattern II","word-pattern-ii",0,[71,155,8],[["/practice/#word-pattern-ii","Solution"]]],[292,"Nim Game","nim-game",0,[24,104,95,62,111,75],[["/practice/#nim-game","Solution"]]],[293,"Flip Game","flip-game",0,[155],[["/practice/#flip-game","Solution"]]],[294,"Flip Game II","flip-game-ii",0,[100,104,95,48,8,62,0,75],[["/practice/#flip-game-ii","Solution"]]],[295,"Find Median from Data Stream","find-median-from-data-stream",0,[42,172,39,150,72],[["/patterns/heaps-and-the-candidate-frontier/","Ch. 11"],["/practice/#find-median-from-data-stream","Solution"]]],[296,"Best Meeting Point","best-meeting-point",0,[6,95,96,150],[["/practice/#best-meeting-point","Solution"]]],[297,"Serialize and Deserialize Binary Tree","serialize-and-deserialize-binary-tree",0,[168,41,25,42,155,16],[["/practice/#serialize-and-deserialize-binary-tree","Solution"]]],[298,"Binary Tree Longest Consecutive Sequence","binary-tree-longest-consecutive-sequence",0,[168,41,16,169],[["/practice/#binary-tree-longest-consecutive-sequence","Solution"]]],[299,"Bulls and Cows","bulls-and-cows",0,[71,155,36],[["/practice/#bulls-and-cows","Solution"]]],[300,"Longest Increasing Subsequence","longest-increasing-subsequence",0,[6,14,48,90],[["/patterns/dynamic-programming-families/","Ch. 19"],["/practice/#longest-increasing-subsequence","Solution"]]],[301,"Remove Invalid Parentheses","remove-invalid-parentheses",0,[25,155,8],[["/practice/#remove-invalid-parentheses","Solution"]]],[302,"Smallest Rectangle Enclosing Black Pixels","smallest-rectangle-enclosing-black-pixels",0,[41,25,6,14,96],[["/practice/#smallest-rectangle-enclosing-black-pixels","Solution"]]],[303,"Range Sum Query - Immutable","range-sum-query-immutable",0,[42,6,122],[["/patterns/prefix-sums-and-algebraic-transformations/","Ch. 06"],["/practice/#range-sum-query-immutable","Solution"]]],[304,"Range Sum Query 2D - Immutable","range-sum-query-2d-immutable",0,[42,6,96,122],[["/practice/#range-sum-query-2d-immutable","Solution"]]],[305,"Number of Islands II","number-of-islands-ii",0,[174,6,71],[["/practice/#number-of-islands-ii","Solution"]]],[306,"Additive Number","additive-number",0,[155,8],[["/practice/#additive-number","Solution"]]],[307,"Range Sum Query - Mutable","range-sum-query-mutable",0,[42,12,139,6,46,153],[["/patterns/range-queries-under-updates/","Ch. 22"],["/practice/#range-sum-query-mutable","Solution"]]],[308,"Range Sum Query 2D - Mutable","range-sum-query-2d-mutable",0,[42,12,139,6,96,153],[["/practice/#range-sum-query-2d-mutable","Solution"]]],[309,"Best Time to Buy and Sell Stock with Cooldown","best-time-to-buy-and-sell-stock-with-cooldown",0,[6,48],[["/practice/#best-time-to-buy-and-sell-stock-with-cooldown","Solution"]]],[310,"Minimum Height Trees","minimum-height-trees",0,[41,25,64,165],[["/practice/#minimum-height-trees","Solution"]]],[311,"Sparse Matrix Multiplication","sparse-matrix-multiplication",0,[6,71,87,96],[["/practice/#sparse-matrix-multiplication","Solution"]]],[312,"Burst Balloons","burst-balloons",0,[6,48],[["/patterns/reasoning-moves-that-unlock-problems/","Ch. 03"],["/patterns/dynamic-programming-families/","Ch. 19"],["/practice/#burst-balloons","Solution"]]],[313,"Super Ugly Number","super-ugly-number",0,[6,95,48],[["/practice/#super-ugly-number","Solution"]]],[314,"Binary Tree Vertical Order Traversal","binary-tree-vertical-order-traversal",0,[168,41,25,71,16,150],[["/practice/#binary-tree-vertical-order-traversal","Solution"]]],[315,"Count of Smaller Numbers After Self","count-of-smaller-numbers-after-self",0,[12,139,6,14,46,113,167,101],[["/patterns/range-queries-under-updates/","Ch. 22"],["/practice/#count-of-smaller-numbers-after-self","Solution"]]],[316,"Remove Duplicate Letters","remove-duplicate-letters",0,[154,68,155,108],[["/practice/#remove-duplicate-letters","Solution"]]],[317,"Shortest Distance from All Buildings","shortest-distance-from-all-buildings",0,[25,6,96],[["/practice/#shortest-distance-from-all-buildings","Solution"]]],[318,"Maximum Product of Word Lengths","maximum-product-of-word-lengths",0,[18,6,155],[["/practice/#maximum-product-of-word-lengths","Solution"]]],[319,"Bulb Switcher","bulb-switcher",0,[24,95],[["/practice/#bulb-switcher","Solution"]]],[320,"Generalized Abbreviation","generalized-abbreviation",0,[18,155,8],[["/practice/#generalized-abbreviation","Solution"]]],[321,"Create Maximum Number","create-maximum-number",0,[154,68,6,172,108],[["/practice/#create-maximum-number","Solution"]]],[322,"Coin Change","coin-change",0,[25,6,48,82,173],[["/patterns/dynamic-programming-from-sufficient-state/","Ch. 18"],["/practice/#coin-change","Solution"]]],[323,"Number of Connected Components in an Undirected Graph","number-of-connected-components-in-an-undirected-graph",0,[41,25,174,64],[["/practice/#number-of-connected-components-in-an-undirected-graph","Solution"]]],[324,"Wiggle Sort II","wiggle-sort-ii",0,[68,6,46,130,150],[["/practice/#wiggle-sort-ii","Solution"]]],[325,"Maximum Size Subarray Sum Equals k","maximum-size-subarray-sum-equals-k",0,[6,71,122],[["/practice/#maximum-size-subarray-sum-equals-k","Solution"]]],[326,"Power of Three","power-of-three",0,[134,95],[["/practice/#power-of-three","Solution"]]],[327,"Count of Range Sum","count-of-range-sum",0,[12,139,6,14,46,113,167,101],[["/patterns/range-queries-under-updates/","Ch. 22"],["/practice/#count-of-range-sum","Solution"]]],[328,"Odd Even Linked List","odd-even-linked-list",0,[88],[["/practice/#odd-even-linked-list","Solution"]]],[329,"Longest Increasing Path in a Matrix","longest-increasing-path-in-a-matrix",0,[41,25,64,165,100,6,48,45,96],[["/patterns/dependencies-and-merging-components/","Ch. 16"],["/practice/#longest-increasing-path-in-a-matrix","Solution"]]],[330,"Patching Array","patching-array",0,[68,6],[["/practice/#patching-array","Solution"]]],[331,"Verify Preorder Serialization of a Binary Tree","verify-preorder-serialization-of-a-binary-tree",0,[154,168,155,16],[["/practice/#verify-preorder-serialization-of-a-binary-tree","Solution"]]],[332,"Reconstruct Itinerary","reconstruct-itinerary",0,[41,64,6,155,150,56,54,72,140],[["/practice/#reconstruct-itinerary","Solution"]]],[333,"Largest BST Subtree","largest-bst-subtree",0,[168,41,15,48,16,169],[["/practice/#largest-bst-subtree","Solution"]]],[334,"Increasing Triplet Subsequence","increasing-triplet-subsequence",0,[68,6,90],[["/practice/#increasing-triplet-subsequence","Solution"]]],[335,"Self Crossing","self-crossing",0,[63,6,95],[["/practice/#self-crossing","Solution"]]],[336,"Palindrome Pairs","palindrome-pairs",0,[171,6,71,155,70],[["/practice/#palindrome-pairs","Solution"]]],[337,"House Robber III","house-robber-iii",0,[168,41,48,16,169],[["/patterns/dynamic-programming-families/","Ch. 19"],["/practice/#house-robber-iii","Solution"]]],[338,"Counting Bits","counting-bits",0,[18,48],[["/patterns/bits-mathematics-and-small-state-spaces/","Ch. 21"],["/practice/#counting-bits","Solution"]]],[339,"Nested List Weight Sum","nested-list-weight-sum",0,[41,25],[["/practice/#nested-list-weight-sum","Solution"]]],[340,"Longest Substring with At Most K Distinct Characters","longest-substring-with-at-most-k-distinct-characters",0,[71,155,146],[["/practice/#longest-substring-with-at-most-k-distinct-characters","Solution"]]],[341,"Flatten Nested List Iterator","flatten-nested-list-iterator",0,[154,168,41,42,128,78],[["/practice/#flatten-nested-list-iterator","Solution"]]],[342,"Power of Four","power-of-four",0,[18,134,95],[["/practice/#power-of-four","Solution"]]],[343,"Integer Break","integer-break",0,[95,48],[["/practice/#integer-break","Solution"]]],[344,"Reverse String","reverse-string",0,[172,155],[["/practice/#reverse-string","Solution"]]],[345,"Reverse Vowels of a String","reverse-vowels-of-a-string",0,[172,155],[["/practice/#reverse-vowels-of-a-string","Solution"]]],[346,"Moving Average from Data Stream","moving-average-from-data-stream",0,[42,128,6,39],[["/practice/#moving-average-from-data-stream","Solution"]]],[347,"Top K Frequent Elements","top-k-frequent-elements",0,[6,71,46,29,36,130,150,72],[["/patterns/heaps-and-the-candidate-frontier/","Ch. 11"],["/practice/#top-k-frequent-elements","Solution"]]],[348,"Design Tic-Tac-Toe","design-tic-tac-toe",0,[42,6,71,96,145],[["/practice/#design-tic-tac-toe","Solution"]]],[349,"Intersection of Two Arrays","intersection-of-two-arrays",0,[6,71,172,14,150],[["/practice/#intersection-of-two-arrays","Solution"]]],[350,"Intersection of Two Arrays II","intersection-of-two-arrays-ii",0,[6,71,172,14,150],[["/practice/#intersection-of-two-arrays-ii","Solution"]]],[351,"Android Unlock Patterns","android-unlock-patterns",0,[18,48,8,19],[["/practice/#android-unlock-patterns","Solution"]]],[352,"Data Stream as Disjoint Intervals","data-stream-as-disjoint-intervals",0,[174,42,71,14,39,113],[["/practice/#data-stream-as-disjoint-intervals","Solution"]]],[353,"Design Snake Game","design-snake-game",0,[42,128,6,71,145],[["/practice/#design-snake-game","Solution"]]],[354,"Russian Doll Envelopes","russian-doll-envelopes",0,[6,14,48,150,90],[["/practice/#russian-doll-envelopes","Solution"]]],[355,"Design Twitter","design-twitter",0,[42,71,88,72],[["/practice/#design-twitter","Solution"]]],[356,"Line Reflection","line-reflection",0,[6,71,95],[["/practice/#line-reflection","Solution"]]],[357,"Count Numbers with Unique Digits","count-numbers-with-unique-digits",0,[95,48,8],[["/practice/#count-numbers-with-unique-digits","Solution"]]],[358,"Rearrange String k Distance Apart","rearrange-string-k-distance-apart",0,[68,71,155,36,150,72],[["/practice/#rearrange-string-k-distance-apart","Solution"]]],[359,"Logger Rate Limiter","logger-rate-limiter",0,[42,71,39],[["/practice/#logger-rate-limiter","Solution"]]],[360,"Sort Transformed Array","sort-transformed-array",0,[6,95,172,150],[["/practice/#sort-transformed-array","Solution"]]],[361,"Bomb Enemy","bomb-enemy",0,[6,48,96],[["/practice/#bomb-enemy","Solution"]]],[362,"Design Hit Counter","design-hit-counter",0,[42,128,6,14,39],[["/practice/#design-hit-counter","Solution"]]],[363,"Max Sum of Rectangle No Larger Than K","max-sum-of-rectangle-no-larger-than-k",0,[6,14,96,113,122],[["/practice/#max-sum-of-rectangle-no-larger-than-k","Solution"]]],[364,"Nested List Weight Sum II","nested-list-weight-sum-ii",0,[154,41,25],[["/practice/#nested-list-weight-sum-ii","Solution"]]],[365,"Water and Jug Problem","water-and-jug-problem",0,[41,25,95,67,51,57,30],[["/practice/#water-and-jug-problem","Solution"]]],[366,"Find Leaves of Binary Tree","find-leaves-of-binary-tree",0,[168,41,16,169],[["/practice/#find-leaves-of-binary-tree","Solution"]]],[367,"Valid Perfect Square","valid-perfect-square",0,[95,14],[["/practice/#valid-perfect-square","Solution"]]],[368,"Largest Divisible Subset","largest-divisible-subset",0,[6,95,48,150],[["/practice/#largest-divisible-subset","Solution"]]],[369,"Plus One Linked List","plus-one-linked-list",0,[88,95],[["/practice/#plus-one-linked-list","Solution"]]],[370,"Range Addition","range-addition",0,[6,122],[["/practice/#range-addition","Solution"]]],[371,"Sum of Two Integers","sum-of-two-integers",0,[18,95],[["/practice/#sum-of-two-integers","Solution"]]],[372,"Super Pow","super-pow",0,[95,46,53,52],[["/practice/#super-pow","Solution"]]],[373,"Find K Pairs with Smallest Sums","find-k-pairs-with-smallest-sums",0,[6,72],[["/practice/#find-k-pairs-with-smallest-sums","Solution"]]],[374,"Guess Number Higher or Lower","guess-number-higher-or-lower",0,[14,77],[["/practice/#guess-number-higher-or-lower","Solution"]]],[375,"Guess Number Higher or Lower II","guess-number-higher-or-lower-ii",0,[104,95,48,62],[["/practice/#guess-number-higher-or-lower-ii","Solution"]]],[376,"Wiggle Subsequence","wiggle-subsequence",0,[68,6,48],[["/practice/#wiggle-subsequence","Solution"]]],[377,"Combination Sum IV","combination-sum-iv",0,[6,48],[["/practice/#combination-sum-iv","Solution"]]],[378,"Kth Smallest Element in a Sorted Matrix","kth-smallest-element-in-a-sorted-matrix",0,[6,14,96,150,72],[["/practice/#kth-smallest-element-in-a-sorted-matrix","Solution"]]],[379,"Design Phone Directory","design-phone-directory",0,[42,128,6,71,88],[["/practice/#design-phone-directory","Solution"]]],[380,"Insert Delete GetRandom O(1)","insert-delete-getrandom-o1",0,[42,6,71,95,132],[["/patterns/data-structure-design-and-composed-invariants/","Ch. 23"],["/practice/#insert-delete-getrandom-o1","Solution"]]],[381,"Insert Delete GetRandom O(1) - Duplicates allowed","insert-delete-getrandom-o1-duplicates-allowed",0,[42,6,71,95,132],[["/practice/#insert-delete-getrandom-o1-duplicates-allowed","Solution"]]],[382,"Linked List Random Node","linked-list-random-node",0,[136,88,95,132],[["/practice/#linked-list-random-node","Solution"]]],[383,"Ransom Note","ransom-note",0,[71,155,36],[["/practice/#ransom-note","Solution"]]],[384,"Shuffle an Array","shuffle-an-array",0,[42,6,95,132],[["/practice/#shuffle-an-array","Solution"]]],[385,"Mini Parser","mini-parser",0,[154,41,155],[["/practice/#mini-parser","Solution"]]],[386,"Lexicographical Numbers","lexicographical-numbers",0,[41,171],[["/practice/#lexicographical-numbers","Solution"]]],[387,"First Unique Character in a String","first-unique-character-in-a-string",0,[128,71,155,36],[["/practice/#first-unique-character-in-a-string","Solution"]]],[388,"Longest Absolute File Path","longest-absolute-file-path",0,[154,41,155],[["/practice/#longest-absolute-file-path","Solution"]]],[389,"Find the Difference","find-the-difference",0,[18,71,155,150],[["/practice/#find-the-difference","Solution"]]],[390,"Elimination Game","elimination-game",0,[134,95],[["/practice/#elimination-game","Solution"]]],[391,"Perfect Rectangle","perfect-rectangle",0,[63,6,71,95,161],[["/practice/#perfect-rectangle","Solution"]]],[392,"Is Subsequence","is-subsequence",0,[172,155,48],[["/practice/#is-subsequence","Solution"]]],[393,"UTF-8 Validation","utf-8-validation",0,[18,6],[["/practice/#utf-8-validation","Solution"]]],[394,"Decode String","decode-string",0,[154,134,155],[["/practice/#decode-string","Solution"]]],[395,"Longest Substring with At Least K Repeating Characters","longest-substring-with-at-least-k-repeating-characters",0,[71,155,46,146],[["/practice/#longest-substring-with-at-least-k-repeating-characters","Solution"]]],[396,"Rotate Function","rotate-function",0,[6,95,48],[["/practice/#rotate-function","Solution"]]],[397,"Integer Replacement","integer-replacement",0,[68,18,100,48],[["/practice/#integer-replacement","Solution"]]],[398,"Random Pick Index","random-pick-index",0,[136,71,95,132],[["/practice/#random-pick-index","Solution"]]],[399,"Evaluate Division","evaluate-division",0,[41,25,174,64,6,155,142,61,9],[["/practice/#evaluate-division","Solution"]]],[400,"Nth Digit","nth-digit",0,[95,14],[["/practice/#nth-digit","Solution"]]],[401,"Binary Watch","binary-watch",0,[18,8],[["/practice/#binary-watch","Solution"]]],[402,"Remove K Digits","remove-k-digits",0,[154,68,155,108],[["/practice/#remove-k-digits","Solution"]]],[403,"Frog Jump","frog-jump",0,[6,48],[["/practice/#frog-jump","Solution"]]],[404,"Sum of Left Leaves","sum-of-left-leaves",0,[168,41,25,16],[["/practice/#sum-of-left-leaves","Solution"]]],[405,"Convert a Number to Hexadecimal","convert-a-number-to-hexadecimal",0,[18,95,155],[["/practice/#convert-a-number-to-hexadecimal","Solution"]]],[406,"Queue Reconstruction by Height","queue-reconstruction-by-height",0,[12,139,6,150],[["/practice/#queue-reconstruction-by-height","Solution"]]],[407,"Trapping Rain Water II","trapping-rain-water-ii",0,[25,6,96,72],[["/practice/#trapping-rain-water-ii","Solution"]]],[408,"Valid Word Abbreviation","valid-word-abbreviation",0,[172,155],[["/practice/#valid-word-abbreviation","Solution"]]],[409,"Longest Palindrome","longest-palindrome",0,[68,71,155],[["/practice/#longest-palindrome","Solution"]]],[410,"Split Array Largest Sum","split-array-largest-sum",0,[68,6,14,48,122],[["/practice/#split-array-largest-sum","Solution"]]],[411,"Minimum Unique Word Abbreviation","minimum-unique-word-abbreviation",0,[18,6,155,8],[["/practice/#minimum-unique-word-abbreviation","Solution"]]],[412,"Fizz Buzz","fizz-buzz",0,[95,155,145],[["/practice/#fizz-buzz","Solution"]]],[413,"Arithmetic Slices","arithmetic-slices",0,[6,48,146],[["/practice/#arithmetic-slices","Solution"]]],[414,"Third Maximum Number","third-maximum-number",0,[6,150],[["/practice/#third-maximum-number","Solution"]]],[415,"Add Strings","add-strings",0,[95,155,145],[["/practice/#add-strings","Solution"]]],[416,"Partition Equal Subset Sum","partition-equal-subset-sum",0,[6,48,82,2],[["/patterns/dynamic-programming-families/","Ch. 19"],["/practice/#partition-equal-subset-sum","Solution"]]],[417,"Pacific Atlantic Water Flow","pacific-atlantic-water-flow",0,[41,25,6,96],[["/practice/#pacific-atlantic-water-flow","Solution"]]],[418,"Sentence Screen Fitting","sentence-screen-fitting",0,[6,155,48],[["/practice/#sentence-screen-fitting","Solution"]]],[419,"Battleships in a Board","battleships-in-a-board",0,[41,6,96],[["/practice/#battleships-in-a-board","Solution"]]],[420,"Strong Password Checker","strong-password-checker",0,[68,155,72],[["/practice/#strong-password-checker","Solution"]]],[421,"Maximum XOR of Two Numbers in an Array","maximum-xor-of-two-numbers-in-an-array",0,[18,171,6,71],[["/practice/#maximum-xor-of-two-numbers-in-an-array","Solution"]]],[422,"Valid Word Square","valid-word-square",0,[6,96],[["/practice/#valid-word-square","Solution"]]],[423,"Reconstruct Original Digits from English","reconstruct-original-digits-from-english",0,[71,95,155],[["/practice/#reconstruct-original-digits-from-english","Solution"]]],[424,"Longest Repeating Character Replacement","longest-repeating-character-replacement",0,[71,155,146],[["/patterns/sliding-windows-and-monotone-validity/","Ch. 08"],["/practice/#longest-repeating-character-replacement","Solution"]]],[425,"Word Squares","word-squares",0,[171,6,155,8],[["/practice/#word-squares","Solution"]]],[426,"Convert Binary Search Tree to Sorted Doubly Linked List","convert-binary-search-tree-to-sorted-doubly-linked-list",0,[154,168,41,15,88,16,47],[["/practice/#convert-binary-search-tree-to-sorted-doubly-linked-list","Solution"]]],[427,"Construct Quad Tree","construct-quad-tree",0,[168,6,46,96],[["/practice/#construct-quad-tree","Solution"]]],[428,"Serialize and Deserialize N-ary Tree","serialize-and-deserialize-n-ary-tree",0,[168,41,25,155],[["/practice/#serialize-and-deserialize-n-ary-tree","Solution"]]],[429,"N-ary Tree Level Order Traversal","n-ary-tree-level-order-traversal",0,[168,25],[["/practice/#n-ary-tree-level-order-traversal","Solution"]]],[430,"Flatten a Multilevel Doubly Linked List","flatten-a-multilevel-doubly-linked-list",0,[41,88,47],[["/practice/#flatten-a-multilevel-doubly-linked-list","Solution"]]],[431,"Encode N-ary Tree to Binary Tree","encode-n-ary-tree-to-binary-tree",0,[168,41,25,42,16],[["/practice/#encode-n-ary-tree-to-binary-tree","Solution"]]],[432,"All O`one Data Structure","all-oone-data-structure",0,[42,71,88,47],[["/practice/#all-oone-data-structure","Solution"]]],[433,"Minimum Genetic Mutation","minimum-genetic-mutation",0,[25,71,155,11],[["/practice/#minimum-genetic-mutation","Solution"]]],[434,"Number of Segments in a String","number-of-segments-in-a-string",0,[155],[["/practice/#number-of-segments-in-a-string","Solution"]]],[435,"Non-overlapping Intervals","non-overlapping-intervals",0,[68,6,48,150],[["/patterns/sorting-intervals-and-greedy-choices/","Ch. 12"],["/practice/#non-overlapping-intervals","Solution"]]],[436,"Find Right Interval","find-right-interval",0,[6,14,150],[["/practice/#find-right-interval","Solution"]]],[437,"Path Sum III","path-sum-iii",0,[168,41,16],[["/practice/#path-sum-iii","Solution"]]],[438,"Find All Anagrams in a String","find-all-anagrams-in-a-string",0,[71,155,146],[["/practice/#find-all-anagrams-in-a-string","Solution"]]],[439,"Ternary Expression Parser","ternary-expression-parser",0,[154,134,155],[["/practice/#ternary-expression-parser","Solution"]]],[440,"K-th Smallest in Lexicographical Order","k-th-smallest-in-lexicographical-order",0,[171],[["/practice/#k-th-smallest-in-lexicographical-order","Solution"]]],[441,"Arranging Coins","arranging-coins",0,[95,14],[["/practice/#arranging-coins","Solution"]]],[442,"Find All Duplicates in an Array","find-all-duplicates-in-an-array",0,[6,71,150],[["/practice/#find-all-duplicates-in-an-array","Solution"]]],[443,"String Compression","string-compression",0,[172,155],[["/practice/#string-compression","Solution"]]],[444,"Sequence Reconstruction","sequence-reconstruction",0,[64,165,6,45],[["/practice/#sequence-reconstruction","Solution"]]],[445,"Add Two Numbers II","add-two-numbers-ii",0,[154,88,95],[["/practice/#add-two-numbers-ii","Solution"]]],[446,"Arithmetic Slices II - Subsequence","arithmetic-slices-ii-subsequence",0,[6,48],[["/practice/#arithmetic-slices-ii-subsequence","Solution"]]],[447,"Number of Boomerangs","number-of-boomerangs",0,[6,71,95],[["/practice/#number-of-boomerangs","Solution"]]],[448,"Find All Numbers Disappeared in an Array","find-all-numbers-disappeared-in-an-array",0,[6,71],[["/practice/#find-all-numbers-disappeared-in-an-array","Solution"]]],[449,"Serialize and Deserialize BST","serialize-and-deserialize-bst",0,[168,41,25,42,15,155,16],[["/practice/#serialize-and-deserialize-bst","Solution"]]],[450,"Delete Node in a BST","delete-node-in-a-bst",0,[168,15,16],[["/practice/#delete-node-in-a-bst","Solution"]]],[451,"Sort Characters By Frequency","sort-characters-by-frequency",0,[71,155,29,36,150,72],[["/practice/#sort-characters-by-frequency","Solution"]]],[452,"Minimum Number of Arrows to Burst Balloons","minimum-number-of-arrows-to-burst-balloons",0,[68,6,150],[["/patterns/sorting-intervals-and-greedy-choices/","Ch. 12"],["/practice/#minimum-number-of-arrows-to-burst-balloons","Solution"]]],[453,"Minimum Moves to Equal Array Elements","minimum-moves-to-equal-array-elements",0,[6,95],[["/practice/#minimum-moves-to-equal-array-elements","Solution"]]],[454,"4Sum II","4sum-ii",0,[6,71],[["/practice/#4sum-ii","Solution"]]],[455,"Assign Cookies","assign-cookies",0,[68,6,172,150,129],[["/practice/#assign-cookies","Solution"]]],[456,"132 Pattern","132-pattern",0,[154,6,14,113,108],[["/practice/#132-pattern","Solution"]]],[457,"Circular Array Loop","circular-array-loop",0,[6,71,172,60],[["/practice/#circular-array-loop","Solution"]]],[458,"Poor Pigs","poor-pigs",0,[95,48,33],[["/practice/#poor-pigs","Solution"]]],[459,"Repeated Substring Pattern","repeated-substring-pattern",0,[155,156,81,58],[["/practice/#repeated-substring-pattern","Solution"]]],[460,"LFU Cache","lfu-cache",0,[42,71,88,47],[["/practice/#lfu-cache","Solution"]]],[461,"Hamming Distance","hamming-distance",0,[18],[["/practice/#hamming-distance","Solution"]]],[462,"Minimum Moves to Equal Array Elements II","minimum-moves-to-equal-array-elements-ii",0,[6,95,150],[["/practice/#minimum-moves-to-equal-array-elements-ii","Solution"]]],[463,"Island Perimeter","island-perimeter",0,[41,25,6,96],[["/practice/#island-perimeter","Solution"]]],[464,"Can I Win","can-i-win",0,[18,100,95,48,19,62],[["/practice/#can-i-win","Solution"]]],[465,"Optimal Account Balancing","optimal-account-balancing",0,[18,6,48,8,19],[["/practice/#optimal-account-balancing","Solution"]]],[466,"Count The Repetitions","count-the-repetitions",0,[172,155,48],[["/practice/#count-the-repetitions","Solution"]]],[467,"Unique Substrings in Wraparound String","unique-substrings-in-wraparound-string",0,[155,48],[["/practice/#unique-substrings-in-wraparound-string","Solution"]]],[468,"Validate IP Address","validate-ip-address",0,[155],[["/practice/#validate-ip-address","Solution"]]],[469,"Convex Polygon","convex-polygon",0,[63,6,95,121],[["/practice/#convex-polygon","Solution"]]],[470,"Implement Rand10() Using Rand7()","implement-rand10-using-rand7",0,[95,135,126,132],[["/practice/#implement-rand10-using-rand7","Solution"]]],[471,"Encode String with Shortest Length","encode-string-with-shortest-length",0,[155,48],[["/practice/#encode-string-with-shortest-length","Solution"]]],[472,"Concatenated Words","concatenated-words",0,[41,171,6,155,48,150],[["/practice/#concatenated-words","Solution"]]],[473,"Matchsticks to Square","matchsticks-to-square",0,[18,6,48,8,19],[["/practice/#matchsticks-to-square","Solution"]]],[474,"Ones and Zeroes","ones-and-zeroes",0,[6,155,48,82,2],[["/practice/#ones-and-zeroes","Solution"]]],[475,"Heaters","heaters",0,[6,172,14,150],[["/practice/#heaters","Solution"]]],[476,"Number Complement","number-complement",0,[18],[["/practice/#number-complement","Solution"]]],[477,"Total Hamming Distance","total-hamming-distance",0,[18,6,95],[["/practice/#total-hamming-distance","Solution"]]],[478,"Generate Random Point in a Circle","generate-random-point-in-a-circle",0,[63,95,135,132],[["/practice/#generate-random-point-in-a-circle","Solution"]]],[479,"Largest Palindrome Product","largest-palindrome-product",0,[95,50],[["/practice/#largest-palindrome-product","Solution"]]],[480,"Sliding Window Median","sliding-window-median",0,[6,71,167,146,72],[["/practice/#sliding-window-median","Solution"]]],[481,"Magical String","magical-string",0,[172,155],[["/practice/#magical-string","Solution"]]],[482,"License Key Formatting","license-key-formatting",0,[155],[["/practice/#license-key-formatting","Solution"]]],[483,"Smallest Good Base","smallest-good-base",0,[95,14],[["/practice/#smallest-good-base","Solution"]]],[484,"Find Permutation","find-permutation",0,[154,68,6,155],[["/practice/#find-permutation","Solution"]]],[485,"Max Consecutive Ones","max-consecutive-ones",0,[6],[["/practice/#max-consecutive-ones","Solution"]]],[486,"Predict the Winner","predict-the-winner",0,[134,104,6,95,48,62,175],[["/practice/#predict-the-winner","Solution"]]],[487,"Max Consecutive Ones II","max-consecutive-ones-ii",0,[6,48,146],[["/practice/#max-consecutive-ones-ii","Solution"]]],[488,"Zuma Game","zuma-game",0,[154,25,100,155,48],[["/practice/#zuma-game","Solution"]]],[489,"Robot Room Cleaner","robot-room-cleaner",0,[8,77],[["/practice/#robot-room-cleaner","Solution"]]],[490,"The Maze","the-maze",0,[41,25,6,96],[["/practice/#the-maze","Solution"]]],[491,"Non-decreasing Subsequences","non-decreasing-subsequences",0,[18,6,71,8],[["/practice/#non-decreasing-subsequences","Solution"]]],[492,"Construct the Rectangle","construct-the-rectangle",0,[95],[["/practice/#construct-the-rectangle","Solution"]]],[493,"Reverse Pairs","reverse-pairs",0,[12,139,6,14,46,113,167,101],[["/practice/#reverse-pairs","Solution"]]],[494,"Target Sum","target-sum",0,[6,48,8,82,2],[["/patterns/dynamic-programming-families/","Ch. 19"],["/practice/#target-sum","Solution"]]],[495,"Teemo Attacking","teemo-attacking",0,[6,145],[["/practice/#teemo-attacking","Solution"]]],[496,"Next Greater Element I","next-greater-element-i",0,[154,6,71,108],[["/patterns/stacks-and-monotonic-deques/","Ch. 10"],["/practice/#next-greater-element-i","Solution"]]],[497,"Random Point in Non-overlapping Rectangles","random-point-in-non-overlapping-rectangles",0,[136,6,95,14,113,122,132],[["/practice/#random-point-in-non-overlapping-rectangles","Solution"]]],[498,"Diagonal Traverse","diagonal-traverse",0,[6,96,145],[["/practice/#diagonal-traverse","Solution"]]],[499,"The Maze III","the-maze-iii",0,[41,25,64,6,155,96,142,43,72,3,73],[["/practice/#the-maze-iii","Solution"]]],[500,"Keyboard Row","keyboard-row",0,[6,71,155],[["/practice/#keyboard-row","Solution"]]],[501,"Find Mode in Binary Search Tree","find-mode-in-binary-search-tree",0,[168,41,15,16],[["/practice/#find-mode-in-binary-search-tree","Solution"]]],[502,"IPO","ipo",0,[68,6,150,72],[["/practice/#ipo","Solution"]]],[503,"Next Greater Element II","next-greater-element-ii",0,[154,6,108],[["/practice/#next-greater-element-ii","Solution"]]],[504,"Base 7","base-7",0,[95,155],[["/practice/#base-7","Solution"]]],[505,"The Maze II","the-maze-ii",0,[41,25,64,6,96,142,43,72,3,73],[["/practice/#the-maze-ii","Solution"]]],[506,"Relative Ranks","relative-ranks",0,[6,150,72],[["/practice/#relative-ranks","Solution"]]],[507,"Perfect Number","perfect-number",0,[95],[["/practice/#perfect-number","Solution"]]],[508,"Most Frequent Subtree Sum","most-frequent-subtree-sum",0,[168,41,71,16,169],[["/practice/#most-frequent-subtree-sum","Solution"]]],[509,"Fibonacci Number","fibonacci-number",0,[134,100,95,48],[["/practice/#fibonacci-number","Solution"]]],[510,"Inorder Successor in BST II","inorder-successor-in-bst-ii",0,[168,15,16],[["/practice/#inorder-successor-in-bst-ii","Solution"]]],[511,"Game Play Analysis I","game-play-analysis-i",1,[40],[["/practice/#game-play-analysis-i","Solution"]]],[512,"Game Play Analysis II","game-play-analysis-ii",1,[40],[["/practice/#game-play-analysis-ii","Solution"]]],[513,"Find Bottom Left Tree Value","find-bottom-left-tree-value",0,[168,41,25,16],[["/practice/#find-bottom-left-tree-value","Solution"]]],[514,"Freedom Trail","freedom-trail",0,[41,25,155,48],[["/practice/#freedom-trail","Solution"]]],[515,"Find Largest Value in Each Tree Row","find-largest-value-in-each-tree-row",0,[168,41,25,16],[["/practice/#find-largest-value-in-each-tree-row","Solution"]]],[516,"Longest Palindromic Subsequence","longest-palindromic-subsequence",0,[155,48],[["/practice/#longest-palindromic-subsequence","Solution"]]],[517,"Super Washing Machines","super-washing-machines",0,[68,6],[["/practice/#super-washing-machines","Solution"]]],[518,"Coin Change II","coin-change-ii",0,[6,48,82,173],[["/patterns/dynamic-programming-families/","Ch. 19"],["/practice/#coin-change-ii","Solution"]]],[519,"Random Flip Matrix","random-flip-matrix",0,[136,71,95,132],[["/practice/#random-flip-matrix","Solution"]]],[520,"Detect Capital","detect-capital",0,[155],[["/practice/#detect-capital","Solution"]]],[521,"Longest Uncommon Subsequence I","longest-uncommon-subsequence-i",0,[155],[["/practice/#longest-uncommon-subsequence-i","Solution"]]],[522,"Longest Uncommon Subsequence II","longest-uncommon-subsequence-ii",0,[6,71,172,155,150],[["/practice/#longest-uncommon-subsequence-ii","Solution"]]],[523,"Continuous Subarray Sum","continuous-subarray-sum",0,[6,71,95,122,119],[["/practice/#continuous-subarray-sum","Solution"]]],[524,"Longest Word in Dictionary through Deleting","longest-word-in-dictionary-through-deleting",0,[6,172,155,150],[["/practice/#longest-word-in-dictionary-through-deleting","Solution"]]],[525,"Contiguous Array","contiguous-array",0,[6,71,122],[["/patterns/reasoning-moves-that-unlock-problems/","Ch. 03"],["/practice/#contiguous-array","Solution"]]],[526,"Beautiful Arrangement","beautiful-arrangement",0,[18,6,48,8,19],[["/practice/#beautiful-arrangement","Solution"]]],[527,"Word Abbreviation","word-abbreviation",0,[68,171,6,155,150],[["/practice/#word-abbreviation","Solution"]]],[528,"Random Pick with Weight","random-pick-with-weight",0,[6,95,14,122,132],[["/practice/#random-pick-with-weight","Solution"]]],[529,"Minesweeper","minesweeper",0,[41,25,6,96],[["/practice/#minesweeper","Solution"]]],[530,"Minimum Absolute Difference in BST","minimum-absolute-difference-in-bst",0,[168,41,25,15,16],[["/practice/#minimum-absolute-difference-in-bst","Solution"]]],[531,"Lonely Pixel I","lonely-pixel-i",0,[6,71,96],[["/practice/#lonely-pixel-i","Solution"]]],[532,"K-diff Pairs in an Array","k-diff-pairs-in-an-array",0,[6,71,172,14,150],[["/practice/#k-diff-pairs-in-an-array","Solution"]]],[533,"Lonely Pixel II","lonely-pixel-ii",0,[6,71,96],[["/practice/#lonely-pixel-ii","Solution"]]],[534,"Game Play Analysis III","game-play-analysis-iii",1,[40],[["/practice/#game-play-analysis-iii","Solution"]]],[535,"Encode and Decode TinyURL","encode-and-decode-tinyurl",0,[42,71,155,70],[["/practice/#encode-and-decode-tinyurl","Solution"]]],[536,"Construct Binary Tree from String","construct-binary-tree-from-string",0,[154,168,41,155,16],[["/practice/#construct-binary-tree-from-string","Solution"]]],[537,"Complex Number Multiplication","complex-number-multiplication",0,[95,155,145],[["/practice/#complex-number-multiplication","Solution"]]],[538,"Convert BST to Greater Tree","convert-bst-to-greater-tree",0,[168,41,15,16],[["/practice/#convert-bst-to-greater-tree","Solution"]]],[539,"Minimum Time Difference","minimum-time-difference",0,[6,95,155,150],[["/practice/#minimum-time-difference","Solution"]]],[540,"Single Element in a Sorted Array","single-element-in-a-sorted-array",0,[6,14],[["/practice/#single-element-in-a-sorted-array","Solution"]]],[541,"Reverse String II","reverse-string-ii",0,[172,155],[["/practice/#reverse-string-ii","Solution"]]],[542,"01 Matrix","01-matrix",0,[25,6,48,96],[["/practice/#01-matrix","Solution"]]],[543,"Diameter of Binary Tree","diameter-of-binary-tree",0,[168,41,16,169],[["/patterns/linked-lists-and-recursive-trees/","Ch. 13"],["/worked/diameter-of-binary-tree/","Worked lesson"],["/practice/#diameter-of-binary-tree","Solution"]]],[544,"Output Contest Matches","output-contest-matches",0,[134,155,145],[["/practice/#output-contest-matches","Solution"]]],[545,"Boundary of Binary Tree","boundary-of-binary-tree",0,[168,41,16],[["/practice/#boundary-of-binary-tree","Solution"]]],[546,"Remove Boxes","remove-boxes",0,[100,6,48],[["/practice/#remove-boxes","Solution"]]],[547,"Number of Provinces","number-of-provinces",0,[41,25,174,64],[["/patterns/dependencies-and-merging-components/","Ch. 16"],["/practice/#number-of-provinces","Solution"]]],[548,"Split Array with Equal Sum","split-array-with-equal-sum",0,[6,71,122],[["/practice/#split-array-with-equal-sum","Solution"]]],[549,"Binary Tree Longest Consecutive Sequence II","binary-tree-longest-consecutive-sequence-ii",0,[168,41,16,169],[["/practice/#binary-tree-longest-consecutive-sequence-ii","Solution"]]],[550,"Game Play Analysis IV","game-play-analysis-iv",1,[40],[["/practice/#game-play-analysis-iv","Solution"]]],[551,"Student Attendance Record I","student-attendance-record-i",0,[155],[["/practice/#student-attendance-record-i","Solution"]]],[552,"Student Attendance Record II","student-attendance-record-ii",0,[48],[["/practice/#student-attendance-record-ii","Solution"]]],[553,"Optimal Division","optimal-division",0,[6,95,48],[["/practice/#optimal-division","Solution"]]],[554,"Brick Wall","brick-wall",0,[6,71],[["/practice/#brick-wall","Solution"]]],[555,"Split Concatenated Strings","split-concatenated-strings",0,[68,6,155],[["/practice/#split-concatenated-strings","Solution"]]],[556,"Next Greater Element III","next-greater-element-iii",0,[95,172,155],[["/practice/#next-greater-element-iii","Solution"]]],[557,"Reverse Words in a String III","reverse-words-in-a-string-iii",0,[172,155],[["/practice/#reverse-words-in-a-string-iii","Solution"]]],[558,"Logical OR of Two Binary Grids Represented as Quad-Trees","logical-or-of-two-binary-grids-represented-as-quad-trees",0,[168,46],[["/practice/#logical-or-of-two-binary-grids-represented-as-quad-trees","Solution"]]],[559,"Maximum Depth of N-ary Tree","maximum-depth-of-n-ary-tree",0,[168,41,25],[["/practice/#maximum-depth-of-n-ary-tree","Solution"]]],[560,"Subarray Sum Equals K","subarray-sum-equals-k",0,[6,71,122],[["/patterns/prefix-sums-and-algebraic-transformations/","Ch. 06"],["/worked/subarrays-summing-to-k/","Worked lesson"],["/practice/#subarray-sum-equals-k","Solution"]]],[561,"Array Partition","array-partition",0,[68,6,37,150],[["/practice/#array-partition","Solution"]]],[562,"Longest Line of Consecutive One in Matrix","longest-line-of-consecutive-one-in-matrix",0,[6,48,96],[["/practice/#longest-line-of-consecutive-one-in-matrix","Solution"]]],[563,"Binary Tree Tilt","binary-tree-tilt",0,[168,41,16,169],[["/practice/#binary-tree-tilt","Solution"]]],[564,"Find the Closest Palindrome","find-the-closest-palindrome",0,[95,155],[["/practice/#find-the-closest-palindrome","Solution"]]],[565,"Array Nesting","array-nesting",0,[41,6],[["/practice/#array-nesting","Solution"]]],[566,"Reshape the Matrix","reshape-the-matrix",0,[6,96,145],[["/practice/#reshape-the-matrix","Solution"]]],[567,"Permutation in String","permutation-in-string",0,[71,172,155,146],[["/practice/#permutation-in-string","Solution"]]],[568,"Maximum Vacation Days","maximum-vacation-days",0,[6,48,96],[["/practice/#maximum-vacation-days","Solution"]]],[569,"Median Employee Salary","median-employee-salary",1,[40],[["/practice/#median-employee-salary","Solution"]]],[570,"Managers with at Least 5 Direct Reports","managers-with-at-least-5-direct-reports",1,[40],[["/practice/#managers-with-at-least-5-direct-reports","Solution"]]],[571,"Find Median Given Frequency of Numbers","find-median-given-frequency-of-numbers",1,[40],[["/practice/#find-median-given-frequency-of-numbers","Solution"]]],[572,"Subtree of Another Tree","subtree-of-another-tree",0,[168,41,16,156,70],[["/practice/#subtree-of-another-tree","Solution"]]],[573,"Squirrel Simulation","squirrel-simulation",0,[6,95],[["/practice/#squirrel-simulation","Solution"]]],[574,"Winning Candidate","winning-candidate",1,[40],[["/practice/#winning-candidate","Solution"]]],[575,"Distribute Candies","distribute-candies",0,[6,71],[["/practice/#distribute-candies","Solution"]]],[576,"Out of Boundary Paths","out-of-boundary-paths",0,[48],[["/practice/#out-of-boundary-paths","Solution"]]],[577,"Employee Bonus","employee-bonus",1,[40],[["/practice/#employee-bonus","Solution"]]],[578,"Get Highest Answer Rate Question","get-highest-answer-rate-question",1,[40],[["/practice/#get-highest-answer-rate-question","Solution"]]],[579,"Find Cumulative Salary of an Employee","find-cumulative-salary-of-an-employee",1,[40],[["/practice/#find-cumulative-salary-of-an-employee","Solution"]]],[580,"Count Student Number in Departments","count-student-number-in-departments",1,[40],[["/practice/#count-student-number-in-departments","Solution"]]],[581,"Shortest Unsorted Continuous Subarray","shortest-unsorted-continuous-subarray",0,[154,68,6,172,150,108],[["/practice/#shortest-unsorted-continuous-subarray","Solution"]]],[582,"Kill Process","kill-process",0,[168,41,25,6,71],[["/practice/#kill-process","Solution"]]],[583,"Delete Operation for Two Strings","delete-operation-for-two-strings",0,[155,48,89],[["/practice/#delete-operation-for-two-strings","Solution"]]],[584,"Find Customer Referee","find-customer-referee",1,[40],[["/practice/#find-customer-referee","Solution"]]],[585,"Investments in 2016","investments-in-2016",1,[40],[["/practice/#investments-in-2016","Solution"]]],[586,"Customer Placing the Largest Number of Orders","customer-placing-the-largest-number-of-orders",1,[40],[["/practice/#customer-placing-the-largest-number-of-orders","Solution"]]],[587,"Erect the Fence","erect-the-fence",0,[63,6,95,35,121],[["/practice/#erect-the-fence","Solution"]]],[588,"Design In-Memory File System","design-in-memory-file-system",0,[42,171,71,155,150],[["/practice/#design-in-memory-file-system","Solution"]]],[589,"N-ary Tree Preorder Traversal","n-ary-tree-preorder-traversal",0,[154,168,41],[["/practice/#n-ary-tree-preorder-traversal","Solution"]]],[590,"N-ary Tree Postorder Traversal","n-ary-tree-postorder-traversal",0,[154,168,41],[["/practice/#n-ary-tree-postorder-traversal","Solution"]]],[591,"Tag Validator","tag-validator",0,[154,155],[["/practice/#tag-validator","Solution"]]],[592,"Fraction Addition and Subtraction","fraction-addition-and-subtraction",0,[95,155,67,145,51],[["/practice/#fraction-addition-and-subtraction","Solution"]]],[593,"Valid Square","valid-square",0,[63,95],[["/practice/#valid-square","Solution"]]],[594,"Longest Harmonious Subsequence","longest-harmonious-subsequence",0,[6,71,36,150,146],[["/practice/#longest-harmonious-subsequence","Solution"]]],[595,"Big Countries","big-countries",1,[40],[["/practice/#big-countries","Solution"]]],[596,"Classes With at Least 5 Students","classes-with-at-least-5-students",1,[40],[["/practice/#classes-with-at-least-5-students","Solution"]]],[597,"Friend Requests I: Overall Acceptance Rate","friend-requests-i-overall-acceptance-rate",1,[40],[["/practice/#friend-requests-i-overall-acceptance-rate","Solution"]]],[598,"Range Addition II","range-addition-ii",0,[6,95],[["/practice/#range-addition-ii","Solution"]]],[599,"Minimum Index Sum of Two Lists","minimum-index-sum-of-two-lists",0,[6,71,155],[["/practice/#minimum-index-sum-of-two-lists","Solution"]]],[600,"Non-negative Integers without Consecutive Ones","non-negative-integers-without-consecutive-ones",0,[48],[["/practice/#non-negative-integers-without-consecutive-ones","Solution"]]],[601,"Human Traffic of Stadium","human-traffic-of-stadium",1,[40],[["/practice/#human-traffic-of-stadium","Solution"]]],[602,"Friend Requests II: Who Has the Most Friends","friend-requests-ii-who-has-the-most-friends",1,[40],[["/practice/#friend-requests-ii-who-has-the-most-friends","Solution"]]],[603,"Consecutive Available Seats","consecutive-available-seats",1,[40],[["/practice/#consecutive-available-seats","Solution"]]],[604,"Design Compressed String Iterator","design-compressed-string-iterator",0,[42,6,155,78],[["/practice/#design-compressed-string-iterator","Solution"]]],[605,"Can Place Flowers","can-place-flowers",0,[68,6],[["/practice/#can-place-flowers","Solution"]]],[606,"Construct String from Binary Tree","construct-string-from-binary-tree",0,[168,41,155,16],[["/practice/#construct-string-from-binary-tree","Solution"]]],[607,"Sales Person","sales-person",1,[40],[["/practice/#sales-person","Solution"]]],[608,"Tree Node","tree-node",1,[40],[["/practice/#tree-node","Solution"]]],[609,"Find Duplicate File in System","find-duplicate-file-in-system",0,[6,71,155],[["/practice/#find-duplicate-file-in-system","Solution"]]],[610,"Triangle Judgement","triangle-judgement",1,[40],[["/practice/#triangle-judgement","Solution"]]],[611,"Valid Triangle Number","valid-triangle-number",0,[68,6,172,14,150],[["/practice/#valid-triangle-number","Solution"]]],[612,"Shortest Distance in a Plane","shortest-distance-in-a-plane",1,[40,32],[["/practice/#shortest-distance-in-a-plane","Solution"]]],[613,"Shortest Distance in a Line","shortest-distance-in-a-line",1,[40,32],[["/practice/#shortest-distance-in-a-line","Solution"]]],[614,"Second Degree Follower","second-degree-follower",1,[40],[["/practice/#second-degree-follower","Solution"]]],[615,"Average Salary: Departments VS Company","average-salary-departments-vs-company",1,[40],[["/practice/#average-salary-departments-vs-company","Solution"]]],[616,"Add Bold Tag in String","add-bold-tag-in-string",0,[171,6,71,155,156,4],[["/practice/#add-bold-tag-in-string","Solution"]]],[617,"Merge Two Binary Trees","merge-two-binary-trees",0,[168,41,25,16],[["/practice/#merge-two-binary-trees","Solution"]]],[618,"Students Report By Geography","students-report-by-geography",1,[40],[["/practice/#students-report-by-geography","Solution"]]],[619,"Biggest Single Number","biggest-single-number",1,[40],[["/practice/#biggest-single-number","Solution"]]],[620,"Not Boring Movies","not-boring-movies",1,[40],[["/practice/#not-boring-movies","Solution"]]],[621,"Task Scheduler","task-scheduler",0,[68,6,71,36,150,72],[["/practice/#task-scheduler","Solution"]]],[622,"Design Circular Queue","design-circular-queue",0,[42,128,6,88],[["/practice/#design-circular-queue","Solution"]]],[623,"Add One Row to Tree","add-one-row-to-tree",0,[168,41,25,16],[["/practice/#add-one-row-to-tree","Solution"]]],[624,"Maximum Distance in Arrays","maximum-distance-in-arrays",0,[68,6],[["/practice/#maximum-distance-in-arrays","Solution"]]],[625,"Minimum Factorization","minimum-factorization",0,[68,95,125],[["/practice/#minimum-factorization","Solution"]]],[626,"Exchange Seats","exchange-seats",1,[40],[["/practice/#exchange-seats","Solution"]]],[627,"Swap Sex of Employees","swap-sex-of-employees",1,[40],[["/practice/#swap-sex-of-employees","Solution"]]],[628,"Maximum Product of Three Numbers","maximum-product-of-three-numbers",0,[6,95,150],[["/practice/#maximum-product-of-three-numbers","Solution"]]],[629,"K Inverse Pairs Array","k-inverse-pairs-array",0,[48],[["/practice/#k-inverse-pairs-array","Solution"]]],[630,"Course Schedule III","course-schedule-iii",0,[68,6,150,72],[["/practice/#course-schedule-iii","Solution"]]],[631,"Design Excel Sum Formula","design-excel-sum-formula",0,[64,42,165,6,71,155,96],[["/practice/#design-excel-sum-formula","Solution"]]],[632,"Smallest Range Covering Elements from K Lists","smallest-range-covering-elements-from-k-lists",0,[68,6,71,150,146,72],[["/practice/#smallest-range-covering-elements-from-k-lists","Solution"]]],[633,"Sum of Square Numbers","sum-of-square-numbers",0,[95,172,14],[["/practice/#sum-of-square-numbers","Solution"]]],[634,"Find the Derangement of An Array","find-the-derangement-of-an-array",0,[95,48,33],[["/practice/#find-the-derangement-of-an-array","Solution"]]],[635,"Design Log Storage System","design-log-storage-system",0,[42,71,155,113],[["/practice/#design-log-storage-system","Solution"]]],[636,"Exclusive Time of Functions","exclusive-time-of-functions",0,[154,6],[["/practice/#exclusive-time-of-functions","Solution"]]],[637,"Average of Levels in Binary Tree","average-of-levels-in-binary-tree",0,[168,41,25,16],[["/practice/#average-of-levels-in-binary-tree","Solution"]]],[638,"Shopping Offers","shopping-offers",0,[18,100,6,48,8,19,82,173],[["/practice/#shopping-offers","Solution"]]],[639,"Decode Ways II","decode-ways-ii",0,[155,48],[["/practice/#decode-ways-ii","Solution"]]],[640,"Solve the Equation","solve-the-equation",0,[95,155,87,145],[["/practice/#solve-the-equation","Solution"]]],[641,"Design Circular Deque","design-circular-deque",0,[42,128,6,88],[["/practice/#design-circular-deque","Solution"]]],[642,"Design Search Autocomplete System","design-search-autocomplete-system",0,[41,42,171,155,39,150,72],[["/practice/#design-search-autocomplete-system","Solution"]]],[643,"Maximum Average Subarray I","maximum-average-subarray-i",0,[6,146],[["/patterns/sliding-windows-and-monotone-validity/","Ch. 08"],["/practice/#maximum-average-subarray-i","Solution"]]],[644,"Maximum Average Subarray II","maximum-average-subarray-ii",0,[6,14,122],[["/practice/#maximum-average-subarray-ii","Solution"]]],[645,"Set Mismatch","set-mismatch",0,[18,6,71,150],[["/practice/#set-mismatch","Solution"]]],[646,"Maximum Length of Pair Chain","maximum-length-of-pair-chain",0,[68,6,48,150,90],[["/practice/#maximum-length-of-pair-chain","Solution"]]],[647,"Palindromic Substrings","palindromic-substrings",0,[172,155,48],[["/practice/#palindromic-substrings","Solution"]]],[648,"Replace Words","replace-words",0,[171,6,71,155],[["/practice/#replace-words","Solution"]]],[649,"Dota2 Senate","dota2-senate",0,[68,128,155],[["/practice/#dota2-senate","Solution"]]],[650,"2 Keys Keyboard","2-keys-keyboard",0,[95,48],[["/practice/#2-keys-keyboard","Solution"]]],[651,"4 Keys Keyboard","4-keys-keyboard",0,[95,48],[["/practice/#4-keys-keyboard","Solution"]]],[652,"Find Duplicate Subtrees","find-duplicate-subtrees",0,[168,41,71,16],[["/practice/#find-duplicate-subtrees","Solution"]]],[653,"Two Sum IV - Input is a BST","two-sum-iv-input-is-a-bst",0,[168,41,25,15,71,172,16],[["/practice/#two-sum-iv-input-is-a-bst","Solution"]]],[654,"Maximum Binary Tree","maximum-binary-tree",0,[154,168,6,46,16,31,108],[["/practice/#maximum-binary-tree","Solution"]]],[655,"Print Binary Tree","print-binary-tree",0,[168,41,25,16],[["/practice/#print-binary-tree","Solution"]]],[656,"Coin Path","coin-path",0,[6,48],[["/practice/#coin-path","Solution"]]],[657,"Robot Return to Origin","robot-return-to-origin",0,[155,145],[["/practice/#robot-return-to-origin","Solution"]]],[658,"Find K Closest Elements","find-k-closest-elements",0,[6,172,14,150,146,72],[["/practice/#find-k-closest-elements","Solution"]]],[659,"Split Array into Consecutive Subsequences","split-array-into-consecutive-subsequences",0,[68,6,71,72],[["/practice/#split-array-into-consecutive-subsequences","Solution"]]],[660,"Remove 9","remove-9",0,[95],[["/practice/#remove-9","Solution"]]],[661,"Image Smoother","image-smoother",0,[6,96],[["/practice/#image-smoother","Solution"]]],[662,"Maximum Width of Binary Tree","maximum-width-of-binary-tree",0,[168,41,25,16],[["/practice/#maximum-width-of-binary-tree","Solution"]]],[663,"Equal Tree Partition","equal-tree-partition",0,[168,41,16],[["/practice/#equal-tree-partition","Solution"]]],[664,"Strange Printer","strange-printer",0,[155,48],[["/practice/#strange-printer","Solution"]]],[665,"Non-decreasing Array","non-decreasing-array",0,[6],[["/practice/#non-decreasing-array","Solution"]]],[666,"Path Sum IV","path-sum-iv",0,[168,41,6,71,16],[["/practice/#path-sum-iv","Solution"]]],[667,"Beautiful Arrangement II","beautiful-arrangement-ii",0,[6,95],[["/practice/#beautiful-arrangement-ii","Solution"]]],[668,"Kth Smallest Number in Multiplication Table","kth-smallest-number-in-multiplication-table",0,[95,14],[["/practice/#kth-smallest-number-in-multiplication-table","Solution"]]],[669,"Trim a Binary Search Tree","trim-a-binary-search-tree",0,[168,41,15,16],[["/practice/#trim-a-binary-search-tree","Solution"]]],[670,"Maximum Swap","maximum-swap",0,[68,95],[["/practice/#maximum-swap","Solution"]]],[671,"Second Minimum Node In a Binary Tree","second-minimum-node-in-a-binary-tree",0,[168,41,16],[["/practice/#second-minimum-node-in-a-binary-tree","Solution"]]],[672,"Bulb Switcher II","bulb-switcher-ii",0,[18,41,25,95],[["/practice/#bulb-switcher-ii","Solution"]]],[673,"Number of Longest Increasing Subsequence","number-of-longest-increasing-subsequence",0,[12,139,6,48,90],[["/practice/#number-of-longest-increasing-subsequence","Solution"]]],[674,"Longest Continuous Increasing Subsequence","longest-continuous-increasing-subsequence",0,[6],[["/practice/#longest-continuous-increasing-subsequence","Solution"]]],[675,"Cut Off Trees for Golf Event","cut-off-trees-for-golf-event",0,[25,6,96,72],[["/practice/#cut-off-trees-for-golf-event","Solution"]]],[676,"Implement Magic Dictionary","implement-magic-dictionary",0,[41,42,171,71,155],[["/practice/#implement-magic-dictionary","Solution"]]],[677,"Map Sum Pairs","map-sum-pairs",0,[42,171,71,155],[["/practice/#map-sum-pairs","Solution"]]],[678,"Valid Parenthesis String","valid-parenthesis-string",0,[154,68,155,48,116],[["/practice/#valid-parenthesis-string","Solution"]]],[679,"24 Game","24-game",0,[6,95,8],[["/practice/#24-game","Solution"]]],[680,"Valid Palindrome II","valid-palindrome-ii",0,[68,172,155],[["/practice/#valid-palindrome-ii","Solution"]]],[681,"Next Closest Time","next-closest-time",0,[71,155,8,50],[["/practice/#next-closest-time","Solution"]]],[682,"Baseball Game","baseball-game",0,[154,6,145],[["/practice/#baseball-game","Solution"]]],[683,"K Empty Slots","k-empty-slots",0,[12,139,128,6,113,146,107,72],[["/practice/#k-empty-slots","Solution"]]],[684,"Redundant Connection","redundant-connection",0,[41,25,174,64],[["/patterns/dependencies-and-merging-components/","Ch. 16"],["/worked/redundant-connection/","Worked lesson"],["/practice/#redundant-connection","Solution"]]],[685,"Redundant Connection II","redundant-connection-ii",0,[41,25,174,64],[["/practice/#redundant-connection-ii","Solution"]]],[686,"Repeated String Match","repeated-string-match",0,[155,156,81,23,58],[["/practice/#repeated-string-match","Solution"]]],[687,"Longest Univalue Path","longest-univalue-path",0,[168,41,16,169],[["/practice/#longest-univalue-path","Solution"]]],[688,"Knight Probability in Chessboard","knight-probability-in-chessboard",0,[48],[["/practice/#knight-probability-in-chessboard","Solution"]]],[689,"Maximum Sum of 3 Non-Overlapping Subarrays","maximum-sum-of-3-non-overlapping-subarrays",0,[6,48,122,146],[["/practice/#maximum-sum-of-3-non-overlapping-subarrays","Solution"]]],[690,"Employee Importance","employee-importance",0,[168,41,25,6,71],[["/practice/#employee-importance","Solution"]]],[691,"Stickers to Spell Word","stickers-to-spell-word",0,[18,100,6,71,155,48,8,19],[["/practice/#stickers-to-spell-word","Solution"]]],[692,"Top K Frequent Words","top-k-frequent-words",0,[171,6,71,155,29,36,150,72],[["/practice/#top-k-frequent-words","Solution"]]],[693,"Binary Number with Alternating Bits","binary-number-with-alternating-bits",0,[18],[["/practice/#binary-number-with-alternating-bits","Solution"]]],[694,"Number of Distinct Islands","number-of-distinct-islands",0,[41,25,174,6,71,96,150,70],[["/practice/#number-of-distinct-islands","Solution"]]],[695,"Max Area of Island","max-area-of-island",0,[41,25,174,6,96],[["/practice/#max-area-of-island","Solution"]]],[696,"Count Binary Substrings","count-binary-substrings",0,[172,155],[["/practice/#count-binary-substrings","Solution"]]],[697,"Degree of an Array","degree-of-an-array",0,[6,71],[["/practice/#degree-of-an-array","Solution"]]],[698,"Partition to K Equal Sum Subsets","partition-to-k-equal-sum-subsets",0,[18,100,6,48,8,19],[["/practice/#partition-to-k-equal-sum-subsets","Solution"]]],[699,"Falling Squares","falling-squares",0,[139,6,113],[["/practice/#falling-squares","Solution"]]],[700,"Search in a Binary Search Tree","search-in-a-binary-search-tree",0,[168,15,16],[["/practice/#search-in-a-binary-search-tree","Solution"]]],[701,"Insert into a Binary Search Tree","insert-into-a-binary-search-tree",0,[168,15,16],[["/practice/#insert-into-a-binary-search-tree","Solution"]]],[702,"Search in a Sorted Array of Unknown Size","search-in-a-sorted-array-of-unknown-size",0,[6,14,77],[["/practice/#search-in-a-sorted-array-of-unknown-size","Solution"]]],[703,"Kth Largest Element in a Stream","kth-largest-element-in-a-stream",0,[168,42,15,16,39,72],[["/patterns/heaps-and-the-candidate-frontier/","Ch. 11"],["/practice/#kth-largest-element-in-a-stream","Solution"]]],[704,"Binary Search","binary-search",0,[6,14],[["/patterns/binary-search-over-a-boundary/","Ch. 09"],["/practice/#binary-search","Solution"]]],[705,"Design HashSet","design-hashset",0,[42,6,71,88,70],[["/practice/#design-hashset","Solution"]]],[706,"Design HashMap","design-hashmap",0,[42,6,71,88,70],[["/practice/#design-hashmap","Solution"]]],[707,"Design Linked List","design-linked-list",0,[42,88],[["/practice/#design-linked-list","Solution"]]],[708,"Insert into a Sorted Circular Linked List","insert-into-a-sorted-circular-linked-list",0,[88],[["/practice/#insert-into-a-sorted-circular-linked-list","Solution"]]],[709,"To Lower Case","to-lower-case",0,[155],[["/practice/#to-lower-case","Solution"]]],[710,"Random Pick with Blacklist","random-pick-with-blacklist",0,[6,71,95,14,150,132],[["/practice/#random-pick-with-blacklist","Solution"]]],[711,"Number of Distinct Islands II","number-of-distinct-islands-ii",0,[41,25,174,6,71,96,150,70],[["/practice/#number-of-distinct-islands-ii","Solution"]]],[712,"Minimum ASCII Delete Sum for Two Strings","minimum-ascii-delete-sum-for-two-strings",0,[155,48,89],[["/practice/#minimum-ascii-delete-sum-for-two-strings","Solution"]]],[713,"Subarray Product Less Than K","subarray-product-less-than-k",0,[6,14,122,146],[["/practice/#subarray-product-less-than-k","Solution"]]],[714,"Best Time to Buy and Sell Stock with Transaction Fee","best-time-to-buy-and-sell-stock-with-transaction-fee",0,[68,6,48],[["/practice/#best-time-to-buy-and-sell-stock-with-transaction-fee","Solution"]]],[715,"Range Module","range-module",0,[42,139,113],[["/practice/#range-module","Solution"]]],[716,"Max Stack","max-stack",0,[154,42,88,47,113],[["/practice/#max-stack","Solution"]]],[717,"1-bit and 2-bit Characters","1-bit-and-2-bit-characters",0,[6],[["/practice/#1-bit-and-2-bit-characters","Solution"]]],[718,"Maximum Length of Repeated Subarray","maximum-length-of-repeated-subarray",0,[6,14,48,146,70,137],[["/practice/#maximum-length-of-repeated-subarray","Solution"]]],[719,"Find K-th Smallest Pair Distance","find-k-th-smallest-pair-distance",0,[6,172,14,150],[["/practice/#find-k-th-smallest-pair-distance","Solution"]]],[720,"Longest Word in Dictionary","longest-word-in-dictionary",0,[171,6,71,155,150],[["/practice/#longest-word-in-dictionary","Solution"]]],[721,"Accounts Merge","accounts-merge",0,[41,25,174,6,71,155,150],[["/patterns/dependencies-and-merging-components/","Ch. 16"],["/practice/#accounts-merge","Solution"]]],[722,"Remove Comments","remove-comments",0,[6,155],[["/practice/#remove-comments","Solution"]]],[723,"Candy Crush","candy-crush",0,[6,172,96,145],[["/practice/#candy-crush","Solution"]]],[724,"Find Pivot Index","find-pivot-index",0,[6,122],[["/practice/#find-pivot-index","Solution"]]],[725,"Split Linked List in Parts","split-linked-list-in-parts",0,[88],[["/practice/#split-linked-list-in-parts","Solution"]]],[726,"Number of Atoms","number-of-atoms",0,[154,71,155,150],[["/practice/#number-of-atoms","Solution"]]],[727,"Minimum Window Subsequence","minimum-window-subsequence",0,[155,48,146],[["/practice/#minimum-window-subsequence","Solution"]]],[728,"Self Dividing Numbers","self-dividing-numbers",0,[95],[["/practice/#self-dividing-numbers","Solution"]]],[729,"My Calendar I","my-calendar-i",0,[42,139,6,14,113],[["/practice/#my-calendar-i","Solution"]]],[730,"Count Different Palindromic Subsequences","count-different-palindromic-subsequences",0,[155,48],[["/practice/#count-different-palindromic-subsequences","Solution"]]],[731,"My Calendar II","my-calendar-ii",0,[42,139,6,14,113,122],[["/practice/#my-calendar-ii","Solution"]]],[732,"My Calendar III","my-calendar-iii",0,[42,139,14,113,122],[["/practice/#my-calendar-iii","Solution"]]],[733,"Flood Fill","flood-fill",0,[41,25,6,96],[["/practice/#flood-fill","Solution"]]],[734,"Sentence Similarity","sentence-similarity",0,[6,71,155],[["/practice/#sentence-similarity","Solution"]]],[735,"Asteroid Collision","asteroid-collision",0,[154,6,145],[["/practice/#asteroid-collision","Solution"]]],[736,"Parse Lisp Expression","parse-lisp-expression",0,[154,134,71,155],[["/practice/#parse-lisp-expression","Solution"]]],[737,"Sentence Similarity II","sentence-similarity-ii",0,[41,25,174,6,71,155],[["/practice/#sentence-similarity-ii","Solution"]]],[738,"Monotone Increasing Digits","monotone-increasing-digits",0,[68,95],[["/practice/#monotone-increasing-digits","Solution"]]],[739,"Daily Temperatures","daily-temperatures",0,[154,6,108],[["/patterns/stacks-and-monotonic-deques/","Ch. 10"],["/worked/daily-temperatures/","Worked lesson"],["/practice/#daily-temperatures","Solution"]]],[740,"Delete and Earn","delete-and-earn",0,[6,71,48],[["/practice/#delete-and-earn","Solution"]]],[741,"Cherry Pickup","cherry-pickup",0,[6,48,96],[["/practice/#cherry-pickup","Solution"]]],[742,"Closest Leaf in a Binary Tree","closest-leaf-in-a-binary-tree",0,[168,41,25,16],[["/practice/#closest-leaf-in-a-binary-tree","Solution"]]],[743,"Network Delay Time","network-delay-time",0,[41,25,64,142,43,72],[["/patterns/weighted-shortest-paths/","Ch. 17"],["/worked/network-delay-time/","Worked lesson"],["/practice/#network-delay-time","Solution"]]],[744,"Find Smallest Letter Greater Than Target","find-smallest-letter-greater-than-target",0,[6,14],[["/practice/#find-smallest-letter-greater-than-target","Solution"]]],[745,"Prefix and Suffix Search","prefix-and-suffix-search",0,[42,171,6,71,155],[["/practice/#prefix-and-suffix-search","Solution"]]],[746,"Min Cost Climbing Stairs","min-cost-climbing-stairs",0,[6,48],[["/patterns/dynamic-programming-from-sufficient-state/","Ch. 18"],["/practice/#min-cost-climbing-stairs","Solution"]]],[747,"Largest Number At Least Twice of Others","largest-number-at-least-twice-of-others",0,[6,150],[["/practice/#largest-number-at-least-twice-of-others","Solution"]]],[748,"Shortest Completing Word","shortest-completing-word",0,[6,71,155],[["/practice/#shortest-completing-word","Solution"]]],[749,"Contain Virus","contain-virus",0,[41,25,6,96,145],[["/practice/#contain-virus","Solution"]]],[750,"Number Of Corner Rectangles","number-of-corner-rectangles",0,[6,95,48,96],[["/practice/#number-of-corner-rectangles","Solution"]]],[751,"IP to CIDR","ip-to-cidr",0,[18,155],[["/practice/#ip-to-cidr","Solution"]]],[752,"Open the Lock","open-the-lock",0,[25,6,71,155,11],[["/patterns/graph-modeling-and-traversal/","Ch. 15"],["/practice/#open-the-lock","Solution"]]],[753,"Cracking the Safe","cracking-the-safe",0,[41,64,155,56,54,55],[["/practice/#cracking-the-safe","Solution"]]],[754,"Reach a Number","reach-a-number",0,[95,14],[["/practice/#reach-a-number","Solution"]]],[755,"Pour Water","pour-water",0,[6,145],[["/practice/#pour-water","Solution"]]],[756,"Pyramid Transition Matrix","pyramid-transition-matrix",0,[18,71,155,8],[["/practice/#pyramid-transition-matrix","Solution"]]],[757,"Set Intersection Size At Least Two","set-intersection-size-at-least-two",0,[68,6,150],[["/practice/#set-intersection-size-at-least-two","Solution"]]],[758,"Bold Words in String","bold-words-in-string",0,[171,6,71,155,156,4],[["/practice/#bold-words-in-string","Solution"]]],[759,"Employee Free Time","employee-free-time",0,[6,150,161,72],[["/practice/#employee-free-time","Solution"]]],[760,"Find Anagram Mappings","find-anagram-mappings",0,[6,71],[["/practice/#find-anagram-mappings","Solution"]]],[761,"Special Binary String","special-binary-string",0,[155,46,150],[["/practice/#special-binary-string","Solution"]]],[762,"Prime Number of Set Bits in Binary Representation","prime-number-of-set-bits-in-binary-representation",0,[18,95,124],[["/practice/#prime-number-of-set-bits-in-binary-representation","Solution"]]],[763,"Partition Labels","partition-labels",0,[68,71,172,155],[["/practice/#partition-labels","Solution"]]],[764,"Largest Plus Sign","largest-plus-sign",0,[6,48],[["/practice/#largest-plus-sign","Solution"]]],[765,"Couples Holding Hands","couples-holding-hands",0,[68,41,25,174,64],[["/practice/#couples-holding-hands","Solution"]]],[766,"Toeplitz Matrix","toeplitz-matrix",0,[6,96],[["/practice/#toeplitz-matrix","Solution"]]],[767,"Reorganize String","reorganize-string",0,[68,71,155,36,150,72],[["/practice/#reorganize-string","Solution"]]],[768,"Max Chunks To Make Sorted II","max-chunks-to-make-sorted-ii",0,[154,68,6,150,108],[["/practice/#max-chunks-to-make-sorted-ii","Solution"]]],[769,"Max Chunks To Make Sorted","max-chunks-to-make-sorted",0,[154,68,6,150,108],[["/practice/#max-chunks-to-make-sorted","Solution"]]],[770,"Basic Calculator IV","basic-calculator-iv",0,[154,134,71,95,155],[["/practice/#basic-calculator-iv","Solution"]]],[771,"Jewels and Stones","jewels-and-stones",0,[71,155],[["/practice/#jewels-and-stones","Solution"]]],[772,"Basic Calculator III","basic-calculator-iii",0,[154,134,95,155],[["/practice/#basic-calculator-iii","Solution"]]],[773,"Sliding Puzzle","sliding-puzzle",0,[25,100,6,48,8,96,11,3,73],[["/practice/#sliding-puzzle","Solution"]]],[774,"Minimize Max Distance to Gas Station","minimize-max-distance-to-gas-station",0,[6,14],[["/practice/#minimize-max-distance-to-gas-station","Solution"]]],[775,"Global and Local Inversions","global-and-local-inversions",0,[6,95],[["/practice/#global-and-local-inversions","Solution"]]],[776,"Split BST","split-bst",0,[168,15,134,16],[["/practice/#split-bst","Solution"]]],[777,"Swap Adjacent in LR String","swap-adjacent-in-lr-string",0,[172,155],[["/practice/#swap-adjacent-in-lr-string","Solution"]]],[778,"Swim in Rising Water","swim-in-rising-water",0,[41,25,174,104,6,14,96,43,72],[["/practice/#swim-in-rising-water","Solution"]]],[779,"K-th Symbol in Grammar","k-th-symbol-in-grammar",0,[18,134,95],[["/practice/#k-th-symbol-in-grammar","Solution"]]],[780,"Reaching Points","reaching-points",0,[95,67,51],[["/practice/#reaching-points","Solution"]]],[781,"Rabbits in Forest","rabbits-in-forest",0,[68,6,71,95],[["/practice/#rabbits-in-forest","Solution"]]],[782,"Transform to Chessboard","transform-to-chessboard",0,[18,6,95,96],[["/practice/#transform-to-chessboard","Solution"]]],[783,"Minimum Distance Between BST Nodes","minimum-distance-between-bst-nodes",0,[168,41,25,15,16],[["/practice/#minimum-distance-between-bst-nodes","Solution"]]],[784,"Letter Case Permutation","letter-case-permutation",0,[18,155,8],[["/practice/#letter-case-permutation","Solution"]]],[785,"Is Graph Bipartite?","is-graph-bipartite",0,[41,25,174,64,65,17],[["/practice/#is-graph-bipartite","Solution"]]],[786,"K-th Smallest Prime Fraction","k-th-smallest-prime-fraction",0,[6,172,14,150,72],[["/practice/#k-th-smallest-prime-fraction","Solution"]]],[787,"Cheapest Flights Within K Stops","cheapest-flights-within-k-stops",0,[41,25,64,48,142,72],[["/patterns/weighted-shortest-paths/","Ch. 17"],["/practice/#cheapest-flights-within-k-stops","Solution"]]],[788,"Rotated Digits","rotated-digits",0,[95,48],[["/practice/#rotated-digits","Solution"]]],[789,"Escape The Ghosts","escape-the-ghosts",0,[6,95],[["/practice/#escape-the-ghosts","Solution"]]],[790,"Domino and Tromino Tiling","domino-and-tromino-tiling",0,[48],[["/practice/#domino-and-tromino-tiling","Solution"]]],[791,"Custom Sort String","custom-sort-string",0,[71,155,150],[["/practice/#custom-sort-string","Solution"]]],[792,"Number of Matching Subsequences","number-of-matching-subsequences",0,[171,6,71,155,14,48,150],[["/practice/#number-of-matching-subsequences","Solution"]]],[793,"Preimage Size of Factorial Zeroes Function","preimage-size-of-factorial-zeroes-function",0,[95,14],[["/practice/#preimage-size-of-factorial-zeroes-function","Solution"]]],[794,"Valid Tic-Tac-Toe State","valid-tic-tac-toe-state",0,[6,96],[["/practice/#valid-tic-tac-toe-state","Solution"]]],[795,"Number of Subarrays with Bounded Maximum","number-of-subarrays-with-bounded-maximum",0,[6,172],[["/practice/#number-of-subarrays-with-bounded-maximum","Solution"]]],[796,"Rotate String","rotate-string",0,[155,156],[["/practice/#rotate-string","Solution"]]],[797,"All Paths From Source to Target","all-paths-from-source-to-target",0,[41,25,64,8,45],[["/practice/#all-paths-from-source-to-target","Solution"]]],[798,"Smallest Rotation with Highest Score","smallest-rotation-with-highest-score",0,[6,122],[["/practice/#smallest-rotation-with-highest-score","Solution"]]],[799,"Champagne Tower","champagne-tower",0,[48],[["/practice/#champagne-tower","Solution"]]],[800,"Similar RGB Color","similar-rgb-color",0,[95,155,50],[["/practice/#similar-rgb-color","Solution"]]],[801,"Minimum Swaps To Make Sequences Increasing","minimum-swaps-to-make-sequences-increasing",0,[6,48],[["/practice/#minimum-swaps-to-make-sequences-increasing","Solution"]]],[802,"Find Eventual Safe States","find-eventual-safe-states",0,[41,25,64,165,83,162],[["/practice/#find-eventual-safe-states","Solution"]]],[803,"Bricks Falling When Hit","bricks-falling-when-hit",0,[174,6,96],[["/practice/#bricks-falling-when-hit","Solution"]]],[804,"Unique Morse Code Words","unique-morse-code-words",0,[6,71,155],[["/practice/#unique-morse-code-words","Solution"]]],[805,"Split Array With Same Average","split-array-with-same-average",0,[18,6,71,95,48,19,99],[["/practice/#split-array-with-same-average","Solution"]]],[806,"Number of Lines To Write String","number-of-lines-to-write-string",0,[6,155],[["/practice/#number-of-lines-to-write-string","Solution"]]],[807,"Max Increase to Keep City Skyline","max-increase-to-keep-city-skyline",0,[68,6,96],[["/practice/#max-increase-to-keep-city-skyline","Solution"]]],[808,"Soup Servings","soup-servings",0,[95,48,126],[["/practice/#soup-servings","Solution"]]],[809,"Expressive Words","expressive-words",0,[6,172,155],[["/practice/#expressive-words","Solution"]]],[810,"Chalkboard XOR Game","chalkboard-xor-game",0,[18,24,6,95,62,175,75],[["/practice/#chalkboard-xor-game","Solution"]]],[811,"Subdomain Visit Count","subdomain-visit-count",0,[6,71,155,36],[["/practice/#subdomain-visit-count","Solution"]]],[812,"Largest Triangle Area","largest-triangle-area",0,[63,6,95,121],[["/practice/#largest-triangle-area","Solution"]]],[813,"Largest Sum of Averages","largest-sum-of-averages",0,[6,48,122],[["/practice/#largest-sum-of-averages","Solution"]]],[814,"Binary Tree Pruning","binary-tree-pruning",0,[168,41,16],[["/practice/#binary-tree-pruning","Solution"]]],[815,"Bus Routes","bus-routes",0,[25,6,71],[["/practice/#bus-routes","Solution"]]],[816,"Ambiguous Coordinates","ambiguous-coordinates",0,[155,8,50],[["/practice/#ambiguous-coordinates","Solution"]]],[817,"Linked List Components","linked-list-components",0,[6,71,88],[["/practice/#linked-list-components","Solution"]]],[818,"Race Car","race-car",0,[48,3,73],[["/practice/#race-car","Solution"]]],[819,"Most Common Word","most-common-word",0,[6,71,155,36],[["/practice/#most-common-word","Solution"]]],[820,"Short Encoding of Words","short-encoding-of-words",0,[171,6,71,155],[["/practice/#short-encoding-of-words","Solution"]]],[821,"Shortest Distance to a Character","shortest-distance-to-a-character",0,[6,172,155],[["/practice/#shortest-distance-to-a-character","Solution"]]],[822,"Card Flipping Game","card-flipping-game",0,[6,71],[["/practice/#card-flipping-game","Solution"]]],[823,"Binary Trees With Factors","binary-trees-with-factors",0,[6,71,48,150],[["/practice/#binary-trees-with-factors","Solution"]]],[824,"Goat Latin","goat-latin",0,[155],[["/practice/#goat-latin","Solution"]]],[825,"Friends Of Appropriate Ages","friends-of-appropriate-ages",0,[6,172,14,150],[["/practice/#friends-of-appropriate-ages","Solution"]]],[826,"Most Profit Assigning Work","most-profit-assigning-work",0,[68,6,172,14,150],[["/practice/#most-profit-assigning-work","Solution"]]],[827,"Making A Large Island","making-a-large-island",0,[41,25,174,6,96],[["/practice/#making-a-large-island","Solution"]]],[828,"Count Unique Characters of All Substrings of a Given String","count-unique-characters-of-all-substrings-of-a-given-string",0,[71,155,48],[["/practice/#count-unique-characters-of-all-substrings-of-a-given-string","Solution"]]],[829,"Consecutive Numbers Sum","consecutive-numbers-sum",0,[95,50],[["/practice/#consecutive-numbers-sum","Solution"]]],[830,"Positions of Large Groups","positions-of-large-groups",0,[155],[["/practice/#positions-of-large-groups","Solution"]]],[831,"Masking Personal Information","masking-personal-information",0,[155],[["/practice/#masking-personal-information","Solution"]]],[832,"Flipping an Image","flipping-an-image",0,[18,6,172,96,145],[["/practice/#flipping-an-image","Solution"]]],[833,"Find And Replace in String","find-and-replace-in-string",0,[6,71,155,150],[["/practice/#find-and-replace-in-string","Solution"]]],[834,"Sum of Distances in Tree","sum-of-distances-in-tree",0,[168,41,64,48,169],[["/practice/#sum-of-distances-in-tree","Solution"]]],[835,"Image Overlap","image-overlap",0,[6,96],[["/practice/#image-overlap","Solution"]]],[836,"Rectangle Overlap","rectangle-overlap",0,[63,95],[["/practice/#rectangle-overlap","Solution"]]],[837,"New 21 Game","new-21-game",0,[95,48,146,126],[["/practice/#new-21-game","Solution"]]],[838,"Push Dominoes","push-dominoes",0,[172,155,48],[["/practice/#push-dominoes","Solution"]]],[839,"Similar String Groups","similar-string-groups",0,[41,25,174,6,71,155],[["/practice/#similar-string-groups","Solution"]]],[840,"Magic Squares In Grid","magic-squares-in-grid",0,[6,71,95,96],[["/practice/#magic-squares-in-grid","Solution"]]],[841,"Keys and Rooms","keys-and-rooms",0,[41,25,64],[["/practice/#keys-and-rooms","Solution"]]],[842,"Split Array into Fibonacci Sequence","split-array-into-fibonacci-sequence",0,[155,8],[["/practice/#split-array-into-fibonacci-sequence","Solution"]]],[843,"Guess the Word","guess-the-word",0,[104,6,95,155,62,77],[["/practice/#guess-the-word","Solution"]]],[844,"Backspace String Compare","backspace-string-compare",0,[154,172,155,145],[["/practice/#backspace-string-compare","Solution"]]],[845,"Longest Mountain in Array","longest-mountain-in-array",0,[6,172,48,50],[["/practice/#longest-mountain-in-array","Solution"]]],[846,"Hand of Straights","hand-of-straights",0,[68,6,71,150],[["/practice/#hand-of-straights","Solution"]]],[847,"Shortest Path Visiting All Nodes","shortest-path-visiting-all-nodes",0,[18,25,64,48,19],[["/practice/#shortest-path-visiting-all-nodes","Solution"]]],[848,"Shifting Letters","shifting-letters",0,[6,155,122],[["/practice/#shifting-letters","Solution"]]],[849,"Maximize Distance to Closest Person","maximize-distance-to-closest-person",0,[6],[["/practice/#maximize-distance-to-closest-person","Solution"]]],[850,"Rectangle Area II","rectangle-area-ii",0,[139,6,113,161],[["/practice/#rectangle-area-ii","Solution"]]],[851,"Loud and Rich","loud-and-rich",0,[41,64,165,6,45],[["/practice/#loud-and-rich","Solution"]]],[852,"Peak Index in a Mountain Array","peak-index-in-a-mountain-array",0,[6,14,163],[["/practice/#peak-index-in-a-mountain-array","Solution"]]],[853,"Car Fleet","car-fleet",0,[154,6,150,108],[["/practice/#car-fleet","Solution"]]],[854,"K-Similar Strings","k-similar-strings",0,[25,71,155],[["/practice/#k-similar-strings","Solution"]]],[855,"Exam Room","exam-room",0,[42,113,72],[["/practice/#exam-room","Solution"]]],[856,"Score of Parentheses","score-of-parentheses",0,[154,155,116],[["/practice/#score-of-parentheses","Solution"]]],[857,"Minimum Cost to Hire K Workers","minimum-cost-to-hire-k-workers",0,[68,6,150,72],[["/practice/#minimum-cost-to-hire-k-workers","Solution"]]],[858,"Mirror Reflection","mirror-reflection",0,[63,95,67,112,85],[["/practice/#mirror-reflection","Solution"]]],[859,"Buddy Strings","buddy-strings",0,[71,155],[["/practice/#buddy-strings","Solution"]]],[860,"Lemonade Change","lemonade-change",0,[68,6],[["/practice/#lemonade-change","Solution"]]],[861,"Score After Flipping Matrix","score-after-flipping-matrix",0,[68,18,6,96],[["/practice/#score-after-flipping-matrix","Solution"]]],[862,"Shortest Subarray with Sum at Least K","shortest-subarray-with-sum-at-least-k",0,[128,6,14,122,146,107,72],[["/patterns/stacks-and-monotonic-deques/","Ch. 10"],["/practice/#shortest-subarray-with-sum-at-least-k","Solution"]]],[863,"All Nodes Distance K in Binary Tree","all-nodes-distance-k-in-binary-tree",0,[168,41,25,71,16],[["/practice/#all-nodes-distance-k-in-binary-tree","Solution"]]],[864,"Shortest Path to Get All Keys","shortest-path-to-get-all-keys",0,[18,25,6,96],[["/patterns/graph-modeling-and-traversal/","Ch. 15"],["/practice/#shortest-path-to-get-all-keys","Solution"]]],[865,"Smallest Subtree with all the Deepest Nodes","smallest-subtree-with-all-the-deepest-nodes",0,[168,41,25,71,16,91,169,13],[["/practice/#smallest-subtree-with-all-the-deepest-nodes","Solution"]]],[866,"Prime Palindrome","prime-palindrome",0,[95,112,124],[["/practice/#prime-palindrome","Solution"]]],[867,"Transpose Matrix","transpose-matrix",0,[6,96,145],[["/practice/#transpose-matrix","Solution"]]],[868,"Binary Gap","binary-gap",0,[18],[["/practice/#binary-gap","Solution"]]],[869,"Reordered Power of 2","reordered-power-of-2",0,[71,95,36,50,150],[["/practice/#reordered-power-of-2","Solution"]]],[870,"Advantage Shuffle","advantage-shuffle",0,[68,6,172,150],[["/practice/#advantage-shuffle","Solution"]]],[871,"Minimum Number of Refueling Stops","minimum-number-of-refueling-stops",0,[68,6,48,72],[["/practice/#minimum-number-of-refueling-stops","Solution"]]],[872,"Leaf-Similar Trees","leaf-similar-trees",0,[168,41,16],[["/practice/#leaf-similar-trees","Solution"]]],[873,"Length of Longest Fibonacci Subsequence","length-of-longest-fibonacci-subsequence",0,[6,71,48],[["/practice/#length-of-longest-fibonacci-subsequence","Solution"]]],[874,"Walking Robot Simulation","walking-robot-simulation",0,[6,71,145],[["/practice/#walking-robot-simulation","Solution"]]],[875,"Koko Eating Bananas","koko-eating-bananas",0,[6,14],[["/patterns/binary-search-over-a-boundary/","Ch. 09"],["/worked/koko-eating-bananas/","Worked lesson"],["/practice/#koko-eating-bananas","Solution"]]],[876,"Middle of the Linked List","middle-of-the-linked-list",0,[88,172],[["/practice/#middle-of-the-linked-list","Solution"]]],[877,"Stone Game","stone-game",0,[104,6,95,48,62,175],[["/practice/#stone-game","Solution"]]],[878,"Nth Magical Number","nth-magical-number",0,[95,14,76,85],[["/practice/#nth-magical-number","Solution"]]],[879,"Profitable Schemes","profitable-schemes",0,[6,48,82,2],[["/practice/#profitable-schemes","Solution"]]],[880,"Decoded String at Index","decoded-string-at-index",0,[154,155],[["/practice/#decoded-string-at-index","Solution"]]],[881,"Boats to Save People","boats-to-save-people",0,[68,6,172,150,164],[["/practice/#boats-to-save-people","Solution"]]],[882,"Reachable Nodes In Subdivided Graph","reachable-nodes-in-subdivided-graph",0,[64,142,43,72],[["/practice/#reachable-nodes-in-subdivided-graph","Solution"]]],[883,"Projection Area of 3D Shapes","projection-area-of-3d-shapes",0,[63,6,95,96],[["/practice/#projection-area-of-3d-shapes","Solution"]]],[884,"Uncommon Words from Two Sentences","uncommon-words-from-two-sentences",0,[71,155,36],[["/practice/#uncommon-words-from-two-sentences","Solution"]]],[885,"Spiral Matrix III","spiral-matrix-iii",0,[6,96,145],[["/practice/#spiral-matrix-iii","Solution"]]],[886,"Possible Bipartition","possible-bipartition",0,[41,25,174,64,65,17],[["/practice/#possible-bipartition","Solution"]]],[887,"Super Egg Drop","super-egg-drop",0,[95,14,48],[["/practice/#super-egg-drop","Solution"]]],[888,"Fair Candy Swap","fair-candy-swap",0,[6,71,14,150],[["/practice/#fair-candy-swap","Solution"]]],[889,"Construct Binary Tree from Preorder and Postorder Traversal","construct-binary-tree-from-preorder-and-postorder-traversal",0,[168,6,71,46,16],[["/practice/#construct-binary-tree-from-preorder-and-postorder-traversal","Solution"]]],[890,"Find and Replace Pattern","find-and-replace-pattern",0,[6,71,155],[["/practice/#find-and-replace-pattern","Solution"]]],[891,"Sum of Subsequence Widths","sum-of-subsequence-widths",0,[6,95,150],[["/practice/#sum-of-subsequence-widths","Solution"]]],[892,"Surface Area of 3D Shapes","surface-area-of-3d-shapes",0,[63,6,95,96],[["/practice/#surface-area-of-3d-shapes","Solution"]]],[893,"Groups of Special-Equivalent Strings","groups-of-special-equivalent-strings",0,[6,71,155,150],[["/practice/#groups-of-special-equivalent-strings","Solution"]]],[894,"All Possible Full Binary Trees","all-possible-full-binary-trees",0,[168,134,100,48,16],[["/practice/#all-possible-full-binary-trees","Solution"]]],[895,"Maximum Frequency Stack","maximum-frequency-stack",0,[154,42,71,113],[["/practice/#maximum-frequency-stack","Solution"]]],[896,"Monotonic Array","monotonic-array",0,[6],[["/practice/#monotonic-array","Solution"]]],[897,"Increasing Order Search Tree","increasing-order-search-tree",0,[154,168,41,15,16],[["/practice/#increasing-order-search-tree","Solution"]]],[898,"Bitwise ORs of Subarrays","bitwise-ors-of-subarrays",0,[18,6,48],[["/practice/#bitwise-ors-of-subarrays","Solution"]]],[899,"Orderly Queue","orderly-queue",0,[95,155,150,148],[["/practice/#orderly-queue","Solution"]]],[900,"RLE Iterator","rle-iterator",0,[42,6,36,78],[["/practice/#rle-iterator","Solution"]]],[901,"Online Stock Span","online-stock-span",0,[154,42,39,108],[["/practice/#online-stock-span","Solution"]]],[902,"Numbers At Most N Given Digit Set","numbers-at-most-n-given-digit-set",0,[6,95,155,14,48],[["/practice/#numbers-at-most-n-given-digit-set","Solution"]]],[903,"Valid Permutations for DI Sequence","valid-permutations-for-di-sequence",0,[155,48,122],[["/practice/#valid-permutations-for-di-sequence","Solution"]]],[904,"Fruit Into Baskets","fruit-into-baskets",0,[6,71,146],[["/practice/#fruit-into-baskets","Solution"]]],[905,"Sort Array By Parity","sort-array-by-parity",0,[6,172,150],[["/practice/#sort-array-by-parity","Solution"]]],[906,"Super Palindromes","super-palindromes",0,[95,155,50],[["/practice/#super-palindromes","Solution"]]],[907,"Sum of Subarray Minimums","sum-of-subarray-minimums",0,[154,6,48,108],[["/patterns/reasoning-moves-that-unlock-problems/","Ch. 03"],["/practice/#sum-of-subarray-minimums","Solution"]]],[908,"Smallest Range I","smallest-range-i",0,[6,95],[["/practice/#smallest-range-i","Solution"]]],[909,"Snakes and Ladders","snakes-and-ladders",0,[25,6,96],[["/practice/#snakes-and-ladders","Solution"]]],[910,"Smallest Range II","smallest-range-ii",0,[68,6,95,150],[["/practice/#smallest-range-ii","Solution"]]],[911,"Online Election","online-election",0,[42,6,71,14],[["/practice/#online-election","Solution"]]],[912,"Sort an Array","sort-an-array",0,[6,46,29,37,131,150,72,101],[["/practice/#sort-an-array","Solution"]]],[913,"Cat and Mouse","cat-and-mouse",0,[64,165,100,104,95,48,62,175],[["/practice/#cat-and-mouse","Solution"]]],[914,"X of a Kind in a Deck of Cards","x-of-a-kind-in-a-deck-of-cards",0,[6,71,95,36,67,112,51],[["/practice/#x-of-a-kind-in-a-deck-of-cards","Solution"]]],[915,"Partition Array into Disjoint Intervals","partition-array-into-disjoint-intervals",0,[6],[["/practice/#partition-array-into-disjoint-intervals","Solution"]]],[916,"Word Subsets","word-subsets",0,[6,71,155],[["/practice/#word-subsets","Solution"]]],[917,"Reverse Only Letters","reverse-only-letters",0,[172,155],[["/practice/#reverse-only-letters","Solution"]]],[918,"Maximum Sum Circular Subarray","maximum-sum-circular-subarray",0,[128,6,46,48,107],[["/practice/#maximum-sum-circular-subarray","Solution"]]],[919,"Complete Binary Tree Inserter","complete-binary-tree-inserter",0,[168,25,42,16],[["/practice/#complete-binary-tree-inserter","Solution"]]],[920,"Number of Music Playlists","number-of-music-playlists",0,[95,48,33],[["/practice/#number-of-music-playlists","Solution"]]],[921,"Minimum Add to Make Parentheses Valid","minimum-add-to-make-parentheses-valid",0,[154,68,155,116],[["/practice/#minimum-add-to-make-parentheses-valid","Solution"]]],[922,"Sort Array By Parity II","sort-array-by-parity-ii",0,[6,172,150],[["/practice/#sort-array-by-parity-ii","Solution"]]],[923,"3Sum With Multiplicity","3sum-with-multiplicity",0,[6,71,172,36,150],[["/practice/#3sum-with-multiplicity","Solution"]]],[924,"Minimize Malware Spread","minimize-malware-spread",0,[41,25,174,64,6,71],[["/practice/#minimize-malware-spread","Solution"]]],[925,"Long Pressed Name","long-pressed-name",0,[172,155],[["/practice/#long-pressed-name","Solution"]]],[926,"Flip String to Monotone Increasing","flip-string-to-monotone-increasing",0,[155,48],[["/practice/#flip-string-to-monotone-increasing","Solution"]]],[927,"Three Equal Parts","three-equal-parts",0,[6,95],[["/practice/#three-equal-parts","Solution"]]],[928,"Minimize Malware Spread II","minimize-malware-spread-ii",0,[41,25,174,64,6,71],[["/practice/#minimize-malware-spread-ii","Solution"]]],[929,"Unique Email Addresses","unique-email-addresses",0,[6,71,155],[["/practice/#unique-email-addresses","Solution"]]],[930,"Binary Subarrays With Sum","binary-subarrays-with-sum",0,[6,71,122,146],[["/practice/#binary-subarrays-with-sum","Solution"]]],[931,"Minimum Falling Path Sum","minimum-falling-path-sum",0,[6,48,96],[["/practice/#minimum-falling-path-sum","Solution"]]],[932,"Beautiful Array","beautiful-array",0,[6,95,46],[["/practice/#beautiful-array","Solution"]]],[933,"Number of Recent Calls","number-of-recent-calls",0,[42,128,39],[["/practice/#number-of-recent-calls","Solution"]]],[934,"Shortest Bridge","shortest-bridge",0,[41,25,6,96],[["/practice/#shortest-bridge","Solution"]]],[935,"Knight Dialer","knight-dialer",0,[48],[["/practice/#knight-dialer","Solution"]]],[936,"Stamping The Sequence","stamping-the-sequence",0,[154,68,128,155],[["/practice/#stamping-the-sequence","Solution"]]],[937,"Reorder Data in Log Files","reorder-data-in-log-files",0,[6,155,150],[["/practice/#reorder-data-in-log-files","Solution"]]],[938,"Range Sum of BST","range-sum-of-bst",0,[168,41,15,16],[["/practice/#range-sum-of-bst","Solution"]]],[939,"Minimum Area Rectangle","minimum-area-rectangle",0,[63,6,71,95,150],[["/practice/#minimum-area-rectangle","Solution"]]],[940,"Distinct Subsequences II","distinct-subsequences-ii",0,[155,48],[["/practice/#distinct-subsequences-ii","Solution"]]],[941,"Valid Mountain Array","valid-mountain-array",0,[6],[["/practice/#valid-mountain-array","Solution"]]],[942,"DI String Match","di-string-match",0,[68,6,172,155],[["/practice/#di-string-match","Solution"]]],[943,"Find the Shortest Superstring","find-the-shortest-superstring",0,[18,6,155,48,19,69],[["/practice/#find-the-shortest-superstring","Solution"]]],[944,"Delete Columns to Make Sorted","delete-columns-to-make-sorted",0,[6,155,90],[["/practice/#delete-columns-to-make-sorted","Solution"]]],[945,"Minimum Increment to Make Array Unique","minimum-increment-to-make-array-unique",0,[68,6,36,150],[["/practice/#minimum-increment-to-make-array-unique","Solution"]]],[946,"Validate Stack Sequences","validate-stack-sequences",0,[154,6,145],[["/practice/#validate-stack-sequences","Solution"]]],[947,"Most Stones Removed with Same Row or Column","most-stones-removed-with-same-row-or-column",0,[41,174,64,71,17],[["/practice/#most-stones-removed-with-same-row-or-column","Solution"]]],[948,"Bag of Tokens","bag-of-tokens",0,[68,6,172,150],[["/practice/#bag-of-tokens","Solution"]]],[949,"Largest Time for Given Digits","largest-time-for-given-digits",0,[6,155,8,50],[["/practice/#largest-time-for-given-digits","Solution"]]],[950,"Reveal Cards In Increasing Order","reveal-cards-in-increasing-order",0,[128,6,150,145],[["/practice/#reveal-cards-in-increasing-order","Solution"]]],[951,"Flip Equivalent Binary Trees","flip-equivalent-binary-trees",0,[168,41,16],[["/practice/#flip-equivalent-binary-trees","Solution"]]],[952,"Largest Component Size by Common Factor","largest-component-size-by-common-factor",0,[174,6,71,95,112,125],[["/practice/#largest-component-size-by-common-factor","Solution"]]],[953,"Verifying an Alien Dictionary","verifying-an-alien-dictionary",0,[6,71,155],[["/practice/#verifying-an-alien-dictionary","Solution"]]],[954,"Array of Doubled Pairs","array-of-doubled-pairs",0,[68,6,71,150],[["/practice/#array-of-doubled-pairs","Solution"]]],[955,"Delete Columns to Make Sorted II","delete-columns-to-make-sorted-ii",0,[68,6,155],[["/practice/#delete-columns-to-make-sorted-ii","Solution"]]],[956,"Tallest Billboard","tallest-billboard",0,[6,48,82,2,99],[["/practice/#tallest-billboard","Solution"]]],[957,"Prison Cells After N Days","prison-cells-after-n-days",0,[18,6,71,95,60],[["/practice/#prison-cells-after-n-days","Solution"]]],[958,"Check Completeness of a Binary Tree","check-completeness-of-a-binary-tree",0,[168,25,16],[["/practice/#check-completeness-of-a-binary-tree","Solution"]]],[959,"Regions Cut By Slashes","regions-cut-by-slashes",0,[41,25,174,6,71,96,120],[["/practice/#regions-cut-by-slashes","Solution"]]],[960,"Delete Columns to Make Sorted III","delete-columns-to-make-sorted-iii",0,[6,155,48],[["/practice/#delete-columns-to-make-sorted-iii","Solution"]]],[961,"N-Repeated Element in Size 2N Array","n-repeated-element-in-size-2n-array",0,[6,71,119],[["/practice/#n-repeated-element-in-size-2n-array","Solution"]]],[962,"Maximum Width Ramp","maximum-width-ramp",0,[154,6,172,108],[["/practice/#maximum-width-ramp","Solution"]]],[963,"Minimum Area Rectangle II","minimum-area-rectangle-ii",0,[63,6,71,95],[["/practice/#minimum-area-rectangle-ii","Solution"]]],[964,"Least Operators to Express Number","least-operators-to-express-number",0,[100,95,48],[["/practice/#least-operators-to-express-number","Solution"]]],[965,"Univalued Binary Tree","univalued-binary-tree",0,[168,41,25,16],[["/practice/#univalued-binary-tree","Solution"]]],[966,"Vowel Spellchecker","vowel-spellchecker",0,[6,71,155],[["/practice/#vowel-spellchecker","Solution"]]],[967,"Numbers With Same Consecutive Differences","numbers-with-same-consecutive-differences",0,[25,8],[["/practice/#numbers-with-same-consecutive-differences","Solution"]]],[968,"Binary Tree Cameras","binary-tree-cameras",0,[168,41,48,16,169],[["/practice/#binary-tree-cameras","Solution"]]],[969,"Pancake Sorting","pancake-sorting",0,[68,6,172,150],[["/practice/#pancake-sorting","Solution"]]],[970,"Powerful Integers","powerful-integers",0,[71,95,50],[["/practice/#powerful-integers","Solution"]]],[971,"Flip Binary Tree To Match Preorder Traversal","flip-binary-tree-to-match-preorder-traversal",0,[168,41,16],[["/practice/#flip-binary-tree-to-match-preorder-traversal","Solution"]]],[972,"Equal Rational Numbers","equal-rational-numbers",0,[95,155],[["/practice/#equal-rational-numbers","Solution"]]],[973,"K Closest Points to Origin","k-closest-points-to-origin",0,[63,6,95,46,130,150,72,80],[["/practice/#k-closest-points-to-origin","Solution"]]],[974,"Subarray Sums Divisible by K","subarray-sums-divisible-by-k",0,[6,71,122],[["/patterns/prefix-sums-and-algebraic-transformations/","Ch. 06"],["/practice/#subarray-sums-divisible-by-k","Solution"]]],[975,"Odd Even Jump","odd-even-jump",0,[154,6,48,113,150,108],[["/practice/#odd-even-jump","Solution"]]],[976,"Largest Perimeter Triangle","largest-perimeter-triangle",0,[68,6,95,121,150,129],[["/practice/#largest-perimeter-triangle","Solution"]]],[977,"Squares of a Sorted Array","squares-of-a-sorted-array",0,[6,172,150],[["/practice/#squares-of-a-sorted-array","Solution"]]],[978,"Longest Turbulent Subarray","longest-turbulent-subarray",0,[6,48,146],[["/practice/#longest-turbulent-subarray","Solution"]]],[979,"Distribute Coins in Binary Tree","distribute-coins-in-binary-tree",0,[168,41,16,169],[["/practice/#distribute-coins-in-binary-tree","Solution"]]],[980,"Unique Paths III","unique-paths-iii",0,[18,6,8,69,96],[["/practice/#unique-paths-iii","Solution"]]],[981,"Time Based Key-Value Store","time-based-key-value-store",0,[42,71,155,14],[["/patterns/data-structure-design-and-composed-invariants/","Ch. 23"],["/practice/#time-based-key-value-store","Solution"]]],[982,"Triples with Bitwise AND Equal To Zero","triples-with-bitwise-and-equal-to-zero",0,[18,6,71],[["/practice/#triples-with-bitwise-and-equal-to-zero","Solution"]]],[983,"Minimum Cost For Tickets","minimum-cost-for-tickets",0,[6,48],[["/practice/#minimum-cost-for-tickets","Solution"]]],[984,"String Without AAA or BBB","string-without-aaa-or-bbb",0,[68,155],[["/practice/#string-without-aaa-or-bbb","Solution"]]],[985,"Sum of Even Numbers After Queries","sum-of-even-numbers-after-queries",0,[6,145],[["/practice/#sum-of-even-numbers-after-queries","Solution"]]],[986,"Interval List Intersections","interval-list-intersections",0,[6,172,161],[["/practice/#interval-list-intersections","Solution"]]],[987,"Vertical Order Traversal of a Binary Tree","vertical-order-traversal-of-a-binary-tree",0,[168,41,25,71,16,150],[["/practice/#vertical-order-traversal-of-a-binary-tree","Solution"]]],[988,"Smallest String Starting From Leaf","smallest-string-starting-from-leaf",0,[168,41,155,8,16],[["/practice/#smallest-string-starting-from-leaf","Solution"]]],[989,"Add to Array-Form of Integer","add-to-array-form-of-integer",0,[6,95],[["/practice/#add-to-array-form-of-integer","Solution"]]],[990,"Satisfiability of Equality Equations","satisfiability-of-equality-equations",0,[174,64,6,155],[["/practice/#satisfiability-of-equality-equations","Solution"]]],[991,"Broken Calculator","broken-calculator",0,[68,95],[["/practice/#broken-calculator","Solution"]]],[992,"Subarrays with K Different Integers","subarrays-with-k-different-integers",0,[6,71,36,146],[["/practice/#subarrays-with-k-different-integers","Solution"]]],[993,"Cousins in Binary Tree","cousins-in-binary-tree",0,[168,41,25,16],[["/practice/#cousins-in-binary-tree","Solution"]]],[994,"Rotting Oranges","rotting-oranges",0,[25,6,96],[["/patterns/graph-modeling-and-traversal/","Ch. 15"],["/practice/#rotting-oranges","Solution"]]],[995,"Minimum Number of K Consecutive Bit Flips","minimum-number-of-k-consecutive-bit-flips",0,[18,128,6,122,146,27],[["/practice/#minimum-number-of-k-consecutive-bit-flips","Solution"]]],[996,"Number of Squareful Arrays","number-of-squareful-arrays",0,[18,6,71,95,48,8,19],[["/practice/#number-of-squareful-arrays","Solution"]]],[997,"Find the Town Judge","find-the-town-judge",0,[64,6,71],[["/practice/#find-the-town-judge","Solution"]]],[998,"Maximum Binary Tree II","maximum-binary-tree-ii",0,[168,16],[["/practice/#maximum-binary-tree-ii","Solution"]]],[999,"Available Captures for Rook","available-captures-for-rook",0,[6,96,145],[["/practice/#available-captures-for-rook","Solution"]]],[1000,"Minimum Cost to Merge Stones","minimum-cost-to-merge-stones",0,[6,48,122],[["/practice/#minimum-cost-to-merge-stones","Solution"]]],[1001,"Grid Illumination","grid-illumination",0,[6,71],[["/practice/#grid-illumination","Solution"]]],[1002,"Find Common Characters","find-common-characters",0,[6,71,155],[["/practice/#find-common-characters","Solution"]]],[1003,"Check If Word Is Valid After Substitutions","check-if-word-is-valid-after-substitutions",0,[154,155],[["/practice/#check-if-word-is-valid-after-substitutions","Solution"]]],[1004,"Max Consecutive Ones III","max-consecutive-ones-iii",0,[6,14,122,146],[["/practice/#max-consecutive-ones-iii","Solution"]]],[1005,"Maximize Sum Of Array After K Negations","maximize-sum-of-array-after-k-negations",0,[68,6,150],[["/practice/#maximize-sum-of-array-after-k-negations","Solution"]]],[1006,"Clumsy Factorial","clumsy-factorial",0,[154,95,145],[["/practice/#clumsy-factorial","Solution"]]],[1007,"Minimum Domino Rotations For Equal Row","minimum-domino-rotations-for-equal-row",0,[68,6],[["/practice/#minimum-domino-rotations-for-equal-row","Solution"]]],[1008,"Construct Binary Search Tree from Preorder Traversal","construct-binary-search-tree-from-preorder-traversal",0,[154,168,15,6,16,108],[["/practice/#construct-binary-search-tree-from-preorder-traversal","Solution"]]],[1009,"Complement of Base 10 Integer","complement-of-base-10-integer",0,[18],[["/practice/#complement-of-base-10-integer","Solution"]]],[1010,"Pairs of Songs With Total Durations Divisible by 60","pairs-of-songs-with-total-durations-divisible-by-60",0,[6,71,36],[["/practice/#pairs-of-songs-with-total-durations-divisible-by-60","Solution"]]],[1011,"Capacity To Ship Packages Within D Days","capacity-to-ship-packages-within-d-days",0,[6,14],[["/patterns/binary-search-over-a-boundary/","Ch. 09"],["/practice/#capacity-to-ship-packages-within-d-days","Solution"]]],[1012,"Numbers With Repeated Digits","numbers-with-repeated-digits",0,[95,48],[["/practice/#numbers-with-repeated-digits","Solution"]]],[1013,"Partition Array Into Three Parts With Equal Sum","partition-array-into-three-parts-with-equal-sum",0,[68,6],[["/practice/#partition-array-into-three-parts-with-equal-sum","Solution"]]],[1014,"Best Sightseeing Pair","best-sightseeing-pair",0,[6,48],[["/practice/#best-sightseeing-pair","Solution"]]],[1015,"Smallest Integer Divisible by K","smallest-integer-divisible-by-k",0,[71,95,119],[["/practice/#smallest-integer-divisible-by-k","Solution"]]],[1016,"Binary String With Substrings Representing 1 To N","binary-string-with-substrings-representing-1-to-n",0,[18,71,155,146],[["/practice/#binary-string-with-substrings-representing-1-to-n","Solution"]]],[1017,"Convert to Base -2","convert-to-base-2",0,[95],[["/practice/#convert-to-base-2","Solution"]]],[1018,"Binary Prefix Divisible By 5","binary-prefix-divisible-by-5",0,[18,6],[["/practice/#binary-prefix-divisible-by-5","Solution"]]],[1019,"Next Greater Node In Linked List","next-greater-node-in-linked-list",0,[154,6,88,108],[["/practice/#next-greater-node-in-linked-list","Solution"]]],[1020,"Number of Enclaves","number-of-enclaves",0,[41,25,174,6,96],[["/practice/#number-of-enclaves","Solution"]]],[1021,"Remove Outermost Parentheses","remove-outermost-parentheses",0,[154,155,116],[["/practice/#remove-outermost-parentheses","Solution"]]],[1022,"Sum of Root To Leaf Binary Numbers","sum-of-root-to-leaf-binary-numbers",0,[168,41,16],[["/practice/#sum-of-root-to-leaf-binary-numbers","Solution"]]],[1023,"Camelcase Matching","camelcase-matching",0,[171,6,172,155,156],[["/practice/#camelcase-matching","Solution"]]],[1024,"Video Stitching","video-stitching",0,[68,6,48],[["/practice/#video-stitching","Solution"]]],[1025,"Divisor Game","divisor-game",0,[24,95,48,62,75],[["/practice/#divisor-game","Solution"]]],[1026,"Maximum Difference Between Node and Ancestor","maximum-difference-between-node-and-ancestor",0,[168,41,16],[["/practice/#maximum-difference-between-node-and-ancestor","Solution"]]],[1027,"Longest Arithmetic Subsequence","longest-arithmetic-subsequence",0,[6,71,14,48],[["/practice/#longest-arithmetic-subsequence","Solution"]]],[1028,"Recover a Tree From Preorder Traversal","recover-a-tree-from-preorder-traversal",0,[168,41,155,16],[["/practice/#recover-a-tree-from-preorder-traversal","Solution"]]],[1029,"Two City Scheduling","two-city-scheduling",0,[68,6,74,150,138],[["/practice/#two-city-scheduling","Solution"]]],[1030,"Matrix Cells in Distance Order","matrix-cells-in-distance-order",0,[63,6,95,96,150],[["/practice/#matrix-cells-in-distance-order","Solution"]]],[1031,"Maximum Sum of Two Non-Overlapping Subarrays","maximum-sum-of-two-non-overlapping-subarrays",0,[6,48,146],[["/practice/#maximum-sum-of-two-non-overlapping-subarrays","Solution"]]],[1032,"Stream of Characters","stream-of-characters",0,[42,171,6,155,39,4],[["/practice/#stream-of-characters","Solution"]]],[1033,"Moving Stones Until Consecutive","moving-stones-until-consecutive",0,[24,95],[["/practice/#moving-stones-until-consecutive","Solution"]]],[1034,"Coloring A Border","coloring-a-border",0,[41,25,6,96],[["/practice/#coloring-a-border","Solution"]]],[1035,"Uncrossed Lines","uncrossed-lines",0,[6,48,89],[["/practice/#uncrossed-lines","Solution"]]],[1036,"Escape a Large Maze","escape-a-large-maze",0,[41,25,6,71,11],[["/practice/#escape-a-large-maze","Solution"]]],[1037,"Valid Boomerang","valid-boomerang",0,[63,6,95],[["/practice/#valid-boomerang","Solution"]]],[1038,"Binary Search Tree to Greater Sum Tree","binary-search-tree-to-greater-sum-tree",0,[168,41,15,16],[["/practice/#binary-search-tree-to-greater-sum-tree","Solution"]]],[1039,"Minimum Score Triangulation of Polygon","minimum-score-triangulation-of-polygon",0,[6,48,121,170],[["/practice/#minimum-score-triangulation-of-polygon","Solution"]]],[1040,"Moving Stones Until Consecutive II","moving-stones-until-consecutive-ii",0,[6,95,150,146],[["/practice/#moving-stones-until-consecutive-ii","Solution"]]],[1041,"Robot Bounded In Circle","robot-bounded-in-circle",0,[95,155,145],[["/practice/#robot-bounded-in-circle","Solution"]]],[1042,"Flower Planting With No Adjacent","flower-planting-with-no-adjacent",0,[41,25,64,65],[["/practice/#flower-planting-with-no-adjacent","Solution"]]],[1043,"Partition Array for Maximum Sum","partition-array-for-maximum-sum",0,[6,48],[["/practice/#partition-array-for-maximum-sum","Solution"]]],[1044,"Longest Duplicate Substring","longest-duplicate-substring",0,[155,14,158,160,146,70,137,23,58,159],[["/practice/#longest-duplicate-substring","Solution"]]],[1045,"Customers Who Bought All Products","customers-who-bought-all-products",1,[40],[["/practice/#customers-who-bought-all-products","Solution"]]],[1046,"Last Stone Weight","last-stone-weight",0,[6,72],[["/practice/#last-stone-weight","Solution"]]],[1047,"Remove All Adjacent Duplicates In String","remove-all-adjacent-duplicates-in-string",0,[154,155],[["/practice/#remove-all-adjacent-duplicates-in-string","Solution"]]],[1048,"Longest String Chain","longest-string-chain",0,[6,71,172,155,48,150],[["/practice/#longest-string-chain","Solution"]]],[1049,"Last Stone Weight II","last-stone-weight-ii",0,[6,48,82,2],[["/practice/#last-stone-weight-ii","Solution"]]],[1050,"Actors and Directors Who Cooperated At Least Three Times","actors-and-directors-who-cooperated-at-least-three-times",1,[40],[["/practice/#actors-and-directors-who-cooperated-at-least-three-times","Solution"]]],[1051,"Height Checker","height-checker",0,[6,28,37,150],[["/practice/#height-checker","Solution"]]],[1052,"Grumpy Bookstore Owner","grumpy-bookstore-owner",0,[6,146],[["/practice/#grumpy-bookstore-owner","Solution"]]],[1053,"Previous Permutation With One Swap","previous-permutation-with-one-swap",0,[68,6],[["/practice/#previous-permutation-with-one-swap","Solution"]]],[1054,"Distant Barcodes","distant-barcodes",0,[68,6,71,36,150,72],[["/practice/#distant-barcodes","Solution"]]],[1055,"Shortest Way to Form String","shortest-way-to-form-string",0,[68,172,155,14],[["/practice/#shortest-way-to-form-string","Solution"]]],[1056,"Confusing Number","confusing-number",0,[95],[["/practice/#confusing-number","Solution"]]],[1057,"Campus Bikes","campus-bikes",0,[6,150,72],[["/practice/#campus-bikes","Solution"]]],[1058,"Minimize Rounding Error to Meet Target","minimize-rounding-error-to-meet-target",0,[68,6,95,155,150],[["/practice/#minimize-rounding-error-to-meet-target","Solution"]]],[1059,"All Paths from Source Lead to Destination","all-paths-from-source-lead-to-destination",0,[64,165,83,162],[["/practice/#all-paths-from-source-lead-to-destination","Solution"]]],[1060,"Missing Element in Sorted Array","missing-element-in-sorted-array",0,[6,14],[["/practice/#missing-element-in-sorted-array","Solution"]]],[1061,"Lexicographically Smallest Equivalent String","lexicographically-smallest-equivalent-string",0,[174,155],[["/practice/#lexicographically-smallest-equivalent-string","Solution"]]],[1062,"Longest Repeating Substring","longest-repeating-substring",0,[155,14,48,158,160,70,137,159],[["/practice/#longest-repeating-substring","Solution"]]],[1063,"Number of Valid Subarrays","number-of-valid-subarrays",0,[154,6,108],[["/practice/#number-of-valid-subarrays","Solution"]]],[1064,"Fixed Point","fixed-point",0,[6,14],[["/practice/#fixed-point","Solution"]]],[1065,"Index Pairs of a String","index-pairs-of-a-string",0,[171,6,155,150,4],[["/practice/#index-pairs-of-a-string","Solution"]]],[1066,"Campus Bikes II","campus-bikes-ii",0,[18,6,48,8,19,74,17,66,103,138,109],[["/practice/#campus-bikes-ii","Solution"]]],[1067,"Digit Count in Range","digit-count-in-range",0,[95,48],[["/practice/#digit-count-in-range","Solution"]]],[1068,"Product Sales Analysis I","product-sales-analysis-i",1,[40],[["/practice/#product-sales-analysis-i","Solution"]]],[1069,"Product Sales Analysis II","product-sales-analysis-ii",1,[40],[["/practice/#product-sales-analysis-ii","Solution"]]],[1070,"Product Sales Analysis III","product-sales-analysis-iii",1,[40],[["/practice/#product-sales-analysis-iii","Solution"]]],[1071,"Greatest Common Divisor of Strings","greatest-common-divisor-of-strings",0,[95,155,67,51],[["/practice/#greatest-common-divisor-of-strings","Solution"]]],[1072,"Flip Columns For Maximum Number of Equal Rows","flip-columns-for-maximum-number-of-equal-rows",0,[6,71,96],[["/practice/#flip-columns-for-maximum-number-of-equal-rows","Solution"]]],[1073,"Adding Two Negabinary Numbers","adding-two-negabinary-numbers",0,[6,95],[["/practice/#adding-two-negabinary-numbers","Solution"]]],[1074,"Number of Submatrices That Sum to Target","number-of-submatrices-that-sum-to-target",0,[6,71,96,122],[["/practice/#number-of-submatrices-that-sum-to-target","Solution"]]],[1075,"Project Employees I","project-employees-i",1,[40],[["/practice/#project-employees-i","Solution"]]],[1076,"Project Employees II","project-employees-ii",1,[40],[["/practice/#project-employees-ii","Solution"]]],[1077,"Project Employees III","project-employees-iii",1,[40],[["/practice/#project-employees-iii","Solution"]]],[1078,"Occurrences After Bigram","occurrences-after-bigram",0,[155],[["/practice/#occurrences-after-bigram","Solution"]]],[1079,"Letter Tile Possibilities","letter-tile-possibilities",0,[71,155,8,36],[["/practice/#letter-tile-possibilities","Solution"]]],[1080,"Insufficient Nodes in Root to Leaf Paths","insufficient-nodes-in-root-to-leaf-paths",0,[168,41,16],[["/practice/#insufficient-nodes-in-root-to-leaf-paths","Solution"]]],[1081,"Smallest Subsequence of Distinct Characters","smallest-subsequence-of-distinct-characters",0,[154,68,155,108],[["/practice/#smallest-subsequence-of-distinct-characters","Solution"]]],[1082,"Sales Analysis I","sales-analysis-i",1,[40],[["/practice/#sales-analysis-i","Solution"]]],[1083,"Sales Analysis II","sales-analysis-ii",1,[40],[["/practice/#sales-analysis-ii","Solution"]]],[1084,"Sales Analysis III","sales-analysis-iii",1,[40],[["/practice/#sales-analysis-iii","Solution"]]],[1085,"Sum of Digits in the Minimum Number","sum-of-digits-in-the-minimum-number",0,[6,95],[["/practice/#sum-of-digits-in-the-minimum-number","Solution"]]],[1086,"High Five","high-five",0,[6,71,150,72],[["/practice/#high-five","Solution"]]],[1087,"Brace Expansion","brace-expansion",0,[154,25,155,8,150],[["/practice/#brace-expansion","Solution"]]],[1088,"Confusing Number II","confusing-number-ii",0,[95,8],[["/practice/#confusing-number-ii","Solution"]]],[1089,"Duplicate Zeros","duplicate-zeros",0,[6,172],[["/practice/#duplicate-zeros","Solution"]]],[1090,"Largest Values From Labels","largest-values-from-labels",0,[68,6,71,36,150],[["/practice/#largest-values-from-labels","Solution"]]],[1091,"Shortest Path in Binary Matrix","shortest-path-in-binary-matrix",0,[25,6,96],[["/practice/#shortest-path-in-binary-matrix","Solution"]]],[1092,"Shortest Common Supersequence ","shortest-common-supersequence",0,[155,48,89],[["/practice/#shortest-common-supersequence","Solution"]]],[1093,"Statistics from a Large Sample","statistics-from-a-large-sample",0,[6,95,126],[["/practice/#statistics-from-a-large-sample","Solution"]]],[1094,"Car Pooling","car-pooling",0,[6,122,150,145,72],[["/practice/#car-pooling","Solution"]]],[1095,"Find in Mountain Array","find-in-mountain-array",0,[6,14,77,163],[["/practice/#find-in-mountain-array","Solution"]]],[1096,"Brace Expansion II","brace-expansion-ii",0,[154,25,71,155,8,150],[["/practice/#brace-expansion-ii","Solution"]]],[1097,"Game Play Analysis V","game-play-analysis-v",1,[40],[["/practice/#game-play-analysis-v","Solution"]]],[1098,"Unpopular Books","unpopular-books",1,[40],[["/practice/#unpopular-books","Solution"]]],[1099,"Two Sum Less Than K","two-sum-less-than-k",0,[6,172,14,150],[["/practice/#two-sum-less-than-k","Solution"]]],[1100,"Find K-Length Substrings With No Repeated Characters","find-k-length-substrings-with-no-repeated-characters",0,[71,155,146],[["/practice/#find-k-length-substrings-with-no-repeated-characters","Solution"]]],[1101,"The Earliest Moment When Everyone Become Friends","the-earliest-moment-when-everyone-become-friends",0,[174,6,150],[["/practice/#the-earliest-moment-when-everyone-become-friends","Solution"]]],[1102,"Path With Maximum Minimum Value","path-with-maximum-minimum-value",0,[41,25,174,6,14,96,43,72],[["/practice/#path-with-maximum-minimum-value","Solution"]]],[1103,"Distribute Candies to People","distribute-candies-to-people",0,[95,145],[["/practice/#distribute-candies-to-people","Solution"]]],[1104,"Path In Zigzag Labelled Binary Tree","path-in-zigzag-labelled-binary-tree",0,[168,95,16],[["/practice/#path-in-zigzag-labelled-binary-tree","Solution"]]],[1105,"Filling Bookcase Shelves","filling-bookcase-shelves",0,[6,48],[["/practice/#filling-bookcase-shelves","Solution"]]],[1106,"Parsing A Boolean Expression","parsing-a-boolean-expression",0,[154,134,155],[["/practice/#parsing-a-boolean-expression","Solution"]]],[1107,"New Users Daily Count","new-users-daily-count",1,[40],[["/practice/#new-users-daily-count","Solution"]]],[1108,"Defanging an IP Address","defanging-an-ip-address",0,[155],[["/practice/#defanging-an-ip-address","Solution"]]],[1109,"Corporate Flight Bookings","corporate-flight-bookings",0,[6,122],[["/patterns/prefix-sums-and-algebraic-transformations/","Ch. 06"],["/practice/#corporate-flight-bookings","Solution"]]],[1110,"Delete Nodes And Return Forest","delete-nodes-and-return-forest",0,[168,41,6,71,16],[["/practice/#delete-nodes-and-return-forest","Solution"]]],[1111,"Maximum Nesting Depth of Two Valid Parentheses Strings","maximum-nesting-depth-of-two-valid-parentheses-strings",0,[154,155,116],[["/practice/#maximum-nesting-depth-of-two-valid-parentheses-strings","Solution"]]],[1112,"Highest Grade For Each Student","highest-grade-for-each-student",1,[40],[["/practice/#highest-grade-for-each-student","Solution"]]],[1113,"Reported Posts","reported-posts",1,[40],[["/practice/#reported-posts","Solution"]]],[1114,"Print in Order","print-in-order",0,[34],[["/practice/#print-in-order","Solution"]]],[1115,"Print FooBar Alternately","print-foobar-alternately",0,[34],[["/practice/#print-foobar-alternately","Solution"]]],[1116,"Print Zero Even Odd","print-zero-even-odd",0,[34],[["/practice/#print-zero-even-odd","Solution"]]],[1117,"Building H2O","building-h2o",0,[34],[["/practice/#building-h2o","Solution"]]],[1118,"Number of Days in a Month","number-of-days-in-a-month",0,[95],[["/practice/#number-of-days-in-a-month","Solution"]]],[1119,"Remove Vowels from a String","remove-vowels-from-a-string",0,[155],[["/practice/#remove-vowels-from-a-string","Solution"]]],[1120,"Maximum Average Subtree","maximum-average-subtree",0,[168,41,16],[["/practice/#maximum-average-subtree","Solution"]]],[1121,"Divide Array Into Increasing Sequences","divide-array-into-increasing-sequences",0,[6,36],[["/practice/#divide-array-into-increasing-sequences","Solution"]]],[1122,"Relative Sort Array","relative-sort-array",0,[6,71,28,37,150,129],[["/practice/#relative-sort-array","Solution"]]],[1123,"Lowest Common Ancestor of Deepest Leaves","lowest-common-ancestor-of-deepest-leaves",0,[168,41,25,71,16,91,169,13],[["/practice/#lowest-common-ancestor-of-deepest-leaves","Solution"]]],[1124,"Longest Well-Performing Interval","longest-well-performing-interval",0,[154,6,71,122,108],[["/practice/#longest-well-performing-interval","Solution"]]],[1125,"Smallest Sufficient Team","smallest-sufficient-team",0,[18,6,48,19],[["/practice/#smallest-sufficient-team","Solution"]]],[1126,"Active Businesses","active-businesses",1,[40],[["/practice/#active-businesses","Solution"]]],[1127,"User Purchase Platform","user-purchase-platform",1,[40],[["/practice/#user-purchase-platform","Solution"]]],[1128,"Number of Equivalent Domino Pairs","number-of-equivalent-domino-pairs",0,[6,71,36],[["/practice/#number-of-equivalent-domino-pairs","Solution"]]],[1129,"Shortest Path with Alternating Colors","shortest-path-with-alternating-colors",0,[25,64],[["/practice/#shortest-path-with-alternating-colors","Solution"]]],[1130,"Minimum Cost Tree From Leaf Values","minimum-cost-tree-from-leaf-values",0,[154,68,6,48,31,108],[["/practice/#minimum-cost-tree-from-leaf-values","Solution"]]],[1131,"Maximum of Absolute Value Expression","maximum-of-absolute-value-expression",0,[6,95],[["/practice/#maximum-of-absolute-value-expression","Solution"]]],[1132,"Reported Posts II","reported-posts-ii",1,[40],[["/practice/#reported-posts-ii","Solution"]]],[1133,"Largest Unique Number","largest-unique-number",0,[6,71,150],[["/practice/#largest-unique-number","Solution"]]],[1134,"Armstrong Number","armstrong-number",0,[95],[["/practice/#armstrong-number","Solution"]]],[1135,"Connecting Cities With Minimum Cost","connecting-cities-with-minimum-cost",0,[174,64,105,72],[["/practice/#connecting-cities-with-minimum-cost","Solution"]]],[1136,"Parallel Courses","parallel-courses",0,[64,165,45],[["/practice/#parallel-courses","Solution"]]],[1137,"N-th Tribonacci Number","n-th-tribonacci-number",0,[100,95,48],[["/practice/#n-th-tribonacci-number","Solution"]]],[1138,"Alphabet Board Path","alphabet-board-path",0,[71,155],[["/practice/#alphabet-board-path","Solution"]]],[1139,"Largest 1-Bordered Square","largest-1-bordered-square",0,[6,48,96],[["/practice/#largest-1-bordered-square","Solution"]]],[1140,"Stone Game II","stone-game-ii",0,[104,6,95,48,62,122,175],[["/practice/#stone-game-ii","Solution"]]],[1141,"User Activity for the Past 30 Days I","user-activity-for-the-past-30-days-i",1,[40],[["/practice/#user-activity-for-the-past-30-days-i","Solution"]]],[1142,"User Activity for the Past 30 Days II","user-activity-for-the-past-30-days-ii",1,[40],[["/practice/#user-activity-for-the-past-30-days-ii","Solution"]]],[1143,"Longest Common Subsequence","longest-common-subsequence",0,[155,48,89],[["/patterns/dynamic-programming-families/","Ch. 19"],["/practice/#longest-common-subsequence","Solution"]]],[1144,"Decrease Elements To Make Array Zigzag","decrease-elements-to-make-array-zigzag",0,[68,6],[["/practice/#decrease-elements-to-make-array-zigzag","Solution"]]],[1145,"Binary Tree Coloring Game","binary-tree-coloring-game",0,[168,41,16],[["/practice/#binary-tree-coloring-game","Solution"]]],[1146,"Snapshot Array","snapshot-array",0,[42,6,71,14,118],[["/practice/#snapshot-array","Solution"]]],[1147,"Longest Chunked Palindrome Decomposition","longest-chunked-palindrome-decomposition",0,[68,172,155,48,70,137],[["/practice/#longest-chunked-palindrome-decomposition","Solution"]]],[1148,"Article Views I","article-views-i",1,[40],[["/practice/#article-views-i","Solution"]]],[1149,"Article Views II","article-views-ii",1,[40],[["/practice/#article-views-ii","Solution"]]],[1150,"Check If a Number Is Majority Element in a Sorted Array","check-if-a-number-is-majority-element-in-a-sorted-array",0,[6,14],[["/practice/#check-if-a-number-is-majority-element-in-a-sorted-array","Solution"]]],[1151,"Minimum Swaps to Group All 1's Together","minimum-swaps-to-group-all-1s-together",0,[6,146],[["/practice/#minimum-swaps-to-group-all-1s-together","Solution"]]],[1152,"Analyze User Website Visit Pattern","analyze-user-website-visit-pattern",0,[6,71,155,150],[["/practice/#analyze-user-website-visit-pattern","Solution"]]],[1153,"String Transforms Into Another String","string-transforms-into-another-string",0,[64,71,155],[["/practice/#string-transforms-into-another-string","Solution"]]],[1154,"Day of the Year","day-of-the-year",0,[95,155],[["/practice/#day-of-the-year","Solution"]]],[1155,"Number of Dice Rolls With Target Sum","number-of-dice-rolls-with-target-sum",0,[48],[["/practice/#number-of-dice-rolls-with-target-sum","Solution"]]],[1156,"Swap For Longest Repeated Character Substring","swap-for-longest-repeated-character-substring",0,[71,155,146],[["/practice/#swap-for-longest-repeated-character-substring","Solution"]]],[1157,"Online Majority Element In Subarray","online-majority-element-in-subarray",0,[42,12,139,6,14,22,153],[["/practice/#online-majority-element-in-subarray","Solution"]]],[1158,"Market Analysis I","market-analysis-i",1,[40],[["/practice/#market-analysis-i","Solution"]]],[1159,"Market Analysis II","market-analysis-ii",1,[40],[["/practice/#market-analysis-ii","Solution"]]],[1160,"Find Words That Can Be Formed by Characters","find-words-that-can-be-formed-by-characters",0,[6,71,155,36],[["/practice/#find-words-that-can-be-formed-by-characters","Solution"]]],[1161,"Maximum Level Sum of a Binary Tree","maximum-level-sum-of-a-binary-tree",0,[168,41,25,16],[["/practice/#maximum-level-sum-of-a-binary-tree","Solution"]]],[1162,"As Far from Land as Possible","as-far-from-land-as-possible",0,[25,6,48,96],[["/practice/#as-far-from-land-as-possible","Solution"]]],[1163,"Last Substring in Lexicographical Order","last-substring-in-lexicographical-order",0,[172,155,92],[["/practice/#last-substring-in-lexicographical-order","Solution"]]],[1164,"Product Price at a Given Date","product-price-at-a-given-date",1,[40],[["/practice/#product-price-at-a-given-date","Solution"]]],[1165,"Single-Row Keyboard","single-row-keyboard",0,[71,155],[["/practice/#single-row-keyboard","Solution"]]],[1166,"Design File System","design-file-system",0,[42,171,71,155],[["/practice/#design-file-system","Solution"]]],[1167,"Minimum Cost to Connect Sticks","minimum-cost-to-connect-sticks",0,[68,6,72],[["/practice/#minimum-cost-to-connect-sticks","Solution"]]],[1168,"Optimize Water Distribution in a Village","optimize-water-distribution-in-a-village",0,[174,64,84,105,123,72,20],[["/practice/#optimize-water-distribution-in-a-village","Solution"]]],[1169,"Invalid Transactions","invalid-transactions",0,[6,71,155,150],[["/practice/#invalid-transactions","Solution"]]],[1170,"Compare Strings by Frequency of the Smallest Character","compare-strings-by-frequency-of-the-smallest-character",0,[6,71,155,14,150],[["/practice/#compare-strings-by-frequency-of-the-smallest-character","Solution"]]],[1171,"Remove Zero Sum Consecutive Nodes from Linked List","remove-zero-sum-consecutive-nodes-from-linked-list",0,[71,88],[["/practice/#remove-zero-sum-consecutive-nodes-from-linked-list","Solution"]]],[1172,"Dinner Plate Stacks","dinner-plate-stacks",0,[154,42,71,72],[["/practice/#dinner-plate-stacks","Solution"]]],[1173,"Immediate Food Delivery I","immediate-food-delivery-i",1,[40],[["/practice/#immediate-food-delivery-i","Solution"]]],[1174,"Immediate Food Delivery II","immediate-food-delivery-ii",1,[40],[["/practice/#immediate-food-delivery-ii","Solution"]]],[1175,"Prime Arrangements","prime-arrangements",0,[95,124,143,144],[["/practice/#prime-arrangements","Solution"]]],[1176,"Diet Plan Performance","diet-plan-performance",0,[6,146],[["/practice/#diet-plan-performance","Solution"]]],[1177,"Can Make Palindrome from Substring","can-make-palindrome-from-substring",0,[18,6,71,155,122],[["/practice/#can-make-palindrome-from-substring","Solution"]]],[1178,"Number of Valid Words for Each Puzzle","number-of-valid-words-for-each-puzzle",0,[18,171,6,71,155],[["/practice/#number-of-valid-words-for-each-puzzle","Solution"]]],[1179,"Reformat Department Table","reformat-department-table",1,[40],[["/practice/#reformat-department-table","Solution"]]],[1180,"Count Substrings with Only One Distinct Letter","count-substrings-with-only-one-distinct-letter",0,[95,155],[["/practice/#count-substrings-with-only-one-distinct-letter","Solution"]]],[1181,"Before and After Puzzle","before-and-after-puzzle",0,[6,71,155,150],[["/practice/#before-and-after-puzzle","Solution"]]],[1182,"Shortest Distance to Target Color","shortest-distance-to-target-color",0,[6,14,48],[["/practice/#shortest-distance-to-target-color","Solution"]]],[1183,"Maximum Number of Ones","maximum-number-of-ones",0,[68,95,150,72],[["/practice/#maximum-number-of-ones","Solution"]]],[1184,"Distance Between Bus Stops","distance-between-bus-stops",0,[6],[["/practice/#distance-between-bus-stops","Solution"]]],[1185,"Day of the Week","day-of-the-week",0,[95],[["/practice/#day-of-the-week","Solution"]]],[1186,"Maximum Subarray Sum with One Deletion","maximum-subarray-sum-with-one-deletion",0,[6,48],[["/practice/#maximum-subarray-sum-with-one-deletion","Solution"]]],[1187,"Make Array Strictly Increasing","make-array-strictly-increasing",0,[6,14,48,150,90],[["/practice/#make-array-strictly-increasing","Solution"]]],[1188,"Design Bounded Blocking Queue","design-bounded-blocking-queue",0,[34],[["/practice/#design-bounded-blocking-queue","Solution"]]],[1189,"Maximum Number of Balloons","maximum-number-of-balloons",0,[71,155,36],[["/practice/#maximum-number-of-balloons","Solution"]]],[1190,"Reverse Substrings Between Each Pair of Parentheses","reverse-substrings-between-each-pair-of-parentheses",0,[154,155,116],[["/practice/#reverse-substrings-between-each-pair-of-parentheses","Solution"]]],[1191,"K-Concatenation Maximum Sum","k-concatenation-maximum-sum",0,[6,48],[["/practice/#k-concatenation-maximum-sum","Solution"]]],[1192,"Critical Connections in a Network","critical-connections-in-a-network",0,[41,64,26,10],[["/practice/#critical-connections-in-a-network","Solution"]]],[1193,"Monthly Transactions I","monthly-transactions-i",1,[40],[["/practice/#monthly-transactions-i","Solution"]]],[1194,"Tournament Winners","tournament-winners",1,[40],[["/practice/#tournament-winners","Solution"]]],[1195,"Fizz Buzz Multithreaded","fizz-buzz-multithreaded",0,[34],[["/practice/#fizz-buzz-multithreaded","Solution"]]],[1196,"How Many Apples Can You Put into the Basket","how-many-apples-can-you-put-into-the-basket",0,[68,6,150],[["/practice/#how-many-apples-can-you-put-into-the-basket","Solution"]]],[1197,"Minimum Knight Moves","minimum-knight-moves",0,[25,11,3,73],[["/practice/#minimum-knight-moves","Solution"]]],[1198,"Find Smallest Common Element in All Rows","find-smallest-common-element-in-all-rows",0,[6,71,14,36,96],[["/practice/#find-smallest-common-element-in-all-rows","Solution"]]],[1199,"Minimum Time to Build Blocks","minimum-time-to-build-blocks",0,[68,6,95,72],[["/practice/#minimum-time-to-build-blocks","Solution"]]],[1200,"Minimum Absolute Difference","minimum-absolute-difference",0,[6,150],[["/practice/#minimum-absolute-difference","Solution"]]],[1201,"Ugly Number III","ugly-number-iii",0,[95,14,33,67,112,76,51,85],[["/practice/#ugly-number-iii","Solution"]]],[1202,"Smallest String With Swaps","smallest-string-with-swaps",0,[41,25,174,6,71,155,150],[["/practice/#smallest-string-with-swaps","Solution"]]],[1203,"Sort Items by Groups Respecting Dependencies","sort-items-by-groups-respecting-dependencies",0,[41,25,64,165,45],[["/practice/#sort-items-by-groups-respecting-dependencies","Solution"]]],[1204,"Last Person to Fit in the Bus","last-person-to-fit-in-the-bus",1,[40],[["/practice/#last-person-to-fit-in-the-bus","Solution"]]],[1205,"Monthly Transactions II","monthly-transactions-ii",1,[40],[["/practice/#monthly-transactions-ii","Solution"]]],[1206,"Design Skiplist","design-skiplist",0,[42,88],[["/practice/#design-skiplist","Solution"]]],[1207,"Unique Number of Occurrences","unique-number-of-occurrences",0,[6,71],[["/practice/#unique-number-of-occurrences","Solution"]]],[1208,"Get Equal Substrings Within Budget","get-equal-substrings-within-budget",0,[155,14,122,146],[["/practice/#get-equal-substrings-within-budget","Solution"]]],[1209,"Remove All Adjacent Duplicates in String II","remove-all-adjacent-duplicates-in-string-ii",0,[154,155],[["/practice/#remove-all-adjacent-duplicates-in-string-ii","Solution"]]],[1210,"Minimum Moves to Reach Target with Rotations","minimum-moves-to-reach-target-with-rotations",0,[25,6,96],[["/practice/#minimum-moves-to-reach-target-with-rotations","Solution"]]],[1211,"Queries Quality and Percentage","queries-quality-and-percentage",1,[40],[["/practice/#queries-quality-and-percentage","Solution"]]],[1212,"Team Scores in Football Tournament","team-scores-in-football-tournament",1,[40],[["/practice/#team-scores-in-football-tournament","Solution"]]],[1213,"Intersection of Three Sorted Arrays","intersection-of-three-sorted-arrays",0,[6,71,14,36],[["/practice/#intersection-of-three-sorted-arrays","Solution"]]],[1214,"Two Sum BSTs","two-sum-bsts",0,[154,168,41,15,172,14,16],[["/practice/#two-sum-bsts","Solution"]]],[1215,"Stepping Numbers","stepping-numbers",0,[25,95,8],[["/practice/#stepping-numbers","Solution"]]],[1216,"Valid Palindrome III","valid-palindrome-iii",0,[155,48],[["/practice/#valid-palindrome-iii","Solution"]]],[1217,"Minimum Cost to Move Chips to The Same Position","minimum-cost-to-move-chips-to-the-same-position",0,[68,6,95],[["/practice/#minimum-cost-to-move-chips-to-the-same-position","Solution"]]],[1218,"Longest Arithmetic Subsequence of Given Difference","longest-arithmetic-subsequence-of-given-difference",0,[6,71,48],[["/practice/#longest-arithmetic-subsequence-of-given-difference","Solution"]]],[1219,"Path with Maximum Gold","path-with-maximum-gold",0,[6,8,96],[["/practice/#path-with-maximum-gold","Solution"]]],[1220,"Count Vowels Permutation","count-vowels-permutation",0,[48],[["/practice/#count-vowels-permutation","Solution"]]],[1221,"Split a String in Balanced Strings","split-a-string-in-balanced-strings",0,[68,155,36],[["/practice/#split-a-string-in-balanced-strings","Solution"]]],[1222,"Queens That Can Attack the King","queens-that-can-attack-the-king",0,[6,96,145],[["/practice/#queens-that-can-attack-the-king","Solution"]]],[1223,"Dice Roll Simulation","dice-roll-simulation",0,[6,48],[["/practice/#dice-roll-simulation","Solution"]]],[1224,"Maximum Equal Frequency","maximum-equal-frequency",0,[6,71],[["/practice/#maximum-equal-frequency","Solution"]]],[1225,"Report Contiguous Dates","report-contiguous-dates",1,[40],[["/practice/#report-contiguous-dates","Solution"]]],[1226,"The Dining Philosophers","the-dining-philosophers",0,[34],[["/practice/#the-dining-philosophers","Solution"]]],[1227,"Airplane Seat Assignment Probability","airplane-seat-assignment-probability",0,[24,95,48,126],[["/practice/#airplane-seat-assignment-probability","Solution"]]],[1228,"Missing Number In Arithmetic Progression","missing-number-in-arithmetic-progression",0,[6,95],[["/practice/#missing-number-in-arithmetic-progression","Solution"]]],[1229,"Meeting Scheduler","meeting-scheduler",0,[6,172,150],[["/practice/#meeting-scheduler","Solution"]]],[1230,"Toss Strange Coins","toss-strange-coins",0,[6,95,48,126],[["/practice/#toss-strange-coins","Solution"]]],[1231,"Divide Chocolate","divide-chocolate",0,[6,14],[["/practice/#divide-chocolate","Solution"]]],[1232,"Check If It Is a Straight Line","check-if-it-is-a-straight-line",0,[63,6,95],[["/practice/#check-if-it-is-a-straight-line","Solution"]]],[1233,"Remove Sub-Folders from the Filesystem","remove-sub-folders-from-the-filesystem",0,[41,171,6,155],[["/practice/#remove-sub-folders-from-the-filesystem","Solution"]]],[1234,"Replace the Substring for Balanced String","replace-the-substring-for-balanced-string",0,[155,146],[["/practice/#replace-the-substring-for-balanced-string","Solution"]]],[1235,"Maximum Profit in Job Scheduling","maximum-profit-in-job-scheduling",0,[6,14,48,150],[["/patterns/sorting-intervals-and-greedy-choices/","Ch. 12"],["/practice/#maximum-profit-in-job-scheduling","Solution"]]],[1236,"Web Crawler","web-crawler",0,[41,25,155,77],[["/practice/#web-crawler","Solution"]]],[1237,"Find Positive Integer Solution for a Given Equation","find-positive-integer-solution-for-a-given-equation",0,[95,172,14,77],[["/practice/#find-positive-integer-solution-for-a-given-equation","Solution"]]],[1238,"Circular Permutation in Binary Representation","circular-permutation-in-binary-representation",0,[18,95,8],[["/practice/#circular-permutation-in-binary-representation","Solution"]]],[1239,"Maximum Length of a Concatenated String with Unique Characters","maximum-length-of-a-concatenated-string-with-unique-characters",0,[18,6,155,8],[["/practice/#maximum-length-of-a-concatenated-string-with-unique-characters","Solution"]]],[1240,"Tiling a Rectangle with the Fewest Squares","tiling-a-rectangle-with-the-fewest-squares",0,[8],[["/practice/#tiling-a-rectangle-with-the-fewest-squares","Solution"]]],[1241,"Number of Comments per Post","number-of-comments-per-post",1,[40],[["/practice/#number-of-comments-per-post","Solution"]]],[1242,"Web Crawler Multithreaded","web-crawler-multithreaded",0,[41,25,34],[["/practice/#web-crawler-multithreaded","Solution"]]],[1243,"Array Transformation","array-transformation",0,[6,145],[["/practice/#array-transformation","Solution"]]],[1244,"Design A Leaderboard","design-a-leaderboard",0,[42,71,150],[["/practice/#design-a-leaderboard","Solution"]]],[1245,"Tree Diameter","tree-diameter",0,[168,41,25,64,165,169],[["/practice/#tree-diameter","Solution"]]],[1246,"Palindrome Removal","palindrome-removal",0,[6,48],[["/practice/#palindrome-removal","Solution"]]],[1247,"Minimum Swaps to Make Strings Equal","minimum-swaps-to-make-strings-equal",0,[68,95,155],[["/practice/#minimum-swaps-to-make-strings-equal","Solution"]]],[1248,"Count Number of Nice Subarrays","count-number-of-nice-subarrays",0,[6,71,95,122,146],[["/practice/#count-number-of-nice-subarrays","Solution"]]],[1249,"Minimum Remove to Make Valid Parentheses","minimum-remove-to-make-valid-parentheses",0,[154,155],[["/practice/#minimum-remove-to-make-valid-parentheses","Solution"]]],[1250,"Check If It Is a Good Array","check-if-it-is-a-good-array",0,[6,95,67,112,51,57,30],[["/practice/#check-if-it-is-a-good-array","Solution"]]],[1251,"Average Selling Price","average-selling-price",1,[40],[["/practice/#average-selling-price","Solution"]]],[1252,"Cells with Odd Values in a Matrix","cells-with-odd-values-in-a-matrix",0,[6,95,145],[["/practice/#cells-with-odd-values-in-a-matrix","Solution"]]],[1253,"Reconstruct a 2-Row Binary Matrix","reconstruct-a-2-row-binary-matrix",0,[68,6,96],[["/practice/#reconstruct-a-2-row-binary-matrix","Solution"]]],[1254,"Number of Closed Islands","number-of-closed-islands",0,[41,25,174,6,96],[["/practice/#number-of-closed-islands","Solution"]]],[1255,"Maximum Score Words Formed by Letters","maximum-score-words-formed-by-letters",0,[18,6,71,155,48,8,19,36],[["/practice/#maximum-score-words-formed-by-letters","Solution"]]],[1256,"Encode Number","encode-number",0,[18,95,155],[["/practice/#encode-number","Solution"]]],[1257,"Smallest Common Region","smallest-common-region",0,[168,41,25,6,71,155,91,13],[["/practice/#smallest-common-region","Solution"]]],[1258,"Synonymous Sentences","synonymous-sentences",0,[149,174,6,71,155,8],[["/practice/#synonymous-sentences","Solution"]]],[1259,"Handshakes That Don't Cross","handshakes-that-dont-cross",0,[95,48],[["/practice/#handshakes-that-dont-cross","Solution"]]],[1260,"Shift 2D Grid","shift-2d-grid",0,[6,96,145],[["/practice/#shift-2d-grid","Solution"]]],[1261,"Find Elements in a Contaminated Binary Tree","find-elements-in-a-contaminated-binary-tree",0,[168,41,25,42,71,16],[["/practice/#find-elements-in-a-contaminated-binary-tree","Solution"]]],[1262,"Greatest Sum Divisible by Three","greatest-sum-divisible-by-three",0,[68,6,48,150],[["/practice/#greatest-sum-divisible-by-three","Solution"]]],[1263,"Minimum Moves to Move a Box to Their Target Location","minimum-moves-to-move-a-box-to-their-target-location",0,[25,6,96,72],[["/practice/#minimum-moves-to-move-a-box-to-their-target-location","Solution"]]],[1264,"Page Recommendations","page-recommendations",1,[40],[["/practice/#page-recommendations","Solution"]]],[1265,"Print Immutable Linked List in Reverse","print-immutable-linked-list-in-reverse",0,[154,134,88,172],[["/practice/#print-immutable-linked-list-in-reverse","Solution"]]],[1266,"Minimum Time Visiting All Points","minimum-time-visiting-all-points",0,[63,6,95],[["/practice/#minimum-time-visiting-all-points","Solution"]]],[1267,"Count Servers that Communicate","count-servers-that-communicate",0,[41,25,174,6,36,96],[["/practice/#count-servers-that-communicate","Solution"]]],[1268,"Search Suggestions System","search-suggestions-system",0,[171,6,155,14,150,72],[["/practice/#search-suggestions-system","Solution"]]],[1269,"Number of Ways to Stay in the Same Place After Some Steps","number-of-ways-to-stay-in-the-same-place-after-some-steps",0,[48],[["/practice/#number-of-ways-to-stay-in-the-same-place-after-some-steps","Solution"]]],[1270,"All People Report to the Given Manager","all-people-report-to-the-given-manager",1,[40],[["/practice/#all-people-report-to-the-given-manager","Solution"]]],[1271,"Hexspeak","hexspeak",0,[95,155],[["/practice/#hexspeak","Solution"]]],[1272,"Remove Interval","remove-interval",0,[6],[["/practice/#remove-interval","Solution"]]],[1273,"Delete Tree Nodes","delete-tree-nodes",0,[168,41,25,6,169],[["/practice/#delete-tree-nodes","Solution"]]],[1274,"Number of Ships in a Rectangle","number-of-ships-in-a-rectangle",0,[6,46,77],[["/practice/#number-of-ships-in-a-rectangle","Solution"]]],[1275,"Find Winner on a Tic Tac Toe Game","find-winner-on-a-tic-tac-toe-game",0,[6,71,96,145],[["/practice/#find-winner-on-a-tic-tac-toe-game","Solution"]]],[1276,"Number of Burgers with No Waste of Ingredients","number-of-burgers-with-no-waste-of-ingredients",0,[95],[["/practice/#number-of-burgers-with-no-waste-of-ingredients","Solution"]]],[1277,"Count Square Submatrices with All Ones","count-square-submatrices-with-all-ones",0,[6,48,96],[["/practice/#count-square-submatrices-with-all-ones","Solution"]]],[1278,"Palindrome Partitioning III","palindrome-partitioning-iii",0,[155,48],[["/practice/#palindrome-partitioning-iii","Solution"]]],[1279,"Traffic Light Controlled Intersection","traffic-light-controlled-intersection",0,[34],[["/practice/#traffic-light-controlled-intersection","Solution"]]],[1280,"Students and Examinations","students-and-examinations",1,[40],[["/practice/#students-and-examinations","Solution"]]],[1281,"Subtract the Product and Sum of Digits of an Integer","subtract-the-product-and-sum-of-digits-of-an-integer",0,[95],[["/practice/#subtract-the-product-and-sum-of-digits-of-an-integer","Solution"]]],[1282,"Group the People Given the Group Size They Belong To","group-the-people-given-the-group-size-they-belong-to",0,[68,6,71],[["/practice/#group-the-people-given-the-group-size-they-belong-to","Solution"]]],[1283,"Find the Smallest Divisor Given a Threshold","find-the-smallest-divisor-given-a-threshold",0,[6,14],[["/practice/#find-the-smallest-divisor-given-a-threshold","Solution"]]],[1284,"Minimum Number of Flips to Convert Binary Matrix to Zero Matrix","minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix",0,[18,25,6,71,96],[["/practice/#minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix","Solution"]]],[1285,"Find the Start and End Number of Continuous Ranges","find-the-start-and-end-number-of-continuous-ranges",1,[40],[["/practice/#find-the-start-and-end-number-of-continuous-ranges","Solution"]]],[1286,"Iterator for Combination","iterator-for-combination",0,[42,155,8,78],[["/practice/#iterator-for-combination","Solution"]]],[1287,"Element Appearing More Than 25% In Sorted Array","element-appearing-more-than-25-in-sorted-array",0,[6],[["/practice/#element-appearing-more-than-25-in-sorted-array","Solution"]]],[1288,"Remove Covered Intervals","remove-covered-intervals",0,[6,150],[["/practice/#remove-covered-intervals","Solution"]]],[1289,"Minimum Falling Path Sum II","minimum-falling-path-sum-ii",0,[6,48,96],[["/practice/#minimum-falling-path-sum-ii","Solution"]]],[1290,"Convert Binary Number in a Linked List to Integer","convert-binary-number-in-a-linked-list-to-integer",0,[88,95],[["/practice/#convert-binary-number-in-a-linked-list-to-integer","Solution"]]],[1291,"Sequential Digits","sequential-digits",0,[50],[["/practice/#sequential-digits","Solution"]]],[1292,"Maximum Side Length of a Square with Sum Less than or Equal to Threshold","maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold",0,[6,14,96,122],[["/practice/#maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold","Solution"]]],[1293,"Shortest Path in a Grid with Obstacles Elimination","shortest-path-in-a-grid-with-obstacles-elimination",0,[25,6,96],[["/practice/#shortest-path-in-a-grid-with-obstacles-elimination","Solution"]]],[1294,"Weather Type in Each Country","weather-type-in-each-country",1,[40],[["/practice/#weather-type-in-each-country","Solution"]]],[1295,"Find Numbers with Even Number of Digits","find-numbers-with-even-number-of-digits",0,[6,95],[["/practice/#find-numbers-with-even-number-of-digits","Solution"]]],[1296,"Divide Array in Sets of K Consecutive Numbers","divide-array-in-sets-of-k-consecutive-numbers",0,[68,6,71,150],[["/practice/#divide-array-in-sets-of-k-consecutive-numbers","Solution"]]],[1297,"Maximum Number of Occurrences of a Substring","maximum-number-of-occurrences-of-a-substring",0,[71,155,146],[["/practice/#maximum-number-of-occurrences-of-a-substring","Solution"]]],[1298,"Maximum Candies You Can Get from Boxes","maximum-candies-you-can-get-from-boxes",0,[25,64,6],[["/practice/#maximum-candies-you-can-get-from-boxes","Solution"]]],[1299,"Replace Elements with Greatest Element on Right Side","replace-elements-with-greatest-element-on-right-side",0,[6],[["/practice/#replace-elements-with-greatest-element-on-right-side","Solution"]]],[1300,"Sum of Mutated Array Closest to Target","sum-of-mutated-array-closest-to-target",0,[6,14,150],[["/practice/#sum-of-mutated-array-closest-to-target","Solution"]]],[1301,"Number of Paths with Max Score","number-of-paths-with-max-score",0,[6,48,96],[["/practice/#number-of-paths-with-max-score","Solution"]]],[1302,"Deepest Leaves Sum","deepest-leaves-sum",0,[168,41,25,16],[["/practice/#deepest-leaves-sum","Solution"]]],[1303,"Find the Team Size","find-the-team-size",1,[40],[["/practice/#find-the-team-size","Solution"]]],[1304,"Find N Unique Integers Sum up to Zero","find-n-unique-integers-sum-up-to-zero",0,[6,95],[["/practice/#find-n-unique-integers-sum-up-to-zero","Solution"]]],[1305,"All Elements in Two Binary Search Trees","all-elements-in-two-binary-search-trees",0,[168,41,15,16,150],[["/practice/#all-elements-in-two-binary-search-trees","Solution"]]],[1306,"Jump Game III","jump-game-iii",0,[41,25,6],[["/practice/#jump-game-iii","Solution"]]],[1307,"Verbal Arithmetic Puzzle","verbal-arithmetic-puzzle",0,[6,95,155,8],[["/practice/#verbal-arithmetic-puzzle","Solution"]]],[1308,"Running Total for Different Genders","running-total-for-different-genders",1,[40],[["/practice/#running-total-for-different-genders","Solution"]]],[1309,"Decrypt String from Alphabet to Integer Mapping","decrypt-string-from-alphabet-to-integer-mapping",0,[155],[["/practice/#decrypt-string-from-alphabet-to-integer-mapping","Solution"]]],[1310,"XOR Queries of a Subarray","xor-queries-of-a-subarray",0,[18,6,122],[["/practice/#xor-queries-of-a-subarray","Solution"]]],[1311,"Get Watched Videos by Your Friends","get-watched-videos-by-your-friends",0,[25,64,6,71,150],[["/practice/#get-watched-videos-by-your-friends","Solution"]]],[1312,"Minimum Insertion Steps to Make a String Palindrome","minimum-insertion-steps-to-make-a-string-palindrome",0,[155,48],[["/practice/#minimum-insertion-steps-to-make-a-string-palindrome","Solution"]]],[1313,"Decompress Run-Length Encoded List","decompress-run-length-encoded-list",0,[6],[["/practice/#decompress-run-length-encoded-list","Solution"]]],[1314,"Matrix Block Sum","matrix-block-sum",0,[6,96,122],[["/practice/#matrix-block-sum","Solution"]]],[1315,"Sum of Nodes with Even-Valued Grandparent","sum-of-nodes-with-even-valued-grandparent",0,[168,41,25,16],[["/practice/#sum-of-nodes-with-even-valued-grandparent","Solution"]]],[1316,"Distinct Echo Substrings","distinct-echo-substrings",0,[171,155,158,160,70,137,159],[["/practice/#distinct-echo-substrings","Solution"]]],[1317,"Convert Integer to the Sum of Two No-Zero Integers","convert-integer-to-the-sum-of-two-no-zero-integers",0,[95],[["/practice/#convert-integer-to-the-sum-of-two-no-zero-integers","Solution"]]],[1318,"Minimum Flips to Make a OR b Equal to c","minimum-flips-to-make-a-or-b-equal-to-c",0,[18],[["/practice/#minimum-flips-to-make-a-or-b-equal-to-c","Solution"]]],[1319,"Number of Operations to Make Network Connected","number-of-operations-to-make-network-connected",0,[41,25,174,64],[["/practice/#number-of-operations-to-make-network-connected","Solution"]]],[1320,"Minimum Distance to Type a Word Using Two Fingers","minimum-distance-to-type-a-word-using-two-fingers",0,[155,48],[["/practice/#minimum-distance-to-type-a-word-using-two-fingers","Solution"]]],[1321,"Restaurant Growth","restaurant-growth",1,[40],[["/practice/#restaurant-growth","Solution"]]],[1322,"Ads Performance","ads-performance",1,[40],[["/practice/#ads-performance","Solution"]]],[1323,"Maximum 69 Number","maximum-69-number",0,[68,95],[["/practice/#maximum-69-number","Solution"]]],[1324,"Print Words Vertically","print-words-vertically",0,[6,155,145],[["/practice/#print-words-vertically","Solution"]]],[1325,"Delete Leaves With a Given Value","delete-leaves-with-a-given-value",0,[168,41,16],[["/practice/#delete-leaves-with-a-given-value","Solution"]]],[1326,"Minimum Number of Taps to Open to Water a Garden","minimum-number-of-taps-to-open-to-water-a-garden",0,[68,6,48],[["/practice/#minimum-number-of-taps-to-open-to-water-a-garden","Solution"]]],[1327,"List the Products Ordered in a Period","list-the-products-ordered-in-a-period",1,[40],[["/practice/#list-the-products-ordered-in-a-period","Solution"]]],[1328,"Break a Palindrome","break-a-palindrome",0,[68,155],[["/practice/#break-a-palindrome","Solution"]]],[1329,"Sort the Matrix Diagonally","sort-the-matrix-diagonally",0,[6,96,150],[["/practice/#sort-the-matrix-diagonally","Solution"]]],[1330,"Reverse Subarray To Maximize Array Value","reverse-subarray-to-maximize-array-value",0,[68,6,95],[["/practice/#reverse-subarray-to-maximize-array-value","Solution"]]],[1331,"Rank Transform of an Array","rank-transform-of-an-array",0,[6,71,150],[["/practice/#rank-transform-of-an-array","Solution"]]],[1332,"Remove Palindromic Subsequences","remove-palindromic-subsequences",0,[172,155],[["/practice/#remove-palindromic-subsequences","Solution"]]],[1333,"Filter Restaurants by Vegan-Friendly, Price and Distance","filter-restaurants-by-vegan-friendly-price-and-distance",0,[6,150],[["/practice/#filter-restaurants-by-vegan-friendly-price-and-distance","Solution"]]],[1334,"Find the City With the Smallest Number of Neighbors at a Threshold Distance","find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance",0,[64,48,142,43,61,9],[["/practice/#find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance","Solution"]]],[1335,"Minimum Difficulty of a Job Schedule","minimum-difficulty-of-a-job-schedule",0,[6,48],[["/practice/#minimum-difficulty-of-a-job-schedule","Solution"]]],[1336,"Number of Transactions per Visit","number-of-transactions-per-visit",1,[40],[["/practice/#number-of-transactions-per-visit","Solution"]]],[1337,"The K Weakest Rows in a Matrix","the-k-weakest-rows-in-a-matrix",0,[6,14,96,150,72],[["/practice/#the-k-weakest-rows-in-a-matrix","Solution"]]],[1338,"Reduce Array Size to The Half","reduce-array-size-to-the-half",0,[68,6,71,150,72],[["/practice/#reduce-array-size-to-the-half","Solution"]]],[1339,"Maximum Product of Splitted Binary Tree","maximum-product-of-splitted-binary-tree",0,[168,41,16],[["/practice/#maximum-product-of-splitted-binary-tree","Solution"]]],[1340,"Jump Game V","jump-game-v",0,[6,48,150],[["/practice/#jump-game-v","Solution"]]],[1341,"Movie Rating","movie-rating",1,[40],[["/practice/#movie-rating","Solution"]]],[1342,"Number of Steps to Reduce a Number to Zero","number-of-steps-to-reduce-a-number-to-zero",0,[18,95],[["/practice/#number-of-steps-to-reduce-a-number-to-zero","Solution"]]],[1343,"Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold","number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold",0,[6,146],[["/practice/#number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold","Solution"]]],[1344,"Angle Between Hands of a Clock","angle-between-hands-of-a-clock",0,[95],[["/practice/#angle-between-hands-of-a-clock","Solution"]]],[1345,"Jump Game IV","jump-game-iv",0,[25,6,71],[["/practice/#jump-game-iv","Solution"]]],[1346,"Check If N and Its Double Exist","check-if-n-and-its-double-exist",0,[6,71,172,14,150],[["/practice/#check-if-n-and-its-double-exist","Solution"]]],[1347,"Minimum Number of Steps to Make Two Strings Anagram","minimum-number-of-steps-to-make-two-strings-anagram",0,[71,155,36],[["/practice/#minimum-number-of-steps-to-make-two-strings-anagram","Solution"]]],[1348,"Tweet Counts Per Frequency","tweet-counts-per-frequency",0,[42,71,155,14,113,150],[["/practice/#tweet-counts-per-frequency","Solution"]]],[1349,"Maximum Students Taking Exam","maximum-students-taking-exam",0,[18,6,48,19,96,102,17,97,66,98,49,44,93,127,109],[["/practice/#maximum-students-taking-exam","Solution"]]],[1350,"Students With Invalid Departments","students-with-invalid-departments",1,[40],[["/practice/#students-with-invalid-departments","Solution"]]],[1351,"Count Negative Numbers in a Sorted Matrix","count-negative-numbers-in-a-sorted-matrix",0,[6,14,96],[["/practice/#count-negative-numbers-in-a-sorted-matrix","Solution"]]],[1352,"Product of the Last K Numbers","product-of-the-last-k-numbers",0,[42,6,95,39,122],[["/practice/#product-of-the-last-k-numbers","Solution"]]],[1353,"Maximum Number of Events That Can Be Attended","maximum-number-of-events-that-can-be-attended",0,[68,6,150,72],[["/practice/#maximum-number-of-events-that-can-be-attended","Solution"]]],[1354,"Construct Target Array With Multiple Sums","construct-target-array-with-multiple-sums",0,[6,72],[["/practice/#construct-target-array-with-multiple-sums","Solution"]]],[1355,"Activity Participants","activity-participants",1,[40],[["/practice/#activity-participants","Solution"]]],[1356,"Sort Integers by The Number of 1 Bits","sort-integers-by-the-number-of-1-bits",0,[18,6,36,150],[["/practice/#sort-integers-by-the-number-of-1-bits","Solution"]]],[1357,"Apply Discount Every n Orders","apply-discount-every-n-orders",0,[42,6,71],[["/practice/#apply-discount-every-n-orders","Solution"]]],[1358,"Number of Substrings Containing All Three Characters","number-of-substrings-containing-all-three-characters",0,[71,155,146],[["/practice/#number-of-substrings-containing-all-three-characters","Solution"]]],[1359,"Count All Valid Pickup and Delivery Options","count-all-valid-pickup-and-delivery-options",0,[95,48,33],[["/practice/#count-all-valid-pickup-and-delivery-options","Solution"]]],[1360,"Number of Days Between Two Dates","number-of-days-between-two-dates",0,[95,155],[["/practice/#number-of-days-between-two-dates","Solution"]]],[1361,"Validate Binary Tree Nodes","validate-binary-tree-nodes",0,[168,41,25,174,64,16],[["/practice/#validate-binary-tree-nodes","Solution"]]],[1362,"Closest Divisors","closest-divisors",0,[95,125],[["/practice/#closest-divisors","Solution"]]],[1363,"Largest Multiple of Three","largest-multiple-of-three",0,[68,6,95,48,150],[["/practice/#largest-multiple-of-three","Solution"]]],[1364,"Number of Trusted Contacts of a Customer","number-of-trusted-contacts-of-a-customer",1,[40],[["/practice/#number-of-trusted-contacts-of-a-customer","Solution"]]],[1365,"How Many Numbers Are Smaller Than the Current Number","how-many-numbers-are-smaller-than-the-current-number",0,[6,71,37,150],[["/practice/#how-many-numbers-are-smaller-than-the-current-number","Solution"]]],[1366,"Rank Teams by Votes","rank-teams-by-votes",0,[6,71,155,36,150],[["/practice/#rank-teams-by-votes","Solution"]]],[1367,"Linked List in Binary Tree","linked-list-in-binary-tree",0,[168,41,88,16],[["/practice/#linked-list-in-binary-tree","Solution"]]],[1368,"Minimum Cost to Make at Least One Valid Path in a Grid","minimum-cost-to-make-at-least-one-valid-path-in-a-grid",0,[25,64,6,96,142,43,72,1],[["/patterns/weighted-shortest-paths/","Ch. 17"],["/practice/#minimum-cost-to-make-at-least-one-valid-path-in-a-grid","Solution"]]],[1369,"Get the Second Most Recent Activity","get-the-second-most-recent-activity",1,[40],[["/practice/#get-the-second-most-recent-activity","Solution"]]],[1370,"Increasing Decreasing String","increasing-decreasing-string",0,[71,155,36],[["/practice/#increasing-decreasing-string","Solution"]]],[1371,"Find the Longest Substring Containing Vowels in Even Counts","find-the-longest-substring-containing-vowels-in-even-counts",0,[18,71,155,122],[["/practice/#find-the-longest-substring-containing-vowels-in-even-counts","Solution"]]],[1372,"Longest ZigZag Path in a Binary Tree","longest-zigzag-path-in-a-binary-tree",0,[168,41,48,16,169],[["/practice/#longest-zigzag-path-in-a-binary-tree","Solution"]]],[1373,"Maximum Sum BST in Binary Tree","maximum-sum-bst-in-binary-tree",0,[168,41,15,48,16,169],[["/practice/#maximum-sum-bst-in-binary-tree","Solution"]]],[1374,"Generate a String With Characters That Have Odd Counts","generate-a-string-with-characters-that-have-odd-counts",0,[155],[["/practice/#generate-a-string-with-characters-that-have-odd-counts","Solution"]]],[1375,"Number of Times Binary String Is Prefix-Aligned","number-of-times-binary-string-is-prefix-aligned",0,[6],[["/practice/#number-of-times-binary-string-is-prefix-aligned","Solution"]]],[1376,"Time Needed to Inform All Employees","time-needed-to-inform-all-employees",0,[168,41,25],[["/practice/#time-needed-to-inform-all-employees","Solution"]]],[1377,"Frog Position After T Seconds","frog-position-after-t-seconds",0,[168,41,25,64],[["/practice/#frog-position-after-t-seconds","Solution"]]],[1378,"Replace Employee ID With The Unique Identifier","replace-employee-id-with-the-unique-identifier",1,[40],[["/practice/#replace-employee-id-with-the-unique-identifier","Solution"]]],[1379,"Find a Corresponding Node of a Binary Tree in a Clone of That Tree","find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree",0,[168,41,25,16],[["/practice/#find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree","Solution"]]],[1380,"Lucky Numbers in a Matrix","lucky-numbers-in-a-matrix",0,[6,96],[["/practice/#lucky-numbers-in-a-matrix","Solution"]]],[1381,"Design a Stack With Increment Operation","design-a-stack-with-increment-operation",0,[154,42,6],[["/practice/#design-a-stack-with-increment-operation","Solution"]]],[1382,"Balance a Binary Search Tree","balance-a-binary-search-tree",0,[68,168,41,15,46,16],[["/practice/#balance-a-binary-search-tree","Solution"]]],[1383,"Maximum Performance of a Team","maximum-performance-of-a-team",0,[68,6,150,72],[["/practice/#maximum-performance-of-a-team","Solution"]]],[1384,"Total Sales Amount by Year","total-sales-amount-by-year",1,[40],[["/practice/#total-sales-amount-by-year","Solution"]]],[1385,"Find the Distance Value Between Two Arrays","find-the-distance-value-between-two-arrays",0,[6,172,14,150],[["/practice/#find-the-distance-value-between-two-arrays","Solution"]]],[1386,"Cinema Seat Allocation","cinema-seat-allocation",0,[68,18,6,71],[["/practice/#cinema-seat-allocation","Solution"]]],[1387,"Sort Integers by The Power Value","sort-integers-by-the-power-value",0,[100,48,150],[["/practice/#sort-integers-by-the-power-value","Solution"]]],[1388,"Pizza With 3n Slices","pizza-with-3n-slices",0,[68,6,48,72],[["/practice/#pizza-with-3n-slices","Solution"]]],[1389,"Create Target Array in the Given Order","create-target-array-in-the-given-order",0,[6,145],[["/practice/#create-target-array-in-the-given-order","Solution"]]],[1390,"Four Divisors","four-divisors",0,[6,95,143,125],[["/practice/#four-divisors","Solution"]]],[1391,"Check if There is a Valid Path in a Grid","check-if-there-is-a-valid-path-in-a-grid",0,[41,25,174,6,96],[["/practice/#check-if-there-is-a-valid-path-in-a-grid","Solution"]]],[1392,"Longest Happy Prefix","longest-happy-prefix",0,[155,156,70,137,81,58],[["/practice/#longest-happy-prefix","Solution"]]],[1393,"Capital Gain/Loss","capital-gainloss",1,[40],[["/practice/#capital-gainloss","Solution"]]],[1394,"Find Lucky Integer in an Array","find-lucky-integer-in-an-array",0,[6,71,36],[["/practice/#find-lucky-integer-in-an-array","Solution"]]],[1395,"Count Number of Teams","count-number-of-teams",0,[12,139,6,48],[["/practice/#count-number-of-teams","Solution"]]],[1396,"Design Underground System","design-underground-system",0,[42,71,155],[["/practice/#design-underground-system","Solution"]]],[1397,"Find All Good Strings","find-all-good-strings",0,[155,48,156],[["/practice/#find-all-good-strings","Solution"]]],[1398,"Customers Who Bought Products A and B but Not C","customers-who-bought-products-a-and-b-but-not-c",1,[40],[["/practice/#customers-who-bought-products-a-and-b-but-not-c","Solution"]]],[1399,"Count Largest Group","count-largest-group",0,[71,95,36],[["/practice/#count-largest-group","Solution"]]],[1400,"Construct K Palindrome Strings","construct-k-palindrome-strings",0,[68,71,155,36],[["/practice/#construct-k-palindrome-strings","Solution"]]],[1401,"Circle and Rectangle Overlapping","circle-and-rectangle-overlapping",0,[63,95],[["/practice/#circle-and-rectangle-overlapping","Solution"]]],[1402,"Reducing Dishes","reducing-dishes",0,[68,6,48,150],[["/practice/#reducing-dishes","Solution"]]],[1403,"Minimum Subsequence in Non-Increasing Order","minimum-subsequence-in-non-increasing-order",0,[68,6,150],[["/practice/#minimum-subsequence-in-non-increasing-order","Solution"]]],[1404,"Number of Steps to Reduce a Number in Binary Representation to One","number-of-steps-to-reduce-a-number-in-binary-representation-to-one",0,[18,155,145],[["/practice/#number-of-steps-to-reduce-a-number-in-binary-representation-to-one","Solution"]]],[1405,"Longest Happy String","longest-happy-string",0,[68,155,72],[["/practice/#longest-happy-string","Solution"]]],[1406,"Stone Game III","stone-game-iii",0,[104,6,95,48,62,175],[["/practice/#stone-game-iii","Solution"]]],[1407,"Top Travellers","top-travellers",1,[40],[["/practice/#top-travellers","Solution"]]],[1408,"String Matching in an Array","string-matching-in-an-array",0,[6,155,156],[["/practice/#string-matching-in-an-array","Solution"]]],[1409,"Queries on a Permutation With Key","queries-on-a-permutation-with-key",0,[12,6,145,153],[["/practice/#queries-on-a-permutation-with-key","Solution"]]],[1410,"HTML Entity Parser","html-entity-parser",0,[71,155],[["/practice/#html-entity-parser","Solution"]]],[1411,"Number of Ways to Paint N × 3 Grid","number-of-ways-to-paint-n-3-grid",0,[48,65],[["/practice/#number-of-ways-to-paint-n-3-grid","Solution"]]],[1412,"Find the Quiet Students in All Exams","find-the-quiet-students-in-all-exams",1,[40],[["/practice/#find-the-quiet-students-in-all-exams","Solution"]]],[1413,"Minimum Value to Get Positive Step by Step Sum","minimum-value-to-get-positive-step-by-step-sum",0,[6,122],[["/practice/#minimum-value-to-get-positive-step-by-step-sum","Solution"]]],[1414,"Find the Minimum Number of Fibonacci Numbers Whose Sum Is K","find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k",0,[68,95],[["/practice/#find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k","Solution"]]],[1415,"The k-th Lexicographical String of All Happy Strings of Length n","the-k-th-lexicographical-string-of-all-happy-strings-of-length-n",0,[155,8],[["/practice/#the-k-th-lexicographical-string-of-all-happy-strings-of-length-n","Solution"]]],[1416,"Restore The Array","restore-the-array",0,[155,48],[["/practice/#restore-the-array","Solution"]]],[1417,"Reformat The String","reformat-the-string",0,[155],[["/practice/#reformat-the-string","Solution"]]],[1418,"Display Table of Food Orders in a Restaurant","display-table-of-food-orders-in-a-restaurant",0,[6,71,155,113,150],[["/practice/#display-table-of-food-orders-in-a-restaurant","Solution"]]],[1419,"Minimum Number of Frogs Croaking","minimum-number-of-frogs-croaking",0,[155,36],[["/practice/#minimum-number-of-frogs-croaking","Solution"]]],[1420,"Build Array Where You Can Find The Maximum Exactly K Comparisons","build-array-where-you-can-find-the-maximum-exactly-k-comparisons",0,[48,122],[["/practice/#build-array-where-you-can-find-the-maximum-exactly-k-comparisons","Solution"]]],[1421,"NPV Queries","npv-queries",1,[40],[["/practice/#npv-queries","Solution"]]],[1422,"Maximum Score After Splitting a String","maximum-score-after-splitting-a-string",0,[155,122],[["/practice/#maximum-score-after-splitting-a-string","Solution"]]],[1423,"Maximum Points You Can Obtain from Cards","maximum-points-you-can-obtain-from-cards",0,[6,122,146],[["/practice/#maximum-points-you-can-obtain-from-cards","Solution"]]],[1424,"Diagonal Traverse II","diagonal-traverse-ii",0,[6,150,72],[["/practice/#diagonal-traverse-ii","Solution"]]],[1425,"Constrained Subsequence Sum","constrained-subsequence-sum",0,[128,6,48,146,107,72],[["/practice/#constrained-subsequence-sum","Solution"]]],[1426,"Counting Elements","counting-elements",0,[6,71],[["/practice/#counting-elements","Solution"]]],[1427,"Perform String Shifts","perform-string-shifts",0,[6,95,155],[["/practice/#perform-string-shifts","Solution"]]],[1428,"Leftmost Column with at Least a One","leftmost-column-with-at-least-a-one",0,[6,14,77,96],[["/practice/#leftmost-column-with-at-least-a-one","Solution"]]],[1429,"First Unique Number","first-unique-number",0,[42,128,6,71,39],[["/practice/#first-unique-number","Solution"]]],[1430,"Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree","check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree",0,[168,41,25,16],[["/practice/#check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree","Solution"]]],[1431,"Kids With the Greatest Number of Candies","kids-with-the-greatest-number-of-candies",0,[6],[["/practice/#kids-with-the-greatest-number-of-candies","Solution"]]],[1432,"Max Difference You Can Get From Changing an Integer","max-difference-you-can-get-from-changing-an-integer",0,[68,95],[["/practice/#max-difference-you-can-get-from-changing-an-integer","Solution"]]],[1433,"Check If a String Can Break Another String","check-if-a-string-can-break-another-string",0,[68,155,150],[["/practice/#check-if-a-string-can-break-another-string","Solution"]]],[1434,"Number of Ways to Wear Different Hats to Each Other","number-of-ways-to-wear-different-hats-to-each-other",0,[18,6,48,19,17,66,117],[["/practice/#number-of-ways-to-wear-different-hats-to-each-other","Solution"]]],[1435,"Create a Session Bar Chart","create-a-session-bar-chart",1,[40],[["/practice/#create-a-session-bar-chart","Solution"]]],[1436,"Destination City","destination-city",0,[6,71,155],[["/practice/#destination-city","Solution"]]],[1437,"Check If All 1's Are at Least Length K Places Away","check-if-all-1s-are-at-least-length-k-places-away",0,[6],[["/practice/#check-if-all-1s-are-at-least-length-k-places-away","Solution"]]],[1438,"Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit","longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit",0,[128,6,113,146,107,72],[["/practice/#longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit","Solution"]]],[1439,"Find the Kth Smallest Sum of a Matrix With Sorted Rows","find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows",0,[6,14,96,72],[["/practice/#find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows","Solution"]]],[1440,"Evaluate Boolean Expression","evaluate-boolean-expression",1,[40],[["/practice/#evaluate-boolean-expression","Solution"]]],[1441,"Build an Array With Stack Operations","build-an-array-with-stack-operations",0,[154,6,145],[["/practice/#build-an-array-with-stack-operations","Solution"]]],[1442,"Count Triplets That Can Form Two Arrays of Equal XOR","count-triplets-that-can-form-two-arrays-of-equal-xor",0,[18,6,71,95,122],[["/practice/#count-triplets-that-can-form-two-arrays-of-equal-xor","Solution"]]],[1443,"Minimum Time to Collect All Apples in a Tree","minimum-time-to-collect-all-apples-in-a-tree",0,[168,41,25,71,169],[["/practice/#minimum-time-to-collect-all-apples-in-a-tree","Solution"]]],[1444,"Number of Ways of Cutting a Pizza","number-of-ways-of-cutting-a-pizza",0,[100,6,48,96,122],[["/practice/#number-of-ways-of-cutting-a-pizza","Solution"]]],[1445,"Apples & Oranges","apples-oranges",1,[40],[["/practice/#apples-oranges","Solution"]]],[1446,"Consecutive Characters","consecutive-characters",0,[155],[["/practice/#consecutive-characters","Solution"]]],[1447,"Simplified Fractions","simplified-fractions",0,[95,155,67,112,51],[["/practice/#simplified-fractions","Solution"]]],[1448,"Count Good Nodes in Binary Tree","count-good-nodes-in-binary-tree",0,[168,41,25,16],[["/practice/#count-good-nodes-in-binary-tree","Solution"]]],[1449,"Form Largest Integer With Digits That Add up to Target","form-largest-integer-with-digits-that-add-up-to-target",0,[6,48,82,173],[["/practice/#form-largest-integer-with-digits-that-add-up-to-target","Solution"]]],[1450,"Number of Students Doing Homework at a Given Time","number-of-students-doing-homework-at-a-given-time",0,[6],[["/practice/#number-of-students-doing-homework-at-a-given-time","Solution"]]],[1451,"Rearrange Words in a Sentence","rearrange-words-in-a-sentence",0,[155,150],[["/practice/#rearrange-words-in-a-sentence","Solution"]]],[1452,"People Whose List of Favorite Companies Is Not a Subset of Another List","people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list",0,[6,71,155],[["/practice/#people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list","Solution"]]],[1453,"Maximum Number of Darts Inside of a Circular Dartboard","maximum-number-of-darts-inside-of-a-circular-dartboard",0,[63,6,95],[["/practice/#maximum-number-of-darts-inside-of-a-circular-dartboard","Solution"]]],[1454,"Active Users","active-users",1,[40],[["/practice/#active-users","Solution"]]],[1455,"Check If a Word Occurs As a Prefix of Any Word in a Sentence","check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence",0,[172,155,156],[["/practice/#check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence","Solution"]]],[1456,"Maximum Number of Vowels in a Substring of Given Length","maximum-number-of-vowels-in-a-substring-of-given-length",0,[155,146],[["/practice/#maximum-number-of-vowels-in-a-substring-of-given-length","Solution"]]],[1457,"Pseudo-Palindromic Paths in a Binary Tree","pseudo-palindromic-paths-in-a-binary-tree",0,[18,168,41,25,16],[["/practice/#pseudo-palindromic-paths-in-a-binary-tree","Solution"]]],[1458,"Max Dot Product of Two Subsequences","max-dot-product-of-two-subsequences",0,[6,48,89],[["/practice/#max-dot-product-of-two-subsequences","Solution"]]],[1459,"Rectangles Area","rectangles-area",1,[40],[["/practice/#rectangles-area","Solution"]]],[1460,"Make Two Arrays Equal by Reversing Subarrays","make-two-arrays-equal-by-reversing-subarrays",0,[6,71,150],[["/practice/#make-two-arrays-equal-by-reversing-subarrays","Solution"]]],[1461,"Check If a String Contains All Binary Codes of Size K","check-if-a-string-contains-all-binary-codes-of-size-k",0,[18,71,155,45,70,137],[["/practice/#check-if-a-string-contains-all-binary-codes-of-size-k","Solution"]]],[1462,"Course Schedule IV","course-schedule-iv",0,[41,25,64,165],[["/practice/#course-schedule-iv","Solution"]]],[1463,"Cherry Pickup II","cherry-pickup-ii",0,[6,48,96],[["/practice/#cherry-pickup-ii","Solution"]]],[1464,"Maximum Product of Two Elements in an Array","maximum-product-of-two-elements-in-an-array",0,[6,150,72],[["/practice/#maximum-product-of-two-elements-in-an-array","Solution"]]],[1465,"Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts","maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts",0,[68,6,150],[["/practice/#maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts","Solution"]]],[1466,"Reorder Routes to Make All Paths Lead to the City Zero","reorder-routes-to-make-all-paths-lead-to-the-city-zero",0,[41,25,64],[["/practice/#reorder-routes-to-make-all-paths-lead-to-the-city-zero","Solution"]]],[1467,"Probability of a Two Boxes Having The Same Number of Distinct Balls","probability-of-a-two-boxes-having-the-same-number-of-distinct-balls",0,[6,95,48,8,33,126],[["/practice/#probability-of-a-two-boxes-having-the-same-number-of-distinct-balls","Solution"]]],[1468,"Calculate Salaries","calculate-salaries",1,[40],[["/practice/#calculate-salaries","Solution"]]],[1469,"Find All The Lonely Nodes","find-all-the-lonely-nodes",0,[168,41,25,16],[["/practice/#find-all-the-lonely-nodes","Solution"]]],[1470,"Shuffle the Array","shuffle-the-array",0,[6],[["/practice/#shuffle-the-array","Solution"]]],[1471,"The k Strongest Values in an Array","the-k-strongest-values-in-an-array",0,[6,172,150],[["/practice/#the-k-strongest-values-in-an-array","Solution"]]],[1472,"Design Browser History","design-browser-history",0,[154,42,6,88,39,47],[["/practice/#design-browser-history","Solution"]]],[1473,"Paint House III","paint-house-iii",0,[6,48],[["/practice/#paint-house-iii","Solution"]]],[1474,"Delete N Nodes After M Nodes of a Linked List","delete-n-nodes-after-m-nodes-of-a-linked-list",0,[88],[["/practice/#delete-n-nodes-after-m-nodes-of-a-linked-list","Solution"]]],[1475,"Final Prices With a Special Discount in a Shop","final-prices-with-a-special-discount-in-a-shop",0,[154,6,108],[["/practice/#final-prices-with-a-special-discount-in-a-shop","Solution"]]],[1476,"Subrectangle Queries","subrectangle-queries",0,[42,6,96],[["/practice/#subrectangle-queries","Solution"]]],[1477,"Find Two Non-overlapping Sub-arrays Each With Target Sum","find-two-non-overlapping-sub-arrays-each-with-target-sum",0,[6,71,14,48,146],[["/practice/#find-two-non-overlapping-sub-arrays-each-with-target-sum","Solution"]]],[1478,"Allocate Mailboxes","allocate-mailboxes",0,[6,95,48,150],[["/practice/#allocate-mailboxes","Solution"]]],[1479,"Sales by Day of the Week","sales-by-day-of-the-week",1,[40],[["/practice/#sales-by-day-of-the-week","Solution"]]],[1480,"Running Sum of 1d Array","running-sum-of-1d-array",0,[6,122],[["/practice/#running-sum-of-1d-array","Solution"]]],[1481,"Least Number of Unique Integers after K Removals","least-number-of-unique-integers-after-k-removals",0,[68,6,71,36,150],[["/practice/#least-number-of-unique-integers-after-k-removals","Solution"]]],[1482,"Minimum Number of Days to Make m Bouquets","minimum-number-of-days-to-make-m-bouquets",0,[6,14],[["/practice/#minimum-number-of-days-to-make-m-bouquets","Solution"]]],[1483,"Kth Ancestor of a Tree Node","kth-ancestor-of-a-tree-node",0,[18,168,41,25,42,14,48,13],[["/practice/#kth-ancestor-of-a-tree-node","Solution"]]],[1484,"Group Sold Products By The Date","group-sold-products-by-the-date",1,[40],[["/practice/#group-sold-products-by-the-date","Solution"]]],[1485,"Clone Binary Tree With Random Pointer","clone-binary-tree-with-random-pointer",0,[168,41,25,71,16],[["/practice/#clone-binary-tree-with-random-pointer","Solution"]]],[1486,"XOR Operation in an Array","xor-operation-in-an-array",0,[18,95],[["/practice/#xor-operation-in-an-array","Solution"]]],[1487,"Making File Names Unique","making-file-names-unique",0,[6,71,155],[["/practice/#making-file-names-unique","Solution"]]],[1488,"Avoid Flood in The City","avoid-flood-in-the-city",0,[68,6,71,14,72],[["/practice/#avoid-flood-in-the-city","Solution"]]],[1489,"Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree","find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree",0,[174,64,84,105,123,150,157,20],[["/practice/#find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree","Solution"]]],[1490,"Clone N-ary Tree","clone-n-ary-tree",0,[168,41,25,71],[["/practice/#clone-n-ary-tree","Solution"]]],[1491,"Average Salary Excluding the Minimum and Maximum Salary","average-salary-excluding-the-minimum-and-maximum-salary",0,[6,150],[["/practice/#average-salary-excluding-the-minimum-and-maximum-salary","Solution"]]],[1492,"The kth Factor of n","the-kth-factor-of-n",0,[95,112,125],[["/practice/#the-kth-factor-of-n","Solution"]]],[1493,"Longest Subarray of 1's After Deleting One Element","longest-subarray-of-1s-after-deleting-one-element",0,[6,48,146],[["/practice/#longest-subarray-of-1s-after-deleting-one-element","Solution"]]],[1494,"Parallel Courses II","parallel-courses-ii",0,[18,64,48,19,45],[["/practice/#parallel-courses-ii","Solution"]]],[1495,"Friendly Movies Streamed Last Month","friendly-movies-streamed-last-month",1,[40],[["/practice/#friendly-movies-streamed-last-month","Solution"]]],[1496,"Path Crossing","path-crossing",0,[71,155],[["/practice/#path-crossing","Solution"]]],[1497,"Check If Array Pairs Are Divisible by k","check-if-array-pairs-are-divisible-by-k",0,[6,71,36],[["/practice/#check-if-array-pairs-are-divisible-by-k","Solution"]]],[1498,"Number of Subsequences That Satisfy the Given Sum Condition","number-of-subsequences-that-satisfy-the-given-sum-condition",0,[6,172,14,150],[["/practice/#number-of-subsequences-that-satisfy-the-given-sum-condition","Solution"]]],[1499,"Max Value of Equation","max-value-of-equation",0,[128,6,146,107,72],[["/practice/#max-value-of-equation","Solution"]]],[1500,"Design a File Sharing System","design-a-file-sharing-system",0,[42,71,39,150,72],[["/practice/#design-a-file-sharing-system","Solution"]]],[1501,"Countries You Can Safely Invest In","countries-you-can-safely-invest-in",1,[40],[["/practice/#countries-you-can-safely-invest-in","Solution"]]],[1502,"Can Make Arithmetic Progression From Sequence","can-make-arithmetic-progression-from-sequence",0,[6,150],[["/practice/#can-make-arithmetic-progression-from-sequence","Solution"]]],[1503,"Last Moment Before All Ants Fall Out of a Plank","last-moment-before-all-ants-fall-out-of-a-plank",0,[24,6,145],[["/practice/#last-moment-before-all-ants-fall-out-of-a-plank","Solution"]]],[1504,"Count Submatrices With All Ones","count-submatrices-with-all-ones",0,[154,6,48,96,108],[["/practice/#count-submatrices-with-all-ones","Solution"]]],[1505,"Minimum Possible Integer After at Most K Adjacent Swaps On Digits","minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits",0,[68,12,139,155],[["/practice/#minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits","Solution"]]],[1506,"Find Root of N-Ary Tree","find-root-of-n-ary-tree",0,[18,168,41,71],[["/practice/#find-root-of-n-ary-tree","Solution"]]],[1507,"Reformat Date","reformat-date",0,[155],[["/practice/#reformat-date","Solution"]]],[1508,"Range Sum of Sorted Subarray Sums","range-sum-of-sorted-subarray-sums",0,[6,172,14,122,150],[["/practice/#range-sum-of-sorted-subarray-sums","Solution"]]],[1509,"Minimum Difference Between Largest and Smallest Value in Three Moves","minimum-difference-between-largest-and-smallest-value-in-three-moves",0,[68,6,150],[["/practice/#minimum-difference-between-largest-and-smallest-value-in-three-moves","Solution"]]],[1510,"Stone Game IV","stone-game-iv",0,[104,95,48,62,111,0,175],[["/practice/#stone-game-iv","Solution"]]],[1511,"Customer Order Frequency","customer-order-frequency",1,[40],[["/practice/#customer-order-frequency","Solution"]]],[1512,"Number of Good Pairs","number-of-good-pairs",0,[6,71,95,36],[["/practice/#number-of-good-pairs","Solution"]]],[1513,"Number of Substrings With Only 1s","number-of-substrings-with-only-1s",0,[95,155],[["/practice/#number-of-substrings-with-only-1s","Solution"]]],[1514,"Path with Maximum Probability","path-with-maximum-probability",0,[64,6,142,43,72],[["/practice/#path-with-maximum-probability","Solution"]]],[1515,"Best Position for a Service Centre","best-position-for-a-service-centre",0,[63,6,95,132],[["/practice/#best-position-for-a-service-centre","Solution"]]],[1516,"Move Sub-Tree of N-Ary Tree","move-sub-tree-of-n-ary-tree",0,[168,41],[["/practice/#move-sub-tree-of-n-ary-tree","Solution"]]],[1517,"Find Users With Valid E-Mails","find-users-with-valid-e-mails",1,[40],[["/practice/#find-users-with-valid-e-mails","Solution"]]],[1518,"Water Bottles","water-bottles",0,[95,145],[["/practice/#water-bottles","Solution"]]],[1519,"Number of Nodes in the Sub-Tree With the Same Label","number-of-nodes-in-the-sub-tree-with-the-same-label",0,[168,41,25,71,36,169],[["/practice/#number-of-nodes-in-the-sub-tree-with-the-same-label","Solution"]]],[1520,"Maximum Number of Non-Overlapping Substrings","maximum-number-of-non-overlapping-substrings",0,[68,71,155,150],[["/practice/#maximum-number-of-non-overlapping-substrings","Solution"]]],[1521,"Find a Value of a Mysterious Function Closest to Target","find-a-value-of-a-mysterious-function-closest-to-target",0,[18,139,6,14,151],[["/practice/#find-a-value-of-a-mysterious-function-closest-to-target","Solution"]]],[1522,"Diameter of N-Ary Tree","diameter-of-n-ary-tree",0,[168,41,169],[["/practice/#diameter-of-n-ary-tree","Solution"]]],[1523,"Count Odd Numbers in an Interval Range","count-odd-numbers-in-an-interval-range",0,[95],[["/practice/#count-odd-numbers-in-an-interval-range","Solution"]]],[1524,"Number of Sub-arrays With Odd Sum","number-of-sub-arrays-with-odd-sum",0,[6,95,48,122],[["/practice/#number-of-sub-arrays-with-odd-sum","Solution"]]],[1525,"Number of Good Ways to Split a String","number-of-good-ways-to-split-a-string",0,[18,71,155,48,122],[["/practice/#number-of-good-ways-to-split-a-string","Solution"]]],[1526,"Minimum Number of Increments on Subarrays to Form a Target Array","minimum-number-of-increments-on-subarrays-to-form-a-target-array",0,[154,68,6,48,108],[["/practice/#minimum-number-of-increments-on-subarrays-to-form-a-target-array","Solution"]]],[1527,"Patients With a Condition","patients-with-a-condition",1,[40],[["/practice/#patients-with-a-condition","Solution"]]],[1528,"Shuffle String","shuffle-string",0,[6,155],[["/practice/#shuffle-string","Solution"]]],[1529,"Minimum Suffix Flips","minimum-suffix-flips",0,[68,155],[["/practice/#minimum-suffix-flips","Solution"]]],[1530,"Number of Good Leaf Nodes Pairs","number-of-good-leaf-nodes-pairs",0,[168,41,16,169],[["/practice/#number-of-good-leaf-nodes-pairs","Solution"]]],[1531,"String Compression II","string-compression-ii",0,[155,48],[["/practice/#string-compression-ii","Solution"]]],[1532,"The Most Recent Three Orders","the-most-recent-three-orders",1,[40],[["/practice/#the-most-recent-three-orders","Solution"]]],[1533,"Find the Index of the Large Integer","find-the-index-of-the-large-integer",0,[6,14,77],[["/practice/#find-the-index-of-the-large-integer","Solution"]]],[1534,"Count Good Triplets","count-good-triplets",0,[6,50],[["/practice/#count-good-triplets","Solution"]]],[1535,"Find the Winner of an Array Game","find-the-winner-of-an-array-game",0,[6,145],[["/practice/#find-the-winner-of-an-array-game","Solution"]]],[1536,"Minimum Swaps to Arrange a Binary Grid","minimum-swaps-to-arrange-a-binary-grid",0,[68,6,96],[["/practice/#minimum-swaps-to-arrange-a-binary-grid","Solution"]]],[1537,"Get the Maximum Score","get-the-maximum-score",0,[68,6,172,48],[["/practice/#get-the-maximum-score","Solution"]]],[1538,"Guess the Majority in a Hidden Array","guess-the-majority-in-a-hidden-array",0,[6,95,77,22],[["/practice/#guess-the-majority-in-a-hidden-array","Solution"]]],[1539,"Kth Missing Positive Number","kth-missing-positive-number",0,[6,14],[["/practice/#kth-missing-positive-number","Solution"]]],[1540,"Can Convert String in K Moves","can-convert-string-in-k-moves",0,[71,155],[["/practice/#can-convert-string-in-k-moves","Solution"]]],[1541,"Minimum Insertions to Balance a Parentheses String","minimum-insertions-to-balance-a-parentheses-string",0,[154,68,155,116],[["/practice/#minimum-insertions-to-balance-a-parentheses-string","Solution"]]],[1542,"Find Longest Awesome Substring","find-longest-awesome-substring",0,[18,71,155],[["/practice/#find-longest-awesome-substring","Solution"]]],[1543,"Fix Product Name Format","fix-product-name-format",1,[40],[["/practice/#fix-product-name-format","Solution"]]],[1544,"Make The String Great","make-the-string-great",0,[154,155],[["/practice/#make-the-string-great","Solution"]]],[1545,"Find Kth Bit in Nth Binary String","find-kth-bit-in-nth-binary-string",0,[134,155,145],[["/practice/#find-kth-bit-in-nth-binary-string","Solution"]]],[1546,"Maximum Number of Non-Overlapping Subarrays With Sum Equals Target","maximum-number-of-non-overlapping-subarrays-with-sum-equals-target",0,[68,6,71,122],[["/practice/#maximum-number-of-non-overlapping-subarrays-with-sum-equals-target","Solution"]]],[1547,"Minimum Cost to Cut a Stick","minimum-cost-to-cut-a-stick",0,[6,48,150],[["/practice/#minimum-cost-to-cut-a-stick","Solution"]]],[1548,"The Most Similar Path in a Graph","the-most-similar-path-in-a-graph",0,[64,6,155,48],[["/practice/#the-most-similar-path-in-a-graph","Solution"]]],[1549,"The Most Recent Orders for Each Product","the-most-recent-orders-for-each-product",1,[40],[["/practice/#the-most-recent-orders-for-each-product","Solution"]]],[1550,"Three Consecutive Odds","three-consecutive-odds",0,[6],[["/practice/#three-consecutive-odds","Solution"]]],[1551,"Minimum Operations to Make Array Equal","minimum-operations-to-make-array-equal",0,[95],[["/practice/#minimum-operations-to-make-array-equal","Solution"]]],[1552,"Magnetic Force Between Two Balls","magnetic-force-between-two-balls",0,[6,14,150],[["/practice/#magnetic-force-between-two-balls","Solution"]]],[1553,"Minimum Number of Days to Eat N Oranges","minimum-number-of-days-to-eat-n-oranges",0,[100,48],[["/practice/#minimum-number-of-days-to-eat-n-oranges","Solution"]]],[1554,"Strings Differ by One Character","strings-differ-by-one-character",0,[71,155,70,137],[["/practice/#strings-differ-by-one-character","Solution"]]],[1555,"Bank Account Summary","bank-account-summary",1,[40],[["/practice/#bank-account-summary","Solution"]]],[1556,"Thousand Separator","thousand-separator",0,[155],[["/practice/#thousand-separator","Solution"]]],[1557,"Minimum Number of Vertices to Reach All Nodes","minimum-number-of-vertices-to-reach-all-nodes",0,[64,45],[["/practice/#minimum-number-of-vertices-to-reach-all-nodes","Solution"]]],[1558,"Minimum Numbers of Function Calls to Make Target Array","minimum-numbers-of-function-calls-to-make-target-array",0,[68,18,6],[["/practice/#minimum-numbers-of-function-calls-to-make-target-array","Solution"]]],[1559,"Detect Cycles in 2D Grid","detect-cycles-in-2d-grid",0,[41,25,174,6,96],[["/practice/#detect-cycles-in-2d-grid","Solution"]]],[1560,"Most Visited Sector in  a Circular Track","most-visited-sector-in-a-circular-track",0,[6,145],[["/practice/#most-visited-sector-in-a-circular-track","Solution"]]],[1561,"Maximum Number of Coins You Can Get","maximum-number-of-coins-you-can-get",0,[68,6,95,62,150],[["/practice/#maximum-number-of-coins-you-can-get","Solution"]]],[1562,"Find Latest Group of Size M","find-latest-group-of-size-m",0,[6,71,14,145],[["/practice/#find-latest-group-of-size-m","Solution"]]],[1563,"Stone Game V","stone-game-v",0,[6,95,48,62],[["/practice/#stone-game-v","Solution"]]],[1564,"Put Boxes Into the Warehouse I","put-boxes-into-the-warehouse-i",0,[68,6,150],[["/practice/#put-boxes-into-the-warehouse-i","Solution"]]],[1565,"Unique Orders and Customers Per Month","unique-orders-and-customers-per-month",1,[40],[["/practice/#unique-orders-and-customers-per-month","Solution"]]],[1566,"Detect Pattern of Length M Repeated K or More Times","detect-pattern-of-length-m-repeated-k-or-more-times",0,[6,50],[["/practice/#detect-pattern-of-length-m-repeated-k-or-more-times","Solution"]]],[1567,"Maximum Length of Subarray With Positive Product","maximum-length-of-subarray-with-positive-product",0,[68,6,48],[["/practice/#maximum-length-of-subarray-with-positive-product","Solution"]]],[1568,"Minimum Number of Days to Disconnect Island","minimum-number-of-days-to-disconnect-island",0,[41,25,6,96,7,157],[["/practice/#minimum-number-of-days-to-disconnect-island","Solution"]]],[1569,"Number of Ways to Reorder Array to Get Same BST","number-of-ways-to-reorder-array-to-get-same-bst",0,[168,174,15,100,6,95,46,48,16,33,59],[["/practice/#number-of-ways-to-reorder-array-to-get-same-bst","Solution"]]],[1570,"Dot Product of Two Sparse Vectors","dot-product-of-two-sparse-vectors",0,[42,6,71,172,87],[["/practice/#dot-product-of-two-sparse-vectors","Solution"]]],[1571,"Warehouse Manager","warehouse-manager",1,[40],[["/practice/#warehouse-manager","Solution"]]],[1572,"Matrix Diagonal Sum","matrix-diagonal-sum",0,[6,96],[["/practice/#matrix-diagonal-sum","Solution"]]],[1573,"Number of Ways to Split a String","number-of-ways-to-split-a-string",0,[95,155],[["/practice/#number-of-ways-to-split-a-string","Solution"]]],[1574,"Shortest Subarray to be Removed to Make Array Sorted","shortest-subarray-to-be-removed-to-make-array-sorted",0,[154,6,172,14,108],[["/practice/#shortest-subarray-to-be-removed-to-make-array-sorted","Solution"]]],[1575,"Count All Possible Routes","count-all-possible-routes",0,[100,6,48],[["/practice/#count-all-possible-routes","Solution"]]],[1576,"Replace All ?'s to Avoid Consecutive Repeating Characters","replace-all-s-to-avoid-consecutive-repeating-characters",0,[155],[["/practice/#replace-all-s-to-avoid-consecutive-repeating-characters","Solution"]]],[1577,"Number of Ways Where Square of Number Is Equal to Product of Two Numbers","number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers",0,[6,71,95,172],[["/practice/#number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers","Solution"]]],[1578,"Minimum Time to Make Rope Colorful","minimum-time-to-make-rope-colorful",0,[68,6,155,48],[["/practice/#minimum-time-to-make-rope-colorful","Solution"]]],[1579,"Remove Max Number of Edges to Keep Graph Fully Traversable","remove-max-number-of-edges-to-keep-graph-fully-traversable",0,[174,64],[["/practice/#remove-max-number-of-edges-to-keep-graph-fully-traversable","Solution"]]],[1580,"Put Boxes Into the Warehouse II","put-boxes-into-the-warehouse-ii",0,[68,6,150],[["/practice/#put-boxes-into-the-warehouse-ii","Solution"]]],[1581,"Customer Who Visited but Did Not Make Any Transactions","customer-who-visited-but-did-not-make-any-transactions",1,[40],[["/practice/#customer-who-visited-but-did-not-make-any-transactions","Solution"]]],[1582,"Special Positions in a Binary Matrix","special-positions-in-a-binary-matrix",0,[6,96],[["/practice/#special-positions-in-a-binary-matrix","Solution"]]],[1583,"Count Unhappy Friends","count-unhappy-friends",0,[6,145],[["/practice/#count-unhappy-friends","Solution"]]],[1584,"Min Cost to Connect All Points","min-cost-to-connect-all-points",0,[174,64,6,84,105,123,20],[["/practice/#min-cost-to-connect-all-points","Solution"]]],[1585,"Check If String Is Transformable With Substring Sort Operations","check-if-string-is-transformable-with-substring-sort-operations",0,[68,155,150],[["/practice/#check-if-string-is-transformable-with-substring-sort-operations","Solution"]]],[1586,"Binary Search Tree Iterator II","binary-search-tree-iterator-ii",0,[154,168,42,15,16,78],[["/practice/#binary-search-tree-iterator-ii","Solution"]]],[1587,"Bank Account Summary II","bank-account-summary-ii",1,[40],[["/practice/#bank-account-summary-ii","Solution"]]],[1588,"Sum of All Odd Length Subarrays","sum-of-all-odd-length-subarrays",0,[6,95,122],[["/practice/#sum-of-all-odd-length-subarrays","Solution"]]],[1589,"Maximum Sum Obtained of Any Permutation","maximum-sum-obtained-of-any-permutation",0,[68,6,122,150],[["/practice/#maximum-sum-obtained-of-any-permutation","Solution"]]],[1590,"Make Sum Divisible by P","make-sum-divisible-by-p",0,[6,71,122],[["/practice/#make-sum-divisible-by-p","Solution"]]],[1591,"Strange Printer II","strange-printer-ii",0,[64,165,6,45,96],[["/practice/#strange-printer-ii","Solution"]]],[1592,"Rearrange Spaces Between Words","rearrange-spaces-between-words",0,[155],[["/practice/#rearrange-spaces-between-words","Solution"]]],[1593,"Split a String Into the Max Number of Unique Substrings","split-a-string-into-the-max-number-of-unique-substrings",0,[71,155,8],[["/practice/#split-a-string-into-the-max-number-of-unique-substrings","Solution"]]],[1594,"Maximum Non Negative Product in a Matrix","maximum-non-negative-product-in-a-matrix",0,[6,48,96],[["/practice/#maximum-non-negative-product-in-a-matrix","Solution"]]],[1595,"Minimum Cost to Connect Two Groups of Points","minimum-cost-to-connect-two-groups-of-points",0,[18,6,48,19,96,17,66,103,138,109],[["/practice/#minimum-cost-to-connect-two-groups-of-points","Solution"]]],[1596,"The Most Frequently Ordered Products for Each Customer","the-most-frequently-ordered-products-for-each-customer",1,[40],[["/practice/#the-most-frequently-ordered-products-for-each-customer","Solution"]]],[1597,"Build Binary Expression Tree From Infix Expression","build-binary-expression-tree-from-infix-expression",0,[154,168,155,16],[["/practice/#build-binary-expression-tree-from-infix-expression","Solution"]]],[1598,"Crawler Log Folder","crawler-log-folder",0,[154,6,155],[["/practice/#crawler-log-folder","Solution"]]],[1599,"Maximum Profit of Operating a Centennial Wheel","maximum-profit-of-operating-a-centennial-wheel",0,[6,145],[["/practice/#maximum-profit-of-operating-a-centennial-wheel","Solution"]]],[1600,"Throne Inheritance","throne-inheritance",0,[168,41,42,71],[["/practice/#throne-inheritance","Solution"]]],[1601,"Maximum Number of Achievable Transfer Requests","maximum-number-of-achievable-transfer-requests",0,[18,6,8,50],[["/practice/#maximum-number-of-achievable-transfer-requests","Solution"]]],[1602,"Find Nearest Right Node in Binary Tree","find-nearest-right-node-in-binary-tree",0,[168,25,16],[["/practice/#find-nearest-right-node-in-binary-tree","Solution"]]],[1603,"Design Parking System","design-parking-system",0,[42,36,145],[["/practice/#design-parking-system","Solution"]]],[1604,"Alert Using Same Key-Card Three or More Times in a One Hour Period","alert-using-same-key-card-three-or-more-times-in-a-one-hour-period",0,[6,71,155,150],[["/practice/#alert-using-same-key-card-three-or-more-times-in-a-one-hour-period","Solution"]]],[1605,"Find Valid Matrix Given Row and Column Sums","find-valid-matrix-given-row-and-column-sums",0,[68,6,96,109],[["/practice/#find-valid-matrix-given-row-and-column-sums","Solution"]]],[1606,"Find Servers That Handled Most Number of Requests","find-servers-that-handled-most-number-of-requests",0,[6,113,145,72],[["/practice/#find-servers-that-handled-most-number-of-requests","Solution"]]],[1607,"Sellers With No Sales","sellers-with-no-sales",1,[40],[["/practice/#sellers-with-no-sales","Solution"]]],[1608,"Special Array With X Elements Greater Than or Equal X","special-array-with-x-elements-greater-than-or-equal-x",0,[6,14,150],[["/practice/#special-array-with-x-elements-greater-than-or-equal-x","Solution"]]],[1609,"Even Odd Tree","even-odd-tree",0,[168,25,16],[["/practice/#even-odd-tree","Solution"]]],[1610,"Maximum Number of Visible Points","maximum-number-of-visible-points",0,[63,6,95,150,146],[["/practice/#maximum-number-of-visible-points","Solution"]]],[1611,"Minimum One Bit Operations to Make Integers Zero","minimum-one-bit-operations-to-make-integers-zero",0,[18,134,100,95,48],[["/practice/#minimum-one-bit-operations-to-make-integers-zero","Solution"]]],[1612,"Check If Two Expression Trees are Equivalent","check-if-two-expression-trees-are-equivalent",0,[168,41,71,16,36],[["/practice/#check-if-two-expression-trees-are-equivalent","Solution"]]],[1613,"Find the Missing IDs","find-the-missing-ids",1,[40],[["/practice/#find-the-missing-ids","Solution"]]],[1614,"Maximum Nesting Depth of the Parentheses","maximum-nesting-depth-of-the-parentheses",0,[154,155,116],[["/practice/#maximum-nesting-depth-of-the-parentheses","Solution"]]],[1615,"Maximal Network Rank","maximal-network-rank",0,[64],[["/practice/#maximal-network-rank","Solution"]]],[1616,"Split Two Strings to Make Palindrome","split-two-strings-to-make-palindrome",0,[172,155],[["/practice/#split-two-strings-to-make-palindrome","Solution"]]],[1617,"Count Subtrees With Max Distance Between Cities","count-subtrees-with-max-distance-between-cities",0,[18,168,48,19,50],[["/practice/#count-subtrees-with-max-distance-between-cities","Solution"]]],[1618,"Maximum Font to Fit a Sentence in a Screen","maximum-font-to-fit-a-sentence-in-a-screen",0,[6,155,14,77],[["/practice/#maximum-font-to-fit-a-sentence-in-a-screen","Solution"]]],[1619,"Mean of Array After Removing Some Elements","mean-of-array-after-removing-some-elements",0,[6,150],[["/practice/#mean-of-array-after-removing-some-elements","Solution"]]],[1620,"Coordinate With Maximum Network Quality","coordinate-with-maximum-network-quality",0,[6,50],[["/practice/#coordinate-with-maximum-network-quality","Solution"]]],[1621,"Number of Sets of K Non-Overlapping Line Segments","number-of-sets-of-k-non-overlapping-line-segments",0,[95,48,33,122],[["/practice/#number-of-sets-of-k-non-overlapping-line-segments","Solution"]]],[1622,"Fancy Sequence","fancy-sequence",0,[42,139,95,112,59],[["/practice/#fancy-sequence","Solution"]]],[1623,"All Valid Triplets That Can Represent a Country","all-valid-triplets-that-can-represent-a-country",1,[40],[["/practice/#all-valid-triplets-that-can-represent-a-country","Solution"]]],[1624,"Largest Substring Between Two Equal Characters","largest-substring-between-two-equal-characters",0,[71,155],[["/practice/#largest-substring-between-two-equal-characters","Solution"]]],[1625,"Lexicographically Smallest String After Applying Operations","lexicographically-smallest-string-after-applying-operations",0,[41,25,155,50],[["/practice/#lexicographically-smallest-string-after-applying-operations","Solution"]]],[1626,"Best Team With No Conflicts","best-team-with-no-conflicts",0,[6,48,150,90],[["/practice/#best-team-with-no-conflicts","Solution"]]],[1627,"Graph Connectivity With Threshold","graph-connectivity-with-threshold",0,[174,6,95,112],[["/practice/#graph-connectivity-with-threshold","Solution"]]],[1628,"Design an Expression Tree With Evaluate Function","design-an-expression-tree-with-evaluate-function",0,[154,168,42,6,95,16],[["/practice/#design-an-expression-tree-with-evaluate-function","Solution"]]],[1629,"Slowest Key","slowest-key",0,[6,155],[["/practice/#slowest-key","Solution"]]],[1630,"Arithmetic Subarrays","arithmetic-subarrays",0,[6,71,150],[["/practice/#arithmetic-subarrays","Solution"]]],[1631,"Path With Minimum Effort","path-with-minimum-effort",0,[41,25,174,6,14,96,43,72],[["/patterns/weighted-shortest-paths/","Ch. 17"],["/practice/#path-with-minimum-effort","Solution"]]],[1632,"Rank Transform of a Matrix","rank-transform-of-a-matrix",0,[174,64,165,6,96,150],[["/practice/#rank-transform-of-a-matrix","Solution"]]],[1633,"Percentage of Users Attended a Contest","percentage-of-users-attended-a-contest",1,[40],[["/practice/#percentage-of-users-attended-a-contest","Solution"]]],[1634,"Add Two Polynomials Represented as Linked Lists","add-two-polynomials-represented-as-linked-lists",0,[88,95,172],[["/practice/#add-two-polynomials-represented-as-linked-lists","Solution"]]],[1635,"Hopper Company Queries I","hopper-company-queries-i",1,[40],[["/practice/#hopper-company-queries-i","Solution"]]],[1636,"Sort Array by Increasing Frequency","sort-array-by-increasing-frequency",0,[6,71,150],[["/practice/#sort-array-by-increasing-frequency","Solution"]]],[1637,"Widest Vertical Area Between Two Points Containing No Points","widest-vertical-area-between-two-points-containing-no-points",0,[6,150],[["/practice/#widest-vertical-area-between-two-points-containing-no-points","Solution"]]],[1638,"Count Substrings That Differ by One Character","count-substrings-that-differ-by-one-character",0,[71,155,48,50],[["/practice/#count-substrings-that-differ-by-one-character","Solution"]]],[1639,"Number of Ways to Form a Target String Given a Dictionary","number-of-ways-to-form-a-target-string-given-a-dictionary",0,[6,155,48],[["/practice/#number-of-ways-to-form-a-target-string-given-a-dictionary","Solution"]]],[1640,"Check Array Formation Through Concatenation","check-array-formation-through-concatenation",0,[6,71],[["/practice/#check-array-formation-through-concatenation","Solution"]]],[1641,"Count Sorted Vowel Strings","count-sorted-vowel-strings",0,[95,48,33],[["/practice/#count-sorted-vowel-strings","Solution"]]],[1642,"Furthest Building You Can Reach","furthest-building-you-can-reach",0,[68,6,72],[["/practice/#furthest-building-you-can-reach","Solution"]]],[1643,"Kth Smallest Instructions","kth-smallest-instructions",0,[6,95,48,33],[["/practice/#kth-smallest-instructions","Solution"]]],[1644,"Lowest Common Ancestor of a Binary Tree II","lowest-common-ancestor-of-a-binary-tree-ii",0,[168,41,16,91,13],[["/practice/#lowest-common-ancestor-of-a-binary-tree-ii","Solution"]]],[1645,"Hopper Company Queries II","hopper-company-queries-ii",1,[40],[["/practice/#hopper-company-queries-ii","Solution"]]],[1646,"Get Maximum in Generated Array","get-maximum-in-generated-array",0,[6,145],[["/practice/#get-maximum-in-generated-array","Solution"]]],[1647,"Minimum Deletions to Make Character Frequencies Unique","minimum-deletions-to-make-character-frequencies-unique",0,[68,71,155,150],[["/practice/#minimum-deletions-to-make-character-frequencies-unique","Solution"]]],[1648,"Sell Diminishing-Valued Colored Balls","sell-diminishing-valued-colored-balls",0,[68,6,95,14,150,72],[["/practice/#sell-diminishing-valued-colored-balls","Solution"]]],[1649,"Create Sorted Array through Instructions","create-sorted-array-through-instructions",0,[12,139,6,14,46,113,101],[["/practice/#create-sorted-array-through-instructions","Solution"]]],[1650,"Lowest Common Ancestor of a Binary Tree III","lowest-common-ancestor-of-a-binary-tree-iii",0,[168,71,172,16,91,13],[["/practice/#lowest-common-ancestor-of-a-binary-tree-iii","Solution"]]],[1651,"Hopper Company Queries III","hopper-company-queries-iii",1,[40],[["/practice/#hopper-company-queries-iii","Solution"]]],[1652,"Defuse the Bomb","defuse-the-bomb",0,[6,146],[["/practice/#defuse-the-bomb","Solution"]]],[1653,"Minimum Deletions to Make String Balanced","minimum-deletions-to-make-string-balanced",0,[154,155,48],[["/practice/#minimum-deletions-to-make-string-balanced","Solution"]]],[1654,"Minimum Jumps to Reach Home","minimum-jumps-to-reach-home",0,[25,6,71],[["/practice/#minimum-jumps-to-reach-home","Solution"]]],[1655,"Distribute Repeating Integers","distribute-repeating-integers",0,[18,6,71,48,8,19,36],[["/practice/#distribute-repeating-integers","Solution"]]],[1656,"Design an Ordered Stream","design-an-ordered-stream",0,[42,6,71,39],[["/practice/#design-an-ordered-stream","Solution"]]],[1657,"Determine if Two Strings Are Close","determine-if-two-strings-are-close",0,[71,155,36,150],[["/practice/#determine-if-two-strings-are-close","Solution"]]],[1658,"Minimum Operations to Reduce X to Zero","minimum-operations-to-reduce-x-to-zero",0,[6,71,14,122,146],[["/practice/#minimum-operations-to-reduce-x-to-zero","Solution"]]],[1659,"Maximize Grid Happiness","maximize-grid-happiness",0,[18,100,48,19],[["/practice/#maximize-grid-happiness","Solution"]]],[1660,"Correct a Binary Tree","correct-a-binary-tree",0,[168,41,25,71,16],[["/practice/#correct-a-binary-tree","Solution"]]],[1661,"Average Time of Process per Machine","average-time-of-process-per-machine",1,[40],[["/practice/#average-time-of-process-per-machine","Solution"]]],[1662,"Check If Two String Arrays are Equivalent","check-if-two-string-arrays-are-equivalent",0,[6,155],[["/practice/#check-if-two-string-arrays-are-equivalent","Solution"]]],[1663,"Smallest String With A Given Numeric Value","smallest-string-with-a-given-numeric-value",0,[68,155],[["/practice/#smallest-string-with-a-given-numeric-value","Solution"]]],[1664,"Ways to Make a Fair Array","ways-to-make-a-fair-array",0,[6,122],[["/practice/#ways-to-make-a-fair-array","Solution"]]],[1665,"Minimum Initial Energy to Finish Tasks","minimum-initial-energy-to-finish-tasks",0,[68,6,150],[["/practice/#minimum-initial-energy-to-finish-tasks","Solution"]]],[1666,"Change the Root of a Binary Tree","change-the-root-of-a-binary-tree",0,[168,41,16],[["/practice/#change-the-root-of-a-binary-tree","Solution"]]],[1667,"Fix Names in a Table","fix-names-in-a-table",1,[40],[["/practice/#fix-names-in-a-table","Solution"]]],[1668,"Maximum Repeating Substring","maximum-repeating-substring",0,[155,48,156],[["/practice/#maximum-repeating-substring","Solution"]]],[1669,"Merge In Between Linked Lists","merge-in-between-linked-lists",0,[88],[["/practice/#merge-in-between-linked-lists","Solution"]]],[1670,"Design Front Middle Back Queue","design-front-middle-back-queue",0,[42,128,6,88,39,47],[["/practice/#design-front-middle-back-queue","Solution"]]],[1671,"Minimum Number of Removals to Make Mountain Array","minimum-number-of-removals-to-make-mountain-array",0,[68,6,14,48],[["/practice/#minimum-number-of-removals-to-make-mountain-array","Solution"]]],[1672,"Richest Customer Wealth","richest-customer-wealth",0,[6,96],[["/practice/#richest-customer-wealth","Solution"]]],[1673,"Find the Most Competitive Subsequence","find-the-most-competitive-subsequence",0,[154,68,6,108],[["/practice/#find-the-most-competitive-subsequence","Solution"]]],[1674,"Minimum Moves to Make Array Complementary","minimum-moves-to-make-array-complementary",0,[6,71,122],[["/practice/#minimum-moves-to-make-array-complementary","Solution"]]],[1675,"Minimize Deviation in Array","minimize-deviation-in-array",0,[68,6,113,72],[["/practice/#minimize-deviation-in-array","Solution"]]],[1676,"Lowest Common Ancestor of a Binary Tree IV","lowest-common-ancestor-of-a-binary-tree-iv",0,[168,41,71,16,91,13],[["/practice/#lowest-common-ancestor-of-a-binary-tree-iv","Solution"]]],[1677,"Product's Worth Over Invoices","products-worth-over-invoices",1,[40],[["/practice/#products-worth-over-invoices","Solution"]]],[1678,"Goal Parser Interpretation","goal-parser-interpretation",0,[155],[["/practice/#goal-parser-interpretation","Solution"]]],[1679,"Max Number of K-Sum Pairs","max-number-of-k-sum-pairs",0,[6,71,172,150],[["/practice/#max-number-of-k-sum-pairs","Solution"]]],[1680,"Concatenation of Consecutive Binary Numbers","concatenation-of-consecutive-binary-numbers",0,[18,95,145],[["/practice/#concatenation-of-consecutive-binary-numbers","Solution"]]],[1681,"Minimum Incompatibility","minimum-incompatibility",0,[18,6,71,48,19],[["/practice/#minimum-incompatibility","Solution"]]],[1682,"Longest Palindromic Subsequence II","longest-palindromic-subsequence-ii",0,[155,48],[["/practice/#longest-palindromic-subsequence-ii","Solution"]]],[1683,"Invalid Tweets","invalid-tweets",1,[40],[["/practice/#invalid-tweets","Solution"]]],[1684,"Count the Number of Consistent Strings","count-the-number-of-consistent-strings",0,[18,6,71,155,36],[["/practice/#count-the-number-of-consistent-strings","Solution"]]],[1685,"Sum of Absolute Differences in a Sorted Array","sum-of-absolute-differences-in-a-sorted-array",0,[6,95,122],[["/practice/#sum-of-absolute-differences-in-a-sorted-array","Solution"]]],[1686,"Stone Game VI","stone-game-vi",0,[68,104,6,95,62,150,72,175],[["/practice/#stone-game-vi","Solution"]]],[1687,"Delivering Boxes from Storage to Ports","delivering-boxes-from-storage-to-ports",0,[139,128,6,48,122,107,72],[["/practice/#delivering-boxes-from-storage-to-ports","Solution"]]],[1688,"Count of Matches in Tournament","count-of-matches-in-tournament",0,[95,145],[["/practice/#count-of-matches-in-tournament","Solution"]]],[1689,"Partitioning Into Minimum Number Of Deci-Binary Numbers","partitioning-into-minimum-number-of-deci-binary-numbers",0,[68,155],[["/practice/#partitioning-into-minimum-number-of-deci-binary-numbers","Solution"]]],[1690,"Stone Game VII","stone-game-vii",0,[104,6,95,48,62,175],[["/practice/#stone-game-vii","Solution"]]],[1691,"Maximum Height by Stacking Cuboids ","maximum-height-by-stacking-cuboids",0,[6,48,150],[["/practice/#maximum-height-by-stacking-cuboids","Solution"]]],[1692,"Count Ways to Distribute Candies","count-ways-to-distribute-candies",0,[48],[["/practice/#count-ways-to-distribute-candies","Solution"]]],[1693,"Daily Leads and Partners","daily-leads-and-partners",1,[40],[["/practice/#daily-leads-and-partners","Solution"]]],[1694,"Reformat Phone Number","reformat-phone-number",0,[155],[["/practice/#reformat-phone-number","Solution"]]],[1695,"Maximum Erasure Value","maximum-erasure-value",0,[6,71,146],[["/practice/#maximum-erasure-value","Solution"]]],[1696,"Jump Game VI","jump-game-vi",0,[128,6,48,107,72],[["/practice/#jump-game-vi","Solution"]]],[1697,"Checking Existence of Edge Length Limited Paths","checking-existence-of-edge-length-limited-paths",0,[174,64,6,172,150],[["/practice/#checking-existence-of-edge-length-limited-paths","Solution"]]],[1698,"Number of Distinct Substrings in a String","number-of-distinct-substrings-in-a-string",0,[171,155,158,70,137],[["/practice/#number-of-distinct-substrings-in-a-string","Solution"]]],[1699,"Number of Calls Between Two Persons","number-of-calls-between-two-persons",1,[40],[["/practice/#number-of-calls-between-two-persons","Solution"]]],[1700,"Number of Students Unable to Eat Lunch","number-of-students-unable-to-eat-lunch",0,[154,128,6,145],[["/practice/#number-of-students-unable-to-eat-lunch","Solution"]]],[1701,"Average Waiting Time","average-waiting-time",0,[6,145],[["/practice/#average-waiting-time","Solution"]]],[1702,"Maximum Binary String After Change","maximum-binary-string-after-change",0,[68,155],[["/practice/#maximum-binary-string-after-change","Solution"]]],[1703,"Minimum Adjacent Swaps for K Consecutive Ones","minimum-adjacent-swaps-for-k-consecutive-ones",0,[68,6,122,146],[["/practice/#minimum-adjacent-swaps-for-k-consecutive-ones","Solution"]]],[1704,"Determine if String Halves Are Alike","determine-if-string-halves-are-alike",0,[155,36],[["/practice/#determine-if-string-halves-are-alike","Solution"]]],[1705,"Maximum Number of Eaten Apples","maximum-number-of-eaten-apples",0,[68,6,72],[["/practice/#maximum-number-of-eaten-apples","Solution"]]],[1706,"Where Will the Ball Fall","where-will-the-ball-fall",0,[6,96,145],[["/practice/#where-will-the-ball-fall","Solution"]]],[1707,"Maximum XOR With an Element From Array","maximum-xor-with-an-element-from-array",0,[18,171,6],[["/practice/#maximum-xor-with-an-element-from-array","Solution"]]],[1708,"Largest Subarray Length K","largest-subarray-length-k",0,[68,6],[["/practice/#largest-subarray-length-k","Solution"]]],[1709,"Biggest Window Between Visits","biggest-window-between-visits",1,[40],[["/practice/#biggest-window-between-visits","Solution"]]],[1710,"Maximum Units on a Truck","maximum-units-on-a-truck",0,[68,6,150],[["/practice/#maximum-units-on-a-truck","Solution"]]],[1711,"Count Good Meals","count-good-meals",0,[6,71],[["/practice/#count-good-meals","Solution"]]],[1712,"Ways to Split Array Into Three Subarrays","ways-to-split-array-into-three-subarrays",0,[6,172,14,122],[["/practice/#ways-to-split-array-into-three-subarrays","Solution"]]],[1713,"Minimum Operations to Make a Subsequence","minimum-operations-to-make-a-subsequence",0,[68,6,71,14,90],[["/practice/#minimum-operations-to-make-a-subsequence","Solution"]]],[1714,"Sum Of Special Evenly-Spaced Elements In Array","sum-of-special-evenly-spaced-elements-in-array",0,[6,48,153],[["/practice/#sum-of-special-evenly-spaced-elements-in-array","Solution"]]],[1715,"Count Apples and Oranges","count-apples-and-oranges",1,[40],[["/practice/#count-apples-and-oranges","Solution"]]],[1716,"Calculate Money in Leetcode Bank","calculate-money-in-leetcode-bank",0,[95],[["/practice/#calculate-money-in-leetcode-bank","Solution"]]],[1717,"Maximum Score From Removing Substrings","maximum-score-from-removing-substrings",0,[154,68,155],[["/practice/#maximum-score-from-removing-substrings","Solution"]]],[1718,"Construct the Lexicographically Largest Valid Sequence","construct-the-lexicographically-largest-valid-sequence",0,[6,8],[["/practice/#construct-the-lexicographically-largest-valid-sequence","Solution"]]],[1719,"Number Of Ways To Reconstruct A Tree","number-of-ways-to-reconstruct-a-tree",0,[168,64,6,71,145],[["/practice/#number-of-ways-to-reconstruct-a-tree","Solution"]]],[1720,"Decode XORed Array","decode-xored-array",0,[18,6],[["/practice/#decode-xored-array","Solution"]]],[1721,"Swapping Nodes in a Linked List","swapping-nodes-in-a-linked-list",0,[88,172],[["/practice/#swapping-nodes-in-a-linked-list","Solution"]]],[1722,"Minimize Hamming Distance After Swap Operations","minimize-hamming-distance-after-swap-operations",0,[41,174,6],[["/practice/#minimize-hamming-distance-after-swap-operations","Solution"]]],[1723,"Find Minimum Time to Finish All Jobs","find-minimum-time-to-finish-all-jobs",0,[18,6,48,8,19],[["/practice/#find-minimum-time-to-finish-all-jobs","Solution"]]],[1724,"Checking Existence of Edge Length Limited Paths II","checking-existence-of-edge-length-limited-paths-ii",0,[41,174,64,42,105,150,72],[["/practice/#checking-existence-of-edge-length-limited-paths-ii","Solution"]]],[1725,"Number Of Rectangles That Can Form The Largest Square","number-of-rectangles-that-can-form-the-largest-square",0,[6],[["/practice/#number-of-rectangles-that-can-form-the-largest-square","Solution"]]],[1726,"Tuple with Same Product","tuple-with-same-product",0,[6,71,36],[["/practice/#tuple-with-same-product","Solution"]]],[1727,"Largest Submatrix With Rearrangements","largest-submatrix-with-rearrangements",0,[68,6,96,150],[["/practice/#largest-submatrix-with-rearrangements","Solution"]]],[1728,"Cat and Mouse II","cat-and-mouse-ii",0,[64,165,100,104,6,95,48,62,96,175],[["/practice/#cat-and-mouse-ii","Solution"]]],[1729,"Find Followers Count","find-followers-count",1,[40],[["/practice/#find-followers-count","Solution"]]],[1730,"Shortest Path to Get Food","shortest-path-to-get-food",0,[25,6,96],[["/practice/#shortest-path-to-get-food","Solution"]]],[1731,"The Number of Employees Which Report to Each Employee","the-number-of-employees-which-report-to-each-employee",1,[40],[["/practice/#the-number-of-employees-which-report-to-each-employee","Solution"]]],[1732,"Find the Highest Altitude","find-the-highest-altitude",0,[6,122],[["/practice/#find-the-highest-altitude","Solution"]]],[1733,"Minimum Number of People to Teach","minimum-number-of-people-to-teach",0,[68,6,71],[["/practice/#minimum-number-of-people-to-teach","Solution"]]],[1734,"Decode XORed Permutation","decode-xored-permutation",0,[18,6],[["/practice/#decode-xored-permutation","Solution"]]],[1735,"Count Ways to Make Array With Product","count-ways-to-make-array-with-product",0,[6,95,48,33,112,125,59],[["/practice/#count-ways-to-make-array-with-product","Solution"]]],[1736,"Latest Time by Replacing Hidden Digits","latest-time-by-replacing-hidden-digits",0,[68,155],[["/practice/#latest-time-by-replacing-hidden-digits","Solution"]]],[1737,"Change Minimum Characters to Satisfy One of Three Conditions","change-minimum-characters-to-satisfy-one-of-three-conditions",0,[71,155,36,122],[["/practice/#change-minimum-characters-to-satisfy-one-of-three-conditions","Solution"]]],[1738,"Find Kth Largest XOR Coordinate Value","find-kth-largest-xor-coordinate-value",0,[18,6,46,96,122,130,150,72],[["/practice/#find-kth-largest-xor-coordinate-value","Solution"]]],[1739,"Building Boxes","building-boxes",0,[68,95,14],[["/practice/#building-boxes","Solution"]]],[1740,"Find Distance in a Binary Tree","find-distance-in-a-binary-tree",0,[168,41,25,71,16,91,13],[["/practice/#find-distance-in-a-binary-tree","Solution"]]],[1741,"Find Total Time Spent by Each Employee","find-total-time-spent-by-each-employee",1,[40],[["/practice/#find-total-time-spent-by-each-employee","Solution"]]],[1742,"Maximum Number of Balls in a Box","maximum-number-of-balls-in-a-box",0,[71,95,36],[["/practice/#maximum-number-of-balls-in-a-box","Solution"]]],[1743,"Restore the Array From Adjacent Pairs","restore-the-array-from-adjacent-pairs",0,[41,6,71],[["/practice/#restore-the-array-from-adjacent-pairs","Solution"]]],[1744,"Can You Eat Your Favorite Candy on Your Favorite Day?","can-you-eat-your-favorite-candy-on-your-favorite-day",0,[6,122],[["/practice/#can-you-eat-your-favorite-candy-on-your-favorite-day","Solution"]]],[1745,"Palindrome Partitioning IV","palindrome-partitioning-iv",0,[155,48],[["/practice/#palindrome-partitioning-iv","Solution"]]],[1746,"Maximum Subarray Sum After One Operation","maximum-subarray-sum-after-one-operation",0,[6,48],[["/practice/#maximum-subarray-sum-after-one-operation","Solution"]]],[1747,"Leetflex Banned Accounts","leetflex-banned-accounts",1,[40],[["/practice/#leetflex-banned-accounts","Solution"]]],[1748,"Sum of Unique Elements","sum-of-unique-elements",0,[6,71,36],[["/practice/#sum-of-unique-elements","Solution"]]],[1749,"Maximum Absolute Sum of Any Subarray","maximum-absolute-sum-of-any-subarray",0,[6,48],[["/practice/#maximum-absolute-sum-of-any-subarray","Solution"]]],[1750,"Minimum Length of String After Deleting Similar Ends","minimum-length-of-string-after-deleting-similar-ends",0,[172,155],[["/practice/#minimum-length-of-string-after-deleting-similar-ends","Solution"]]],[1751,"Maximum Number of Events That Can Be Attended II","maximum-number-of-events-that-can-be-attended-ii",0,[6,14,48,150],[["/practice/#maximum-number-of-events-that-can-be-attended-ii","Solution"]]],[1752,"Check if Array Is Sorted and Rotated","check-if-array-is-sorted-and-rotated",0,[6],[["/practice/#check-if-array-is-sorted-and-rotated","Solution"]]],[1753,"Maximum Score From Removing Stones","maximum-score-from-removing-stones",0,[68,95,72],[["/practice/#maximum-score-from-removing-stones","Solution"]]],[1754,"Largest Merge Of Two Strings","largest-merge-of-two-strings",0,[68,172,155],[["/practice/#largest-merge-of-two-strings","Solution"]]],[1755,"Closest Subsequence Sum","closest-subsequence-sum",0,[18,6,172,48,19,150,99],[["/patterns/reasoning-moves-that-unlock-problems/","Ch. 03"],["/practice/#closest-subsequence-sum","Solution"]]],[1756,"Design Most Recently Used Queue","design-most-recently-used-queue",0,[42,6,88,46,47,152,167,145,153],[["/practice/#design-most-recently-used-queue","Solution"]]],[1757,"Recyclable and Low Fat Products","recyclable-and-low-fat-products",1,[40],[["/practice/#recyclable-and-low-fat-products","Solution"]]],[1758,"Minimum Changes To Make Alternating Binary String","minimum-changes-to-make-alternating-binary-string",0,[155],[["/practice/#minimum-changes-to-make-alternating-binary-string","Solution"]]],[1759,"Count Number of Homogenous Substrings","count-number-of-homogenous-substrings",0,[95,155],[["/practice/#count-number-of-homogenous-substrings","Solution"]]],[1760,"Minimum Limit of Balls in a Bag","minimum-limit-of-balls-in-a-bag",0,[6,14],[["/practice/#minimum-limit-of-balls-in-a-bag","Solution"]]],[1761,"Minimum Degree of a Connected Trio in a Graph","minimum-degree-of-a-connected-trio-in-a-graph",0,[64,50],[["/practice/#minimum-degree-of-a-connected-trio-in-a-graph","Solution"]]],[1762,"Buildings With an Ocean View","buildings-with-an-ocean-view",0,[154,6,108],[["/practice/#buildings-with-an-ocean-view","Solution"]]],[1763,"Longest Nice Substring","longest-nice-substring",0,[18,71,155,46,146],[["/practice/#longest-nice-substring","Solution"]]],[1764,"Form Array by Concatenating Subarrays of Another Array","form-array-by-concatenating-subarrays-of-another-array",0,[68,6,172,156,81],[["/practice/#form-array-by-concatenating-subarrays-of-another-array","Solution"]]],[1765,"Map of Highest Peak","map-of-highest-peak",0,[25,6,96],[["/practice/#map-of-highest-peak","Solution"]]],[1766,"Tree of Coprimes","tree-of-coprimes",0,[168,41,6,95,112],[["/practice/#tree-of-coprimes","Solution"]]],[1767,"Find the Subtasks That Did Not Execute","find-the-subtasks-that-did-not-execute",1,[40],[["/practice/#find-the-subtasks-that-did-not-execute","Solution"]]],[1768,"Merge Strings Alternately","merge-strings-alternately",0,[172,155],[["/practice/#merge-strings-alternately","Solution"]]],[1769,"Minimum Number of Operations to Move All Balls to Each Box","minimum-number-of-operations-to-move-all-balls-to-each-box",0,[6,155,122],[["/practice/#minimum-number-of-operations-to-move-all-balls-to-each-box","Solution"]]],[1770,"Maximum Score from Performing Multiplication Operations","maximum-score-from-performing-multiplication-operations",0,[6,48],[["/practice/#maximum-score-from-performing-multiplication-operations","Solution"]]],[1771,"Maximize Palindrome Length From Subsequences","maximize-palindrome-length-from-subsequences",0,[155,48],[["/practice/#maximize-palindrome-length-from-subsequences","Solution"]]],[1772,"Sort Features by Popularity","sort-features-by-popularity",0,[6,71,155,150],[["/practice/#sort-features-by-popularity","Solution"]]],[1773,"Count Items Matching a Rule","count-items-matching-a-rule",0,[6,155],[["/practice/#count-items-matching-a-rule","Solution"]]],[1774,"Closest Dessert Cost","closest-dessert-cost",0,[6,48,8,82,106],[["/practice/#closest-dessert-cost","Solution"]]],[1775,"Equal Sum Arrays With Minimum Number of Operations","equal-sum-arrays-with-minimum-number-of-operations",0,[68,6,71,36],[["/practice/#equal-sum-arrays-with-minimum-number-of-operations","Solution"]]],[1776,"Car Fleet II","car-fleet-ii",0,[154,6,95,108,72],[["/practice/#car-fleet-ii","Solution"]]],[1777,"Product's Price for Each Store","products-price-for-each-store",1,[40],[["/practice/#products-price-for-each-store","Solution"]]],[1778,"Shortest Path in a Hidden Grid","shortest-path-in-a-hidden-grid",0,[41,25,6,77,96],[["/practice/#shortest-path-in-a-hidden-grid","Solution"]]],[1779,"Find Nearest Point That Has the Same X or Y Coordinate","find-nearest-point-that-has-the-same-x-or-y-coordinate",0,[6],[["/practice/#find-nearest-point-that-has-the-same-x-or-y-coordinate","Solution"]]],[1780,"Check if Number is a Sum of Powers of Three","check-if-number-is-a-sum-of-powers-of-three",0,[95],[["/practice/#check-if-number-is-a-sum-of-powers-of-three","Solution"]]],[1781,"Sum of Beauty of All Substrings","sum-of-beauty-of-all-substrings",0,[71,155,36],[["/practice/#sum-of-beauty-of-all-substrings","Solution"]]],[1782,"Count Pairs Of Nodes","count-pairs-of-nodes",0,[64,6,71,172,14,36,150],[["/practice/#count-pairs-of-nodes","Solution"]]],[1783,"Grand Slam Titles","grand-slam-titles",1,[40],[["/practice/#grand-slam-titles","Solution"]]],[1784,"Check if Binary String Has at Most One Segment of Ones","check-if-binary-string-has-at-most-one-segment-of-ones",0,[155],[["/practice/#check-if-binary-string-has-at-most-one-segment-of-ones","Solution"]]],[1785,"Minimum Elements to Add to Form a Given Sum","minimum-elements-to-add-to-form-a-given-sum",0,[68,6],[["/practice/#minimum-elements-to-add-to-form-a-given-sum","Solution"]]],[1786,"Number of Restricted Paths From First to Last Node","number-of-restricted-paths-from-first-to-last-node",0,[64,165,48,142,43,72],[["/practice/#number-of-restricted-paths-from-first-to-last-node","Solution"]]],[1787,"Make the XOR of All Segments Equal to Zero","make-the-xor-of-all-segments-equal-to-zero",0,[18,6,71,48,36],[["/practice/#make-the-xor-of-all-segments-equal-to-zero","Solution"]]],[1788,"Maximize the Beauty of the Garden","maximize-the-beauty-of-the-garden",0,[68,6,71,122],[["/practice/#maximize-the-beauty-of-the-garden","Solution"]]],[1789,"Primary Department for Each Employee","primary-department-for-each-employee",1,[40],[["/practice/#primary-department-for-each-employee","Solution"]]],[1790,"Check if One String Swap Can Make Strings Equal","check-if-one-string-swap-can-make-strings-equal",0,[71,155,36],[["/practice/#check-if-one-string-swap-can-make-strings-equal","Solution"]]],[1791,"Find Center of Star Graph","find-center-of-star-graph",0,[64],[["/practice/#find-center-of-star-graph","Solution"]]],[1792,"Maximum Average Pass Ratio","maximum-average-pass-ratio",0,[68,6,72],[["/practice/#maximum-average-pass-ratio","Solution"]]],[1793,"Maximum Score of a Good Subarray","maximum-score-of-a-good-subarray",0,[154,6,172,14,31,108],[["/practice/#maximum-score-of-a-good-subarray","Solution"]]],[1794,"Count Pairs of Equal Substrings With Minimum Difference","count-pairs-of-equal-substrings-with-minimum-difference",0,[68,71,155],[["/practice/#count-pairs-of-equal-substrings-with-minimum-difference","Solution"]]],[1795,"Rearrange Products Table","rearrange-products-table",1,[40],[["/practice/#rearrange-products-table","Solution"]]],[1796,"Second Largest Digit in a String","second-largest-digit-in-a-string",0,[71,155],[["/practice/#second-largest-digit-in-a-string","Solution"]]],[1797,"Design Authentication Manager","design-authentication-manager",0,[42,71,88,47],[["/practice/#design-authentication-manager","Solution"]]],[1798,"Maximum Number of Consecutive Values You Can Make","maximum-number-of-consecutive-values-you-can-make",0,[68,6,150],[["/practice/#maximum-number-of-consecutive-values-you-can-make","Solution"]]],[1799,"Maximize Score After N Operations","maximize-score-after-n-operations",0,[18,6,95,48,8,19,112],[["/practice/#maximize-score-after-n-operations","Solution"]]],[1800,"Maximum Ascending Subarray Sum","maximum-ascending-subarray-sum",0,[6],[["/practice/#maximum-ascending-subarray-sum","Solution"]]],[1801,"Number of Orders in the Backlog","number-of-orders-in-the-backlog",0,[6,145,72],[["/practice/#number-of-orders-in-the-backlog","Solution"]]],[1802,"Maximum Value at a Given Index in a Bounded Array","maximum-value-at-a-given-index-in-a-bounded-array",0,[68,95,14],[["/practice/#maximum-value-at-a-given-index-in-a-bounded-array","Solution"]]],[1803,"Count Pairs With XOR in a Range","count-pairs-with-xor-in-a-range",0,[18,171,6],[["/practice/#count-pairs-with-xor-in-a-range","Solution"]]],[1804,"Implement Trie II (Prefix Tree)","implement-trie-ii-prefix-tree",0,[42,171,71,155],[["/practice/#implement-trie-ii-prefix-tree","Solution"]]],[1805,"Number of Different Integers in a String","number-of-different-integers-in-a-string",0,[71,155],[["/practice/#number-of-different-integers-in-a-string","Solution"]]],[1806,"Minimum Number of Operations to Reinitialize a Permutation","minimum-number-of-operations-to-reinitialize-a-permutation",0,[6,95,145],[["/practice/#minimum-number-of-operations-to-reinitialize-a-permutation","Solution"]]],[1807,"Evaluate the Bracket Pairs of a String","evaluate-the-bracket-pairs-of-a-string",0,[6,71,155],[["/practice/#evaluate-the-bracket-pairs-of-a-string","Solution"]]],[1808,"Maximize Number of Nice Divisors","maximize-number-of-nice-divisors",0,[134,95,112],[["/practice/#maximize-number-of-nice-divisors","Solution"]]],[1809,"Ad-Free Sessions","ad-free-sessions",1,[40],[["/practice/#ad-free-sessions","Solution"]]],[1810,"Minimum Path Cost in a Hidden Grid","minimum-path-cost-in-a-hidden-grid",0,[41,25,64,6,77,96,142,72],[["/practice/#minimum-path-cost-in-a-hidden-grid","Solution"]]],[1811,"Find Interview Candidates","find-interview-candidates",1,[40],[["/practice/#find-interview-candidates","Solution"]]],[1812,"Determine Color of a Chessboard Square","determine-color-of-a-chessboard-square",0,[95,155],[["/practice/#determine-color-of-a-chessboard-square","Solution"]]],[1813,"Sentence Similarity III","sentence-similarity-iii",0,[6,172,155],[["/practice/#sentence-similarity-iii","Solution"]]],[1814,"Count Nice Pairs in an Array","count-nice-pairs-in-an-array",0,[6,71,95,36],[["/practice/#count-nice-pairs-in-an-array","Solution"]]],[1815,"Maximum Number of Groups Getting Fresh Donuts","maximum-number-of-groups-getting-fresh-donuts",0,[18,100,6,48,19],[["/practice/#maximum-number-of-groups-getting-fresh-donuts","Solution"]]],[1816,"Truncate Sentence","truncate-sentence",0,[6,155],[["/practice/#truncate-sentence","Solution"]]],[1817,"Finding the Users Active Minutes","finding-the-users-active-minutes",0,[6,71],[["/practice/#finding-the-users-active-minutes","Solution"]]],[1818,"Minimum Absolute Sum Difference","minimum-absolute-sum-difference",0,[6,14,113,150],[["/practice/#minimum-absolute-sum-difference","Solution"]]],[1819,"Number of Different Subsequences GCDs","number-of-different-subsequences-gcds",0,[6,95,36,67,112,51],[["/practice/#number-of-different-subsequences-gcds","Solution"]]],[1820,"Maximum Number of Accepted Invitations","maximum-number-of-accepted-invitations",0,[41,64,6,96,17,97,66,98,49,44,93,127,109],[["/practice/#maximum-number-of-accepted-invitations","Solution"]]],[1821,"Find Customers With Positive Revenue this Year","find-customers-with-positive-revenue-this-year",1,[40],[["/practice/#find-customers-with-positive-revenue-this-year","Solution"]]],[1822,"Sign of the Product of an Array","sign-of-the-product-of-an-array",0,[6,95],[["/practice/#sign-of-the-product-of-an-array","Solution"]]],[1823,"Find the Winner of the Circular Game","find-the-winner-of-the-circular-game",0,[134,128,6,95,145],[["/practice/#find-the-winner-of-the-circular-game","Solution"]]],[1824,"Minimum Sideway Jumps","minimum-sideway-jumps",0,[68,6,48],[["/practice/#minimum-sideway-jumps","Solution"]]],[1825,"Finding MK Average","finding-mk-average",0,[42,128,39,113,167,72],[["/practice/#finding-mk-average","Solution"]]],[1826,"Faulty Sensor","faulty-sensor",0,[6,172],[["/practice/#faulty-sensor","Solution"]]],[1827,"Minimum Operations to Make the Array Increasing","minimum-operations-to-make-the-array-increasing",0,[68,6],[["/practice/#minimum-operations-to-make-the-array-increasing","Solution"]]],[1828,"Queries on Number of Points Inside a Circle","queries-on-number-of-points-inside-a-circle",0,[63,6,95],[["/practice/#queries-on-number-of-points-inside-a-circle","Solution"]]],[1829,"Maximum XOR for Each Query","maximum-xor-for-each-query",0,[18,6,122],[["/practice/#maximum-xor-for-each-query","Solution"]]],[1830,"Minimum Number of Operations to Make String Sorted","minimum-number-of-operations-to-make-string-sorted",0,[71,95,155,33,36,59],[["/practice/#minimum-number-of-operations-to-make-string-sorted","Solution"]]],[1831,"Maximum Transaction Each Day","maximum-transaction-each-day",1,[40],[["/practice/#maximum-transaction-each-day","Solution"]]],[1832,"Check if the Sentence Is Pangram","check-if-the-sentence-is-pangram",0,[71,155],[["/practice/#check-if-the-sentence-is-pangram","Solution"]]],[1833,"Maximum Ice Cream Bars","maximum-ice-cream-bars",0,[68,6,37,150],[["/practice/#maximum-ice-cream-bars","Solution"]]],[1834,"Single-Threaded CPU","single-threaded-cpu",0,[6,150,72],[["/practice/#single-threaded-cpu","Solution"]]],[1835,"Find XOR Sum of All Pairs Bitwise AND","find-xor-sum-of-all-pairs-bitwise-and",0,[18,6,95],[["/practice/#find-xor-sum-of-all-pairs-bitwise-and","Solution"]]],[1836,"Remove Duplicates From an Unsorted Linked List","remove-duplicates-from-an-unsorted-linked-list",0,[71,88],[["/practice/#remove-duplicates-from-an-unsorted-linked-list","Solution"]]],[1837,"Sum of Digits in Base K","sum-of-digits-in-base-k",0,[95],[["/practice/#sum-of-digits-in-base-k","Solution"]]],[1838,"Frequency of the Most Frequent Element","frequency-of-the-most-frequent-element",0,[68,6,14,122,150,146],[["/practice/#frequency-of-the-most-frequent-element","Solution"]]],[1839,"Longest Substring Of All Vowels in Order","longest-substring-of-all-vowels-in-order",0,[155,146],[["/practice/#longest-substring-of-all-vowels-in-order","Solution"]]],[1840,"Maximum Building Height","maximum-building-height",0,[6,95,150],[["/practice/#maximum-building-height","Solution"]]],[1841,"League Statistics","league-statistics",1,[40],[["/practice/#league-statistics","Solution"]]],[1842,"Next Palindrome Using Same Digits","next-palindrome-using-same-digits",0,[172,155],[["/practice/#next-palindrome-using-same-digits","Solution"]]],[1843,"Suspicious Bank Accounts","suspicious-bank-accounts",1,[40],[["/practice/#suspicious-bank-accounts","Solution"]]],[1844,"Replace All Digits with Characters","replace-all-digits-with-characters",0,[155],[["/practice/#replace-all-digits-with-characters","Solution"]]],[1845,"Seat Reservation Manager","seat-reservation-manager",0,[42,72],[["/practice/#seat-reservation-manager","Solution"]]],[1846,"Maximum Element After Decreasing and Rearranging","maximum-element-after-decreasing-and-rearranging",0,[68,6,150],[["/practice/#maximum-element-after-decreasing-and-rearranging","Solution"]]],[1847,"Closest Room","closest-room",0,[6,14,113,150],[["/practice/#closest-room","Solution"]]],[1848,"Minimum Distance to the Target Element","minimum-distance-to-the-target-element",0,[6],[["/practice/#minimum-distance-to-the-target-element","Solution"]]],[1849,"Splitting a String Into Descending Consecutive Values","splitting-a-string-into-descending-consecutive-values",0,[155,8,50],[["/practice/#splitting-a-string-into-descending-consecutive-values","Solution"]]],[1850,"Minimum Adjacent Swaps to Reach the Kth Smallest Number","minimum-adjacent-swaps-to-reach-the-kth-smallest-number",0,[68,172,155],[["/practice/#minimum-adjacent-swaps-to-reach-the-kth-smallest-number","Solution"]]],[1851,"Minimum Interval to Include Each Query","minimum-interval-to-include-each-query",0,[6,14,150,161,72],[["/patterns/reasoning-moves-that-unlock-problems/","Ch. 03"],["/practice/#minimum-interval-to-include-each-query","Solution"]]],[1852,"Distinct Numbers in Each Subarray","distinct-numbers-in-each-subarray",0,[6,71,146],[["/practice/#distinct-numbers-in-each-subarray","Solution"]]],[1853,"Convert Date Format","convert-date-format",1,[40],[["/practice/#convert-date-format","Solution"]]],[1854,"Maximum Population Year","maximum-population-year",0,[6,36,122],[["/practice/#maximum-population-year","Solution"]]],[1855,"Maximum Distance Between a Pair of Values","maximum-distance-between-a-pair-of-values",0,[6,172,14],[["/practice/#maximum-distance-between-a-pair-of-values","Solution"]]],[1856,"Maximum Subarray Min-Product","maximum-subarray-min-product",0,[154,6,31,122,108],[["/practice/#maximum-subarray-min-product","Solution"]]],[1857,"Largest Color Value in a Directed Graph","largest-color-value-in-a-directed-graph",0,[64,165,100,71,155,48,36,45],[["/practice/#largest-color-value-in-a-directed-graph","Solution"]]],[1858,"Longest Word With All Prefixes","longest-word-with-all-prefixes",0,[41,171,6,155],[["/practice/#longest-word-with-all-prefixes","Solution"]]],[1859,"Sorting the Sentence","sorting-the-sentence",0,[155,28,150],[["/practice/#sorting-the-sentence","Solution"]]],[1860,"Incremental Memory Leak","incremental-memory-leak",0,[95,145],[["/practice/#incremental-memory-leak","Solution"]]],[1861,"Rotating the Box","rotating-the-box",0,[6,172,96],[["/practice/#rotating-the-box","Solution"]]],[1862,"Sum of Floored Pairs","sum-of-floored-pairs",0,[6,95,14,36,50,122],[["/practice/#sum-of-floored-pairs","Solution"]]],[1863,"Sum of All Subset XOR Totals","sum-of-all-subset-xor-totals",0,[18,6,95,8,33,50],[["/practice/#sum-of-all-subset-xor-totals","Solution"]]],[1864,"Minimum Number of Swaps to Make the Binary String Alternating","minimum-number-of-swaps-to-make-the-binary-string-alternating",0,[68,155],[["/practice/#minimum-number-of-swaps-to-make-the-binary-string-alternating","Solution"]]],[1865,"Finding Pairs With a Certain Sum","finding-pairs-with-a-certain-sum",0,[42,6,71],[["/practice/#finding-pairs-with-a-certain-sum","Solution"]]],[1866,"Number of Ways to Rearrange Sticks With K Sticks Visible","number-of-ways-to-rearrange-sticks-with-k-sticks-visible",0,[95,48,33],[["/practice/#number-of-ways-to-rearrange-sticks-with-k-sticks-visible","Solution"]]],[1867,"Orders With Maximum Quantity Above Average","orders-with-maximum-quantity-above-average",1,[40],[["/practice/#orders-with-maximum-quantity-above-average","Solution"]]],[1868,"Product of Two Run-Length Encoded Arrays","product-of-two-run-length-encoded-arrays",0,[6,172],[["/practice/#product-of-two-run-length-encoded-arrays","Solution"]]],[1869,"Longer Contiguous Segments of Ones than Zeros","longer-contiguous-segments-of-ones-than-zeros",0,[155],[["/practice/#longer-contiguous-segments-of-ones-than-zeros","Solution"]]],[1870,"Minimum Speed to Arrive on Time","minimum-speed-to-arrive-on-time",0,[6,14],[["/practice/#minimum-speed-to-arrive-on-time","Solution"]]],[1871,"Jump Game VII","jump-game-vii",0,[155,48,122,146],[["/practice/#jump-game-vii","Solution"]]],[1872,"Stone Game VIII","stone-game-viii",0,[104,6,95,48,62,122,175],[["/practice/#stone-game-viii","Solution"]]],[1873,"Calculate Special Bonus","calculate-special-bonus",1,[40],[["/practice/#calculate-special-bonus","Solution"]]],[1874,"Minimize Product Sum of Two Arrays","minimize-product-sum-of-two-arrays",0,[68,6,150],[["/practice/#minimize-product-sum-of-two-arrays","Solution"]]],[1875,"Group Employees of the Same Salary","group-employees-of-the-same-salary",1,[40],[["/practice/#group-employees-of-the-same-salary","Solution"]]],[1876,"Substrings of Size Three with Distinct Characters","substrings-of-size-three-with-distinct-characters",0,[71,155,36,146],[["/practice/#substrings-of-size-three-with-distinct-characters","Solution"]]],[1877,"Minimize Maximum Pair Sum in Array","minimize-maximum-pair-sum-in-array",0,[68,6,172,150],[["/practice/#minimize-maximum-pair-sum-in-array","Solution"]]],[1878,"Get Biggest Three Rhombus Sums in a Grid","get-biggest-three-rhombus-sums-in-a-grid",0,[6,95,96,122,150,72],[["/practice/#get-biggest-three-rhombus-sums-in-a-grid","Solution"]]],[1879,"Minimum XOR Sum of Two Arrays","minimum-xor-sum-of-two-arrays",0,[18,6,48,19,74,17,138],[["/practice/#minimum-xor-sum-of-two-arrays","Solution"]]],[1880,"Check if Word Equals Summation of Two Words","check-if-word-equals-summation-of-two-words",0,[155],[["/practice/#check-if-word-equals-summation-of-two-words","Solution"]]],[1881,"Maximum Value after Insertion","maximum-value-after-insertion",0,[68,155],[["/practice/#maximum-value-after-insertion","Solution"]]],[1882,"Process Tasks Using Servers","process-tasks-using-servers",0,[6,72],[["/practice/#process-tasks-using-servers","Solution"]]],[1883,"Minimum Skips to Arrive at Meeting On Time","minimum-skips-to-arrive-at-meeting-on-time",0,[6,48],[["/practice/#minimum-skips-to-arrive-at-meeting-on-time","Solution"]]],[1884,"Egg Drop With 2 Eggs and N Floors","egg-drop-with-2-eggs-and-n-floors",0,[95,48],[["/practice/#egg-drop-with-2-eggs-and-n-floors","Solution"]]],[1885,"Count Pairs in Two Arrays","count-pairs-in-two-arrays",0,[6,172,14,150],[["/practice/#count-pairs-in-two-arrays","Solution"]]],[1886,"Determine Whether Matrix Can Be Obtained By Rotation","determine-whether-matrix-can-be-obtained-by-rotation",0,[6,96],[["/practice/#determine-whether-matrix-can-be-obtained-by-rotation","Solution"]]],[1887,"Reduction Operations to Make the Array Elements Equal","reduction-operations-to-make-the-array-elements-equal",0,[6,150],[["/practice/#reduction-operations-to-make-the-array-elements-equal","Solution"]]],[1888,"Minimum Number of Flips to Make the Binary String Alternating","minimum-number-of-flips-to-make-the-binary-string-alternating",0,[155,48,146],[["/practice/#minimum-number-of-flips-to-make-the-binary-string-alternating","Solution"]]],[1889,"Minimum Space Wasted From Packaging","minimum-space-wasted-from-packaging",0,[6,14,122,150],[["/practice/#minimum-space-wasted-from-packaging","Solution"]]],[1890,"The Latest Login in 2020","the-latest-login-in-2020",1,[40],[["/practice/#the-latest-login-in-2020","Solution"]]],[1891,"Cutting Ribbons","cutting-ribbons",0,[6,14],[["/practice/#cutting-ribbons","Solution"]]],[1892,"Page Recommendations II","page-recommendations-ii",1,[40],[["/practice/#page-recommendations-ii","Solution"]]],[1893,"Check if All the Integers in a Range Are Covered","check-if-all-the-integers-in-a-range-are-covered",0,[6,71,122],[["/practice/#check-if-all-the-integers-in-a-range-are-covered","Solution"]]],[1894,"Find the Student that Will Replace the Chalk","find-the-student-that-will-replace-the-chalk",0,[6,14,122,145],[["/practice/#find-the-student-that-will-replace-the-chalk","Solution"]]],[1895,"Largest Magic Square","largest-magic-square",0,[6,96,122],[["/practice/#largest-magic-square","Solution"]]],[1896,"Minimum Cost to Change the Final Value of Expression","minimum-cost-to-change-the-final-value-of-expression",0,[154,95,155,48],[["/practice/#minimum-cost-to-change-the-final-value-of-expression","Solution"]]],[1897,"Redistribute Characters to Make All Strings Equal","redistribute-characters-to-make-all-strings-equal",0,[71,155,36],[["/practice/#redistribute-characters-to-make-all-strings-equal","Solution"]]],[1898,"Maximum Number of Removable Characters","maximum-number-of-removable-characters",0,[6,172,155,14],[["/practice/#maximum-number-of-removable-characters","Solution"]]],[1899,"Merge Triplets to Form Target Triplet","merge-triplets-to-form-target-triplet",0,[68,6],[["/practice/#merge-triplets-to-form-target-triplet","Solution"]]],[1900,"The Earliest and Latest Rounds Where Players Compete","the-earliest-and-latest-rounds-where-players-compete",0,[100,48],[["/practice/#the-earliest-and-latest-rounds-where-players-compete","Solution"]]],[1901,"Find a Peak Element II","find-a-peak-element-ii",0,[6,14,96],[["/practice/#find-a-peak-element-ii","Solution"]]],[1902,"Depth of BST Given Insertion Order","depth-of-bst-given-insertion-order",0,[168,15,6,16,113],[["/practice/#depth-of-bst-given-insertion-order","Solution"]]],[1903,"Largest Odd Number in String","largest-odd-number-in-string",0,[68,95,155],[["/practice/#largest-odd-number-in-string","Solution"]]],[1904,"The Number of Full Rounds You Have Played","the-number-of-full-rounds-you-have-played",0,[95,155],[["/practice/#the-number-of-full-rounds-you-have-played","Solution"]]],[1905,"Count Sub Islands","count-sub-islands",0,[41,25,174,6,96],[["/practice/#count-sub-islands","Solution"]]],[1906,"Minimum Absolute Difference Queries","minimum-absolute-difference-queries",0,[6,122],[["/practice/#minimum-absolute-difference-queries","Solution"]]],[1907,"Count Salary Categories","count-salary-categories",1,[40],[["/practice/#count-salary-categories","Solution"]]],[1908,"Game of Nim","game-of-nim",0,[18,24,6,95,48,62,111,0,75],[["/practice/#game-of-nim","Solution"]]],[1909,"Remove One Element to Make the Array Strictly Increasing","remove-one-element-to-make-the-array-strictly-increasing",0,[6],[["/practice/#remove-one-element-to-make-the-array-strictly-increasing","Solution"]]],[1910,"Remove All Occurrences of a Substring","remove-all-occurrences-of-a-substring",0,[154,155,145],[["/practice/#remove-all-occurrences-of-a-substring","Solution"]]],[1911,"Maximum Alternating Subsequence Sum","maximum-alternating-subsequence-sum",0,[6,48],[["/practice/#maximum-alternating-subsequence-sum","Solution"]]],[1912,"Design Movie Rental System","design-movie-rental-system",0,[42,6,71,113,72],[["/practice/#design-movie-rental-system","Solution"]]],[1913,"Maximum Product Difference Between Two Pairs","maximum-product-difference-between-two-pairs",0,[6,150,129],[["/practice/#maximum-product-difference-between-two-pairs","Solution"]]],[1914,"Cyclically Rotating a Grid","cyclically-rotating-a-grid",0,[6,96,145],[["/practice/#cyclically-rotating-a-grid","Solution"]]],[1915,"Number of Wonderful Substrings","number-of-wonderful-substrings",0,[18,71,155,122],[["/practice/#number-of-wonderful-substrings","Solution"]]],[1916,"Count Ways to Build Rooms in an Ant Colony","count-ways-to-build-rooms-in-an-ant-colony",0,[168,41,64,165,6,95,48,33,169,59],[["/practice/#count-ways-to-build-rooms-in-an-ant-colony","Solution"]]],[1917,"Leetcodify Friends Recommendations","leetcodify-friends-recommendations",1,[40],[["/practice/#leetcodify-friends-recommendations","Solution"]]],[1918,"Kth Smallest Subarray Sum","kth-smallest-subarray-sum",0,[6,14,146],[["/practice/#kth-smallest-subarray-sum","Solution"]]],[1919,"Leetcodify Similar Friends","leetcodify-similar-friends",1,[40],[["/practice/#leetcodify-similar-friends","Solution"]]],[1920,"Build Array from Permutation","build-array-from-permutation",0,[6,145],[["/practice/#build-array-from-permutation","Solution"]]],[1921,"Eliminate Maximum Number of Monsters","eliminate-maximum-number-of-monsters",0,[68,6,150],[["/practice/#eliminate-maximum-number-of-monsters","Solution"]]],[1922,"Count Good Numbers","count-good-numbers",0,[134,95],[["/practice/#count-good-numbers","Solution"]]],[1923,"Longest Common Subpath","longest-common-subpath",0,[6,14,158,160,70,137,159],[["/practice/#longest-common-subpath","Solution"]]],[1924,"Erect the Fence II","erect-the-fence-ii",0,[63,6,95,147],[["/practice/#erect-the-fence-ii","Solution"]]],[1925,"Count Square Sum Triples","count-square-sum-triples",0,[95,50],[["/practice/#count-square-sum-triples","Solution"]]],[1926,"Nearest Exit from Entrance in Maze","nearest-exit-from-entrance-in-maze",0,[25,6,96],[["/practice/#nearest-exit-from-entrance-in-maze","Solution"]]],[1927,"Sum Game","sum-game",0,[68,95,155,62],[["/practice/#sum-game","Solution"]]],[1928,"Minimum Cost to Reach Destination in Time","minimum-cost-to-reach-destination-in-time",0,[64,6,48,43],[["/practice/#minimum-cost-to-reach-destination-in-time","Solution"]]],[1929,"Concatenation of Array","concatenation-of-array",0,[6,145],[["/practice/#concatenation-of-array","Solution"]]],[1930,"Unique Length-3 Palindromic Subsequences","unique-length-3-palindromic-subsequences",0,[18,71,155,122],[["/practice/#unique-length-3-palindromic-subsequences","Solution"]]],[1931,"Painting a Grid With Three Different Colors","painting-a-grid-with-three-different-colors",0,[48,65],[["/practice/#painting-a-grid-with-three-different-colors","Solution"]]],[1932,"Merge BSTs to Create Single BST","merge-bsts-to-create-single-bst",0,[168,41,15,6,71,16],[["/practice/#merge-bsts-to-create-single-bst","Solution"]]],[1933,"Check if String Is Decomposable Into Value-Equal Substrings","check-if-string-is-decomposable-into-value-equal-substrings",0,[155],[["/practice/#check-if-string-is-decomposable-into-value-equal-substrings","Solution"]]],[1934,"Confirmation Rate","confirmation-rate",1,[40],[["/practice/#confirmation-rate","Solution"]]],[1935,"Maximum Number of Words You Can Type","maximum-number-of-words-you-can-type",0,[71,155],[["/practice/#maximum-number-of-words-you-can-type","Solution"]]],[1936,"Add Minimum Number of Rungs","add-minimum-number-of-rungs",0,[68,6],[["/practice/#add-minimum-number-of-rungs","Solution"]]],[1937,"Maximum Number of Points with Cost","maximum-number-of-points-with-cost",0,[6,48,96],[["/practice/#maximum-number-of-points-with-cost","Solution"]]],[1938,"Maximum Genetic Difference Query","maximum-genetic-difference-query",0,[18,41,171,6,71],[["/practice/#maximum-genetic-difference-query","Solution"]]],[1939,"Users That Actively Request Confirmation Messages","users-that-actively-request-confirmation-messages",1,[40],[["/practice/#users-that-actively-request-confirmation-messages","Solution"]]],[1940,"Longest Common Subsequence Between Sorted Arrays","longest-common-subsequence-between-sorted-arrays",0,[6,71,36],[["/practice/#longest-common-subsequence-between-sorted-arrays","Solution"]]],[1941,"Check if All Characters Have Equal Number of Occurrences","check-if-all-characters-have-equal-number-of-occurrences",0,[71,155,36],[["/practice/#check-if-all-characters-have-equal-number-of-occurrences","Solution"]]],[1942,"The Number of the Smallest Unoccupied Chair","the-number-of-the-smallest-unoccupied-chair",0,[6,71,72],[["/practice/#the-number-of-the-smallest-unoccupied-chair","Solution"]]],[1943,"Describe the Painting","describe-the-painting",0,[6,71,122,150],[["/practice/#describe-the-painting","Solution"]]],[1944,"Number of Visible People in a Queue","number-of-visible-people-in-a-queue",0,[154,6,108],[["/practice/#number-of-visible-people-in-a-queue","Solution"]]],[1945,"Sum of Digits of String After Convert","sum-of-digits-of-string-after-convert",0,[155,145],[["/practice/#sum-of-digits-of-string-after-convert","Solution"]]],[1946,"Largest Number After Mutating Substring","largest-number-after-mutating-substring",0,[68,6,155],[["/practice/#largest-number-after-mutating-substring","Solution"]]],[1947,"Maximum Compatibility Score Sum","maximum-compatibility-score-sum",0,[18,6,48,8,19,74,17,66,103,138,117,109],[["/practice/#maximum-compatibility-score-sum","Solution"]]],[1948,"Delete Duplicate Folders in System","delete-duplicate-folders-in-system",0,[41,171,6,71,155,150,70],[["/practice/#delete-duplicate-folders-in-system","Solution"]]],[1949,"Strong Friendship","strong-friendship",1,[40],[["/practice/#strong-friendship","Solution"]]],[1950,"Maximum of Minimum Values in All Subarrays","maximum-of-minimum-values-in-all-subarrays",0,[154,6,31,108],[["/practice/#maximum-of-minimum-values-in-all-subarrays","Solution"]]],[1951,"All the Pairs With the Maximum Number of Common Followers","all-the-pairs-with-the-maximum-number-of-common-followers",1,[40],[["/practice/#all-the-pairs-with-the-maximum-number-of-common-followers","Solution"]]],[1952,"Three Divisors","three-divisors",0,[95,50,112,143,125],[["/practice/#three-divisors","Solution"]]],[1953,"Maximum Number of Weeks for Which You Can Work","maximum-number-of-weeks-for-which-you-can-work",0,[68,6],[["/practice/#maximum-number-of-weeks-for-which-you-can-work","Solution"]]],[1954,"Minimum Garden Perimeter to Collect Enough Apples","minimum-garden-perimeter-to-collect-enough-apples",0,[95,14],[["/practice/#minimum-garden-perimeter-to-collect-enough-apples","Solution"]]],[1955,"Count Number of Special Subsequences","count-number-of-special-subsequences",0,[6,48],[["/practice/#count-number-of-special-subsequences","Solution"]]],[1956,"Minimum Time For K Virus Variants to Spread","minimum-time-for-k-virus-variants-to-spread",0,[63,6,95,14,50,113,146],[["/practice/#minimum-time-for-k-virus-variants-to-spread","Solution"]]],[1957,"Delete Characters to Make Fancy String","delete-characters-to-make-fancy-string",0,[155],[["/practice/#delete-characters-to-make-fancy-string","Solution"]]],[1958,"Check if Move is Legal","check-if-move-is-legal",0,[6,50,96],[["/practice/#check-if-move-is-legal","Solution"]]],[1959,"Minimum Total Space Wasted With K Resizing Operations","minimum-total-space-wasted-with-k-resizing-operations",0,[6,48,122],[["/practice/#minimum-total-space-wasted-with-k-resizing-operations","Solution"]]],[1960,"Maximum Product of the Length of Two Palindromic Substrings","maximum-product-of-the-length-of-two-palindromic-substrings",0,[172,155,94,70,137,114],[["/practice/#maximum-product-of-the-length-of-two-palindromic-substrings","Solution"]]],[1961,"Check If String Is a Prefix of Array","check-if-string-is-a-prefix-of-array",0,[6,172,155],[["/practice/#check-if-string-is-a-prefix-of-array","Solution"]]],[1962,"Remove Stones to Minimize the Total","remove-stones-to-minimize-the-total",0,[68,6,72],[["/practice/#remove-stones-to-minimize-the-total","Solution"]]],[1963,"Minimum Number of Swaps to Make the String Balanced","minimum-number-of-swaps-to-make-the-string-balanced",0,[154,68,172,155,116],[["/practice/#minimum-number-of-swaps-to-make-the-string-balanced","Solution"]]],[1964,"Find the Longest Valid Obstacle Course at Each Position","find-the-longest-valid-obstacle-course-at-each-position",0,[12,6,14,90],[["/practice/#find-the-longest-valid-obstacle-course-at-each-position","Solution"]]],[1965,"Employees With Missing Information","employees-with-missing-information",1,[40],[["/practice/#employees-with-missing-information","Solution"]]],[1966,"Binary Searchable Numbers in an Unsorted Array","binary-searchable-numbers-in-an-unsorted-array",0,[154,6,14,108],[["/practice/#binary-searchable-numbers-in-an-unsorted-array","Solution"]]],[1967,"Number of Strings That Appear as Substrings in Word","number-of-strings-that-appear-as-substrings-in-word",0,[6,155],[["/practice/#number-of-strings-that-appear-as-substrings-in-word","Solution"]]],[1968,"Array With Elements Not Equal to Average of Neighbors","array-with-elements-not-equal-to-average-of-neighbors",0,[68,6,150],[["/practice/#array-with-elements-not-equal-to-average-of-neighbors","Solution"]]],[1969,"Minimum Non-Zero Product of the Array Elements","minimum-non-zero-product-of-the-array-elements",0,[68,134,95],[["/practice/#minimum-non-zero-product-of-the-array-elements","Solution"]]],[1970,"Last Day Where You Can Still Cross","last-day-where-you-can-still-cross",0,[41,25,174,6,14,96],[["/practice/#last-day-where-you-can-still-cross","Solution"]]],[1971,"Find if Path Exists in Graph","find-if-path-exists-in-graph",0,[41,25,174,64],[["/practice/#find-if-path-exists-in-graph","Solution"]]],[1972,"First and Last Call On the Same Day","first-and-last-call-on-the-same-day",1,[40],[["/practice/#first-and-last-call-on-the-same-day","Solution"]]],[1973,"Count Nodes Equal to Sum of Descendants","count-nodes-equal-to-sum-of-descendants",0,[168,41,16],[["/practice/#count-nodes-equal-to-sum-of-descendants","Solution"]]],[1974,"Minimum Time to Type Word Using Special Typewriter","minimum-time-to-type-word-using-special-typewriter",0,[68,155],[["/practice/#minimum-time-to-type-word-using-special-typewriter","Solution"]]],[1975,"Maximum Matrix Sum","maximum-matrix-sum",0,[68,6,96],[["/practice/#maximum-matrix-sum","Solution"]]],[1976,"Number of Ways to Arrive at Destination","number-of-ways-to-arrive-at-destination",0,[64,165,48,142,43],[["/practice/#number-of-ways-to-arrive-at-destination","Solution"]]],[1977,"Number of Ways to Separate Numbers","number-of-ways-to-separate-numbers",0,[155,48,122],[["/practice/#number-of-ways-to-separate-numbers","Solution"]]],[1978,"Employees Whose Manager Left the Company","employees-whose-manager-left-the-company",1,[40],[["/practice/#employees-whose-manager-left-the-company","Solution"]]],[1979,"Find Greatest Common Divisor of Array","find-greatest-common-divisor-of-array",0,[6,95,67,112,51],[["/practice/#find-greatest-common-divisor-of-array","Solution"]]],[1980,"Find Unique Binary String","find-unique-binary-string",0,[6,71,155,8],[["/practice/#find-unique-binary-string","Solution"]]],[1981,"Minimize the Difference Between Target and Chosen Elements","minimize-the-difference-between-target-and-chosen-elements",0,[6,48,96],[["/practice/#minimize-the-difference-between-target-and-chosen-elements","Solution"]]],[1982,"Find Array Given Subset Sums","find-array-given-subset-sums",0,[6,71,36,150],[["/practice/#find-array-given-subset-sums","Solution"]]],[1983,"Widest Pair of Indices With Equal Range Sum","widest-pair-of-indices-with-equal-range-sum",0,[6,71,122],[["/practice/#widest-pair-of-indices-with-equal-range-sum","Solution"]]],[1984,"Minimum Difference Between Highest and Lowest of K Scores","minimum-difference-between-highest-and-lowest-of-k-scores",0,[6,150,146],[["/practice/#minimum-difference-between-highest-and-lowest-of-k-scores","Solution"]]],[1985,"Find the Kth Largest Integer in the Array","find-the-kth-largest-integer-in-the-array",0,[6,155,46,130,150,72],[["/practice/#find-the-kth-largest-integer-in-the-array","Solution"]]],[1986,"Minimum Number of Work Sessions to Finish the Tasks","minimum-number-of-work-sessions-to-finish-the-tasks",0,[18,6,48,8,19],[["/practice/#minimum-number-of-work-sessions-to-finish-the-tasks","Solution"]]],[1987,"Number of Unique Good Subsequences","number-of-unique-good-subsequences",0,[155,48],[["/practice/#number-of-unique-good-subsequences","Solution"]]],[1988,"Find Cutoff Score for Each School","find-cutoff-score-for-each-school",1,[40],[["/practice/#find-cutoff-score-for-each-school","Solution"]]],[1989,"Maximum Number of People That Can Be Caught in Tag","maximum-number-of-people-that-can-be-caught-in-tag",0,[68,6,172],[["/practice/#maximum-number-of-people-that-can-be-caught-in-tag","Solution"]]],[1990,"Count the Number of Experiments","count-the-number-of-experiments",1,[40],[["/practice/#count-the-number-of-experiments","Solution"]]],[1991,"Find the Middle Index in Array","find-the-middle-index-in-array",0,[6,122],[["/practice/#find-the-middle-index-in-array","Solution"]]],[1992,"Find All Groups of Farmland","find-all-groups-of-farmland",0,[41,25,6,96],[["/practice/#find-all-groups-of-farmland","Solution"]]],[1993,"Operations on Tree","operations-on-tree",0,[168,41,25,42,6,71],[["/practice/#operations-on-tree","Solution"]]],[1994,"The Number of Good Subsets","the-number-of-good-subsets",0,[18,6,71,95,48,19,36,112,143],[["/practice/#the-number-of-good-subsets","Solution"]]],[1995,"Count Special Quadruplets","count-special-quadruplets",0,[6,71,50],[["/practice/#count-special-quadruplets","Solution"]]],[1996,"The Number of Weak Characters in the Game","the-number-of-weak-characters-in-the-game",0,[154,68,6,150,108],[["/practice/#the-number-of-weak-characters-in-the-game","Solution"]]],[1997,"First Day Where You Have Been in All the Rooms","first-day-where-you-have-been-in-all-the-rooms",0,[6,48],[["/practice/#first-day-where-you-have-been-in-all-the-rooms","Solution"]]],[1998,"GCD Sort of an Array","gcd-sort-of-an-array",0,[174,6,95,67,112,150,125,51],[["/practice/#gcd-sort-of-an-array","Solution"]]],[1999,"Smallest Greater Multiple Made of Two Digits","smallest-greater-multiple-made-of-two-digits",0,[95,50],[["/practice/#smallest-greater-multiple-made-of-two-digits","Solution"]]],[2000,"Reverse Prefix of Word","reverse-prefix-of-word",0,[154,172,155],[["/practice/#reverse-prefix-of-word","Solution"]]],[2001,"Number of Pairs of Interchangeable Rectangles","number-of-pairs-of-interchangeable-rectangles",0,[6,71,95,36,112],[["/practice/#number-of-pairs-of-interchangeable-rectangles","Solution"]]],[2002,"Maximum Product of the Length of Two Palindromic Subsequences","maximum-product-of-the-length-of-two-palindromic-subsequences",0,[18,155,48,8,19],[["/practice/#maximum-product-of-the-length-of-two-palindromic-subsequences","Solution"]]],[2003,"Smallest Missing Genetic Value in Each Subtree","smallest-missing-genetic-value-in-each-subtree",0,[168,41,174,6,48],[["/practice/#smallest-missing-genetic-value-in-each-subtree","Solution"]]],[2004,"The Number of Seniors and Juniors to Join the Company","the-number-of-seniors-and-juniors-to-join-the-company",1,[40],[["/practice/#the-number-of-seniors-and-juniors-to-join-the-company","Solution"]]],[2005,"Subtree Removal Game with Fibonacci Tree","subtree-removal-game-with-fibonacci-tree",0,[168,95,48,16,62,0],[["/practice/#subtree-removal-game-with-fibonacci-tree","Solution"]]],[2006,"Count Number of Pairs With Absolute Difference K","count-number-of-pairs-with-absolute-difference-k",0,[6,71,36],[["/practice/#count-number-of-pairs-with-absolute-difference-k","Solution"]]],[2007,"Find Original Array From Doubled Array","find-original-array-from-doubled-array",0,[68,6,71,150],[["/practice/#find-original-array-from-doubled-array","Solution"]]],[2008,"Maximum Earnings From Taxi","maximum-earnings-from-taxi",0,[6,71,14,48,150],[["/practice/#maximum-earnings-from-taxi","Solution"]]],[2009,"Minimum Number of Operations to Make Array Continuous","minimum-number-of-operations-to-make-array-continuous",0,[6,71,14,146],[["/practice/#minimum-number-of-operations-to-make-array-continuous","Solution"]]],[2010,"The Number of Seniors and Juniors to Join the Company II","the-number-of-seniors-and-juniors-to-join-the-company-ii",1,[40],[["/practice/#the-number-of-seniors-and-juniors-to-join-the-company-ii","Solution"]]],[2011,"Final Value of Variable After Performing Operations","final-value-of-variable-after-performing-operations",0,[6,155,145],[["/practice/#final-value-of-variable-after-performing-operations","Solution"]]],[2012,"Sum of Beauty in the Array","sum-of-beauty-in-the-array",0,[6],[["/practice/#sum-of-beauty-in-the-array","Solution"]]],[2013,"Detect Squares","detect-squares",0,[42,6,71,36,39],[["/practice/#detect-squares","Solution"]]],[2014,"Longest Subsequence Repeated k Times","longest-subsequence-repeated-k-times",0,[71,172,155,8,36,50],[["/practice/#longest-subsequence-repeated-k-times","Solution"]]],[2015,"Average Height of Buildings in Each Segment","average-height-of-buildings-in-each-segment",0,[6,122,150,72],[["/practice/#average-height-of-buildings-in-each-segment","Solution"]]],[2016,"Maximum Difference Between Increasing Elements","maximum-difference-between-increasing-elements",0,[6],[["/practice/#maximum-difference-between-increasing-elements","Solution"]]],[2017,"Grid Game","grid-game",0,[6,96,122],[["/practice/#grid-game","Solution"]]],[2018,"Check if Word Can Be Placed In Crossword","check-if-word-can-be-placed-in-crossword",0,[6,50,96],[["/practice/#check-if-word-can-be-placed-in-crossword","Solution"]]],[2019,"The Score of Students Solving Math Expression","the-score-of-students-solving-math-expression",0,[154,100,6,71,95,155,48],[["/practice/#the-score-of-students-solving-math-expression","Solution"]]],[2020,"Number of Accounts That Did Not Stream","number-of-accounts-that-did-not-stream",1,[40],[["/practice/#number-of-accounts-that-did-not-stream","Solution"]]],[2021,"Brightest Position on Street","brightest-position-on-street",0,[6,113,122,150],[["/practice/#brightest-position-on-street","Solution"]]],[2022,"Convert 1D Array Into 2D Array","convert-1d-array-into-2d-array",0,[6,96,145],[["/practice/#convert-1d-array-into-2d-array","Solution"]]],[2023,"Number of Pairs of Strings With Concatenation Equal to Target","number-of-pairs-of-strings-with-concatenation-equal-to-target",0,[6,71,155,36],[["/practice/#number-of-pairs-of-strings-with-concatenation-equal-to-target","Solution"]]],[2024,"Maximize the Confusion of an Exam","maximize-the-confusion-of-an-exam",0,[155,14,122,146],[["/practice/#maximize-the-confusion-of-an-exam","Solution"]]],[2025,"Maximum Number of Ways to Partition an Array","maximum-number-of-ways-to-partition-an-array",0,[6,71,36,50,122],[["/practice/#maximum-number-of-ways-to-partition-an-array","Solution"]]],[2026,"Low-Quality Problems","low-quality-problems",1,[40],[["/practice/#low-quality-problems","Solution"]]],[2027,"Minimum Moves to Convert String","minimum-moves-to-convert-string",0,[68,155],[["/practice/#minimum-moves-to-convert-string","Solution"]]],[2028,"Find Missing Observations","find-missing-observations",0,[6,95,145],[["/practice/#find-missing-observations","Solution"]]],[2029,"Stone Game IX","stone-game-ix",0,[68,104,6,95,36,62,111,175],[["/practice/#stone-game-ix","Solution"]]],[2030,"Smallest K-Length Subsequence With Occurrences of a Letter","smallest-k-length-subsequence-with-occurrences-of-a-letter",0,[154,68,155,108],[["/practice/#smallest-k-length-subsequence-with-occurrences-of-a-letter","Solution"]]],[2031,"Count Subarrays With More Ones Than Zeros","count-subarrays-with-more-ones-than-zeros",0,[12,139,6,71,14,46,113,101],[["/practice/#count-subarrays-with-more-ones-than-zeros","Solution"]]],[2032,"Two Out of Three","two-out-of-three",0,[18,6,71],[["/practice/#two-out-of-three","Solution"]]],[2033,"Minimum Operations to Make a Uni-Value Grid","minimum-operations-to-make-a-uni-value-grid",0,[6,95,96,150],[["/practice/#minimum-operations-to-make-a-uni-value-grid","Solution"]]],[2034,"Stock Price Fluctuation ","stock-price-fluctuation",0,[42,71,39,113,72],[["/practice/#stock-price-fluctuation","Solution"]]],[2035,"Partition Array Into Two Arrays to Minimize Sum Difference","partition-array-into-two-arrays-to-minimize-sum-difference",0,[18,6,172,14,48,19,113,150,99],[["/patterns/reasoning-moves-that-unlock-problems/","Ch. 03"],["/practice/#partition-array-into-two-arrays-to-minimize-sum-difference","Solution"]]],[2036,"Maximum Alternating Subarray Sum","maximum-alternating-subarray-sum",0,[6,48],[["/practice/#maximum-alternating-subarray-sum","Solution"]]],[2037,"Minimum Number of Moves to Seat Everyone","minimum-number-of-moves-to-seat-everyone",0,[68,6,37,150],[["/practice/#minimum-number-of-moves-to-seat-everyone","Solution"]]],[2038,"Remove Colored Pieces if Both Neighbors are the Same Color","remove-colored-pieces-if-both-neighbors-are-the-same-color",0,[68,95,155,62],[["/practice/#remove-colored-pieces-if-both-neighbors-are-the-same-color","Solution"]]],[2039,"The Time When the Network Becomes Idle","the-time-when-the-network-becomes-idle",0,[25,64,6],[["/practice/#the-time-when-the-network-becomes-idle","Solution"]]],[2040,"Kth Smallest Product of Two Sorted Arrays","kth-smallest-product-of-two-sorted-arrays",0,[6,14],[["/practice/#kth-smallest-product-of-two-sorted-arrays","Solution"]]],[2041,"Accepted Candidates From the Interviews","accepted-candidates-from-the-interviews",1,[40],[["/practice/#accepted-candidates-from-the-interviews","Solution"]]],[2042,"Check if Numbers Are Ascending in a Sentence","check-if-numbers-are-ascending-in-a-sentence",0,[155],[["/practice/#check-if-numbers-are-ascending-in-a-sentence","Solution"]]],[2043,"Simple Bank System","simple-bank-system",0,[42,6,71,145],[["/practice/#simple-bank-system","Solution"]]],[2044,"Count Number of Maximum Bitwise-OR Subsets","count-number-of-maximum-bitwise-or-subsets",0,[18,6,8,50],[["/practice/#count-number-of-maximum-bitwise-or-subsets","Solution"]]],[2045,"Second Minimum Time to Reach Destination","second-minimum-time-to-reach-destination",0,[25,64,176,142,43],[["/practice/#second-minimum-time-to-reach-destination","Solution"]]],[2046,"Sort Linked List Already Sorted Using Absolute Values","sort-linked-list-already-sorted-using-absolute-values",0,[88,172,150],[["/practice/#sort-linked-list-already-sorted-using-absolute-values","Solution"]]],[2047,"Number of Valid Words in a Sentence","number-of-valid-words-in-a-sentence",0,[155],[["/practice/#number-of-valid-words-in-a-sentence","Solution"]]],[2048,"Next Greater Numerically Balanced Number","next-greater-numerically-balanced-number",0,[71,95,8,36,50],[["/practice/#next-greater-numerically-balanced-number","Solution"]]],[2049,"Count Nodes With the Highest Score","count-nodes-with-the-highest-score",0,[168,41,6,16,169],[["/practice/#count-nodes-with-the-highest-score","Solution"]]],[2050,"Parallel Courses III","parallel-courses-iii",0,[64,165,6,48,45],[["/practice/#parallel-courses-iii","Solution"]]],[2051,"The Category of Each Member in the Store","the-category-of-each-member-in-the-store",1,[40],[["/practice/#the-category-of-each-member-in-the-store","Solution"]]],[2052,"Minimum Cost to Separate Sentence Into Rows","minimum-cost-to-separate-sentence-into-rows",0,[155,48],[["/practice/#minimum-cost-to-separate-sentence-into-rows","Solution"]]],[2053,"Kth Distinct String in an Array","kth-distinct-string-in-an-array",0,[6,71,155,36],[["/practice/#kth-distinct-string-in-an-array","Solution"]]],[2054,"Two Best Non-Overlapping Events","two-best-non-overlapping-events",0,[6,14,48,150,72],[["/practice/#two-best-non-overlapping-events","Solution"]]],[2055,"Plates Between Candles","plates-between-candles",0,[6,155,14,122],[["/practice/#plates-between-candles","Solution"]]],[2056,"Number of Valid Move Combinations On Chessboard","number-of-valid-move-combinations-on-chessboard",0,[6,155,8,145],[["/practice/#number-of-valid-move-combinations-on-chessboard","Solution"]]],[2057,"Smallest Index With Equal Value","smallest-index-with-equal-value",0,[6],[["/practice/#smallest-index-with-equal-value","Solution"]]],[2058,"Find the Minimum and Maximum Number of Nodes Between Critical Points","find-the-minimum-and-maximum-number-of-nodes-between-critical-points",0,[88],[["/practice/#find-the-minimum-and-maximum-number-of-nodes-between-critical-points","Solution"]]],[2059,"Minimum Operations to Convert Number","minimum-operations-to-convert-number",0,[25,6],[["/practice/#minimum-operations-to-convert-number","Solution"]]],[2060,"Check if an Original String Exists Given Two Encoded Strings","check-if-an-original-string-exists-given-two-encoded-strings",2,[155,48],[["/practice/#check-if-an-original-string-exists-given-two-encoded-strings","Solution"]]],[2061,"Number of Spaces Cleaning Robot Cleaned","number-of-spaces-cleaning-robot-cleaned",0,[6,96,145],[["/practice/#number-of-spaces-cleaning-robot-cleaned","Solution"]]],[2062,"Count Vowel Substrings of a String","count-vowel-substrings-of-a-string",0,[71,155],[["/practice/#count-vowel-substrings-of-a-string","Solution"]]],[2063,"Vowels of All Substrings","vowels-of-all-substrings",0,[95,155,48,33],[["/practice/#vowels-of-all-substrings","Solution"]]],[2064,"Minimized Maximum of Products Distributed to Any Store","minimized-maximum-of-products-distributed-to-any-store",0,[68,6,14],[["/practice/#minimized-maximum-of-products-distributed-to-any-store","Solution"]]],[2065,"Maximum Path Quality of a Graph","maximum-path-quality-of-a-graph",0,[64,6,8],[["/practice/#maximum-path-quality-of-a-graph","Solution"]]],[2066,"Account Balance","account-balance",1,[40],[["/practice/#account-balance","Solution"]]],[2067,"Number of Equal Count Substrings","number-of-equal-count-substrings",0,[71,155,36,146],[["/practice/#number-of-equal-count-substrings","Solution"]]],[2068,"Check Whether Two Strings are Almost Equivalent","check-whether-two-strings-are-almost-equivalent",0,[71,155,36],[["/practice/#check-whether-two-strings-are-almost-equivalent","Solution"]]],[2069,"Walking Robot Simulation II","walking-robot-simulation-ii",0,[42,145],[["/practice/#walking-robot-simulation-ii","Solution"]]],[2070,"Most Beautiful Item for Each Query","most-beautiful-item-for-each-query",0,[6,14,150],[["/practice/#most-beautiful-item-for-each-query","Solution"]]],[2071,"Maximum Number of Tasks You Can Assign","maximum-number-of-tasks-you-can-assign",0,[68,128,6,172,14,150,107],[["/practice/#maximum-number-of-tasks-you-can-assign","Solution"]]],[2072,"The Winner University","the-winner-university",1,[40],[["/practice/#the-winner-university","Solution"]]],[2073,"Time Needed to Buy Tickets","time-needed-to-buy-tickets",0,[128,6,145],[["/practice/#time-needed-to-buy-tickets","Solution"]]],[2074,"Reverse Nodes in Even Length Groups","reverse-nodes-in-even-length-groups",0,[88],[["/practice/#reverse-nodes-in-even-length-groups","Solution"]]],[2075,"Decode the Slanted Ciphertext","decode-the-slanted-ciphertext",0,[155,145],[["/practice/#decode-the-slanted-ciphertext","Solution"]]],[2076,"Process Restricted Friend Requests","process-restricted-friend-requests",0,[174,64],[["/practice/#process-restricted-friend-requests","Solution"]]],[2077,"Paths in Maze That Lead to Same Room","paths-in-maze-that-lead-to-same-room",0,[64],[["/practice/#paths-in-maze-that-lead-to-same-room","Solution"]]],[2078,"Two Furthest Houses With Different Colors","two-furthest-houses-with-different-colors",0,[68,6],[["/practice/#two-furthest-houses-with-different-colors","Solution"]]],[2079,"Watering Plants","watering-plants",0,[6,145],[["/practice/#watering-plants","Solution"]]],[2080,"Range Frequency Queries","range-frequency-queries",0,[42,139,6,71,14],[["/practice/#range-frequency-queries","Solution"]]],[2081,"Sum of k-Mirror Numbers","sum-of-k-mirror-numbers",0,[95,50],[["/practice/#sum-of-k-mirror-numbers","Solution"]]],[2082,"The Number of Rich Customers","the-number-of-rich-customers",1,[40],[["/practice/#the-number-of-rich-customers","Solution"]]],[2083,"Substrings That Begin and End With the Same Letter","substrings-that-begin-and-end-with-the-same-letter",0,[71,95,155,36,122],[["/practice/#substrings-that-begin-and-end-with-the-same-letter","Solution"]]],[2084,"Drop Type 1 Orders for Customers With Type 0 Orders","drop-type-1-orders-for-customers-with-type-0-orders",1,[40],[["/practice/#drop-type-1-orders-for-customers-with-type-0-orders","Solution"]]],[2085,"Count Common Words With One Occurrence","count-common-words-with-one-occurrence",0,[6,71,155,36],[["/practice/#count-common-words-with-one-occurrence","Solution"]]],[2086,"Minimum Number of Food Buckets to Feed the Hamsters","minimum-number-of-food-buckets-to-feed-the-hamsters",0,[68,155,48],[["/practice/#minimum-number-of-food-buckets-to-feed-the-hamsters","Solution"]]],[2087,"Minimum Cost Homecoming of a Robot in a Grid","minimum-cost-homecoming-of-a-robot-in-a-grid",0,[68,6],[["/practice/#minimum-cost-homecoming-of-a-robot-in-a-grid","Solution"]]],[2088,"Count Fertile Pyramids in a Land","count-fertile-pyramids-in-a-land",0,[6,48,96],[["/practice/#count-fertile-pyramids-in-a-land","Solution"]]],[2089,"Find Target Indices After Sorting Array","find-target-indices-after-sorting-array",0,[6,14,150],[["/practice/#find-target-indices-after-sorting-array","Solution"]]],[2090,"K Radius Subarray Averages","k-radius-subarray-averages",0,[6,146],[["/practice/#k-radius-subarray-averages","Solution"]]],[2091,"Removing Minimum and Maximum From Array","removing-minimum-and-maximum-from-array",0,[68,6],[["/practice/#removing-minimum-and-maximum-from-array","Solution"]]],[2092,"Find All People With Secret","find-all-people-with-secret",0,[41,25,174,64,150],[["/practice/#find-all-people-with-secret","Solution"]]],[2093,"Minimum Cost to Reach City With Discounts","minimum-cost-to-reach-city-with-discounts",0,[64,142,43,72],[["/practice/#minimum-cost-to-reach-city-with-discounts","Solution"]]],[2094,"Finding 3-Digit Even Numbers","finding-3-digit-even-numbers",0,[134,6,71,50,150],[["/practice/#finding-3-digit-even-numbers","Solution"]]],[2095,"Delete the Middle Node of a Linked List","delete-the-middle-node-of-a-linked-list",0,[88,172],[["/practice/#delete-the-middle-node-of-a-linked-list","Solution"]]],[2096,"Step-By-Step Directions From a Binary Tree Node to Another","step-by-step-directions-from-a-binary-tree-node-to-another",0,[168,41,155,16,91,13],[["/practice/#step-by-step-directions-from-a-binary-tree-node-to-another","Solution"]]],[2097,"Valid Arrangement of Pairs","valid-arrangement-of-pairs",0,[41,64,6,56,54,140],[["/practice/#valid-arrangement-of-pairs","Solution"]]],[2098,"Subsequence of Size K With the Largest Even Sum","subsequence-of-size-k-with-the-largest-even-sum",0,[68,6,150],[["/practice/#subsequence-of-size-k-with-the-largest-even-sum","Solution"]]],[2099,"Find Subsequence of Length K With the Largest Sum","find-subsequence-of-length-k-with-the-largest-sum",0,[6,71,150,72],[["/practice/#find-subsequence-of-length-k-with-the-largest-sum","Solution"]]],[2100,"Find Good Days to Rob the Bank","find-good-days-to-rob-the-bank",0,[6,48,122],[["/practice/#find-good-days-to-rob-the-bank","Solution"]]],[2101,"Detonate the Maximum Bombs","detonate-the-maximum-bombs",0,[41,25,64,63,6,95],[["/practice/#detonate-the-maximum-bombs","Solution"]]],[2102,"Sequentially Ordinal Rank Tracker","sequentially-ordinal-rank-tracker",0,[42,39,113,72],[["/practice/#sequentially-ordinal-rank-tracker","Solution"]]],[2103,"Rings and Rods","rings-and-rods",0,[71,155],[["/practice/#rings-and-rods","Solution"]]],[2104,"Sum of Subarray Ranges","sum-of-subarray-ranges",0,[154,6,108],[["/practice/#sum-of-subarray-ranges","Solution"]]],[2105,"Watering Plants II","watering-plants-ii",0,[6,172,145],[["/practice/#watering-plants-ii","Solution"]]],[2106,"Maximum Fruits Harvested After at Most K Steps","maximum-fruits-harvested-after-at-most-k-steps",0,[6,14,122,146],[["/practice/#maximum-fruits-harvested-after-at-most-k-steps","Solution"]]],[2107,"Number of Unique Flavors After Sharing K Candies","number-of-unique-flavors-after-sharing-k-candies",0,[6,71,146],[["/practice/#number-of-unique-flavors-after-sharing-k-candies","Solution"]]],[2108,"Find First Palindromic String in the Array","find-first-palindromic-string-in-the-array",0,[6,172,155],[["/practice/#find-first-palindromic-string-in-the-array","Solution"]]],[2109,"Adding Spaces to a String","adding-spaces-to-a-string",0,[6,172,155,145],[["/practice/#adding-spaces-to-a-string","Solution"]]],[2110,"Number of Smooth Descent Periods of a Stock","number-of-smooth-descent-periods-of-a-stock",0,[6,95,172,48,146],[["/practice/#number-of-smooth-descent-periods-of-a-stock","Solution"]]],[2111,"Minimum Operations to Make the Array K-Increasing","minimum-operations-to-make-the-array-k-increasing",0,[6,14,90],[["/practice/#minimum-operations-to-make-the-array-k-increasing","Solution"]]],[2112,"The Airport With the Most Traffic","the-airport-with-the-most-traffic",1,[40],[["/practice/#the-airport-with-the-most-traffic","Solution"]]],[2113,"Elements in Array After Removing and Replacing Elements","elements-in-array-after-removing-and-replacing-elements",0,[6],[["/practice/#elements-in-array-after-removing-and-replacing-elements","Solution"]]],[2114,"Maximum Number of Words Found in Sentences","maximum-number-of-words-found-in-sentences",0,[6,155],[["/practice/#maximum-number-of-words-found-in-sentences","Solution"]]],[2115,"Find All Possible Recipes from Given Supplies","find-all-possible-recipes-from-given-supplies",0,[64,165,6,71,155,45],[["/practice/#find-all-possible-recipes-from-given-supplies","Solution"]]],[2116,"Check if a Parentheses String Can Be Valid","check-if-a-parentheses-string-can-be-valid",0,[154,68,155,116],[["/practice/#check-if-a-parentheses-string-can-be-valid","Solution"]]],[2117,"Abbreviating the Product of a Range","abbreviating-the-product-of-a-range",0,[95,112],[["/practice/#abbreviating-the-product-of-a-range","Solution"]]],[2118,"Build the Equation","build-the-equation",1,[40],[["/practice/#build-the-equation","Solution"]]],[2119,"A Number After a Double Reversal","a-number-after-a-double-reversal",0,[95],[["/practice/#a-number-after-a-double-reversal","Solution"]]],[2120,"Execution of All Suffix Instructions Staying in a Grid","execution-of-all-suffix-instructions-staying-in-a-grid",0,[155,145],[["/practice/#execution-of-all-suffix-instructions-staying-in-a-grid","Solution"]]],[2121,"Intervals Between Identical Elements","intervals-between-identical-elements",0,[6,71,122],[["/practice/#intervals-between-identical-elements","Solution"]]],[2122,"Recover the Original Array","recover-the-original-array",0,[6,71,172,50,150],[["/practice/#recover-the-original-array","Solution"]]],[2123,"Minimum Operations to Remove Adjacent Ones in Matrix","minimum-operations-to-remove-adjacent-ones-in-matrix",0,[41,64,6,96,49,44,93,127,109],[["/practice/#minimum-operations-to-remove-adjacent-ones-in-matrix","Solution"]]],[2124,"Check if All A's Appears Before All B's","check-if-all-as-appears-before-all-bs",0,[155],[["/practice/#check-if-all-as-appears-before-all-bs","Solution"]]],[2125,"Number of Laser Beams in a Bank","number-of-laser-beams-in-a-bank",0,[6,95,155,96],[["/practice/#number-of-laser-beams-in-a-bank","Solution"]]],[2126,"Destroying Asteroids","destroying-asteroids",0,[68,6,150],[["/practice/#destroying-asteroids","Solution"]]],[2127,"Maximum Employees to Be Invited to a Meeting","maximum-employees-to-be-invited-to-a-meeting",0,[41,64,165,6,48,83,162],[["/practice/#maximum-employees-to-be-invited-to-a-meeting","Solution"]]],[2128,"Remove All Ones With Row and Column Flips","remove-all-ones-with-row-and-column-flips",0,[18,6,95,96],[["/practice/#remove-all-ones-with-row-and-column-flips","Solution"]]],[2129,"Capitalize the Title","capitalize-the-title",0,[155],[["/practice/#capitalize-the-title","Solution"]]],[2130,"Maximum Twin Sum of a Linked List","maximum-twin-sum-of-a-linked-list",0,[154,88,172],[["/practice/#maximum-twin-sum-of-a-linked-list","Solution"]]],[2131,"Longest Palindrome by Concatenating Two Letter Words","longest-palindrome-by-concatenating-two-letter-words",0,[68,6,71,155,36],[["/practice/#longest-palindrome-by-concatenating-two-letter-words","Solution"]]],[2132,"Stamping the Grid","stamping-the-grid",0,[68,6,96,122],[["/practice/#stamping-the-grid","Solution"]]],[2133,"Check if Every Row and Column Contains All Numbers","check-if-every-row-and-column-contains-all-numbers",0,[6,71,96],[["/practice/#check-if-every-row-and-column-contains-all-numbers","Solution"]]],[2134,"Minimum Swaps to Group All 1's Together II","minimum-swaps-to-group-all-1s-together-ii",0,[6,146],[["/practice/#minimum-swaps-to-group-all-1s-together-ii","Solution"]]],[2135,"Count Words Obtained After Adding a Letter","count-words-obtained-after-adding-a-letter",0,[18,6,71,155,150],[["/practice/#count-words-obtained-after-adding-a-letter","Solution"]]],[2136,"Earliest Possible Day of Full Bloom","earliest-possible-day-of-full-bloom",0,[68,6,150],[["/practice/#earliest-possible-day-of-full-bloom","Solution"]]],[2137,"Pour Water Between Buckets to Make Water Levels Equal","pour-water-between-buckets-to-make-water-levels-equal",0,[6,14],[["/practice/#pour-water-between-buckets-to-make-water-levels-equal","Solution"]]],[2138,"Divide a String Into Groups of Size k","divide-a-string-into-groups-of-size-k",0,[155,145],[["/practice/#divide-a-string-into-groups-of-size-k","Solution"]]],[2139,"Minimum Moves to Reach Target Score","minimum-moves-to-reach-target-score",0,[68,95],[["/practice/#minimum-moves-to-reach-target-score","Solution"]]],[2140,"Solving Questions With Brainpower","solving-questions-with-brainpower",0,[6,48],[["/practice/#solving-questions-with-brainpower","Solution"]]],[2141,"Maximum Running Time of N Computers","maximum-running-time-of-n-computers",0,[68,6,14,150],[["/practice/#maximum-running-time-of-n-computers","Solution"]]],[2142,"The Number of Passengers in Each Bus I","the-number-of-passengers-in-each-bus-i",1,[40],[["/practice/#the-number-of-passengers-in-each-bus-i","Solution"]]],[2143,"Choose Numbers From Two Arrays in Range","choose-numbers-from-two-arrays-in-range",0,[6,48],[["/practice/#choose-numbers-from-two-arrays-in-range","Solution"]]],[2144,"Minimum Cost of Buying Candies With Discount","minimum-cost-of-buying-candies-with-discount",0,[68,6,150],[["/practice/#minimum-cost-of-buying-candies-with-discount","Solution"]]],[2145,"Count the Hidden Sequences","count-the-hidden-sequences",0,[6,122],[["/practice/#count-the-hidden-sequences","Solution"]]],[2146,"K Highest Ranked Items Within a Price Range","k-highest-ranked-items-within-a-price-range",0,[25,6,96,150,72],[["/practice/#k-highest-ranked-items-within-a-price-range","Solution"]]],[2147,"Number of Ways to Divide a Long Corridor","number-of-ways-to-divide-a-long-corridor",0,[95,155,48],[["/practice/#number-of-ways-to-divide-a-long-corridor","Solution"]]],[2148,"Count Elements With Strictly Smaller and Greater Elements ","count-elements-with-strictly-smaller-and-greater-elements",0,[6,36,150],[["/practice/#count-elements-with-strictly-smaller-and-greater-elements","Solution"]]],[2149,"Rearrange Array Elements by Sign","rearrange-array-elements-by-sign",0,[6,172,145],[["/practice/#rearrange-array-elements-by-sign","Solution"]]],[2150,"Find All Lonely Numbers in the Array","find-all-lonely-numbers-in-the-array",0,[6,71,36],[["/practice/#find-all-lonely-numbers-in-the-array","Solution"]]],[2151,"Maximum Good People Based on Statements","maximum-good-people-based-on-statements",0,[18,6,8,50],[["/practice/#maximum-good-people-based-on-statements","Solution"]]],[2152,"Minimum Number of Lines to Cover Points","minimum-number-of-lines-to-cover-points",0,[18,63,6,71,95,48,8,19],[["/practice/#minimum-number-of-lines-to-cover-points","Solution"]]],[2153,"The Number of Passengers in Each Bus II","the-number-of-passengers-in-each-bus-ii",1,[40],[["/practice/#the-number-of-passengers-in-each-bus-ii","Solution"]]],[2154,"Keep Multiplying Found Values by Two","keep-multiplying-found-values-by-two",0,[6,71,150,145],[["/practice/#keep-multiplying-found-values-by-two","Solution"]]],[2155,"All Divisions With the Highest Score of a Binary Array","all-divisions-with-the-highest-score-of-a-binary-array",0,[6],[["/practice/#all-divisions-with-the-highest-score-of-a-binary-array","Solution"]]],[2156,"Find Substring With Given Hash Value","find-substring-with-given-hash-value",0,[155,146,70,137],[["/practice/#find-substring-with-given-hash-value","Solution"]]],[2157,"Groups of Strings","groups-of-strings",0,[18,174,6,71,155],[["/practice/#groups-of-strings","Solution"]]],[2158,"Amount of New Area Painted Each Day","amount-of-new-area-painted-each-day",0,[139,6,113],[["/practice/#amount-of-new-area-painted-each-day","Solution"]]],[2159,"Order Two Columns Independently","order-two-columns-independently",1,[40],[["/practice/#order-two-columns-independently","Solution"]]],[2160,"Minimum Sum of Four Digit Number After Splitting Digits","minimum-sum-of-four-digit-number-after-splitting-digits",0,[68,95,150],[["/practice/#minimum-sum-of-four-digit-number-after-splitting-digits","Solution"]]],[2161,"Partition Array According to Given Pivot","partition-array-according-to-given-pivot",0,[6,172,145],[["/practice/#partition-array-according-to-given-pivot","Solution"]]],[2162,"Minimum Cost to Set Cooking Time","minimum-cost-to-set-cooking-time",0,[95,50],[["/practice/#minimum-cost-to-set-cooking-time","Solution"]]],[2163,"Minimum Difference in Sums After Removal of Elements","minimum-difference-in-sums-after-removal-of-elements",0,[6,48,72],[["/practice/#minimum-difference-in-sums-after-removal-of-elements","Solution"]]],[2164,"Sort Even and Odd Indices Independently","sort-even-and-odd-indices-independently",0,[6,150],[["/practice/#sort-even-and-odd-indices-independently","Solution"]]],[2165,"Smallest Value of the Rearranged Number","smallest-value-of-the-rearranged-number",0,[95,150],[["/practice/#smallest-value-of-the-rearranged-number","Solution"]]],[2166,"Design Bitset","design-bitset",0,[42,6,71,155],[["/practice/#design-bitset","Solution"]]],[2167,"Minimum Time to Remove All Cars Containing Illegal Goods","minimum-time-to-remove-all-cars-containing-illegal-goods",0,[155,48],[["/practice/#minimum-time-to-remove-all-cars-containing-illegal-goods","Solution"]]],[2168,"Unique Substrings With Equal Digit Frequency","unique-substrings-with-equal-digit-frequency",0,[71,155,36,70,137],[["/practice/#unique-substrings-with-equal-digit-frequency","Solution"]]],[2169,"Count Operations to Obtain Zero","count-operations-to-obtain-zero",0,[95,145],[["/practice/#count-operations-to-obtain-zero","Solution"]]],[2170,"Minimum Operations to Make the Array Alternating","minimum-operations-to-make-the-array-alternating",0,[68,6,71,36],[["/practice/#minimum-operations-to-make-the-array-alternating","Solution"]]],[2171,"Removing Minimum Number of Magic Beans","removing-minimum-number-of-magic-beans",0,[68,6,50,122,150],[["/practice/#removing-minimum-number-of-magic-beans","Solution"]]],[2172,"Maximum AND Sum of Array","maximum-and-sum-of-array",0,[18,6,48,19],[["/practice/#maximum-and-sum-of-array","Solution"]]],[2173,"Longest Winning Streak","longest-winning-streak",1,[40],[["/practice/#longest-winning-streak","Solution"]]],[2174,"Remove All Ones With Row and Column Flips II","remove-all-ones-with-row-and-column-flips-ii",0,[18,25,6,96],[["/practice/#remove-all-ones-with-row-and-column-flips-ii","Solution"]]],[2175,"The Change in Global Rankings","the-change-in-global-rankings",1,[40],[["/practice/#the-change-in-global-rankings","Solution"]]],[2176,"Count Equal and Divisible Pairs in an Array","count-equal-and-divisible-pairs-in-an-array",0,[6],[["/practice/#count-equal-and-divisible-pairs-in-an-array","Solution"]]],[2177,"Find Three Consecutive Integers That Sum to a Given Number","find-three-consecutive-integers-that-sum-to-a-given-number",0,[95,145],[["/practice/#find-three-consecutive-integers-that-sum-to-a-given-number","Solution"]]],[2178,"Maximum Split of Positive Even Integers","maximum-split-of-positive-even-integers",0,[68,95,8],[["/practice/#maximum-split-of-positive-even-integers","Solution"]]],[2179,"Count Good Triplets in an Array","count-good-triplets-in-an-array",0,[12,139,6,14,46,113,101],[["/practice/#count-good-triplets-in-an-array","Solution"]]],[2180,"Count Integers With Even Digit Sum","count-integers-with-even-digit-sum",0,[95,145],[["/practice/#count-integers-with-even-digit-sum","Solution"]]],[2181,"Merge Nodes in Between Zeros","merge-nodes-in-between-zeros",0,[88,145],[["/practice/#merge-nodes-in-between-zeros","Solution"]]],[2182,"Construct String With Repeat Limit","construct-string-with-repeat-limit",0,[68,71,155,36,72],[["/practice/#construct-string-with-repeat-limit","Solution"]]],[2183,"Count Array Pairs Divisible by K","count-array-pairs-divisible-by-k",0,[6,71,95,36,67,112,51],[["/practice/#count-array-pairs-divisible-by-k","Solution"]]],[2184,"Number of Ways to Build Sturdy Brick Wall","number-of-ways-to-build-sturdy-brick-wall",0,[18,6,48,19],[["/practice/#number-of-ways-to-build-sturdy-brick-wall","Solution"]]],[2185,"Counting Words With a Given Prefix","counting-words-with-a-given-prefix",0,[6,155,156],[["/practice/#counting-words-with-a-given-prefix","Solution"]]],[2186,"Minimum Number of Steps to Make Two Strings Anagram II","minimum-number-of-steps-to-make-two-strings-anagram-ii",0,[71,155,36],[["/practice/#minimum-number-of-steps-to-make-two-strings-anagram-ii","Solution"]]],[2187,"Minimum Time to Complete Trips","minimum-time-to-complete-trips",0,[6,14],[["/practice/#minimum-time-to-complete-trips","Solution"]]],[2188,"Minimum Time to Finish the Race","minimum-time-to-finish-the-race",0,[6,48],[["/practice/#minimum-time-to-finish-the-race","Solution"]]],[2189,"Number of Ways to Build House of Cards","number-of-ways-to-build-house-of-cards",0,[95,48],[["/practice/#number-of-ways-to-build-house-of-cards","Solution"]]],[2190,"Most Frequent Number Following Key In an Array","most-frequent-number-following-key-in-an-array",0,[6,71,36],[["/practice/#most-frequent-number-following-key-in-an-array","Solution"]]],[2191,"Sort the Jumbled Numbers","sort-the-jumbled-numbers",0,[6,150],[["/practice/#sort-the-jumbled-numbers","Solution"]]],[2192,"All Ancestors of a Node in a Directed Acyclic Graph","all-ancestors-of-a-node-in-a-directed-acyclic-graph",0,[41,25,64,165,45],[["/practice/#all-ancestors-of-a-node-in-a-directed-acyclic-graph","Solution"]]],[2193,"Minimum Number of Moves to Make Palindrome","minimum-number-of-moves-to-make-palindrome",0,[68,12,172,155],[["/practice/#minimum-number-of-moves-to-make-palindrome","Solution"]]],[2194,"Cells in a Range on an Excel Sheet","cells-in-a-range-on-an-excel-sheet",0,[155],[["/practice/#cells-in-a-range-on-an-excel-sheet","Solution"]]],[2195,"Append K Integers With Minimal Sum","append-k-integers-with-minimal-sum",0,[68,6,95,150],[["/practice/#append-k-integers-with-minimal-sum","Solution"]]],[2196,"Create Binary Tree From Descriptions","create-binary-tree-from-descriptions",0,[168,6,71,16],[["/practice/#create-binary-tree-from-descriptions","Solution"]]],[2197,"Replace Non-Coprime Numbers in Array","replace-non-coprime-numbers-in-array",0,[154,6,95,67,112,85],[["/practice/#replace-non-coprime-numbers-in-array","Solution"]]],[2198,"Number of Single Divisor Triplets","number-of-single-divisor-triplets",0,[6,36,50],[["/practice/#number-of-single-divisor-triplets","Solution"]]],[2199,"Finding the Topic of Each Post","finding-the-topic-of-each-post",1,[40],[["/practice/#finding-the-topic-of-each-post","Solution"]]],[2200,"Find All K-Distant Indices in an Array","find-all-k-distant-indices-in-an-array",0,[6,172],[["/practice/#find-all-k-distant-indices-in-an-array","Solution"]]],[2201,"Count Artifacts That Can Be Extracted","count-artifacts-that-can-be-extracted",0,[6,71,145],[["/practice/#count-artifacts-that-can-be-extracted","Solution"]]],[2202,"Maximize the Topmost Element After K Moves","maximize-the-topmost-element-after-k-moves",0,[68,6],[["/practice/#maximize-the-topmost-element-after-k-moves","Solution"]]],[2203,"Minimum Weighted Subgraph With the Required Paths","minimum-weighted-subgraph-with-the-required-paths",0,[64,142,72],[["/practice/#minimum-weighted-subgraph-with-the-required-paths","Solution"]]],[2204,"Distance to a Cycle in Undirected Graph","distance-to-a-cycle-in-undirected-graph",0,[41,25,64,165],[["/practice/#distance-to-a-cycle-in-undirected-graph","Solution"]]],[2205,"The Number of Users That Are Eligible for Discount","the-number-of-users-that-are-eligible-for-discount",1,[40],[["/practice/#the-number-of-users-that-are-eligible-for-discount","Solution"]]],[2206,"Divide Array Into Equal Pairs","divide-array-into-equal-pairs",0,[18,6,71,36],[["/practice/#divide-array-into-equal-pairs","Solution"]]],[2207,"Maximize Number of Subsequences in a String","maximize-number-of-subsequences-in-a-string",0,[68,155,122],[["/practice/#maximize-number-of-subsequences-in-a-string","Solution"]]],[2208,"Minimum Operations to Halve Array Sum","minimum-operations-to-halve-array-sum",0,[68,6,72],[["/practice/#minimum-operations-to-halve-array-sum","Solution"]]],[2209,"Minimum White Tiles After Covering With Carpets","minimum-white-tiles-after-covering-with-carpets",0,[155,48,122],[["/practice/#minimum-white-tiles-after-covering-with-carpets","Solution"]]],[2210,"Count Hills and Valleys in an Array","count-hills-and-valleys-in-an-array",0,[6],[["/practice/#count-hills-and-valleys-in-an-array","Solution"]]],[2211,"Count Collisions on a Road","count-collisions-on-a-road",0,[154,155,145],[["/practice/#count-collisions-on-a-road","Solution"]]],[2212,"Maximum Points in an Archery Competition","maximum-points-in-an-archery-competition",0,[18,6,8,50],[["/practice/#maximum-points-in-an-archery-competition","Solution"]]],[2213,"Longest Substring of One Repeating Character","longest-substring-of-one-repeating-character",0,[139,6,155,113],[["/practice/#longest-substring-of-one-repeating-character","Solution"]]],[2214,"Minimum Health to Beat Game","minimum-health-to-beat-game",0,[68,6],[["/practice/#minimum-health-to-beat-game","Solution"]]],[2215,"Find the Difference of Two Arrays","find-the-difference-of-two-arrays",0,[6,71],[["/practice/#find-the-difference-of-two-arrays","Solution"]]],[2216,"Minimum Deletions to Make Array Beautiful","minimum-deletions-to-make-array-beautiful",0,[154,68,6],[["/practice/#minimum-deletions-to-make-array-beautiful","Solution"]]],[2217,"Find Palindrome With Fixed Length","find-palindrome-with-fixed-length",0,[6,95],[["/practice/#find-palindrome-with-fixed-length","Solution"]]],[2218,"Maximum Value of K Coins From Piles","maximum-value-of-k-coins-from-piles",0,[6,48,122],[["/practice/#maximum-value-of-k-coins-from-piles","Solution"]]],[2219,"Maximum Sum Score of Array","maximum-sum-score-of-array",0,[6,122],[["/practice/#maximum-sum-score-of-array","Solution"]]],[2220,"Minimum Bit Flips to Convert Number","minimum-bit-flips-to-convert-number",0,[18],[["/practice/#minimum-bit-flips-to-convert-number","Solution"]]],[2221,"Find Triangular Sum of an Array","find-triangular-sum-of-an-array",0,[6,95,33,112,145],[["/practice/#find-triangular-sum-of-an-array","Solution"]]],[2222,"Number of Ways to Select Buildings","number-of-ways-to-select-buildings",0,[155,48,122],[["/practice/#number-of-ways-to-select-buildings","Solution"]]],[2223,"Sum of Scores of Built Strings","sum-of-scores-of-built-strings",0,[155,14,156,158,70,137,81,58],[["/practice/#sum-of-scores-of-built-strings","Solution"]]],[2224,"Minimum Number of Operations to Convert Time","minimum-number-of-operations-to-convert-time",0,[68,155],[["/practice/#minimum-number-of-operations-to-convert-time","Solution"]]],[2225,"Find Players With Zero or One Losses","find-players-with-zero-or-one-losses",0,[6,71,36,150],[["/practice/#find-players-with-zero-or-one-losses","Solution"]]],[2226,"Maximum Candies Allocated to K Children","maximum-candies-allocated-to-k-children",0,[6,14],[["/practice/#maximum-candies-allocated-to-k-children","Solution"]]],[2227,"Encrypt and Decrypt Strings","encrypt-and-decrypt-strings",0,[42,171,6,71,155],[["/practice/#encrypt-and-decrypt-strings","Solution"]]],[2228,"Users With Two Purchases Within Seven Days","users-with-two-purchases-within-seven-days",1,[40],[["/practice/#users-with-two-purchases-within-seven-days","Solution"]]],[2229,"Check if an Array Is Consecutive","check-if-an-array-is-consecutive",0,[6,71,150],[["/practice/#check-if-an-array-is-consecutive","Solution"]]],[2230,"The Users That Are Eligible for Discount","the-users-that-are-eligible-for-discount",1,[40],[["/practice/#the-users-that-are-eligible-for-discount","Solution"]]],[2231,"Largest Number After Digit Swaps by Parity","largest-number-after-digit-swaps-by-parity",0,[150,72],[["/practice/#largest-number-after-digit-swaps-by-parity","Solution"]]],[2232,"Minimize Result by Adding Parentheses to Expression","minimize-result-by-adding-parentheses-to-expression",0,[155,50],[["/practice/#minimize-result-by-adding-parentheses-to-expression","Solution"]]],[2233,"Maximum Product After K Increments","maximum-product-after-k-increments",0,[68,6,72],[["/practice/#maximum-product-after-k-increments","Solution"]]],[2234,"Maximum Total Beauty of the Gardens","maximum-total-beauty-of-the-gardens",0,[68,6,172,14,50,122,150],[["/practice/#maximum-total-beauty-of-the-gardens","Solution"]]],[2235,"Add Two Integers","add-two-integers",0,[95],[["/practice/#add-two-integers","Solution"]]],[2236,"Root Equals Sum of Children","root-equals-sum-of-children",0,[168,16],[["/practice/#root-equals-sum-of-children","Solution"]]],[2237,"Count Positions on Street With Required Brightness","count-positions-on-street-with-required-brightness",0,[6,122],[["/practice/#count-positions-on-street-with-required-brightness","Solution"]]],[2238,"Number of Times a Driver Was a Passenger","number-of-times-a-driver-was-a-passenger",1,[40],[["/practice/#number-of-times-a-driver-was-a-passenger","Solution"]]],[2239,"Find Closest Number to Zero","find-closest-number-to-zero",0,[6],[["/practice/#find-closest-number-to-zero","Solution"]]],[2240,"Number of Ways to Buy Pens and Pencils","number-of-ways-to-buy-pens-and-pencils",0,[95,50],[["/practice/#number-of-ways-to-buy-pens-and-pencils","Solution"]]],[2241,"Design an ATM Machine","design-an-atm-machine",0,[68,42,6],[["/practice/#design-an-atm-machine","Solution"]]],[2242,"Maximum Score of a Node Sequence","maximum-score-of-a-node-sequence",0,[64,6,50,150],[["/practice/#maximum-score-of-a-node-sequence","Solution"]]],[2243,"Calculate Digit Sum of a String","calculate-digit-sum-of-a-string",0,[155,145],[["/practice/#calculate-digit-sum-of-a-string","Solution"]]],[2244,"Minimum Rounds to Complete All Tasks","minimum-rounds-to-complete-all-tasks",0,[68,6,71,36],[["/practice/#minimum-rounds-to-complete-all-tasks","Solution"]]],[2245,"Maximum Trailing Zeros in a Cornered Path","maximum-trailing-zeros-in-a-cornered-path",0,[6,96,122],[["/practice/#maximum-trailing-zeros-in-a-cornered-path","Solution"]]],[2246,"Longest Path With Different Adjacent Characters","longest-path-with-different-adjacent-characters",0,[168,41,64,165,6,155],[["/practice/#longest-path-with-different-adjacent-characters","Solution"]]],[2247,"Maximum Cost of Trip With K Highways","maximum-cost-of-trip-with-k-highways",0,[18,64,48,19],[["/practice/#maximum-cost-of-trip-with-k-highways","Solution"]]],[2248,"Intersection of Multiple Arrays","intersection-of-multiple-arrays",0,[6,71,36,150],[["/practice/#intersection-of-multiple-arrays","Solution"]]],[2249,"Count Lattice Points Inside a Circle","count-lattice-points-inside-a-circle",0,[63,6,71,95,50],[["/practice/#count-lattice-points-inside-a-circle","Solution"]]],[2250,"Count Number of Rectangles Containing Each Point","count-number-of-rectangles-containing-each-point",0,[12,6,71,14,150],[["/practice/#count-number-of-rectangles-containing-each-point","Solution"]]],[2251,"Number of Flowers in Full Bloom","number-of-flowers-in-full-bloom",0,[6,71,14,113,122,150],[["/practice/#number-of-flowers-in-full-bloom","Solution"]]],[2252,"Dynamic Pivoting of a Table","dynamic-pivoting-of-a-table",1,[40],[["/practice/#dynamic-pivoting-of-a-table","Solution"]]],[2253,"Dynamic Unpivoting of a Table","dynamic-unpivoting-of-a-table",1,[40],[["/practice/#dynamic-unpivoting-of-a-table","Solution"]]],[2254,"Design Video Sharing Platform","design-video-sharing-platform",0,[42,71,72],[["/practice/#design-video-sharing-platform","Solution"]]],[2255,"Count Prefixes of a Given String","count-prefixes-of-a-given-string",0,[6,155],[["/practice/#count-prefixes-of-a-given-string","Solution"]]],[2256,"Minimum Average Difference","minimum-average-difference",0,[6,122],[["/practice/#minimum-average-difference","Solution"]]],[2257,"Count Unguarded Cells in the Grid","count-unguarded-cells-in-the-grid",0,[6,96,145],[["/practice/#count-unguarded-cells-in-the-grid","Solution"]]],[2258,"Escape the Spreading Fire","escape-the-spreading-fire",0,[25,6,14,96],[["/practice/#escape-the-spreading-fire","Solution"]]],[2259,"Remove Digit From Number to Maximize Result","remove-digit-from-number-to-maximize-result",0,[68,155,50],[["/practice/#remove-digit-from-number-to-maximize-result","Solution"]]],[2260,"Minimum Consecutive Cards to Pick Up","minimum-consecutive-cards-to-pick-up",0,[6,71,146],[["/practice/#minimum-consecutive-cards-to-pick-up","Solution"]]],[2261,"K Divisible Elements Subarrays","k-divisible-elements-subarrays",0,[171,6,71,50,70,137],[["/practice/#k-divisible-elements-subarrays","Solution"]]],[2262,"Total Appeal of A String","total-appeal-of-a-string",0,[71,155,48],[["/practice/#total-appeal-of-a-string","Solution"]]],[2263,"Make Array Non-decreasing or Non-increasing","make-array-non-decreasing-or-non-increasing",0,[68,6,48,72],[["/practice/#make-array-non-decreasing-or-non-increasing","Solution"]]],[2264,"Largest 3-Same-Digit Number in String","largest-3-same-digit-number-in-string",0,[155],[["/practice/#largest-3-same-digit-number-in-string","Solution"]]],[2265,"Count Nodes Equal to Average of Subtree","count-nodes-equal-to-average-of-subtree",0,[168,41,16],[["/practice/#count-nodes-equal-to-average-of-subtree","Solution"]]],[2266,"Count Number of Texts","count-number-of-texts",0,[71,95,155,48],[["/practice/#count-number-of-texts","Solution"]]],[2267," Check if There Is a Valid Parentheses String Path","check-if-there-is-a-valid-parentheses-string-path",0,[6,48,96,116],[["/practice/#check-if-there-is-a-valid-parentheses-string-path","Solution"]]],[2268,"Minimum Number of Keypresses","minimum-number-of-keypresses",0,[68,71,155,36,150],[["/practice/#minimum-number-of-keypresses","Solution"]]],[2269,"Find the K-Beauty of a Number","find-the-k-beauty-of-a-number",0,[95,155,146],[["/practice/#find-the-k-beauty-of-a-number","Solution"]]],[2270,"Number of Ways to Split Array","number-of-ways-to-split-array",0,[6,122],[["/practice/#number-of-ways-to-split-array","Solution"]]],[2271,"Maximum White Tiles Covered by a Carpet","maximum-white-tiles-covered-by-a-carpet",0,[68,6,14,122,150,146],[["/practice/#maximum-white-tiles-covered-by-a-carpet","Solution"]]],[2272,"Substring With Largest Variance","substring-with-largest-variance",0,[71,155,48,50],[["/practice/#substring-with-largest-variance","Solution"]]],[2273,"Find Resultant Array After Removing Anagrams","find-resultant-array-after-removing-anagrams",0,[6,71,155,150],[["/practice/#find-resultant-array-after-removing-anagrams","Solution"]]],[2274,"Maximum Consecutive Floors Without Special Floors","maximum-consecutive-floors-without-special-floors",0,[6,150],[["/practice/#maximum-consecutive-floors-without-special-floors","Solution"]]],[2275,"Largest Combination With Bitwise AND Greater Than Zero","largest-combination-with-bitwise-and-greater-than-zero",0,[18,6,71,36],[["/practice/#largest-combination-with-bitwise-and-greater-than-zero","Solution"]]],[2276,"Count Integers in Intervals","count-integers-in-intervals",0,[42,139,113],[["/practice/#count-integers-in-intervals","Solution"]]],[2277,"Closest Node to Path in Tree","closest-node-to-path-in-tree",0,[168,41,25,6],[["/practice/#closest-node-to-path-in-tree","Solution"]]],[2278,"Percentage of Letter in String","percentage-of-letter-in-string",0,[155],[["/practice/#percentage-of-letter-in-string","Solution"]]],[2279,"Maximum Bags With Full Capacity of Rocks","maximum-bags-with-full-capacity-of-rocks",0,[68,6,150],[["/practice/#maximum-bags-with-full-capacity-of-rocks","Solution"]]],[2280,"Minimum Lines to Represent a Line Chart","minimum-lines-to-represent-a-line-chart",0,[63,6,95,112,150],[["/practice/#minimum-lines-to-represent-a-line-chart","Solution"]]],[2281,"Sum of Total Strength of Wizards","sum-of-total-strength-of-wizards",0,[154,6,122,108],[["/practice/#sum-of-total-strength-of-wizards","Solution"]]],[2282,"Number of People That Can Be Seen in a Grid","number-of-people-that-can-be-seen-in-a-grid",0,[154,6,96,108],[["/practice/#number-of-people-that-can-be-seen-in-a-grid","Solution"]]],[2283,"Check if Number Has Equal Digit Count and Digit Value","check-if-number-has-equal-digit-count-and-digit-value",0,[71,155,36],[["/practice/#check-if-number-has-equal-digit-count-and-digit-value","Solution"]]],[2284,"Sender With Largest Word Count","sender-with-largest-word-count",0,[6,71,155,36],[["/practice/#sender-with-largest-word-count","Solution"]]],[2285,"Maximum Total Importance of Roads","maximum-total-importance-of-roads",0,[68,64,150,72],[["/practice/#maximum-total-importance-of-roads","Solution"]]],[2286,"Booking Concert Tickets in Groups","booking-concert-tickets-in-groups",0,[42,12,139,14],[["/practice/#booking-concert-tickets-in-groups","Solution"]]],[2287,"Rearrange Characters to Make Target String","rearrange-characters-to-make-target-string",0,[71,155,36],[["/practice/#rearrange-characters-to-make-target-string","Solution"]]],[2288,"Apply Discount to Prices","apply-discount-to-prices",0,[155],[["/practice/#apply-discount-to-prices","Solution"]]],[2289,"Steps to Make Array Non-decreasing","steps-to-make-array-non-decreasing",0,[154,6,88,48,108,145],[["/practice/#steps-to-make-array-non-decreasing","Solution"]]],[2290,"Minimum Obstacle Removal to Reach Corner","minimum-obstacle-removal-to-reach-corner",0,[25,64,6,96,142,43,72,1],[["/practice/#minimum-obstacle-removal-to-reach-corner","Solution"]]],[2291,"Maximum Profit From Trading Stocks","maximum-profit-from-trading-stocks",0,[6,48],[["/practice/#maximum-profit-from-trading-stocks","Solution"]]],[2292,"Products With Three or More Orders in Two Consecutive Years","products-with-three-or-more-orders-in-two-consecutive-years",1,[40],[["/practice/#products-with-three-or-more-orders-in-two-consecutive-years","Solution"]]],[2293,"Min Max Game","min-max-game",0,[6,145],[["/practice/#min-max-game","Solution"]]],[2294,"Partition Array Such That Maximum Difference Is K","partition-array-such-that-maximum-difference-is-k",0,[68,6,150],[["/practice/#partition-array-such-that-maximum-difference-is-k","Solution"]]],[2295,"Replace Elements in an Array","replace-elements-in-an-array",0,[6,71,145],[["/practice/#replace-elements-in-an-array","Solution"]]],[2296,"Design a Text Editor","design-a-text-editor",0,[154,42,88,155,47,145],[["/practice/#design-a-text-editor","Solution"]]],[2297,"Jump Game VIII","jump-game-viii",0,[154,64,6,48,142,108],[["/practice/#jump-game-viii","Solution"]]],[2298,"Tasks Count in the Weekend","tasks-count-in-the-weekend",1,[40],[["/practice/#tasks-count-in-the-weekend","Solution"]]],[2299,"Strong Password Checker II","strong-password-checker-ii",0,[155],[["/practice/#strong-password-checker-ii","Solution"]]],[2300,"Successful Pairs of Spells and Potions","successful-pairs-of-spells-and-potions",0,[6,172,14,150],[["/practice/#successful-pairs-of-spells-and-potions","Solution"]]],[2301,"Match Substring After Replacement","match-substring-after-replacement",0,[6,71,155,156],[["/practice/#match-substring-after-replacement","Solution"]]],[2302,"Count Subarrays With Score Less Than K","count-subarrays-with-score-less-than-k",0,[6,14,122,146],[["/practice/#count-subarrays-with-score-less-than-k","Solution"]]],[2303,"Calculate Amount Paid in Taxes","calculate-amount-paid-in-taxes",0,[6,145],[["/practice/#calculate-amount-paid-in-taxes","Solution"]]],[2304,"Minimum Path Cost in a Grid","minimum-path-cost-in-a-grid",0,[6,48,96],[["/practice/#minimum-path-cost-in-a-grid","Solution"]]],[2305,"Fair Distribution of Cookies","fair-distribution-of-cookies",0,[18,6,48,8,19],[["/practice/#fair-distribution-of-cookies","Solution"]]],[2306,"Naming a Company","naming-a-company",0,[18,6,71,155,50],[["/practice/#naming-a-company","Solution"]]],[2307,"Check for Contradictions in Equations","check-for-contradictions-in-equations",0,[41,174,64,6,155],[["/practice/#check-for-contradictions-in-equations","Solution"]]],[2308,"Arrange Table by Gender","arrange-table-by-gender",1,[40],[["/practice/#arrange-table-by-gender","Solution"]]],[2309,"Greatest English Letter in Upper and Lower Case","greatest-english-letter-in-upper-and-lower-case",0,[71,155,50],[["/practice/#greatest-english-letter-in-upper-and-lower-case","Solution"]]],[2310,"Sum of Numbers With Units Digit K","sum-of-numbers-with-units-digit-k",0,[68,95,48,50],[["/practice/#sum-of-numbers-with-units-digit-k","Solution"]]],[2311,"Longest Binary Subsequence Less Than or Equal to K","longest-binary-subsequence-less-than-or-equal-to-k",0,[68,100,155,48],[["/practice/#longest-binary-subsequence-less-than-or-equal-to-k","Solution"]]],[2312,"Selling Pieces of Wood","selling-pieces-of-wood",0,[100,6,48],[["/practice/#selling-pieces-of-wood","Solution"]]],[2313,"Minimum Flips in Binary Tree to Get Result","minimum-flips-in-binary-tree-to-get-result",0,[168,41,48,16],[["/practice/#minimum-flips-in-binary-tree-to-get-result","Solution"]]],[2314,"The First Day of the Maximum Recorded Degree in Each City","the-first-day-of-the-maximum-recorded-degree-in-each-city",1,[40],[["/practice/#the-first-day-of-the-maximum-recorded-degree-in-each-city","Solution"]]],[2315,"Count Asterisks","count-asterisks",0,[155],[["/practice/#count-asterisks","Solution"]]],[2316,"Count Unreachable Pairs of Nodes in an Undirected Graph","count-unreachable-pairs-of-nodes-in-an-undirected-graph",0,[41,25,174,64],[["/practice/#count-unreachable-pairs-of-nodes-in-an-undirected-graph","Solution"]]],[2317,"Maximum XOR After Operations ","maximum-xor-after-operations",0,[18,6,95],[["/practice/#maximum-xor-after-operations","Solution"]]],[2318,"Number of Distinct Roll Sequences","number-of-distinct-roll-sequences",0,[100,48],[["/practice/#number-of-distinct-roll-sequences","Solution"]]],[2319,"Check if Matrix Is X-Matrix","check-if-matrix-is-x-matrix",0,[6,96],[["/practice/#check-if-matrix-is-x-matrix","Solution"]]],[2320,"Count Number of Ways to Place Houses","count-number-of-ways-to-place-houses",0,[48],[["/practice/#count-number-of-ways-to-place-houses","Solution"]]],[2321,"Maximum Score Of Spliced Array","maximum-score-of-spliced-array",0,[6,48],[["/practice/#maximum-score-of-spliced-array","Solution"]]],[2322,"Minimum Score After Removals on a Tree","minimum-score-after-removals-on-a-tree",0,[18,168,41,6],[["/practice/#minimum-score-after-removals-on-a-tree","Solution"]]],[2323,"Find Minimum Time to Finish All Jobs II","find-minimum-time-to-finish-all-jobs-ii",0,[68,6,150],[["/practice/#find-minimum-time-to-finish-all-jobs-ii","Solution"]]],[2324,"Product Sales Analysis IV","product-sales-analysis-iv",1,[40],[["/practice/#product-sales-analysis-iv","Solution"]]],[2325,"Decode the Message","decode-the-message",0,[71,155],[["/practice/#decode-the-message","Solution"]]],[2326,"Spiral Matrix IV","spiral-matrix-iv",0,[6,88,96,145],[["/practice/#spiral-matrix-iv","Solution"]]],[2327,"Number of People Aware of a Secret","number-of-people-aware-of-a-secret",0,[128,48,145],[["/practice/#number-of-people-aware-of-a-secret","Solution"]]],[2328,"Number of Increasing Paths in a Grid","number-of-increasing-paths-in-a-grid",0,[41,25,64,165,100,6,48,96],[["/practice/#number-of-increasing-paths-in-a-grid","Solution"]]],[2329,"Product Sales Analysis V","product-sales-analysis-v",1,[40],[["/practice/#product-sales-analysis-v","Solution"]]],[2330,"Valid Palindrome IV","valid-palindrome-iv",0,[172,155],[["/practice/#valid-palindrome-iv","Solution"]]],[2331,"Evaluate Boolean Binary Tree","evaluate-boolean-binary-tree",0,[168,41,16],[["/practice/#evaluate-boolean-binary-tree","Solution"]]],[2332,"The Latest Time to Catch a Bus","the-latest-time-to-catch-a-bus",0,[6,172,14,150],[["/practice/#the-latest-time-to-catch-a-bus","Solution"]]],[2333,"Minimum Sum of Squared Difference","minimum-sum-of-squared-difference",0,[68,6,14,150,72],[["/practice/#minimum-sum-of-squared-difference","Solution"]]],[2334,"Subarray With Elements Greater Than Varying Threshold","subarray-with-elements-greater-than-varying-threshold",0,[154,174,6,108],[["/practice/#subarray-with-elements-greater-than-varying-threshold","Solution"]]],[2335,"Minimum Amount of Time to Fill Cups","minimum-amount-of-time-to-fill-cups",0,[68,6,150,72],[["/practice/#minimum-amount-of-time-to-fill-cups","Solution"]]],[2336,"Smallest Number in Infinite Set","smallest-number-in-infinite-set",0,[42,71,113,72],[["/practice/#smallest-number-in-infinite-set","Solution"]]],[2337,"Move Pieces to Obtain a String","move-pieces-to-obtain-a-string",0,[172,155],[["/practice/#move-pieces-to-obtain-a-string","Solution"]]],[2338,"Count the Number of Ideal Arrays","count-the-number-of-ideal-arrays",0,[95,48,33,112,125,59],[["/practice/#count-the-number-of-ideal-arrays","Solution"]]],[2339,"All the Matches of the League","all-the-matches-of-the-league",1,[40],[["/practice/#all-the-matches-of-the-league","Solution"]]],[2340,"Minimum Adjacent Swaps to Make a Valid Array","minimum-adjacent-swaps-to-make-a-valid-array",0,[68,6],[["/practice/#minimum-adjacent-swaps-to-make-a-valid-array","Solution"]]],[2341,"Maximum Number of Pairs in Array","maximum-number-of-pairs-in-array",0,[6,71,36],[["/practice/#maximum-number-of-pairs-in-array","Solution"]]],[2342,"Max Sum of a Pair With Equal Sum of Digits","max-sum-of-a-pair-with-equal-sum-of-digits",0,[6,71,150,72],[["/practice/#max-sum-of-a-pair-with-equal-sum-of-digits","Solution"]]],[2343,"Query Kth Smallest Trimmed Number","query-kth-smallest-trimmed-number",0,[6,155,46,130,131,150,72],[["/practice/#query-kth-smallest-trimmed-number","Solution"]]],[2344,"Minimum Deletions to Make Array Divisible","minimum-deletions-to-make-array-divisible",0,[6,95,67,112,150,72,51],[["/practice/#minimum-deletions-to-make-array-divisible","Solution"]]],[2345,"Finding the Number of Visible Mountains","finding-the-number-of-visible-mountains",0,[154,6,150,108],[["/practice/#finding-the-number-of-visible-mountains","Solution"]]],[2346,"Compute the Rank as a Percentage","compute-the-rank-as-a-percentage",1,[40],[["/practice/#compute-the-rank-as-a-percentage","Solution"]]],[2347,"Best Poker Hand","best-poker-hand",0,[6,71,36],[["/practice/#best-poker-hand","Solution"]]],[2348,"Number of Zero-Filled Subarrays","number-of-zero-filled-subarrays",0,[6,95],[["/practice/#number-of-zero-filled-subarrays","Solution"]]],[2349,"Design a Number Container System","design-a-number-container-system",0,[42,71,113,72],[["/practice/#design-a-number-container-system","Solution"]]],[2350,"Shortest Impossible Sequence of Rolls","shortest-impossible-sequence-of-rolls",0,[68,6,71],[["/practice/#shortest-impossible-sequence-of-rolls","Solution"]]],[2351,"First Letter to Appear Twice","first-letter-to-appear-twice",0,[18,71,155,36],[["/practice/#first-letter-to-appear-twice","Solution"]]],[2352,"Equal Row and Column Pairs","equal-row-and-column-pairs",0,[6,71,96,145],[["/practice/#equal-row-and-column-pairs","Solution"]]],[2353,"Design a Food Rating System","design-a-food-rating-system",0,[42,6,71,155,113,72],[["/practice/#design-a-food-rating-system","Solution"]]],[2354,"Number of Excellent Pairs","number-of-excellent-pairs",0,[18,6,71,14],[["/practice/#number-of-excellent-pairs","Solution"]]],[2355,"Maximum Number of Books You Can Take","maximum-number-of-books-you-can-take",0,[154,6,48,108],[["/practice/#maximum-number-of-books-you-can-take","Solution"]]],[2356,"Number of Unique Subjects Taught by Each Teacher","number-of-unique-subjects-taught-by-each-teacher",1,[40],[["/practice/#number-of-unique-subjects-taught-by-each-teacher","Solution"]]],[2357,"Make Array Zero by Subtracting Equal Amounts","make-array-zero-by-subtracting-equal-amounts",0,[68,6,71,150,145,72],[["/practice/#make-array-zero-by-subtracting-equal-amounts","Solution"]]],[2358,"Maximum Number of Groups Entering a Competition","maximum-number-of-groups-entering-a-competition",0,[68,6,95,14],[["/practice/#maximum-number-of-groups-entering-a-competition","Solution"]]],[2359,"Find Closest Node to Given Two Nodes","find-closest-node-to-given-two-nodes",0,[41,64],[["/practice/#find-closest-node-to-given-two-nodes","Solution"]]],[2360,"Longest Cycle in a Graph","longest-cycle-in-a-graph",0,[41,25,64,165,83,162],[["/practice/#longest-cycle-in-a-graph","Solution"]]],[2361,"Minimum Costs Using the Train Line","minimum-costs-using-the-train-line",0,[6,48],[["/practice/#minimum-costs-using-the-train-line","Solution"]]],[2362,"Generate the Invoice","generate-the-invoice",1,[40],[["/practice/#generate-the-invoice","Solution"]]],[2363,"Merge Similar Items","merge-similar-items",0,[6,71,113,150],[["/practice/#merge-similar-items","Solution"]]],[2364,"Count Number of Bad Pairs","count-number-of-bad-pairs",0,[6,71,95,36],[["/practice/#count-number-of-bad-pairs","Solution"]]],[2365,"Task Scheduler II","task-scheduler-ii",0,[6,71,145],[["/practice/#task-scheduler-ii","Solution"]]],[2366,"Minimum Replacements to Sort the Array","minimum-replacements-to-sort-the-array",0,[68,6,95],[["/practice/#minimum-replacements-to-sort-the-array","Solution"]]],[2367,"Number of Arithmetic Triplets","number-of-arithmetic-triplets",0,[6,71,172,50],[["/practice/#number-of-arithmetic-triplets","Solution"]]],[2368,"Reachable Nodes With Restrictions","reachable-nodes-with-restrictions",0,[168,41,25,174,64,6,71],[["/practice/#reachable-nodes-with-restrictions","Solution"]]],[2369,"Check if There is a Valid Partition For The Array","check-if-there-is-a-valid-partition-for-the-array",0,[6,48],[["/practice/#check-if-there-is-a-valid-partition-for-the-array","Solution"]]],[2370,"Longest Ideal Subsequence","longest-ideal-subsequence",0,[71,155,48],[["/practice/#longest-ideal-subsequence","Solution"]]],[2371,"Minimize Maximum Value in a Grid","minimize-maximum-value-in-a-grid",0,[174,64,165,6,96,150],[["/practice/#minimize-maximum-value-in-a-grid","Solution"]]],[2372,"Calculate the Influence of Each Salesperson","calculate-the-influence-of-each-salesperson",1,[40],[["/practice/#calculate-the-influence-of-each-salesperson","Solution"]]],[2373,"Largest Local Values in a Matrix","largest-local-values-in-a-matrix",0,[6,96],[["/practice/#largest-local-values-in-a-matrix","Solution"]]],[2374,"Node With Highest Edge Score","node-with-highest-edge-score",0,[64,71],[["/practice/#node-with-highest-edge-score","Solution"]]],[2375,"Construct Smallest Number From DI String","construct-smallest-number-from-di-string",0,[154,68,155,8],[["/practice/#construct-smallest-number-from-di-string","Solution"]]],[2376,"Count Special Integers","count-special-integers",0,[95,48],[["/practice/#count-special-integers","Solution"]]],[2377,"Sort the Olympic Table","sort-the-olympic-table",1,[40],[["/practice/#sort-the-olympic-table","Solution"]]],[2378,"Choose Edges to Maximize Score in a Tree","choose-edges-to-maximize-score-in-a-tree",0,[168,41,48],[["/practice/#choose-edges-to-maximize-score-in-a-tree","Solution"]]],[2379,"Minimum Recolors to Get K Consecutive Black Blocks","minimum-recolors-to-get-k-consecutive-black-blocks",0,[155,146],[["/practice/#minimum-recolors-to-get-k-consecutive-black-blocks","Solution"]]],[2380,"Time Needed to Rearrange a Binary String","time-needed-to-rearrange-a-binary-string",0,[155,48,145],[["/practice/#time-needed-to-rearrange-a-binary-string","Solution"]]],[2381,"Shifting Letters II","shifting-letters-ii",0,[6,155,122],[["/practice/#shifting-letters-ii","Solution"]]],[2382,"Maximum Segment Sum After Removals","maximum-segment-sum-after-removals",0,[174,6,113,122],[["/practice/#maximum-segment-sum-after-removals","Solution"]]],[2383,"Minimum Hours of Training to Win a Competition","minimum-hours-of-training-to-win-a-competition",0,[68,6],[["/practice/#minimum-hours-of-training-to-win-a-competition","Solution"]]],[2384,"Largest Palindromic Number","largest-palindromic-number",0,[68,71,155,36],[["/practice/#largest-palindromic-number","Solution"]]],[2385,"Amount of Time for Binary Tree to Be Infected","amount-of-time-for-binary-tree-to-be-infected",0,[168,41,25,71,16],[["/practice/#amount-of-time-for-binary-tree-to-be-infected","Solution"]]],[2386,"Find the K-Sum of an Array","find-the-k-sum-of-an-array",0,[6,150,72],[["/practice/#find-the-k-sum-of-an-array","Solution"]]],[2387,"Median of a Row Wise Sorted Matrix","median-of-a-row-wise-sorted-matrix",0,[6,14,96],[["/practice/#median-of-a-row-wise-sorted-matrix","Solution"]]],[2388,"Change Null Values in a Table to the Previous Value","change-null-values-in-a-table-to-the-previous-value",1,[40],[["/practice/#change-null-values-in-a-table-to-the-previous-value","Solution"]]],[2389,"Longest Subsequence With Limited Sum","longest-subsequence-with-limited-sum",0,[68,6,14,122,150],[["/practice/#longest-subsequence-with-limited-sum","Solution"]]],[2390,"Removing Stars From a String","removing-stars-from-a-string",0,[154,155,145],[["/practice/#removing-stars-from-a-string","Solution"]]],[2391,"Minimum Amount of Time to Collect Garbage","minimum-amount-of-time-to-collect-garbage",0,[6,155,122],[["/practice/#minimum-amount-of-time-to-collect-garbage","Solution"]]],[2392,"Build a Matrix With Conditions","build-a-matrix-with-conditions",0,[64,165,6,45,96],[["/practice/#build-a-matrix-with-conditions","Solution"]]],[2393,"Count Strictly Increasing Subarrays","count-strictly-increasing-subarrays",0,[6,95,48],[["/practice/#count-strictly-increasing-subarrays","Solution"]]],[2394,"Employees With Deductions","employees-with-deductions",1,[40],[["/practice/#employees-with-deductions","Solution"]]],[2395,"Find Subarrays With Equal Sum","find-subarrays-with-equal-sum",0,[6,71],[["/practice/#find-subarrays-with-equal-sum","Solution"]]],[2396,"Strictly Palindromic Number","strictly-palindromic-number",0,[24,95,172],[["/practice/#strictly-palindromic-number","Solution"]]],[2397,"Maximum Rows Covered by Columns","maximum-rows-covered-by-columns",0,[18,6,8,50,96],[["/practice/#maximum-rows-covered-by-columns","Solution"]]],[2398,"Maximum Number of Robots Within Budget","maximum-number-of-robots-within-budget",0,[128,6,14,122,146,107,72],[["/practice/#maximum-number-of-robots-within-budget","Solution"]]],[2399,"Check Distances Between Same Letters","check-distances-between-same-letters",0,[6,71,155],[["/practice/#check-distances-between-same-letters","Solution"]]],[2400,"Number of Ways to Reach a Position After Exactly k Steps","number-of-ways-to-reach-a-position-after-exactly-k-steps",0,[95,48,33],[["/practice/#number-of-ways-to-reach-a-position-after-exactly-k-steps","Solution"]]],[2401,"Longest Nice Subarray","longest-nice-subarray",0,[18,6,146],[["/practice/#longest-nice-subarray","Solution"]]],[2402,"Meeting Rooms III","meeting-rooms-iii",0,[6,71,150,145,72],[["/practice/#meeting-rooms-iii","Solution"]]],[2403,"Minimum Time to Kill All Monsters","minimum-time-to-kill-all-monsters",0,[18,6,48,19],[["/practice/#minimum-time-to-kill-all-monsters","Solution"]]],[2404,"Most Frequent Even Element","most-frequent-even-element",0,[6,71,36],[["/practice/#most-frequent-even-element","Solution"]]],[2405,"Optimal Partition of String","optimal-partition-of-string",0,[68,71,155],[["/practice/#optimal-partition-of-string","Solution"]]],[2406,"Divide Intervals Into Minimum Number of Groups","divide-intervals-into-minimum-number-of-groups",0,[68,6,172,122,150,72],[["/practice/#divide-intervals-into-minimum-number-of-groups","Solution"]]],[2407,"Longest Increasing Subsequence II","longest-increasing-subsequence-ii",0,[12,139,128,6,46,48,107],[["/practice/#longest-increasing-subsequence-ii","Solution"]]],[2408,"Design SQL","design-sql",0,[42,6,71,155],[["/practice/#design-sql","Solution"]]],[2409,"Count Days Spent Together","count-days-spent-together",0,[95,155],[["/practice/#count-days-spent-together","Solution"]]],[2410,"Maximum Matching of Players With Trainers","maximum-matching-of-players-with-trainers",0,[68,6,172,150],[["/practice/#maximum-matching-of-players-with-trainers","Solution"]]],[2411,"Smallest Subarrays With Maximum Bitwise OR","smallest-subarrays-with-maximum-bitwise-or",0,[18,6,14,146],[["/practice/#smallest-subarrays-with-maximum-bitwise-or","Solution"]]],[2412,"Minimum Money Required Before Transactions","minimum-money-required-before-transactions",0,[68,6,150],[["/practice/#minimum-money-required-before-transactions","Solution"]]],[2413,"Smallest Even Multiple","smallest-even-multiple",0,[95,112],[["/practice/#smallest-even-multiple","Solution"]]],[2414,"Length of the Longest Alphabetical Continuous Substring","length-of-the-longest-alphabetical-continuous-substring",0,[155],[["/practice/#length-of-the-longest-alphabetical-continuous-substring","Solution"]]],[2415,"Reverse Odd Levels of Binary Tree","reverse-odd-levels-of-binary-tree",0,[168,41,25,16],[["/practice/#reverse-odd-levels-of-binary-tree","Solution"]]],[2416,"Sum of Prefix Scores of Strings","sum-of-prefix-scores-of-strings",0,[171,6,155,36],[["/practice/#sum-of-prefix-scores-of-strings","Solution"]]],[2417,"Closest Fair Integer","closest-fair-integer",0,[95,50],[["/practice/#closest-fair-integer","Solution"]]],[2418,"Sort the People","sort-the-people",0,[6,71,155,150],[["/practice/#sort-the-people","Solution"]]],[2419,"Longest Subarray With Maximum Bitwise AND","longest-subarray-with-maximum-bitwise-and",0,[18,24,6],[["/practice/#longest-subarray-with-maximum-bitwise-and","Solution"]]],[2420,"Find All Good Indices","find-all-good-indices",0,[6,48,122],[["/practice/#find-all-good-indices","Solution"]]],[2421,"Number of Good Paths","number-of-good-paths",0,[168,174,64,6,71,150],[["/practice/#number-of-good-paths","Solution"]]],[2422,"Merge Operations to Turn Array Into a Palindrome","merge-operations-to-turn-array-into-a-palindrome",0,[68,6,172],[["/practice/#merge-operations-to-turn-array-into-a-palindrome","Solution"]]],[2423,"Remove Letter To Equalize Frequency","remove-letter-to-equalize-frequency",0,[71,155,36],[["/practice/#remove-letter-to-equalize-frequency","Solution"]]],[2424,"Longest Uploaded Prefix","longest-uploaded-prefix",0,[174,42,12,139,71,14,113,72],[["/practice/#longest-uploaded-prefix","Solution"]]],[2425,"Bitwise XOR of All Pairings","bitwise-xor-of-all-pairings",0,[18,24,6],[["/practice/#bitwise-xor-of-all-pairings","Solution"]]],[2426,"Number of Pairs Satisfying Inequality","number-of-pairs-satisfying-inequality",0,[12,139,6,14,46,113,101],[["/practice/#number-of-pairs-satisfying-inequality","Solution"]]],[2427,"Number of Common Factors","number-of-common-factors",0,[95,50,67,112,51],[["/practice/#number-of-common-factors","Solution"]]],[2428,"Maximum Sum of an Hourglass","maximum-sum-of-an-hourglass",0,[6,96,122],[["/practice/#maximum-sum-of-an-hourglass","Solution"]]],[2429,"Minimize XOR","minimize-xor",0,[68,18],[["/practice/#minimize-xor","Solution"]]],[2430,"Maximum Deletions on a String","maximum-deletions-on-a-string",0,[155,48,156,70,137],[["/practice/#maximum-deletions-on-a-string","Solution"]]],[2431,"Maximize Total Tastiness of Purchased Fruits","maximize-total-tastiness-of-purchased-fruits",0,[6,48],[["/practice/#maximize-total-tastiness-of-purchased-fruits","Solution"]]],[2432,"The Employee That Worked on the Longest Task","the-employee-that-worked-on-the-longest-task",0,[6],[["/practice/#the-employee-that-worked-on-the-longest-task","Solution"]]],[2433,"Find The Original Array of Prefix Xor","find-the-original-array-of-prefix-xor",0,[18,6],[["/practice/#find-the-original-array-of-prefix-xor","Solution"]]],[2434,"Using a Robot to Print the Lexicographically Smallest String","using-a-robot-to-print-the-lexicographically-smallest-string",0,[154,68,71,155],[["/practice/#using-a-robot-to-print-the-lexicographically-smallest-string","Solution"]]],[2435,"Paths in Matrix Whose Sum Is Divisible by K","paths-in-matrix-whose-sum-is-divisible-by-k",0,[6,48,96],[["/practice/#paths-in-matrix-whose-sum-is-divisible-by-k","Solution"]]],[2436,"Minimum Split Into Subarrays With GCD Greater Than One","minimum-split-into-subarrays-with-gcd-greater-than-one",0,[68,6,95,48,112,51],[["/practice/#minimum-split-into-subarrays-with-gcd-greater-than-one","Solution"]]],[2437,"Number of Valid Clock Times","number-of-valid-clock-times",0,[155,50],[["/practice/#number-of-valid-clock-times","Solution"]]],[2438,"Range Product Queries of Powers","range-product-queries-of-powers",0,[18,6,122],[["/practice/#range-product-queries-of-powers","Solution"]]],[2439,"Minimize Maximum of Array","minimize-maximum-of-array",0,[68,6,14,48,122],[["/practice/#minimize-maximum-of-array","Solution"]]],[2440,"Create Components With Same Value","create-components-with-same-value",0,[168,41,6,95,50],[["/practice/#create-components-with-same-value","Solution"]]],[2441,"Largest Positive Integer That Exists With Its Negative","largest-positive-integer-that-exists-with-its-negative",0,[6,71,172,150],[["/practice/#largest-positive-integer-that-exists-with-its-negative","Solution"]]],[2442,"Count Number of Distinct Integers After Reverse Operations","count-number-of-distinct-integers-after-reverse-operations",0,[6,71,95,36],[["/practice/#count-number-of-distinct-integers-after-reverse-operations","Solution"]]],[2443,"Sum of Number and Its Reverse","sum-of-number-and-its-reverse",0,[95,50],[["/practice/#sum-of-number-and-its-reverse","Solution"]]],[2444,"Count Subarrays With Fixed Bounds","count-subarrays-with-fixed-bounds",0,[128,6,146,107],[["/practice/#count-subarrays-with-fixed-bounds","Solution"]]],[2445,"Number of Nodes With Value One","number-of-nodes-with-value-one",0,[168,41,25,6,16],[["/practice/#number-of-nodes-with-value-one","Solution"]]],[2446,"Determine if Two Events Have Conflict","determine-if-two-events-have-conflict",0,[6,155],[["/practice/#determine-if-two-events-have-conflict","Solution"]]],[2447,"Number of Subarrays With GCD Equal to K","number-of-subarrays-with-gcd-equal-to-k",0,[6,95,112],[["/practice/#number-of-subarrays-with-gcd-equal-to-k","Solution"]]],[2448,"Minimum Cost to Make Array Equal","minimum-cost-to-make-array-equal",0,[68,6,14,122,150],[["/practice/#minimum-cost-to-make-array-equal","Solution"]]],[2449,"Minimum Number of Operations to Make Arrays Similar","minimum-number-of-operations-to-make-arrays-similar",0,[68,6,150],[["/practice/#minimum-number-of-operations-to-make-arrays-similar","Solution"]]],[2450,"Number of Distinct Binary Strings After Applying Operations","number-of-distinct-binary-strings-after-applying-operations",0,[95,155],[["/practice/#number-of-distinct-binary-strings-after-applying-operations","Solution"]]],[2451,"Odd String Difference","odd-string-difference",0,[6,71,155],[["/practice/#odd-string-difference","Solution"]]],[2452,"Words Within Two Edits of Dictionary","words-within-two-edits-of-dictionary",0,[171,6,155],[["/practice/#words-within-two-edits-of-dictionary","Solution"]]],[2453,"Destroy Sequential Targets","destroy-sequential-targets",0,[6,71,36],[["/practice/#destroy-sequential-targets","Solution"]]],[2454,"Next Greater Element IV","next-greater-element-iv",0,[154,6,14,150,108,72],[["/practice/#next-greater-element-iv","Solution"]]],[2455,"Average Value of Even Numbers That Are Divisible by Three","average-value-of-even-numbers-that-are-divisible-by-three",0,[6,95],[["/practice/#average-value-of-even-numbers-that-are-divisible-by-three","Solution"]]],[2456,"Most Popular Video Creator","most-popular-video-creator",0,[6,71,155,150,72],[["/practice/#most-popular-video-creator","Solution"]]],[2457,"Minimum Addition to Make Integer Beautiful","minimum-addition-to-make-integer-beautiful",0,[68,95],[["/practice/#minimum-addition-to-make-integer-beautiful","Solution"]]],[2458,"Height of Binary Tree After Subtree Removal Queries","height-of-binary-tree-after-subtree-removal-queries",0,[168,41,25,6,16],[["/practice/#height-of-binary-tree-after-subtree-removal-queries","Solution"]]],[2459,"Sort Array by Moving Items to Empty Space","sort-array-by-moving-items-to-empty-space",0,[6,71,150],[["/practice/#sort-array-by-moving-items-to-empty-space","Solution"]]],[2460,"Apply Operations to an Array","apply-operations-to-an-array",0,[6,172,145],[["/practice/#apply-operations-to-an-array","Solution"]]],[2461,"Maximum Sum of Distinct Subarrays With Length K","maximum-sum-of-distinct-subarrays-with-length-k",0,[6,71,146],[["/practice/#maximum-sum-of-distinct-subarrays-with-length-k","Solution"]]],[2462,"Total Cost to Hire K Workers","total-cost-to-hire-k-workers",0,[6,172,145,72],[["/practice/#total-cost-to-hire-k-workers","Solution"]]],[2463,"Minimum Total Distance Traveled","minimum-total-distance-traveled",0,[6,48,150],[["/practice/#minimum-total-distance-traveled","Solution"]]],[2464,"Minimum Subarrays in a Valid Split","minimum-subarrays-in-a-valid-split",0,[6,95,48,112],[["/practice/#minimum-subarrays-in-a-valid-split","Solution"]]],[2465,"Number of Distinct Averages","number-of-distinct-averages",0,[6,71,172,150],[["/practice/#number-of-distinct-averages","Solution"]]],[2466,"Count Ways To Build Good Strings","count-ways-to-build-good-strings",0,[48],[["/practice/#count-ways-to-build-good-strings","Solution"]]],[2467,"Most Profitable Path in a Tree","most-profitable-path-in-a-tree",0,[168,41,25,64,6],[["/practice/#most-profitable-path-in-a-tree","Solution"]]],[2468,"Split Message Based on Limit","split-message-based-on-limit",0,[155,50],[["/practice/#split-message-based-on-limit","Solution"]]],[2469,"Convert the Temperature","convert-the-temperature",0,[95],[["/practice/#convert-the-temperature","Solution"]]],[2470,"Number of Subarrays With LCM Equal to K","number-of-subarrays-with-lcm-equal-to-k",0,[6,95,112],[["/practice/#number-of-subarrays-with-lcm-equal-to-k","Solution"]]],[2471,"Minimum Number of Operations to Sort a Binary Tree by Level","minimum-number-of-operations-to-sort-a-binary-tree-by-level",0,[168,25,16],[["/practice/#minimum-number-of-operations-to-sort-a-binary-tree-by-level","Solution"]]],[2472,"Maximum Number of Non-overlapping Palindrome Substrings","maximum-number-of-non-overlapping-palindrome-substrings",0,[68,172,155,48],[["/practice/#maximum-number-of-non-overlapping-palindrome-substrings","Solution"]]],[2473,"Minimum Cost to Buy Apples","minimum-cost-to-buy-apples",0,[64,6,142,72],[["/practice/#minimum-cost-to-buy-apples","Solution"]]],[2474,"Customers With Strictly Increasing Purchases","customers-with-strictly-increasing-purchases",1,[40],[["/practice/#customers-with-strictly-increasing-purchases","Solution"]]],[2475,"Number of Unequal Triplets in Array","number-of-unequal-triplets-in-array",0,[6,71,150],[["/practice/#number-of-unequal-triplets-in-array","Solution"]]],[2476,"Closest Nodes Queries in a Binary Search Tree","closest-nodes-queries-in-a-binary-search-tree",0,[168,41,15,6,14,16],[["/practice/#closest-nodes-queries-in-a-binary-search-tree","Solution"]]],[2477,"Minimum Fuel Cost to Report to the Capital","minimum-fuel-cost-to-report-to-the-capital",0,[168,41,25,64],[["/practice/#minimum-fuel-cost-to-report-to-the-capital","Solution"]]],[2478,"Number of Beautiful Partitions","number-of-beautiful-partitions",0,[155,48,122],[["/practice/#number-of-beautiful-partitions","Solution"]]],[2479,"Maximum XOR of Two Non-Overlapping Subtrees","maximum-xor-of-two-non-overlapping-subtrees",0,[168,41,64,171],[["/practice/#maximum-xor-of-two-non-overlapping-subtrees","Solution"]]],[2480,"Form a Chemical Bond","form-a-chemical-bond",1,[40],[["/practice/#form-a-chemical-bond","Solution"]]],[2481,"Minimum Cuts to Divide a Circle","minimum-cuts-to-divide-a-circle",0,[63,95],[["/practice/#minimum-cuts-to-divide-a-circle","Solution"]]],[2482,"Difference Between Ones and Zeros in Row and Column","difference-between-ones-and-zeros-in-row-and-column",0,[6,96,145],[["/practice/#difference-between-ones-and-zeros-in-row-and-column","Solution"]]],[2483,"Minimum Penalty for a Shop","minimum-penalty-for-a-shop",0,[155,122],[["/practice/#minimum-penalty-for-a-shop","Solution"]]],[2484,"Count Palindromic Subsequences","count-palindromic-subsequences",0,[155,48],[["/practice/#count-palindromic-subsequences","Solution"]]],[2485,"Find the Pivot Integer","find-the-pivot-integer",0,[95,122],[["/practice/#find-the-pivot-integer","Solution"]]],[2486,"Append Characters to String to Make Subsequence","append-characters-to-string-to-make-subsequence",0,[68,172,155],[["/practice/#append-characters-to-string-to-make-subsequence","Solution"]]],[2487,"Remove Nodes From Linked List","remove-nodes-from-linked-list",0,[154,134,88,108],[["/practice/#remove-nodes-from-linked-list","Solution"]]],[2488,"Count Subarrays With Median K","count-subarrays-with-median-k",0,[6,71,122],[["/practice/#count-subarrays-with-median-k","Solution"]]],[2489,"Number of Substrings With Fixed Ratio","number-of-substrings-with-fixed-ratio",0,[71,95,155,122],[["/practice/#number-of-substrings-with-fixed-ratio","Solution"]]],[2490,"Circular Sentence","circular-sentence",0,[155],[["/practice/#circular-sentence","Solution"]]],[2491,"Divide Players Into Teams of Equal Skill","divide-players-into-teams-of-equal-skill",0,[6,71,172,150],[["/practice/#divide-players-into-teams-of-equal-skill","Solution"]]],[2492,"Minimum Score of a Path Between Two Cities","minimum-score-of-a-path-between-two-cities",0,[41,25,174,64],[["/practice/#minimum-score-of-a-path-between-two-cities","Solution"]]],[2493,"Divide Nodes Into the Maximum Number of Groups","divide-nodes-into-the-maximum-number-of-groups",0,[41,25,174,64],[["/practice/#divide-nodes-into-the-maximum-number-of-groups","Solution"]]],[2494,"Merge Overlapping Events in the Same Hall","merge-overlapping-events-in-the-same-hall",1,[40],[["/practice/#merge-overlapping-events-in-the-same-hall","Solution"]]],[2495,"Number of Subarrays Having Even Product","number-of-subarrays-having-even-product",0,[6,95,48],[["/practice/#number-of-subarrays-having-even-product","Solution"]]],[2496,"Maximum Value of a String in an Array","maximum-value-of-a-string-in-an-array",0,[6,155],[["/practice/#maximum-value-of-a-string-in-an-array","Solution"]]],[2497,"Maximum Star Sum of a Graph","maximum-star-sum-of-a-graph",0,[68,64,6,150,72],[["/practice/#maximum-star-sum-of-a-graph","Solution"]]],[2498,"Frog Jump II","frog-jump-ii",0,[68,6,14],[["/practice/#frog-jump-ii","Solution"]]],[2499,"Minimum Total Cost to Make Arrays Unequal","minimum-total-cost-to-make-arrays-unequal",0,[68,6,71,36],[["/practice/#minimum-total-cost-to-make-arrays-unequal","Solution"]]],[2500,"Delete Greatest Value in Each Row","delete-greatest-value-in-each-row",0,[6,96,150,145,72],[["/practice/#delete-greatest-value-in-each-row","Solution"]]],[2501,"Longest Square Streak in an Array","longest-square-streak-in-an-array",0,[6,71,14,48,150],[["/practice/#longest-square-streak-in-an-array","Solution"]]],[2502,"Design Memory Allocator","design-memory-allocator",0,[42,6,71,145],[["/practice/#design-memory-allocator","Solution"]]],[2503,"Maximum Number of Points From Grid Queries","maximum-number-of-points-from-grid-queries",0,[25,174,6,172,96,150,72],[["/practice/#maximum-number-of-points-from-grid-queries","Solution"]]],[2504,"Concatenate the Name and the Profession","concatenate-the-name-and-the-profession",1,[40],[["/practice/#concatenate-the-name-and-the-profession","Solution"]]],[2505,"Bitwise OR of All Subsequence Sums","bitwise-or-of-all-subsequence-sums",0,[18,24,6,95,122],[["/practice/#bitwise-or-of-all-subsequence-sums","Solution"]]],[2506,"Count Pairs Of Similar Strings","count-pairs-of-similar-strings",0,[18,6,71,155,36],[["/practice/#count-pairs-of-similar-strings","Solution"]]],[2507,"Smallest Value After Replacing With Sum of Prime Factors","smallest-value-after-replacing-with-sum-of-prime-factors",0,[95,112,124,143,145,144,125],[["/practice/#smallest-value-after-replacing-with-sum-of-prime-factors","Solution"]]],[2508,"Add Edges to Make Degrees of All Nodes Even","add-edges-to-make-degrees-of-all-nodes-even",0,[64,71],[["/practice/#add-edges-to-make-degrees-of-all-nodes-even","Solution"]]],[2509,"Cycle Length Queries in a Tree","cycle-length-queries-in-a-tree",0,[168,6,16,91,13],[["/practice/#cycle-length-queries-in-a-tree","Solution"]]],[2510,"Check if There is a Path With Equal Number of 0's And 1's","check-if-there-is-a-path-with-equal-number-of-0s-and-1s",0,[6,48,96],[["/practice/#check-if-there-is-a-path-with-equal-number-of-0s-and-1s","Solution"]]],[2511,"Maximum Enemy Forts That Can Be Captured","maximum-enemy-forts-that-can-be-captured",0,[6,172],[["/practice/#maximum-enemy-forts-that-can-be-captured","Solution"]]],[2512,"Reward Top K Students","reward-top-k-students",0,[6,71,155,150,72],[["/practice/#reward-top-k-students","Solution"]]],[2513,"Minimize the Maximum of Two Arrays","minimize-the-maximum-of-two-arrays",0,[95,14,112,76,85],[["/practice/#minimize-the-maximum-of-two-arrays","Solution"]]],[2514,"Count Anagrams","count-anagrams",0,[71,95,155,33,36,59],[["/practice/#count-anagrams","Solution"]]],[2515,"Shortest Distance to Target String in a Circular Array","shortest-distance-to-target-string-in-a-circular-array",0,[6,155],[["/practice/#shortest-distance-to-target-string-in-a-circular-array","Solution"]]],[2516,"Take K of Each Character From Left and Right","take-k-of-each-character-from-left-and-right",0,[71,155,146],[["/practice/#take-k-of-each-character-from-left-and-right","Solution"]]],[2517,"Maximum Tastiness of Candy Basket","maximum-tastiness-of-candy-basket",0,[68,6,14,150],[["/practice/#maximum-tastiness-of-candy-basket","Solution"]]],[2518,"Number of Great Partitions","number-of-great-partitions",0,[6,48],[["/practice/#number-of-great-partitions","Solution"]]],[2519,"Count the Number of K-Big Indices","count-the-number-of-k-big-indices",0,[12,139,6,14,46,113,101],[["/practice/#count-the-number-of-k-big-indices","Solution"]]],[2520,"Count the Digits That Divide a Number","count-the-digits-that-divide-a-number",0,[95],[["/practice/#count-the-digits-that-divide-a-number","Solution"]]],[2521,"Distinct Prime Factors of Product of Array","distinct-prime-factors-of-product-of-array",0,[6,71,95,67,112,124,143,144,125,51],[["/practice/#distinct-prime-factors-of-product-of-array","Solution"]]],[2522,"Partition String Into Substrings With Values at Most K","partition-string-into-substrings-with-values-at-most-k",0,[68,155,48],[["/practice/#partition-string-into-substrings-with-values-at-most-k","Solution"]]],[2523,"Closest Prime Numbers in Range","closest-prime-numbers-in-range",0,[95,112,124,143,144],[["/practice/#closest-prime-numbers-in-range","Solution"]]],[2524,"Maximum Frequency Score of a Subarray","maximum-frequency-score-of-a-subarray",0,[154,6,71,95,146],[["/practice/#maximum-frequency-score-of-a-subarray","Solution"]]],[2525,"Categorize Box According to Criteria","categorize-box-according-to-criteria",0,[95],[["/practice/#categorize-box-according-to-criteria","Solution"]]],[2526,"Find Consecutive Integers from a Data Stream","find-consecutive-integers-from-a-data-stream",0,[42,128,71,36,39],[["/practice/#find-consecutive-integers-from-a-data-stream","Solution"]]],[2527,"Find Xor-Beauty of Array","find-xor-beauty-of-array",0,[18,6,95],[["/practice/#find-xor-beauty-of-array","Solution"]]],[2528,"Maximize the Minimum Powered City","maximize-the-minimum-powered-city",0,[68,128,6,14,122,146],[["/practice/#maximize-the-minimum-powered-city","Solution"]]],[2529,"Maximum Count of Positive Integer and Negative Integer","maximum-count-of-positive-integer-and-negative-integer",0,[6,14,36],[["/practice/#maximum-count-of-positive-integer-and-negative-integer","Solution"]]],[2530,"Maximal Score After Applying K Operations","maximal-score-after-applying-k-operations",0,[68,6,72],[["/practice/#maximal-score-after-applying-k-operations","Solution"]]],[2531,"Make Number of Distinct Characters Equal","make-number-of-distinct-characters-equal",0,[71,155,36],[["/practice/#make-number-of-distinct-characters-equal","Solution"]]],[2532,"Time to Cross a Bridge","time-to-cross-a-bridge",0,[6,145,72],[["/practice/#time-to-cross-a-bridge","Solution"]]],[2533,"Number of Good Binary Strings","number-of-good-binary-strings",0,[48],[["/practice/#number-of-good-binary-strings","Solution"]]],[2534,"Time Taken to Cross the Door","time-taken-to-cross-the-door",0,[128,6,145],[["/practice/#time-taken-to-cross-the-door","Solution"]]],[2535,"Difference Between Element Sum and Digit Sum of an Array","difference-between-element-sum-and-digit-sum-of-an-array",0,[6,95],[["/practice/#difference-between-element-sum-and-digit-sum-of-an-array","Solution"]]],[2536,"Increment Submatrices by One","increment-submatrices-by-one",0,[6,96,122],[["/practice/#increment-submatrices-by-one","Solution"]]],[2537,"Count the Number of Good Subarrays","count-the-number-of-good-subarrays",0,[6,71,146],[["/practice/#count-the-number-of-good-subarrays","Solution"]]],[2538,"Difference Between Maximum and Minimum Price Sum","difference-between-maximum-and-minimum-price-sum",0,[168,41,6,48,169],[["/practice/#difference-between-maximum-and-minimum-price-sum","Solution"]]],[2539,"Count the Number of Good Subsequences","count-the-number-of-good-subsequences",0,[71,95,155,33,36],[["/practice/#count-the-number-of-good-subsequences","Solution"]]],[2540,"Minimum Common Value","minimum-common-value",0,[6,71,172,14],[["/practice/#minimum-common-value","Solution"]]],[2541,"Minimum Operations to Make Array Equal II","minimum-operations-to-make-array-equal-ii",0,[68,6,95],[["/practice/#minimum-operations-to-make-array-equal-ii","Solution"]]],[2542,"Maximum Subsequence Score","maximum-subsequence-score",0,[68,6,150,72],[["/practice/#maximum-subsequence-score","Solution"]]],[2543,"Check if Point Is Reachable","check-if-point-is-reachable",0,[95,67,112,51],[["/practice/#check-if-point-is-reachable","Solution"]]],[2544,"Alternating Digit Sum","alternating-digit-sum",0,[95],[["/practice/#alternating-digit-sum","Solution"]]],[2545,"Sort the Students by Their Kth Score","sort-the-students-by-their-kth-score",0,[6,96,150],[["/practice/#sort-the-students-by-their-kth-score","Solution"]]],[2546,"Apply Bitwise Operations to Make Strings Equal","apply-bitwise-operations-to-make-strings-equal",0,[18,155],[["/practice/#apply-bitwise-operations-to-make-strings-equal","Solution"]]],[2547,"Minimum Cost to Split an Array","minimum-cost-to-split-an-array",0,[6,71,48,36],[["/practice/#minimum-cost-to-split-an-array","Solution"]]],[2548,"Maximum Price to Fill a Bag","maximum-price-to-fill-a-bag",0,[68,6,150],[["/practice/#maximum-price-to-fill-a-bag","Solution"]]],[2549,"Count Distinct Numbers on Board","count-distinct-numbers-on-board",0,[6,71,95,145],[["/practice/#count-distinct-numbers-on-board","Solution"]]],[2550,"Count Collisions of Monkeys on a Polygon","count-collisions-of-monkeys-on-a-polygon",0,[134,95],[["/practice/#count-collisions-of-monkeys-on-a-polygon","Solution"]]],[2551,"Put Marbles in Bags","put-marbles-in-bags",0,[68,6,150,72],[["/practice/#put-marbles-in-bags","Solution"]]],[2552,"Count Increasing Quadruplets","count-increasing-quadruplets",0,[12,6,48,50,122],[["/practice/#count-increasing-quadruplets","Solution"]]],[2553,"Separate the Digits in an Array","separate-the-digits-in-an-array",0,[6,145],[["/practice/#separate-the-digits-in-an-array","Solution"]]],[2554,"Maximum Number of Integers to Choose From a Range I","maximum-number-of-integers-to-choose-from-a-range-i",0,[68,6,71,14,150],[["/practice/#maximum-number-of-integers-to-choose-from-a-range-i","Solution"]]],[2555,"Maximize Win From Two Segments","maximize-win-from-two-segments",0,[6,14,146],[["/practice/#maximize-win-from-two-segments","Solution"]]],[2556,"Disconnect Path in a Binary Matrix by at Most One Flip","disconnect-path-in-a-binary-matrix-by-at-most-one-flip",0,[41,25,6,48,96],[["/practice/#disconnect-path-in-a-binary-matrix-by-at-most-one-flip","Solution"]]],[2557,"Maximum Number of Integers to Choose From a Range II","maximum-number-of-integers-to-choose-from-a-range-ii",0,[68,6,14,150],[["/practice/#maximum-number-of-integers-to-choose-from-a-range-ii","Solution"]]],[2558,"Take Gifts From the Richest Pile","take-gifts-from-the-richest-pile",0,[6,145,72],[["/practice/#take-gifts-from-the-richest-pile","Solution"]]],[2559,"Count Vowel Strings in Ranges","count-vowel-strings-in-ranges",0,[6,155,122],[["/practice/#count-vowel-strings-in-ranges","Solution"]]],[2560,"House Robber IV","house-robber-iv",0,[68,6,14,48],[["/practice/#house-robber-iv","Solution"]]],[2561,"Rearranging Fruits","rearranging-fruits",0,[68,149,6,71],[["/practice/#rearranging-fruits","Solution"]]],[2562,"Find the Array Concatenation Value","find-the-array-concatenation-value",0,[6,172,145],[["/practice/#find-the-array-concatenation-value","Solution"]]],[2563,"Count the Number of Fair Pairs","count-the-number-of-fair-pairs",0,[6,172,14,150],[["/practice/#count-the-number-of-fair-pairs","Solution"]]],[2564,"Substring XOR Queries","substring-xor-queries",0,[18,6,71,155],[["/practice/#substring-xor-queries","Solution"]]],[2565,"Subsequence With the Minimum Score","subsequence-with-the-minimum-score",0,[172,155,14],[["/practice/#subsequence-with-the-minimum-score","Solution"]]],[2566,"Maximum Difference by Remapping a Digit","maximum-difference-by-remapping-a-digit",0,[68,95],[["/practice/#maximum-difference-by-remapping-a-digit","Solution"]]],[2567,"Minimum Score by Changing Two Elements","minimum-score-by-changing-two-elements",0,[68,6,150],[["/practice/#minimum-score-by-changing-two-elements","Solution"]]],[2568,"Minimum Impossible OR","minimum-impossible-or",0,[18,24,6],[["/practice/#minimum-impossible-or","Solution"]]],[2569,"Handling Sum Queries After Update","handling-sum-queries-after-update",0,[139,6],[["/practice/#handling-sum-queries-after-update","Solution"]]],[2570,"Merge Two 2D Arrays by Summing Values","merge-two-2d-arrays-by-summing-values",0,[6,71,172],[["/practice/#merge-two-2d-arrays-by-summing-values","Solution"]]],[2571,"Minimum Operations to Reduce an Integer to 0","minimum-operations-to-reduce-an-integer-to-0",0,[68,18,48],[["/practice/#minimum-operations-to-reduce-an-integer-to-0","Solution"]]],[2572,"Count the Number of Square-Free Subsets","count-the-number-of-square-free-subsets",0,[18,6,95,48,19,112],[["/practice/#count-the-number-of-square-free-subsets","Solution"]]],[2573,"Find the String with LCP","find-the-string-with-lcp",0,[68,174,6,155,48,96],[["/practice/#find-the-string-with-lcp","Solution"]]],[2574,"Left and Right Sum Differences","left-and-right-sum-differences",0,[6,122],[["/practice/#left-and-right-sum-differences","Solution"]]],[2575,"Find the Divisibility Array of a String","find-the-divisibility-array-of-a-string",0,[6,95,155],[["/practice/#find-the-divisibility-array-of-a-string","Solution"]]],[2576,"Find the Maximum Number of Marked Indices","find-the-maximum-number-of-marked-indices",0,[68,6,172,14,150],[["/practice/#find-the-maximum-number-of-marked-indices","Solution"]]],[2577,"Minimum Time to Visit a Cell In a Grid","minimum-time-to-visit-a-cell-in-a-grid",0,[25,64,6,96,142,72],[["/practice/#minimum-time-to-visit-a-cell-in-a-grid","Solution"]]],[2578,"Split With Minimum Sum","split-with-minimum-sum",0,[68,95,150],[["/practice/#split-with-minimum-sum","Solution"]]],[2579,"Count Total Number of Colored Cells","count-total-number-of-colored-cells",0,[95],[["/practice/#count-total-number-of-colored-cells","Solution"]]],[2580,"Count Ways to Group Overlapping Ranges","count-ways-to-group-overlapping-ranges",0,[6,150],[["/practice/#count-ways-to-group-overlapping-ranges","Solution"]]],[2581,"Count Number of Possible Root Nodes","count-number-of-possible-root-nodes",0,[168,41,6,71,48],[["/practice/#count-number-of-possible-root-nodes","Solution"]]],[2582,"Pass the Pillow","pass-the-pillow",0,[95,145],[["/practice/#pass-the-pillow","Solution"]]],[2583,"Kth Largest Sum in a Binary Tree","kth-largest-sum-in-a-binary-tree",0,[168,25,16,150],[["/practice/#kth-largest-sum-in-a-binary-tree","Solution"]]],[2584,"Split the Array to Make Coprime Products","split-the-array-to-make-coprime-products",0,[6,71,95,112,125],[["/practice/#split-the-array-to-make-coprime-products","Solution"]]],[2585,"Number of Ways to Earn Points","number-of-ways-to-earn-points",0,[6,48,82,21],[["/practice/#number-of-ways-to-earn-points","Solution"]]],[2586,"Count the Number of Vowel Strings in Range","count-the-number-of-vowel-strings-in-range",0,[6,155,36],[["/practice/#count-the-number-of-vowel-strings-in-range","Solution"]]],[2587,"Rearrange Array to Maximize Prefix Score","rearrange-array-to-maximize-prefix-score",0,[68,6,122,150],[["/practice/#rearrange-array-to-maximize-prefix-score","Solution"]]],[2588,"Count the Number of Beautiful Subarrays","count-the-number-of-beautiful-subarrays",0,[18,6,71,122],[["/practice/#count-the-number-of-beautiful-subarrays","Solution"]]],[2589,"Minimum Time to Complete All Tasks","minimum-time-to-complete-all-tasks",0,[154,68,6,14,150],[["/practice/#minimum-time-to-complete-all-tasks","Solution"]]],[2590,"Design a Todo List","design-a-todo-list",0,[42,6,71,155,150],[["/practice/#design-a-todo-list","Solution"]]],[2591,"Distribute Money to Maximum Children","distribute-money-to-maximum-children",0,[68,95],[["/practice/#distribute-money-to-maximum-children","Solution"]]],[2592,"Maximize Greatness of an Array","maximize-greatness-of-an-array",0,[68,6,172,150],[["/practice/#maximize-greatness-of-an-array","Solution"]]],[2593,"Find Score of an Array After Marking All Elements","find-score-of-an-array-after-marking-all-elements",0,[6,71,150,145,72],[["/practice/#find-score-of-an-array-after-marking-all-elements","Solution"]]],[2594,"Minimum Time to Repair Cars","minimum-time-to-repair-cars",0,[6,14],[["/practice/#minimum-time-to-repair-cars","Solution"]]],[2595,"Number of Even and Odd Bits","number-of-even-and-odd-bits",0,[18],[["/practice/#number-of-even-and-odd-bits","Solution"]]],[2596,"Check Knight Tour Configuration","check-knight-tour-configuration",0,[41,25,6,96,145],[["/practice/#check-knight-tour-configuration","Solution"]]],[2597,"The Number of Beautiful Subsets","the-number-of-beautiful-subsets",0,[6,71,95,48,8,33,150],[["/practice/#the-number-of-beautiful-subsets","Solution"]]],[2598,"Smallest Missing Non-negative Integer After Operations","smallest-missing-non-negative-integer-after-operations",0,[68,6,71,95],[["/practice/#smallest-missing-non-negative-integer-after-operations","Solution"]]],[2599,"Make the Prefix Sum Non-negative","make-the-prefix-sum-non-negative",0,[68,6,72],[["/practice/#make-the-prefix-sum-non-negative","Solution"]]],[2600,"K Items With the Maximum Sum","k-items-with-the-maximum-sum",0,[68,95],[["/practice/#k-items-with-the-maximum-sum","Solution"]]],[2601,"Prime Subtraction Operation","prime-subtraction-operation",0,[68,6,95,14,112],[["/practice/#prime-subtraction-operation","Solution"]]],[2602,"Minimum Operations to Make All Array Elements Equal","minimum-operations-to-make-all-array-elements-equal",0,[6,14,122,150],[["/practice/#minimum-operations-to-make-all-array-elements-equal","Solution"]]],[2603,"Collect Coins in a Tree","collect-coins-in-a-tree",0,[168,64,165,6],[["/practice/#collect-coins-in-a-tree","Solution"]]],[2604,"Minimum Time to Eat All Grains","minimum-time-to-eat-all-grains",0,[6,172,14,150],[["/practice/#minimum-time-to-eat-all-grains","Solution"]]],[2605,"Form Smallest Number From Two Digit Arrays","form-smallest-number-from-two-digit-arrays",0,[6,71,50],[["/practice/#form-smallest-number-from-two-digit-arrays","Solution"]]],[2606,"Find the Substring With Maximum Cost","find-the-substring-with-maximum-cost",0,[6,71,155,48],[["/practice/#find-the-substring-with-maximum-cost","Solution"]]],[2607,"Make K-Subarray Sums Equal","make-k-subarray-sums-equal",0,[68,6,95,112,150],[["/practice/#make-k-subarray-sums-equal","Solution"]]],[2608,"Shortest Cycle in a Graph","shortest-cycle-in-a-graph",0,[25,64],[["/practice/#shortest-cycle-in-a-graph","Solution"]]],[2609,"Find the Longest Balanced Substring of a Binary String","find-the-longest-balanced-substring-of-a-binary-string",0,[155],[["/practice/#find-the-longest-balanced-substring-of-a-binary-string","Solution"]]],[2610,"Convert an Array Into a 2D Array With Conditions","convert-an-array-into-a-2d-array-with-conditions",0,[6,71],[["/practice/#convert-an-array-into-a-2d-array-with-conditions","Solution"]]],[2611,"Mice and Cheese","mice-and-cheese",0,[68,6,150,72],[["/practice/#mice-and-cheese","Solution"]]],[2612,"Minimum Reverse Operations","minimum-reverse-operations",0,[25,174,6,71,113],[["/practice/#minimum-reverse-operations","Solution"]]],[2613,"Beautiful Pairs","beautiful-pairs",0,[63,6,95,46,113,150],[["/practice/#beautiful-pairs","Solution"]]],[2614,"Prime In Diagonal","prime-in-diagonal",0,[6,95,96,112],[["/practice/#prime-in-diagonal","Solution"]]],[2615,"Sum of Distances","sum-of-distances",0,[6,71,122],[["/practice/#sum-of-distances","Solution"]]],[2616,"Minimize the Maximum Difference of Pairs","minimize-the-maximum-difference-of-pairs",0,[68,6,14,48,150],[["/practice/#minimize-the-maximum-difference-of-pairs","Solution"]]],[2617,"Minimum Number of Visited Cells in a Grid","minimum-number-of-visited-cells-in-a-grid",0,[154,25,174,6,48,96,108,72],[["/practice/#minimum-number-of-visited-cells-in-a-grid","Solution"]]],[2618,"Check if Object Instance of Class","check-if-object-instance-of-class",2,[79],[["/practice/#check-if-object-instance-of-class","Solution"]]],[2619,"Array Prototype Last","array-prototype-last",2,[79],[["/practice/#array-prototype-last","Solution"]]],[2620,"Counter","counter",2,[79],[["/practice/#counter","Solution"]]],[2621,"Sleep","sleep",2,[79],[["/practice/#sleep","Solution"]]],[2622,"Cache With Time Limit","cache-with-time-limit",2,[79],[["/practice/#cache-with-time-limit","Solution"]]],[2623,"Memoize","memoize",2,[79],[["/practice/#memoize","Solution"]]],[2624,"Snail Traversal","snail-traversal",2,[79],[["/practice/#snail-traversal","Solution"]]],[2625,"Flatten Deeply Nested Array","flatten-deeply-nested-array",2,[79],[["/practice/#flatten-deeply-nested-array","Solution"]]],[2626,"Array Reduce Transformation","array-reduce-transformation",2,[79],[["/practice/#array-reduce-transformation","Solution"]]],[2627,"Debounce","debounce",2,[79],[["/practice/#debounce","Solution"]]],[2628,"JSON Deep Equal","json-deep-equal",2,[79],[["/practice/#json-deep-equal","Solution"]]],[2629,"Function Composition","function-composition",2,[79],[["/practice/#function-composition","Solution"]]],[2630,"Memoize II","memoize-ii",2,[79],[["/practice/#memoize-ii","Solution"]]],[2631,"Group By","group-by",2,[79],[["/practice/#group-by","Solution"]]],[2632,"Curry","curry",2,[79],[["/practice/#curry","Solution"]]],[2633,"Convert Object to JSON String","convert-object-to-json-string",2,[79],[["/practice/#convert-object-to-json-string","Solution"]]],[2634,"Filter Elements from Array","filter-elements-from-array",2,[79],[["/practice/#filter-elements-from-array","Solution"]]],[2635,"Apply Transform Over Each Element in Array","apply-transform-over-each-element-in-array",2,[79],[["/practice/#apply-transform-over-each-element-in-array","Solution"]]],[2636,"Promise Pool","promise-pool",2,[79],[["/practice/#promise-pool","Solution"]]],[2637,"Promise Time Limit","promise-time-limit",2,[79],[["/practice/#promise-time-limit","Solution"]]],[2638,"Count the Number of K-Free Subsets","count-the-number-of-k-free-subsets",0,[6,95,48,33,150],[["/practice/#count-the-number-of-k-free-subsets","Solution"]]],[2639,"Find the Width of Columns of a Grid","find-the-width-of-columns-of-a-grid",0,[6,96],[["/practice/#find-the-width-of-columns-of-a-grid","Solution"]]],[2640,"Find the Score of All Prefixes of an Array","find-the-score-of-all-prefixes-of-an-array",0,[6,122],[["/practice/#find-the-score-of-all-prefixes-of-an-array","Solution"]]],[2641,"Cousins in Binary Tree II","cousins-in-binary-tree-ii",0,[168,41,25,71,16],[["/practice/#cousins-in-binary-tree-ii","Solution"]]],[2642,"Design Graph With Shortest Path Calculator","design-graph-with-shortest-path-calculator",0,[64,42,142,72],[["/practice/#design-graph-with-shortest-path-calculator","Solution"]]],[2643,"Row With Maximum Ones","row-with-maximum-ones",0,[6,96],[["/practice/#row-with-maximum-ones","Solution"]]],[2644,"Find the Maximum Divisibility Score","find-the-maximum-divisibility-score",0,[6],[["/practice/#find-the-maximum-divisibility-score","Solution"]]],[2645,"Minimum Additions to Make Valid String","minimum-additions-to-make-valid-string",0,[154,68,155,48],[["/practice/#minimum-additions-to-make-valid-string","Solution"]]],[2646,"Minimize the Total Price of the Trips","minimize-the-total-price-of-the-trips",0,[168,41,64,6,48],[["/practice/#minimize-the-total-price-of-the-trips","Solution"]]],[2647,"Color the Triangle Red","color-the-triangle-red",0,[6,95],[["/practice/#color-the-triangle-red","Solution"]]],[2648,"Generate Fibonacci Sequence","generate-fibonacci-sequence",2,[79],[["/practice/#generate-fibonacci-sequence","Solution"]]],[2649,"Nested Array Generator","nested-array-generator",2,[79],[["/practice/#nested-array-generator","Solution"]]],[2650,"Design Cancellable Function","design-cancellable-function",2,[79],[["/practice/#design-cancellable-function","Solution"]]],[2651,"Calculate Delayed Arrival Time","calculate-delayed-arrival-time",0,[95],[["/practice/#calculate-delayed-arrival-time","Solution"]]],[2652,"Sum Multiples","sum-multiples",0,[95],[["/practice/#sum-multiples","Solution"]]],[2653,"Sliding Subarray Beauty","sliding-subarray-beauty",0,[6,71,146],[["/practice/#sliding-subarray-beauty","Solution"]]],[2654,"Minimum Number of Operations to Make All Array Elements Equal to 1","minimum-number-of-operations-to-make-all-array-elements-equal-to-1",0,[6,95,67,112,51],[["/practice/#minimum-number-of-operations-to-make-all-array-elements-equal-to-1","Solution"]]],[2655,"Find Maximal Uncovered Ranges","find-maximal-uncovered-ranges",0,[6,150],[["/practice/#find-maximal-uncovered-ranges","Solution"]]],[2656,"Maximum Sum With Exactly K Elements ","maximum-sum-with-exactly-k-elements",0,[68,6],[["/practice/#maximum-sum-with-exactly-k-elements","Solution"]]],[2657,"Find the Prefix Common Array of Two Arrays","find-the-prefix-common-array-of-two-arrays",0,[18,6,71],[["/practice/#find-the-prefix-common-array-of-two-arrays","Solution"]]],[2658,"Maximum Number of Fish in a Grid","maximum-number-of-fish-in-a-grid",0,[41,25,174,6,96],[["/practice/#maximum-number-of-fish-in-a-grid","Solution"]]],[2659,"Make Array Empty","make-array-empty",0,[68,12,139,6,14,113,150],[["/practice/#make-array-empty","Solution"]]],[2660,"Determine the Winner of a Bowling Game","determine-the-winner-of-a-bowling-game",0,[6,145],[["/practice/#determine-the-winner-of-a-bowling-game","Solution"]]],[2661,"First Completely Painted Row or Column","first-completely-painted-row-or-column",0,[6,71,96],[["/practice/#first-completely-painted-row-or-column","Solution"]]],[2662,"Minimum Cost of a Path With Special Roads","minimum-cost-of-a-path-with-special-roads",0,[64,6,142,72],[["/practice/#minimum-cost-of-a-path-with-special-roads","Solution"]]],[2663,"Lexicographically Smallest Beautiful String","lexicographically-smallest-beautiful-string",0,[68,155],[["/practice/#lexicographically-smallest-beautiful-string","Solution"]]],[2664,"The Knight’s Tour","the-knights-tour",0,[6,8,96],[["/practice/#the-knights-tour","Solution"]]],[2665,"Counter II","counter-ii",2,[79],[["/practice/#counter-ii","Solution"]]],[2666,"Allow One Function Call","allow-one-function-call",2,[79],[["/practice/#allow-one-function-call","Solution"]]],[2667,"Create Hello World Function","create-hello-world-function",2,[79],[["/practice/#create-hello-world-function","Solution"]]],[2668,"Find Latest Salaries","find-latest-salaries",1,[40],[["/practice/#find-latest-salaries","Solution"]]],[2669,"Count Artist Occurrences On Spotify Ranking List","count-artist-occurrences-on-spotify-ranking-list",1,[40],[["/practice/#count-artist-occurrences-on-spotify-ranking-list","Solution"]]],[2670,"Find the Distinct Difference Array","find-the-distinct-difference-array",0,[6,71],[["/practice/#find-the-distinct-difference-array","Solution"]]],[2671,"Frequency Tracker","frequency-tracker",0,[42,71],[["/practice/#frequency-tracker","Solution"]]],[2672,"Number of Adjacent Elements With the Same Color","number-of-adjacent-elements-with-the-same-color",0,[6],[["/practice/#number-of-adjacent-elements-with-the-same-color","Solution"]]],[2673,"Make Costs of Paths Equal in a Binary Tree","make-costs-of-paths-equal-in-a-binary-tree",0,[68,168,6,48,16],[["/practice/#make-costs-of-paths-equal-in-a-binary-tree","Solution"]]],[2674,"Split a Circular Linked List","split-a-circular-linked-list",0,[88,172],[["/practice/#split-a-circular-linked-list","Solution"]]],[2675,"Array of Objects to Matrix","array-of-objects-to-matrix",2,[79],[["/practice/#array-of-objects-to-matrix","Solution"]]],[2676,"Throttle","throttle",2,[79],[["/practice/#throttle","Solution"]]],[2677,"Chunk Array","chunk-array",2,[79],[["/practice/#chunk-array","Solution"]]],[2678,"Number of Senior Citizens","number-of-senior-citizens",0,[6,155],[["/practice/#number-of-senior-citizens","Solution"]]],[2679,"Sum in a Matrix","sum-in-a-matrix",0,[6,96,150,145,72],[["/practice/#sum-in-a-matrix","Solution"]]],[2680,"Maximum OR","maximum-or",0,[68,18,6,122],[["/practice/#maximum-or","Solution"]]],[2681,"Power of Heroes","power-of-heroes",0,[6,95,48,122,150],[["/practice/#power-of-heroes","Solution"]]],[2682,"Find the Losers of the Circular Game","find-the-losers-of-the-circular-game",0,[6,71,145],[["/practice/#find-the-losers-of-the-circular-game","Solution"]]],[2683,"Neighboring Bitwise XOR","neighboring-bitwise-xor",0,[18,6],[["/practice/#neighboring-bitwise-xor","Solution"]]],[2684,"Maximum Number of Moves in a Grid","maximum-number-of-moves-in-a-grid",0,[6,48,96],[["/practice/#maximum-number-of-moves-in-a-grid","Solution"]]],[2685,"Count the Number of Complete Components","count-the-number-of-complete-components",0,[41,25,174,64],[["/practice/#count-the-number-of-complete-components","Solution"]]],[2686,"Immediate Food Delivery III","immediate-food-delivery-iii",1,[40],[["/practice/#immediate-food-delivery-iii","Solution"]]],[2687,"Bikes Last Time Used ","bikes-last-time-used",1,[40],[["/practice/#bikes-last-time-used","Solution"]]],[2688,"Find Active Users","find-active-users",1,[40],[["/practice/#find-active-users","Solution"]]],[2689,"Extract Kth Character From The Rope Tree","extract-kth-character-from-the-rope-tree",0,[168,41,16],[["/practice/#extract-kth-character-from-the-rope-tree","Solution"]]],[2690,"Infinite Method Object","infinite-method-object",2,[79],[["/practice/#infinite-method-object","Solution"]]],[2691,"Immutability Helper","immutability-helper",2,[79],[["/practice/#immutability-helper","Problem details"]]],[2692,"Make Object Immutable","make-object-immutable",2,[79],[["/practice/#make-object-immutable","Solution"]]],[2693,"Call Function with Custom Context","call-function-with-custom-context",2,[79],[["/practice/#call-function-with-custom-context","Solution"]]],[2694,"Event Emitter","event-emitter",2,[79],[["/practice/#event-emitter","Solution"]]],[2695,"Array Wrapper","array-wrapper",2,[79],[["/practice/#array-wrapper","Solution"]]],[2696,"Minimum String Length After Removing Substrings","minimum-string-length-after-removing-substrings",0,[154,155,145],[["/practice/#minimum-string-length-after-removing-substrings","Solution"]]],[2697,"Lexicographically Smallest Palindrome","lexicographically-smallest-palindrome",0,[68,172,155],[["/practice/#lexicographically-smallest-palindrome","Solution"]]],[2698,"Find the Punishment Number of an Integer","find-the-punishment-number-of-an-integer",0,[95,8],[["/practice/#find-the-punishment-number-of-an-integer","Solution"]]],[2699,"Modify Graph Edge Weights","modify-graph-edge-weights",0,[64,142,72],[["/practice/#modify-graph-edge-weights","Solution"]]],[2700,"Differences Between Two Objects","differences-between-two-objects",2,[79],[["/practice/#differences-between-two-objects","Solution"]]],[2701,"Consecutive Transactions with Increasing Amounts","consecutive-transactions-with-increasing-amounts",1,[40],[["/practice/#consecutive-transactions-with-increasing-amounts","Solution"]]],[2702,"Minimum Operations to Make Numbers Non-positive","minimum-operations-to-make-numbers-non-positive",0,[6,14],[["/practice/#minimum-operations-to-make-numbers-non-positive","Solution"]]],[2703,"Return Length of Arguments Passed","return-length-of-arguments-passed",2,[79],[["/practice/#return-length-of-arguments-passed","Solution"]]],[2704,"To Be Or Not To Be","to-be-or-not-to-be",2,[79],[["/practice/#to-be-or-not-to-be","Solution"]]],[2705,"Compact Object","compact-object",2,[79],[["/practice/#compact-object","Solution"]]],[2706,"Buy Two Chocolates","buy-two-chocolates",0,[68,6,150],[["/practice/#buy-two-chocolates","Solution"]]],[2707,"Extra Characters in a String","extra-characters-in-a-string",0,[171,6,71,155,48],[["/practice/#extra-characters-in-a-string","Solution"]]],[2708,"Maximum Strength of a Group","maximum-strength-of-a-group",0,[68,18,6,48,8,50,150],[["/practice/#maximum-strength-of-a-group","Solution"]]],[2709,"Greatest Common Divisor Traversal","greatest-common-divisor-traversal",0,[174,6,95,67,112,125,51],[["/practice/#greatest-common-divisor-traversal","Solution"]]],[2710,"Remove Trailing Zeros From a String","remove-trailing-zeros-from-a-string",0,[155],[["/practice/#remove-trailing-zeros-from-a-string","Solution"]]],[2711,"Difference of Number of Distinct Values on Diagonals","difference-of-number-of-distinct-values-on-diagonals",0,[6,71,96],[["/practice/#difference-of-number-of-distinct-values-on-diagonals","Solution"]]],[2712,"Minimum Cost to Make All Characters Equal","minimum-cost-to-make-all-characters-equal",0,[68,155,48],[["/practice/#minimum-cost-to-make-all-characters-equal","Solution"]]],[2713,"Maximum Strictly Increasing Cells in a Matrix","maximum-strictly-increasing-cells-in-a-matrix",0,[100,6,71,14,48,96,113,150],[["/practice/#maximum-strictly-increasing-cells-in-a-matrix","Solution"]]],[2714,"Find Shortest Path with K Hops","find-shortest-path-with-k-hops",0,[64,142,72],[["/practice/#find-shortest-path-with-k-hops","Solution"]]],[2715,"Timeout Cancellation","timeout-cancellation",2,[79],[["/practice/#timeout-cancellation","Solution"]]],[2716,"Minimize String Length","minimize-string-length",0,[71,155],[["/practice/#minimize-string-length","Solution"]]],[2717,"Semi-Ordered Permutation","semi-ordered-permutation",0,[6,145],[["/practice/#semi-ordered-permutation","Solution"]]],[2718,"Sum of Matrix After Queries","sum-of-matrix-after-queries",0,[6,71],[["/practice/#sum-of-matrix-after-queries","Solution"]]],[2719,"Count of Integers","count-of-integers",0,[95,155,48],[["/practice/#count-of-integers","Solution"]]],[2720,"Popularity Percentage","popularity-percentage",1,[40],[["/practice/#popularity-percentage","Solution"]]],[2721,"Execute Asynchronous Functions in Parallel","execute-asynchronous-functions-in-parallel",2,[79],[["/practice/#execute-asynchronous-functions-in-parallel","Solution"]]],[2722,"Join Two Arrays by ID","join-two-arrays-by-id",2,[79],[["/practice/#join-two-arrays-by-id","Solution"]]],[2723,"Add Two Promises","add-two-promises",2,[79],[["/practice/#add-two-promises","Solution"]]],[2724,"Sort By","sort-by",2,[79],[["/practice/#sort-by","Solution"]]],[2725,"Interval Cancellation","interval-cancellation",2,[79],[["/practice/#interval-cancellation","Solution"]]],[2726,"Calculator with Method Chaining","calculator-with-method-chaining",2,[79],[["/practice/#calculator-with-method-chaining","Solution"]]],[2727,"Is Object Empty","is-object-empty",2,[79],[["/practice/#is-object-empty","Solution"]]],[2728,"Count Houses in a Circular Street","count-houses-in-a-circular-street",0,[6,77],[["/practice/#count-houses-in-a-circular-street","Solution"]]],[2729,"Check if The Number is Fascinating","check-if-the-number-is-fascinating",0,[71,95],[["/practice/#check-if-the-number-is-fascinating","Solution"]]],[2730,"Find the Longest Semi-Repetitive Substring","find-the-longest-semi-repetitive-substring",0,[155,146],[["/practice/#find-the-longest-semi-repetitive-substring","Solution"]]],[2731,"Movement of Robots","movement-of-robots",0,[24,6,122,150],[["/practice/#movement-of-robots","Solution"]]],[2732,"Find a Good Subset of the Matrix","find-a-good-subset-of-the-matrix",0,[18,6,71,96],[["/practice/#find-a-good-subset-of-the-matrix","Solution"]]],[2733,"Neither Minimum nor Maximum","neither-minimum-nor-maximum",0,[6,150],[["/practice/#neither-minimum-nor-maximum","Solution"]]],[2734,"Lexicographically Smallest String After Substring Operation","lexicographically-smallest-string-after-substring-operation",0,[68,155],[["/practice/#lexicographically-smallest-string-after-substring-operation","Solution"]]],[2735,"Collecting Chocolates","collecting-chocolates",0,[6,50],[["/practice/#collecting-chocolates","Solution"]]],[2736,"Maximum Sum Queries","maximum-sum-queries",0,[154,12,139,6,14,150,108],[["/practice/#maximum-sum-queries","Solution"]]],[2737,"Find the Closest Marked Node","find-the-closest-marked-node",0,[64,6,142,72],[["/practice/#find-the-closest-marked-node","Solution"]]],[2738,"Count Occurrences in Text","count-occurrences-in-text",1,[40],[["/practice/#count-occurrences-in-text","Solution"]]],[2739,"Total Distance Traveled","total-distance-traveled",0,[95,145],[["/practice/#total-distance-traveled","Solution"]]],[2740,"Find the Value of the Partition","find-the-value-of-the-partition",0,[6,150],[["/practice/#find-the-value-of-the-partition","Solution"]]],[2741,"Special Permutations","special-permutations",0,[18,6,48,19],[["/practice/#special-permutations","Solution"]]],[2742,"Painting the Walls","painting-the-walls",0,[6,48],[["/practice/#painting-the-walls","Solution"]]],[2743,"Count Substrings Without Repeating Character","count-substrings-without-repeating-character",0,[71,155,146],[["/practice/#count-substrings-without-repeating-character","Solution"]]],[2744,"Find Maximum Number of String Pairs","find-maximum-number-of-string-pairs",0,[6,71,155,145],[["/practice/#find-maximum-number-of-string-pairs","Solution"]]],[2745,"Construct the Longest New String","construct-the-longest-new-string",0,[68,24,95,48],[["/practice/#construct-the-longest-new-string","Solution"]]],[2746,"Decremental String Concatenation","decremental-string-concatenation",0,[6,155,48],[["/practice/#decremental-string-concatenation","Solution"]]],[2747,"Count Zero Request Servers","count-zero-request-servers",0,[6,71,150,146],[["/practice/#count-zero-request-servers","Solution"]]],[2748,"Number of Beautiful Pairs","number-of-beautiful-pairs",0,[6,71,95,36,112],[["/practice/#number-of-beautiful-pairs","Solution"]]],[2749,"Minimum Operations to Make the Integer Zero","minimum-operations-to-make-the-integer-zero",0,[18,24,50],[["/practice/#minimum-operations-to-make-the-integer-zero","Solution"]]],[2750,"Ways to Split Array Into Good Subarrays","ways-to-split-array-into-good-subarrays",0,[6,95,48],[["/practice/#ways-to-split-array-into-good-subarrays","Solution"]]],[2751,"Robot Collisions","robot-collisions",0,[154,6,150,145],[["/practice/#robot-collisions","Solution"]]],[2752,"Customers with Maximum Number of Transactions on Consecutive Days","customers-with-maximum-number-of-transactions-on-consecutive-days",1,[40],[["/practice/#customers-with-maximum-number-of-transactions-on-consecutive-days","Solution"]]],[2753,"Count Houses in a Circular Street II","count-houses-in-a-circular-street-ii",0,[],[["/practice/#count-houses-in-a-circular-street-ii","Solution"]]],[2754,"Bind Function to Context","bind-function-to-context",2,[79],[["/practice/#bind-function-to-context","Solution"]]],[2755,"Deep Merge of Two Objects","deep-merge-of-two-objects",2,[79],[["/practice/#deep-merge-of-two-objects","Solution"]]],[2756,"Query Batching","query-batching",2,[79],[["/practice/#query-batching","Problem details"]]],[2757,"Generate Circular Array Values","generate-circular-array-values",2,[79],[["/practice/#generate-circular-array-values","Solution"]]],[2758,"Next Day","next-day",2,[79],[["/practice/#next-day","Solution"]]],[2759,"Convert JSON String to Object","convert-json-string-to-object",2,[79],[["/practice/#convert-json-string-to-object","Solution"]]],[2760,"Longest Even Odd Subarray With Threshold","longest-even-odd-subarray-with-threshold",0,[6,146],[["/practice/#longest-even-odd-subarray-with-threshold","Solution"]]],[2761,"Prime Pairs With Target Sum","prime-pairs-with-target-sum",0,[6,95,50,112],[["/practice/#prime-pairs-with-target-sum","Solution"]]],[2762,"Continuous Subarrays","continuous-subarrays",0,[128,6,113,146,107,72],[["/practice/#continuous-subarrays","Solution"]]],[2763,"Sum of Imbalance Numbers of All Subarrays","sum-of-imbalance-numbers-of-all-subarrays",0,[6,71,50],[["/practice/#sum-of-imbalance-numbers-of-all-subarrays","Solution"]]],[2764,"Is Array a Preorder of Some ‌Binary Tree","is-array-a-preorder-of-some-binary-tree",0,[154,168,41,16],[["/practice/#is-array-a-preorder-of-some-binary-tree","Solution"]]],[2765,"Longest Alternating Subarray","longest-alternating-subarray",0,[6,50],[["/practice/#longest-alternating-subarray","Solution"]]],[2766,"Relocate Marbles","relocate-marbles",0,[6,71,150,145],[["/practice/#relocate-marbles","Solution"]]],[2767,"Partition String Into Minimum Beautiful Substrings","partition-string-into-minimum-beautiful-substrings",0,[71,155,48,8],[["/practice/#partition-string-into-minimum-beautiful-substrings","Solution"]]],[2768,"Number of Black Blocks","number-of-black-blocks",0,[6,71,50],[["/practice/#number-of-black-blocks","Solution"]]],[2769,"Find the Maximum Achievable Number","find-the-maximum-achievable-number",0,[95],[["/practice/#find-the-maximum-achievable-number","Solution"]]],[2770,"Maximum Number of Jumps to Reach the Last Index","maximum-number-of-jumps-to-reach-the-last-index",0,[6,48],[["/practice/#maximum-number-of-jumps-to-reach-the-last-index","Solution"]]],[2771,"Longest Non-decreasing Subarray From Two Arrays","longest-non-decreasing-subarray-from-two-arrays",0,[6,48],[["/practice/#longest-non-decreasing-subarray-from-two-arrays","Solution"]]],[2772,"Apply Operations to Make All Array Elements Equal to Zero","apply-operations-to-make-all-array-elements-equal-to-zero",0,[6,122],[["/practice/#apply-operations-to-make-all-array-elements-equal-to-zero","Solution"]]],[2773,"Height of Special Binary Tree","height-of-special-binary-tree",0,[168,41,25,16],[["/practice/#height-of-special-binary-tree","Solution"]]],[2774,"Array Upper Bound","array-upper-bound",2,[79],[["/practice/#array-upper-bound","Solution"]]],[2775,"Undefined to Null","undefined-to-null",2,[79],[["/practice/#undefined-to-null","Solution"]]],[2776,"Convert Callback Based Function to Promise Based Function","convert-callback-based-function-to-promise-based-function",2,[79],[["/practice/#convert-callback-based-function-to-promise-based-function","Solution"]]],[2777,"Date Range Generator","date-range-generator",2,[79],[["/practice/#date-range-generator","Solution"]]],[2778,"Sum of Squares of Special Elements ","sum-of-squares-of-special-elements",0,[6,50],[["/practice/#sum-of-squares-of-special-elements","Solution"]]],[2779,"Maximum Beauty of an Array After Applying Operation","maximum-beauty-of-an-array-after-applying-operation",0,[6,14,150,146],[["/practice/#maximum-beauty-of-an-array-after-applying-operation","Solution"]]],[2780,"Minimum Index of a Valid Split","minimum-index-of-a-valid-split",0,[6,71,150],[["/practice/#minimum-index-of-a-valid-split","Solution"]]],[2781,"Length of the Longest Valid Substring","length-of-the-longest-valid-substring",0,[6,71,155,146],[["/practice/#length-of-the-longest-valid-substring","Solution"]]],[2782,"Number of Unique Categories","number-of-unique-categories",0,[174,36,77],[["/practice/#number-of-unique-categories","Solution"]]],[2783,"Flight Occupancy and Waitlist Analysis","flight-occupancy-and-waitlist-analysis",1,[40],[["/practice/#flight-occupancy-and-waitlist-analysis","Solution"]]],[2784,"Check if Array is Good","check-if-array-is-good",0,[6,71,150],[["/practice/#check-if-array-is-good","Solution"]]],[2785,"Sort Vowels in a String","sort-vowels-in-a-string",0,[155,150],[["/practice/#sort-vowels-in-a-string","Solution"]]],[2786,"Visit Array Positions to Maximize Score","visit-array-positions-to-maximize-score",0,[6,48],[["/practice/#visit-array-positions-to-maximize-score","Solution"]]],[2787,"Ways to Express an Integer as Sum of Powers","ways-to-express-an-integer-as-sum-of-powers",0,[48],[["/practice/#ways-to-express-an-integer-as-sum-of-powers","Solution"]]],[2788,"Split Strings by Separator","split-strings-by-separator",0,[6,155],[["/practice/#split-strings-by-separator","Solution"]]],[2789,"Largest Element in an Array after Merge Operations","largest-element-in-an-array-after-merge-operations",0,[68,6],[["/practice/#largest-element-in-an-array-after-merge-operations","Solution"]]],[2790,"Maximum Number of Groups With Increasing Length","maximum-number-of-groups-with-increasing-length",0,[68,6,95,14,150],[["/practice/#maximum-number-of-groups-with-increasing-length","Solution"]]],[2791,"Count Paths That Can Form a Palindrome in a Tree","count-paths-that-can-form-a-palindrome-in-a-tree",0,[18,168,41,71],[["/practice/#count-paths-that-can-form-a-palindrome-in-a-tree","Solution"]]],[2792,"Count Nodes That Are Great Enough","count-nodes-that-are-great-enough",0,[168,41,46,16],[["/practice/#count-nodes-that-are-great-enough","Solution"]]],[2793,"Status of Flight Tickets","status-of-flight-tickets",1,[40],[["/practice/#status-of-flight-tickets","Solution"]]],[2794,"Create Object from Two Arrays","create-object-from-two-arrays",2,[79],[["/practice/#create-object-from-two-arrays","Solution"]]],[2795,"Parallel Execution of Promises for Individual Results Retrieval","parallel-execution-of-promises-for-individual-results-retrieval",2,[79],[["/practice/#parallel-execution-of-promises-for-individual-results-retrieval","Solution"]]],[2796,"Repeat String","repeat-string",2,[79],[["/practice/#repeat-string","Solution"]]],[2797,"Partial Function with Placeholders","partial-function-with-placeholders",2,[79],[["/practice/#partial-function-with-placeholders","Solution"]]],[2798,"Number of Employees Who Met the Target","number-of-employees-who-met-the-target",0,[6],[["/practice/#number-of-employees-who-met-the-target","Solution"]]],[2799,"Count Complete Subarrays in an Array","count-complete-subarrays-in-an-array",0,[6,71,146],[["/practice/#count-complete-subarrays-in-an-array","Solution"]]],[2800,"Shortest String That Contains Three Strings","shortest-string-that-contains-three-strings",0,[68,155,50],[["/practice/#shortest-string-that-contains-three-strings","Solution"]]],[2801,"Count Stepping Numbers in Range","count-stepping-numbers-in-range",0,[155,48],[["/practice/#count-stepping-numbers-in-range","Solution"]]],[2802,"Find The K-th Lucky Number","find-the-k-th-lucky-number",0,[18,95,155],[["/practice/#find-the-k-th-lucky-number","Solution"]]],[2803,"Factorial Generator","factorial-generator",2,[79],[["/practice/#factorial-generator","Solution"]]],[2804,"Array Prototype ForEach","array-prototype-foreach",2,[79],[["/practice/#array-prototype-foreach","Solution"]]],[2805,"Custom Interval","custom-interval",2,[79],[["/practice/#custom-interval","Solution"]]],[2806,"Account Balance After Rounded Purchase","account-balance-after-rounded-purchase",0,[95],[["/practice/#account-balance-after-rounded-purchase","Solution"]]],[2807,"Insert Greatest Common Divisors in Linked List","insert-greatest-common-divisors-in-linked-list",0,[88,95,112],[["/practice/#insert-greatest-common-divisors-in-linked-list","Solution"]]],[2808,"Minimum Seconds to Equalize a Circular Array","minimum-seconds-to-equalize-a-circular-array",0,[6,71],[["/practice/#minimum-seconds-to-equalize-a-circular-array","Solution"]]],[2809,"Minimum Time to Make Array Sum At Most x","minimum-time-to-make-array-sum-at-most-x",0,[6,48,150],[["/practice/#minimum-time-to-make-array-sum-at-most-x","Solution"]]],[2810,"Faulty Keyboard","faulty-keyboard",0,[155,145],[["/practice/#faulty-keyboard","Solution"]]],[2811,"Check if it is Possible to Split Array","check-if-it-is-possible-to-split-array",0,[68,6,48],[["/practice/#check-if-it-is-possible-to-split-array","Solution"]]],[2812,"Find the Safest Path in a Grid","find-the-safest-path-in-a-grid",0,[25,174,6,14,96,72],[["/practice/#find-the-safest-path-in-a-grid","Solution"]]],[2813,"Maximum Elegance of a K-Length Subsequence","maximum-elegance-of-a-k-length-subsequence",0,[154,68,6,71,150,72],[["/practice/#maximum-elegance-of-a-k-length-subsequence","Solution"]]],[2814,"Minimum Time Takes to Reach Destination Without Drowning","minimum-time-takes-to-reach-destination-without-drowning",0,[25,6,96],[["/practice/#minimum-time-takes-to-reach-destination-without-drowning","Solution"]]],[2815,"Max Pair Sum in an Array","max-pair-sum-in-an-array",0,[6,71],[["/practice/#max-pair-sum-in-an-array","Solution"]]],[2816,"Double a Number Represented as a Linked List","double-a-number-represented-as-a-linked-list",0,[154,88,95],[["/practice/#double-a-number-represented-as-a-linked-list","Solution"]]],[2817,"Minimum Absolute Difference Between Elements With Constraint","minimum-absolute-difference-between-elements-with-constraint",0,[6,14,113],[["/practice/#minimum-absolute-difference-between-elements-with-constraint","Solution"]]],[2818,"Apply Operations to Maximize Score","apply-operations-to-maximize-score",0,[154,68,6,95,112,150,108],[["/practice/#apply-operations-to-maximize-score","Solution"]]],[2819,"Minimum Relative Loss After Buying Chocolates","minimum-relative-loss-after-buying-chocolates",0,[6,14,122,150],[["/practice/#minimum-relative-loss-after-buying-chocolates","Solution"]]],[2820,"Election Results","election-results",1,[40],[["/practice/#election-results","Solution"]]],[2821,"Delay the Resolution of Each Promise","delay-the-resolution-of-each-promise",2,[79],[["/practice/#delay-the-resolution-of-each-promise","Solution"]]],[2822,"Inversion of Object","inversion-of-object",2,[79],[["/practice/#inversion-of-object","Solution"]]],[2823,"Deep Object Filter","deep-object-filter",2,[79],[["/practice/#deep-object-filter","Solution"]]],[2824,"Count Pairs Whose Sum is Less than Target","count-pairs-whose-sum-is-less-than-target",0,[6,172,14,150],[["/practice/#count-pairs-whose-sum-is-less-than-target","Solution"]]],[2825,"Make String a Subsequence Using Cyclic Increments","make-string-a-subsequence-using-cyclic-increments",0,[172,155],[["/practice/#make-string-a-subsequence-using-cyclic-increments","Solution"]]],[2826,"Sorting Three Groups","sorting-three-groups",0,[6,14,48],[["/practice/#sorting-three-groups","Solution"]]],[2827,"Number of Beautiful Integers in the Range","number-of-beautiful-integers-in-the-range",0,[95,48],[["/practice/#number-of-beautiful-integers-in-the-range","Solution"]]],[2828,"Check if a String Is an Acronym of Words","check-if-a-string-is-an-acronym-of-words",0,[6,155],[["/practice/#check-if-a-string-is-an-acronym-of-words","Solution"]]],[2829,"Determine the Minimum Sum of a k-avoiding Array","determine-the-minimum-sum-of-a-k-avoiding-array",0,[68,95],[["/practice/#determine-the-minimum-sum-of-a-k-avoiding-array","Solution"]]],[2830,"Maximize the Profit as the Salesman","maximize-the-profit-as-the-salesman",0,[6,71,14,48,150],[["/practice/#maximize-the-profit-as-the-salesman","Solution"]]],[2831,"Find the Longest Equal Subarray","find-the-longest-equal-subarray",0,[6,71,14,146],[["/practice/#find-the-longest-equal-subarray","Solution"]]],[2832,"Maximal Range That Each Element Is Maximum in It","maximal-range-that-each-element-is-maximum-in-it",0,[154,6,108],[["/practice/#maximal-range-that-each-element-is-maximum-in-it","Solution"]]],[2833,"Furthest Point From Origin","furthest-point-from-origin",0,[155,36],[["/practice/#furthest-point-from-origin","Solution"]]],[2834,"Find the Minimum Possible Sum of a Beautiful Array","find-the-minimum-possible-sum-of-a-beautiful-array",0,[68,95],[["/practice/#find-the-minimum-possible-sum-of-a-beautiful-array","Solution"]]],[2835,"Minimum Operations to Form Subsequence With Target Sum","minimum-operations-to-form-subsequence-with-target-sum",0,[68,18,6],[["/practice/#minimum-operations-to-form-subsequence-with-target-sum","Solution"]]],[2836,"Maximize Value of Function in a Ball Passing Game","maximize-value-of-function-in-a-ball-passing-game",0,[18,6,48],[["/practice/#maximize-value-of-function-in-a-ball-passing-game","Solution"]]],[2837,"Total Traveled Distance","total-traveled-distance",1,[40],[["/practice/#total-traveled-distance","Solution"]]],[2838,"Maximum Coins Heroes Can Collect","maximum-coins-heroes-can-collect",0,[6,172,14,122,150],[["/practice/#maximum-coins-heroes-can-collect","Solution"]]],[2839,"Check if Strings Can be Made Equal With Operations I","check-if-strings-can-be-made-equal-with-operations-i",0,[155],[["/practice/#check-if-strings-can-be-made-equal-with-operations-i","Solution"]]],[2840,"Check if Strings Can be Made Equal With Operations II","check-if-strings-can-be-made-equal-with-operations-ii",0,[71,155,150],[["/practice/#check-if-strings-can-be-made-equal-with-operations-ii","Solution"]]],[2841,"Maximum Sum of Almost Unique Subarray","maximum-sum-of-almost-unique-subarray",0,[6,71,146],[["/practice/#maximum-sum-of-almost-unique-subarray","Solution"]]],[2842,"Count K-Subsequences of a String With Maximum Beauty","count-k-subsequences-of-a-string-with-maximum-beauty",0,[68,71,95,155,33,150,59],[["/practice/#count-k-subsequences-of-a-string-with-maximum-beauty","Solution"]]],[2843,"  Count Symmetric Integers","count-symmetric-integers",0,[95,50],[["/practice/#count-symmetric-integers","Solution"]]],[2844,"Minimum Operations to Make a Special Number","minimum-operations-to-make-a-special-number",0,[68,95,155,50],[["/practice/#minimum-operations-to-make-a-special-number","Solution"]]],[2845,"Count of Interesting Subarrays","count-of-interesting-subarrays",0,[6,71,122],[["/practice/#count-of-interesting-subarrays","Solution"]]],[2846,"Minimum Edge Weight Equilibrium Queries in a Tree","minimum-edge-weight-equilibrium-queries-in-a-tree",0,[18,168,41,6,48],[["/practice/#minimum-edge-weight-equilibrium-queries-in-a-tree","Solution"]]],[2847,"Smallest Number With Given Digit Product","smallest-number-with-given-digit-product",0,[68,95],[["/practice/#smallest-number-with-given-digit-product","Solution"]]],[2848,"Points That Intersect With Cars","points-that-intersect-with-cars",0,[6,71,122],[["/practice/#points-that-intersect-with-cars","Solution"]]],[2849,"Determine if a Cell Is Reachable at a Given Time","determine-if-a-cell-is-reachable-at-a-given-time",0,[95],[["/practice/#determine-if-a-cell-is-reachable-at-a-given-time","Solution"]]],[2850,"Minimum Moves to Spread Stones Over Grid","minimum-moves-to-spread-stones-over-grid",0,[18,6,48,8,19,96],[["/practice/#minimum-moves-to-spread-stones-over-grid","Solution"]]],[2851,"String Transformation","string-transformation",0,[95,155,48,156],[["/practice/#string-transformation","Solution"]]],[2852,"Sum of Remoteness of All Cells","sum-of-remoteness-of-all-cells",0,[41,25,174,6,71,96],[["/practice/#sum-of-remoteness-of-all-cells","Solution"]]],[2853,"Highest Salaries Difference","highest-salaries-difference",1,[40],[["/practice/#highest-salaries-difference","Solution"]]],[2854,"Rolling Average Steps","rolling-average-steps",1,[40],[["/practice/#rolling-average-steps","Solution"]]],[2855,"Minimum Right Shifts to Sort the Array","minimum-right-shifts-to-sort-the-array",0,[6],[["/practice/#minimum-right-shifts-to-sort-the-array","Solution"]]],[2856,"Minimum Array Length After Pair Removals","minimum-array-length-after-pair-removals",0,[68,6,71,172,14,36],[["/practice/#minimum-array-length-after-pair-removals","Solution"]]],[2857,"Count Pairs of Points With Distance k","count-pairs-of-points-with-distance-k",0,[18,6,71],[["/practice/#count-pairs-of-points-with-distance-k","Solution"]]],[2858,"Minimum Edge Reversals So Every Node Is Reachable","minimum-edge-reversals-so-every-node-is-reachable",0,[41,25,64,48],[["/practice/#minimum-edge-reversals-so-every-node-is-reachable","Solution"]]],[2859,"Sum of Values at Indices With K Set Bits","sum-of-values-at-indices-with-k-set-bits",0,[18,6],[["/practice/#sum-of-values-at-indices-with-k-set-bits","Solution"]]],[2860,"Happy Students","happy-students",0,[6,50,150],[["/practice/#happy-students","Solution"]]],[2861,"Maximum Number of Alloys","maximum-number-of-alloys",0,[6,14],[["/practice/#maximum-number-of-alloys","Solution"]]],[2862,"Maximum Element-Sum of a Complete Subset of Indices","maximum-element-sum-of-a-complete-subset-of-indices",0,[6,95,112],[["/practice/#maximum-element-sum-of-a-complete-subset-of-indices","Solution"]]],[2863,"Maximum Length of Semi-Decreasing Subarrays","maximum-length-of-semi-decreasing-subarrays",0,[154,6,150,108],[["/practice/#maximum-length-of-semi-decreasing-subarrays","Solution"]]],[2864,"Maximum Odd Binary Number","maximum-odd-binary-number",0,[68,95,155],[["/practice/#maximum-odd-binary-number","Solution"]]],[2865,"Beautiful Towers I","beautiful-towers-i",0,[154,6,108],[["/practice/#beautiful-towers-i","Solution"]]],[2866,"Beautiful Towers II","beautiful-towers-ii",0,[154,6,108],[["/practice/#beautiful-towers-ii","Solution"]]],[2867,"Count Valid Paths in a Tree","count-valid-paths-in-a-tree",0,[168,41,95,48,112,124,143,144],[["/practice/#count-valid-paths-in-a-tree","Solution"]]],[2868,"The Wording Game","the-wording-game",0,[68,6,95,172,155,62],[["/practice/#the-wording-game","Solution"]]],[2869,"Minimum Operations to Collect Elements","minimum-operations-to-collect-elements",0,[18,6,71],[["/practice/#minimum-operations-to-collect-elements","Solution"]]],[2870,"Minimum Number of Operations to Make Array Empty","minimum-number-of-operations-to-make-array-empty",0,[68,6,71,36],[["/practice/#minimum-number-of-operations-to-make-array-empty","Solution"]]],[2871,"Split Array Into Maximum Number of Subarrays","split-array-into-maximum-number-of-subarrays",0,[68,18,6],[["/practice/#split-array-into-maximum-number-of-subarrays","Solution"]]],[2872,"Maximum Number of K-Divisible Components","maximum-number-of-k-divisible-components",0,[168,41],[["/practice/#maximum-number-of-k-divisible-components","Solution"]]],[2873,"Maximum Value of an Ordered Triplet I","maximum-value-of-an-ordered-triplet-i",0,[6],[["/practice/#maximum-value-of-an-ordered-triplet-i","Solution"]]],[2874,"Maximum Value of an Ordered Triplet II","maximum-value-of-an-ordered-triplet-ii",0,[6],[["/practice/#maximum-value-of-an-ordered-triplet-ii","Solution"]]],[2875,"Minimum Size Subarray in Infinite Array","minimum-size-subarray-in-infinite-array",0,[6,71,122,146],[["/practice/#minimum-size-subarray-in-infinite-array","Solution"]]],[2876,"Count Visited Nodes in a Directed Graph","count-visited-nodes-in-a-directed-graph",0,[41,64,165,100,48,83,162],[["/practice/#count-visited-nodes-in-a-directed-graph","Solution"]]],[2877,"Create a DataFrame from List","create-a-dataframe-from-list",3,[115],[["/practice/#create-a-dataframe-from-list","Solution"]]],[2878,"Get the Size of a DataFrame","get-the-size-of-a-dataframe",3,[115],[["/practice/#get-the-size-of-a-dataframe","Solution"]]],[2879,"Display the First Three Rows","display-the-first-three-rows",3,[115],[["/practice/#display-the-first-three-rows","Solution"]]],[2880,"Select Data","select-data",3,[115],[["/practice/#select-data","Solution"]]],[2881,"Create a New Column","create-a-new-column",3,[115],[["/practice/#create-a-new-column","Solution"]]],[2882,"Drop Duplicate Rows","drop-duplicate-rows",3,[115],[["/practice/#drop-duplicate-rows","Solution"]]],[2883,"Drop Missing Data","drop-missing-data",3,[115],[["/practice/#drop-missing-data","Solution"]]],[2884,"Modify Columns","modify-columns",3,[115],[["/practice/#modify-columns","Solution"]]],[2885,"Rename Columns","rename-columns",3,[115],[["/practice/#rename-columns","Solution"]]],[2886,"Change Data Type","change-data-type",3,[115],[["/practice/#change-data-type","Solution"]]],[2887,"Fill Missing Data","fill-missing-data",3,[115],[["/practice/#fill-missing-data","Solution"]]],[2888,"Reshape Data: Concatenate","reshape-data-concatenate",3,[115],[["/practice/#reshape-data-concatenate","Solution"]]],[2889,"Reshape Data: Pivot","reshape-data-pivot",3,[115],[["/practice/#reshape-data-pivot","Solution"]]],[2890,"Reshape Data: Melt","reshape-data-melt",3,[115],[["/practice/#reshape-data-melt","Solution"]]],[2891,"Method Chaining","method-chaining",3,[115],[["/practice/#method-chaining","Solution"]]],[2892,"Minimizing Array After Replacing Pairs With Their Product","minimizing-array-after-replacing-pairs-with-their-product",0,[68,6,48],[["/practice/#minimizing-array-after-replacing-pairs-with-their-product","Solution"]]],[2893,"Calculate Orders Within Each Interval","calculate-orders-within-each-interval",1,[40],[["/practice/#calculate-orders-within-each-interval","Solution"]]],[2894,"Divisible and Non-divisible Sums Difference","divisible-and-non-divisible-sums-difference",0,[95],[["/practice/#divisible-and-non-divisible-sums-difference","Solution"]]],[2895,"Minimum Processing Time","minimum-processing-time",0,[68,6,150],[["/practice/#minimum-processing-time","Solution"]]],[2896,"Apply Operations to Make Two Strings Equal","apply-operations-to-make-two-strings-equal",0,[155,48],[["/practice/#apply-operations-to-make-two-strings-equal","Solution"]]],[2897,"Apply Operations on Array to Maximize Sum of Squares","apply-operations-on-array-to-maximize-sum-of-squares",0,[68,18,6,71],[["/practice/#apply-operations-on-array-to-maximize-sum-of-squares","Solution"]]],[2898,"Maximum Linear Stock Score","maximum-linear-stock-score",0,[6,71],[["/practice/#maximum-linear-stock-score","Solution"]]],[2899,"Last Visited Integers","last-visited-integers",0,[6,145],[["/practice/#last-visited-integers","Solution"]]],[2900,"Longest Unequal Adjacent Groups Subsequence I","longest-unequal-adjacent-groups-subsequence-i",0,[68,6,155,48],[["/practice/#longest-unequal-adjacent-groups-subsequence-i","Solution"]]],[2901,"Longest Unequal Adjacent Groups Subsequence II","longest-unequal-adjacent-groups-subsequence-ii",0,[6,155,48],[["/practice/#longest-unequal-adjacent-groups-subsequence-ii","Solution"]]],[2902,"Count of Sub-Multisets With Bounded Sum","count-of-sub-multisets-with-bounded-sum",0,[6,71,48,82,146,21],[["/practice/#count-of-sub-multisets-with-bounded-sum","Solution"]]],[2903,"Find Indices With Index and Value Difference I","find-indices-with-index-and-value-difference-i",0,[6,172],[["/practice/#find-indices-with-index-and-value-difference-i","Solution"]]],[2904,"Shortest and Lexicographically Smallest Beautiful String","shortest-and-lexicographically-smallest-beautiful-string",0,[155,146],[["/practice/#shortest-and-lexicographically-smallest-beautiful-string","Solution"]]],[2905,"Find Indices With Index and Value Difference II","find-indices-with-index-and-value-difference-ii",0,[6,172],[["/practice/#find-indices-with-index-and-value-difference-ii","Solution"]]],[2906,"Construct Product Matrix","construct-product-matrix",0,[6,96,122],[["/practice/#construct-product-matrix","Solution"]]],[2907,"Maximum Profitable Triplets With Increasing Prices I","maximum-profitable-triplets-with-increasing-prices-i",0,[12,139,6],[["/practice/#maximum-profitable-triplets-with-increasing-prices-i","Solution"]]],[2908,"Minimum Sum of Mountain Triplets I","minimum-sum-of-mountain-triplets-i",0,[6],[["/practice/#minimum-sum-of-mountain-triplets-i","Solution"]]],[2909,"Minimum Sum of Mountain Triplets II","minimum-sum-of-mountain-triplets-ii",0,[6,122],[["/practice/#minimum-sum-of-mountain-triplets-ii","Solution"]]],[2910,"Minimum Number of Groups to Create a Valid Assignment","minimum-number-of-groups-to-create-a-valid-assignment",0,[68,6,71],[["/practice/#minimum-number-of-groups-to-create-a-valid-assignment","Solution"]]],[2911,"Minimum Changes to Make K Semi-palindromes","minimum-changes-to-make-k-semi-palindromes",0,[172,155,48],[["/practice/#minimum-changes-to-make-k-semi-palindromes","Solution"]]],[2912,"Number of Ways to Reach Destination in the Grid","number-of-ways-to-reach-destination-in-the-grid",0,[95,48,33],[["/practice/#number-of-ways-to-reach-destination-in-the-grid","Solution"]]],[2913,"Subarrays Distinct Element Sum of Squares I","subarrays-distinct-element-sum-of-squares-i",0,[139,6,71],[["/practice/#subarrays-distinct-element-sum-of-squares-i","Solution"]]],[2914,"Minimum Number of Changes to Make Binary String Beautiful","minimum-number-of-changes-to-make-binary-string-beautiful",0,[155],[["/practice/#minimum-number-of-changes-to-make-binary-string-beautiful","Solution"]]],[2915,"Length of the Longest Subsequence That Sums to Target","length-of-the-longest-subsequence-that-sums-to-target",0,[6,48,82,2],[["/practice/#length-of-the-longest-subsequence-that-sums-to-target","Solution"]]],[2916,"Subarrays Distinct Element Sum of Squares II","subarrays-distinct-element-sum-of-squares-ii",0,[12,139,6,71],[["/practice/#subarrays-distinct-element-sum-of-squares-ii","Solution"]]],[2917,"Find the K-or of an Array","find-the-k-or-of-an-array",0,[18,6],[["/practice/#find-the-k-or-of-an-array","Solution"]]],[2918,"Minimum Equal Sum of Two Arrays After Replacing Zeros","minimum-equal-sum-of-two-arrays-after-replacing-zeros",0,[68,6],[["/practice/#minimum-equal-sum-of-two-arrays-after-replacing-zeros","Solution"]]],[2919,"Minimum Increment Operations to Make Array Beautiful","minimum-increment-operations-to-make-array-beautiful",0,[6,48],[["/practice/#minimum-increment-operations-to-make-array-beautiful","Solution"]]],[2920,"Maximum Points After Collecting Coins From All Nodes","maximum-points-after-collecting-coins-from-all-nodes",0,[18,168,41,100,6,48,169],[["/practice/#maximum-points-after-collecting-coins-from-all-nodes","Solution"]]],[2921,"Maximum Profitable Triplets With Increasing Prices II","maximum-profitable-triplets-with-increasing-prices-ii",0,[12,139,6],[["/practice/#maximum-profitable-triplets-with-increasing-prices-ii","Solution"]]],[2922,"Market Analysis III","market-analysis-iii",1,[40],[["/practice/#market-analysis-iii","Solution"]]],[2923,"Find Champion I","find-champion-i",0,[6,96],[["/practice/#find-champion-i","Solution"]]],[2924,"Find Champion II","find-champion-ii",0,[64],[["/practice/#find-champion-ii","Solution"]]],[2925,"Maximum Score After Applying Operations on a Tree","maximum-score-after-applying-operations-on-a-tree",0,[168,41,48,169],[["/practice/#maximum-score-after-applying-operations-on-a-tree","Solution"]]],[2926,"Maximum Balanced Subsequence Sum","maximum-balanced-subsequence-sum",0,[12,139,6,14,48],[["/practice/#maximum-balanced-subsequence-sum","Solution"]]],[2927,"Distribute Candies Among Children III","distribute-candies-among-children-iii",0,[95,33],[["/practice/#distribute-candies-among-children-iii","Solution"]]],[2928,"Distribute Candies Among Children I","distribute-candies-among-children-i",0,[95,33,50],[["/practice/#distribute-candies-among-children-i","Solution"]]],[2929,"Distribute Candies Among Children II","distribute-candies-among-children-ii",0,[95,33,50],[["/practice/#distribute-candies-among-children-ii","Solution"]]],[2930,"Number of Strings Which Can Be Rearranged to Contain Substring","number-of-strings-which-can-be-rearranged-to-contain-substring",0,[95,48,33],[["/practice/#number-of-strings-which-can-be-rearranged-to-contain-substring","Solution"]]],[2931,"Maximum Spending After Buying Items","maximum-spending-after-buying-items",0,[68,6,96,150,72],[["/practice/#maximum-spending-after-buying-items","Solution"]]],[2932,"Maximum Strong Pair XOR I","maximum-strong-pair-xor-i",0,[18,171,6,71,146],[["/practice/#maximum-strong-pair-xor-i","Solution"]]],[2933,"High-Access Employees","high-access-employees",0,[6,71,155,150],[["/practice/#high-access-employees","Solution"]]],[2934,"Minimum Operations to Maximize Last Elements in Arrays","minimum-operations-to-maximize-last-elements-in-arrays",0,[6,50],[["/practice/#minimum-operations-to-maximize-last-elements-in-arrays","Solution"]]],[2935,"Maximum Strong Pair XOR II","maximum-strong-pair-xor-ii",0,[18,171,6,71,146],[["/practice/#maximum-strong-pair-xor-ii","Solution"]]],[2936,"Number of Equal Numbers Blocks","number-of-equal-numbers-blocks",0,[6,14,77],[["/practice/#number-of-equal-numbers-blocks","Solution"]]],[2937,"Make Three Strings Equal","make-three-strings-equal",0,[155],[["/practice/#make-three-strings-equal","Solution"]]],[2938,"Separate Black and White Balls","separate-black-and-white-balls",0,[68,172,155],[["/practice/#separate-black-and-white-balls","Solution"]]],[2939,"Maximum Xor Product","maximum-xor-product",0,[68,18,95],[["/practice/#maximum-xor-product","Solution"]]],[2940,"Find Building Where Alice and Bob Can Meet","find-building-where-alice-and-bob-can-meet",0,[154,12,139,6,14,108,72],[["/practice/#find-building-where-alice-and-bob-can-meet","Solution"]]],[2941,"Maximum GCD-Sum of a Subarray","maximum-gcd-sum-of-a-subarray",0,[6,95,14,67,112,51],[["/practice/#maximum-gcd-sum-of-a-subarray","Solution"]]],[2942,"Find Words Containing Character","find-words-containing-character",0,[6,155],[["/practice/#find-words-containing-character","Solution"]]],[2943,"Maximize Area of Square Hole in Grid","maximize-area-of-square-hole-in-grid",0,[6,150],[["/practice/#maximize-area-of-square-hole-in-grid","Solution"]]],[2944,"Minimum Number of Coins for Fruits","minimum-number-of-coins-for-fruits",0,[128,6,48,107,72],[["/practice/#minimum-number-of-coins-for-fruits","Solution"]]],[2945,"Find Maximum Non-decreasing Array Length","find-maximum-non-decreasing-array-length",0,[154,128,6,14,48,122,107,108],[["/practice/#find-maximum-non-decreasing-array-length","Solution"]]],[2946,"Matrix Similarity After Cyclic Shifts","matrix-similarity-after-cyclic-shifts",0,[6,95,96,145],[["/practice/#matrix-similarity-after-cyclic-shifts","Solution"]]],[2947,"Count Beautiful Substrings I","count-beautiful-substrings-i",0,[71,95,155,50,112,122],[["/practice/#count-beautiful-substrings-i","Solution"]]],[2948,"Make Lexicographically Smallest Array by Swapping Elements","make-lexicographically-smallest-array-by-swapping-elements",0,[174,6,150],[["/practice/#make-lexicographically-smallest-array-by-swapping-elements","Solution"]]],[2949,"Count Beautiful Substrings II","count-beautiful-substrings-ii",2,[71,95,155,112,122],[["/practice/#count-beautiful-substrings-ii","Solution"]]],[2950,"Number of Divisible Substrings","number-of-divisible-substrings",0,[71,155,36,122],[["/practice/#number-of-divisible-substrings","Solution"]]],[2951,"Find the Peaks","find-the-peaks",0,[6,50],[["/practice/#find-the-peaks","Solution"]]],[2952,"Minimum Number of Coins to be Added","minimum-number-of-coins-to-be-added",0,[68,6,150],[["/practice/#minimum-number-of-coins-to-be-added","Solution"]]],[2953,"Count Complete Substrings","count-complete-substrings",0,[71,155,146],[["/practice/#count-complete-substrings","Solution"]]],[2954,"Count the Number of Infection Sequences","count-the-number-of-infection-sequences",0,[6,95,33,59],[["/practice/#count-the-number-of-infection-sequences","Solution"]]],[2955,"Number of Same-End Substrings","number-of-same-end-substrings",0,[6,71,155,36,122],[["/practice/#number-of-same-end-substrings","Solution"]]],[2956,"Find Common Elements Between Two Arrays","find-common-elements-between-two-arrays",0,[6,71],[["/practice/#find-common-elements-between-two-arrays","Solution"]]],[2957,"Remove Adjacent Almost-Equal Characters","remove-adjacent-almost-equal-characters",0,[68,155,48],[["/practice/#remove-adjacent-almost-equal-characters","Solution"]]],[2958,"Length of Longest Subarray With at Most K Frequency","length-of-longest-subarray-with-at-most-k-frequency",0,[6,71,146],[["/practice/#length-of-longest-subarray-with-at-most-k-frequency","Solution"]]],[2959,"Number of Possible Sets of Closing Branches","number-of-possible-sets-of-closing-branches",0,[18,64,50,142,72],[["/practice/#number-of-possible-sets-of-closing-branches","Solution"]]],[2960,"Count Tested Devices After Test Operations","count-tested-devices-after-test-operations",0,[6,36,145],[["/practice/#count-tested-devices-after-test-operations","Solution"]]],[2961,"Double Modular Exponentiation","double-modular-exponentiation",0,[6,95,145],[["/practice/#double-modular-exponentiation","Solution"]]],[2962,"Count Subarrays Where Max Element Appears at Least K Times","count-subarrays-where-max-element-appears-at-least-k-times",0,[6,146],[["/practice/#count-subarrays-where-max-element-appears-at-least-k-times","Solution"]]],[2963,"Count the Number of Good Partitions","count-the-number-of-good-partitions",0,[6,71,95,33],[["/practice/#count-the-number-of-good-partitions","Solution"]]],[2964,"Number of Divisible Triplet Sums","number-of-divisible-triplet-sums",0,[6,71],[["/practice/#number-of-divisible-triplet-sums","Solution"]]],[2965,"Find Missing and Repeated Values","find-missing-and-repeated-values",0,[6,71,95,96],[["/practice/#find-missing-and-repeated-values","Solution"]]],[2966,"Divide Array Into Arrays With Max Difference","divide-array-into-arrays-with-max-difference",0,[68,6,150],[["/practice/#divide-array-into-arrays-with-max-difference","Solution"]]],[2967,"Minimum Cost to Make Array Equalindromic","minimum-cost-to-make-array-equalindromic",0,[68,6,95,14,150],[["/practice/#minimum-cost-to-make-array-equalindromic","Solution"]]],[2968,"Apply Operations to Maximize Frequency Score","apply-operations-to-maximize-frequency-score",0,[6,14,122,150,146],[["/practice/#apply-operations-to-maximize-frequency-score","Solution"]]],[2969,"Minimum Number of Coins for Fruits II","minimum-number-of-coins-for-fruits-ii",0,[128,6,48,107,72],[["/practice/#minimum-number-of-coins-for-fruits-ii","Solution"]]],[2970,"Count the Number of Incremovable Subarrays I","count-the-number-of-incremovable-subarrays-i",0,[6,172,14,50],[["/practice/#count-the-number-of-incremovable-subarrays-i","Solution"]]],[2971,"Find Polygon With the Largest Perimeter","find-polygon-with-the-largest-perimeter",0,[68,6,121,122,150],[["/practice/#find-polygon-with-the-largest-perimeter","Solution"]]],[2972,"Count the Number of Incremovable Subarrays II","count-the-number-of-incremovable-subarrays-ii",0,[6,172,14],[["/practice/#count-the-number-of-incremovable-subarrays-ii","Solution"]]],[2973,"Find Number of Coins to Place in Tree Nodes","find-number-of-coins-to-place-in-tree-nodes",0,[168,41,48,150,169,72],[["/practice/#find-number-of-coins-to-place-in-tree-nodes","Solution"]]],[2974,"Minimum Number Game","minimum-number-game",0,[6,150,145,72],[["/practice/#minimum-number-game","Solution"]]],[2975,"Maximum Square Area by Removing Fences From a Field","maximum-square-area-by-removing-fences-from-a-field",0,[6,71,50],[["/practice/#maximum-square-area-by-removing-fences-from-a-field","Solution"]]],[2976,"Minimum Cost to Convert String I","minimum-cost-to-convert-string-i",0,[64,6,155,142],[["/practice/#minimum-cost-to-convert-string-i","Solution"]]],[2977,"Minimum Cost to Convert String II","minimum-cost-to-convert-string-ii",0,[64,171,6,155,48,142],[["/practice/#minimum-cost-to-convert-string-ii","Solution"]]],[2978,"Symmetric Coordinates","symmetric-coordinates",1,[40],[["/practice/#symmetric-coordinates","Solution"]]],[2979,"Most Expensive Item That Can Not Be Bought","most-expensive-item-that-can-not-be-bought",0,[95,48,112],[["/practice/#most-expensive-item-that-can-not-be-bought","Solution"]]],[2980,"Check if Bitwise OR Has Trailing Zeros","check-if-bitwise-or-has-trailing-zeros",0,[18,6],[["/practice/#check-if-bitwise-or-has-trailing-zeros","Solution"]]],[2981,"Find Longest Special Substring That Occurs Thrice I","find-longest-special-substring-that-occurs-thrice-i",0,[71,155,14,36,146],[["/practice/#find-longest-special-substring-that-occurs-thrice-i","Solution"]]],[2982,"Find Longest Special Substring That Occurs Thrice II","find-longest-special-substring-that-occurs-thrice-ii",0,[71,155,14,36,146],[["/practice/#find-longest-special-substring-that-occurs-thrice-ii","Solution"]]],[2983,"Palindrome Rearrangement Queries","palindrome-rearrangement-queries",0,[6,71,155,122],[["/practice/#palindrome-rearrangement-queries","Solution"]]],[2984,"Find Peak Calling Hours for Each City","find-peak-calling-hours-for-each-city",1,[40],[["/practice/#find-peak-calling-hours-for-each-city","Solution"]]],[2985,"Calculate Compressed Mean","calculate-compressed-mean",1,[40],[["/practice/#calculate-compressed-mean","Solution"]]],[2986,"Find Third Transaction","find-third-transaction",1,[40],[["/practice/#find-third-transaction","Solution"]]],[2987,"Find Expensive Cities","find-expensive-cities",1,[40],[["/practice/#find-expensive-cities","Solution"]]],[2988,"Manager of the Largest Department","manager-of-the-largest-department",1,[40],[["/practice/#manager-of-the-largest-department","Solution"]]],[2989,"Class Performance","class-performance",1,[40],[["/practice/#class-performance","Solution"]]],[2990,"Loan Types","loan-types",1,[40],[["/practice/#loan-types","Solution"]]],[2991,"Top Three Wineries ","top-three-wineries",1,[40],[["/practice/#top-three-wineries","Solution"]]],[2992,"Number of Self-Divisible Permutations","number-of-self-divisible-permutations",0,[18,6,95,48,8,19,112],[["/practice/#number-of-self-divisible-permutations","Solution"]]],[2993,"Friday Purchases I","friday-purchases-i",1,[40],[["/practice/#friday-purchases-i","Solution"]]],[2994,"Friday Purchases II ","friday-purchases-ii",1,[40],[["/practice/#friday-purchases-ii","Solution"]]],[2995,"Viewers Turned Streamers","viewers-turned-streamers",1,[40],[["/practice/#viewers-turned-streamers","Solution"]]],[2996,"Smallest Missing Integer Greater Than Sequential Prefix Sum","smallest-missing-integer-greater-than-sequential-prefix-sum",0,[6,71,150],[["/practice/#smallest-missing-integer-greater-than-sequential-prefix-sum","Solution"]]],[2997,"Minimum Number of Operations to Make Array XOR Equal to K","minimum-number-of-operations-to-make-array-xor-equal-to-k",0,[18,6],[["/practice/#minimum-number-of-operations-to-make-array-xor-equal-to-k","Solution"]]],[2998,"Minimum Number of Operations to Make X and Y Equal","minimum-number-of-operations-to-make-x-and-y-equal",0,[25,100,48],[["/practice/#minimum-number-of-operations-to-make-x-and-y-equal","Solution"]]],[2999,"Count the Number of Powerful Integers","count-the-number-of-powerful-integers",0,[95,155,48],[["/practice/#count-the-number-of-powerful-integers","Solution"]]],[3000,"Maximum Area of Longest Diagonal Rectangle","maximum-area-of-longest-diagonal-rectangle",0,[6],[["/practice/#maximum-area-of-longest-diagonal-rectangle","Solution"]]],[3001,"Minimum Moves to Capture The Queen","minimum-moves-to-capture-the-queen",0,[95,50],[["/practice/#minimum-moves-to-capture-the-queen","Solution"]]],[3002,"Maximum Size of a Set After Removals","maximum-size-of-a-set-after-removals",0,[68,6,71],[["/practice/#maximum-size-of-a-set-after-removals","Solution"]]],[3003,"Maximize the Number of Partitions After Operations","maximize-the-number-of-partitions-after-operations",0,[18,155,48,19],[["/practice/#maximize-the-number-of-partitions-after-operations","Solution"]]],[3004,"Maximum Subtree of the Same Color","maximum-subtree-of-the-same-color",0,[168,41,6,48],[["/practice/#maximum-subtree-of-the-same-color","Solution"]]],[3005,"Count Elements With Maximum Frequency","count-elements-with-maximum-frequency",0,[6,71,36],[["/practice/#count-elements-with-maximum-frequency","Solution"]]],[3006,"Find Beautiful Indices in the Given Array I","find-beautiful-indices-in-the-given-array-i",0,[172,155,14,156,70,137,81,23,58],[["/practice/#find-beautiful-indices-in-the-given-array-i","Solution"]]],[3007,"Maximum Number That Sum of the Prices Is Less Than or Equal to K","maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k",0,[18,95,14,48],[["/practice/#maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k","Solution"]]],[3008,"Find Beautiful Indices in the Given Array II","find-beautiful-indices-in-the-given-array-ii",0,[172,155,14,156,70,137,81,23,58],[["/practice/#find-beautiful-indices-in-the-given-array-ii","Solution"]]],[3009,"Maximum Number of Intersections on the Chart","maximum-number-of-intersections-on-the-chart",0,[12,63,6,71,95,150,161],[["/practice/#maximum-number-of-intersections-on-the-chart","Solution"]]],[3010,"Divide an Array Into Subarrays With Minimum Cost I","divide-an-array-into-subarrays-with-minimum-cost-i",0,[6,50,150],[["/practice/#divide-an-array-into-subarrays-with-minimum-cost-i","Solution"]]],[3011,"Find if Array Can Be Sorted","find-if-array-can-be-sorted",0,[18,6,150],[["/practice/#find-if-array-can-be-sorted","Solution"]]],[3012,"Minimize Length of Array Using Operations","minimize-length-of-array-using-operations",0,[68,6,95,112],[["/practice/#minimize-length-of-array-using-operations","Solution"]]],[3013,"Divide an Array Into Subarrays With Minimum Cost II","divide-an-array-into-subarrays-with-minimum-cost-ii",0,[6,71,146,72],[["/practice/#divide-an-array-into-subarrays-with-minimum-cost-ii","Solution"]]],[3014,"Minimum Number of Pushes to Type Word I","minimum-number-of-pushes-to-type-word-i",0,[68,95,155],[["/practice/#minimum-number-of-pushes-to-type-word-i","Solution"]]],[3015,"Count the Number of Houses at a Certain Distance I","count-the-number-of-houses-at-a-certain-distance-i",0,[25,64,122],[["/practice/#count-the-number-of-houses-at-a-certain-distance-i","Solution"]]],[3016,"Minimum Number of Pushes to Type Word II","minimum-number-of-pushes-to-type-word-ii",0,[68,71,155,36,150],[["/practice/#minimum-number-of-pushes-to-type-word-ii","Solution"]]],[3017,"Count the Number of Houses at a Certain Distance II","count-the-number-of-houses-at-a-certain-distance-ii",0,[64,122],[["/practice/#count-the-number-of-houses-at-a-certain-distance-ii","Solution"]]],[3018,"Maximum Number of Removal Queries That Can Be Processed I","maximum-number-of-removal-queries-that-can-be-processed-i",0,[6,48],[["/practice/#maximum-number-of-removal-queries-that-can-be-processed-i","Solution"]]],[3019,"Number of Changing Keys","number-of-changing-keys",0,[155],[["/practice/#number-of-changing-keys","Solution"]]],[3020,"Find the Maximum Number of Elements in Subset","find-the-maximum-number-of-elements-in-subset",0,[6,71,50],[["/practice/#find-the-maximum-number-of-elements-in-subset","Solution"]]],[3021,"Alice and Bob Playing Flower Game","alice-and-bob-playing-flower-game",0,[95],[["/practice/#alice-and-bob-playing-flower-game","Solution"]]],[3022,"Minimize OR of Remaining Elements Using Operations","minimize-or-of-remaining-elements-using-operations",0,[68,18,6],[["/practice/#minimize-or-of-remaining-elements-using-operations","Solution"]]],[3023,"Find Pattern in Infinite Stream I","find-pattern-in-infinite-stream-i",0,[6,77,156,146,70,137],[["/practice/#find-pattern-in-infinite-stream-i","Solution"]]],[3024,"Type of Triangle","type-of-triangle",0,[6,95,121,150],[["/practice/#type-of-triangle","Solution"]]],[3025,"Find the Number of Ways to Place People I","find-the-number-of-ways-to-place-people-i",0,[63,6,95,50,150],[["/practice/#find-the-number-of-ways-to-place-people-i","Solution"]]],[3026,"Maximum Good Subarray Sum","maximum-good-subarray-sum",0,[6,71,122],[["/practice/#maximum-good-subarray-sum","Solution"]]],[3027,"Find the Number of Ways to Place People II","find-the-number-of-ways-to-place-people-ii",0,[63,6,95,50,150],[["/practice/#find-the-number-of-ways-to-place-people-ii","Solution"]]],[3028,"Ant on the Boundary","ant-on-the-boundary",0,[6,122,145],[["/practice/#ant-on-the-boundary","Solution"]]],[3029,"Minimum Time to Revert Word to Initial State I","minimum-time-to-revert-word-to-initial-state-i",0,[155,156,70,137],[["/practice/#minimum-time-to-revert-word-to-initial-state-i","Solution"]]],[3030,"Find the Grid of Region Average","find-the-grid-of-region-average",0,[6,96],[["/practice/#find-the-grid-of-region-average","Solution"]]],[3031,"Minimum Time to Revert Word to Initial State II","minimum-time-to-revert-word-to-initial-state-ii",0,[155,156,70,137],[["/practice/#minimum-time-to-revert-word-to-initial-state-ii","Solution"]]],[3032,"Count Numbers With Unique Digits II","count-numbers-with-unique-digits-ii",0,[71,95,48],[["/practice/#count-numbers-with-unique-digits-ii","Solution"]]],[3033,"Modify the Matrix","modify-the-matrix",0,[6,96],[["/practice/#modify-the-matrix","Solution"]]],[3034,"Number of Subarrays That Match a Pattern I","number-of-subarrays-that-match-a-pattern-i",0,[6,156,70,137],[["/practice/#number-of-subarrays-that-match-a-pattern-i","Solution"]]],[3035,"Maximum Palindromes After Operations","maximum-palindromes-after-operations",0,[68,6,71,155,36,150],[["/practice/#maximum-palindromes-after-operations","Solution"]]],[3036,"Number of Subarrays That Match a Pattern II","number-of-subarrays-that-match-a-pattern-ii",0,[6,156,70,137],[["/practice/#number-of-subarrays-that-match-a-pattern-ii","Solution"]]],[3037,"Find Pattern in Infinite Stream II","find-pattern-in-infinite-stream-ii",0,[6,77,156,146,70,137],[["/practice/#find-pattern-in-infinite-stream-ii","Solution"]]],[3038,"Maximum Number of Operations With the Same Score I","maximum-number-of-operations-with-the-same-score-i",0,[6,145],[["/practice/#maximum-number-of-operations-with-the-same-score-i","Solution"]]],[3039,"Apply Operations to Make String Empty","apply-operations-to-make-string-empty",0,[6,71,36,150],[["/practice/#apply-operations-to-make-string-empty","Solution"]]],[3040,"Maximum Number of Operations With the Same Score II","maximum-number-of-operations-with-the-same-score-ii",0,[100,6,48],[["/practice/#maximum-number-of-operations-with-the-same-score-ii","Solution"]]],[3041,"Maximize Consecutive Elements in an Array After Modification","maximize-consecutive-elements-in-an-array-after-modification",0,[6,48,150],[["/practice/#maximize-consecutive-elements-in-an-array-after-modification","Solution"]]],[3042,"Count Prefix and Suffix Pairs I","count-prefix-and-suffix-pairs-i",0,[171,6,155,156,70,137],[["/practice/#count-prefix-and-suffix-pairs-i","Solution"]]],[3043,"Find the Length of the Longest Common Prefix","find-the-length-of-the-longest-common-prefix",0,[171,6,71,155],[["/practice/#find-the-length-of-the-longest-common-prefix","Solution"]]],[3044,"Most Frequent Prime","most-frequent-prime",0,[6,71,95,36,50,96,112,124,143,144],[["/practice/#most-frequent-prime","Solution"]]],[3045,"Count Prefix and Suffix Pairs II","count-prefix-and-suffix-pairs-ii",0,[171,6,155,156,70,137,58],[["/practice/#count-prefix-and-suffix-pairs-ii","Solution"]]],[3046,"Split the Array","split-the-array",0,[6,71,36],[["/practice/#split-the-array","Solution"]]],[3047,"Find the Largest Area of Square Inside Two Rectangles","find-the-largest-area-of-square-inside-two-rectangles",0,[63,6,95],[["/practice/#find-the-largest-area-of-square-inside-two-rectangles","Solution"]]],[3048,"Earliest Second to Mark Indices I","earliest-second-to-mark-indices-i",0,[6,14],[["/practice/#earliest-second-to-mark-indices-i","Solution"]]],[3049,"Earliest Second to Mark Indices II","earliest-second-to-mark-indices-ii",0,[68,6,14,72],[["/practice/#earliest-second-to-mark-indices-ii","Solution"]]],[3050,"Pizza Toppings Cost Analysis","pizza-toppings-cost-analysis",1,[40],[["/practice/#pizza-toppings-cost-analysis","Solution"]]],[3051,"Find Candidates for Data Scientist Position","find-candidates-for-data-scientist-position",1,[40],[["/practice/#find-candidates-for-data-scientist-position","Solution"]]],[3052,"Maximize Items","maximize-items",1,[40],[["/practice/#maximize-items","Solution"]]],[3053,"Classifying Triangles by Lengths","classifying-triangles-by-lengths",1,[40,121],[["/practice/#classifying-triangles-by-lengths","Solution"]]],[3054,"Binary Tree Nodes","binary-tree-nodes",1,[40],[["/practice/#binary-tree-nodes","Solution"]]],[3055,"Top Percentile Fraud","top-percentile-fraud",1,[40],[["/practice/#top-percentile-fraud","Solution"]]],[3056,"Snaps Analysis","snaps-analysis",1,[40],[["/practice/#snaps-analysis","Solution"]]],[3057,"Employees Project Allocation","employees-project-allocation",1,[40],[["/practice/#employees-project-allocation","Solution"]]],[3058,"Friends With No Mutual Friends","friends-with-no-mutual-friends",1,[40],[["/practice/#friends-with-no-mutual-friends","Solution"]]],[3059,"Find All Unique Email Domains","find-all-unique-email-domains",1,[40],[["/practice/#find-all-unique-email-domains","Solution"]]],[3060,"User Activities within Time Bounds","user-activities-within-time-bounds",1,[40],[["/practice/#user-activities-within-time-bounds","Solution"]]],[3061,"Calculate Trapping Rain Water","calculate-trapping-rain-water",1,[40],[["/practice/#calculate-trapping-rain-water","Solution"]]],[3062,"Winner of the Linked List Game","winner-of-the-linked-list-game",0,[88],[["/practice/#winner-of-the-linked-list-game","Solution"]]],[3063,"Linked List Frequency","linked-list-frequency",0,[71,88,36],[["/practice/#linked-list-frequency","Solution"]]],[3064,"Guess the Number Using Bitwise Questions I","guess-the-number-using-bitwise-questions-i",0,[18,77],[["/practice/#guess-the-number-using-bitwise-questions-i","Solution"]]],[3065,"Minimum Operations to Exceed Threshold Value I","minimum-operations-to-exceed-threshold-value-i",0,[6],[["/practice/#minimum-operations-to-exceed-threshold-value-i","Solution"]]],[3066,"Minimum Operations to Exceed Threshold Value II","minimum-operations-to-exceed-threshold-value-ii",0,[6,145,72],[["/practice/#minimum-operations-to-exceed-threshold-value-ii","Solution"]]],[3067,"Count Pairs of Connectable Servers in a Weighted Tree Network","count-pairs-of-connectable-servers-in-a-weighted-tree-network",0,[168,41,6],[["/practice/#count-pairs-of-connectable-servers-in-a-weighted-tree-network","Solution"]]],[3068,"Find the Maximum Sum of Node Values","find-the-maximum-sum-of-node-values",0,[68,18,168,6,48,150],[["/practice/#find-the-maximum-sum-of-node-values","Solution"]]],[3069,"Distribute Elements Into Two Arrays I","distribute-elements-into-two-arrays-i",0,[6,145],[["/practice/#distribute-elements-into-two-arrays-i","Solution"]]],[3070,"Count Submatrices with Top-Left Element and Sum Less Than k","count-submatrices-with-top-left-element-and-sum-less-than-k",0,[6,96,122],[["/practice/#count-submatrices-with-top-left-element-and-sum-less-than-k","Solution"]]],[3071,"Minimum Operations to Write the Letter Y on a Grid","minimum-operations-to-write-the-letter-y-on-a-grid",0,[6,71,36,96],[["/practice/#minimum-operations-to-write-the-letter-y-on-a-grid","Solution"]]],[3072,"Distribute Elements Into Two Arrays II","distribute-elements-into-two-arrays-ii",0,[12,139,6,145],[["/practice/#distribute-elements-into-two-arrays-ii","Solution"]]],[3073,"Maximum Increasing Triplet Value","maximum-increasing-triplet-value",0,[6,113],[["/practice/#maximum-increasing-triplet-value","Solution"]]],[3074,"Apple Redistribution into Boxes","apple-redistribution-into-boxes",0,[68,6,150],[["/practice/#apple-redistribution-into-boxes","Solution"]]],[3075,"Maximize Happiness of Selected Children","maximize-happiness-of-selected-children",0,[68,6,150],[["/practice/#maximize-happiness-of-selected-children","Solution"]]],[3076,"Shortest Uncommon Substring in an Array","shortest-uncommon-substring-in-an-array",0,[171,6,71,155],[["/practice/#shortest-uncommon-substring-in-an-array","Solution"]]],[3077,"Maximum Strength of K Disjoint Subarrays","maximum-strength-of-k-disjoint-subarrays",0,[6,48,122],[["/practice/#maximum-strength-of-k-disjoint-subarrays","Solution"]]],[3078,"Match Alphanumerical Pattern in Matrix I","match-alphanumerical-pattern-in-matrix-i",0,[6,71,155,96],[["/practice/#match-alphanumerical-pattern-in-matrix-i","Solution"]]],[3079,"Find the Sum of Encrypted Integers","find-the-sum-of-encrypted-integers",0,[6,95],[["/practice/#find-the-sum-of-encrypted-integers","Solution"]]],[3080,"Mark Elements on Array by Performing Queries","mark-elements-on-array-by-performing-queries",0,[6,71,150,145,72],[["/practice/#mark-elements-on-array-by-performing-queries","Solution"]]],[3081,"Replace Question Marks in String to Minimize Its Value","replace-question-marks-in-string-to-minimize-its-value",0,[68,71,155,36,150,72],[["/practice/#replace-question-marks-in-string-to-minimize-its-value","Solution"]]],[3082,"Find the Sum of the Power of All Subsequences","find-the-sum-of-the-power-of-all-subsequences",0,[6,48,82,2],[["/practice/#find-the-sum-of-the-power-of-all-subsequences","Solution"]]],[3083,"Existence of a Substring in a String and Its Reverse","existence-of-a-substring-in-a-string-and-its-reverse",0,[71,155],[["/practice/#existence-of-a-substring-in-a-string-and-its-reverse","Solution"]]],[3084,"Count Substrings Starting and Ending with Given Character","count-substrings-starting-and-ending-with-given-character",0,[95,155,36],[["/practice/#count-substrings-starting-and-ending-with-given-character","Solution"]]],[3085,"Minimum Deletions to Make String K-Special","minimum-deletions-to-make-string-k-special",0,[68,71,155,36,150],[["/practice/#minimum-deletions-to-make-string-k-special","Solution"]]],[3086,"Minimum Moves to Pick K Ones","minimum-moves-to-pick-k-ones",0,[68,6,122,146],[["/practice/#minimum-moves-to-pick-k-ones","Solution"]]],[3087,"Find Trending Hashtags","find-trending-hashtags",1,[40],[["/practice/#find-trending-hashtags","Solution"]]],[3088,"Make String Anti-palindrome","make-string-anti-palindrome",0,[68,155,37,150],[["/practice/#make-string-anti-palindrome","Solution"]]],[3089,"Find Bursty Behavior","find-bursty-behavior",1,[40],[["/practice/#find-bursty-behavior","Solution"]]],[3090,"Maximum Length Substring With Two Occurrences","maximum-length-substring-with-two-occurrences",0,[71,155,146],[["/practice/#maximum-length-substring-with-two-occurrences","Solution"]]],[3091,"Apply Operations to Make Sum of Array Greater Than or Equal to k","apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k",0,[68,95,50],[["/practice/#apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k","Solution"]]],[3092,"Most Frequent IDs","most-frequent-ids",0,[6,71,113,72],[["/practice/#most-frequent-ids","Solution"]]],[3093,"Longest Common Suffix Queries","longest-common-suffix-queries",0,[171,6,155],[["/practice/#longest-common-suffix-queries","Solution"]]],[3094,"Guess the Number Using Bitwise Questions II","guess-the-number-using-bitwise-questions-ii",0,[18,77],[["/practice/#guess-the-number-using-bitwise-questions-ii","Solution"]]],[3095,"Shortest Subarray With OR at Least K I","shortest-subarray-with-or-at-least-k-i",0,[18,6,146],[["/practice/#shortest-subarray-with-or-at-least-k-i","Solution"]]],[3096,"Minimum Levels to Gain More Points","minimum-levels-to-gain-more-points",0,[6,122],[["/practice/#minimum-levels-to-gain-more-points","Solution"]]],[3097,"Shortest Subarray With OR at Least K II","shortest-subarray-with-or-at-least-k-ii",0,[18,6,146],[["/practice/#shortest-subarray-with-or-at-least-k-ii","Solution"]]],[3098,"Find the Sum of Subsequence Powers","find-the-sum-of-subsequence-powers",0,[6,48,150],[["/practice/#find-the-sum-of-subsequence-powers","Solution"]]],[3099,"Harshad Number","harshad-number",0,[95],[["/practice/#harshad-number","Solution"]]],[3100,"Water Bottles II","water-bottles-ii",0,[95,145],[["/practice/#water-bottles-ii","Solution"]]],[3101,"Count Alternating Subarrays","count-alternating-subarrays",0,[6,95],[["/practice/#count-alternating-subarrays","Solution"]]],[3102,"Minimize Manhattan Distances","minimize-manhattan-distances",0,[63,6,95,113,150],[["/practice/#minimize-manhattan-distances","Solution"]]],[3103,"Find Trending Hashtags II ","find-trending-hashtags-ii",1,[40],[["/practice/#find-trending-hashtags-ii","Problem details"]]],[3104,"Find Longest Self-Contained Substring","find-longest-self-contained-substring",0,[71,155,150],[["/practice/#find-longest-self-contained-substring","Solution"]]],[3105,"Longest Strictly Increasing or Strictly Decreasing Subarray","longest-strictly-increasing-or-strictly-decreasing-subarray",0,[6],[["/practice/#longest-strictly-increasing-or-strictly-decreasing-subarray","Solution"]]],[3106,"Lexicographically Smallest String After Operations With Constraint","lexicographically-smallest-string-after-operations-with-constraint",0,[68,155],[["/practice/#lexicographically-smallest-string-after-operations-with-constraint","Solution"]]],[3107,"Minimum Operations to Make Median of Array Equal to K","minimum-operations-to-make-median-of-array-equal-to-k",0,[68,6,150],[["/practice/#minimum-operations-to-make-median-of-array-equal-to-k","Solution"]]],[3108,"Minimum Cost Walk in Weighted Graph","minimum-cost-walk-in-weighted-graph",0,[18,174,64,6],[["/practice/#minimum-cost-walk-in-weighted-graph","Solution"]]],[3109,"Find the Index of Permutation","find-the-index-of-permutation",0,[12,139,6,14,46,113,101],[["/practice/#find-the-index-of-permutation","Solution"]]],[3110,"Score of a String","score-of-a-string",0,[155],[["/practice/#score-of-a-string","Solution"]]],[3111,"Minimum Rectangles to Cover Points","minimum-rectangles-to-cover-points",0,[68,6,150],[["/practice/#minimum-rectangles-to-cover-points","Solution"]]],[3112,"Minimum Time to Visit Disappearing Nodes","minimum-time-to-visit-disappearing-nodes",0,[64,6,142,72],[["/practice/#minimum-time-to-visit-disappearing-nodes","Solution"]]],[3113,"Find the Number of Subarrays Where Boundary Elements Are Maximum","find-the-number-of-subarrays-where-boundary-elements-are-maximum",0,[154,6,14,108],[["/practice/#find-the-number-of-subarrays-where-boundary-elements-are-maximum","Solution"]]],[3114,"Latest Time You Can Obtain After Replacing Characters","latest-time-you-can-obtain-after-replacing-characters",0,[155,50],[["/practice/#latest-time-you-can-obtain-after-replacing-characters","Solution"]]],[3115,"Maximum Prime Difference","maximum-prime-difference",0,[6,95,112,124],[["/practice/#maximum-prime-difference","Solution"]]],[3116,"Kth Smallest Amount With Single Denomination Combination","kth-smallest-amount-with-single-denomination-combination",0,[18,6,95,14,33,112],[["/practice/#kth-smallest-amount-with-single-denomination-combination","Solution"]]],[3117,"Minimum Sum of Values by Dividing Array","minimum-sum-of-values-by-dividing-array",0,[18,139,128,6,14,48],[["/practice/#minimum-sum-of-values-by-dividing-array","Solution"]]],[3118,"Friday Purchase III ","friday-purchase-iii",1,[40],[["/practice/#friday-purchase-iii","Solution"]]],[3119,"Maximum Number of Potholes That Can Be Fixed","maximum-number-of-potholes-that-can-be-fixed",0,[68,155,150],[["/practice/#maximum-number-of-potholes-that-can-be-fixed","Solution"]]],[3120,"Count the Number of Special Characters I","count-the-number-of-special-characters-i",0,[71,155],[["/practice/#count-the-number-of-special-characters-i","Solution"]]],[3121,"Count the Number of Special Characters II","count-the-number-of-special-characters-ii",0,[71,155],[["/practice/#count-the-number-of-special-characters-ii","Solution"]]],[3122,"Minimum Number of Operations to Satisfy Conditions","minimum-number-of-operations-to-satisfy-conditions",0,[6,48,96],[["/practice/#minimum-number-of-operations-to-satisfy-conditions","Solution"]]],[3123,"Find Edges in Shortest Paths","find-edges-in-shortest-paths",0,[41,25,64,142,72],[["/practice/#find-edges-in-shortest-paths","Solution"]]],[3124,"Find Longest Calls","find-longest-calls",1,[40],[["/practice/#find-longest-calls","Solution"]]],[3125,"Maximum Number That Makes Result of Bitwise AND Zero","maximum-number-that-makes-result-of-bitwise-and-zero",0,[68,155,150],[["/practice/#maximum-number-that-makes-result-of-bitwise-and-zero","Solution"]]],[3126,"Server Utilization Time","server-utilization-time",1,[40],[["/practice/#server-utilization-time","Solution"]]],[3127,"Make a Square with the Same Color","make-a-square-with-the-same-color",0,[6,50,96],[["/practice/#make-a-square-with-the-same-color","Solution"]]],[3128,"Right Triangles","right-triangles",0,[6,71,95,33,36],[["/practice/#right-triangles","Solution"]]],[3129,"Find All Possible Stable Binary Arrays I","find-all-possible-stable-binary-arrays-i",0,[48,122],[["/practice/#find-all-possible-stable-binary-arrays-i","Solution"]]],[3130,"Find All Possible Stable Binary Arrays II","find-all-possible-stable-binary-arrays-ii",0,[48,122],[["/practice/#find-all-possible-stable-binary-arrays-ii","Solution"]]],[3131,"Find the Integer Added to Array I","find-the-integer-added-to-array-i",0,[6],[["/practice/#find-the-integer-added-to-array-i","Solution"]]],[3132,"Find the Integer Added to Array II","find-the-integer-added-to-array-ii",0,[6,172,50,150],[["/practice/#find-the-integer-added-to-array-ii","Solution"]]],[3133,"Minimum Array End","minimum-array-end",0,[18],[["/practice/#minimum-array-end","Solution"]]],[3134,"Find the Median of the Uniqueness Array","find-the-median-of-the-uniqueness-array",0,[6,71,14,146],[["/practice/#find-the-median-of-the-uniqueness-array","Solution"]]],[3135,"Equalize Strings by Adding or Removing Characters at Ends","equalize-strings-by-adding-or-removing-characters-at-ends",0,[155,14,48,146,70],[["/practice/#equalize-strings-by-adding-or-removing-characters-at-ends","Solution"]]],[3136,"Valid Word","valid-word",0,[155],[["/practice/#valid-word","Solution"]]],[3137,"Minimum Number of Operations to Make Word K-Periodic","minimum-number-of-operations-to-make-word-k-periodic",0,[71,155,36],[["/practice/#minimum-number-of-operations-to-make-word-k-periodic","Solution"]]],[3138,"Minimum Length of Anagram Concatenation","minimum-length-of-anagram-concatenation",0,[71,155,36],[["/practice/#minimum-length-of-anagram-concatenation","Solution"]]],[3139,"Minimum Cost to Equalize Array","minimum-cost-to-equalize-array",0,[68,6,50],[["/practice/#minimum-cost-to-equalize-array","Solution"]]],[3140,"Consecutive Available Seats II","consecutive-available-seats-ii",1,[40],[["/practice/#consecutive-available-seats-ii","Solution"]]],[3141,"Maximum Hamming Distances","maximum-hamming-distances",0,[18,25,6],[["/practice/#maximum-hamming-distances","Solution"]]],[3142,"Check if Grid Satisfies Conditions","check-if-grid-satisfies-conditions",0,[6,96],[["/practice/#check-if-grid-satisfies-conditions","Solution"]]],[3143,"Maximum Points Inside the Square","maximum-points-inside-the-square",0,[6,71,155,14,150],[["/practice/#maximum-points-inside-the-square","Solution"]]],[3144,"Minimum Substring Partition of Equal Character Frequency","minimum-substring-partition-of-equal-character-frequency",0,[71,155,48,36],[["/practice/#minimum-substring-partition-of-equal-character-frequency","Solution"]]],[3145,"Find Products of Elements of Big Array","find-products-of-elements-of-big-array",0,[18,6,14],[["/practice/#find-products-of-elements-of-big-array","Solution"]]],[3146,"Permutation Difference between Two Strings","permutation-difference-between-two-strings",0,[71,155],[["/practice/#permutation-difference-between-two-strings","Solution"]]],[3147,"Taking Maximum Energy From the Mystic Dungeon","taking-maximum-energy-from-the-mystic-dungeon",0,[6,48,122],[["/practice/#taking-maximum-energy-from-the-mystic-dungeon","Solution"]]],[3148,"Maximum Difference Score in a Grid","maximum-difference-score-in-a-grid",0,[6,48,96],[["/practice/#maximum-difference-score-in-a-grid","Solution"]]],[3149,"Find the Minimum Cost Array Permutation","find-the-minimum-cost-array-permutation",0,[18,6,48,19],[["/practice/#find-the-minimum-cost-array-permutation","Solution"]]],[3150,"Invalid Tweets II","invalid-tweets-ii",1,[40],[["/practice/#invalid-tweets-ii","Solution"]]],[3151,"Special Array I","special-array-i",0,[6],[["/practice/#special-array-i","Solution"]]],[3152,"Special Array II","special-array-ii",0,[6,14,122],[["/practice/#special-array-ii","Solution"]]],[3153,"Sum of Digit Differences of All Pairs","sum-of-digit-differences-of-all-pairs",0,[6,71,95,36],[["/practice/#sum-of-digit-differences-of-all-pairs","Solution"]]],[3154,"Find Number of Ways to Reach the K-th Stair","find-number-of-ways-to-reach-the-k-th-stair",0,[18,100,95,48,33],[["/practice/#find-number-of-ways-to-reach-the-k-th-stair","Solution"]]],[3155,"Maximum Number of Upgradable Servers","maximum-number-of-upgradable-servers",0,[6,95,14],[["/practice/#maximum-number-of-upgradable-servers","Solution"]]],[3156,"Employee Task Duration and Concurrent Tasks","employee-task-duration-and-concurrent-tasks",1,[40],[["/practice/#employee-task-duration-and-concurrent-tasks","Solution"]]],[3157,"Find the Level of Tree with Minimum Sum","find-the-level-of-tree-with-minimum-sum",0,[168,41,25,16],[["/practice/#find-the-level-of-tree-with-minimum-sum","Solution"]]],[3158,"Find the XOR of Numbers Which Appear Twice","find-the-xor-of-numbers-which-appear-twice",0,[18,6,71],[["/practice/#find-the-xor-of-numbers-which-appear-twice","Solution"]]],[3159,"Find Occurrences of an Element in an Array","find-occurrences-of-an-element-in-an-array",0,[6,71],[["/practice/#find-occurrences-of-an-element-in-an-array","Solution"]]],[3160,"Find the Number of Distinct Colors Among the Balls","find-the-number-of-distinct-colors-among-the-balls",0,[6,71,145],[["/practice/#find-the-number-of-distinct-colors-among-the-balls","Solution"]]],[3161,"Block Placement Queries","block-placement-queries",0,[12,139,6,14,113],[["/practice/#block-placement-queries","Solution"]]],[3162,"Find the Number of Good Pairs I","find-the-number-of-good-pairs-i",0,[6,71],[["/practice/#find-the-number-of-good-pairs-i","Solution"]]],[3163,"String Compression III","string-compression-iii",0,[155],[["/practice/#string-compression-iii","Solution"]]],[3164,"Find the Number of Good Pairs II","find-the-number-of-good-pairs-ii",0,[6,71],[["/practice/#find-the-number-of-good-pairs-ii","Solution"]]],[3165,"Maximum Sum of Subsequence With Non-adjacent Elements","maximum-sum-of-subsequence-with-non-adjacent-elements",0,[139,6,46,48],[["/practice/#maximum-sum-of-subsequence-with-non-adjacent-elements","Solution"]]],[3166,"Calculate Parking Fees and Duration","calculate-parking-fees-and-duration",1,[40],[["/practice/#calculate-parking-fees-and-duration","Solution"]]],[3167,"Better Compression of String","better-compression-of-string",0,[71,155,36,150],[["/practice/#better-compression-of-string","Solution"]]],[3168,"Minimum Number of Chairs in a Waiting Room","minimum-number-of-chairs-in-a-waiting-room",0,[155,145],[["/practice/#minimum-number-of-chairs-in-a-waiting-room","Solution"]]],[3169,"Count Days Without Meetings","count-days-without-meetings",0,[6,150],[["/practice/#count-days-without-meetings","Solution"]]],[3170,"Lexicographically Minimum String After Removing Stars","lexicographically-minimum-string-after-removing-stars",0,[154,68,71,155,72],[["/practice/#lexicographically-minimum-string-after-removing-stars","Solution"]]],[3171,"Find Subarray With Bitwise OR Closest to K","find-subarray-with-bitwise-or-closest-to-k",0,[18,139,6,14],[["/practice/#find-subarray-with-bitwise-or-closest-to-k","Solution"]]],[3172,"Second Day Verification","second-day-verification",1,[40],[["/practice/#second-day-verification","Solution"]]],[3173,"Bitwise OR of Adjacent Elements","bitwise-or-of-adjacent-elements",0,[18,6],[["/practice/#bitwise-or-of-adjacent-elements","Solution"]]],[3174,"Clear Digits","clear-digits",0,[154,155,145],[["/practice/#clear-digits","Solution"]]],[3175,"Find The First Player to win K Games in a Row","find-the-first-player-to-win-k-games-in-a-row",0,[6,145],[["/practice/#find-the-first-player-to-win-k-games-in-a-row","Solution"]]],[3176,"Find the Maximum Length of a Good Subsequence I","find-the-maximum-length-of-a-good-subsequence-i",0,[6,71,48],[["/practice/#find-the-maximum-length-of-a-good-subsequence-i","Solution"]]],[3177,"Find the Maximum Length of a Good Subsequence II","find-the-maximum-length-of-a-good-subsequence-ii",0,[6,71,48],[["/practice/#find-the-maximum-length-of-a-good-subsequence-ii","Solution"]]],[3178,"Find the Child Who Has the Ball After K Seconds","find-the-child-who-has-the-ball-after-k-seconds",0,[95,145],[["/practice/#find-the-child-who-has-the-ball-after-k-seconds","Solution"]]],[3179,"Find the N-th Value After K Seconds","find-the-n-th-value-after-k-seconds",0,[6,95,33,122,145],[["/practice/#find-the-n-th-value-after-k-seconds","Solution"]]],[3180,"Maximum Total Reward Using Operations I","maximum-total-reward-using-operations-i",0,[18,6,48,150],[["/practice/#maximum-total-reward-using-operations-i","Solution"]]],[3181,"Maximum Total Reward Using Operations II","maximum-total-reward-using-operations-ii",0,[18,6,48,150],[["/practice/#maximum-total-reward-using-operations-ii","Solution"]]],[3182,"Find Top Scoring Students","find-top-scoring-students",1,[40],[["/practice/#find-top-scoring-students","Solution"]]],[3183,"The Number of Ways to Make the Sum","the-number-of-ways-to-make-the-sum",0,[6,48,82,143,106],[["/practice/#the-number-of-ways-to-make-the-sum","Solution"]]],[3184,"Count Pairs That Form a Complete Day I","count-pairs-that-form-a-complete-day-i",0,[6,71,36],[["/practice/#count-pairs-that-form-a-complete-day-i","Solution"]]],[3185,"Count Pairs That Form a Complete Day II","count-pairs-that-form-a-complete-day-ii",0,[6,71,36],[["/practice/#count-pairs-that-form-a-complete-day-ii","Solution"]]],[3186,"Maximum Total Damage With Spell Casting","maximum-total-damage-with-spell-casting",0,[6,71,172,14,48,36,150],[["/practice/#maximum-total-damage-with-spell-casting","Solution"]]],[3187,"Peaks in Array","peaks-in-array",0,[12,139,6],[["/practice/#peaks-in-array","Solution"]]],[3188,"Find Top Scoring Students II","find-top-scoring-students-ii",1,[40],[["/practice/#find-top-scoring-students-ii","Solution"]]],[3189,"Minimum Moves to Get a Peaceful Board","minimum-moves-to-get-a-peaceful-board",0,[68,6,37,150],[["/practice/#minimum-moves-to-get-a-peaceful-board","Solution"]]],[3190,"Find Minimum Operations to Make All Elements Divisible by Three","find-minimum-operations-to-make-all-elements-divisible-by-three",0,[6,95],[["/practice/#find-minimum-operations-to-make-all-elements-divisible-by-three","Solution"]]],[3191,"Minimum Operations to Make Binary Array Elements Equal to One I","minimum-operations-to-make-binary-array-elements-equal-to-one-i",0,[18,128,6,122,146],[["/practice/#minimum-operations-to-make-binary-array-elements-equal-to-one-i","Solution"]]],[3192,"Minimum Operations to Make Binary Array Elements Equal to One II","minimum-operations-to-make-binary-array-elements-equal-to-one-ii",0,[68,6,48],[["/practice/#minimum-operations-to-make-binary-array-elements-equal-to-one-ii","Solution"]]],[3193,"Count the Number of Inversions","count-the-number-of-inversions",0,[6,48],[["/practice/#count-the-number-of-inversions","Solution"]]],[3194,"Minimum Average of Smallest and Largest Elements","minimum-average-of-smallest-and-largest-elements",0,[6,172,150],[["/practice/#minimum-average-of-smallest-and-largest-elements","Solution"]]],[3195,"Find the Minimum Area to Cover All Ones I","find-the-minimum-area-to-cover-all-ones-i",0,[6,96],[["/practice/#find-the-minimum-area-to-cover-all-ones-i","Solution"]]],[3196,"Maximize Total Cost of Alternating Subarrays","maximize-total-cost-of-alternating-subarrays",0,[6,48],[["/practice/#maximize-total-cost-of-alternating-subarrays","Solution"]]],[3197,"Find the Minimum Area to Cover All Ones II","find-the-minimum-area-to-cover-all-ones-ii",0,[6,50,96],[["/practice/#find-the-minimum-area-to-cover-all-ones-ii","Solution"]]],[3198,"Find Cities in Each State","find-cities-in-each-state",1,[40],[["/practice/#find-cities-in-each-state","Solution"]]],[3199,"Count Triplets with Even XOR Set Bits I","count-triplets-with-even-xor-set-bits-i",0,[18,6],[["/practice/#count-triplets-with-even-xor-set-bits-i","Solution"]]],[3200,"Maximum Height of a Triangle","maximum-height-of-a-triangle",0,[6,50],[["/practice/#maximum-height-of-a-triangle","Solution"]]],[3201,"Find the Maximum Length of Valid Subsequence I","find-the-maximum-length-of-valid-subsequence-i",0,[6,48],[["/practice/#find-the-maximum-length-of-valid-subsequence-i","Solution"]]],[3202,"Find the Maximum Length of Valid Subsequence II","find-the-maximum-length-of-valid-subsequence-ii",0,[6,48],[["/practice/#find-the-maximum-length-of-valid-subsequence-ii","Solution"]]],[3203,"Find Minimum Diameter After Merging Two Trees","find-minimum-diameter-after-merging-two-trees",0,[168,41,25,64],[["/practice/#find-minimum-diameter-after-merging-two-trees","Solution"]]],[3204,"Bitwise User Permissions Analysis","bitwise-user-permissions-analysis",1,[40],[["/practice/#bitwise-user-permissions-analysis","Solution"]]],[3205,"Maximum Array Hopping Score I","maximum-array-hopping-score-i",0,[154,68,6,48,108],[["/practice/#maximum-array-hopping-score-i","Solution"]]],[3206,"Alternating Groups I","alternating-groups-i",0,[6,146],[["/practice/#alternating-groups-i","Solution"]]],[3207,"Maximum Points After Enemy Battles","maximum-points-after-enemy-battles",0,[68,6],[["/practice/#maximum-points-after-enemy-battles","Solution"]]],[3208,"Alternating Groups II","alternating-groups-ii",0,[6,146],[["/practice/#alternating-groups-ii","Solution"]]],[3209,"Number of Subarrays With AND Value of K","number-of-subarrays-with-and-value-of-k",0,[18,139,6,14],[["/practice/#number-of-subarrays-with-and-value-of-k","Solution"]]],[3210,"Find the Encrypted String","find-the-encrypted-string",0,[155],[["/practice/#find-the-encrypted-string","Solution"]]],[3211,"Generate Binary Strings Without Adjacent Zeros","generate-binary-strings-without-adjacent-zeros",0,[18,155,8],[["/practice/#generate-binary-strings-without-adjacent-zeros","Solution"]]],[3212,"Count Submatrices With Equal Frequency of X and Y","count-submatrices-with-equal-frequency-of-x-and-y",0,[6,96,122],[["/practice/#count-submatrices-with-equal-frequency-of-x-and-y","Solution"]]],[3213,"Construct String with Minimum Cost","construct-string-with-minimum-cost",0,[6,155,48,158],[["/practice/#construct-string-with-minimum-cost","Solution"]]],[3214,"Year on Year Growth Rate","year-on-year-growth-rate",1,[40],[["/practice/#year-on-year-growth-rate","Solution"]]],[3215,"Count Triplets with Even XOR Set Bits II","count-triplets-with-even-xor-set-bits-ii",0,[18,6],[["/practice/#count-triplets-with-even-xor-set-bits-ii","Solution"]]],[3216,"Lexicographically Smallest String After a Swap","lexicographically-smallest-string-after-a-swap",0,[68,155],[["/practice/#lexicographically-smallest-string-after-a-swap","Solution"]]],[3217,"Delete Nodes From Linked List Present in Array","delete-nodes-from-linked-list-present-in-array",0,[6,71,88],[["/practice/#delete-nodes-from-linked-list-present-in-array","Solution"]]],[3218,"Minimum Cost for Cutting Cake I","minimum-cost-for-cutting-cake-i",0,[68,6,172,48,150],[["/practice/#minimum-cost-for-cutting-cake-i","Solution"]]],[3219,"Minimum Cost for Cutting Cake II","minimum-cost-for-cutting-cake-ii",0,[68,6,150],[["/practice/#minimum-cost-for-cutting-cake-ii","Solution"]]],[3220,"Odd and Even Transactions","odd-and-even-transactions",1,[40],[["/practice/#odd-and-even-transactions","Solution"]]],[3221,"Maximum Array Hopping Score II","maximum-array-hopping-score-ii",0,[154,68,6,108],[["/practice/#maximum-array-hopping-score-ii","Solution"]]],[3222,"Find the Winning Player in Coin Game","find-the-winning-player-in-coin-game",0,[95,62,145],[["/practice/#find-the-winning-player-in-coin-game","Solution"]]],[3223,"Minimum Length of String After Operations","minimum-length-of-string-after-operations",0,[71,155,36],[["/practice/#minimum-length-of-string-after-operations","Solution"]]],[3224,"Minimum Array Changes to Make Differences Equal","minimum-array-changes-to-make-differences-equal",0,[6,71,122],[["/practice/#minimum-array-changes-to-make-differences-equal","Solution"]]],[3225,"Maximum Score From Grid Operations","maximum-score-from-grid-operations",0,[6,48,96,122],[["/practice/#maximum-score-from-grid-operations","Solution"]]],[3226,"Number of Bit Changes to Make Two Integers Equal","number-of-bit-changes-to-make-two-integers-equal",0,[18],[["/practice/#number-of-bit-changes-to-make-two-integers-equal","Solution"]]],[3227,"Vowels Game in a String","vowels-game-in-a-string",0,[24,95,155,62],[["/practice/#vowels-game-in-a-string","Solution"]]],[3228,"Maximum Number of Operations to Move Ones to the End","maximum-number-of-operations-to-move-ones-to-the-end",0,[68,155,36],[["/practice/#maximum-number-of-operations-to-move-ones-to-the-end","Solution"]]],[3229,"Minimum Operations to Make Array Equal to Target","minimum-operations-to-make-array-equal-to-target",0,[154,68,6,48,108],[["/practice/#minimum-operations-to-make-array-equal-to-target","Solution"]]],[3230,"Customer Purchasing Behavior Analysis","customer-purchasing-behavior-analysis",1,[40],[["/practice/#customer-purchasing-behavior-analysis","Solution"]]],[3231,"Minimum Number of Increasing Subsequence to Be Removed","minimum-number-of-increasing-subsequence-to-be-removed",0,[6,14],[["/practice/#minimum-number-of-increasing-subsequence-to-be-removed","Solution"]]],[3232,"Find if Digit Game Can Be Won","find-if-digit-game-can-be-won",0,[6,95],[["/practice/#find-if-digit-game-can-be-won","Solution"]]],[3233,"Find the Count of Numbers Which Are Not Special","find-the-count-of-numbers-which-are-not-special",0,[6,95,112],[["/practice/#find-the-count-of-numbers-which-are-not-special","Solution"]]],[3234,"Count the Number of Substrings With Dominant Ones","count-the-number-of-substrings-with-dominant-ones",0,[155,50],[["/practice/#count-the-number-of-substrings-with-dominant-ones","Solution"]]],[3235,"Check if the Rectangle Corner Is Reachable","check-if-the-rectangle-corner-is-reachable",0,[41,25,174,63,6,95],[["/practice/#check-if-the-rectangle-corner-is-reachable","Solution"]]],[3236,"CEO Subordinate Hierarchy","ceo-subordinate-hierarchy",1,[40],[["/practice/#ceo-subordinate-hierarchy","Solution"]]],[3237,"Alt and Tab Simulation","alt-and-tab-simulation",0,[6,71,145],[["/practice/#alt-and-tab-simulation","Solution"]]],[3238,"Find the Number of Winning Players","find-the-number-of-winning-players",0,[6,71,36],[["/practice/#find-the-number-of-winning-players","Solution"]]],[3239,"Minimum Number of Flips to Make Binary Grid Palindromic I","minimum-number-of-flips-to-make-binary-grid-palindromic-i",0,[6,172,96],[["/practice/#minimum-number-of-flips-to-make-binary-grid-palindromic-i","Solution"]]],[3240,"Minimum Number of Flips to Make Binary Grid Palindromic II","minimum-number-of-flips-to-make-binary-grid-palindromic-ii",0,[6,172,96],[["/practice/#minimum-number-of-flips-to-make-binary-grid-palindromic-ii","Solution"]]],[3241,"Time Taken to Mark All Nodes","time-taken-to-mark-all-nodes",0,[168,41,64,48,169],[["/practice/#time-taken-to-mark-all-nodes","Solution"]]],[3242,"Design Neighbor Sum Service","design-neighbor-sum-service",0,[42,6,71,96,145],[["/practice/#design-neighbor-sum-service","Solution"]]],[3243,"Shortest Distance After Road Addition Queries I","shortest-distance-after-road-addition-queries-i",0,[25,64,6],[["/practice/#shortest-distance-after-road-addition-queries-i","Solution"]]],[3244,"Shortest Distance After Road Addition Queries II","shortest-distance-after-road-addition-queries-ii",0,[68,64,6,113],[["/practice/#shortest-distance-after-road-addition-queries-ii","Solution"]]],[3245,"Alternating Groups III","alternating-groups-iii",0,[12,6,113],[["/practice/#alternating-groups-iii","Solution"]]],[3246,"Premier League Table Ranking","premier-league-table-ranking",1,[40],[["/practice/#premier-league-table-ranking","Solution"]]],[3247,"Number of Subsequences with Odd Sum","number-of-subsequences-with-odd-sum",0,[6,95,48,33],[["/practice/#number-of-subsequences-with-odd-sum","Solution"]]],[3248,"Snake in Matrix","snake-in-matrix",0,[6,155,145],[["/practice/#snake-in-matrix","Solution"]]],[3249,"Count the Number of Good Nodes","count-the-number-of-good-nodes",0,[168,41],[["/practice/#count-the-number-of-good-nodes","Solution"]]],[3250,"Find the Count of Monotonic Pairs I","find-the-count-of-monotonic-pairs-i",0,[6,95,48,33,122],[["/practice/#find-the-count-of-monotonic-pairs-i","Solution"]]],[3251,"Find the Count of Monotonic Pairs II","find-the-count-of-monotonic-pairs-ii",0,[6,95,48,33,122],[["/practice/#find-the-count-of-monotonic-pairs-ii","Solution"]]],[3252,"Premier League Table Ranking II","premier-league-table-ranking-ii",1,[40],[["/practice/#premier-league-table-ranking-ii","Solution"]]],[3253,"Construct String with Minimum Cost (Easy)","construct-string-with-minimum-cost-easy",0,[],[["/practice/#construct-string-with-minimum-cost-easy","Solution"]]],[3254,"Find the Power of K-Size Subarrays I","find-the-power-of-k-size-subarrays-i",0,[6,146],[["/practice/#find-the-power-of-k-size-subarrays-i","Solution"]]],[3255,"Find the Power of K-Size Subarrays II","find-the-power-of-k-size-subarrays-ii",0,[6,146],[["/practice/#find-the-power-of-k-size-subarrays-ii","Solution"]]],[3256,"Maximum Value Sum by Placing Three Rooks I","maximum-value-sum-by-placing-three-rooks-i",0,[6,48,50,96],[["/practice/#maximum-value-sum-by-placing-three-rooks-i","Solution"]]],[3257,"Maximum Value Sum by Placing Three Rooks II","maximum-value-sum-by-placing-three-rooks-ii",0,[6,48,50,96],[["/practice/#maximum-value-sum-by-placing-three-rooks-ii","Solution"]]],[3258,"Count Substrings That Satisfy K-Constraint I","count-substrings-that-satisfy-k-constraint-i",0,[155,146],[["/practice/#count-substrings-that-satisfy-k-constraint-i","Solution"]]],[3259,"Maximum Energy Boost From Two Drinks","maximum-energy-boost-from-two-drinks",0,[6,48],[["/practice/#maximum-energy-boost-from-two-drinks","Solution"]]],[3260,"Find the Largest Palindrome Divisible by K","find-the-largest-palindrome-divisible-by-k",0,[68,95,155,48,112],[["/practice/#find-the-largest-palindrome-divisible-by-k","Solution"]]],[3261,"Count Substrings That Satisfy K-Constraint II","count-substrings-that-satisfy-k-constraint-ii",0,[6,155,14,122,146],[["/practice/#count-substrings-that-satisfy-k-constraint-ii","Solution"]]],[3262,"Find Overlapping Shifts","find-overlapping-shifts",1,[40],[["/practice/#find-overlapping-shifts","Solution"]]],[3263,"Convert Doubly Linked List to Array I","convert-doubly-linked-list-to-array-i",0,[6,88,47],[["/practice/#convert-doubly-linked-list-to-array-i","Solution"]]],[3264,"Final Array State After K Multiplication Operations I","final-array-state-after-k-multiplication-operations-i",0,[6,95,145,72],[["/practice/#final-array-state-after-k-multiplication-operations-i","Solution"]]],[3265,"Count Almost Equal Pairs I","count-almost-equal-pairs-i",0,[6,71,36,50,150],[["/practice/#count-almost-equal-pairs-i","Solution"]]],[3266,"Final Array State After K Multiplication Operations II","final-array-state-after-k-multiplication-operations-ii",0,[6,145,72],[["/practice/#final-array-state-after-k-multiplication-operations-ii","Solution"]]],[3267,"Count Almost Equal Pairs II","count-almost-equal-pairs-ii",0,[6,71,36,50,150],[["/practice/#count-almost-equal-pairs-ii","Solution"]]],[3268,"Find Overlapping Shifts II","find-overlapping-shifts-ii",1,[40],[["/practice/#find-overlapping-shifts-ii","Solution"]]],[3269,"Constructing Two Increasing Arrays","constructing-two-increasing-arrays",0,[6,48],[["/practice/#constructing-two-increasing-arrays","Solution"]]],[3270,"Find the Key of the Numbers","find-the-key-of-the-numbers",0,[95],[["/practice/#find-the-key-of-the-numbers","Solution"]]],[3271,"Hash Divided String","hash-divided-string",0,[155,145],[["/practice/#hash-divided-string","Solution"]]],[3272,"Find the Count of Good Integers","find-the-count-of-good-integers",0,[71,95,33,50],[["/practice/#find-the-count-of-good-integers","Solution"]]],[3273,"Minimum Amount of Damage Dealt to Bob","minimum-amount-of-damage-dealt-to-bob",0,[68,6,150],[["/practice/#minimum-amount-of-damage-dealt-to-bob","Solution"]]],[3274,"Check if Two Chessboard Squares Have the Same Color","check-if-two-chessboard-squares-have-the-same-color",0,[95,155],[["/practice/#check-if-two-chessboard-squares-have-the-same-color","Solution"]]],[3275,"K-th Nearest Obstacle Queries","k-th-nearest-obstacle-queries",0,[6,72],[["/practice/#k-th-nearest-obstacle-queries","Solution"]]],[3276,"Select Cells in Grid With Maximum Score","select-cells-in-grid-with-maximum-score",0,[18,6,48,19,96],[["/practice/#select-cells-in-grid-with-maximum-score","Solution"]]],[3277,"Maximum XOR Score Subarray Queries","maximum-xor-score-subarray-queries",0,[6,48],[["/practice/#maximum-xor-score-subarray-queries","Solution"]]],[3278,"Find Candidates for Data Scientist Position II","find-candidates-for-data-scientist-position-ii",1,[40],[["/practice/#find-candidates-for-data-scientist-position-ii","Solution"]]],[3279,"Maximum Total Area Occupied by Pistons","maximum-total-area-occupied-by-pistons",0,[6,71,155,36,122,145],[["/practice/#maximum-total-area-occupied-by-pistons","Solution"]]],[3280,"Convert Date to Binary","convert-date-to-binary",0,[95,155],[["/practice/#convert-date-to-binary","Solution"]]],[3281,"Maximize Score of Numbers in Ranges","maximize-score-of-numbers-in-ranges",0,[68,6,14,150],[["/practice/#maximize-score-of-numbers-in-ranges","Solution"]]],[3282,"Reach End of Array With Max Score","reach-end-of-array-with-max-score",0,[68,6],[["/practice/#reach-end-of-array-with-max-score","Solution"]]],[3283,"Maximum Number of Moves to Kill All Pawns","maximum-number-of-moves-to-kill-all-pawns",0,[18,25,6,95,19,62],[["/practice/#maximum-number-of-moves-to-kill-all-pawns","Solution"]]],[3284,"Sum of Consecutive Subarrays","sum-of-consecutive-subarrays",0,[6,172,48],[["/practice/#sum-of-consecutive-subarrays","Solution"]]],[3285,"Find Indices of Stable Mountains","find-indices-of-stable-mountains",0,[6],[["/practice/#find-indices-of-stable-mountains","Solution"]]],[3286,"Find a Safe Walk Through a Grid","find-a-safe-walk-through-a-grid",0,[25,64,6,96,142,72],[["/practice/#find-a-safe-walk-through-a-grid","Solution"]]],[3287,"Find the Maximum Sequence Value of Array","find-the-maximum-sequence-value-of-array",0,[18,6,48],[["/practice/#find-the-maximum-sequence-value-of-array","Solution"]]],[3288,"Length of the Longest Increasing Path","length-of-the-longest-increasing-path",0,[6,14,150,90],[["/practice/#length-of-the-longest-increasing-path","Solution"]]],[3289,"The Two Sneaky Numbers of Digitville","the-two-sneaky-numbers-of-digitville",0,[6,71,95],[["/practice/#the-two-sneaky-numbers-of-digitville","Solution"]]],[3290,"Maximum Multiplication Score","maximum-multiplication-score",0,[6,48],[["/practice/#maximum-multiplication-score","Solution"]]],[3291,"Minimum Number of Valid Strings to Form Target I","minimum-number-of-valid-strings-to-form-target-i",0,[68,171,139,6,155,14,48,156,70,137],[["/practice/#minimum-number-of-valid-strings-to-form-target-i","Solution"]]],[3292,"Minimum Number of Valid Strings to Form Target II","minimum-number-of-valid-strings-to-form-target-ii",0,[68,139,6,155,14,48,156,70,137],[["/practice/#minimum-number-of-valid-strings-to-form-target-ii","Solution"]]],[3293,"Calculate Product Final Price","calculate-product-final-price",1,[40],[["/practice/#calculate-product-final-price","Solution"]]],[3294,"Convert Doubly Linked List to Array II","convert-doubly-linked-list-to-array-ii",0,[6,88,47],[["/practice/#convert-doubly-linked-list-to-array-ii","Solution"]]],[3295,"Report Spam Message","report-spam-message",0,[6,71,155],[["/practice/#report-spam-message","Solution"]]],[3296,"Minimum Number of Seconds to Make Mountain Height Zero","minimum-number-of-seconds-to-make-mountain-height-zero",0,[68,6,95,14,72],[["/practice/#minimum-number-of-seconds-to-make-mountain-height-zero","Solution"]]],[3297,"Count Substrings That Can Be Rearranged to Contain a String I","count-substrings-that-can-be-rearranged-to-contain-a-string-i",0,[71,155,146],[["/practice/#count-substrings-that-can-be-rearranged-to-contain-a-string-i","Solution"]]],[3298,"Count Substrings That Can Be Rearranged to Contain a String II","count-substrings-that-can-be-rearranged-to-contain-a-string-ii",0,[71,155,146],[["/practice/#count-substrings-that-can-be-rearranged-to-contain-a-string-ii","Solution"]]],[3299,"Sum of Consecutive Subsequences","sum-of-consecutive-subsequences",0,[6,71,48],[["/practice/#sum-of-consecutive-subsequences","Solution"]]],[3300,"Minimum Element After Replacement With Digit Sum","minimum-element-after-replacement-with-digit-sum",0,[6,95],[["/practice/#minimum-element-after-replacement-with-digit-sum","Solution"]]],[3301,"Maximize the Total Height of Unique Towers","maximize-the-total-height-of-unique-towers",0,[68,6,150],[["/practice/#maximize-the-total-height-of-unique-towers","Solution"]]],[3302,"Find the Lexicographically Smallest Valid Sequence","find-the-lexicographically-smallest-valid-sequence",0,[68,172,155,48],[["/practice/#find-the-lexicographically-smallest-valid-sequence","Solution"]]],[3303,"Find the Occurrence of First Almost Equal Substring","find-the-occurrence-of-first-almost-equal-substring",0,[155,156,81],[["/practice/#find-the-occurrence-of-first-almost-equal-substring","Solution"]]],[3304,"Find the K-th Character in String Game I","find-the-k-th-character-in-string-game-i",0,[18,134,95,145],[["/practice/#find-the-k-th-character-in-string-game-i","Solution"]]],[3305,"Count of Substrings Containing Every Vowel and K Consonants I","count-of-substrings-containing-every-vowel-and-k-consonants-i",0,[71,155,146],[["/practice/#count-of-substrings-containing-every-vowel-and-k-consonants-i","Solution"]]],[3306,"Count of Substrings Containing Every Vowel and K Consonants II","count-of-substrings-containing-every-vowel-and-k-consonants-ii",0,[71,155,146],[["/practice/#count-of-substrings-containing-every-vowel-and-k-consonants-ii","Solution"]]],[3307,"Find the K-th Character in String Game II","find-the-k-th-character-in-string-game-ii",0,[18,134,95],[["/practice/#find-the-k-th-character-in-string-game-ii","Solution"]]],[3308,"Find Top Performing Driver","find-top-performing-driver",1,[40],[["/practice/#find-top-performing-driver","Solution"]]],[3309,"Maximum Possible Number by Binary Concatenation","maximum-possible-number-by-binary-concatenation",0,[18,6,50],[["/practice/#maximum-possible-number-by-binary-concatenation","Solution"]]],[3310,"Remove Methods From Project","remove-methods-from-project",0,[41,25,64],[["/practice/#remove-methods-from-project","Solution"]]],[3311,"Construct 2D Grid Matching Graph Layout","construct-2d-grid-matching-graph-layout",0,[64,6,71,96],[["/practice/#construct-2d-grid-matching-graph-layout","Solution"]]],[3312,"Sorted GCD Pair Queries","sorted-gcd-pair-queries",0,[6,71,95,14,33,36,67,112,122,51],[["/practice/#sorted-gcd-pair-queries","Solution"]]],[3313,"Find the Last Marked Nodes in Tree","find-the-last-marked-nodes-in-tree",0,[168,41],[["/practice/#find-the-last-marked-nodes-in-tree","Solution"]]],[3314,"Construct the Minimum Bitwise Array I","construct-the-minimum-bitwise-array-i",0,[18,6],[["/practice/#construct-the-minimum-bitwise-array-i","Solution"]]],[3315,"Construct the Minimum Bitwise Array II","construct-the-minimum-bitwise-array-ii",0,[18,6],[["/practice/#construct-the-minimum-bitwise-array-ii","Solution"]]],[3316,"Find Maximum Removals From Source String","find-maximum-removals-from-source-string",0,[6,71,172,155,48],[["/practice/#find-maximum-removals-from-source-string","Solution"]]],[3317,"Find the Number of Possible Ways for an Event","find-the-number-of-possible-ways-for-an-event",0,[95,48,33],[["/practice/#find-the-number-of-possible-ways-for-an-event","Solution"]]],[3318,"Find X-Sum of All K-Long Subarrays I","find-x-sum-of-all-k-long-subarrays-i",0,[6,71,146,72],[["/practice/#find-x-sum-of-all-k-long-subarrays-i","Solution"]]],[3319,"K-th Largest Perfect Subtree Size in Binary Tree","k-th-largest-perfect-subtree-size-in-binary-tree",0,[168,41,16,150],[["/practice/#k-th-largest-perfect-subtree-size-in-binary-tree","Solution"]]],[3320,"Count The Number of Winning Sequences","count-the-number-of-winning-sequences",0,[155,48],[["/practice/#count-the-number-of-winning-sequences","Solution"]]],[3321,"Find X-Sum of All K-Long Subarrays II","find-x-sum-of-all-k-long-subarrays-ii",0,[6,71,146,72],[["/practice/#find-x-sum-of-all-k-long-subarrays-ii","Solution"]]],[3322,"Premier League Table Ranking III","premier-league-table-ranking-iii",1,[40],[["/practice/#premier-league-table-ranking-iii","Solution"]]],[3323,"Minimize Connected Groups by Inserting Interval","minimize-connected-groups-by-inserting-interval",0,[6,14,150,146],[["/practice/#minimize-connected-groups-by-inserting-interval","Solution"]]],[3324,"Find the Sequence of Strings Appeared on the Screen","find-the-sequence-of-strings-appeared-on-the-screen",0,[155,145],[["/practice/#find-the-sequence-of-strings-appeared-on-the-screen","Solution"]]],[3325,"Count Substrings With K-Frequency Characters I","count-substrings-with-k-frequency-characters-i",0,[71,155,146],[["/practice/#count-substrings-with-k-frequency-characters-i","Solution"]]],[3326,"Minimum Division Operations to Make Array Non Decreasing","minimum-division-operations-to-make-array-non-decreasing",0,[68,6,95,112],[["/practice/#minimum-division-operations-to-make-array-non-decreasing","Solution"]]],[3327,"Check if DFS Strings Are Palindromes","check-if-dfs-strings-are-palindromes",0,[168,41,6,71,155,70],[["/practice/#check-if-dfs-strings-are-palindromes","Solution"]]],[3328,"Find Cities in Each State II","find-cities-in-each-state-ii",1,[40],[["/practice/#find-cities-in-each-state-ii","Solution"]]],[3329,"Count Substrings With K-Frequency Characters II","count-substrings-with-k-frequency-characters-ii",0,[71,155,146],[["/practice/#count-substrings-with-k-frequency-characters-ii","Solution"]]],[3330,"Find the Original Typed String I","find-the-original-typed-string-i",0,[155],[["/practice/#find-the-original-typed-string-i","Solution"]]],[3331,"Find Subtree Sizes After Changes","find-subtree-sizes-after-changes",0,[168,41,6,71,155],[["/practice/#find-subtree-sizes-after-changes","Solution"]]],[3332,"Maximum Points Tourist Can Earn","maximum-points-tourist-can-earn",0,[6,48,96],[["/practice/#maximum-points-tourist-can-earn","Solution"]]],[3333,"Find the Original Typed String II","find-the-original-typed-string-ii",0,[155,48,122],[["/practice/#find-the-original-typed-string-ii","Solution"]]],[3334,"Find the Maximum Factor Score of Array","find-the-maximum-factor-score-of-array",0,[6,95,112,85],[["/practice/#find-the-maximum-factor-score-of-array","Solution"]]],[3335,"Total Characters in String After Transformations I","total-characters-in-string-after-transformations-i",0,[71,95,155,48,36],[["/practice/#total-characters-in-string-after-transformations-i","Solution"]]],[3336,"Find the Number of Subsequences With Equal GCD","find-the-number-of-subsequences-with-equal-gcd",0,[6,95,48,67,112,51],[["/practice/#find-the-number-of-subsequences-with-equal-gcd","Solution"]]],[3337,"Total Characters in String After Transformations II","total-characters-in-string-after-transformations-ii",0,[71,95,155,48,36],[["/practice/#total-characters-in-string-after-transformations-ii","Solution"]]],[3338,"Second Highest Salary II","second-highest-salary-ii",1,[40],[["/practice/#second-highest-salary-ii","Solution"]]],[3339,"Find the Number of K-Even Arrays","find-the-number-of-k-even-arrays",0,[48],[["/practice/#find-the-number-of-k-even-arrays","Solution"]]],[3340,"Check Balanced String","check-balanced-string",0,[155],[["/practice/#check-balanced-string","Solution"]]],[3341,"Find Minimum Time to Reach Last Room I","find-minimum-time-to-reach-last-room-i",0,[64,6,96,142,72],[["/practice/#find-minimum-time-to-reach-last-room-i","Solution"]]],[3342,"Find Minimum Time to Reach Last Room II","find-minimum-time-to-reach-last-room-ii",0,[64,6,96,142,72],[["/practice/#find-minimum-time-to-reach-last-room-ii","Solution"]]],[3343,"Count Number of Balanced Permutations","count-number-of-balanced-permutations",0,[95,155,48,33],[["/practice/#count-number-of-balanced-permutations","Solution"]]],[3344,"Maximum Sized Array","maximum-sized-array",0,[18,14],[["/practice/#maximum-sized-array","Solution"]]],[3345,"Smallest Divisible Digit Product I","smallest-divisible-digit-product-i",0,[95,50],[["/practice/#smallest-divisible-digit-product-i","Solution"]]],[3346,"Maximum Frequency of an Element After Performing Operations I","maximum-frequency-of-an-element-after-performing-operations-i",0,[6,14,122,150,146],[["/practice/#maximum-frequency-of-an-element-after-performing-operations-i","Solution"]]],[3347,"Maximum Frequency of an Element After Performing Operations II","maximum-frequency-of-an-element-after-performing-operations-ii",0,[6,14,122,150,146],[["/practice/#maximum-frequency-of-an-element-after-performing-operations-ii","Solution"]]],[3348,"Smallest Divisible Digit Product II","smallest-divisible-digit-product-ii",0,[68,95,155,8,112],[["/practice/#smallest-divisible-digit-product-ii","Solution"]]],[3349,"Adjacent Increasing Subarrays Detection I","adjacent-increasing-subarrays-detection-i",0,[6],[["/practice/#adjacent-increasing-subarrays-detection-i","Solution"]]],[3350,"Adjacent Increasing Subarrays Detection II","adjacent-increasing-subarrays-detection-ii",0,[6,14],[["/practice/#adjacent-increasing-subarrays-detection-ii","Solution"]]],[3351,"Sum of Good Subsequences","sum-of-good-subsequences",0,[6,71,48],[["/practice/#sum-of-good-subsequences","Solution"]]],[3352,"Count K-Reducible Numbers Less Than N","count-k-reducible-numbers-less-than-n",0,[95,155,48,33],[["/practice/#count-k-reducible-numbers-less-than-n","Solution"]]],[3353,"Minimum Total Operations","minimum-total-operations",0,[6],[["/practice/#minimum-total-operations","Solution"]]],[3354,"Make Array Elements Equal to Zero","make-array-elements-equal-to-zero",0,[6,122,145],[["/practice/#make-array-elements-equal-to-zero","Solution"]]],[3355,"Zero Array Transformation I","zero-array-transformation-i",0,[6,122],[["/practice/#zero-array-transformation-i","Solution"]]],[3356,"Zero Array Transformation II","zero-array-transformation-ii",0,[6,172,14,122],[["/practice/#zero-array-transformation-ii","Solution"]]],[3357,"Minimize the Maximum Adjacent Element Difference","minimize-the-maximum-adjacent-element-difference",0,[68,6,14],[["/practice/#minimize-the-maximum-adjacent-element-difference","Solution"]]],[3358,"Books with NULL Ratings","books-with-null-ratings",1,[40],[["/practice/#books-with-null-ratings","Solution"]]],[3359,"Find Sorted Submatrices With Maximum Element at Most K","find-sorted-submatrices-with-maximum-element-at-most-k",0,[154,6,96,108],[["/practice/#find-sorted-submatrices-with-maximum-element-at-most-k","Solution"]]],[3360,"Stone Removal Game","stone-removal-game",0,[95,145],[["/practice/#stone-removal-game","Solution"]]],[3361,"Shift Distance Between Two Strings","shift-distance-between-two-strings",0,[6,155,122],[["/practice/#shift-distance-between-two-strings","Solution"]]],[3362,"Zero Array Transformation III","zero-array-transformation-iii",0,[68,6,172,122,150,72],[["/practice/#zero-array-transformation-iii","Solution"]]],[3363,"Find the Maximum Number of Fruits Collected","find-the-maximum-number-of-fruits-collected",0,[6,48,96],[["/practice/#find-the-maximum-number-of-fruits-collected","Solution"]]],[3364,"Minimum Positive Sum Subarray ","minimum-positive-sum-subarray",0,[6,122,146],[["/practice/#minimum-positive-sum-subarray","Solution"]]],[3365,"Rearrange K Substrings to Form Target String","rearrange-k-substrings-to-form-target-string",0,[71,155,150],[["/practice/#rearrange-k-substrings-to-form-target-string","Solution"]]],[3366,"Minimum Array Sum","minimum-array-sum",0,[6,48],[["/practice/#minimum-array-sum","Solution"]]],[3367,"Maximize Sum of Weights after Edge Removals","maximize-sum-of-weights-after-edge-removals",0,[168,41,48,150],[["/practice/#maximize-sum-of-weights-after-edge-removals","Solution"]]],[3368,"First Letter Capitalization","first-letter-capitalization",1,[40],[["/practice/#first-letter-capitalization","Solution"]]],[3369,"Design an Array Statistics Tracker ","design-an-array-statistics-tracker",0,[42,128,71,14,39,113,72],[["/practice/#design-an-array-statistics-tracker","Solution"]]],[3370,"Smallest Number With All Set Bits","smallest-number-with-all-set-bits",0,[18,95],[["/practice/#smallest-number-with-all-set-bits","Solution"]]],[3371,"Identify the Largest Outlier in an Array","identify-the-largest-outlier-in-an-array",0,[6,71,36,50],[["/practice/#identify-the-largest-outlier-in-an-array","Solution"]]],[3372,"Maximize the Number of Target Nodes After Connecting Trees I","maximize-the-number-of-target-nodes-after-connecting-trees-i",0,[168,41,25],[["/practice/#maximize-the-number-of-target-nodes-after-connecting-trees-i","Solution"]]],[3373,"Maximize the Number of Target Nodes After Connecting Trees II","maximize-the-number-of-target-nodes-after-connecting-trees-ii",0,[168,41,25],[["/practice/#maximize-the-number-of-target-nodes-after-connecting-trees-ii","Solution"]]],[3374,"First Letter Capitalization II","first-letter-capitalization-ii",1,[40],[["/practice/#first-letter-capitalization-ii","Problem details"]]],[3375,"Minimum Operations to Make Array Values Equal to K","minimum-operations-to-make-array-values-equal-to-k",0,[6,71],[["/practice/#minimum-operations-to-make-array-values-equal-to-k","Solution"]]],[3376,"Minimum Time to Break Locks I","minimum-time-to-break-locks-i",0,[18,25,6,48,8,19],[["/practice/#minimum-time-to-break-locks-i","Solution"]]],[3377,"Digit Operations to Make Two Integers Equal","digit-operations-to-make-two-integers-equal",0,[64,95,112,142,72],[["/practice/#digit-operations-to-make-two-integers-equal","Solution"]]],[3378,"Count Connected Components in LCM Graph","count-connected-components-in-lcm-graph",0,[174,6,71,95,67,112,51,85],[["/practice/#count-connected-components-in-lcm-graph","Solution"]]],[3379,"Transformed Array","transformed-array",0,[6,145],[["/practice/#transformed-array","Solution"]]],[3380,"Maximum Area Rectangle With Point Constraints I","maximum-area-rectangle-with-point-constraints-i",0,[12,139,63,6,95,50,150],[["/practice/#maximum-area-rectangle-with-point-constraints-i","Solution"]]],[3381,"Maximum Subarray Sum With Length Divisible by K","maximum-subarray-sum-with-length-divisible-by-k",0,[6,71,122],[["/practice/#maximum-subarray-sum-with-length-divisible-by-k","Solution"]]],[3382,"Maximum Area Rectangle With Point Constraints II","maximum-area-rectangle-with-point-constraints-ii",0,[12,139,63,6,95,150],[["/practice/#maximum-area-rectangle-with-point-constraints-ii","Solution"]]],[3383,"Minimum Runes to Add to Cast Spell","minimum-runes-to-add-to-cast-spell",0,[41,25,64,165,6],[["/practice/#minimum-runes-to-add-to-cast-spell","Solution"]]],[3384,"Team Dominance by Pass Success","team-dominance-by-pass-success",1,[40],[["/practice/#team-dominance-by-pass-success","Solution"]]],[3385,"Minimum Time to Break Locks II","minimum-time-to-break-locks-ii",0,[25,64,6],[["/practice/#minimum-time-to-break-locks-ii","Solution"]]],[3386,"Button with Longest Push Time","button-with-longest-push-time",0,[6],[["/practice/#button-with-longest-push-time","Solution"]]],[3387,"Maximize Amount After Two Days of Conversions","maximize-amount-after-two-days-of-conversions",0,[41,25,64,6,155],[["/practice/#maximize-amount-after-two-days-of-conversions","Solution"]]],[3388,"Count Beautiful Splits in an Array","count-beautiful-splits-in-an-array",0,[6,48],[["/practice/#count-beautiful-splits-in-an-array","Solution"]]],[3389,"Minimum Operations to Make Character Frequencies Equal","minimum-operations-to-make-character-frequencies-equal",0,[71,155,48,36,50],[["/practice/#minimum-operations-to-make-character-frequencies-equal","Solution"]]],[3390,"Longest Team Pass Streak","longest-team-pass-streak",1,[40],[["/practice/#longest-team-pass-streak","Solution"]]],[3391,"Design a 3D Binary Matrix with Efficient Layer Tracking","design-a-3d-binary-matrix-with-efficient-layer-tracking",0,[42,6,71,96,113,72],[["/practice/#design-a-3d-binary-matrix-with-efficient-layer-tracking","Solution"]]],[3392,"Count Subarrays of Length Three With a Condition","count-subarrays-of-length-three-with-a-condition",0,[6],[["/practice/#count-subarrays-of-length-three-with-a-condition","Solution"]]],[3393,"Count Paths With the Given XOR Value","count-paths-with-the-given-xor-value",0,[18,6,48,96],[["/practice/#count-paths-with-the-given-xor-value","Solution"]]],[3394,"Check if Grid can be Cut into Sections","check-if-grid-can-be-cut-into-sections",0,[6,150],[["/practice/#check-if-grid-can-be-cut-into-sections","Solution"]]],[3395,"Subsequences with a Unique Middle Mode I","subsequences-with-a-unique-middle-mode-i",0,[6,71,95,33],[["/practice/#subsequences-with-a-unique-middle-mode-i","Solution"]]],[3396,"Minimum Number of Operations to Make Elements in Array Distinct","minimum-number-of-operations-to-make-elements-in-array-distinct",0,[6,71],[["/practice/#minimum-number-of-operations-to-make-elements-in-array-distinct","Solution"]]],[3397,"Maximum Number of Distinct Elements After Operations","maximum-number-of-distinct-elements-after-operations",0,[68,6,150],[["/practice/#maximum-number-of-distinct-elements-after-operations","Solution"]]],[3398,"Smallest Substring With Identical Characters I","smallest-substring-with-identical-characters-i",0,[6,14,50],[["/practice/#smallest-substring-with-identical-characters-i","Solution"]]],[3399,"Smallest Substring With Identical Characters II","smallest-substring-with-identical-characters-ii",0,[155,14],[["/practice/#smallest-substring-with-identical-characters-ii","Solution"]]],[3400,"Maximum Number of Matching Indices After Right Shifts","maximum-number-of-matching-indices-after-right-shifts",0,[6,172,145],[["/practice/#maximum-number-of-matching-indices-after-right-shifts","Solution"]]],[3401,"Find Circular Gift Exchange Chains","find-circular-gift-exchange-chains",1,[40],[["/practice/#find-circular-gift-exchange-chains","Problem details"]]],[3402,"Minimum Operations to Make Columns Strictly Increasing","minimum-operations-to-make-columns-strictly-increasing",0,[68,6,96],[["/practice/#minimum-operations-to-make-columns-strictly-increasing","Solution"]]],[3403,"Find the Lexicographically Largest String From the Box I","find-the-lexicographically-largest-string-from-the-box-i",0,[172,155,50],[["/practice/#find-the-lexicographically-largest-string-from-the-box-i","Solution"]]],[3404,"Count Special Subsequences","count-special-subsequences",0,[6,71,95,50],[["/practice/#count-special-subsequences","Solution"]]],[3405,"Count the Number of Arrays with K Matching Adjacent Elements","count-the-number-of-arrays-with-k-matching-adjacent-elements",0,[95,33,59],[["/practice/#count-the-number-of-arrays-with-k-matching-adjacent-elements","Solution"]]],[3406,"Find the Lexicographically Largest String From the Box II","find-the-lexicographically-largest-string-from-the-box-ii",0,[172,155],[["/practice/#find-the-lexicographically-largest-string-from-the-box-ii","Solution"]]],[3407,"Substring Matching Pattern","substring-matching-pattern",0,[155,156],[["/practice/#substring-matching-pattern","Solution"]]],[3408,"Design Task Manager","design-task-manager",0,[42,71,113,72],[["/practice/#design-task-manager","Solution"]]],[3409,"Longest Subsequence With Decreasing Adjacent Difference","longest-subsequence-with-decreasing-adjacent-difference",0,[6,48],[["/practice/#longest-subsequence-with-decreasing-adjacent-difference","Solution"]]],[3410,"Maximize Subarray Sum After Removing All Occurrences of One Element","maximize-subarray-sum-after-removing-all-occurrences-of-one-element",0,[139,6,71,46,48,122],[["/practice/#maximize-subarray-sum-after-removing-all-occurrences-of-one-element","Solution"]]],[3411,"Maximum Subarray With Equal Products","maximum-subarray-with-equal-products",0,[6,95,50,112,146],[["/practice/#maximum-subarray-with-equal-products","Solution"]]],[3412,"Find Mirror Score of a String","find-mirror-score-of-a-string",0,[154,71,155,145],[["/practice/#find-mirror-score-of-a-string","Solution"]]],[3413,"Maximum Coins From K Consecutive Bags","maximum-coins-from-k-consecutive-bags",0,[68,6,14,122,150,146],[["/practice/#maximum-coins-from-k-consecutive-bags","Solution"]]],[3414,"Maximum Score of Non-overlapping Intervals","maximum-score-of-non-overlapping-intervals",0,[6,14,48,150],[["/practice/#maximum-score-of-non-overlapping-intervals","Solution"]]],[3415,"Find Products with Three Consecutive Digits ","find-products-with-three-consecutive-digits",1,[40],[["/practice/#find-products-with-three-consecutive-digits","Solution"]]],[3416,"Subsequences with a Unique Middle Mode II","subsequences-with-a-unique-middle-mode-ii",0,[6,71,95,33],[["/practice/#subsequences-with-a-unique-middle-mode-ii","Solution"]]],[3417,"Zigzag Grid Traversal With Skip","zigzag-grid-traversal-with-skip",0,[6,96,145],[["/practice/#zigzag-grid-traversal-with-skip","Solution"]]],[3418,"Maximum Amount of Money Robot Can Earn","maximum-amount-of-money-robot-can-earn",0,[6,48,96],[["/practice/#maximum-amount-of-money-robot-can-earn","Solution"]]],[3419,"Minimize the Maximum Edge Weight of Graph","minimize-the-maximum-edge-weight-of-graph",0,[41,25,64,14,142],[["/practice/#minimize-the-maximum-edge-weight-of-graph","Solution"]]],[3420,"Count Non-Decreasing Subarrays After K Operations","count-non-decreasing-subarrays-after-k-operations",0,[154,139,128,6,146,107,108],[["/practice/#count-non-decreasing-subarrays-after-k-operations","Solution"]]],[3421,"Find Students Who Improved","find-students-who-improved",1,[40],[["/practice/#find-students-who-improved","Solution"]]],[3422,"Minimum Operations to Make Subarray Elements Equal","minimum-operations-to-make-subarray-elements-equal",0,[6,71,95,146,72],[["/practice/#minimum-operations-to-make-subarray-elements-equal","Solution"]]],[3423,"Maximum Difference Between Adjacent Elements in a Circular Array","maximum-difference-between-adjacent-elements-in-a-circular-array",0,[6],[["/practice/#maximum-difference-between-adjacent-elements-in-a-circular-array","Solution"]]],[3424,"Minimum Cost to Make Arrays Identical","minimum-cost-to-make-arrays-identical",0,[68,6,150],[["/practice/#minimum-cost-to-make-arrays-identical","Solution"]]],[3425,"Longest Special Path","longest-special-path",0,[168,41,6,71,122],[["/practice/#longest-special-path","Solution"]]],[3426,"Manhattan Distances of All Arrangements of Pieces","manhattan-distances-of-all-arrangements-of-pieces",0,[95,33],[["/practice/#manhattan-distances-of-all-arrangements-of-pieces","Solution"]]],[3427,"Sum of Variable Length Subarrays","sum-of-variable-length-subarrays",0,[6,122],[["/practice/#sum-of-variable-length-subarrays","Solution"]]],[3428,"Maximum and Minimum Sums of at Most Size K Subsequences","maximum-and-minimum-sums-of-at-most-size-k-subsequences",0,[6,95,48,33,150],[["/practice/#maximum-and-minimum-sums-of-at-most-size-k-subsequences","Solution"]]],[3429,"Paint House IV","paint-house-iv",0,[6,48],[["/practice/#paint-house-iv","Solution"]]],[3430,"Maximum and Minimum Sums of at Most Size K Subarrays","maximum-and-minimum-sums-of-at-most-size-k-subarrays",0,[154,6,95,108],[["/practice/#maximum-and-minimum-sums-of-at-most-size-k-subarrays","Solution"]]],[3431,"Minimum Unlocked Indices to Sort Nums","minimum-unlocked-indices-to-sort-nums",0,[6,71],[["/practice/#minimum-unlocked-indices-to-sort-nums","Solution"]]],[3432,"Count Partitions with Even Sum Difference","count-partitions-with-even-sum-difference",0,[6,95,122],[["/practice/#count-partitions-with-even-sum-difference","Solution"]]],[3433,"Count Mentions Per User","count-mentions-per-user",0,[6,95,150,145],[["/practice/#count-mentions-per-user","Solution"]]],[3434,"Maximum Frequency After Subarray Operation","maximum-frequency-after-subarray-operation",0,[68,6,71,48,50,122],[["/practice/#maximum-frequency-after-subarray-operation","Solution"]]],[3435,"Frequencies of Shortest Supersequences","frequencies-of-shortest-supersequences",0,[18,64,165,6,155,50],[["/practice/#frequencies-of-shortest-supersequences","Solution"]]],[3436,"Find Valid Emails","find-valid-emails",1,[40],[["/practice/#find-valid-emails","Solution"]]],[3437,"Permutations III","permutations-iii",0,[6,8],[["/practice/#permutations-iii","Solution"]]],[3438,"Find Valid Pair of Adjacent Digits in String","find-valid-pair-of-adjacent-digits-in-string",0,[71,155,36],[["/practice/#find-valid-pair-of-adjacent-digits-in-string","Solution"]]],[3439,"Reschedule Meetings for Maximum Free Time I","reschedule-meetings-for-maximum-free-time-i",0,[68,6,146],[["/practice/#reschedule-meetings-for-maximum-free-time-i","Solution"]]],[3440,"Reschedule Meetings for Maximum Free Time II","reschedule-meetings-for-maximum-free-time-ii",0,[68,6,50],[["/practice/#reschedule-meetings-for-maximum-free-time-ii","Solution"]]],[3441,"Minimum Cost Good Caption","minimum-cost-good-caption",0,[155,48],[["/practice/#minimum-cost-good-caption","Solution"]]],[3442,"Maximum Difference Between Even and Odd Frequency I","maximum-difference-between-even-and-odd-frequency-i",0,[71,155,36],[["/practice/#maximum-difference-between-even-and-odd-frequency-i","Solution"]]],[3443,"Maximum Manhattan Distance After K Changes","maximum-manhattan-distance-after-k-changes",0,[71,95,155,36],[["/practice/#maximum-manhattan-distance-after-k-changes","Solution"]]],[3444,"Minimum Increments for Target Multiples in an Array","minimum-increments-for-target-multiples-in-an-array",0,[18,6,95,48,19,112],[["/practice/#minimum-increments-for-target-multiples-in-an-array","Solution"]]],[3445,"Maximum Difference Between Even and Odd Frequency II","maximum-difference-between-even-and-odd-frequency-ii",0,[155,50,122,146],[["/practice/#maximum-difference-between-even-and-odd-frequency-ii","Solution"]]],[3446,"Sort Matrix by Diagonals","sort-matrix-by-diagonals",0,[6,96,150],[["/practice/#sort-matrix-by-diagonals","Solution"]]],[3447,"Assign Elements to Groups with Constraints","assign-elements-to-groups-with-constraints",0,[6,71],[["/practice/#assign-elements-to-groups-with-constraints","Solution"]]],[3448,"Count Substrings Divisible By Last Digit","count-substrings-divisible-by-last-digit",0,[155,48],[["/practice/#count-substrings-divisible-by-last-digit","Solution"]]],[3449,"Maximize the Minimum Game Score","maximize-the-minimum-game-score",0,[68,6,14],[["/practice/#maximize-the-minimum-game-score","Solution"]]],[3450,"Maximum Students on a Single Bench","maximum-students-on-a-single-bench",0,[6,71],[["/practice/#maximum-students-on-a-single-bench","Solution"]]],[3451,"Find Invalid IP Addresses","find-invalid-ip-addresses",1,[40],[["/practice/#find-invalid-ip-addresses","Solution"]]],[3452,"Sum of Good Numbers","sum-of-good-numbers",0,[6],[["/practice/#sum-of-good-numbers","Solution"]]],[3453,"Separate Squares I","separate-squares-i",0,[6,14],[["/practice/#separate-squares-i","Solution"]]],[3454,"Separate Squares II","separate-squares-ii",0,[139,6,14,161],[["/practice/#separate-squares-ii","Solution"]]],[3455,"Shortest Matching Substring","shortest-matching-substring",0,[172,155,14,156],[["/practice/#shortest-matching-substring","Solution"]]],[3456,"Find Special Substring of Length K","find-special-substring-of-length-k",0,[155],[["/practice/#find-special-substring-of-length-k","Solution"]]],[3457,"Eat Pizzas!","eat-pizzas",0,[68,6,150],[["/practice/#eat-pizzas","Solution"]]],[3458,"Select K Disjoint Special Substrings","select-k-disjoint-special-substrings",0,[68,71,155,48,150],[["/practice/#select-k-disjoint-special-substrings","Solution"]]],[3459,"Length of Longest V-Shaped Diagonal Segment","length-of-longest-v-shaped-diagonal-segment",0,[100,6,48,96],[["/practice/#length-of-longest-v-shaped-diagonal-segment","Solution"]]],[3460,"Longest Common Prefix After at Most One Removal","longest-common-prefix-after-at-most-one-removal",0,[172,155],[["/practice/#longest-common-prefix-after-at-most-one-removal","Solution"]]],[3461,"Check If Digits Are Equal in String After Operations I","check-if-digits-are-equal-in-string-after-operations-i",0,[95,155,33,112,145],[["/practice/#check-if-digits-are-equal-in-string-after-operations-i","Solution"]]],[3462,"Maximum Sum With at Most K Elements","maximum-sum-with-at-most-k-elements",0,[68,6,96,150,72],[["/practice/#maximum-sum-with-at-most-k-elements","Solution"]]],[3463,"Check If Digits Are Equal in String After Operations II","check-if-digits-are-equal-in-string-after-operations-ii",0,[95,155,33,112],[["/practice/#check-if-digits-are-equal-in-string-after-operations-ii","Solution"]]],[3464,"Maximize the Distance Between Points on a Square","maximize-the-distance-between-points-on-a-square",0,[63,6,95,14,150],[["/practice/#maximize-the-distance-between-points-on-a-square","Solution"]]],[3465,"Find Products with Valid Serial Numbers","find-products-with-valid-serial-numbers",1,[40],[["/practice/#find-products-with-valid-serial-numbers","Solution"]]],[3466,"Maximum Coin Collection ","maximum-coin-collection",0,[6,48],[["/practice/#maximum-coin-collection","Solution"]]],[3467,"Transform Array by Parity","transform-array-by-parity",0,[6,36,150],[["/practice/#transform-array-by-parity","Solution"]]],[3468,"Find the Number of Copy Arrays","find-the-number-of-copy-arrays",0,[6,95],[["/practice/#find-the-number-of-copy-arrays","Solution"]]],[3469,"Find Minimum Cost to Remove Array Elements","find-minimum-cost-to-remove-array-elements",0,[],[["/practice/#find-minimum-cost-to-remove-array-elements","Solution"]]],[3470,"Permutations IV","permutations-iv",0,[6,95,33,50],[["/practice/#permutations-iv","Solution"]]],[3471,"Find the Largest Almost Missing Integer","find-the-largest-almost-missing-integer",0,[6,71],[["/practice/#find-the-largest-almost-missing-integer","Solution"]]],[3472,"Longest Palindromic Subsequence After at Most K Operations","longest-palindromic-subsequence-after-at-most-k-operations",0,[155,48],[["/practice/#longest-palindromic-subsequence-after-at-most-k-operations","Solution"]]],[3473,"Sum of K Subarrays With Length at Least M","sum-of-k-subarrays-with-length-at-least-m",0,[6,48,122],[["/practice/#sum-of-k-subarrays-with-length-at-least-m","Solution"]]],[3474,"Lexicographically Smallest Generated String","lexicographically-smallest-generated-string",0,[68,155,156],[["/practice/#lexicographically-smallest-generated-string","Solution"]]],[3475,"DNA Pattern Recognition ","dna-pattern-recognition",1,[40],[["/practice/#dna-pattern-recognition","Solution"]]],[3476,"Maximize Profit from Task Assignment","maximize-profit-from-task-assignment",0,[68,6,150,72],[["/practice/#maximize-profit-from-task-assignment","Solution"]]],[3477,"Fruits Into Baskets II","fruits-into-baskets-ii",0,[139,6,14,113,145],[["/practice/#fruits-into-baskets-ii","Solution"]]],[3478,"Choose K Elements With Maximum Sum","choose-k-elements-with-maximum-sum",0,[6,150,72],[["/practice/#choose-k-elements-with-maximum-sum","Solution"]]],[3479,"Fruits Into Baskets III","fruits-into-baskets-iii",0,[139,6,14,113],[["/practice/#fruits-into-baskets-iii","Solution"]]],[3480,"Maximize Subarrays After Removing One Conflicting Pair","maximize-subarrays-after-removing-one-conflicting-pair",0,[139,6,50,122],[["/practice/#maximize-subarrays-after-removing-one-conflicting-pair","Solution"]]],[3481,"Apply Substitutions","apply-substitutions",0,[41,25,64,165,6,71,155],[["/practice/#apply-substitutions","Solution"]]],[3482,"Analyze Organization Hierarchy","analyze-organization-hierarchy",1,[40],[["/practice/#analyze-organization-hierarchy","Solution"]]],[3483,"Unique 3-Digit Even Numbers","unique-3-digit-even-numbers",0,[134,6,71,50],[["/practice/#unique-3-digit-even-numbers","Solution"]]],[3484,"Design Spreadsheet","design-spreadsheet",0,[42,6,71,155,96],[["/practice/#design-spreadsheet","Solution"]]],[3485,"Longest Common Prefix of K Strings After Removal","longest-common-prefix-of-k-strings-after-removal",0,[171,6,155],[["/practice/#longest-common-prefix-of-k-strings-after-removal","Solution"]]],[3486,"Longest Special Path II","longest-special-path-ii",0,[168,41,6,71,122],[["/practice/#longest-special-path-ii","Solution"]]],[3487,"Maximum Unique Subarray Sum After Deletion","maximum-unique-subarray-sum-after-deletion",0,[68,6,71],[["/practice/#maximum-unique-subarray-sum-after-deletion","Solution"]]],[3488,"Closest Equal Element Queries","closest-equal-element-queries",0,[6,71,14],[["/practice/#closest-equal-element-queries","Solution"]]],[3489,"Zero Array Transformation IV","zero-array-transformation-iv",0,[6,48],[["/practice/#zero-array-transformation-iv","Solution"]]],[3490,"Count Beautiful Numbers","count-beautiful-numbers",0,[48],[["/practice/#count-beautiful-numbers","Solution"]]],[3491,"Phone Number Prefix","phone-number-prefix",0,[171,6,155,150],[["/practice/#phone-number-prefix","Solution"]]],[3492,"Maximum Containers on a Ship","maximum-containers-on-a-ship",0,[95],[["/practice/#maximum-containers-on-a-ship","Solution"]]],[3493,"Properties Graph","properties-graph",0,[41,25,174,64,6,71],[["/practice/#properties-graph","Solution"]]],[3494,"Find the Minimum Amount of Time to Brew Potions","find-the-minimum-amount-of-time-to-brew-potions",0,[6,122,145],[["/practice/#find-the-minimum-amount-of-time-to-brew-potions","Solution"]]],[3495,"Minimum Operations to Make Array Elements Zero","minimum-operations-to-make-array-elements-zero",0,[18,6,95],[["/practice/#minimum-operations-to-make-array-elements-zero","Solution"]]],[3496,"Maximize Score After Pair Deletions","maximize-score-after-pair-deletions",0,[68,6],[["/practice/#maximize-score-after-pair-deletions","Solution"]]],[3497,"Analyze Subscription Conversion ","analyze-subscription-conversion",1,[40],[["/practice/#analyze-subscription-conversion","Solution"]]],[3498,"Reverse Degree of a String","reverse-degree-of-a-string",0,[155,145],[["/practice/#reverse-degree-of-a-string","Solution"]]],[3499,"Maximize Active Section with Trade I","maximize-active-section-with-trade-i",0,[155,50],[["/practice/#maximize-active-section-with-trade-i","Solution"]]],[3500,"Minimum Cost to Divide Array Into Subarrays","minimum-cost-to-divide-array-into-subarrays",0,[6,48,122,86],[["/practice/#minimum-cost-to-divide-array-into-subarrays","Solution"]]],[3501,"Maximize Active Section with Trade II","maximize-active-section-with-trade-ii",0,[139,6,155,14],[["/practice/#maximize-active-section-with-trade-ii","Solution"]]],[3502,"Minimum Cost to Reach Every Position","minimum-cost-to-reach-every-position",0,[6],[["/practice/#minimum-cost-to-reach-every-position","Solution"]]],[3503,"Longest Palindrome After Substring Concatenation I","longest-palindrome-after-substring-concatenation-i",0,[172,155,48,50],[["/practice/#longest-palindrome-after-substring-concatenation-i","Solution"]]],[3504,"Longest Palindrome After Substring Concatenation II","longest-palindrome-after-substring-concatenation-ii",0,[172,155,48],[["/practice/#longest-palindrome-after-substring-concatenation-ii","Solution"]]],[3505,"Minimum Operations to Make Elements Within K Subarrays Equal","minimum-operations-to-make-elements-within-k-subarrays-equal",0,[6,71,95,48,146,72],[["/practice/#minimum-operations-to-make-elements-within-k-subarrays-equal","Solution"]]],[3506,"Find Time Required to Eliminate Bacterial Strains","find-time-required-to-eliminate-bacterial-strains",0,[68,6,95,72],[["/practice/#find-time-required-to-eliminate-bacterial-strains","Solution"]]],[3507,"Minimum Pair Removal to Sort Array I","minimum-pair-removal-to-sort-array-i",0,[6,71,88,47,113,145,72],[["/practice/#minimum-pair-removal-to-sort-array-i","Solution"]]],[3508,"Implement Router","implement-router",0,[42,128,6,71,14,113],[["/practice/#implement-router","Solution"]]],[3509,"Maximum Product of Subsequences With an Alternating Sum Equal to K","maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k",0,[6,71,48],[["/practice/#maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k","Solution"]]],[3510,"Minimum Pair Removal to Sort Array II","minimum-pair-removal-to-sort-array-ii",0,[6,71,88,47,113,145,72],[["/practice/#minimum-pair-removal-to-sort-array-ii","Solution"]]],[3511,"Make a Positive Array","make-a-positive-array",0,[68,6,122],[["/practice/#make-a-positive-array","Solution"]]],[3512,"Minimum Operations to Make Array Sum Divisible by K","minimum-operations-to-make-array-sum-divisible-by-k",0,[6,95],[["/practice/#minimum-operations-to-make-array-sum-divisible-by-k","Solution"]]],[3513,"Number of Unique XOR Triplets I","number-of-unique-xor-triplets-i",0,[18,6,95],[["/practice/#number-of-unique-xor-triplets-i","Solution"]]],[3514,"Number of Unique XOR Triplets II","number-of-unique-xor-triplets-ii",0,[18,6,95,50],[["/practice/#number-of-unique-xor-triplets-ii","Solution"]]],[3515,"Shortest Path in a Weighted Tree","shortest-path-in-a-weighted-tree",0,[168,41,12,139,6],[["/practice/#shortest-path-in-a-weighted-tree","Solution"]]],[3516,"Find Closest Person","find-closest-person",0,[95],[["/practice/#find-closest-person","Solution"]]],[3517,"Smallest Palindromic Rearrangement I","smallest-palindromic-rearrangement-i",0,[155,37,150],[["/practice/#smallest-palindromic-rearrangement-i","Solution"]]],[3518,"Smallest Palindromic Rearrangement II","smallest-palindromic-rearrangement-ii",0,[71,95,155,33,36],[["/practice/#smallest-palindromic-rearrangement-ii","Solution"]]],[3519,"Count Numbers with Non-Decreasing Digits ","count-numbers-with-non-decreasing-digits",0,[95,155,48],[["/practice/#count-numbers-with-non-decreasing-digits","Solution"]]],[3520,"Minimum Threshold for Inversion Pairs Count","minimum-threshold-for-inversion-pairs-count",0,[12,139,6,14,46,101],[["/practice/#minimum-threshold-for-inversion-pairs-count","Solution"]]],[3521,"Find Product Recommendation Pairs","find-product-recommendation-pairs",1,[40],[["/practice/#find-product-recommendation-pairs","Solution"]]],[3522,"Calculate Score After Performing Instructions","calculate-score-after-performing-instructions",0,[6,71,155,145],[["/practice/#calculate-score-after-performing-instructions","Solution"]]],[3523,"Make Array Non-decreasing","make-array-non-decreasing",0,[154,68,6,108],[["/practice/#make-array-non-decreasing","Solution"]]],[3524,"Find X Value of Array I","find-x-value-of-array-i",0,[6,95,48],[["/practice/#find-x-value-of-array-i","Solution"]]],[3525,"Find X Value of Array II","find-x-value-of-array-ii",0,[139,6,95],[["/practice/#find-x-value-of-array-ii","Solution"]]],[3526,"Range XOR Queries with Subarray Reversals","range-xor-queries-with-subarray-reversals",0,[168,15,6,16],[["/practice/#range-xor-queries-with-subarray-reversals","Solution"]]],[3527,"Find the Most Common Response","find-the-most-common-response",0,[6,71,155,36],[["/practice/#find-the-most-common-response","Solution"]]],[3528,"Unit Conversion I","unit-conversion-i",0,[41,25,64],[["/practice/#unit-conversion-i","Solution"]]],[3529,"Count Cells in Overlapping Horizontal and Vertical Substrings","count-cells-in-overlapping-horizontal-and-vertical-substrings",0,[6,155,96,156,70,137],[["/practice/#count-cells-in-overlapping-horizontal-and-vertical-substrings","Solution"]]],[3530,"Maximum Profit from Valid Topological Order in DAG","maximum-profit-from-valid-topological-order-in-dag",0,[18,64,165,6,48,19],[["/practice/#maximum-profit-from-valid-topological-order-in-dag","Solution"]]],[3531,"Count Covered Buildings","count-covered-buildings",0,[6,71,150],[["/practice/#count-covered-buildings","Solution"]]],[3532,"Path Existence Queries in a Graph I","path-existence-queries-in-a-graph-i",0,[174,64,6,71,14],[["/practice/#path-existence-queries-in-a-graph-i","Solution"]]],[3533,"Concatenated Divisibility","concatenated-divisibility",0,[18,6,48,19],[["/practice/#concatenated-divisibility","Solution"]]],[3534,"Path Existence Queries in a Graph II","path-existence-queries-in-a-graph-ii",0,[68,18,64,6,172,14,48,150],[["/practice/#path-existence-queries-in-a-graph-ii","Solution"]]],[3535,"Unit Conversion II","unit-conversion-ii",0,[41,25,64,6,95],[["/practice/#unit-conversion-ii","Solution"]]],[3536,"Maximum Product of Two Digits","maximum-product-of-two-digits",0,[95,150],[["/practice/#maximum-product-of-two-digits","Solution"]]],[3537,"Fill a Special Grid","fill-a-special-grid",0,[6,46,96],[["/practice/#fill-a-special-grid","Solution"]]],[3538,"Merge Operations for Minimum Travel Time","merge-operations-for-minimum-travel-time",0,[6,48,122],[["/practice/#merge-operations-for-minimum-travel-time","Solution"]]],[3539,"Find Sum of Array Product of Magical Sequences","find-sum-of-array-product-of-magical-sequences",0,[18,6,95,48,19,33],[["/practice/#find-sum-of-array-product-of-magical-sequences","Solution"]]],[3540,"Minimum Time to Visit All Houses","minimum-time-to-visit-all-houses",0,[6,122],[["/practice/#minimum-time-to-visit-all-houses","Solution"]]],[3541,"Find Most Frequent Vowel and Consonant","find-most-frequent-vowel-and-consonant",0,[71,155,36],[["/practice/#find-most-frequent-vowel-and-consonant","Solution"]]],[3542,"Minimum Operations to Convert All Elements to Zero","minimum-operations-to-convert-all-elements-to-zero",0,[154,68,6,71,108],[["/practice/#minimum-operations-to-convert-all-elements-to-zero","Solution"]]],[3543,"Maximum Weighted K-Edge Path","maximum-weighted-k-edge-path",0,[64,71,48],[["/practice/#maximum-weighted-k-edge-path","Solution"]]],[3544,"Subtree Inversion Sum","subtree-inversion-sum",0,[168,41,6,48],[["/practice/#subtree-inversion-sum","Solution"]]],[3545,"Minimum Deletions for At Most K Distinct Characters","minimum-deletions-for-at-most-k-distinct-characters",0,[68,71,155,36,150],[["/practice/#minimum-deletions-for-at-most-k-distinct-characters","Solution"]]],[3546,"Equal Sum Grid Partition I","equal-sum-grid-partition-i",0,[6,50,96,122],[["/practice/#equal-sum-grid-partition-i","Solution"]]],[3547,"Maximum Sum of Edge Values in a Graph","maximum-sum-of-edge-values-in-a-graph",0,[68,64,95],[["/practice/#maximum-sum-of-edge-values-in-a-graph","Solution"]]],[3548,"Equal Sum Grid Partition II","equal-sum-grid-partition-ii",0,[6,71,50,96,122],[["/practice/#equal-sum-grid-partition-ii","Solution"]]],[3549,"Multiply Two Polynomials","multiply-two-polynomials",0,[6,95],[["/practice/#multiply-two-polynomials","Solution"]]],[3550,"Smallest Index With Digit Sum Equal to Index","smallest-index-with-digit-sum-equal-to-index",0,[6,95],[["/practice/#smallest-index-with-digit-sum-equal-to-index","Solution"]]],[3551,"Minimum Swaps to Sort by Digit Sum","minimum-swaps-to-sort-by-digit-sum",0,[6,71,150],[["/practice/#minimum-swaps-to-sort-by-digit-sum","Solution"]]],[3552,"Grid Teleportation Traversal","grid-teleportation-traversal",0,[25,6,71,96],[["/practice/#grid-teleportation-traversal","Solution"]]],[3553,"Minimum Weighted Subgraph With the Required Paths II","minimum-weighted-subgraph-with-the-required-paths-ii",0,[18,168,41,6,48],[["/practice/#minimum-weighted-subgraph-with-the-required-paths-ii","Solution"]]],[3554,"Find Category Recommendation Pairs","find-category-recommendation-pairs",1,[40],[["/practice/#find-category-recommendation-pairs","Solution"]]],[3555,"Smallest Subarray to Sort in Every Sliding Window","smallest-subarray-to-sort-in-every-sliding-window",0,[154,68,6,172,150,108],[["/practice/#smallest-subarray-to-sort-in-every-sliding-window","Solution"]]],[3556,"Sum of Largest Prime Substrings","sum-of-largest-prime-substrings",0,[71,95,155,112,150],[["/practice/#sum-of-largest-prime-substrings","Solution"]]],[3557,"Find Maximum Number of Non Intersecting Substrings","find-maximum-number-of-non-intersecting-substrings",0,[68,71,155,48],[["/practice/#find-maximum-number-of-non-intersecting-substrings","Solution"]]],[3558,"Number of Ways to Assign Edge Weights I","number-of-ways-to-assign-edge-weights-i",0,[168,41,95],[["/practice/#number-of-ways-to-assign-edge-weights-i","Solution"]]],[3559,"Number of Ways to Assign Edge Weights II","number-of-ways-to-assign-edge-weights-ii",0,[18,168,41,6,95,48],[["/practice/#number-of-ways-to-assign-edge-weights-ii","Solution"]]],[3560,"Find Minimum Log Transportation Cost","find-minimum-log-transportation-cost",0,[95],[["/practice/#find-minimum-log-transportation-cost","Solution"]]],[3561,"Resulting String After Adjacent Removals","resulting-string-after-adjacent-removals",0,[154,155,145],[["/practice/#resulting-string-after-adjacent-removals","Solution"]]],[3562,"Maximum Profit from Trading Stocks with Discounts","maximum-profit-from-trading-stocks-with-discounts",0,[168,41,6,48],[["/practice/#maximum-profit-from-trading-stocks-with-discounts","Solution"]]],[3563,"Lexicographically Smallest String After Adjacent Removals","lexicographically-smallest-string-after-adjacent-removals",0,[155,48],[["/practice/#lexicographically-smallest-string-after-adjacent-removals","Solution"]]],[3564,"Seasonal Sales Analysis","seasonal-sales-analysis",1,[40],[["/practice/#seasonal-sales-analysis","Solution"]]],[3565,"Sequential Grid Path Cover","sequential-grid-path-cover",0,[134,6,96],[["/practice/#sequential-grid-path-cover","Solution"]]],[3566,"Partition Array into Two Equal Product Subsets","partition-array-into-two-equal-product-subsets",0,[18,134,6,50],[["/practice/#partition-array-into-two-equal-product-subsets","Solution"]]],[3567,"Minimum Absolute Difference in Sliding Submatrix","minimum-absolute-difference-in-sliding-submatrix",0,[6,96,150],[["/practice/#minimum-absolute-difference-in-sliding-submatrix","Solution"]]],[3568,"Minimum Moves to Clean the Classroom","minimum-moves-to-clean-the-classroom",0,[18,25,6,71,96],[["/practice/#minimum-moves-to-clean-the-classroom","Solution"]]],[3569,"Maximize Count of Distinct Primes After Split","maximize-count-of-distinct-primes-after-split",0,[139,6,71,95,112,113],[["/practice/#maximize-count-of-distinct-primes-after-split","Solution"]]],[3570,"Find Books with No Available Copies","find-books-with-no-available-copies",1,[40],[["/practice/#find-books-with-no-available-copies","Solution"]]],[3571,"Find the Shortest Superstring II","find-the-shortest-superstring-ii",0,[155],[["/practice/#find-the-shortest-superstring-ii","Solution"]]],[3572,"Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values","maximize-ysum-by-picking-a-triplet-of-distinct-xvalues",0,[68,6,71,150,72],[["/practice/#maximize-ysum-by-picking-a-triplet-of-distinct-xvalues","Solution"]]],[3573,"Best Time to Buy and Sell Stock V","best-time-to-buy-and-sell-stock-v",0,[6,48],[["/practice/#best-time-to-buy-and-sell-stock-v","Solution"]]],[3574,"Maximize Subarray GCD Score","maximize-subarray-gcd-score",0,[6,95,50,112],[["/practice/#maximize-subarray-gcd-score","Solution"]]],[3575,"Maximum Good Subtree Score","maximum-good-subtree-score",0,[18,168,41,6,48,19],[["/practice/#maximum-good-subtree-score","Solution"]]],[3576,"Transform Array to All Equal Elements","transform-array-to-all-equal-elements",0,[68,6],[["/practice/#transform-array-to-all-equal-elements","Solution"]]],[3577,"Count the Number of Computer Unlocking Permutations","count-the-number-of-computer-unlocking-permutations",0,[24,6,95,33],[["/practice/#count-the-number-of-computer-unlocking-permutations","Solution"]]],[3578,"Count Partitions With Max-Min Difference at Most K","count-partitions-with-max-min-difference-at-most-k",0,[128,6,48,122,146,107],[["/practice/#count-partitions-with-max-min-difference-at-most-k","Solution"]]],[3579,"Minimum Steps to Convert String with Operations","minimum-steps-to-convert-string-with-operations",0,[155,48],[["/practice/#minimum-steps-to-convert-string-with-operations","Solution"]]],[3580,"Find Consistently Improving Employees","find-consistently-improving-employees",1,[40],[["/practice/#find-consistently-improving-employees","Solution"]]],[3581,"Count Odd Letters from Number","count-odd-letters-from-number",0,[71,155,36,145],[["/practice/#count-odd-letters-from-number","Solution"]]],[3582,"Generate Tag for Video Caption","generate-tag-for-video-caption",0,[155,145],[["/practice/#generate-tag-for-video-caption","Solution"]]],[3583,"Count Special Triplets","count-special-triplets",0,[6,71,36],[["/practice/#count-special-triplets","Solution"]]],[3584,"Maximum Product of First and Last Elements of a Subsequence","maximum-product-of-first-and-last-elements-of-a-subsequence",0,[6,172],[["/practice/#maximum-product-of-first-and-last-elements-of-a-subsequence","Solution"]]],[3585,"Find Weighted Median Node in Tree","find-weighted-median-node-in-tree",0,[18,168,41,6,14,48],[["/practice/#find-weighted-median-node-in-tree","Solution"]]],[3586,"Find COVID Recovery Patients","find-covid-recovery-patients",1,[40],[["/practice/#find-covid-recovery-patients","Solution"]]],[3587,"Minimum Adjacent Swaps to Alternate Parity","minimum-adjacent-swaps-to-alternate-parity",0,[68,6],[["/practice/#minimum-adjacent-swaps-to-alternate-parity","Solution"]]],[3588,"Find Maximum Area of a Triangle","find-maximum-area-of-a-triangle",0,[68,63,6,71,95,50],[["/practice/#find-maximum-area-of-a-triangle","Solution"]]],[3589,"Count Prime-Gap Balanced Subarrays","count-prime-gap-balanced-subarrays",0,[128,6,95,112,146,107],[["/practice/#count-prime-gap-balanced-subarrays","Solution"]]],[3590,"Kth Smallest Path XOR Sum","kth-smallest-path-xor-sum",0,[168,41,6,113],[["/practice/#kth-smallest-path-xor-sum","Solution"]]],[3591,"Check if Any Element Has Prime Frequency","check-if-any-element-has-prime-frequency",0,[6,71,95,36,112],[["/practice/#check-if-any-element-has-prime-frequency","Solution"]]],[3592,"Inverse Coin Change","inverse-coin-change",0,[6,48],[["/practice/#inverse-coin-change","Solution"]]],[3593,"Minimum Increments to Equalize Leaf Paths","minimum-increments-to-equalize-leaf-paths",0,[168,41,6,48],[["/practice/#minimum-increments-to-equalize-leaf-paths","Solution"]]],[3594,"Minimum Time to Transport All Individuals","minimum-time-to-transport-all-individuals",0,[18,64,6,19,142,72],[["/practice/#minimum-time-to-transport-all-individuals","Solution"]]],[3595,"Once Twice","once-twice",0,[18,6],[["/practice/#once-twice","Solution"]]],[3596,"Minimum Cost Path with Alternating Directions I","minimum-cost-path-with-alternating-directions-i",0,[24,95],[["/practice/#minimum-cost-path-with-alternating-directions-i","Solution"]]],[3597,"Partition String ","partition-string",0,[171,71,155,145],[["/practice/#partition-string","Solution"]]],[3598,"Longest Common Prefix Between Adjacent Strings After Removals","longest-common-prefix-between-adjacent-strings-after-removals",0,[6,155],[["/practice/#longest-common-prefix-between-adjacent-strings-after-removals","Solution"]]],[3599,"Partition Array to Minimize XOR","partition-array-to-minimize-xor",0,[18,6,48,122],[["/practice/#partition-array-to-minimize-xor","Solution"]]],[3600,"Maximize Spanning Tree Stability with Upgrades","maximize-spanning-tree-stability-with-upgrades",0,[68,174,64,14,105],[["/practice/#maximize-spanning-tree-stability-with-upgrades","Solution"]]],[3601,"Find Drivers with Improved Fuel Efficiency","find-drivers-with-improved-fuel-efficiency",1,[40],[["/practice/#find-drivers-with-improved-fuel-efficiency","Solution"]]],[3602,"Hexadecimal and Hexatrigesimal Conversion","hexadecimal-and-hexatrigesimal-conversion",0,[95,155],[["/practice/#hexadecimal-and-hexatrigesimal-conversion","Solution"]]],[3603,"Minimum Cost Path with Alternating Directions II","minimum-cost-path-with-alternating-directions-ii",0,[6,48,96],[["/practice/#minimum-cost-path-with-alternating-directions-ii","Solution"]]],[3604,"Minimum Time to Reach Destination in Directed Graph","minimum-time-to-reach-destination-in-directed-graph",0,[64,142,72],[["/practice/#minimum-time-to-reach-destination-in-directed-graph","Solution"]]],[3605,"Minimum Stability Factor of Array","minimum-stability-factor-of-array",0,[68,139,6,95,14,112],[["/practice/#minimum-stability-factor-of-array","Solution"]]],[3606,"Coupon Code Validator","coupon-code-validator",0,[6,71,155,150],[["/practice/#coupon-code-validator","Solution"]]],[3607,"Power Grid Maintenance","power-grid-maintenance",0,[41,25,174,64,6,71,113,72],[["/practice/#power-grid-maintenance","Solution"]]],[3608,"Minimum Time for K Connected Components","minimum-time-for-k-connected-components",0,[174,64,14,150],[["/practice/#minimum-time-for-k-connected-components","Solution"]]],[3609,"Minimum Moves to Reach Target in Grid","minimum-moves-to-reach-target-in-grid",0,[95],[["/practice/#minimum-moves-to-reach-target-in-grid","Solution"]]],[3610,"Minimum Number of Primes to Sum to Target","minimum-number-of-primes-to-sum-to-target",0,[6,95,48,112],[["/practice/#minimum-number-of-primes-to-sum-to-target","Solution"]]],[3611,"Find Overbooked Employees","find-overbooked-employees",1,[40],[["/practice/#find-overbooked-employees","Solution"]]],[3612,"Process String with Special Operations I","process-string-with-special-operations-i",0,[155,145],[["/practice/#process-string-with-special-operations-i","Solution"]]],[3613,"Minimize Maximum Component Cost","minimize-maximum-component-cost",0,[174,64,14,150],[["/practice/#minimize-maximum-component-cost","Solution"]]],[3614,"Process String with Special Operations II","process-string-with-special-operations-ii",0,[155,145],[["/practice/#process-string-with-special-operations-ii","Solution"]]],[3615,"Longest Palindromic Path in Graph","longest-palindromic-path-in-graph",0,[18,64,155,48,19],[["/practice/#longest-palindromic-path-in-graph","Solution"]]],[3616,"Number of Student Replacements","number-of-student-replacements",0,[6,145],[["/practice/#number-of-student-replacements","Solution"]]],[3617,"Find Students with Study Spiral Pattern","find-students-with-study-spiral-pattern",1,[40],[["/practice/#find-students-with-study-spiral-pattern","Solution"]]],[3618,"Split Array by Prime Indices","split-array-by-prime-indices",0,[6,95,112],[["/practice/#split-array-by-prime-indices","Solution"]]],[3619,"Count Islands With Total Value Divisible by K","count-islands-with-total-value-divisible-by-k",0,[41,25,174,6,96],[["/practice/#count-islands-with-total-value-divisible-by-k","Solution"]]],[3620,"Network Recovery Pathways","network-recovery-pathways",0,[64,165,6,14,48,142,72],[["/practice/#network-recovery-pathways","Solution"]]],[3621,"Number of Integers With Popcount-Depth Equal to K I","number-of-integers-with-popcount-depth-equal-to-k-i",0,[18,95,48,33],[["/practice/#number-of-integers-with-popcount-depth-equal-to-k-i","Solution"]]],[3622,"Check Divisibility by Digit Sum and Product","check-divisibility-by-digit-sum-and-product",0,[95],[["/practice/#check-divisibility-by-digit-sum-and-product","Solution"]]],[3623,"Count Number of Trapezoids I","count-number-of-trapezoids-i",0,[63,6,71,95],[["/practice/#count-number-of-trapezoids-i","Solution"]]],[3624,"Number of Integers With Popcount-Depth Equal to K II","number-of-integers-with-popcount-depth-equal-to-k-ii",0,[12,139,6,46],[["/practice/#number-of-integers-with-popcount-depth-equal-to-k-ii","Solution"]]],[3625,"Count Number of Trapezoids II","count-number-of-trapezoids-ii",0,[63,6,71,95],[["/practice/#count-number-of-trapezoids-ii","Solution"]]],[3626,"Find Stores with Inventory Imbalance","find-stores-with-inventory-imbalance",1,[40],[["/practice/#find-stores-with-inventory-imbalance","Solution"]]],[3627,"Maximum Median Sum of Subsequences of Size 3","maximum-median-sum-of-subsequences-of-size-3",0,[],[["/practice/#maximum-median-sum-of-subsequences-of-size-3","Solution"]]],[3628,"Maximum Number of Subsequences After One Inserting","maximum-number-of-subsequences-after-one-inserting",0,[68,155,48,122],[["/practice/#maximum-number-of-subsequences-after-one-inserting","Solution"]]],[3629,"Minimum Jumps to Reach End via Prime Teleportation","minimum-jumps-to-reach-end-via-prime-teleportation",0,[25,6,71,95,112],[["/practice/#minimum-jumps-to-reach-end-via-prime-teleportation","Solution"]]],[3630,"Partition Array for Maximum XOR and AND","partition-array-for-maximum-xor-and-and",0,[68,18,6,95,50],[["/practice/#partition-array-for-maximum-xor-and-and","Solution"]]],[3631,"Sort Threats by Severity and Exploitability","sort-threats-by-severity-and-exploitability",0,[6,150],[["/practice/#sort-threats-by-severity-and-exploitability","Solution"]]],[3632,"Subarrays with XOR at Least K","subarrays-with-xor-at-least-k",0,[18,171,6,122],[["/practice/#subarrays-with-xor-at-least-k","Solution"]]],[3633,"Earliest Finish Time for Land and Water Rides I","earliest-finish-time-for-land-and-water-rides-i",0,[68,6,172,14,150],[["/practice/#earliest-finish-time-for-land-and-water-rides-i","Solution"]]],[3634,"Minimum Removals to Balance Array","minimum-removals-to-balance-array",0,[6,14,150,146],[["/practice/#minimum-removals-to-balance-array","Solution"]]],[3635,"Earliest Finish Time for Land and Water Rides II","earliest-finish-time-for-land-and-water-rides-ii",0,[68,6,172,14,150],[["/practice/#earliest-finish-time-for-land-and-water-rides-ii","Solution"]]],[3636,"Threshold Majority Queries","threshold-majority-queries",0,[6,71,14,46,36,122],[["/practice/#threshold-majority-queries","Solution"]]],[3637,"Trionic Array I","trionic-array-i",0,[6],[["/practice/#trionic-array-i","Solution"]]],[3638,"Maximum Balanced Shipments","maximum-balanced-shipments",0,[154,68,6,48,108],[["/practice/#maximum-balanced-shipments","Solution"]]],[3639,"Minimum Time to Activate String","minimum-time-to-activate-string",0,[6,14],[["/practice/#minimum-time-to-activate-string","Solution"]]],[3640,"Trionic Array II","trionic-array-ii",0,[6,48],[["/practice/#trionic-array-ii","Solution"]]],[3641,"Longest Semi-Repeating Subarray","longest-semi-repeating-subarray",0,[6,71,146],[["/practice/#longest-semi-repeating-subarray","Solution"]]],[3642,"Find Books with Polarized Opinions","find-books-with-polarized-opinions",1,[40],[["/practice/#find-books-with-polarized-opinions","Solution"]]],[3643,"Flip Square Submatrix Vertically","flip-square-submatrix-vertically",0,[6,172,96],[["/practice/#flip-square-submatrix-vertically","Solution"]]],[3644,"Maximum K to Sort a Permutation","maximum-k-to-sort-a-permutation",0,[18,6],[["/practice/#maximum-k-to-sort-a-permutation","Solution"]]],[3645,"Maximum Total from Optimal Activation Order","maximum-total-from-optimal-activation-order",0,[68,6,172,150,72],[["/practice/#maximum-total-from-optimal-activation-order","Solution"]]],[3646,"Next Special Palindrome Number","next-special-palindrome-number",0,[18,8],[["/practice/#next-special-palindrome-number","Solution"]]],[3647,"Maximum Weight in Two Bags","maximum-weight-in-two-bags",0,[6,48],[["/practice/#maximum-weight-in-two-bags","Solution"]]],[3648,"Minimum Sensors to Cover Grid","minimum-sensors-to-cover-grid",0,[95],[["/practice/#minimum-sensors-to-cover-grid","Solution"]]],[3649,"Number of Perfect Pairs","number-of-perfect-pairs",0,[],[["/practice/#number-of-perfect-pairs","Solution"]]],[3650,"Minimum Cost Path with Edge Reversals","minimum-cost-path-with-edge-reversals",0,[64,142,72],[["/practice/#minimum-cost-path-with-edge-reversals","Solution"]]],[3651,"Minimum Cost Path with Teleportations","minimum-cost-path-with-teleportations",0,[6,48,96],[["/practice/#minimum-cost-path-with-teleportations","Solution"]]],[3652,"Best Time to Buy and Sell Stock using Strategy","best-time-to-buy-and-sell-stock-using-strategy",0,[6,122,146],[["/practice/#best-time-to-buy-and-sell-stock-using-strategy","Solution"]]],[3653,"XOR After Range Multiplication Queries I","xor-after-range-multiplication-queries-i",0,[6,46,122,145],[["/practice/#xor-after-range-multiplication-queries-i","Solution"]]],[3654,"Minimum Sum After Divisible Sum Deletions","minimum-sum-after-divisible-sum-deletions",0,[6,71,48,122],[["/practice/#minimum-sum-after-divisible-sum-deletions","Solution"]]],[3655,"XOR After Range Multiplication Queries II","xor-after-range-multiplication-queries-ii",0,[6,46,122],[["/practice/#xor-after-range-multiplication-queries-ii","Solution"]]],[3656,"Determine if a Simple Graph Exists","determine-if-a-simple-graph-exists",0,[64,6,14,122,150],[["/practice/#determine-if-a-simple-graph-exists","Solution"]]],[3657,"Find Loyal Customers","find-loyal-customers",1,[40],[["/practice/#find-loyal-customers","Solution"]]],[3658,"GCD of Odd and Even Sums","gcd-of-odd-and-even-sums",0,[95,112],[["/practice/#gcd-of-odd-and-even-sums","Solution"]]],[3659,"Partition Array Into K-Distinct Groups","partition-array-into-k-distinct-groups",0,[6,71,36],[["/practice/#partition-array-into-k-distinct-groups","Solution"]]],[3660,"Jump Game IX","jump-game-ix",0,[6,48],[["/practice/#jump-game-ix","Solution"]]],[3661,"Maximum Walls Destroyed by Robots","maximum-walls-destroyed-by-robots",0,[6,14,48,150],[["/practice/#maximum-walls-destroyed-by-robots","Solution"]]],[3662,"Filter Characters by Frequency","filter-characters-by-frequency",0,[71,155,36],[["/practice/#filter-characters-by-frequency","Solution"]]],[3663,"Find The Least Frequent Digit","find-the-least-frequent-digit",0,[6,71,95,36],[["/practice/#find-the-least-frequent-digit","Solution"]]],[3664,"Two-Letter Card Game","two-letter-card-game",0,[6,71,155,36,50],[["/practice/#two-letter-card-game","Solution"]]],[3665,"Twisted Mirror Path Count","twisted-mirror-path-count",0,[6,48,96],[["/practice/#twisted-mirror-path-count","Solution"]]],[3666,"Minimum Operations to Equalize Binary String","minimum-operations-to-equalize-binary-string",0,[25,174,95,155,113],[["/practice/#minimum-operations-to-equalize-binary-string","Solution"]]],[3667,"Sort Array By Absolute Value","sort-array-by-absolute-value",0,[6,95,172,150],[["/practice/#sort-array-by-absolute-value","Solution"]]],[3668,"Restore Finishing Order","restore-finishing-order",0,[6,71],[["/practice/#restore-finishing-order","Solution"]]],[3669,"Balanced K-Factor Decomposition","balanced-k-factor-decomposition",0,[95,8,112],[["/practice/#balanced-k-factor-decomposition","Solution"]]],[3670,"Maximum Product of Two Integers With No Common Bits","maximum-product-of-two-integers-with-no-common-bits",0,[18,6,48],[["/practice/#maximum-product-of-two-integers-with-no-common-bits","Solution"]]],[3671,"Sum of Beautiful Subsequences","sum-of-beautiful-subsequences",0,[12,6,95,112],[["/practice/#sum-of-beautiful-subsequences","Solution"]]],[3672,"Sum of Weighted Modes in Subarrays","sum-of-weighted-modes-in-subarrays",0,[6,71,36,113,146],[["/practice/#sum-of-weighted-modes-in-subarrays","Solution"]]],[3673,"Find Zombie Sessions","find-zombie-sessions",1,[40],[["/practice/#find-zombie-sessions","Solution"]]],[3674,"Minimum Operations to Equalize Array","minimum-operations-to-equalize-array",0,[18,24,6],[["/practice/#minimum-operations-to-equalize-array","Solution"]]],[3675,"Minimum Operations to Transform String","minimum-operations-to-transform-string",0,[68,155],[["/practice/#minimum-operations-to-transform-string","Solution"]]],[3676,"Count Bowl Subarrays","count-bowl-subarrays",0,[154,6,108],[["/practice/#count-bowl-subarrays","Solution"]]],[3677,"Count Binary Palindromic Numbers","count-binary-palindromic-numbers",0,[18,95],[["/practice/#count-binary-palindromic-numbers","Solution"]]],[3678,"Smallest Absent Positive Greater Than Average","smallest-absent-positive-greater-than-average",0,[6,71],[["/practice/#smallest-absent-positive-greater-than-average","Solution"]]],[3679," Minimum Discards to Balance Inventory","minimum-discards-to-balance-inventory",0,[6,71,36,146,145],[["/practice/#minimum-discards-to-balance-inventory","Solution"]]],[3680,"Generate Schedule","generate-schedule",0,[68,6,95],[["/practice/#generate-schedule","Solution"]]],[3681,"Maximum XOR of Subsequences","maximum-xor-of-subsequences",0,[68,18,6,95],[["/practice/#maximum-xor-of-subsequences","Solution"]]],[3682,"Minimum Index Sum of Common Elements","minimum-index-sum-of-common-elements",0,[6,71],[["/practice/#minimum-index-sum-of-common-elements","Solution"]]],[3683,"Earliest Time to Finish One Task","earliest-time-to-finish-one-task",0,[],[["/practice/#earliest-time-to-finish-one-task","Solution"]]],[3684,"Maximize Sum of At Most K Distinct Elements","maximize-sum-of-at-most-k-distinct-elements",0,[68,6,71,150],[["/practice/#maximize-sum-of-at-most-k-distinct-elements","Solution"]]],[3685,"Subsequence Sum After Capping Elements","subsequence-sum-after-capping-elements",0,[6,172,48,150],[["/practice/#subsequence-sum-after-capping-elements","Solution"]]],[3686,"Number of Stable Subsequences","number-of-stable-subsequences",0,[6,48],[["/practice/#number-of-stable-subsequences","Solution"]]],[3687,"Library Late Fee Calculator","library-late-fee-calculator",0,[6,145],[["/practice/#library-late-fee-calculator","Solution"]]],[3688,"Bitwise OR of Even Numbers in an Array","bitwise-or-of-even-numbers-in-an-array",0,[18,6,145],[["/practice/#bitwise-or-of-even-numbers-in-an-array","Solution"]]],[3689,"Maximum Total Subarray Value I","maximum-total-subarray-value-i",0,[68,6],[["/practice/#maximum-total-subarray-value-i","Solution"]]],[3690,"Split and Merge Array Transformation","split-and-merge-array-transformation",0,[],[["/practice/#split-and-merge-array-transformation","Solution"]]],[3691,"Maximum Total Subarray Value II","maximum-total-subarray-value-ii",0,[68,139,6,72],[["/practice/#maximum-total-subarray-value-ii","Solution"]]],[3692,"Majority Frequency Characters","majority-frequency-characters",0,[],[["/practice/#majority-frequency-characters","Solution"]]],[3693,"Climbing Stairs II","climbing-stairs-ii",0,[],[["/practice/#climbing-stairs-ii","Solution"]]],[3694,"Distinct Points Reachable After Substring Removal","distinct-points-reachable-after-substring-removal",0,[71,155,122,146],[["/practice/#distinct-points-reachable-after-substring-removal","Solution"]]],[3695,"Maximize Alternating Sum Using Swaps","maximize-alternating-sum-using-swaps",0,[68,174,6,150],[["/practice/#maximize-alternating-sum-using-swaps","Solution"]]],[3696,"Maximum Distance Between Unequal Words in Array I","maximum-distance-between-unequal-words-in-array-i",0,[6,155],[["/practice/#maximum-distance-between-unequal-words-in-array-i","Solution"]]],[3697,"Compute Decimal Representation","compute-decimal-representation",0,[6,95],[["/practice/#compute-decimal-representation","Solution"]]],[3698,"Split Array With Minimum Difference","split-array-with-minimum-difference",0,[6,122],[["/practice/#split-array-with-minimum-difference","Solution"]]],[3699,"Number of ZigZag Arrays I","number-of-zigzag-arrays-i",0,[],[["/practice/#number-of-zigzag-arrays-i","Solution"]]],[3700,"Number of ZigZag Arrays II","number-of-zigzag-arrays-ii",0,[],[["/practice/#number-of-zigzag-arrays-ii","Solution"]]],[3701,"Compute Alternating Sum","compute-alternating-sum",0,[6,145],[["/practice/#compute-alternating-sum","Solution"]]],[3702,"Longest Subsequence With Non-Zero Bitwise XOR","longest-subsequence-with-non-zero-bitwise-xor",0,[18,6],[["/practice/#longest-subsequence-with-non-zero-bitwise-xor","Solution"]]],[3703,"Remove K-Balanced Substrings","remove-k-balanced-substrings",0,[154,155,145],[["/practice/#remove-k-balanced-substrings","Solution"]]],[3704,"Count No-Zero Pairs That Sum to N","count-no-zero-pairs-that-sum-to-n",0,[95,48],[["/practice/#count-no-zero-pairs-that-sum-to-n","Solution"]]],[3705,"Find Golden Hour Customers","find-golden-hour-customers",1,[40],[["/practice/#find-golden-hour-customers","Solution"]]],[3706,"Maximum Distance Between Unequal Words in Array II","maximum-distance-between-unequal-words-in-array-ii",0,[6,155],[["/practice/#maximum-distance-between-unequal-words-in-array-ii","Solution"]]],[3707,"Equal Score Substrings","equal-score-substrings",0,[155,122],[["/practice/#equal-score-substrings","Solution"]]],[3708,"Longest Fibonacci Subarray","longest-fibonacci-subarray",0,[6],[["/practice/#longest-fibonacci-subarray","Solution"]]],[3709,"Design Exam Scores Tracker","design-exam-scores-tracker",0,[42,6,14,122],[["/practice/#design-exam-scores-tracker","Solution"]]],[3710,"Maximum Partition Factor","maximum-partition-factor",0,[41,25,174,64,6,14],[["/practice/#maximum-partition-factor","Solution"]]],[3711,"Maximum Transactions Without Negative Balance","maximum-transactions-without-negative-balance",0,[68,6,72],[["/practice/#maximum-transactions-without-negative-balance","Solution"]]],[3712,"Sum of Elements With Frequency Divisible by K","sum-of-elements-with-frequency-divisible-by-k",0,[6,71,36],[["/practice/#sum-of-elements-with-frequency-divisible-by-k","Solution"]]],[3713,"Longest Balanced Substring I","longest-balanced-substring-i",0,[71,155,36,50],[["/practice/#longest-balanced-substring-i","Solution"]]],[3714,"Longest Balanced Substring II","longest-balanced-substring-ii",0,[71,155,122],[["/practice/#longest-balanced-substring-ii","Solution"]]],[3715,"Sum of Perfect Square Ancestors","sum-of-perfect-square-ancestors",0,[168,41,6,71,95,36,112],[["/practice/#sum-of-perfect-square-ancestors","Solution"]]],[3716,"Find Churn Risk Customers","find-churn-risk-customers",1,[40],[["/practice/#find-churn-risk-customers","Solution"]]],[3717,"Minimum Operations to Make the Array Beautiful","minimum-operations-to-make-the-array-beautiful",0,[6,48],[["/practice/#minimum-operations-to-make-the-array-beautiful","Solution"]]],[3718,"Smallest Missing Multiple of K","smallest-missing-multiple-of-k",0,[6,71],[["/practice/#smallest-missing-multiple-of-k","Solution"]]],[3719,"Longest Balanced Subarray I","longest-balanced-subarray-i",0,[139,6,71,46,122],[["/practice/#longest-balanced-subarray-i","Solution"]]],[3720,"Lexicographically Smallest Permutation Greater Than Target","lexicographically-smallest-permutation-greater-than-target",0,[68,71,155,36,50],[["/practice/#lexicographically-smallest-permutation-greater-than-target","Solution"]]],[3721,"Longest Balanced Subarray II","longest-balanced-subarray-ii",0,[139,6,71,46,122],[["/practice/#longest-balanced-subarray-ii","Solution"]]],[3722,"Lexicographically Smallest String After Reverse","lexicographically-smallest-string-after-reverse",0,[172,14,50],[["/practice/#lexicographically-smallest-string-after-reverse","Solution"]]],[3723,"Maximize Sum of Squares of Digits","maximize-sum-of-squares-of-digits",0,[68,95],[["/practice/#maximize-sum-of-squares-of-digits","Solution"]]],[3724,"Minimum Operations to Transform Array","minimum-operations-to-transform-array",0,[68,6],[["/practice/#minimum-operations-to-transform-array","Solution"]]],[3725,"Count Ways to Choose Coprime Integers from Rows","count-ways-to-choose-coprime-integers-from-rows",0,[6,95,48,33,96,112],[["/practice/#count-ways-to-choose-coprime-integers-from-rows","Solution"]]],[3726,"Remove Zeros in Decimal Representation","remove-zeros-in-decimal-representation",0,[95,145],[["/practice/#remove-zeros-in-decimal-representation","Solution"]]],[3727,"Maximum Alternating Sum of Squares","maximum-alternating-sum-of-squares",0,[68,6,150],[["/practice/#maximum-alternating-sum-of-squares","Solution"]]],[3728,"Stable Subarrays With Equal Boundary and Interior Sum","stable-subarrays-with-equal-boundary-and-interior-sum",0,[6,71,122],[["/practice/#stable-subarrays-with-equal-boundary-and-interior-sum","Solution"]]],[3729,"Count Distinct Subarrays Divisible by K in Sorted Array","count-distinct-subarrays-divisible-by-k-in-sorted-array",0,[6,71,122],[["/practice/#count-distinct-subarrays-divisible-by-k-in-sorted-array","Solution"]]],[3730,"Maximum Calories Burnt from Jumps","maximum-calories-burnt-from-jumps",0,[68,6,172,150],[["/practice/#maximum-calories-burnt-from-jumps","Solution"]]],[3731,"Find Missing Elements","find-missing-elements",0,[6,71,150],[["/practice/#find-missing-elements","Solution"]]],[3732,"Maximum Product of Three Elements After One Replacement","maximum-product-of-three-elements-after-one-replacement",0,[68,6,95,150],[["/practice/#maximum-product-of-three-elements-after-one-replacement","Solution"]]],[3733,"Minimum Time to Complete All Deliveries","minimum-time-to-complete-all-deliveries",0,[95,14],[["/practice/#minimum-time-to-complete-all-deliveries","Solution"]]],[3734,"Lexicographically Smallest Palindromic Permutation Greater Than Target","lexicographically-smallest-palindromic-permutation-greater-than-target",0,[172,155,50],[["/practice/#lexicographically-smallest-palindromic-permutation-greater-than-target","Solution"]]],[3735,"Lexicographically Smallest String After Reverse II","lexicographically-smallest-string-after-reverse-ii",0,[155,14,158,70,137],[["/practice/#lexicographically-smallest-string-after-reverse-ii","Solution"]]],[3736,"Minimum Moves to Equal Array Elements III","minimum-moves-to-equal-array-elements-iii",0,[6,95],[["/practice/#minimum-moves-to-equal-array-elements-iii","Solution"]]],[3737,"Count Subarrays With Majority Element I","count-subarrays-with-majority-element-i",0,[139,6,71,46,36,122,101],[["/practice/#count-subarrays-with-majority-element-i","Solution"]]],[3738,"Longest Non-Decreasing Subarray After Replacing at Most One Element","longest-non-decreasing-subarray-after-replacing-at-most-one-element",0,[6,48],[["/practice/#longest-non-decreasing-subarray-after-replacing-at-most-one-element","Solution"]]],[3739,"Count Subarrays With Majority Element II","count-subarrays-with-majority-element-ii",0,[139,6,71,46,122,101],[["/practice/#count-subarrays-with-majority-element-ii","Solution"]]],[3740,"Minimum Distance Between Three Equal Elements I","minimum-distance-between-three-equal-elements-i",0,[6,71],[["/practice/#minimum-distance-between-three-equal-elements-i","Solution"]]],[3741,"Minimum Distance Between Three Equal Elements II","minimum-distance-between-three-equal-elements-ii",0,[6,71],[["/practice/#minimum-distance-between-three-equal-elements-ii","Solution"]]],[3742,"Maximum Path Score in a Grid","maximum-path-score-in-a-grid",0,[6,48,96],[["/practice/#maximum-path-score-in-a-grid","Solution"]]],[3743,"Maximize Cyclic Partition Score","maximize-cyclic-partition-score",0,[6,48],[["/practice/#maximize-cyclic-partition-score","Solution"]]],[3744,"Find Kth Character in Expanded String","find-kth-character-in-expanded-string",0,[155],[["/practice/#find-kth-character-in-expanded-string","Solution"]]],[3745,"Maximize Expression of Three Elements","maximize-expression-of-three-elements",0,[68,6,50,150],[["/practice/#maximize-expression-of-three-elements","Solution"]]],[3746,"Minimum String Length After Balanced Removals","minimum-string-length-after-balanced-removals",0,[154,155,36],[["/practice/#minimum-string-length-after-balanced-removals","Solution"]]],[3747,"Count Distinct Integers After Removing Zeros","count-distinct-integers-after-removing-zeros",0,[95,48],[["/practice/#count-distinct-integers-after-removing-zeros","Solution"]]],[3748,"Count Stable Subarrays","count-stable-subarrays",0,[6,14,122],[["/practice/#count-stable-subarrays","Solution"]]],[3749,"Evaluate Valid Expressions","evaluate-valid-expressions",0,[154,71,95,155,46],[["/practice/#evaluate-valid-expressions","Solution"]]],[3750,"Minimum Number of Flips to Reverse Binary String","minimum-number-of-flips-to-reverse-binary-string",0,[18,95,172,155],[["/practice/#minimum-number-of-flips-to-reverse-binary-string","Solution"]]],[3751,"Total Waviness of Numbers in Range I","total-waviness-of-numbers-in-range-i",0,[95,48,50],[["/practice/#total-waviness-of-numbers-in-range-i","Solution"]]],[3752,"Lexicographically Smallest Negated Permutation that Sums to Target","lexicographically-smallest-negated-permutation-that-sums-to-target",0,[68,6,95,172,150],[["/practice/#lexicographically-smallest-negated-permutation-that-sums-to-target","Solution"]]],[3753,"Total Waviness of Numbers in Range II","total-waviness-of-numbers-in-range-ii",0,[95,48],[["/practice/#total-waviness-of-numbers-in-range-ii","Solution"]]],[3754,"Concatenate Non-Zero Digits and Multiply by Sum I","concatenate-non-zero-digits-and-multiply-by-sum-i",0,[95],[["/practice/#concatenate-non-zero-digits-and-multiply-by-sum-i","Solution"]]],[3755,"Find Maximum Balanced XOR Subarray Length","find-maximum-balanced-xor-subarray-length",0,[18,6,71,122],[["/practice/#find-maximum-balanced-xor-subarray-length","Solution"]]],[3756,"Concatenate Non-Zero Digits and Multiply by Sum II","concatenate-non-zero-digits-and-multiply-by-sum-ii",0,[95,155,122],[["/practice/#concatenate-non-zero-digits-and-multiply-by-sum-ii","Solution"]]],[3757,"Number of Effective Subsequences","number-of-effective-subsequences",0,[18,6,95,48,33],[["/practice/#number-of-effective-subsequences","Solution"]]],[3758,"Convert Number Words to Digits","convert-number-words-to-digits",0,[171,155],[["/practice/#convert-number-words-to-digits","Solution"]]],[3759,"Count Elements With at Least K Greater Values","count-elements-with-at-least-k-greater-values",0,[6,14,46,130,150],[["/practice/#count-elements-with-at-least-k-greater-values","Solution"]]],[3760,"Maximum Substrings With Distinct Start","maximum-substrings-with-distinct-start",0,[71,155],[["/practice/#maximum-substrings-with-distinct-start","Solution"]]],[3761,"Minimum Absolute Distance Between Mirror Pairs","minimum-absolute-distance-between-mirror-pairs",0,[6,71,95],[["/practice/#minimum-absolute-distance-between-mirror-pairs","Solution"]]],[3762,"Minimum Operations to Equalize Subarrays","minimum-operations-to-equalize-subarrays",0,[139,6,95,14,150],[["/practice/#minimum-operations-to-equalize-subarrays","Solution"]]],[3763,"Maximum Total Sum with Threshold Constraints","maximum-total-sum-with-threshold-constraints",0,[68,6,150,72],[["/practice/#maximum-total-sum-with-threshold-constraints","Solution"]]],[3764,"Most Common Course Pairs","most-common-course-pairs",1,[40],[["/practice/#most-common-course-pairs","Solution"]]],[3765,"Complete Prime Number","complete-prime-number",0,[95,50,112],[["/practice/#complete-prime-number","Solution"]]],[3766,"Minimum Operations to Make Binary Palindrome","minimum-operations-to-make-binary-palindrome",0,[18,6,172,14],[["/practice/#minimum-operations-to-make-binary-palindrome","Solution"]]],[3767,"Maximize Points After Choosing K Tasks","maximize-points-after-choosing-k-tasks",0,[68,6,150,72],[["/practice/#maximize-points-after-choosing-k-tasks","Solution"]]],[3768,"Minimum Inversion Count in Subarrays of Fixed Length","minimum-inversion-count-in-subarrays-of-fixed-length",0,[139,6,146],[["/practice/#minimum-inversion-count-in-subarrays-of-fixed-length","Solution"]]],[3769,"Sort Integers by Binary Reflection","sort-integers-by-binary-reflection",0,[6,150],[["/practice/#sort-integers-by-binary-reflection","Solution"]]],[3770,"Largest Prime from Consecutive Prime Sum","largest-prime-from-consecutive-prime-sum",0,[6,95,112],[["/practice/#largest-prime-from-consecutive-prime-sum","Solution"]]],[3771,"Total Score of Dungeon Runs","total-score-of-dungeon-runs",0,[6,14,122],[["/practice/#total-score-of-dungeon-runs","Solution"]]],[3772,"Maximum Subgraph Score in a Tree","maximum-subgraph-score-in-a-tree",0,[168,41,6,48],[["/practice/#maximum-subgraph-score-in-a-tree","Solution"]]],[3773,"Maximum Number of Equal Length Runs","maximum-number-of-equal-length-runs",0,[71,155,36],[["/practice/#maximum-number-of-equal-length-runs","Solution"]]],[3774,"Absolute Difference Between Maximum and Minimum K Elements","absolute-difference-between-maximum-and-minimum-k-elements",0,[6,150],[["/practice/#absolute-difference-between-maximum-and-minimum-k-elements","Solution"]]],[3775,"Reverse Words With Same Vowel Count","reverse-words-with-same-vowel-count",0,[172,155,145],[["/practice/#reverse-words-with-same-vowel-count","Solution"]]],[3776,"Minimum Moves to Balance Circular Array","minimum-moves-to-balance-circular-array",0,[68,6,150],[["/practice/#minimum-moves-to-balance-circular-array","Solution"]]],[3777,"Minimum Deletions to Make Alternating Substring","minimum-deletions-to-make-alternating-substring",0,[139,155],[["/practice/#minimum-deletions-to-make-alternating-substring","Solution"]]],[3778,"Minimum Distance Excluding One Maximum Weighted Edge","minimum-distance-excluding-one-maximum-weighted-edge",0,[],[["/practice/#minimum-distance-excluding-one-maximum-weighted-edge","Solution"]]],[3779,"Minimum Number of Operations to Have Distinct Elements","minimum-number-of-operations-to-have-distinct-elements",0,[6,71],[["/practice/#minimum-number-of-operations-to-have-distinct-elements","Solution"]]],[3780,"Maximum Sum of Three Numbers Divisible by Three","maximum-sum-of-three-numbers-divisible-by-three",0,[68,6,150,72],[["/practice/#maximum-sum-of-three-numbers-divisible-by-three","Solution"]]],[3781,"Maximum Score After Binary Swaps","maximum-score-after-binary-swaps",0,[68,6,155,72],[["/practice/#maximum-score-after-binary-swaps","Solution"]]],[3782,"Last Remaining Integer After Alternating Deletion Operations","last-remaining-integer-after-alternating-deletion-operations",0,[134,95],[["/practice/#last-remaining-integer-after-alternating-deletion-operations","Solution"]]],[3783,"Mirror Distance of an Integer","mirror-distance-of-an-integer",0,[95],[["/practice/#mirror-distance-of-an-integer","Solution"]]],[3784,"Minimum Deletion Cost to Make All Characters Equal","minimum-deletion-cost-to-make-all-characters-equal",0,[6,71,155,50],[["/practice/#minimum-deletion-cost-to-make-all-characters-equal","Solution"]]],[3785,"Minimum Swaps to Avoid Forbidden Values","minimum-swaps-to-avoid-forbidden-values",0,[68,6,71,36],[["/practice/#minimum-swaps-to-avoid-forbidden-values","Solution"]]],[3786,"Total Sum of Interaction Cost in Tree Groups","total-sum-of-interaction-cost-in-tree-groups",0,[168,41,6],[["/practice/#total-sum-of-interaction-cost-in-tree-groups","Solution"]]],[3787,"Find Diameter Endpoints of a Tree","find-diameter-endpoints-of-a-tree",0,[168,25,64],[["/practice/#find-diameter-endpoints-of-a-tree","Solution"]]],[3788,"Maximum Score of a Split","maximum-score-of-a-split",0,[6,122],[["/practice/#maximum-score-of-a-split","Solution"]]],[3789,"Minimum Cost to Acquire Required Items","minimum-cost-to-acquire-required-items",0,[68,95],[["/practice/#minimum-cost-to-acquire-required-items","Solution"]]],[3790,"Smallest All-Ones Multiple","smallest-all-ones-multiple",0,[71,95],[["/practice/#smallest-all-ones-multiple","Solution"]]],[3791,"Number of Balanced Integers in a Range","number-of-balanced-integers-in-a-range",0,[48],[["/practice/#number-of-balanced-integers-in-a-range","Solution"]]],[3792,"Sum of Increasing Product Blocks","sum-of-increasing-product-blocks",0,[95,145],[["/practice/#sum-of-increasing-product-blocks","Solution"]]],[3793,"Find Users with High Token Usage","find-users-with-high-token-usage",1,[40],[["/practice/#find-users-with-high-token-usage","Solution"]]],[3794,"Reverse String Prefix","reverse-string-prefix",0,[172,155],[["/practice/#reverse-string-prefix","Solution"]]],[3795,"Minimum Subarray Length With Distinct Sum At Least K","minimum-subarray-length-with-distinct-sum-at-least-k",0,[6,71,146],[["/practice/#minimum-subarray-length-with-distinct-sum-at-least-k","Solution"]]],[3796,"Find Maximum Value in a Constrained Sequence","find-maximum-value-in-a-constrained-sequence",0,[68,6],[["/practice/#find-maximum-value-in-a-constrained-sequence","Solution"]]],[3797,"Count Routes to Climb a Rectangular Grid","count-routes-to-climb-a-rectangular-grid",0,[6,48,96,122],[["/practice/#count-routes-to-climb-a-rectangular-grid","Solution"]]],[3798,"Largest Even Number","largest-even-number",0,[155],[["/practice/#largest-even-number","Solution"]]],[3799,"Word Squares II","word-squares-ii",0,[6,155,8,50,150],[["/practice/#word-squares-ii","Solution"]]],[3800,"Minimum Cost to Make Two Binary Strings Equal","minimum-cost-to-make-two-binary-strings-equal",0,[68,155],[["/practice/#minimum-cost-to-make-two-binary-strings-equal","Solution"]]],[3801,"Minimum Cost to Merge Sorted Lists","minimum-cost-to-merge-sorted-lists",0,[18,6,172,14,48],[["/practice/#minimum-cost-to-merge-sorted-lists","Solution"]]],[3802,"Number of Ways to Paint Sheets","number-of-ways-to-paint-sheets",0,[],[["/practice/#number-of-ways-to-paint-sheets","Solution"]]],[3803,"Count Residue Prefixes","count-residue-prefixes",0,[71,155],[["/practice/#count-residue-prefixes","Solution"]]],[3804,"Number of Centered Subarrays","number-of-centered-subarrays",0,[6,71,50],[["/practice/#number-of-centered-subarrays","Solution"]]],[3805,"Count Caesar Cipher Pairs","count-caesar-cipher-pairs",0,[6,71,95,155,36],[["/practice/#count-caesar-cipher-pairs","Solution"]]],[3806,"Maximum Bitwise AND After Increment Operations","maximum-bitwise-and-after-increment-operations",0,[68,18,6,150],[["/practice/#maximum-bitwise-and-after-increment-operations","Solution"]]],[3807,"Minimum Cost to Repair Edges to Traverse a Graph","minimum-cost-to-repair-edges-to-traverse-a-graph",0,[25,64,14],[["/practice/#minimum-cost-to-repair-edges-to-traverse-a-graph","Solution"]]],[3808,"Find Emotionally Consistent Users","find-emotionally-consistent-users",1,[40],[["/practice/#find-emotionally-consistent-users","Solution"]]],[3809,"Best Reachable Tower","best-reachable-tower",0,[6],[["/practice/#best-reachable-tower","Solution"]]],[3810,"Minimum Operations to Reach Target Array","minimum-operations-to-reach-target-array",0,[68,6,71],[["/practice/#minimum-operations-to-reach-target-array","Solution"]]],[3811,"Number of Alternating XOR Partitions","number-of-alternating-xor-partitions",0,[18,6,71,48],[["/practice/#number-of-alternating-xor-partitions","Solution"]]],[3812,"Minimum Edge Toggles on a Tree","minimum-edge-toggles-on-a-tree",0,[168,41,64,165,150],[["/practice/#minimum-edge-toggles-on-a-tree","Solution"]]],[3813,"Vowel-Consonant Score","vowel-consonant-score",0,[155,145],[["/practice/#vowel-consonant-score","Solution"]]],[3814,"Maximum Capacity Within Budget","maximum-capacity-within-budget",0,[6,172,14,150],[["/practice/#maximum-capacity-within-budget","Solution"]]],[3815,"Design Auction System","design-auction-system",0,[],[["/practice/#design-auction-system","Solution"]]],[3816,"Lexicographically Smallest String After Deleting Duplicate Characters","lexicographically-smallest-string-after-deleting-duplicate-characters",0,[154,68,71,155,108],[["/practice/#lexicographically-smallest-string-after-deleting-duplicate-characters","Solution"]]],[3817,"Good Indices in a Digit String","good-indices-in-a-digit-string",0,[],[["/practice/#good-indices-in-a-digit-string","Solution"]]],[3818,"Minimum Prefix Removal to Make Array Strictly Increasing","minimum-prefix-removal-to-make-array-strictly-increasing",0,[6],[["/practice/#minimum-prefix-removal-to-make-array-strictly-increasing","Solution"]]],[3819,"Rotate Non Negative Elements","rotate-non-negative-elements",0,[],[["/practice/#rotate-non-negative-elements","Solution"]]],[3820,"Pythagorean Distance Nodes in a Tree","pythagorean-distance-nodes-in-a-tree",0,[168,25],[["/practice/#pythagorean-distance-nodes-in-a-tree","Solution"]]],[3821,"Find Nth Smallest Integer With K One Bits","find-nth-smallest-integer-with-k-one-bits",0,[18,95,33],[["/practice/#find-nth-smallest-integer-with-k-one-bits","Solution"]]],[3822,"Design Order Management System","design-order-management-system",0,[42,71],[["/practice/#design-order-management-system","Solution"]]],[3823,"Reverse Letters Then Special Characters in a String","reverse-letters-then-special-characters-in-a-string",0,[172,155,145],[["/practice/#reverse-letters-then-special-characters-in-a-string","Solution"]]],[3824,"Minimum K to Reduce Array Within Limit","minimum-k-to-reduce-array-within-limit",0,[6,14],[["/practice/#minimum-k-to-reduce-array-within-limit","Solution"]]],[3825,"Longest Strictly Increasing Subsequence With Non-Zero Bitwise AND","longest-strictly-increasing-subsequence-with-non-zero-bitwise-and",0,[],[["/practice/#longest-strictly-increasing-subsequence-with-non-zero-bitwise-and","Solution"]]],[3826,"Minimum Partition Score","minimum-partition-score",0,[128,6,46,48,122,107],[["/practice/#minimum-partition-score","Solution"]]],[3827,"Count Monobit Integers","count-monobit-integers",0,[18,50],[["/practice/#count-monobit-integers","Solution"]]],[3828,"Final Element After Subarray Deletions","final-element-after-subarray-deletions",0,[24,6,95,62],[["/practice/#final-element-after-subarray-deletions","Solution"]]],[3829,"Design Ride Sharing System","design-ride-sharing-system",0,[42,128,71,39],[["/practice/#design-ride-sharing-system","Solution"]]],[3830,"Longest Alternating Subarray After Removing At Most One Element","longest-alternating-subarray-after-removing-at-most-one-element",0,[6,48,50],[["/practice/#longest-alternating-subarray-after-removing-at-most-one-element","Solution"]]],[3831,"Median of a Binary Search Tree Level","median-of-a-binary-search-tree-level",0,[168,41,25,15,16],[["/practice/#median-of-a-binary-search-tree-level","Solution"]]],[3832,"Find Users with Persistent Behavior Patterns","find-users-with-persistent-behavior-patterns",1,[40],[["/practice/#find-users-with-persistent-behavior-patterns","Solution"]]],[3833,"Count Dominant Indices","count-dominant-indices",0,[6,50],[["/practice/#count-dominant-indices","Solution"]]],[3834,"Merge Adjacent Equal Elements","merge-adjacent-equal-elements",0,[154,6,145],[["/practice/#merge-adjacent-equal-elements","Solution"]]],[3835,"Count Subarrays With Cost Less Than or Equal to K","count-subarrays-with-cost-less-than-or-equal-to-k",0,[128,6,107],[["/practice/#count-subarrays-with-cost-less-than-or-equal-to-k","Solution"]]],[3836,"Maximum Score Using Exactly K Pairs","maximum-score-using-exactly-k-pairs",0,[6,48],[["/practice/#maximum-score-using-exactly-k-pairs","Solution"]]],[3837,"Delayed Count of Equal Elements","delayed-count-of-equal-elements",0,[6,71,36],[["/practice/#delayed-count-of-equal-elements","Solution"]]],[3838,"Weighted Word Mapping","weighted-word-mapping",0,[6,155,145],[["/practice/#weighted-word-mapping","Solution"]]],[3839,"Number of Prefix Connected Groups","number-of-prefix-connected-groups",0,[6,71,155,36],[["/practice/#number-of-prefix-connected-groups","Solution"]]],[3840,"House Robber V","house-robber-v",0,[6,48],[["/practice/#house-robber-v","Solution"]]],[3841,"Palindromic Path Queries in a Tree","palindromic-path-queries-in-a-tree",0,[18,168,41,139,6,155,46],[["/practice/#palindromic-path-queries-in-a-tree","Solution"]]],[3842,"Toggle Light Bulbs","toggle-light-bulbs",0,[6,71,150,145],[["/practice/#toggle-light-bulbs","Solution"]]],[3843,"First Element with Unique Frequency","first-element-with-unique-frequency",0,[6,71,36],[["/practice/#first-element-with-unique-frequency","Solution"]]],[3844,"Longest Almost-Palindromic Substring","longest-almost-palindromic-substring",0,[172,155,48],[["/practice/#longest-almost-palindromic-substring","Solution"]]],[3845,"Maximum Subarray XOR with Bounded Range","maximum-subarray-xor-with-bounded-range",0,[18,171,128,6,122,146,107],[["/practice/#maximum-subarray-xor-with-bounded-range","Solution"]]],[3846,"Total Distance to Type a String Using One Finger","total-distance-to-type-a-string-using-one-finger",0,[71,155],[["/practice/#total-distance-to-type-a-string-using-one-finger","Solution"]]],[3847,"Find the Score Difference in a Game","find-the-score-difference-in-a-game",0,[6,145],[["/practice/#find-the-score-difference-in-a-game","Solution"]]],[3848,"Check Digitorial Permutation","check-digitorial-permutation",0,[95,36],[["/practice/#check-digitorial-permutation","Solution"]]],[3849,"Maximum Bitwise XOR After Rearrangement","maximum-bitwise-xor-after-rearrangement",0,[68,18,155],[["/practice/#maximum-bitwise-xor-after-rearrangement","Solution"]]],[3850,"Count Sequences to K","count-sequences-to-k",0,[100,6,95,48,112],[["/practice/#count-sequences-to-k","Solution"]]],[3851,"Maximum Requests Without Violating the Limit","maximum-requests-without-violating-the-limit",0,[68,6,71,150,146],[["/practice/#maximum-requests-without-violating-the-limit","Solution"]]],[3852,"Smallest Pair With Different Frequencies","smallest-pair-with-different-frequencies",0,[6,71,36],[["/practice/#smallest-pair-with-different-frequencies","Solution"]]],[3853,"Merge Close Characters","merge-close-characters",0,[71,155],[["/practice/#merge-close-characters","Solution"]]],[3854,"Minimum Operations to Make Array Parity Alternating","minimum-operations-to-make-array-parity-alternating",0,[68,6],[["/practice/#minimum-operations-to-make-array-parity-alternating","Solution"]]],[3855,"Sum of K-Digit Numbers in a Range","sum-of-k-digit-numbers-in-a-range",0,[95,46,33,112],[["/practice/#sum-of-k-digit-numbers-in-a-range","Solution"]]],[3856,"Trim Trailing Vowels","trim-trailing-vowels",0,[155],[["/practice/#trim-trailing-vowels","Solution"]]],[3857,"Minimum Cost to Split into Ones","minimum-cost-to-split-into-ones",0,[95,48],[["/practice/#minimum-cost-to-split-into-ones","Solution"]]],[3858,"Minimum Bitwise OR From Grid","minimum-bitwise-or-from-grid",0,[],[["/practice/#minimum-bitwise-or-from-grid","Solution"]]],[3859,"Count Subarrays With K Distinct Integers","count-subarrays-with-k-distinct-integers",0,[6,71,36,146],[["/practice/#count-subarrays-with-k-distinct-integers","Solution"]]],[3860,"Unique Email Groups","unique-email-groups",0,[6,71,155],[["/practice/#unique-email-groups","Solution"]]],[3861,"Minimum Capacity Box","minimum-capacity-box",0,[6],[["/practice/#minimum-capacity-box","Solution"]]],[3862,"Find the Smallest Balanced Index","find-the-smallest-balanced-index",0,[6,122],[["/practice/#find-the-smallest-balanced-index","Solution"]]],[3863,"Minimum Operations to Sort a String","minimum-operations-to-sort-a-string",0,[155],[["/practice/#minimum-operations-to-sort-a-string","Solution"]]],[3864,"Minimum Cost to Partition a Binary String","minimum-cost-to-partition-a-binary-string",0,[155,46,122],[["/practice/#minimum-cost-to-partition-a-binary-string","Solution"]]],[3865,"Reverse K Subarrays","reverse-k-subarrays",0,[6,172],[["/practice/#reverse-k-subarrays","Solution"]]],[3866,"First Unique Even Element","first-unique-even-element",0,[6,71,36],[["/practice/#first-unique-even-element","Solution"]]],[3867,"Sum of GCD of Formed Pairs","sum-of-gcd-of-formed-pairs",0,[6,95,172,112,150,145],[["/practice/#sum-of-gcd-of-formed-pairs","Solution"]]],[3868,"Minimum Cost to Equalize Arrays Using Swaps","minimum-cost-to-equalize-arrays-using-swaps",0,[68,6,71,36],[["/practice/#minimum-cost-to-equalize-arrays-using-swaps","Solution"]]],[3869,"Count Fancy Numbers in a Range","count-fancy-numbers-in-a-range",0,[95,48],[["/practice/#count-fancy-numbers-in-a-range","Solution"]]],[3870,"Count Commas in Range","count-commas-in-range",0,[95],[["/practice/#count-commas-in-range","Solution"]]],[3871,"Count Commas in Range II","count-commas-in-range-ii",0,[95],[["/practice/#count-commas-in-range-ii","Solution"]]],[3872,"Longest Arithmetic Sequence After Changing At Most One Element","longest-arithmetic-sequence-after-changing-at-most-one-element",0,[6,50],[["/practice/#longest-arithmetic-sequence-after-changing-at-most-one-element","Solution"]]],[3873,"Maximum Points Activated with One Addition","maximum-points-activated-with-one-addition",0,[174,6,71],[["/practice/#maximum-points-activated-with-one-addition","Solution"]]],[3874,"Valid Subarrays With Exactly One Peak","valid-subarrays-with-exactly-one-peak",0,[6,95],[["/practice/#valid-subarrays-with-exactly-one-peak","Solution"]]],[3875,"Construct Uniform Parity Array I","construct-uniform-parity-array-i",0,[6,95],[["/practice/#construct-uniform-parity-array-i","Solution"]]],[3876,"Construct Uniform Parity Array II","construct-uniform-parity-array-ii",0,[6,95],[["/practice/#construct-uniform-parity-array-ii","Solution"]]],[3877,"Minimum Removals to Achieve Target XOR","minimum-removals-to-achieve-target-xor",0,[18,6,48],[["/practice/#minimum-removals-to-achieve-target-xor","Solution"]]],[3878,"Count Good Subarrays","count-good-subarrays",0,[154,18,6,108],[["/practice/#count-good-subarrays","Solution"]]],[3879,"Maximum Distinct Path Sum in a Binary Tree","maximum-distinct-path-sum-in-a-binary-tree",0,[168,41,71,16],[["/practice/#maximum-distinct-path-sum-in-a-binary-tree","Solution"]]],[3880,"Minimum Absolute Difference Between Two Values","minimum-absolute-difference-between-two-values",0,[6,50],[["/practice/#minimum-absolute-difference-between-two-values","Solution"]]],[3881,"Direction Assignments with Exactly K Visible People","direction-assignments-with-exactly-k-visible-people",0,[95,33],[["/practice/#direction-assignments-with-exactly-k-visible-people","Solution"]]],[3882,"Minimum XOR Path in a Grid","minimum-xor-path-in-a-grid",0,[18,6,48,96],[["/practice/#minimum-xor-path-in-a-grid","Solution"]]],[3883,"Count Non Decreasing Arrays With Given Digit Sums","count-non-decreasing-arrays-with-given-digit-sums",0,[6,48,122],[["/practice/#count-non-decreasing-arrays-with-given-digit-sums","Solution"]]],[3884,"First Matching Character From Both Ends","first-matching-character-from-both-ends",0,[172,155],[["/practice/#first-matching-character-from-both-ends","Solution"]]],[3885,"Design Event Manager","design-event-manager",0,[42,6,71,113,72],[["/practice/#design-event-manager","Solution"]]],[3886,"Sum of Sortable Integers","sum-of-sortable-integers",0,[6,95,50,150],[["/practice/#sum-of-sortable-integers","Solution"]]],[3887,"Incremental Even-Weighted Cycle Queries","incremental-even-weighted-cycle-queries",0,[],[["/practice/#incremental-even-weighted-cycle-queries","Solution"]]],[3888,"Minimum Operations to Make All Grid Elements Equal","minimum-operations-to-make-all-grid-elements-equal",0,[6,95,96,122],[["/practice/#minimum-operations-to-make-all-grid-elements-equal","Solution"]]],[3889,"Mirror Frequency Distance","mirror-frequency-distance",0,[71,155,36],[["/practice/#mirror-frequency-distance","Solution"]]],[3890,"Integers With Multiple Sum of Two Cubes","integers-with-multiple-sum-of-two-cubes",0,[71,36,50,150],[["/practice/#integers-with-multiple-sum-of-two-cubes","Solution"]]],[3891,"Minimum Increase to Maximize Special Indices","minimum-increase-to-maximize-special-indices",0,[68,6,48,122],[["/practice/#minimum-increase-to-maximize-special-indices","Solution"]]],[3892,"Minimum Operations to Achieve At Least K Peaks","minimum-operations-to-achieve-at-least-k-peaks",0,[6,48],[["/practice/#minimum-operations-to-achieve-at-least-k-peaks","Solution"]]],[3893,"Maximum Team Size with Overlapping Intervals","maximum-team-size-with-overlapping-intervals",0,[],[["/practice/#maximum-team-size-with-overlapping-intervals","Solution"]]],[3894,"Traffic Signal Color","traffic-signal-color",0,[95,155,145],[["/practice/#traffic-signal-color","Solution"]]],[3895,"Count Digit Appearances","count-digit-appearances",0,[6,95],[["/practice/#count-digit-appearances","Solution"]]],[3896,"Minimum Operations to Transform Array into Alternating Prime","minimum-operations-to-transform-array-into-alternating-prime",0,[6,95,172,14,112,150],[["/practice/#minimum-operations-to-transform-array-into-alternating-prime","Solution"]]],[3897,"Maximum Value of Concatenated Binary Segments","maximum-value-of-concatenated-binary-segments",0,[68,6,150],[["/practice/#maximum-value-of-concatenated-binary-segments","Solution"]]],[3898,"Find the Degree of Each Vertex","find-the-degree-of-each-vertex",0,[64,6,96],[["/practice/#find-the-degree-of-each-vertex","Solution"]]],[3899,"Angles of a Triangle","angles-of-a-triangle",0,[63,6,95],[["/practice/#angles-of-a-triangle","Solution"]]],[3900,"Longest Balanced Substring After One Swap","longest-balanced-substring-after-one-swap",0,[71,155,122],[["/practice/#longest-balanced-substring-after-one-swap","Solution"]]],[3901,"Good Subsequence Queries","good-subsequence-queries",0,[139,6,95,112],[["/practice/#good-subsequence-queries","Solution"]]],[3902,"Zigzag Level Sum of Binary Tree","zigzag-level-sum-of-binary-tree",0,[168,25,16],[["/practice/#zigzag-level-sum-of-binary-tree","Solution"]]],[3903,"Smallest Stable Index I","smallest-stable-index-i",0,[6,122],[["/practice/#smallest-stable-index-i","Solution"]]],[3904,"Smallest Stable Index II","smallest-stable-index-ii",0,[6,122],[["/practice/#smallest-stable-index-ii","Solution"]]],[3905,"Multi Source Flood Fill","multi-source-flood-fill",0,[25,6,96],[["/practice/#multi-source-flood-fill","Solution"]]],[3906,"Count Good Integers on a Grid Path","count-good-integers-on-a-grid-path",0,[48],[["/practice/#count-good-integers-on-a-grid-path","Solution"]]],[3907,"Count Smaller Elements With Opposite Parity","count-smaller-elements-with-opposite-parity",0,[],[["/practice/#count-smaller-elements-with-opposite-parity","Solution"]]],[3908,"Valid Digit Number","valid-digit-number",0,[95],[["/practice/#valid-digit-number","Solution"]]],[3909,"Compare Sums of Bitonic Parts","compare-sums-of-bitonic-parts",0,[],[["/practice/#compare-sums-of-bitonic-parts","Solution"]]],[3910,"Count Connected Subgraphs with Even Node Sum","count-connected-subgraphs-with-even-node-sum",0,[18,41,25,174,64,6,50],[["/practice/#count-connected-subgraphs-with-even-node-sum","Solution"]]],[3911,"K-th Smallest Remaining Even Integer in Subarray Queries","k-th-smallest-remaining-even-integer-in-subarray-queries",0,[],[["/practice/#k-th-smallest-remaining-even-integer-in-subarray-queries","Solution"]]],[3912,"Valid Elements in an Array","valid-elements-in-an-array",0,[6],[["/practice/#valid-elements-in-an-array","Solution"]]],[3913,"Sort Vowels by Frequency","sort-vowels-by-frequency",0,[],[["/practice/#sort-vowels-by-frequency","Solution"]]],[3914,"Minimum Operations to Make Array Non Decreasing","minimum-operations-to-make-array-non-decreasing",0,[68,6],[["/practice/#minimum-operations-to-make-array-non-decreasing","Solution"]]],[3915,"Maximum Sum of Alternating Subsequence With Distance at Least K","maximum-sum-of-alternating-subsequence-with-distance-at-least-k",0,[139,6,48],[["/practice/#maximum-sum-of-alternating-subsequence-with-distance-at-least-k","Solution"]]],[3916,"Number of ZigZag Arrays III","number-of-zigzag-arrays-iii",0,[95,48,122],[["/practice/#number-of-zigzag-arrays-iii","Solution"]]],[3917,"Count Indices With Opposite Parity","count-indices-with-opposite-parity",0,[6],[["/practice/#count-indices-with-opposite-parity","Solution"]]],[3918,"Sum of Primes Between Number and Its Reverse","sum-of-primes-between-number-and-its-reverse",0,[95,112],[["/practice/#sum-of-primes-between-number-and-its-reverse","Solution"]]],[3919,"Minimum Cost to Move Between Indices","minimum-cost-to-move-between-indices",0,[68,6,122],[["/practice/#minimum-cost-to-move-between-indices","Solution"]]],[3920,"Maximize Fixed Points After Deletions","maximize-fixed-points-after-deletions",0,[],[["/practice/#maximize-fixed-points-after-deletions","Solution"]]],[3921,"Score Validator","score-validator",0,[],[["/practice/#score-validator","Solution"]]],[3922,"Minimum Flips to Make Binary String Coherent","minimum-flips-to-make-binary-string-coherent",0,[155],[["/practice/#minimum-flips-to-make-binary-string-coherent","Solution"]]],[3923,"Minimum Generations to Target Point","minimum-generations-to-target-point",0,[6,71,145],[["/practice/#minimum-generations-to-target-point","Solution"]]],[3924,"Minimum Threshold Path With Limited Heavy Edges","minimum-threshold-path-with-limited-heavy-edges",0,[],[["/practice/#minimum-threshold-path-with-limited-heavy-edges","Solution"]]],[3925,"Concatenate Array With Reverse","concatenate-array-with-reverse",0,[6,145],[["/practice/#concatenate-array-with-reverse","Solution"]]],[3926,"Count Valid Word Occurrences","count-valid-word-occurrences",0,[],[["/practice/#count-valid-word-occurrences","Solution"]]],[3927,"Minimize Array Sum Using Divisible Replacements","minimize-array-sum-using-divisible-replacements",0,[68,6,71,95,112],[["/practice/#minimize-array-sum-using-divisible-replacements","Solution"]]],[3928,"Minimum Cost to Buy Apples II","minimum-cost-to-buy-apples-ii",0,[64,6,142,72],[["/practice/#minimum-cost-to-buy-apples-ii","Solution"]]],[3929,"Minimum Partition Score II","minimum-partition-score-ii",0,[6,14,48,122],[["/practice/#minimum-partition-score-ii","Solution"]]],[3930,"Power Update After K-th Largest Insertion II","power-update-after-k-th-largest-insertion-ii",0,[139,6,71,95,150],[["/practice/#power-update-after-k-th-largest-insertion-ii","Solution"]]],[3931,"Check Adjacent Digit Differences","check-adjacent-digit-differences",0,[155],[["/practice/#check-adjacent-digit-differences","Solution"]]],[3932,"Count K-th Roots in a Range","count-k-th-roots-in-a-range",0,[95,14],[["/practice/#count-k-th-roots-in-a-range","Solution"]]],[3933,"Largest Local Values in a Matrix II","largest-local-values-in-a-matrix-ii",0,[6,96,122],[["/practice/#largest-local-values-in-a-matrix-ii","Solution"]]],[3934,"Smallest Unique Subarray","smallest-unique-subarray",0,[6,71,14,158,70,137],[["/practice/#smallest-unique-subarray","Solution"]]],[3935,"Power Update After K-th Largest Insertion I","power-update-after-k-th-largest-insertion-i",0,[139,6,71,95,150,72],[["/practice/#power-update-after-k-th-largest-insertion-i","Solution"]]],[3936,"Minimum Swaps to Move Zeros to End","minimum-swaps-to-move-zeros-to-end",0,[6,172],[["/practice/#minimum-swaps-to-move-zeros-to-end","Solution"]]],[3937,"Minimum Operations to Make Array Modulo Alternating I","minimum-operations-to-make-array-modulo-alternating-i",0,[6,50],[["/practice/#minimum-operations-to-make-array-modulo-alternating-i","Solution"]]],[3938,"Maximum Path Intersection Sum in a Grid","maximum-path-intersection-sum-in-a-grid",0,[6,48,96,122],[["/practice/#maximum-path-intersection-sum-in-a-grid","Solution"]]],[3939,"Count Non Adjacent Subsets in a Rooted Tree","count-non-adjacent-subsets-in-a-rooted-tree",0,[168,41,6,48],[["/practice/#count-non-adjacent-subsets-in-a-rooted-tree","Solution"]]],[3940,"Limit Occurrences in Sorted Array","limit-occurrences-in-sorted-array",0,[6,172],[["/practice/#limit-occurrences-in-sorted-array","Solution"]]],[3941,"Password Strength","password-strength",0,[71,155],[["/practice/#password-strength","Solution"]]],[3942,"Minimum Operations to Sort a Permutation","minimum-operations-to-sort-a-permutation",0,[6],[["/practice/#minimum-operations-to-sort-a-permutation","Solution"]]],[3943,"Number of Pairs After Increment","number-of-pairs-after-increment",0,[6,71,46,36],[["/practice/#number-of-pairs-after-increment","Solution"]]],[3944,"Minimum Operations to Make Array Modulo Alternating II","minimum-operations-to-make-array-modulo-alternating-ii",0,[6,50],[["/practice/#minimum-operations-to-make-array-modulo-alternating-ii","Solution"]]],[3945,"Digit Frequency Score","digit-frequency-score",0,[71,95],[["/practice/#digit-frequency-score","Solution"]]],[3946,"Maximum Number of Items From Sale I","maximum-number-of-items-from-sale-i",0,[68,6,48],[["/practice/#maximum-number-of-items-from-sale-i","Solution"]]],[3947,"Maximum Number of Items From Sale II","maximum-number-of-items-from-sale-ii",0,[68,6,150,72],[["/practice/#maximum-number-of-items-from-sale-ii","Solution"]]],[3948,"Lexicographically Maximum MEX Array","lexicographically-maximum-mex-array",0,[68,128,6,71],[["/practice/#lexicographically-maximum-mex-array","Solution"]]],[3949,"Subtree Inversion Sum II","subtree-inversion-sum-ii",0,[168,41,6,48],[["/practice/#subtree-inversion-sum-ii","Solution"]]],[3950,"Exactly One Consecutive Set Bits Pair","exactly-one-consecutive-set-bits-pair",0,[18],[["/practice/#exactly-one-consecutive-set-bits-pair","Solution"]]],[3951,"Minimum Energy to Maintain Brightness","minimum-energy-to-maintain-brightness",0,[6,150],[["/practice/#minimum-energy-to-maintain-brightness","Solution"]]],[3952,"Maximum Total Value of Covered Indices","maximum-total-value-of-covered-indices",0,[68,6,155,48],[["/practice/#maximum-total-value-of-covered-indices","Solution"]]],[3953,"Maximum Score with Co-Prime Element","maximum-score-with-co-prime-element",0,[6,71,95,33,50,112],[["/practice/#maximum-score-with-co-prime-element","Solution"]]],[3954,"Sum of Compatible Numbers in Range I","sum-of-compatible-numbers-in-range-i",0,[18,48,50],[["/practice/#sum-of-compatible-numbers-in-range-i","Solution"]]],[3955,"Valid Binary Strings With Cost Limit","valid-binary-strings-with-cost-limit",0,[18,155,8,50],[["/practice/#valid-binary-strings-with-cost-limit","Solution"]]],[3956,"Maximum Sum of M Non-Overlapping Subarrays I","maximum-sum-of-m-non-overlapping-subarrays-i",0,[128,6,14,48,122,146,107],[["/practice/#maximum-sum-of-m-non-overlapping-subarrays-i","Solution"]]],[3957,"Maximum Sum of M Non-Overlapping Subarrays II","maximum-sum-of-m-non-overlapping-subarrays-ii",0,[128,6,14,48,122,146,107],[["/practice/#maximum-sum-of-m-non-overlapping-subarrays-ii","Solution"]]],[3958,"Minimum Cost to Split into Ones II","minimum-cost-to-split-into-ones-ii",0,[95],[["/practice/#minimum-cost-to-split-into-ones-ii","Solution"]]],[3959,"Check Good Integer","check-good-integer",0,[95,145],[["/practice/#check-good-integer","Solution"]]],[3960,"Frequency Balance Subarray","frequency-balance-subarray",0,[6,71,36],[["/practice/#frequency-balance-subarray","Solution"]]],[3961,"Maximize Sum of Device Ratings","maximize-sum-of-device-ratings",0,[],[["/practice/#maximize-sum-of-device-ratings","Solution"]]],[3962,"Maximum Subarray Sum After at Most K Swaps","maximum-subarray-sum-after-at-most-k-swaps",0,[68,12,6,71,113,150,72],[["/practice/#maximum-subarray-sum-after-at-most-k-swaps","Solution"]]],[3963,"Create Grid With Exactly One Path","create-grid-with-exactly-one-path",0,[],[["/practice/#create-grid-with-exactly-one-path","Solution"]]],[3964,"Minimum Lights to Illuminate a Road","minimum-lights-to-illuminate-a-road",0,[6,122],[["/practice/#minimum-lights-to-illuminate-a-road","Solution"]]],[3965,"Finish Time of Tasks I","finish-time-of-tasks-i",0,[168,41,6,48],[["/practice/#finish-time-of-tasks-i","Solution"]]],[3966,"Count Good Integers in a Range","count-good-integers-in-a-range",0,[95,48],[["/practice/#count-good-integers-in-a-range","Solution"]]],[3967,"Finish Time of Tasks II","finish-time-of-tasks-ii",0,[168,41,6,48],[["/practice/#finish-time-of-tasks-ii","Solution"]]],[3968,"Maximum Manhattan Distance After All Moves","maximum-manhattan-distance-after-all-moves",0,[95,155,36],[["/practice/#maximum-manhattan-distance-after-all-moves","Solution"]]],[3969,"Valid Subarrays With Matching Sum Digits I","valid-subarrays-with-matching-sum-digits-i",0,[6,71,50,122,146],[["/practice/#valid-subarrays-with-matching-sum-digits-i","Solution"]]],[3970,"Shortest Path With At Most K Consecutive Identical Characters","shortest-path-with-at-most-k-consecutive-identical-characters",0,[64,155,142,72],[["/practice/#shortest-path-with-at-most-k-consecutive-identical-characters","Solution"]]],[3971,"Maximum Total Value","maximum-total-value",0,[68,6,95,14],[["/practice/#maximum-total-value","Solution"]]],[3972,"Valid Subarrays With Matching Sum Digits II","valid-subarrays-with-matching-sum-digits-ii",0,[6,71,122,146],[["/practice/#valid-subarrays-with-matching-sum-digits-ii","Solution"]]],[3973,"Distinct Gate Paths to LCA","distinct-gate-paths-to-lca",0,[18,168,41,6,95,48],[["/practice/#distinct-gate-paths-to-lca","Solution"]]],[3974,"Maximum Total Sum of K Selected Elements","maximum-total-sum-of-k-selected-elements",0,[68,6,150],[["/practice/#maximum-total-sum-of-k-selected-elements","Solution"]]],[3975,"Filter Occupied Intervals","filter-occupied-intervals",0,[6,150],[["/practice/#filter-occupied-intervals","Solution"]]],[3976,"Maximum Subarray Sum After Multiplier","maximum-subarray-sum-after-multiplier",0,[6,48],[["/practice/#maximum-subarray-sum-after-multiplier","Solution"]]],[3977,"Minimum Time to Reach Target With Limited Power","minimum-time-to-reach-target-with-limited-power",0,[64,6,48,142,72],[["/practice/#minimum-time-to-reach-target-with-limited-power","Solution"]]],[3978,"Unique Middle Element","unique-middle-element",0,[6,36],[["/practice/#unique-middle-element","Solution"]]],[3979,"Maximum Valid Pair Sum","maximum-valid-pair-sum",0,[6,50],[["/practice/#maximum-valid-pair-sum","Solution"]]],[3980,"Minimum Operations to Transform Binary String","minimum-operations-to-transform-binary-string",0,[68,155,48],[["/practice/#minimum-operations-to-transform-binary-string","Solution"]]],[3981,"Count Distinct Ways to Form Target from Two Strings","count-distinct-ways-to-form-target-from-two-strings",0,[155,48,122],[["/practice/#count-distinct-ways-to-form-target-from-two-strings","Solution"]]],[3982,"Sum of Integers with Maximum Digit Range","sum-of-integers-with-maximum-digit-range",0,[6,95],[["/practice/#sum-of-integers-with-maximum-digit-range","Solution"]]],[3983,"Subsequence After One Replacement","subsequence-after-one-replacement",0,[172,155],[["/practice/#subsequence-after-one-replacement","Solution"]]],[3984,"Divisible Game","divisible-game",0,[6,95,48,50,112],[["/practice/#divisible-game","Solution"]]],[3985,"Palindromic Subarray Sum","palindromic-subarray-sum",0,[6,14,122,70],[["/practice/#palindromic-subarray-sum","Solution"]]],[3986,"Number of Elapsed Seconds Between Two Times","number-of-elapsed-seconds-between-two-times",0,[95,155],[["/practice/#number-of-elapsed-seconds-between-two-times","Solution"]]],[3987,"Minimum Total Cost to Process All Elements","minimum-total-cost-to-process-all-elements",0,[6,95,145],[["/practice/#minimum-total-cost-to-process-all-elements","Solution"]]],[3988,"Create Grid With Exactly K Paths I","create-grid-with-exactly-k-paths-i",0,[6,95,33,96],[["/practice/#create-grid-with-exactly-k-paths-i","Solution"]]],[3989,"Maximum Consistent Columns in a Grid","maximum-consistent-columns-in-a-grid",0,[6,48,96],[["/practice/#maximum-consistent-columns-in-a-grid","Solution"]]],[3990,"Create Grid With Exactly K Paths II","create-grid-with-exactly-k-paths-ii",0,[18,6,95,33,96],[["/practice/#create-grid-with-exactly-k-paths-ii","Solution"]]],[3991,"Sort Array Using Prefix Reversals","sort-array-using-prefix-reversals",0,[25,6,71,172,70],[["/practice/#sort-array-using-prefix-reversals","Solution"]]],[3992,"Rearrange String to Avoid Character Pair","rearrange-string-to-avoid-character-pair",0,[172,155,150],[["/practice/#rearrange-string-to-avoid-character-pair","Solution"]]],[3993,"Maximum Value of an Alternating Sequence","maximum-value-of-an-alternating-sequence",0,[68,95],[["/practice/#maximum-value-of-an-alternating-sequence","Solution"]]],[3994,"Minimum Adjacent Swaps to Partition Array","minimum-adjacent-swaps-to-partition-array",0,[68,6],[["/practice/#minimum-adjacent-swaps-to-partition-array","Solution"]]],[3995,"Minimum Cost to Convert String III","minimum-cost-to-convert-string-iii",0,[6,155,48],[["/practice/#minimum-cost-to-convert-string-iii","Solution"]]],[3996,"Even Number of Knight Moves","even-number-of-knight-moves",0,[6,95],[["/practice/#even-number-of-knight-moves","Solution"]]],[3997,"Count Dominant Nodes in a Binary Tree","count-dominant-nodes-in-a-binary-tree",0,[168,41,16],[["/practice/#count-dominant-nodes-in-a-binary-tree","Solution"]]],[3998,"Transform Binary String Using Subsequence Sort","transform-binary-string-using-subsequence-sort",0,[],[["/practice/#transform-binary-string-using-subsequence-sort","Solution"]]],[3999,"Minimum Number of String Groups Through Transformations","minimum-number-of-string-groups-through-transformations",0,[71,172,155],[["/practice/#minimum-number-of-string-groups-through-transformations","Solution"]]],[4000,"Largest Integer With Given Digit Sum","largest-integer-with-given-digit-sum",0,[68,95],[["/practice/#largest-integer-with-given-digit-sum","Solution"]]],[4001,"Aggregate Two Time Series","aggregate-two-time-series",0,[6,172],[["/practice/#aggregate-two-time-series","Solution"]]],[4002,"Count Valid Sequences","count-valid-sequences",0,[95,33],[["/practice/#count-valid-sequences","Solution"]]],[4003,"Minimum Cost Path with Alternating Directions III","minimum-cost-path-with-alternating-directions-iii",0,[64,6,96,142,72],[["/practice/#minimum-cost-path-with-alternating-directions-iii","Solution"]]],[4004,"Minimum Moves to Balance Circular Array II","minimum-moves-to-balance-circular-array-ii",0,[64,6,95,103],[["/practice/#minimum-moves-to-balance-circular-array-ii","Solution"]]],[4005,"Minimum Operations to Make Array Equal III","minimum-operations-to-make-array-equal-iii",0,[6,71,95,36,112],[["/practice/#minimum-operations-to-make-array-equal-iii","Solution"]]],[4006,"Count Valid Prefixes","count-valid-prefixes",0,[155,36],[["/practice/#count-valid-prefixes","Solution"]]],[4007,"Widest Possible Fence","widest-possible-fence",0,[6,71,36,50],[["/practice/#widest-possible-fence","Solution"]]],[4008,"Minimum Initial Strength to Defeat All Monsters","minimum-initial-strength-to-defeat-all-monsters",0,[68,6,14,122],[["/practice/#minimum-initial-strength-to-defeat-all-monsters","Solution"]]],[4009,"Minimum Possible Maximum Waiting Time","minimum-possible-maximum-waiting-time",0,[100,6,48],[["/practice/#minimum-possible-maximum-waiting-time","Solution"]]],[4010,"Maximize Pair Strength Using GCD","maximize-pair-strength-using-gcd",0,[6,95,50,112],[["/practice/#maximize-pair-strength-using-gcd","Solution"]]],[4011,"Count Subarrays With Even Odd Ratio I","count-subarrays-with-even-odd-ratio-i",0,[12,139,6,46,122,101],[["/practice/#count-subarrays-with-even-odd-ratio-i","Solution"]]],[4012,"Count of Unfinished Tasks After Each Shift","count-of-unfinished-tasks-after-each-shift",0,[6,14,122],[["/practice/#count-of-unfinished-tasks-after-each-shift","Solution"]]],[4013,"Count Subarrays With Even Odd Ratio II","count-subarrays-with-even-odd-ratio-ii",0,[12,139,6,46,122,101],[["/practice/#count-subarrays-with-even-odd-ratio-ii","Solution"]]],[4014,"Minimum Total Price After Applying Discounts","minimum-total-price-after-applying-discounts",0,[],[["/practice/#minimum-total-price-after-applying-discounts","Solution"]]],[4015,"Weighted Sum of a Tree","weighted-sum-of-a-tree",0,[168,41,6],[["/practice/#weighted-sum-of-a-tree","Solution"]]],[4016,"Maximum Area of Two Non-Overlapping Square Submatrices","maximum-area-of-two-non-overlapping-square-submatrices",0,[6,14,48,96],[["/practice/#maximum-area-of-two-non-overlapping-square-submatrices","Solution"]]],[4017,"Peaks in Array II","peaks-in-array-ii",0,[139,6,46],[["/practice/#peaks-in-array-ii","Solution"]]],[4018,"Total Sum of Interaction Cost in Tree Groups II","total-sum-of-interaction-cost-in-tree-groups-ii",0,[168,41,6,150],[["/practice/#total-sum-of-interaction-cost-in-tree-groups-ii","Solution"]]],[4019,"Merge Close Characters II","merge-close-characters-ii",0,[71,155],[["/practice/#merge-close-characters-ii","Solution"]]],[4020,"Elevator Requests I","elevator-requests-i",0,[6,145],[["/practice/#elevator-requests-i","Solution"]]],[4021,"Minimum Operations to Make a Rotated Palindrome I","minimum-operations-to-make-a-rotated-palindrome-i",0,[95,155,50],[["/practice/#minimum-operations-to-make-a-rotated-palindrome-i","Solution"]]],[4022,"K-th Digit in Infinite String","k-th-digit-in-infinite-string",0,[95,14],[["/practice/#k-th-digit-in-infinite-string","Solution"]]],[4023,"Elevator Requests II","elevator-requests-ii",0,[6,48,150],[["/practice/#elevator-requests-ii","Solution"]]],[4024,"Nearest Available Drone","nearest-available-drone",0,[6,50],[["/practice/#nearest-available-drone","Solution"]]],[4025,"Minimize the Maximum Waiting Time at Synchronized Traffic Lights","minimize-the-maximum-waiting-time-at-synchronized-traffic-lights",0,[68,6],[["/practice/#minimize-the-maximum-waiting-time-at-synchronized-traffic-lights","Solution"]]],[4026,"Maximum Gap Between Stations","maximum-gap-between-stations",0,[68,172,155],[["/practice/#maximum-gap-between-stations","Solution"]]],[4027,"Elevator Requests III","elevator-requests-iii",0,[18,6,48,19,150],[["/practice/#elevator-requests-iii","Solution"]]],[4028,"Minimum Operations to Make a Rotated Palindrome II","minimum-operations-to-make-a-rotated-palindrome-ii",0,[95,155],[["/practice/#minimum-operations-to-make-a-rotated-palindrome-ii","Solution"]]],[4029,"Elevator Requests IV","elevator-requests-iv",0,[],[["/practice/#elevator-requests-iv","Solution"]]],[4030,"Check ASCII Palindromic","check-ascii-palindromic",0,[],[["/practice/#check-ascii-palindromic","Solution"]]],[4031,"Find All Numbers Disappeared in an Array II","find-all-numbers-disappeared-in-an-array-ii",0,[],[["/practice/#find-all-numbers-disappeared-in-an-array-ii","Solution"]]],[4032,"Longest Subarray With at Most K Distinct Prime Factors","longest-subarray-with-at-most-k-distinct-prime-factors",0,[],[["/practice/#longest-subarray-with-at-most-k-distinct-prime-factors","Solution"]]],[4033,"Valid K-Unique Subarrays I","valid-k-unique-subarrays-i",0,[],[["/practice/#valid-k-unique-subarrays-i","Solution"]]],[4034,"Minimum Bishop Moves to Reach Target","minimum-bishop-moves-to-reach-target",0,[],[["/practice/#minimum-bishop-moves-to-reach-target","Solution"]]],[4035,"Maximum Valid Split Positions I","maximum-valid-split-positions-i",0,[],[["/practice/#maximum-valid-split-positions-i","Solution"]]],[4036,"Lexicographically Largest String After Pair Transformations","lexicographically-largest-string-after-pair-transformations",0,[],[["/practice/#lexicographically-largest-string-after-pair-transformations","Solution"]]],[4037,"Maximum Valid Split Positions II","maximum-valid-split-positions-ii",0,[],[["/practice/#maximum-valid-split-positions-ii","Solution"]]],[4038,"Count Integers Appearing in a Single Block","count-integers-appearing-in-a-single-block",0,[],[["/practice/#count-integers-appearing-in-a-single-block","Solution"]]],[4039,"Sum of Decoded Numbers","sum-of-decoded-numbers",0,[],[["/practice/#sum-of-decoded-numbers","Solution"]]],[4040,"Minimum Operations to Form Subset Sum I","minimum-operations-to-form-subset-sum-i",0,[],[["/practice/#minimum-operations-to-form-subset-sum-i","Solution"]]],[4041,"Minimum Operations to Form Subset Sum II","minimum-operations-to-form-subset-sum-ii",0,[],[["/practice/#minimum-operations-to-form-subset-sum-ii","Solution"]]],[4042,"Valid K-Unique Subarrays II","valid-k-unique-subarrays-ii",0,[],[["/practice/#valid-k-unique-subarrays-ii","Solution"]]],[4043,"Count Rotations With Exactly K Equal Adjacent Pairs","count-rotations-with-exactly-k-equal-adjacent-pairs",0,[],[["/practice/#count-rotations-with-exactly-k-equal-adjacent-pairs","Solution"]]],[4044,"Count Good Cyclic Rotations","count-good-cyclic-rotations",0,[],[["/practice/#count-good-cyclic-rotations","Solution"]]],[4045,"Count Robot Groups","count-robot-groups",0,[],[["/practice/#count-robot-groups","Solution"]]],[4046,"Minimum Cost Path With At Most K Turns","minimum-cost-path-with-at-most-k-turns",0,[],[["/practice/#minimum-cost-path-with-at-most-k-turns","Solution"]]],[4047,"Minimum Operations to Make XOR of All Elements Zero","minimum-operations-to-make-xor-of-all-elements-zero",0,[],[["/practice/#minimum-operations-to-make-xor-of-all-elements-zero","Solution"]]],[4048,"Count Values With Equally Spaced Occurrences I","count-values-with-equally-spaced-occurrences-i",0,[],[["/practice/#count-values-with-equally-spaced-occurrences-i","Solution"]]],[4049,"Count Values With Equally Spaced Occurrences II","count-values-with-equally-spaced-occurrences-ii",0,[],[["/practice/#count-values-with-equally-spaced-occurrences-ii","Solution"]]],[4050,"Minimum Days to Score Exactly N Points","minimum-days-to-score-exactly-n-points",0,[],[["/practice/#minimum-days-to-score-exactly-n-points","Solution"]]],[4051,"Count Subarrays with Distant Sums","count-subarrays-with-distant-sums",0,[],[["/practice/#count-subarrays-with-distant-sums","Solution"]]],[4052,"Cyclically Shift Rows and Columns","cyclically-shift-rows-and-columns",0,[],[["/practice/#cyclically-shift-rows-and-columns","Solution"]]],[4053,"Minimum Operations to Make Every Element Palindromic","minimum-operations-to-make-every-element-palindromic",0,[],[["/practice/#minimum-operations-to-make-every-element-palindromic","Solution"]]],[4054,"Count Shadow Pairs I","count-shadow-pairs-i",0,[],[["/practice/#count-shadow-pairs-i","Solution"]]],[4055,"Count Shadow Pairs II","count-shadow-pairs-ii",0,[],[["/practice/#count-shadow-pairs-ii","Solution"]]],[4056,"Number of Intersecting Interval Pairs I","number-of-intersecting-interval-pairs-i",0,[],[["/practice/#number-of-intersecting-interval-pairs-i","Solution"]]],[4057,"Number of Intersecting Interval Pairs II","number-of-intersecting-interval-pairs-ii",0,[],[["/practice/#number-of-intersecting-interval-pairs-ii","Solution"]]],[4058,"Maximum Pulse Value After One Subarray Rotation","maximum-pulse-value-after-one-subarray-rotation",0,[],[["/practice/#maximum-pulse-value-after-one-subarray-rotation","Solution"]]],[4059,"Lexicographically Largest Power Array","lexicographically-largest-power-array",0,[],[["/practice/#lexicographically-largest-power-array","Solution"]]],[4060,"Count Evenly Good Integers","count-evenly-good-integers",0,[],[["/practice/#count-evenly-good-integers","Solution"]]],[4061,"Minimum Queen Moves to Reach Target","minimum-queen-moves-to-reach-target",0,[],[["/practice/#minimum-queen-moves-to-reach-target","Solution"]]],[4062,"Transform Array Using Pair Operations","transform-array-using-pair-operations",0,[],[["/practice/#transform-array-using-pair-operations","Solution"]]],[4063,"Longest Subarray Divisible by K with At Most One Negation I","longest-subarray-divisible-by-k-with-at-most-one-negation-i",0,[],[["/practice/#longest-subarray-divisible-by-k-with-at-most-one-negation-i","Solution"]]],[4064,"Longest Subarray Divisible by K with At Most One Negation II","longest-subarray-divisible-by-k-with-at-most-one-negation-ii",0,[],[["/practice/#longest-subarray-divisible-by-k-with-at-most-one-negation-ii","Solution"]]],[4065,"Rearrange Array by Removing Distinct Values","rearrange-array-by-removing-distinct-values",0,[],[["/practice/#rearrange-array-by-removing-distinct-values","Solution"]]],[4066,"Maximum Equal Adjacent Pairs After at Most One Replacement","maximum-equal-adjacent-pairs-after-at-most-one-replacement",0,[],[["/practice/#maximum-equal-adjacent-pairs-after-at-most-one-replacement","Solution"]]],[4067,"Longest Subarray With Restricted Pair Sums","longest-subarray-with-restricted-pair-sums",0,[],[["/practice/#longest-subarray-with-restricted-pair-sums","Solution"]]],[4068,"Maximize Meeting Earnings with Idle Gaps","maximize-meeting-earnings-with-idle-gaps",0,[],[["/practice/#maximize-meeting-earnings-with-idle-gaps","Solution"]]],[4070,"Minimum Rotations to Dial a Number I","minimum-rotations-to-dial-a-number-i",0,[],[["/practice/#minimum-rotations-to-dial-a-number-i","Solution"]]],[4071,"Minimum Rotations to Dial a Number II","minimum-rotations-to-dial-a-number-ii",0,[],[["/practice/#minimum-rotations-to-dial-a-number-ii","Solution"]]],[4072,"Maximum Alternating Subarray Sum With One Deletion","maximum-alternating-subarray-sum-with-one-deletion",0,[],[["/practice/#maximum-alternating-subarray-sum-with-one-deletion","Solution"]]],[4073,"Count Good Strings","count-good-strings",0,[],[["/practice/#count-good-strings","Solution"]]]]}