leetrs 1.0.3

[{"id":1,"title":"Two Sum","slug":"two-sum","difficulty":1,"accepted":21338720,"submitted":37231278,"acceptance":0.5731396058980301},{"id":2,"title":"Add Two Numbers","slug":"add-two-numbers","difficulty":2,"accepted":6923576,"submitted":14350063,"acceptance":0.48247704557115884},{"id":3,"title":"Longest Substring Without Repeating Characters","slug":"longest-substring-without-repeating-characters","difficulty":2,"accepted":9291721,"submitted":23937015,"acceptance":0.38817375516537883},{"id":4,"title":"Median of Two Sorted Arrays","slug":"median-of-two-sorted-arrays","difficulty":3,"accepted":4178206,"submitted":9029051,"acceptance":0.46275140100548773},{"id":5,"title":"Longest Palindromic Substring","slug":"longest-palindromic-substring","difficulty":2,"accepted":4662395,"submitted":12396383,"acceptance":0.37610930543207644},{"id":6,"title":"Zigzag Conversion","slug":"zigzag-conversion","difficulty":2,"accepted":2167957,"submitted":4024506,"acceptance":0.5386889720129626},{"id":7,"title":"Reverse Integer","slug":"reverse-integer","difficulty":2,"accepted":4924158,"submitted":15519784,"acceptance":0.3172826374387685},{"id":8,"title":"String to Integer (atoi)","slug":"string-to-integer-atoi","difficulty":2,"accepted":2405603,"submitted":11555583,"acceptance":0.20817668827267305},{"id":9,"title":"Palindrome Number","slug":"palindrome-number","difficulty":1,"accepted":7991531,"submitted":13223074,"acceptance":0.6043625710632793},{"id":10,"title":"Regular Expression Matching","slug":"regular-expression-matching","difficulty":3,"accepted":1370502,"submitted":4462165,"acceptance":0.3071383510022601},{"id":11,"title":"Container With Most Water","slug":"container-with-most-water","difficulty":2,"accepted":5254969,"submitted":8785560,"acceptance":0.5981370567157928},{"id":12,"title":"Integer to Roman","slug":"integer-to-roman","difficulty":2,"accepted":2108404,"submitted":2980361,"acceptance":0.7074324217770934},{"id":13,"title":"Roman to Integer","slug":"roman-to-integer","difficulty":1,"accepted":5797969,"submitted":8721602,"acceptance":0.664782570908418},{"id":14,"title":"Longest Common Prefix","slug":"longest-common-prefix","difficulty":1,"accepted":5672011,"submitted":11975007,"acceptance":0.4736540863817449},{"id":15,"title":"3Sum","slug":"3sum","difficulty":2,"accepted":5848449,"submitted":15048356,"acceptance":0.38864371629698286},{"id":16,"title":"3Sum Closest","slug":"3sum-closest","difficulty":2,"accepted":1807218,"submitted":3739058,"acceptance":0.48333510739870844},{"id":17,"title":"Letter Combinations of a Phone Number","slug":"letter-combinations-of-a-phone-number","difficulty":2,"accepted":2984557,"submitted":4534268,"acceptance":0.6582224517827354},{"id":18,"title":"4Sum","slug":"4sum","difficulty":2,"accepted":1658093,"submitted":4108730,"acceptance":0.403553652831897},{"id":19,"title":"Remove Nth Node From End of List","slug":"remove-nth-node-from-end-of-list","difficulty":2,"accepted":4150007,"submitted":8086452,"acceptance":0.5132049259675319},{"id":20,"title":"Valid Parentheses","slug":"valid-parentheses","difficulty":1,"accepted":7438049,"submitted":16912602,"acceptance":0.4397932973294115},{"id":21,"title":"Merge Two Sorted Lists","slug":"merge-two-sorted-lists","difficulty":1,"accepted":6182019,"submitted":9073485,"acceptance":0.6813279572292233},{"id":22,"title":"Generate Parentheses","slug":"generate-parentheses","difficulty":2,"accepted":2853319,"submitted":3634291,"acceptance":0.7851102181966166},{"id":23,"title":"Merge k Sorted Lists","slug":"merge-k-sorted-lists","difficulty":3,"accepted":2951520,"submitted":4979481,"acceptance":0.5927364719335207},{"id":24,"title":"Swap Nodes in Pairs","slug":"swap-nodes-in-pairs","difficulty":2,"accepted":1900800,"submitted":2743821,"acceptance":0.6927565610147309},{"id":25,"title":"Reverse Nodes in k-Group","slug":"reverse-nodes-in-k-group","difficulty":3,"accepted":1516282,"submitted":2305472,"acceptance":0.6576883171862421},{"id":26,"title":"Remove Duplicates from Sorted Array","slug":"remove-duplicates-from-sorted-array","difficulty":1,"accepted":7727558,"submitted":12349233,"acceptance":0.6257520608769792},{"id":27,"title":"Remove Element","slug":"remove-element","difficulty":1,"accepted":5157422,"submitted":8369613,"acceptance":0.6162079417531013},{"id":28,"title":"Find the Index of the First Occurrence in a String","slug":"find-the-index-of-the-first-occurrence-in-a-string","difficulty":1,"accepted":4011527,"submitted":8630390,"acceptance":0.4648141045769658},{"id":29,"title":"Divide Two Integers","slug":"divide-two-integers","difficulty":2,"accepted":1149927,"submitted":5865081,"acceptance":0.19606327687546002},{"id":30,"title":"Substring with Concatenation of All Words","slug":"substring-with-concatenation-of-all-words","difficulty":3,"accepted":700818,"submitted":2048807,"acceptance":0.34206150213270453},{"id":31,"title":"Next Permutation","slug":"next-permutation","difficulty":2,"accepted":2235035,"submitted":4964118,"acceptance":0.4502380886191666},{"id":32,"title":"Longest Valid Parentheses","slug":"longest-valid-parentheses","difficulty":3,"accepted":1089387,"submitted":2830682,"acceptance":0.384849658138922},{"id":33,"title":"Search in Rotated Sorted Array","slug":"search-in-rotated-sorted-array","difficulty":2,"accepted":4377112,"submitted":9869038,"acceptance":0.4435196216693056},{"id":34,"title":"Find First and Last Position of Element in Sorted Array","slug":"find-first-and-last-position-of-element-in-sorted-array","difficulty":2,"accepted":3267848,"submitted":6717212,"acceptance":0.4864887396735431},{"id":35,"title":"Search Insert Position","slug":"search-insert-position","difficulty":1,"accepted":4673834,"submitted":9160230,"acceptance":0.5102310749839251},{"id":36,"title":"Valid Sudoku","slug":"valid-sudoku","difficulty":2,"accepted":2463236,"submitted":3827440,"acceptance":0.6435727274627427},{"id":37,"title":"Sudoku Solver","slug":"sudoku-solver","difficulty":3,"accepted":1021478,"submitted":1561418,"acceptance":0.6541989396817508},{"id":38,"title":"Count and Say","slug":"count-and-say","difficulty":2,"accepted":1401517,"submitted":2237919,"acceptance":0.6262590379723305},{"id":39,"title":"Combination Sum","slug":"combination-sum","difficulty":2,"accepted":3096288,"submitted":4055415,"acceptance":0.7634947348175217},{"id":40,"title":"Combination Sum II","slug":"combination-sum-ii","difficulty":2,"accepted":1682838,"submitted":2840453,"acceptance":0.5924540909495775},{"id":41,"title":"First Missing Positive","slug":"first-missing-positive","difficulty":3,"accepted":1734563,"submitted":4062162,"acceptance":0.4270048806522241},{"id":42,"title":"Trapping Rain Water","slug":"trapping-rain-water","difficulty":3,"accepted":3495104,"submitted":5207427,"acceptance":0.6711767634956765},{"id":43,"title":"Multiply Strings","slug":"multiply-strings","difficulty":2,"accepted":1149150,"submitted":2616199,"acceptance":0.4392441094886131},{"id":44,"title":"Wildcard Matching","slug":"wildcard-matching","difficulty":3,"accepted":861944,"submitted":2718698,"acceptance":0.31704293746491885},{"id":45,"title":"Jump Game II","slug":"jump-game-ii","difficulty":2,"accepted":2108282,"submitted":4940276,"acceptance":0.42675388986364327},{"id":46,"title":"Permutations","slug":"permutations","difficulty":2,"accepted":3052894,"submitted":3732082,"acceptance":0.8180136449306312},{"id":47,"title":"Permutations II","slug":"permutations-ii","difficulty":2,"accepted":1275764,"submitted":2017600,"acceptance":0.6323176050753371},{"id":48,"title":"Rotate Image","slug":"rotate-image","difficulty":2,"accepted":2788198,"submitted":3504399,"acceptance":0.7956280092535125},{"id":49,"title":"Group Anagrams","slug":"group-anagrams","difficulty":2,"accepted":4663047,"submitted":6440193,"acceptance":0.7240539219864994},{"id":50,"title":"Pow(x, n)","slug":"powx-n","difficulty":2,"accepted":2679767,"submitted":6961063,"acceptance":0.384965198562346},{"id":51,"title":"N-Queens","slug":"n-queens","difficulty":3,"accepted":1253441,"submitted":1665193,"acceptance":0.7527301640110186},{"id":52,"title":"N-Queens II","slug":"n-queens-ii","difficulty":3,"accepted":593441,"submitted":756547,"acceptance":0.7844073137557878},{"id":53,"title":"Maximum Subarray","slug":"maximum-subarray","difficulty":2,"accepted":6013697,"submitted":11312142,"acceptance":0.5316143485468977},{"id":54,"title":"Spiral Matrix","slug":"spiral-matrix","difficulty":2,"accepted":2358251,"submitted":4173166,"acceptance":0.5650987763247376},{"id":55,"title":"Jump Game","slug":"jump-game","difficulty":2,"accepted":3148560,"submitted":7737341,"acceptance":0.40693049459756264},{"id":56,"title":"Merge Intervals","slug":"merge-intervals","difficulty":2,"accepted":3936182,"submitted":7636563,"acceptance":0.515438948123652},{"id":57,"title":"Insert Interval","slug":"insert-interval","difficulty":2,"accepted":1751397,"submitted":3891538,"acceptance":0.4500526527044063},{"id":58,"title":"Length of Last Word","slug":"length-of-last-word","difficulty":1,"accepted":3369445,"submitted":5750101,"acceptance":0.585980141914029},{"id":59,"title":"Spiral Matrix II","slug":"spiral-matrix-ii","difficulty":2,"accepted":796808,"submitted":1064379,"acceptance":0.7486130410314371},{"id":60,"title":"Permutation Sequence","slug":"permutation-sequence","difficulty":3,"accepted":569910,"submitted":1081363,"acceptance":0.5270293139306598},{"id":61,"title":"Rotate List","slug":"rotate-list","difficulty":2,"accepted":1588778,"submitted":3827505,"acceptance":0.41509495088837245},{"id":62,"title":"Unique Paths","slug":"unique-paths","difficulty":2,"accepted":2792444,"submitted":4185779,"acceptance":0.667126477532617},{"id":63,"title":"Unique Paths II","slug":"unique-paths-ii","difficulty":2,"accepted":1465577,"submitted":3306069,"acceptance":0.4432989753087428},{"id":64,"title":"Minimum Path Sum","slug":"minimum-path-sum","difficulty":2,"accepted":1826985,"submitted":2684917,"acceptance":0.680462375559468},{"id":65,"title":"Valid Number","slug":"valid-number","difficulty":3,"accepted":514548,"submitted":2256125,"acceptance":0.22806715053465565},{"id":66,"title":"Plus One","slug":"plus-one","difficulty":1,"accepted":3688539,"submitted":7408272,"acceptance":0.4978946507363661},{"id":67,"title":"Add Binary","slug":"add-binary","difficulty":1,"accepted":2316279,"submitted":4001796,"acceptance":0.5788098643708974},{"id":68,"title":"Text Justification","slug":"text-justification","difficulty":3,"accepted":643831,"submitted":1267754,"acceptance":0.5078516810043588},{"id":69,"title":"Sqrt(x)","slug":"sqrtx","difficulty":1,"accepted":3144674,"submitted":7551129,"acceptance":0.41645083801375926},{"id":70,"title":"Climbing Stairs","slug":"climbing-stairs","difficulty":1,"accepted":5052593,"submitted":9357159,"acceptance":0.5399708394396205},{"id":71,"title":"Simplify Path","slug":"simplify-path","difficulty":2,"accepted":1311519,"submitted":2605549,"acceptance":0.5033561065249589},{"id":72,"title":"Edit Distance","slug":"edit-distance","difficulty":2,"accepted":1432799,"submitted":2373038,"acceptance":0.6037825774387093},{"id":73,"title":"Set Matrix Zeroes","slug":"set-matrix-zeroes","difficulty":2,"accepted":2545071,"submitted":4059377,"acceptance":0.6269609844072133},{"id":74,"title":"Search a 2D Matrix","slug":"search-a-2d-matrix","difficulty":2,"accepted":2851097,"submitted":5302611,"acceptance":0.5376779477129285},{"id":75,"title":"Sort Colors","slug":"sort-colors","difficulty":2,"accepted":3678522,"submitted":5298783,"acceptance":0.6942201633846866},{"id":76,"title":"Minimum Window Substring","slug":"minimum-window-substring","difficulty":3,"accepted":2128745,"submitted":4503344,"acceptance":0.4727031734639859},{"id":77,"title":"Combinations","slug":"combinations","difficulty":2,"accepted":1320133,"submitted":1773850,"acceptance":0.7442190715111199},{"id":78,"title":"Subsets","slug":"subsets","difficulty":2,"accepted":3005507,"submitted":3655849,"acceptance":0.8221091735462815},{"id":79,"title":"Word Search","slug":"word-search","difficulty":2,"accepted":2471815,"submitted":5243914,"acceptance":0.4713683328902801},{"id":80,"title":"Remove Duplicates from Sorted Array II","slug":"remove-duplicates-from-sorted-array-ii","difficulty":2,"accepted":1908326,"submitted":2958176,"acceptance":0.6451022521986521},{"id":81,"title":"Search in Rotated Sorted Array II","slug":"search-in-rotated-sorted-array-ii","difficulty":2,"accepted":1220481,"submitted":3059223,"acceptance":0.39895130234049625},{"id":82,"title":"Remove Duplicates from Sorted List II","slug":"remove-duplicates-from-sorted-list-ii","difficulty":2,"accepted":1087991,"submitted":2109717,"acceptance":0.5157047130017912},{"id":83,"title":"Remove Duplicates from Sorted List","slug":"remove-duplicates-from-sorted-list","difficulty":1,"accepted":2344500,"submitted":4147056,"acceptance":0.5653408104448071},{"id":84,"title":"Largest Rectangle in Histogram","slug":"largest-rectangle-in-histogram","difficulty":3,"accepted":1533594,"submitted":3089827,"acceptance":0.49633652628448127},{"id":85,"title":"Maximal Rectangle","slug":"maximal-rectangle","difficulty":3,"accepted":795626,"submitted":1360938,"acceptance":0.5846159046187263},{"id":86,"title":"Partition List","slug":"partition-list","difficulty":2,"accepted":899164,"submitted":1475794,"acceptance":0.6092747361759161},{"id":87,"title":"Scramble String","slug":"scramble-string","difficulty":3,"accepted":312278,"submitted":705511,"acceptance":0.4426266918588087},{"id":88,"title":"Merge Sorted Array","slug":"merge-sorted-array","difficulty":1,"accepted":5602374,"submitted":10252248,"acceptance":0.5464532266484384},{"id":89,"title":"Gray Code","slug":"gray-code","difficulty":2,"accepted":419024,"submitted":648917,"acceptance":0.6457281901999794},{"id":90,"title":"Subsets II","slug":"subsets-ii","difficulty":2,"accepted":1476402,"submitted":2415926,"acceptance":0.6111122608887855},{"id":91,"title":"Decode Ways","slug":"decode-ways","difficulty":2,"accepted":1643319,"submitted":4345836,"acceptance":0.378136450616176},{"id":92,"title":"Reverse Linked List II","slug":"reverse-linked-list-ii","difficulty":2,"accepted":1299508,"submitted":2533250,"acceptance":0.5129805585710057},{"id":93,"title":"Restore IP Addresses","slug":"restore-ip-addresses","difficulty":2,"accepted":620010,"submitted":1113260,"acceptance":0.5569318937175503},{"id":94,"title":"Binary Tree Inorder Traversal","slug":"binary-tree-inorder-traversal","difficulty":1,"accepted":3663017,"submitted":4583578,"acceptance":0.7991610484211242},{"id":95,"title":"Unique Binary Search Trees II","slug":"unique-binary-search-trees-ii","difficulty":2,"accepted":575550,"submitted":924971,"acceptance":0.6222357241470273},{"id":96,"title":"Unique Binary Search Trees","slug":"unique-binary-search-trees","difficulty":2,"accepted":857549,"submitted":1350289,"acceptance":0.6350855261355162},{"id":97,"title":"Interleaving String","slug":"interleaving-string","difficulty":2,"accepted":775926,"submitted":1772438,"acceptance":0.4377732817734668},{"id":98,"title":"Validate Binary Search Tree","slug":"validate-binary-search-tree","difficulty":2,"accepted":3304705,"submitted":9289957,"acceptance":0.3557287724797865},{"id":99,"title":"Recover Binary Search Tree","slug":"recover-binary-search-tree","difficulty":2,"accepted":657834,"submitted":1109705,"acceptance":0.5928007893989844},{"id":100,"title":"Same Tree","slug":"same-tree","difficulty":1,"accepted":3369630,"submitted":5036304,"acceptance":0.6690680308416649},{"id":101,"title":"Symmetric Tree","slug":"symmetric-tree","difficulty":1,"accepted":2844942,"submitted":4664474,"acceptance":0.6099170024315711},{"id":102,"title":"Binary Tree Level Order Traversal","slug":"binary-tree-level-order-traversal","difficulty":2,"accepted":3365350,"submitted":4644909,"acceptance":0.7245244201770153},{"id":103,"title":"Binary Tree Zigzag Level Order Traversal","slug":"binary-tree-zigzag-level-order-traversal","difficulty":2,"accepted":1759450,"submitted":2772204,"acceptance":0.6346755145003758},{"id":104,"title":"Maximum Depth of Binary Tree","slug":"maximum-depth-of-binary-tree","difficulty":1,"accepted":4717250,"submitted":6042955,"acceptance":0.7806197464650986},{"id":105,"title":"Construct Binary Tree from Preorder and Inorder Traversal","slug":"construct-binary-tree-from-preorder-and-inorder-traversal","difficulty":2,"accepted":1848694,"submitted":2693847,"acceptance":0.6862654040856812},{"id":106,"title":"Construct Binary Tree from Inorder and Postorder Traversal","slug":"construct-binary-tree-from-inorder-and-postorder-traversal","difficulty":2,"accepted":944235,"submitted":1380835,"acceptance":0.683814503543146},{"id":107,"title":"Binary Tree Level Order Traversal II","slug":"binary-tree-level-order-traversal-ii","difficulty":2,"accepted":826264,"submitted":1215853,"acceptance":0.6795755736918855},{"id":108,"title":"Convert Sorted Array to Binary Search Tree","slug":"convert-sorted-array-to-binary-search-tree","difficulty":1,"accepted":1712595,"submitted":2271257,"acceptance":0.7540295968267792},{"id":109,"title":"Convert Sorted List to Binary Search Tree","slug":"convert-sorted-list-to-binary-search-tree","difficulty":2,"accepted":682687,"submitted":1029400,"acceptance":0.6631892364484165},{"id":110,"title":"Balanced Binary Tree","slug":"balanced-binary-tree","difficulty":1,"accepted":2443067,"submitted":4202437,"acceptance":0.5813453003578638},{"id":111,"title":"Minimum Depth of Binary Tree","slug":"minimum-depth-of-binary-tree","difficulty":1,"accepted":1657755,"submitted":3148076,"acceptance":0.5265930682740824},{"id":112,"title":"Path Sum","slug":"path-sum","difficulty":1,"accepted":2117262,"submitted":3871886,"acceptance":0.5468296328972495},{"id":113,"title":"Path Sum II","slug":"path-sum-ii","difficulty":2,"accepted":1163751,"submitted":1876761,"acceptance":0.6200848163404931},{"id":114,"title":"Flatten Binary Tree to Linked List","slug":"flatten-binary-tree-to-linked-list","difficulty":2,"accepted":1385758,"submitted":1965364,"acceptance":0.7050897441898804},{"id":115,"title":"Distinct Subsequences","slug":"distinct-subsequences","difficulty":3,"accepted":681262,"submitted":1317659,"acceptance":0.5170245108939414},{"id":116,"title":"Populating Next Right Pointers in Each Node","slug":"populating-next-right-pointers-in-each-node","difficulty":2,"accepted":1329800,"submitted":1983883,"acceptance":0.6703016256503029},{"id":117,"title":"Populating Next Right Pointers in Each Node II","slug":"populating-next-right-pointers-in-each-node-ii","difficulty":2,"accepted":838877,"submitted":1462455,"acceptance":0.5736087606114376},{"id":118,"title":"Pascal's Triangle","slug":"pascals-triangle","difficulty":1,"accepted":2638637,"submitted":3348243,"acceptance":0.7880661588779548},{"id":119,"title":"Pascal's Triangle II","slug":"pascals-triangle-ii","difficulty":1,"accepted":1212671,"submitted":1801653,"acceptance":0.673087991971817},{"id":120,"title":"Triangle","slug":"triangle","difficulty":2,"accepted":1281007,"submitted":2139914,"acceptance":0.5986254587801192},{"id":121,"title":"Best Time to Buy and Sell Stock","slug":"best-time-to-buy-and-sell-stock","difficulty":1,"accepted":7852053,"submitted":13869070,"acceptance":0.5661556975341533},{"id":122,"title":"Best Time to Buy and Sell Stock II","slug":"best-time-to-buy-and-sell-stock-ii","difficulty":2,"accepted":2991219,"submitted":4217368,"acceptance":0.7092620326231905},{"id":123,"title":"Best Time to Buy and Sell Stock III","slug":"best-time-to-buy-and-sell-stock-iii","difficulty":3,"accepted":948264,"submitted":1773749,"acceptance":0.5346100265595639},{"id":124,"title":"Binary Tree Maximum Path Sum","slug":"binary-tree-maximum-path-sum","difficulty":3,"accepted":1878560,"submitted":4454278,"acceptance":0.42174287280677136},{"id":125,"title":"Valid Palindrome","slug":"valid-palindrome","difficulty":1,"accepted":5341837,"submitted":10064087,"acceptance":0.5307820769037469},{"id":126,"title":"Word Ladder II","slug":"word-ladder-ii","difficulty":3,"accepted":458809,"submitted":1661360,"acceptance":0.27616470843164637},{"id":127,"title":"Word Ladder","slug":"word-ladder","difficulty":3,"accepted":1600884,"submitted":3537460,"acceptance":0.4525518309747672},{"id":128,"title":"Longest Consecutive Sequence","slug":"longest-consecutive-sequence","difficulty":2,"accepted":3253999,"submitted":6914875,"acceptance":0.47057958386811044},{"id":129,"title":"Sum Root to Leaf Numbers","slug":"sum-root-to-leaf-numbers","difficulty":2,"accepted":1268574,"submitted":1817847,"acceptance":0.6978442080109052},{"id":130,"title":"Surrounded Regions","slug":"surrounded-regions","difficulty":2,"accepted":1175350,"submitted":2609529,"acceptance":0.4504069508328898},{"id":131,"title":"Palindrome Partitioning","slug":"palindrome-partitioning","difficulty":2,"accepted":1329202,"submitted":1798918,"acceptance":0.7388897103703448},{"id":132,"title":"Palindrome Partitioning II","slug":"palindrome-partitioning-ii","difficulty":3,"accepted":404645,"submitted":1098578,"acceptance":0.36833524792959627},{"id":133,"title":"Clone Graph","slug":"clone-graph","difficulty":2,"accepted":1879740,"submitted":2890523,"acceptance":0.6503113796361419},{"id":134,"title":"Gas Station","slug":"gas-station","difficulty":2,"accepted":1332896,"submitted":2790000,"acceptance":0.4777405017921147},{"id":135,"title":"Candy","slug":"candy","difficulty":3,"accepted":1030737,"submitted":2136667,"acceptance":0.48240413691043105},{"id":136,"title":"Single Number","slug":"single-number","difficulty":1,"accepted":4506380,"submitted":5811996,"acceptance":0.7753584138736503},{"id":137,"title":"Single Number II","slug":"single-number-ii","difficulty":2,"accepted":879246,"submitted":1313852,"acceptance":0.6692123618185305},{"id":138,"title":"Copy List with Random Pointer","slug":"copy-list-with-random-pointer","difficulty":2,"accepted":1883286,"submitted":3005338,"acceptance":0.6266469861293472},{"id":139,"title":"Word Break","slug":"word-break","difficulty":2,"accepted":2358040,"submitted":4782771,"acceptance":0.49302799569538247},{"id":140,"title":"Word Break II","slug":"word-break-ii","difficulty":3,"accepted":813936,"submitted":1470728,"acceptance":0.5534238825941983},{"id":141,"title":"Linked List Cycle","slug":"linked-list-cycle","difficulty":1,"accepted":4824271,"submitted":8912456,"acceptance":0.5412953511355344},{"id":142,"title":"Linked List Cycle II","slug":"linked-list-cycle-ii","difficulty":2,"accepted":1990597,"submitted":3454486,"acceptance":0.576235364682329},{"id":143,"title":"Reorder List","slug":"reorder-list","difficulty":2,"accepted":1494285,"submitted":2299512,"acceptance":0.649827006773611},{"id":144,"title":"Binary Tree Preorder Traversal","slug":"binary-tree-preorder-traversal","difficulty":1,"accepted":2414237,"submitted":3197729,"acceptance":0.754984865821963},{"id":145,"title":"Binary Tree Postorder Traversal","slug":"binary-tree-postorder-traversal","difficulty":1,"accepted":1945164,"submitted":2496755,"acceptance":0.7790768417405792},{"id":146,"title":"LRU Cache","slug":"lru-cache","difficulty":2,"accepted":2554538,"submitted":5419755,"acceptance":0.47133828005140455},{"id":147,"title":"Insertion Sort List","slug":"insertion-sort-list","difficulty":2,"accepted":487522,"submitted":828572,"acceptance":0.5883882149046794},{"id":148,"title":"Sort List","slug":"sort-list","difficulty":2,"accepted":1261309,"submitted":1965518,"acceptance":0.6417183663543148},{"id":149,"title":"Max Points on a Line","slug":"max-points-on-a-line","difficulty":3,"accepted":522428,"submitted":1710889,"acceptance":0.30535470156158584},{"id":150,"title":"Evaluate Reverse Polish Notation","slug":"evaluate-reverse-polish-notation","difficulty":2,"accepted":1723840,"submitted":3001404,"acceptance":0.5743445400885718},{"id":151,"title":"Reverse Words in a String","slug":"reverse-words-in-a-string","difficulty":2,"accepted":2955972,"submitted":5276351,"acceptance":0.560230356168496},{"id":152,"title":"Maximum Product Subarray","slug":"maximum-product-subarray","difficulty":2,"accepted":1998606,"submitted":5516517,"acceptance":0.3622949045566251},{"id":153,"title":"Find Minimum in Rotated Sorted Array","slug":"find-minimum-in-rotated-sorted-array","difficulty":2,"accepted":2971316,"submitted":5500751,"acceptance":0.5401655155814179},{"id":154,"title":"Find Minimum in Rotated Sorted Array II","slug":"find-minimum-in-rotated-sorted-array-ii","difficulty":3,"accepted":611479,"submitted":1365136,"acceptance":0.44792533491168646},{"id":155,"title":"Min Stack","slug":"min-stack","difficulty":2,"accepted":2678875,"submitted":4622186,"acceptance":0.579568844698158},{"id":156,"title":"Binary Tree Upside Down","slug":"binary-tree-upside-down","difficulty":2,"accepted":119185,"submitted":182117,"acceptance":0.6544419246967609},{"id":157,"title":"Read N Characters Given Read4","slug":"read-n-characters-given-read4","difficulty":1,"accepted":209004,"submitted":491336,"acceptance":0.4253789667355944},{"id":158,"title":"Read N Characters Given read4 II - Call Multiple Times","slug":"read-n-characters-given-read4-ii-call-multiple-times","difficulty":3,"accepted":196628,"submitted":454635,"acceptance":0.4324963982095527},{"id":159,"title":"Longest Substring with At Most Two Distinct Characters","slug":"longest-substring-with-at-most-two-distinct-characters","difficulty":2,"accepted":301766,"submitted":529209,"acceptance":0.5702208390257913},{"id":160,"title":"Intersection of Two Linked Lists","slug":"intersection-of-two-linked-lists","difficulty":1,"accepted":2358308,"submitted":3713220,"acceptance":0.6351113050128998},{"id":161,"title":"One Edit Distance","slug":"one-edit-distance","difficulty":2,"accepted":236345,"submitted":683855,"acceptance":0.34560689034956243},{"id":162,"title":"Find Peak Element","slug":"find-peak-element","difficulty":2,"accepted":2381979,"submitted":5082207,"acceptance":0.4686898821712693},{"id":163,"title":"Missing Ranges","slug":"missing-ranges","difficulty":1,"accepted":308378,"submitted":867390,"acceptance":0.35552404339455146},{"id":164,"title":"Maximum Gap","slug":"maximum-gap","difficulty":2,"accepted":336968,"submitted":651159,"acceptance":0.5174895839572209},{"id":165,"title":"Compare Version Numbers","slug":"compare-version-numbers","difficulty":2,"accepted":701178,"submitted":1514981,"acceptance":0.4628295668394521},{"id":166,"title":"Fraction to Recurring Decimal","slug":"fraction-to-recurring-decimal","difficulty":2,"accepted":360642,"submitted":1173798,"acceptance":0.30724366543476817},{"id":167,"title":"Two Sum II - Input Array Is Sorted","slug":"two-sum-ii-input-array-is-sorted","difficulty":2,"accepted":3337340,"submitted":5144566,"acceptance":0.6487116697501791},{"id":168,"title":"Excel Sheet Column Title","slug":"excel-sheet-column-title","difficulty":1,"accepted":739448,"submitted":1599064,"acceptance":0.4624255189285732},{"id":169,"title":"Majority Element","slug":"majority-element","difficulty":1,"accepted":5394807,"submitted":8148650,"acceptance":0.6620491737895234},{"id":170,"title":"Two Sum III - Data structure design","slug":"two-sum-iii-data-structure-design","difficulty":1,"accepted":181890,"submitted":464939,"acceptance":0.39121261068656316},{"id":171,"title":"Excel Sheet Column Number","slug":"excel-sheet-column-number","difficulty":1,"accepted":900265,"submitted":1332691,"acceptance":0.6755241837755339},{"id":172,"title":"Factorial Trailing Zeroes","slug":"factorial-trailing-zeroes","difficulty":2,"accepted":660264,"submitted":1420764,"acceptance":0.4647246129547201},{"id":173,"title":"Binary Search Tree Iterator","slug":"binary-search-tree-iterator","difficulty":2,"accepted":1087370,"submitted":1424801,"acceptance":0.7631732431406211},{"id":174,"title":"Dungeon Game","slug":"dungeon-game","difficulty":3,"accepted":298566,"submitted":726068,"acceptance":0.4112094184015822},{"id":175,"title":"Combine Two Tables","slug":"combine-two-tables","difficulty":1,"accepted":1777125,"submitted":2237634,"acceptance":0.7941982468982863},{"id":176,"title":"Second Highest Salary","slug":"second-highest-salary","difficulty":2,"accepted":1513437,"submitted":3239449,"acceptance":0.4671896362622162},{"id":177,"title":"Nth Highest Salary","slug":"nth-highest-salary","difficulty":2,"accepted":654928,"submitted":1679277,"acceptance":0.3900059370788738},{"id":178,"title":"Rank Scores","slug":"rank-scores","difficulty":2,"accepted":674472,"submitted":999256,"acceptance":0.6749741807905081},{"id":179,"title":"Largest Number","slug":"largest-number","difficulty":2,"accepted":818808,"submitted":1911830,"acceptance":0.428284941652762},{"id":180,"title":"Consecutive Numbers","slug":"consecutive-numbers","difficulty":2,"accepted":757381,"submitted":1573231,"acceptance":0.48141754135279563},{"id":181,"title":"Employees Earning More Than Their Managers","slug":"employees-earning-more-than-their-managers","difficulty":1,"accepted":1140670,"submitted":1560651,"acceptance":0.7308937103811166},{"id":182,"title":"Duplicate Emails","slug":"duplicate-emails","difficulty":1,"accepted":1141006,"submitted":1550056,"acceptance":0.7361063084172442},{"id":183,"title":"Customers Who Never Order","slug":"customers-who-never-order","difficulty":1,"accepted":1292126,"submitted":1803658,"acceptance":0.7163919102180125},{"id":184,"title":"Department Highest Salary","slug":"department-highest-salary","difficulty":2,"accepted":660895,"submitted":1144836,"acceptance":0.5772835585184254},{"id":185,"title":"Department Top Three Salaries","slug":"department-top-three-salaries","difficulty":3,"accepted":649724,"submitted":1079735,"acceptance":0.6017439464313002},{"id":186,"title":"Reverse Words in a String II","slug":"reverse-words-in-a-string-ii","difficulty":2,"accepted":180756,"submitted":319093,"acceptance":0.5664680829726757},{"id":187,"title":"Repeated DNA Sequences","slug":"repeated-dna-sequences","difficulty":2,"accepted":526589,"submitted":991200,"acceptance":0.5312641242937853},{"id":188,"title":"Best Time to Buy and Sell Stock IV","slug":"best-time-to-buy-and-sell-stock-iv","difficulty":3,"accepted":708573,"submitted":1421352,"acceptance":0.49852042280870607},{"id":189,"title":"Rotate Array","slug":"rotate-array","difficulty":2,"accepted":3882596,"submitted":8682890,"acceptance":0.44715480675212976},{"id":190,"title":"Reverse Bits","slug":"reverse-bits","difficulty":1,"accepted":1328768,"submitted":1950447,"acceptance":0.6812633206644425},{"id":191,"title":"Number of 1 Bits","slug":"number-of-1-bits","difficulty":1,"accepted":2103138,"submitted":2744663,"acceptance":0.7662645650850396},{"id":192,"title":"Word Frequency","slug":"word-frequency","difficulty":2,"accepted":76707,"submitted":267100,"acceptance":0.28718457506551853},{"id":193,"title":"Valid Phone Numbers","slug":"valid-phone-numbers","difficulty":1,"accepted":128445,"submitted":437498,"acceptance":0.2935899135538905},{"id":194,"title":"Transpose File","slug":"transpose-file","difficulty":2,"accepted":42533,"submitted":136201,"acceptance":0.3122811139418947},{"id":195,"title":"Tenth Line","slug":"tenth-line","difficulty":1,"accepted":159306,"submitted":436623,"acceptance":0.364859386702029},{"id":196,"title":"Delete Duplicate Emails","slug":"delete-duplicate-emails","difficulty":1,"accepted":955215,"submitted":1451185,"acceptance":0.6582310318808422},{"id":197,"title":"Rising Temperature","slug":"rising-temperature","difficulty":1,"accepted":1474472,"submitted":2881933,"acceptance":0.5116260509873061},{"id":198,"title":"House Robber","slug":"house-robber","difficulty":2,"accepted":3505242,"submitted":6601262,"acceptance":0.5309957399054908},{"id":199,"title":"Binary Tree Right Side View","slug":"binary-tree-right-side-view","difficulty":2,"accepted":2205549,"submitted":3155321,"acceptance":0.698993541386122},{"id":200,"title":"Number of Islands","slug":"number-of-islands","difficulty":2,"accepted":4102312,"submitted":6396259,"acceptance":0.6413611456321578},{"id":201,"title":"Bitwise AND of Numbers Range","slug":"bitwise-and-of-numbers-range","difficulty":2,"accepted":510670,"submitted":1045988,"acceptance":0.4882178380631518},{"id":202,"title":"Happy Number","slug":"happy-number","difficulty":1,"accepted":2243245,"submitted":3771997,"acceptance":0.5947101760685387},{"id":203,"title":"Remove Linked List Elements","slug":"remove-linked-list-elements","difficulty":1,"accepted":1586485,"submitted":2926732,"acceptance":0.5420670563618397},{"id":204,"title":"Count Primes","slug":"count-primes","difficulty":2,"accepted":1255463,"submitted":3494743,"acceptance":0.3592432977188881},{"id":205,"title":"Isomorphic Strings","slug":"isomorphic-strings","difficulty":1,"accepted":2142299,"submitted":4440903,"acceptance":0.4824016647064797},{"id":206,"title":"Reverse Linked List","slug":"reverse-linked-list","difficulty":1,"accepted":6218740,"submitted":7732397,"acceptance":0.8042447898109732},{"id":207,"title":"Course Schedule","slug":"course-schedule","difficulty":2,"accepted":2550320,"submitted":4986589,"acceptance":0.5114357730304222},{"id":208,"title":"Implement Trie (Prefix Tree)","slug":"implement-trie-prefix-tree","difficulty":2,"accepted":1525557,"submitted":2199922,"acceptance":0.6934595862944232},{"id":209,"title":"Minimum Size Subarray Sum","slug":"minimum-size-subarray-sum","difficulty":2,"accepted":1847419,"submitted":3594735,"acceptance":0.513923557647504},{"id":210,"title":"Course Schedule II","slug":"course-schedule-ii","difficulty":2,"accepted":1681877,"submitted":3043399,"acceptance":0.5526311206647567},{"id":211,"title":"Design Add and Search Words Data Structure","slug":"design-add-and-search-words-data-structure","difficulty":2,"accepted":878683,"submitted":1818199,"acceptance":0.48327108308826483},{"id":212,"title":"Word Search II","slug":"word-search-ii","difficulty":3,"accepted":898617,"submitted":2346571,"acceptance":0.3829489923807973},{"id":213,"title":"House Robber II","slug":"house-robber-ii","difficulty":2,"accepted":1236734,"submitted":2762413,"acceptance":0.4477006153677962},{"id":214,"title":"Shortest Palindrome","slug":"shortest-palindrome","difficulty":3,"accepted":353705,"submitted":837814,"acceptance":0.42217604384744106},{"id":215,"title":"Kth Largest Element in an Array","slug":"kth-largest-element-in-an-array","difficulty":2,"accepted":3572089,"submitted":5187829,"acceptance":0.688551800762901},{"id":216,"title":"Combination Sum III","slug":"combination-sum-iii","difficulty":2,"accepted":795128,"submitted":1087715,"acceptance":0.7310076628528612},{"id":217,"title":"Contains Duplicate","slug":"contains-duplicate","difficulty":1,"accepted":6303494,"submitted":9814958,"acceptance":0.64223341556836},{"id":218,"title":"The Skyline Problem","slug":"the-skyline-problem","difficulty":3,"accepted":350075,"submitted":775036,"acceptance":0.45168869575090703},{"id":219,"title":"Contains Duplicate II","slug":"contains-duplicate-ii","difficulty":1,"accepted":1747381,"submitted":3421719,"acceptance":0.5106734363634186},{"id":220,"title":"Contains Duplicate III","slug":"contains-duplicate-iii","difficulty":3,"accepted":315130,"submitted":1279470,"acceptance":0.24629729497370004},{"id":221,"title":"Maximal Square","slug":"maximal-square","difficulty":2,"accepted":922587,"submitted":1838614,"acceptance":0.5017839524772465},{"id":222,"title":"Count Complete Tree Nodes","slug":"count-complete-tree-nodes","difficulty":1,"accepted":1157793,"submitted":1600225,"acceptance":0.7235188801574779},{"id":223,"title":"Rectangle Area","slug":"rectangle-area","difficulty":2,"accepted":284576,"submitted":576648,"acceptance":0.49350036764195837},{"id":224,"title":"Basic Calculator","slug":"basic-calculator","difficulty":3,"accepted":698375,"submitted":1493566,"acceptance":0.4675889783243593},{"id":225,"title":"Implement Stack using Queues","slug":"implement-stack-using-queues","difficulty":1,"accepted":1136817,"submitted":1631768,"acceptance":0.6966780816880831},{"id":226,"title":"Invert Binary Tree","slug":"invert-binary-tree","difficulty":1,"accepted":3004992,"submitted":3758088,"acceptance":0.7996066084668587},{"id":227,"title":"Basic Calculator II","slug":"basic-calculator-ii","difficulty":2,"accepted":944086,"submitted":2017869,"acceptance":0.4678628791066219},{"id":228,"title":"Summary Ranges","slug":"summary-ranges","difficulty":1,"accepted":934202,"submitted":1727323,"acceptance":0.5408380482399644},{"id":229,"title":"Majority Element II","slug":"majority-element-ii","difficulty":2,"accepted":1244009,"submitted":2221262,"acceptance":0.5600460458964318},{"id":230,"title":"Kth Smallest Element in a BST","slug":"kth-smallest-element-in-a-bst","difficulty":2,"accepted":2226236,"submitted":2903762,"acceptance":0.7666730262328662},{"id":231,"title":"Power of Two","slug":"power-of-two","difficulty":1,"accepted":2201371,"submitted":4402731,"acceptance":0.500001249224629},{"id":232,"title":"Implement Queue using Stacks","slug":"implement-queue-using-stacks","difficulty":1,"accepted":1468486,"submitted":2109731,"acceptance":0.6960536675054781},{"id":233,"title":"Number of Digit One","slug":"number-of-digit-one","difficulty":3,"accepted":141892,"submitted":371376,"acceptance":0.3820710008185774},{"id":234,"title":"Palindrome Linked List","slug":"palindrome-linked-list","difficulty":1,"accepted":2868301,"submitted":4968913,"acceptance":0.5772491891083623},{"id":235,"title":"Lowest Common Ancestor of a Binary Search Tree","slug":"lowest-common-ancestor-of-a-binary-search-tree","difficulty":2,"accepted":2245078,"submitted":3190346,"acceptance":0.703709879743451},{"id":236,"title":"Lowest Common Ancestor of a Binary Tree","slug":"lowest-common-ancestor-of-a-binary-tree","difficulty":2,"accepted":2563568,"submitted":3712529,"acceptance":0.6905179730582576},{"id":237,"title":"Delete Node in a Linked List","slug":"delete-node-in-a-linked-list","difficulty":2,"accepted":2007940,"submitted":2397782,"acceptance":0.8374155782302144},{"id":238,"title":"Product of Array Except Self","slug":"product-of-array-except-self","difficulty":2,"accepted":4470714,"submitted":6501450,"acceptance":0.6876487552776688},{"id":239,"title":"Sliding Window Maximum","slug":"sliding-window-maximum","difficulty":3,"accepted":1647953,"submitted":3389085,"acceptance":0.48625307420734504},{"id":240,"title":"Search a 2D Matrix II","slug":"search-a-2d-matrix-ii","difficulty":2,"accepted":1361291,"submitted":2384783,"acceptance":0.5708238443497794},{"id":241,"title":"Different Ways to Add Parentheses","slug":"different-ways-to-add-parentheses","difficulty":2,"accepted":377230,"submitted":515507,"acceptance":0.7317650390780338},{"id":242,"title":"Valid Anagram","slug":"valid-anagram","difficulty":1,"accepted":6037879,"submitted":8884921,"acceptance":0.6795647367039054},{"id":243,"title":"Shortest Word Distance","slug":"shortest-word-distance","difficulty":1,"accepted":245072,"submitted":369637,"acceptance":0.6630072205975052},{"id":244,"title":"Shortest Word Distance II","slug":"shortest-word-distance-ii","difficulty":2,"accepted":180289,"submitted":286875,"acceptance":0.6284583877995643},{"id":245,"title":"Shortest Word Distance III","slug":"shortest-word-distance-iii","difficulty":2,"accepted":94300,"submitted":158600,"acceptance":0.594577553593947},{"id":246,"title":"Strobogrammatic Number","slug":"strobogrammatic-number","difficulty":1,"accepted":211669,"submitted":445356,"acceptance":0.4752804497974654},{"id":247,"title":"Strobogrammatic Number II","slug":"strobogrammatic-number-ii","difficulty":2,"accepted":162055,"submitted":302848,"acceptance":0.535103418216399},{"id":248,"title":"Strobogrammatic Number III","slug":"strobogrammatic-number-iii","difficulty":3,"accepted":38344,"submitted":89827,"acceptance":0.4268649737829383},{"id":249,"title":"Group Shifted Strings","slug":"group-shifted-strings","difficulty":2,"accepted":316172,"submitted":466452,"acceptance":0.6778232272559663},{"id":250,"title":"Count Univalue Subtrees","slug":"count-univalue-subtrees","difficulty":2,"accepted":170439,"submitted":296409,"acceptance":0.5750129044664636},{"id":251,"title":"Flatten 2D Vector","slug":"flatten-2d-vector","difficulty":2,"accepted":145869,"submitted":289070,"acceptance":0.5046147991835888},{"id":252,"title":"Meeting Rooms","slug":"meeting-rooms","difficulty":1,"accepted":516115,"submitted":869007,"acceptance":0.5939135127795289},{"id":253,"title":"Meeting Rooms II","slug":"meeting-rooms-ii","difficulty":2,"accepted":1165042,"submitted":2214029,"acceptance":0.5262090062957622},{"id":254,"title":"Factor Combinations","slug":"factor-combinations","difficulty":2,"accepted":141010,"submitted":279114,"acceptance":0.5052057582206554},{"id":255,"title":"Verify Preorder Sequence in Binary Search Tree","slug":"verify-preorder-sequence-in-binary-search-tree","difficulty":2,"accepted":94029,"submitted":181790,"acceptance":0.5172396721491831},{"id":256,"title":"Paint House","slug":"paint-house","difficulty":2,"accepted":245437,"submitted":381291,"acceptance":0.6436999562014315},{"id":257,"title":"Binary Tree Paths","slug":"binary-tree-paths","difficulty":1,"accepted":1007230,"submitted":1471517,"acceptance":0.6844841072172458},{"id":258,"title":"Add Digits","slug":"add-digits","difficulty":1,"accepted":1211414,"submitted":1760460,"acceptance":0.6881235586153619},{"id":259,"title":"3Sum Smaller","slug":"3sum-smaller","difficulty":2,"accepted":174634,"submitted":340179,"acceptance":0.5133591432745701},{"id":260,"title":"Single Number III","slug":"single-number-iii","difficulty":2,"accepted":595662,"submitted":846818,"acceptance":0.7034120672919092},{"id":261,"title":"Graph Valid Tree","slug":"graph-valid-tree","difficulty":2,"accepted":531344,"submitted":1064177,"acceptance":0.4993003983359911},{"id":262,"title":"Trips and Users","slug":"trips-and-users","difficulty":3,"accepted":296043,"submitted":778949,"acceptance":0.3800544066427969},{"id":263,"title":"Ugly Number","slug":"ugly-number","difficulty":1,"accepted":770553,"submitted":1777909,"acceptance":0.4334040718619457},{"id":264,"title":"Ugly Number II","slug":"ugly-number-ii","difficulty":2,"accepted":534244,"submitted":1078081,"acceptance":0.4955508908885325},{"id":265,"title":"Paint House II","slug":"paint-house-ii","difficulty":3,"accepted":144367,"submitted":252978,"acceptance":0.5706701768533232},{"id":266,"title":"Palindrome Permutation","slug":"palindrome-permutation","difficulty":1,"accepted":234203,"submitted":341156,"acceptance":0.6864982588610489},{"id":267,"title":"Palindrome Permutation II","slug":"palindrome-permutation-ii","difficulty":2,"accepted":75864,"submitted":179178,"acceptance":0.4234001942202726},{"id":268,"title":"Missing Number","slug":"missing-number","difficulty":1,"accepted":3834422,"submitted":5337336,"acceptance":0.7184149545765902},{"id":269,"title":"Alien Dictionary","slug":"alien-dictionary","difficulty":3,"accepted":485016,"submitted":1305684,"acceptance":0.3714650711810821},{"id":270,"title":"Closest Binary Search Tree Value","slug":"closest-binary-search-tree-value","difficulty":1,"accepted":452191,"submitted":918708,"acceptance":0.49220318098895405},{"id":271,"title":"Encode and Decode Strings","slug":"encode-and-decode-strings","difficulty":2,"accepted":303682,"submitted":590667,"acceptance":0.5141340213690624},{"id":272,"title":"Closest Binary Search Tree Value II","slug":"closest-binary-search-tree-value-ii","difficulty":3,"accepted":140111,"submitted":229016,"acceptance":0.6117956823977364},{"id":273,"title":"Integer to English Words","slug":"integer-to-english-words","difficulty":3,"accepted":581618,"submitted":1663910,"acceptance":0.3495489539698662},{"id":274,"title":"H-Index","slug":"h-index","difficulty":2,"accepted":860839,"submitted":2084415,"acceptance":0.4129882964764694},{"id":275,"title":"H-Index II","slug":"h-index-ii","difficulty":2,"accepted":266007,"submitted":673698,"acceptance":0.39484605861973765},{"id":276,"title":"Paint Fence","slug":"paint-fence","difficulty":2,"accepted":129468,"submitted":267825,"acceptance":0.483405208625035},{"id":277,"title":"Find the Celebrity","slug":"find-the-celebrity","difficulty":2,"accepted":324902,"submitted":663648,"acceptance":0.48956977192728673},{"id":278,"title":"First Bad Version","slug":"first-bad-version","difficulty":1,"accepted":2146926,"submitted":4567458,"acceptance":0.47004832885162817},{"id":279,"title":"Perfect Squares","slug":"perfect-squares","difficulty":2,"accepted":1052088,"submitted":1864624,"acceptance":0.5642360068303315},{"id":280,"title":"Wiggle Sort","slug":"wiggle-sort","difficulty":2,"accepted":158309,"submitted":231345,"acceptance":0.6842983423026217},{"id":281,"title":"Zigzag Iterator","slug":"zigzag-iterator","difficulty":2,"accepted":111865,"submitted":168082,"acceptance":0.6655382491878964},{"id":282,"title":"Expression Add Operators","slug":"expression-add-operators","difficulty":3,"accepted":314027,"submitted":730515,"acceptance":0.42987070765145136},{"id":283,"title":"Move Zeroes","slug":"move-zeroes","difficulty":1,"accepted":5048260,"submitted":7921904,"acceptance":0.6372533673722883},{"id":284,"title":"Peeking Iterator","slug":"peeking-iterator","difficulty":2,"accepted":255705,"submitted":416689,"acceptance":0.6136591078718181},{"id":285,"title":"Inorder Successor in BST","slug":"inorder-successor-in-bst","difficulty":2,"accepted":371367,"submitted":725721,"acceptance":0.5117214466716548},{"id":286,"title":"Walls and Gates","slug":"walls-and-gates","difficulty":2,"accepted":425305,"submitted":665537,"acceptance":0.6390403538796491},{"id":287,"title":"Find the Duplicate Number","slug":"find-the-duplicate-number","difficulty":2,"accepted":2534965,"submitted":3949495,"acceptance":0.6418453498485249},{"id":288,"title":"Unique Word Abbreviation","slug":"unique-word-abbreviation","difficulty":2,"accepted":80243,"submitted":292143,"acceptance":0.27467028133482574},{"id":289,"title":"Game of Life","slug":"game-of-life","difficulty":2,"accepted":633755,"submitted":874283,"acceptance":0.724885420395913},{"id":290,"title":"Word Pattern","slug":"word-pattern","difficulty":1,"accepted":1100683,"submitted":2503060,"acceptance":0.43973496440357},{"id":291,"title":"Word Pattern II","slug":"word-pattern-ii","difficulty":2,"accepted":83630,"submitted":171299,"acceptance":0.48821067256668166},{"id":292,"title":"Nim Game","slug":"nim-game","difficulty":1,"accepted":541768,"submitted":909175,"acceptance":0.5958896802045811},{"id":293,"title":"Flip Game","slug":"flip-game","difficulty":1,"accepted":79291,"submitted":121907,"acceptance":0.6504220430328037},{"id":294,"title":"Flip Game II","slug":"flip-game-ii","difficulty":2,"accepted":75748,"submitted":144841,"acceptance":0.5229734674574188},{"id":295,"title":"Find Median from Data Stream","slug":"find-median-from-data-stream","difficulty":3,"accepted":1201501,"submitted":2211212,"acceptance":0.5433676192061186},{"id":296,"title":"Best Meeting Point","slug":"best-meeting-point","difficulty":3,"accepted":97373,"submitted":158494,"acceptance":0.6143639506858304},{"id":297,"title":"Serialize and Deserialize Binary Tree","slug":"serialize-and-deserialize-binary-tree","difficulty":3,"accepted":1189425,"submitted":1963649,"acceptance":0.6057217965125132},{"id":298,"title":"Binary Tree Longest Consecutive Sequence","slug":"binary-tree-longest-consecutive-sequence","difficulty":2,"accepted":165157,"submitted":301847,"acceptance":0.5471546843268278},{"id":299,"title":"Bulls and Cows","slug":"bulls-and-cows","difficulty":2,"accepted":445893,"submitted":851670,"acceptance":0.5235513755327768},{"id":300,"title":"Longest Increasing Subsequence","slug":"longest-increasing-subsequence","difficulty":2,"accepted":2592454,"submitted":4375999,"acceptance":0.5924256381228606},{"id":301,"title":"Remove Invalid Parentheses","slug":"remove-invalid-parentheses","difficulty":3,"accepted":504503,"submitted":1011835,"acceptance":0.4986020447997944},{"id":302,"title":"Smallest Rectangle Enclosing Black Pixels","slug":"smallest-rectangle-enclosing-black-pixels","difficulty":3,"accepted":57234,"submitted":94041,"acceptance":0.6086068842313459},{"id":303,"title":"Range Sum Query - Immutable","slug":"range-sum-query-immutable","difficulty":1,"accepted":911171,"submitted":1268200,"acceptance":0.7184757924617569},{"id":304,"title":"Range Sum Query 2D - Immutable","slug":"range-sum-query-2d-immutable","difficulty":2,"accepted":477661,"submitted":822026,"acceptance":0.5810777274684742},{"id":305,"title":"Number of Islands II","slug":"number-of-islands-ii","difficulty":3,"accepted":180232,"submitted":445013,"acceptance":0.4050038987625081},{"id":306,"title":"Additive Number","slug":"additive-number","difficulty":2,"accepted":118682,"submitted":352539,"acceptance":0.3366492785195397},{"id":307,"title":"Range Sum Query - Mutable","slug":"range-sum-query-mutable","difficulty":2,"accepted":344347,"submitted":804035,"acceptance":0.42827364480401975},{"id":308,"title":"Range Sum Query 2D - Mutable","slug":"range-sum-query-2d-mutable","difficulty":2,"accepted":83688,"submitted":184144,"acceptance":0.45447041445825004},{"id":309,"title":"Best Time to Buy and Sell Stock with Cooldown","slug":"best-time-to-buy-and-sell-stock-with-cooldown","difficulty":2,"accepted":759662,"submitted":1227181,"acceptance":0.6190301186214584},{"id":310,"title":"Minimum Height Trees","slug":"minimum-height-trees","difficulty":2,"accepted":481944,"submitted":1134658,"acceptance":0.4247482501335204},{"id":311,"title":"Sparse Matrix Multiplication","slug":"sparse-matrix-multiplication","difficulty":2,"accepted":222219,"submitted":320806,"acceptance":0.6926896629115415},{"id":312,"title":"Burst Balloons","slug":"burst-balloons","difficulty":3,"accepted":438392,"submitted":693461,"acceptance":0.6321797476714625},{"id":313,"title":"Super Ugly Number","slug":"super-ugly-number","difficulty":2,"accepted":159329,"submitted":346062,"acceptance":0.4604059388202114},{"id":314,"title":"Binary Tree Vertical Order Traversal","slug":"binary-tree-vertical-order-traversal","difficulty":2,"accepted":595051,"submitted":1029534,"acceptance":0.5779809117523074},{"id":315,"title":"Count of Smaller Numbers After Self","slug":"count-of-smaller-numbers-after-self","difficulty":3,"accepted":386837,"submitted":891378,"acceptance":0.43397638263452765},{"id":316,"title":"Remove Duplicate Letters","slug":"remove-duplicate-letters","difficulty":2,"accepted":443645,"submitted":836587,"acceptance":0.5303034830806599},{"id":317,"title":"Shortest Distance from All Buildings","slug":"shortest-distance-from-all-buildings","difficulty":3,"accepted":219365,"submitted":488607,"acceptance":0.4489600026196923},{"id":318,"title":"Maximum Product of Word Lengths","slug":"maximum-product-of-word-lengths","difficulty":2,"accepted":251963,"submitted":412112,"acceptance":0.6113944752882712},{"id":319,"title":"Bulb Switcher","slug":"bulb-switcher","difficulty":2,"accepted":305024,"submitted":547430,"acceptance":0.5571927004365855},{"id":320,"title":"Generalized Abbreviation","slug":"generalized-abbreviation","difficulty":2,"accepted":75757,"submitted":125455,"acceptance":0.6038579570363876},{"id":321,"title":"Create Maximum Number","slug":"create-maximum-number","difficulty":3,"accepted":85146,"submitted":242969,"acceptance":0.35043976803625154},{"id":322,"title":"Coin Change","slug":"coin-change","difficulty":2,"accepted":2809839,"submitted":5831342,"acceptance":0.4818511759385747},{"id":323,"title":"Number of Connected Components in an Undirected Graph","slug":"number-of-connected-components-in-an-undirected-graph","difficulty":2,"accepted":536331,"submitted":826549,"acceptance":0.6488798607221109},{"id":324,"title":"Wiggle Sort II","slug":"wiggle-sort-ii","difficulty":2,"accepted":203287,"submitted":547034,"acceptance":0.37161675508286507},{"id":325,"title":"Maximum Size Subarray Sum Equals k","slug":"maximum-size-subarray-sum-equals-k","difficulty":2,"accepted":220784,"submitted":434324,"acceptance":0.5083393963953178},{"id":326,"title":"Power of Three","slug":"power-of-three","difficulty":1,"accepted":1375912,"submitted":2701099,"acceptance":0.5093896965642504},{"id":327,"title":"Count of Range Sum","slug":"count-of-range-sum","difficulty":3,"accepted":104596,"submitted":270763,"acceptance":0.38630093476582844},{"id":328,"title":"Odd Even Linked List","slug":"odd-even-linked-list","difficulty":2,"accepted":1482150,"submitted":2374327,"acceptance":0.624240047811443},{"id":329,"title":"Longest Increasing Path in a Matrix","slug":"longest-increasing-path-in-a-matrix","difficulty":3,"accepted":711121,"submitted":1259030,"acceptance":0.5648165651334758},{"id":330,"title":"Patching Array","slug":"patching-array","difficulty":3,"accepted":183023,"submitted":337820,"acceptance":0.5417766858090107},{"id":331,"title":"Verify Preorder Serialization of a Binary Tree","slug":"verify-preorder-serialization-of-a-binary-tree","difficulty":2,"accepted":167531,"submitted":354822,"acceptance":0.4721550523924672},{"id":332,"title":"Reconstruct Itinerary","slug":"reconstruct-itinerary","difficulty":3,"accepted":548477,"submitted":1234703,"acceptance":0.4442177592506052},{"id":333,"title":"Largest BST Subtree","slug":"largest-bst-subtree","difficulty":2,"accepted":128840,"submitted":280983,"acceptance":0.4585330785136467},{"id":334,"title":"Increasing Triplet Subsequence","slug":"increasing-triplet-subsequence","difficulty":2,"accepted":920077,"submitted":2340658,"acceptance":0.3930847650532457},{"id":335,"title":"Self Crossing","slug":"self-crossing","difficulty":3,"accepted":47585,"submitted":137619,"acceptance":0.34577347604618547},{"id":336,"title":"Palindrome Pairs","slug":"palindrome-pairs","difficulty":3,"accepted":240219,"submitted":647608,"acceptance":0.37093272473471606},{"id":337,"title":"House Robber III","slug":"house-robber-iii","difficulty":2,"accepted":502708,"submitted":901329,"acceptance":0.5577408471268538},{"id":338,"title":"Counting Bits","slug":"counting-bits","difficulty":1,"accepted":1602913,"submitted":1990925,"acceptance":0.8051096851965794},{"id":339,"title":"Nested List Weight Sum","slug":"nested-list-weight-sum","difficulty":2,"accepted":415372,"submitted":483303,"acceptance":0.859444282365307},{"id":340,"title":"Longest Substring with At Most K Distinct Characters","slug":"longest-substring-with-at-most-k-distinct-characters","difficulty":2,"accepted":398722,"submitted":798123,"acceptance":0.4995746269685249},{"id":341,"title":"Flatten Nested List Iterator","slug":"flatten-nested-list-iterator","difficulty":2,"accepted":535126,"submitted":814969,"acceptance":0.6566212947977162},{"id":342,"title":"Power of Four","slug":"power-of-four","difficulty":1,"accepted":1091232,"submitted":2102212,"acceptance":0.5190875135333639},{"id":343,"title":"Integer Break","slug":"integer-break","difficulty":2,"accepted":439883,"submitted":707602,"acceptance":0.6216531326932372},{"id":344,"title":"Reverse String","slug":"reverse-string","difficulty":1,"accepted":3783229,"submitted":4688676,"acceptance":0.8068864216678653},{"id":345,"title":"Reverse Vowels of a String","slug":"reverse-vowels-of-a-string","difficulty":1,"accepted":1575784,"submitted":2582617,"acceptance":0.6101500919416235},{"id":346,"title":"Moving Average from Data Stream","slug":"moving-average-from-data-stream","difficulty":1,"accepted":531081,"submitted":662136,"acceptance":0.802072383921128},{"id":347,"title":"Top K Frequent Elements","slug":"top-k-frequent-elements","difficulty":2,"accepted":3516771,"submitted":5313076,"acceptance":0.6619086570566655},{"id":348,"title":"Design Tic-Tac-Toe","slug":"design-tic-tac-toe","difficulty":2,"accepted":314821,"submitted":535807,"acceptance":0.5875641788927729},{"id":349,"title":"Intersection of Two Arrays","slug":"intersection-of-two-arrays","difficulty":1,"accepted":1841085,"submitted":2371152,"acceptance":0.7764516994271139},{"id":350,"title":"Intersection of Two Arrays II","slug":"intersection-of-two-arrays-ii","difficulty":1,"accepted":1730291,"submitted":2893298,"acceptance":0.5980341464999457},{"id":351,"title":"Android Unlock Patterns","slug":"android-unlock-patterns","difficulty":2,"accepted":83986,"submitted":156137,"acceptance":0.5378994088524821},{"id":352,"title":"Data Stream as Disjoint Intervals","slug":"data-stream-as-disjoint-intervals","difficulty":3,"accepted":133400,"submitted":222220,"acceptance":0.6003060030600306},{"id":353,"title":"Design Snake Game","slug":"design-snake-game","difficulty":2,"accepted":105843,"submitted":264531,"acceptance":0.40011567642355717},{"id":354,"title":"Russian Doll Envelopes","slug":"russian-doll-envelopes","difficulty":3,"accepted":291665,"submitted":771444,"acceptance":0.3780766977253048},{"id":355,"title":"Design Twitter","slug":"design-twitter","difficulty":2,"accepted":337252,"submitted":758572,"acceptance":0.44458798901093105},{"id":356,"title":"Line Reflection","slug":"line-reflection","difficulty":2,"accepted":46219,"submitted":127333,"acceptance":0.36297738999316753},{"id":357,"title":"Count Numbers with Unique Digits","slug":"count-numbers-with-unique-digits","difficulty":2,"accepted":186154,"submitted":335281,"acceptance":0.5552178620321462},{"id":358,"title":"Rearrange String k Distance Apart","slug":"rearrange-string-k-distance-apart","difficulty":3,"accepted":73771,"submitted":184719,"acceptance":0.3993687709439744},{"id":359,"title":"Logger Rate Limiter","slug":"logger-rate-limiter","difficulty":1,"accepted":391238,"submitted":509408,"acceptance":0.7680248445254099},{"id":360,"title":"Sort Transformed Array","slug":"sort-transformed-array","difficulty":2,"accepted":76930,"submitted":132430,"acceptance":0.5809106697878125},{"id":361,"title":"Bomb Enemy","slug":"bomb-enemy","difficulty":2,"accepted":86685,"submitted":164158,"acceptance":0.5280583340440308},{"id":362,"title":"Design Hit Counter","slug":"design-hit-counter","difficulty":2,"accepted":332471,"submitted":477268,"acceptance":0.6966128045458736},{"id":363,"title":"Max Sum of Rectangle No Larger Than K","slug":"max-sum-of-rectangle-no-larger-than-k","difficulty":3,"accepted":143271,"submitted":315246,"acceptance":0.45447364915018745},{"id":364,"title":"Nested List Weight Sum II","slug":"nested-list-weight-sum-ii","difficulty":2,"accepted":167297,"submitted":250034,"acceptance":0.6690970028076182},{"id":365,"title":"Water and Jug Problem","slug":"water-and-jug-problem","difficulty":2,"accepted":146617,"submitted":323901,"acceptance":0.45265991769089936},{"id":366,"title":"Find Leaves of Binary Tree","slug":"find-leaves-of-binary-tree","difficulty":2,"accepted":288309,"submitted":354583,"acceptance":0.8130931262920106},{"id":367,"title":"Valid Perfect Square","slug":"valid-perfect-square","difficulty":1,"accepted":915747,"submitted":2043561,"acceptance":0.44811336681410535},{"id":368,"title":"Largest Divisible Subset","slug":"largest-divisible-subset","difficulty":2,"accepted":499405,"submitted":1007997,"acceptance":0.49544294278653606},{"id":369,"title":"Plus One Linked List","slug":"plus-one-linked-list","difficulty":2,"accepted":87847,"submitted":143457,"acceptance":0.6123577099758115},{"id":370,"title":"Range Addition","slug":"range-addition","difficulty":2,"accepted":106131,"submitted":145463,"acceptance":0.7296082165224146},{"id":371,"title":"Sum of Two Integers","slug":"sum-of-two-integers","difficulty":2,"accepted":695220,"submitted":1257046,"acceptance":0.5530585197359524},{"id":372,"title":"Super Pow","slug":"super-pow","difficulty":2,"accepted":102088,"submitted":278259,"acceptance":0.3668812149831632},{"id":373,"title":"Find K Pairs with Smallest Sums","slug":"find-k-pairs-with-smallest-sums","difficulty":2,"accepted":453204,"submitted":1085999,"acceptance":0.41731530139530515},{"id":374,"title":"Guess Number Higher or Lower","slug":"guess-number-higher-or-lower","difficulty":1,"accepted":1005910,"submitted":1753572,"acceptance":0.5736348436220469},{"id":375,"title":"Guess Number Higher or Lower II","slug":"guess-number-higher-or-lower-ii","difficulty":2,"accepted":159524,"submitted":303141,"acceptance":0.5262369656364531},{"id":376,"title":"Wiggle Subsequence","slug":"wiggle-subsequence","difficulty":2,"accepted":292101,"submitted":591949,"acceptance":0.49345636195010045},{"id":377,"title":"Combination Sum IV","slug":"combination-sum-iv","difficulty":2,"accepted":601671,"submitted":1092837,"acceptance":0.5505587750048726},{"id":378,"title":"Kth Smallest Element in a Sorted Matrix","slug":"kth-smallest-element-in-a-sorted-matrix","difficulty":2,"accepted":801853,"submitted":1243064,"acceptance":0.6450617184634098},{"id":379,"title":"Design Phone Directory","slug":"design-phone-directory","difficulty":2,"accepted":76655,"submitted":144192,"acceptance":0.5316175654682646},{"id":380,"title":"Insert Delete GetRandom O(1)","slug":"insert-delete-getrandom-o1","difficulty":2,"accepted":1354210,"submitted":2447564,"acceptance":0.5532889027620932},{"id":381,"title":"Insert Delete GetRandom O(1) - Duplicates allowed","slug":"insert-delete-getrandom-o1-duplicates-allowed","difficulty":3,"accepted":187852,"submitted":514667,"acceptance":0.3649971729292921},{"id":382,"title":"Linked List Random Node","slug":"linked-list-random-node","difficulty":2,"accepted":288411,"submitted":445501,"acceptance":0.6473857522205337},{"id":383,"title":"Ransom Note","slug":"ransom-note","difficulty":1,"accepted":1934736,"submitted":2939920,"acceptance":0.658091376636099},{"id":384,"title":"Shuffle an Array","slug":"shuffle-an-array","difficulty":2,"accepted":393069,"submitted":659086,"acceptance":0.5963849937640915},{"id":385,"title":"Mini Parser","slug":"mini-parser","difficulty":2,"accepted":73709,"submitted":174344,"acceptance":0.42277910338181984},{"id":386,"title":"Lexicographical Numbers","slug":"lexicographical-numbers","difficulty":2,"accepted":384521,"submitted":504577,"acceptance":0.7620660474020814},{"id":387,"title":"First Unique Character in a String","slug":"first-unique-character-in-a-string","difficulty":1,"accepted":2359782,"submitted":3614488,"acceptance":0.6528675707320096},{"id":388,"title":"Longest Absolute File Path","slug":"longest-absolute-file-path","difficulty":2,"accepted":182980,"submitted":370970,"acceptance":0.4932474324069332},{"id":389,"title":"Find the Difference","slug":"find-the-difference","difficulty":1,"accepted":1083935,"submitted":1799165,"acceptance":0.6024655882034166},{"id":390,"title":"Elimination Game","slug":"elimination-game","difficulty":2,"accepted":107336,"submitted":232390,"acceptance":0.461878738327811},{"id":391,"title":"Perfect Rectangle","slug":"perfect-rectangle","difficulty":3,"accepted":60628,"submitted":160923,"acceptance":0.3767516141260106},{"id":392,"title":"Is Subsequence","slug":"is-subsequence","difficulty":1,"accepted":2455397,"submitted":5016566,"acceptance":0.48945772865342546},{"id":393,"title":"UTF-8 Validation","slug":"utf-8-validation","difficulty":2,"accepted":139877,"submitted":303005,"acceptance":0.46163264632596823},{"id":394,"title":"Decode String","slug":"decode-string","difficulty":2,"accepted":1186739,"submitted":1900062,"acceptance":0.6245790926822388},{"id":395,"title":"Longest Substring with At Least K Repeating Characters","slug":"longest-substring-with-at-least-k-repeating-characters","difficulty":2,"accepted":297248,"submitted":643350,"acceptance":0.4620315535866946},{"id":396,"title":"Rotate Function","slug":"rotate-function","difficulty":2,"accepted":113340,"submitted":248444,"acceptance":0.45619938497206614},{"id":397,"title":"Integer Replacement","slug":"integer-replacement","difficulty":2,"accepted":162970,"submitted":436013,"acceptance":0.3737732590542025},{"id":398,"title":"Random Pick Index","slug":"random-pick-index","difficulty":2,"accepted":305521,"submitted":469854,"acceptance":0.6502466723705662},{"id":399,"title":"Evaluate Division","slug":"evaluate-division","difficulty":2,"accepted":703860,"submitted":1098119,"acceptance":0.6409687838931846},{"id":400,"title":"Nth Digit","slug":"nth-digit","difficulty":2,"accepted":133095,"submitted":351515,"acceptance":0.3786324907898667},{"id":401,"title":"Binary Watch","slug":"binary-watch","difficulty":1,"accepted":280218,"submitted":428804,"acceptance":0.6534873741849423},{"id":402,"title":"Remove K Digits","slug":"remove-k-digits","difficulty":2,"accepted":725762,"submitted":1981396,"acceptance":0.3662882129569253},{"id":403,"title":"Frog Jump","slug":"frog-jump","difficulty":3,"accepted":336947,"submitted":713584,"acceptance":0.4721896791407879},{"id":404,"title":"Sum of Left Leaves","slug":"sum-of-left-leaves","difficulty":1,"accepted":789688,"submitted":1262748,"acceptance":0.6253726000753911},{"id":405,"title":"Convert a Number to Hexadecimal","slug":"convert-a-number-to-hexadecimal","difficulty":1,"accepted":218037,"submitted":405634,"acceptance":0.5375215095381551},{"id":406,"title":"Queue Reconstruction by Height","slug":"queue-reconstruction-by-height","difficulty":2,"accepted":343912,"submitted":460654,"acceptance":0.746573350063171},{"id":407,"title":"Trapping Rain Water II","slug":"trapping-rain-water-ii","difficulty":3,"accepted":265912,"submitted":415182,"acceptance":0.6404709260035358},{"id":408,"title":"Valid Word Abbreviation","slug":"valid-word-abbreviation","difficulty":1,"accepted":360964,"submitted":974939,"acceptance":0.37024265107868287},{"id":409,"title":"Longest Palindrome","slug":"longest-palindrome","difficulty":1,"accepted":1046654,"submitted":1872016,"acceptance":0.5591052640575721},{"id":410,"title":"Split Array Largest Sum","slug":"split-array-largest-sum","difficulty":3,"accepted":623548,"submitted":1036364,"acceptance":0.6016689116951187},{"id":411,"title":"Minimum Unique Word Abbreviation","slug":"minimum-unique-word-abbreviation","difficulty":3,"accepted":15728,"submitted":38847,"acceptance":0.4048703889618246},{"id":412,"title":"Fizz Buzz","slug":"fizz-buzz","difficulty":1,"accepted":1766983,"submitted":2343285,"acceptance":0.7540623526374299},{"id":413,"title":"Arithmetic Slices","slug":"arithmetic-slices","difficulty":2,"accepted":366788,"submitted":565804,"acceptance":0.6482598214222594},{"id":414,"title":"Third Maximum Number","slug":"third-maximum-number","difficulty":1,"accepted":831307,"submitted":2121626,"acceptance":0.3918254206914885},{"id":415,"title":"Add Strings","slug":"add-strings","difficulty":1,"accepted":935216,"submitted":1794376,"acceptance":0.5211928826511277},{"id":416,"title":"Partition Equal Subset Sum","slug":"partition-equal-subset-sum","difficulty":2,"accepted":1484667,"submitted":3008592,"acceptance":0.49347568563633754},{"id":417,"title":"Pacific Atlantic Water Flow","slug":"pacific-atlantic-water-flow","difficulty":2,"accepted":799134,"submitted":1314762,"acceptance":0.6078164717264417},{"id":418,"title":"Sentence Screen Fitting","slug":"sentence-screen-fitting","difficulty":2,"accepted":106932,"submitted":293795,"acceptance":0.3639680729760547},{"id":419,"title":"Battleships in a Board","slug":"battleships-in-a-board","difficulty":2,"accepted":282453,"submitted":364678,"acceptance":0.774527117073144},{"id":420,"title":"Strong Password Checker","slug":"strong-password-checker","difficulty":3,"accepted":55516,"submitted":355439,"acceptance":0.1561899510183182},{"id":421,"title":"Maximum XOR of Two Numbers in an Array","slug":"maximum-xor-of-two-numbers-in-an-array","difficulty":2,"accepted":220328,"submitted":412602,"acceptance":0.5339964420918949},{"id":422,"title":"Valid Word Square","slug":"valid-word-square","difficulty":1,"accepted":71048,"submitted":165801,"acceptance":0.4285137001586239},{"id":423,"title":"Reconstruct Original Digits from English","slug":"reconstruct-original-digits-from-english","difficulty":2,"accepted":99515,"submitted":188485,"acceptance":0.5279730482531766},{"id":424,"title":"Longest Repeating Character Replacement","slug":"longest-repeating-character-replacement","difficulty":2,"accepted":1521863,"submitted":2563703,"acceptance":0.5936190736602485},{"id":425,"title":"Word Squares","slug":"word-squares","difficulty":3,"accepted":83397,"submitted":152539,"acceptance":0.5467257553805912},{"id":426,"title":"Convert Binary Search Tree to Sorted Doubly Linked List","slug":"convert-binary-search-tree-to-sorted-doubly-linked-list","difficulty":2,"accepted":372008,"submitted":566726,"acceptance":0.6564159752684718},{"id":427,"title":"Construct Quad Tree","slug":"construct-quad-tree","difficulty":2,"accepted":201771,"submitted":257832,"acceptance":0.7825677185143814},{"id":428,"title":"Serialize and Deserialize N-ary Tree","slug":"serialize-and-deserialize-n-ary-tree","difficulty":3,"accepted":99700,"submitted":145088,"acceptance":0.6871691662990737},{"id":429,"title":"N-ary Tree Level Order Traversal","slug":"n-ary-tree-level-order-traversal","difficulty":2,"accepted":365698,"submitted":511412,"acceptance":0.7150751253392568},{"id":430,"title":"Flatten a Multilevel Doubly Linked List","slug":"flatten-a-multilevel-doubly-linked-list","difficulty":2,"accepted":435699,"submitted":694267,"acceptance":0.6275669158983503},{"id":431,"title":"Encode N-ary Tree to Binary Tree","slug":"encode-n-ary-tree-to-binary-tree","difficulty":3,"accepted":25033,"submitted":31067,"acceptance":0.8057746161521873},{"id":432,"title":"All O`one Data Structure","slug":"all-oone-data-structure","difficulty":3,"accepted":204465,"submitted":462412,"acceptance":0.44217061840955685},{"id":433,"title":"Minimum Genetic Mutation","slug":"minimum-genetic-mutation","difficulty":2,"accepted":277225,"submitted":490565,"acceptance":0.5651136954328173},{"id":434,"title":"Number of Segments in a String","slug":"number-of-segments-in-a-string","difficulty":1,"accepted":275476,"submitted":741576,"acceptance":0.3714737262263072},{"id":435,"title":"Non-overlapping Intervals","slug":"non-overlapping-intervals","difficulty":2,"accepted":997695,"submitted":1751990,"acceptance":0.5694638668028927},{"id":436,"title":"Find Right Interval","slug":"find-right-interval","difficulty":2,"accepted":159990,"submitted":287574,"acceptance":0.5563437584760792},{"id":437,"title":"Path Sum III","slug":"path-sum-iii","difficulty":2,"accepted":785600,"submitted":1694526,"acceptance":0.46361047278117895},{"id":438,"title":"Find All Anagrams in a String","slug":"find-all-anagrams-in-a-string","difficulty":2,"accepted":1188676,"submitted":2219978,"acceptance":0.5354449458508147},{"id":439,"title":"Ternary Expression Parser","slug":"ternary-expression-parser","difficulty":2,"accepted":38653,"submitted":61777,"acceptance":0.6256859348948638},{"id":440,"title":"K-th Smallest in Lexicographical Order","slug":"k-th-smallest-in-lexicographical-order","difficulty":3,"accepted":168982,"submitted":365329,"acceptance":0.46254745722348894},{"id":441,"title":"Arranging Coins","slug":"arranging-coins","difficulty":1,"accepted":617605,"submitted":1284131,"acceptance":0.48095170975546886},{"id":442,"title":"Find All Duplicates in an Array","slug":"find-all-duplicates-in-an-array","difficulty":2,"accepted":1030072,"submitted":1339911,"acceptance":0.7687615072941412},{"id":443,"title":"String Compression","slug":"string-compression","difficulty":2,"accepted":1059245,"submitted":1771275,"acceptance":0.5980127309424003},{"id":444,"title":"Sequence Reconstruction","slug":"sequence-reconstruction","difficulty":2,"accepted":65050,"submitted":212238,"acceptance":0.30649553802806284},{"id":445,"title":"Add Two Numbers II","slug":"add-two-numbers-ii","difficulty":2,"accepted":577782,"submitted":924082,"acceptance":0.6252497072770599},{"id":446,"title":"Arithmetic Slices II - Subsequence","slug":"arithmetic-slices-ii-subsequence","difficulty":3,"accepted":168718,"submitted":306796,"acceptance":0.5499354620008083},{"id":447,"title":"Number of Boomerangs","slug":"number-of-boomerangs","difficulty":2,"accepted":118301,"submitted":205865,"acceptance":0.5746532922060573},{"id":448,"title":"Find All Numbers Disappeared in an Array","slug":"find-all-numbers-disappeared-in-an-array","difficulty":1,"accepted":1363783,"submitted":2132014,"acceptance":0.6396688764707924},{"id":449,"title":"Serialize and Deserialize BST","slug":"serialize-and-deserialize-bst","difficulty":2,"accepted":275238,"submitted":462459,"acceptance":0.5951619494917387},{"id":450,"title":"Delete Node in a BST","slug":"delete-node-in-a-bst","difficulty":2,"accepted":855374,"submitted":1570936,"acceptance":0.5444995849608132},{"id":451,"title":"Sort Characters By Frequency","slug":"sort-characters-by-frequency","difficulty":2,"accepted":1101864,"submitted":1464696,"acceptance":0.7522817021416048},{"id":452,"title":"Minimum Number of Arrows to Burst Balloons","slug":"minimum-number-of-arrows-to-burst-balloons","difficulty":2,"accepted":776666,"submitted":1266793,"acceptance":0.6130962201401492},{"id":453,"title":"Minimum Moves to Equal Array Elements","slug":"minimum-moves-to-equal-array-elements","difficulty":2,"accepted":218495,"submitted":372647,"acceptance":0.5863323735331292},{"id":454,"title":"4Sum II","slug":"4sum-ii","difficulty":2,"accepted":385355,"submitted":665545,"acceptance":0.579006678736975},{"id":455,"title":"Assign Cookies","slug":"assign-cookies","difficulty":1,"accepted":928277,"submitted":1693627,"acceptance":0.5481000243855347},{"id":456,"title":"132 Pattern","slug":"132-pattern","difficulty":2,"accepted":323797,"submitted":934469,"acceptance":0.3465037363465241},{"id":457,"title":"Circular Array Loop","slug":"circular-array-loop","difficulty":2,"accepted":107846,"submitted":290132,"acceptance":0.37171356486013263},{"id":458,"title":"Poor Pigs","slug":"poor-pigs","difficulty":3,"accepted":133057,"submitted":225110,"acceptance":0.5910754742126072},{"id":459,"title":"Repeated Substring Pattern","slug":"repeated-substring-pattern","difficulty":1,"accepted":608122,"submitted":1265153,"acceptance":0.4806707172966432},{"id":460,"title":"LFU Cache","slug":"lfu-cache","difficulty":3,"accepted":376872,"submitted":770001,"acceptance":0.4894435202032205},{"id":461,"title":"Hamming Distance","slug":"hamming-distance","difficulty":1,"accepted":687962,"submitted":896781,"acceptance":0.7671460479202837},{"id":462,"title":"Minimum Moves to Equal Array Elements II","slug":"minimum-moves-to-equal-array-elements-ii","difficulty":2,"accepted":224322,"submitted":363772,"acceptance":0.6166554875031613},{"id":463,"title":"Island Perimeter","slug":"island-perimeter","difficulty":1,"accepted":821599,"submitted":1105059,"acceptance":0.7434888091948032},{"id":464,"title":"Can I Win","slug":"can-i-win","difficulty":2,"accepted":121959,"submitted":391660,"acceptance":0.31138998110606136},{"id":465,"title":"Optimal Account Balancing","slug":"optimal-account-balancing","difficulty":3,"accepted":114474,"submitted":227251,"acceptance":0.5037337569471642},{"id":466,"title":"Count The Repetitions","slug":"count-the-repetitions","difficulty":3,"accepted":28168,"submitted":82847,"acceptance":0.3400002414088621},{"id":467,"title":"Unique Substrings in Wraparound String","slug":"unique-substrings-in-wraparound-string","difficulty":2,"accepted":56573,"submitted":131931,"acceptance":0.42880748269928975},{"id":468,"title":"Validate IP Address","slug":"validate-ip-address","difficulty":2,"accepted":201265,"submitted":712040,"acceptance":0.2826596820403348},{"id":469,"title":"Convex Polygon","slug":"convex-polygon","difficulty":2,"accepted":11643,"submitted":28962,"acceptance":0.4020095297286099},{"id":470,"title":"Implement Rand10() Using Rand7()","slug":"implement-rand10-using-rand7","difficulty":2,"accepted":109369,"submitted":236153,"acceptance":0.4631277180471982},{"id":471,"title":"Encode String with Shortest Length","slug":"encode-string-with-shortest-length","difficulty":3,"accepted":32121,"submitted":63489,"acceptance":0.5059301611302746},{"id":472,"title":"Concatenated Words","slug":"concatenated-words","difficulty":3,"accepted":267018,"submitted":536652,"acceptance":0.4975626663088929},{"id":473,"title":"Matchsticks to Square","slug":"matchsticks-to-square","difficulty":2,"accepted":213613,"submitted":511823,"acceptance":0.41735717230370656},{"id":474,"title":"Ones and Zeroes","slug":"ones-and-zeroes","difficulty":2,"accepted":347778,"submitted":653758,"acceptance":0.5319674864399365},{"id":475,"title":"Heaters","slug":"heaters","difficulty":2,"accepted":168743,"submitted":404862,"acceptance":0.4167914005265992},{"id":476,"title":"Number Complement","slug":"number-complement","difficulty":1,"accepted":550203,"submitted":781183,"acceptance":0.7043202425039972},{"id":477,"title":"Total Hamming Distance","slug":"total-hamming-distance","difficulty":2,"accepted":134976,"submitted":246558,"acceptance":0.5474411700289588},{"id":478,"title":"Generate Random Point in a Circle","slug":"generate-random-point-in-a-circle","difficulty":2,"accepted":53989,"submitted":126457,"acceptance":0.4269356382011277},{"id":479,"title":"Largest Palindrome Product","slug":"largest-palindrome-product","difficulty":3,"accepted":34081,"submitted":88609,"acceptance":0.3846223295602027},{"id":480,"title":"Sliding Window Median","slug":"sliding-window-median","difficulty":3,"accepted":218736,"submitted":561501,"acceptance":0.3895558511917165},{"id":481,"title":"Magical String","slug":"magical-string","difficulty":2,"accepted":55452,"submitted":100942,"acceptance":0.5493451685126112},{"id":482,"title":"License Key Formatting","slug":"license-key-formatting","difficulty":1,"accepted":358584,"submitted":782062,"acceptance":0.45851096204648734},{"id":483,"title":"Smallest Good Base","slug":"smallest-good-base","difficulty":3,"accepted":31385,"submitted":68456,"acceptance":0.4584696739511511},{"id":484,"title":"Find Permutation","slug":"find-permutation","difficulty":2,"accepted":43324,"submitted":64800,"acceptance":0.6685802469135802},{"id":485,"title":"Max Consecutive Ones","slug":"max-consecutive-ones","difficulty":1,"accepted":2230646,"submitted":3436568,"acceptance":0.6490911863230991},{"id":486,"title":"Predict the Winner","slug":"predict-the-winner","difficulty":2,"accepted":289684,"submitted":515835,"acceptance":0.5615826766310933},{"id":487,"title":"Max Consecutive Ones II","slug":"max-consecutive-ones-ii","difficulty":2,"accepted":183511,"submitted":352975,"acceptance":0.5198980097740633},{"id":488,"title":"Zuma Game","slug":"zuma-game","difficulty":3,"accepted":29564,"submitted":98839,"acceptance":0.2991126984287579},{"id":489,"title":"Robot Room Cleaner","slug":"robot-room-cleaner","difficulty":3,"accepted":211073,"submitted":270794,"acceptance":0.7794596630649128},{"id":490,"title":"The Maze","slug":"the-maze","difficulty":2,"accepted":209241,"submitted":346608,"acceptance":0.6036819692563357},{"id":491,"title":"Non-decreasing Subsequences","slug":"non-decreasing-subsequences","difficulty":2,"accepted":209655,"submitted":335029,"acceptance":0.6257816487527945},{"id":492,"title":"Construct the Rectangle","slug":"construct-the-rectangle","difficulty":1,"accepted":170802,"submitted":268987,"acceptance":0.6349823597422923},{"id":493,"title":"Reverse Pairs","slug":"reverse-pairs","difficulty":3,"accepted":356004,"submitted":1047515,"acceptance":0.3398557538555534},{"id":494,"title":"Target Sum","slug":"target-sum","difficulty":2,"accepted":1073631,"submitted":2062804,"acceptance":0.520471649269635},{"id":495,"title":"Teemo Attacking","slug":"teemo-attacking","difficulty":1,"accepted":220143,"submitted":382208,"acceptance":0.5759769549564635},{"id":496,"title":"Next Greater Element I","slug":"next-greater-element-i","difficulty":1,"accepted":1398695,"submitted":1840821,"acceptance":0.7598212971277489},{"id":497,"title":"Random Point in Non-overlapping Rectangles","slug":"random-point-in-non-overlapping-rectangles","difficulty":2,"accepted":52836,"submitted":133464,"acceptance":0.395882035605107},{"id":498,"title":"Diagonal Traverse","slug":"diagonal-traverse","difficulty":2,"accepted":557824,"submitted":831432,"acceptance":0.6709195700911199},{"id":499,"title":"The Maze III","slug":"the-maze-iii","difficulty":3,"accepted":40365,"submitted":77176,"acceptance":0.5230252928371515},{"id":500,"title":"Keyboard Row","slug":"keyboard-row","difficulty":1,"accepted":326952,"submitted":443388,"acceptance":0.7373947874096728},{"id":501,"title":"Find Mode in Binary Search Tree","slug":"find-mode-in-binary-search-tree","difficulty":1,"accepted":392564,"submitted":668258,"acceptance":0.5874437717169118},{"id":502,"title":"IPO","slug":"ipo","difficulty":3,"accepted":313331,"submitted":586506,"acceptance":0.5342332388756467},{"id":503,"title":"Next Greater Element II","slug":"next-greater-element-ii","difficulty":2,"accepted":787283,"submitted":1154798,"acceptance":0.6817495354165837},{"id":504,"title":"Base 7","slug":"base-7","difficulty":1,"accepted":204281,"submitted":376897,"acceptance":0.5420074980697644},{"id":505,"title":"The Maze II","slug":"the-maze-ii","difficulty":2,"accepted":128630,"submitted":233697,"acceptance":0.550413569707784},{"id":506,"title":"Relative Ranks","slug":"relative-ranks","difficulty":1,"accepted":410626,"submitted":550897,"acceptance":0.7453770850086314},{"id":507,"title":"Perfect Number","slug":"perfect-number","difficulty":1,"accepted":374120,"submitted":771901,"acceptance":0.48467355269652457},{"id":508,"title":"Most Frequent Subtree Sum","slug":"most-frequent-subtree-sum","difficulty":2,"accepted":175483,"submitted":253961,"acceptance":0.6909840487318919},{"id":509,"title":"Fibonacci Number","slug":"fibonacci-number","difficulty":1,"accepted":3010461,"submitted":4066999,"acceptance":0.7402168035940013},{"id":510,"title":"Inorder Successor in BST II","slug":"inorder-successor-in-bst-ii","difficulty":2,"accepted":75969,"submitted":124341,"acceptance":0.6109730499191739},{"id":511,"title":"Game Play Analysis I","slug":"game-play-analysis-i","difficulty":1,"accepted":526394,"submitted":690078,"acceptance":0.7628036250974527},{"id":512,"title":"Game Play Analysis II","slug":"game-play-analysis-ii","difficulty":1,"accepted":107182,"submitted":196266,"acceptance":0.5461057951963152},{"id":513,"title":"Find Bottom Left Tree Value","slug":"find-bottom-left-tree-value","difficulty":2,"accepted":442115,"submitted":611879,"acceptance":0.7225529884176447},{"id":514,"title":"Freedom Trail","slug":"freedom-trail","difficulty":3,"accepted":124297,"submitted":209660,"acceptance":0.592850329104264},{"id":515,"title":"Find Largest Value in Each Tree Row","slug":"find-largest-value-in-each-tree-row","difficulty":2,"accepted":519075,"submitted":782885,"acceptance":0.6630284141348984},{"id":516,"title":"Longest Palindromic Subsequence","slug":"longest-palindromic-subsequence","difficulty":2,"accepted":754620,"submitted":1156208,"acceptance":0.6526680320495966},{"id":517,"title":"Super Washing Machines","slug":"super-washing-machines","difficulty":3,"accepted":39756,"submitted":90074,"acceptance":0.4413704287585763},{"id":518,"title":"Coin Change II","slug":"coin-change-ii","difficulty":2,"accepted":991235,"submitted":1646383,"acceptance":0.6020682915214747},{"id":519,"title":"Random Flip Matrix","slug":"random-flip-matrix","difficulty":2,"accepted":30595,"submitted":67059,"acceptance":0.45624002743852426},{"id":520,"title":"Detect Capital","slug":"detect-capital","difficulty":1,"accepted":553153,"submitted":977859,"acceptance":0.5656776692754273},{"id":521,"title":"Longest Uncommon Subsequence I","slug":"longest-uncommon-subsequence-i","difficulty":1,"accepted":151317,"submitted":243579,"acceptance":0.6212235044893033},{"id":522,"title":"Longest Uncommon Subsequence II","slug":"longest-uncommon-subsequence-ii","difficulty":2,"accepted":67267,"submitted":150551,"acceptance":0.44680540149185327},{"id":523,"title":"Continuous Subarray Sum","slug":"continuous-subarray-sum","difficulty":2,"accepted":767875,"submitted":2453675,"acceptance":0.3129489439310422},{"id":524,"title":"Longest Word in Dictionary through Deleting","slug":"longest-word-in-dictionary-through-deleting","difficulty":2,"accepted":183170,"submitted":348223,"acceptance":0.5260135028415699},{"id":525,"title":"Contiguous Array","slug":"contiguous-array","difficulty":2,"accepted":666059,"submitted":1304057,"acceptance":0.5107591155908062},{"id":526,"title":"Beautiful Arrangement","slug":"beautiful-arrangement","difficulty":2,"accepted":215684,"submitted":333119,"acceptance":0.6474683221311304},{"id":527,"title":"Word Abbreviation","slug":"word-abbreviation","difficulty":3,"accepted":33788,"submitted":53875,"acceptance":0.6271554524361949},{"id":528,"title":"Random Pick with Weight","slug":"random-pick-with-weight","difficulty":2,"accepted":694371,"submitted":1417008,"acceptance":0.4900261678127435},{"id":529,"title":"Minesweeper","slug":"minesweeper","difficulty":2,"accepted":204518,"submitted":297748,"acceptance":0.6868828673912167},{"id":530,"title":"Minimum Absolute Difference in BST","slug":"minimum-absolute-difference-in-bst","difficulty":1,"accepted":609259,"submitted":1027359,"acceptance":0.5930341779261193},{"id":531,"title":"Lonely Pixel I","slug":"lonely-pixel-i","difficulty":2,"accepted":48082,"submitted":76730,"acceptance":0.6266388635475042},{"id":532,"title":"K-diff Pairs in an Array","slug":"k-diff-pairs-in-an-array","difficulty":2,"accepted":426429,"submitted":931657,"acceptance":0.45771029466853147},{"id":533,"title":"Lonely Pixel II","slug":"lonely-pixel-ii","difficulty":2,"accepted":14362,"submitted":29385,"acceptance":0.4887527650161647},{"id":534,"title":"Game Play Analysis III","slug":"game-play-analysis-iii","difficulty":2,"accepted":96063,"submitted":118186,"acceptance":0.8128120081904794},{"id":535,"title":"Encode and Decode TinyURL","slug":"encode-and-decode-tinyurl","difficulty":2,"accepted":309559,"submitted":357384,"acceptance":0.8661803550242876},{"id":536,"title":"Construct Binary Tree from String","slug":"construct-binary-tree-from-string","difficulty":2,"accepted":127102,"submitted":216566,"acceptance":0.5868972968979433},{"id":537,"title":"Complex Number Multiplication","slug":"complex-number-multiplication","difficulty":2,"accepted":114048,"submitted":155505,"acceptance":0.7334040706086621},{"id":538,"title":"Convert BST to Greater Tree","slug":"convert-bst-to-greater-tree","difficulty":2,"accepted":354825,"submitted":496154,"acceptance":0.7151509410384679},{"id":539,"title":"Minimum Time Difference","slug":"minimum-time-difference","difficulty":2,"accepted":347473,"submitted":555270,"acceptance":0.625773047346336},{"id":540,"title":"Single Element in a Sorted Array","slug":"single-element-in-a-sorted-array","difficulty":2,"accepted":1194052,"submitted":2015387,"acceptance":0.5924678486067441},{"id":541,"title":"Reverse String II","slug":"reverse-string-ii","difficulty":1,"accepted":382139,"submitted":713157,"acceptance":0.5358413364799055},{"id":542,"title":"01 Matrix","slug":"01-matrix","difficulty":2,"accepted":891635,"submitted":1662743,"acceptance":0.5362434242694151},{"id":543,"title":"Diameter of Binary Tree","slug":"diameter-of-binary-tree","difficulty":1,"accepted":2468828,"submitted":3779039,"acceptance":0.6532951895971436},{"id":544,"title":"Output Contest Matches","slug":"output-contest-matches","difficulty":2,"accepted":28463,"submitted":36727,"acceptance":0.7749884281318921},{"id":545,"title":"Boundary of Binary Tree","slug":"boundary-of-binary-tree","difficulty":2,"accepted":175488,"submitted":365397,"acceptance":0.4802666688560661},{"id":546,"title":"Remove Boxes","slug":"remove-boxes","difficulty":3,"accepted":62078,"submitted":125757,"acceptance":0.4936345491702251},{"id":547,"title":"Number of Provinces","slug":"number-of-provinces","difficulty":2,"accepted":1508018,"submitted":2148091,"acceptance":0.7020270556508081},{"id":548,"title":"Split Array with Equal Sum","slug":"split-array-with-equal-sum","difficulty":3,"accepted":25015,"submitted":49966,"acceptance":0.5006404354961373},{"id":549,"title":"Binary Tree Longest Consecutive Sequence II","slug":"binary-tree-longest-consecutive-sequence-ii","difficulty":2,"accepted":62595,"submitted":124968,"acceptance":0.5008882273862109},{"id":550,"title":"Game Play Analysis IV","slug":"game-play-analysis-iv","difficulty":2,"accepted":453240,"submitted":1105216,"acceptance":0.41009178296369214},{"id":551,"title":"Student Attendance Record I","slug":"student-attendance-record-i","difficulty":1,"accepted":287335,"submitted":573506,"acceptance":0.5010148106558606},{"id":552,"title":"Student Attendance Record II","slug":"student-attendance-record-ii","difficulty":3,"accepted":158479,"submitted":280563,"acceptance":0.564860655182615},{"id":553,"title":"Optimal Division","slug":"optimal-division","difficulty":2,"accepted":51657,"submitted":82186,"acceptance":0.6285377071520697},{"id":554,"title":"Brick Wall","slug":"brick-wall","difficulty":2,"accepted":170899,"submitted":305096,"acceptance":0.5601482811967381},{"id":555,"title":"Split Concatenated Strings","slug":"split-concatenated-strings","difficulty":2,"accepted":7526,"submitted":17277,"acceptance":0.43560803380216473},{"id":556,"title":"Next Greater Element III","slug":"next-greater-element-iii","difficulty":2,"accepted":208651,"submitted":591715,"acceptance":0.3526207718242735},{"id":557,"title":"Reverse Words in a String III","slug":"reverse-words-in-a-string-iii","difficulty":1,"accepted":1129010,"submitted":1344555,"acceptance":0.8396904552063694},{"id":558,"title":"Logical OR of Two Binary Grids Represented as Quad-Trees","slug":"logical-or-of-two-binary-grids-represented-as-quad-trees","difficulty":2,"accepted":19745,"submitted":37460,"acceptance":0.5270955686065136},{"id":559,"title":"Maximum Depth of N-ary Tree","slug":"maximum-depth-of-n-ary-tree","difficulty":1,"accepted":354304,"submitted":481997,"acceptance":0.7350751145754019},{"id":560,"title":"Subarray Sum Equals K","slug":"subarray-sum-equals-k","difficulty":2,"accepted":2386877,"submitted":5066643,"acceptance":0.4710963452526653},{"id":561,"title":"Array Partition","slug":"array-partition","difficulty":1,"accepted":668053,"submitted":818577,"acceptance":0.8161150386585502},{"id":562,"title":"Longest Line of Consecutive One in Matrix","slug":"longest-line-of-consecutive-one-in-matrix","difficulty":2,"accepted":81111,"submitted":160363,"acceptance":0.5057962248149511},{"id":563,"title":"Binary Tree Tilt","slug":"binary-tree-tilt","difficulty":1,"accepted":268318,"submitted":408572,"acceptance":0.6567214591308264},{"id":564,"title":"Find the Closest Palindrome","slug":"find-the-closest-palindrome","difficulty":3,"accepted":137544,"submitted":431245,"acceptance":0.31894630662384493},{"id":565,"title":"Array Nesting","slug":"array-nesting","difficulty":2,"accepted":148735,"submitted":262989,"acceptance":0.5655559738240002},{"id":566,"title":"Reshape the Matrix","slug":"reshape-the-matrix","difficulty":1,"accepted":468566,"submitted":722423,"acceptance":0.6486033805678945},{"id":567,"title":"Permutation in String","slug":"permutation-in-string","difficulty":2,"accepted":1471125,"submitted":3022756,"acceptance":0.4866833446034017},{"id":568,"title":"Maximum Vacation Days","slug":"maximum-vacation-days","difficulty":3,"accepted":41372,"submitted":88480,"acceptance":0.4675858951175407},{"id":569,"title":"Median Employee Salary","slug":"median-employee-salary","difficulty":3,"accepted":50896,"submitted":77293,"acceptance":0.6584813631247332},{"id":570,"title":"Managers with at Least 5 Direct Reports","slug":"managers-with-at-least-5-direct-reports","difficulty":2,"accepted":950385,"submitted":1939749,"acceptance":0.4899525660278727},{"id":571,"title":"Find Median Given Frequency of Numbers","slug":"find-median-given-frequency-of-numbers","difficulty":3,"accepted":35981,"submitted":85152,"acceptance":0.4225502630590004},{"id":572,"title":"Subtree of Another Tree","slug":"subtree-of-another-tree","difficulty":1,"accepted":1248364,"submitted":2427041,"acceptance":0.514356370576352},{"id":573,"title":"Squirrel Simulation","slug":"squirrel-simulation","difficulty":2,"accepted":24131,"submitted":42074,"acceptance":0.5735371012977135},{"id":574,"title":"Winning Candidate","slug":"winning-candidate","difficulty":2,"accepted":77648,"submitted":123967,"acceptance":0.6263602410318875},{"id":575,"title":"Distribute Candies","slug":"distribute-candies","difficulty":1,"accepted":399036,"submitted":562468,"acceptance":0.709437692455393},{"id":576,"title":"Out of Boundary Paths","slug":"out-of-boundary-paths","difficulty":2,"accepted":229807,"submitted":474723,"acceptance":0.48408650939600567},{"id":577,"title":"Employee Bonus","slug":"employee-bonus","difficulty":1,"accepted":1056260,"submitted":1366138,"acceptance":0.7731722563899108},{"id":578,"title":"Get Highest Answer Rate Question","slug":"get-highest-answer-rate-question","difficulty":2,"accepted":69082,"submitted":172529,"acceptance":0.4004080473427656},{"id":579,"title":"Find Cumulative Salary of an Employee","slug":"find-cumulative-salary-of-an-employee","difficulty":3,"accepted":44179,"submitted":89420,"acceptance":0.4940617311563409},{"id":580,"title":"Count Student Number in Departments","slug":"count-student-number-in-departments","difficulty":2,"accepted":78636,"submitted":131094,"acceptance":0.5998443864707766},{"id":581,"title":"Shortest Unsorted Continuous Subarray","slug":"shortest-unsorted-continuous-subarray","difficulty":2,"accepted":392140,"submitted":1029040,"acceptance":0.38107362201663686},{"id":582,"title":"Kill Process","slug":"kill-process","difficulty":2,"accepted":97353,"submitted":137870,"acceptance":0.7061217088561689},{"id":583,"title":"Delete Operation for Two Strings","slug":"delete-operation-for-two-strings","difficulty":2,"accepted":387069,"submitted":591536,"acceptance":0.6543456357685754},{"id":584,"title":"Find Customer Referee","slug":"find-customer-referee","difficulty":1,"accepted":2078715,"submitted":2858237,"acceptance":0.7272717412866743},{"id":585,"title":"Investments in 2016","slug":"investments-in-2016","difficulty":2,"accepted":309518,"submitted":607687,"acceptance":0.5093378663687063},{"id":586,"title":"Customer Placing the Largest Number of Orders","slug":"customer-placing-the-largest-number-of-orders","difficulty":1,"accepted":499161,"submitted":775690,"acceptance":0.6435057819489745},{"id":587,"title":"Erect the Fence","slug":"erect-the-fence","difficulty":3,"accepted":67004,"submitted":126739,"acceptance":0.5286770449506466},{"id":588,"title":"Design In-Memory File System","slug":"design-in-memory-file-system","difficulty":3,"accepted":140000,"submitted":289442,"acceptance":0.48368930562945256},{"id":589,"title":"N-ary Tree Preorder Traversal","slug":"n-ary-tree-preorder-traversal","difficulty":1,"accepted":497007,"submitted":647804,"acceptance":0.7672181709282437},{"id":590,"title":"N-ary Tree Postorder Traversal","slug":"n-ary-tree-postorder-traversal","difficulty":1,"accepted":429876,"submitted":530475,"acceptance":0.8103605259437296},{"id":591,"title":"Tag Validator","slug":"tag-validator","difficulty":3,"accepted":20808,"submitted":51420,"acceptance":0.4046674445740957},{"id":592,"title":"Fraction Addition and Subtraction","slug":"fraction-addition-and-subtraction","difficulty":2,"accepted":137700,"submitted":207293,"acceptance":0.6642771342978296},{"id":593,"title":"Valid Square","slug":"valid-square","difficulty":2,"accepted":129676,"submitted":288639,"acceptance":0.4492670775605514},{"id":594,"title":"Longest Harmonious Subsequence","slug":"longest-harmonious-subsequence","difficulty":1,"accepted":383242,"submitted":593824,"acceptance":0.645379775825834},{"id":595,"title":"Big Countries","slug":"big-countries","difficulty":1,"accepted":2308591,"submitted":3373094,"acceptance":0.6844134791381444},{"id":596,"title":"Classes With at Least 5 Students","slug":"classes-with-at-least-5-students","difficulty":1,"accepted":860608,"submitted":1354320,"acceptance":0.6354539547522003},{"id":597,"title":"Friend Requests I: Overall Acceptance Rate","slug":"friend-requests-i-overall-acceptance-rate","difficulty":1,"accepted":86723,"submitted":211009,"acceptance":0.4109919482107398},{"id":598,"title":"Range Addition II","slug":"range-addition-ii","difficulty":1,"accepted":133227,"submitted":227593,"acceptance":0.585373891112644},{"id":599,"title":"Minimum Index Sum of Two Lists","slug":"minimum-index-sum-of-two-lists","difficulty":1,"accepted":313677,"submitted":525604,"acceptance":0.5967934033987565},{"id":600,"title":"Non-negative Integers without Consecutive Ones","slug":"non-negative-integers-without-consecutive-ones","difficulty":3,"accepted":51737,"submitted":122911,"acceptance":0.42093059205441336},{"id":601,"title":"Human Traffic of Stadium","slug":"human-traffic-of-stadium","difficulty":3,"accepted":173706,"submitted":340262,"acceptance":0.5105066096125926},{"id":602,"title":"Friend Requests II: Who Has the Most Friends","slug":"friend-requests-ii-who-has-the-most-friends","difficulty":2,"accepted":337669,"submitted":540505,"acceptance":0.6247287259137289},{"id":603,"title":"Consecutive Available Seats","slug":"consecutive-available-seats","difficulty":1,"accepted":102798,"submitted":158138,"acceptance":0.6500524858035387},{"id":604,"title":"Design Compressed String Iterator","slug":"design-compressed-string-iterator","difficulty":1,"accepted":39568,"submitted":98010,"acceptance":0.40371390674420976},{"id":605,"title":"Can Place Flowers","slug":"can-place-flowers","difficulty":1,"accepted":1382044,"submitted":4750650,"acceptance":0.2909168219085809},{"id":606,"title":"Construct String from Binary Tree","slug":"construct-string-from-binary-tree","difficulty":2,"accepted":355198,"submitted":502667,"acceptance":0.7066268523694613},{"id":607,"title":"Sales Person","slug":"sales-person","difficulty":1,"accepted":378252,"submitted":573913,"acceptance":0.659075504475417},{"id":608,"title":"Tree Node","slug":"tree-node","difficulty":2,"accepted":249305,"submitted":330382,"acceptance":0.7545961947079441},{"id":609,"title":"Find Duplicate File in System","slug":"find-duplicate-file-in-system","difficulty":2,"accepted":176150,"submitted":260735,"acceptance":0.6755901585901394},{"id":610,"title":"Triangle Judgement","slug":"triangle-judgement","difficulty":1,"accepted":471736,"submitted":631657,"acceptance":0.7468230384528312},{"id":611,"title":"Valid Triangle Number","slug":"valid-triangle-number","difficulty":2,"accepted":364711,"submitted":642059,"acceptance":0.5680334673293265},{"id":612,"title":"Shortest Distance in a Plane","slug":"shortest-distance-in-a-plane","difficulty":2,"accepted":48716,"submitted":79867,"acceptance":0.6099640652584922},{"id":613,"title":"Shortest Distance in a Line","slug":"shortest-distance-in-a-line","difficulty":1,"accepted":85030,"submitted":106724,"acceptance":0.7967280086953262},{"id":614,"title":"Second Degree Follower","slug":"second-degree-follower","difficulty":2,"accepted":63524,"submitted":155735,"acceptance":0.40789803191318585},{"id":615,"title":"Average Salary: Departments VS Company","slug":"average-salary-departments-vs-company","difficulty":3,"accepted":43750,"submitted":77179,"acceptance":0.5668640433278482},{"id":616,"title":"Add Bold Tag in String","slug":"add-bold-tag-in-string","difficulty":2,"accepted":105185,"submitted":204704,"acceptance":0.5138394950758168},{"id":617,"title":"Merge Two Binary Trees","slug":"merge-two-binary-trees","difficulty":1,"accepted":896017,"submitted":1133737,"acceptance":0.7903217412856773},{"id":618,"title":"Students Report By Geography","slug":"students-report-by-geography","difficulty":3,"accepted":29321,"submitted":46157,"acceptance":0.6352449249301297},{"id":619,"title":"Biggest Single Number","slug":"biggest-single-number","difficulty":1,"accepted":549554,"submitted":772746,"acceptance":0.7111702939905221},{"id":620,"title":"Not Boring Movies","slug":"not-boring-movies","difficulty":1,"accepted":1092662,"submitted":1454753,"acceptance":0.7510979527108725},{"id":621,"title":"Task Scheduler","slug":"task-scheduler","difficulty":2,"accepted":952631,"submitted":1514696,"acceptance":0.6289255401743981},{"id":622,"title":"Design Circular Queue","slug":"design-circular-queue","difficulty":2,"accepted":469958,"submitted":864995,"acceptance":0.5433071867467442},{"id":623,"title":"Add One Row to Tree","slug":"add-one-row-to-tree","difficulty":2,"accepted":303685,"submitted":473632,"acceptance":0.6411834504425377},{"id":624,"title":"Maximum Distance in Arrays","slug":"maximum-distance-in-arrays","difficulty":2,"accepted":204925,"submitted":449181,"acceptance":0.45621920784717074},{"id":625,"title":"Minimum Factorization","slug":"minimum-factorization","difficulty":2,"accepted":12235,"submitted":36034,"acceptance":0.33954043403452294},{"id":626,"title":"Exchange Seats","slug":"exchange-seats","difficulty":2,"accepted":449543,"submitted":607505,"acceptance":0.7399823869762389},{"id":627,"title":"Swap Sex of Employees","slug":"swap-sex-of-employees","difficulty":1,"accepted":549662,"submitted":649848,"acceptance":0.8458316406298089},{"id":628,"title":"Maximum Product of Three Numbers","slug":"maximum-product-of-three-numbers","difficulty":1,"accepted":490018,"submitted":1068272,"acceptance":0.45870152919855617},{"id":629,"title":"K Inverse Pairs Array","slug":"k-inverse-pairs-array","difficulty":3,"accepted":140356,"submitted":286543,"acceptance":0.4898252618280677},{"id":630,"title":"Course Schedule III","slug":"course-schedule-iii","difficulty":3,"accepted":139828,"submitted":336612,"acceptance":0.41539814385702234},{"id":631,"title":"Design Excel Sum Formula","slug":"design-excel-sum-formula","difficulty":3,"accepted":33996,"submitted":85267,"acceptance":0.3987005523825161},{"id":632,"title":"Smallest Range Covering Elements from K Lists","slug":"smallest-range-covering-elements-from-k-lists","difficulty":3,"accepted":242505,"submitted":345899,"acceptance":0.7010861552071559},{"id":633,"title":"Sum of Square Numbers","slug":"sum-of-square-numbers","difficulty":2,"accepted":439821,"submitted":1195270,"acceptance":0.3679679068327658},{"id":634,"title":"Find the Derangement of An Array","slug":"find-the-derangement-of-an-array","difficulty":2,"accepted":12591,"submitted":30237,"acceptance":0.4164103581704534},{"id":635,"title":"Design Log Storage System","slug":"design-log-storage-system","difficulty":2,"accepted":43864,"submitted":73639,"acceptance":0.5956626244245576},{"id":636,"title":"Exclusive Time of Functions","slug":"exclusive-time-of-functions","difficulty":2,"accepted":351879,"submitted":531708,"acceptance":0.6617899298110993},{"id":637,"title":"Average of Levels in Binary Tree","slug":"average-of-levels-in-binary-tree","difficulty":1,"accepted":740221,"submitted":989096,"acceptance":0.7483813502430502},{"id":638,"title":"Shopping Offers","slug":"shopping-offers","difficulty":2,"accepted":81528,"submitted":155650,"acceptance":0.5237905557340187},{"id":639,"title":"Decode Ways II","slug":"decode-ways-ii","difficulty":3,"accepted":88820,"submitted":279054,"acceptance":0.31828965003189347},{"id":640,"title":"Solve the Equation","slug":"solve-the-equation","difficulty":2,"accepted":50737,"submitted":110010,"acceptance":0.46120352695209527},{"id":641,"title":"Design Circular Deque","slug":"design-circular-deque","difficulty":2,"accepted":202149,"submitted":313065,"acceptance":0.6457093574816731},{"id":642,"title":"Design Search Autocomplete System","slug":"design-search-autocomplete-system","difficulty":3,"accepted":167865,"submitted":336385,"acceptance":0.49902641318727053},{"id":643,"title":"Maximum Average Subarray I","slug":"maximum-average-subarray-i","difficulty":1,"accepted":1171860,"submitted":2466958,"acceptance":0.47502227439624023},{"id":644,"title":"Maximum Average Subarray II","slug":"maximum-average-subarray-ii","difficulty":3,"accepted":23012,"submitted":61044,"acceptance":0.37697398597732784},{"id":645,"title":"Set Mismatch","slug":"set-mismatch","difficulty":1,"accepted":724902,"submitted":1650249,"acceptance":0.4392682558813852},{"id":646,"title":"Maximum Length of Pair Chain","slug":"maximum-length-of-pair-chain","difficulty":2,"accepted":311882,"submitted":505765,"acceptance":0.6166539796150386},{"id":647,"title":"Palindromic Substrings","slug":"palindromic-substrings","difficulty":2,"accepted":1169546,"submitted":1608987,"acceptance":0.7268834365970639},{"id":648,"title":"Replace Words","slug":"replace-words","difficulty":2,"accepted":318690,"submitted":463911,"acceptance":0.6869636632888636},{"id":649,"title":"Dota2 Senate","slug":"dota2-senate","difficulty":2,"accepted":283413,"submitted":569916,"acceptance":0.49728907417935275},{"id":650,"title":"2 Keys Keyboard","slug":"2-keys-keyboard","difficulty":2,"accepted":296254,"submitted":499616,"acceptance":0.592963395888042},{"id":651,"title":"4 Keys Keyboard","slug":"4-keys-keyboard","difficulty":2,"accepted":35959,"submitted":63604,"acceptance":0.5653575246839821},{"id":652,"title":"Find Duplicate Subtrees","slug":"find-duplicate-subtrees","difficulty":2,"accepted":314625,"submitted":518651,"acceptance":0.606621793845958},{"id":653,"title":"Two Sum IV - Input is a BST","slug":"two-sum-iv-input-is-a-bst","difficulty":1,"accepted":759093,"submitted":1201712,"acceptance":0.6316763084665876},{"id":654,"title":"Maximum Binary Tree","slug":"maximum-binary-tree","difficulty":2,"accepted":362077,"submitted":419398,"acceptance":0.8633255284956056},{"id":655,"title":"Print Binary Tree","slug":"print-binary-tree","difficulty":2,"accepted":86293,"submitted":129759,"acceptance":0.66502516203115},{"id":656,"title":"Coin Path","slug":"coin-path","difficulty":3,"accepted":17274,"submitted":50425,"acceptance":0.34256817055032224},{"id":657,"title":"Robot Return to Origin","slug":"robot-return-to-origin","difficulty":1,"accepted":660371,"submitted":846233,"acceptance":0.780365454904264},{"id":658,"title":"Find K Closest Elements","slug":"find-k-closest-elements","difficulty":2,"accepted":810708,"submitted":1635320,"acceptance":0.49574884426289656},{"id":659,"title":"Split Array into Consecutive Subsequences","slug":"split-array-into-consecutive-subsequences","difficulty":2,"accepted":148242,"submitted":284591,"acceptance":0.5208948982926375},{"id":660,"title":"Remove 9","slug":"remove-9","difficulty":3,"accepted":11314,"submitted":19693,"acceptance":0.5745188645711674},{"id":661,"title":"Image Smoother","slug":"image-smoother","difficulty":1,"accepted":200465,"submitted":289785,"acceptance":0.6917714857566817},{"id":662,"title":"Maximum Width of Binary Tree","slug":"maximum-width-of-binary-tree","difficulty":2,"accepted":588365,"submitted":1294663,"acceptance":0.4544541706992476},{"id":663,"title":"Equal Tree Partition","slug":"equal-tree-partition","difficulty":2,"accepted":36766,"submitted":86923,"acceptance":0.4229720557274829},{"id":664,"title":"Strange Printer","slug":"strange-printer","difficulty":3,"accepted":161077,"submitted":264520,"acceptance":0.6089407228186905},{"id":665,"title":"Non-decreasing Array","slug":"non-decreasing-array","difficulty":2,"accepted":293488,"submitted":1155020,"acceptance":0.25409776454087374},{"id":666,"title":"Path Sum IV","slug":"path-sum-iv","difficulty":2,"accepted":41610,"submitted":66211,"acceptance":0.6284454244762955},{"id":667,"title":"Beautiful Arrangement II","slug":"beautiful-arrangement-ii","difficulty":2,"accepted":61490,"submitted":100701,"acceptance":0.6106195569060883},{"id":668,"title":"Kth Smallest Number in Multiplication Table","slug":"kth-smallest-number-in-multiplication-table","difficulty":3,"accepted":84634,"submitted":156820,"acceptance":0.5396888152021426},{"id":669,"title":"Trim a Binary Search Tree","slug":"trim-a-binary-search-tree","difficulty":2,"accepted":346152,"submitted":519292,"acceptance":0.666584503516326},{"id":670,"title":"Maximum Swap","slug":"maximum-swap","difficulty":2,"accepted":512740,"submitted":986105,"acceptance":0.5199649124586124},{"id":671,"title":"Second Minimum Node In a Binary Tree","slug":"second-minimum-node-in-a-binary-tree","difficulty":1,"accepted":243399,"submitted":528637,"acceptance":0.4604274766995121},{"id":672,"title":"Bulb Switcher II","slug":"bulb-switcher-ii","difficulty":2,"accepted":30290,"submitted":60504,"acceptance":0.500628057649081},{"id":673,"title":"Number of Longest Increasing Subsequence","slug":"number-of-longest-increasing-subsequence","difficulty":2,"accepted":335051,"submitted":647934,"acceptance":0.517106680618705},{"id":674,"title":"Longest Continuous Increasing Subsequence","slug":"longest-continuous-increasing-subsequence","difficulty":1,"accepted":348123,"submitted":670173,"acceptance":0.519452439892386},{"id":675,"title":"Cut Off Trees for Golf Event","slug":"cut-off-trees-for-golf-event","difficulty":3,"accepted":84561,"submitted":233108,"acceptance":0.3627546030166275},{"id":676,"title":"Implement Magic Dictionary","slug":"implement-magic-dictionary","difficulty":2,"accepted":106459,"submitted":184253,"acceptance":0.577787064525408},{"id":677,"title":"Map Sum Pairs","slug":"map-sum-pairs","difficulty":2,"accepted":140836,"submitted":246453,"acceptance":0.5714517575359196},{"id":678,"title":"Valid Parenthesis String","slug":"valid-parenthesis-string","difficulty":2,"accepted":584977,"submitted":1464324,"acceptance":0.3994860427063956},{"id":679,"title":"24 Game","slug":"24-game","difficulty":3,"accepted":170119,"submitted":286153,"acceptance":0.5945036396613},{"id":680,"title":"Valid Palindrome II","slug":"valid-palindrome-ii","difficulty":1,"accepted":1133269,"submitted":2568151,"acceptance":0.44127818029391574},{"id":681,"title":"Next Closest Time","slug":"next-closest-time","difficulty":2,"accepted":118194,"submitted":251553,"acceptance":0.46985724678298413},{"id":682,"title":"Baseball Game","slug":"baseball-game","difficulty":1,"accepted":587085,"submitted":731348,"acceptance":0.8027437006732773},{"id":683,"title":"K Empty Slots","slug":"k-empty-slots","difficulty":3,"accepted":67246,"submitted":177138,"acceptance":0.3796249251995619},{"id":684,"title":"Redundant Connection","slug":"redundant-connection","difficulty":2,"accepted":640327,"submitted":949412,"acceptance":0.6744458675474926},{"id":685,"title":"Redundant Connection II","slug":"redundant-connection-ii","difficulty":3,"accepted":91253,"submitted":253088,"acceptance":0.3605583828549753},{"id":686,"title":"Repeated String Match","slug":"repeated-string-match","difficulty":2,"accepted":256443,"submitted":664302,"acceptance":0.3860337617529377},{"id":687,"title":"Longest Univalue Path","slug":"longest-univalue-path","difficulty":2,"accepted":223628,"submitted":511172,"acceptance":0.4374809261853153},{"id":688,"title":"Knight Probability in Chessboard","slug":"knight-probability-in-chessboard","difficulty":2,"accepted":184352,"submitted":323620,"acceptance":0.5696557691119214},{"id":689,"title":"Maximum Sum of 3 Non-Overlapping Subarrays","slug":"maximum-sum-of-3-non-overlapping-subarrays","difficulty":3,"accepted":155857,"submitted":260834,"acceptance":0.5975332970394964},{"id":690,"title":"Employee Importance","slug":"employee-importance","difficulty":2,"accepted":252256,"submitted":363490,"acceptance":0.6939833282896366},{"id":691,"title":"Stickers to Spell Word","slug":"stickers-to-spell-word","difficulty":3,"accepted":96178,"submitted":189479,"acceptance":0.5075918703391933},{"id":692,"title":"Top K Frequent Words","slug":"top-k-frequent-words","difficulty":2,"accepted":784292,"submitted":1305341,"acceptance":0.6008330390296482},{"id":693,"title":"Binary Number with Alternating Bits","slug":"binary-number-with-alternating-bits","difficulty":1,"accepted":299926,"submitted":429462,"acceptance":0.6983761077813636},{"id":694,"title":"Number of Distinct Islands","slug":"number-of-distinct-islands","difficulty":2,"accepted":207189,"submitted":330031,"acceptance":0.6277864806639376},{"id":695,"title":"Max Area of Island","slug":"max-area-of-island","difficulty":2,"accepted":1229973,"submitted":1664564,"acceptance":0.7389160164463487},{"id":696,"title":"Count Binary Substrings","slug":"count-binary-substrings","difficulty":1,"accepted":371151,"submitted":527485,"acceptance":0.7036237997289022},{"id":697,"title":"Degree of an Array","slug":"degree-of-an-array","difficulty":1,"accepted":277628,"submitted":476425,"acceptance":0.5827318045862413},{"id":698,"title":"Partition to K Equal Sum Subsets","slug":"partition-to-k-equal-sum-subsets","difficulty":2,"accepted":342226,"submitted":888314,"acceptance":0.3852534126446279},{"id":699,"title":"Falling Squares","slug":"falling-squares","difficulty":3,"accepted":36207,"submitted":76012,"acceptance":0.4763326843130032},{"id":700,"title":"Search in a Binary Search Tree","slug":"search-in-a-binary-search-tree","difficulty":1,"accepted":1369129,"submitted":1657721,"acceptance":0.8259103914349881},{"id":701,"title":"Insert into a Binary Search Tree","slug":"insert-into-a-binary-search-tree","difficulty":2,"accepted":855898,"submitted":1165831,"acceptance":0.7341527202484751},{"id":702,"title":"Search in a Sorted Array of Unknown Size","slug":"search-in-a-sorted-array-of-unknown-size","difficulty":2,"accepted":113091,"submitted":154704,"acceptance":0.7310153583617748},{"id":703,"title":"Kth Largest Element in a Stream","slug":"kth-largest-element-in-a-stream","difficulty":1,"accepted":974452,"submitted":1601178,"acceptance":0.6085844297136234},{"id":704,"title":"Binary Search","slug":"binary-search","difficulty":1,"accepted":3856781,"submitted":6353573,"acceptance":0.6070255272112243},{"id":705,"title":"Design HashSet","slug":"design-hashset","difficulty":1,"accepted":570308,"submitted":839676,"acceptance":0.6792000724088815},{"id":706,"title":"Design HashMap","slug":"design-hashmap","difficulty":1,"accepted":762290,"submitted":1146342,"acceptance":0.6649760717133282},{"id":707,"title":"Design Linked List","slug":"design-linked-list","difficulty":2,"accepted":486050,"submitted":1615263,"acceptance":0.30091074951880903},{"id":708,"title":"Insert into a Sorted Circular Linked List","slug":"insert-into-a-sorted-circular-linked-list","difficulty":2,"accepted":244840,"submitted":635331,"acceptance":0.38537392319908836},{"id":709,"title":"To Lower Case","slug":"to-lower-case","difficulty":1,"accepted":729317,"submitted":860117,"acceptance":0.8479276656547888},{"id":710,"title":"Random Pick with Blacklist","slug":"random-pick-with-blacklist","difficulty":3,"accepted":52647,"submitted":151323,"acceptance":0.3479114212644476},{"id":711,"title":"Number of Distinct Islands II","slug":"number-of-distinct-islands-ii","difficulty":3,"accepted":14248,"submitted":25765,"acceptance":0.5529982534445954},{"id":712,"title":"Minimum ASCII Delete Sum for Two Strings","slug":"minimum-ascii-delete-sum-for-two-strings","difficulty":2,"accepted":274847,"submitted":387390,"acceptance":0.7094839825498851},{"id":713,"title":"Subarray Product Less Than K","slug":"subarray-product-less-than-k","difficulty":2,"accepted":604718,"submitted":1116782,"acceptance":0.5414825812020609},{"id":714,"title":"Best Time to Buy and Sell Stock with Transaction Fee","slug":"best-time-to-buy-and-sell-stock-with-transaction-fee","difficulty":2,"accepted":571102,"submitted":794944,"acceptance":0.7184179011351743},{"id":715,"title":"Range Module","slug":"range-module","difficulty":3,"accepted":93908,"submitted":209189,"acceptance":0.4489146178814374},{"id":716,"title":"Max Stack","slug":"max-stack","difficulty":3,"accepted":184513,"submitted":401590,"acceptance":0.45945616175701587},{"id":717,"title":"1-bit and 2-bit Characters","slug":"1-bit-and-2-bit-characters","difficulty":1,"accepted":269962,"submitted":544783,"acceptance":0.49554042618804184},{"id":718,"title":"Maximum Length of Repeated Subarray","slug":"maximum-length-of-repeated-subarray","difficulty":2,"accepted":363893,"submitted":709064,"acceptance":0.5132019112520168},{"id":719,"title":"Find K-th Smallest Pair Distance","slug":"find-k-th-smallest-pair-distance","difficulty":3,"accepted":211985,"submitted":456377,"acceptance":0.4644953623867986},{"id":720,"title":"Longest Word in Dictionary","slug":"longest-word-in-dictionary","difficulty":2,"accepted":191287,"submitted":350015,"acceptance":0.546510863820122},{"id":721,"title":"Accounts Merge","slug":"accounts-merge","difficulty":2,"accepted":619240,"submitted":1012992,"acceptance":0.6112980161738691},{"id":722,"title":"Remove Comments","slug":"remove-comments","difficulty":2,"accepted":85400,"submitted":213027,"acceptance":0.4008881503283621},{"id":723,"title":"Candy Crush","slug":"candy-crush","difficulty":2,"accepted":90512,"submitted":117023,"acceptance":0.7734547909385334},{"id":724,"title":"Find Pivot Index","slug":"find-pivot-index","difficulty":1,"accepted":1650956,"submitted":2644575,"acceptance":0.6242802718773338},{"id":725,"title":"Split Linked List in Parts","slug":"split-linked-list-in-parts","difficulty":2,"accepted":354821,"submitted":503216,"acceptance":0.7051067533623732},{"id":726,"title":"Number of Atoms","slug":"number-of-atoms","difficulty":3,"accepted":161570,"submitted":248264,"acceptance":0.6507991492926885},{"id":727,"title":"Minimum Window Subsequence","slug":"minimum-window-subsequence","difficulty":3,"accepted":98854,"submitted":225737,"acceptance":0.4379166906621422},{"id":728,"title":"Self Dividing Numbers","slug":"self-dividing-numbers","difficulty":1,"accepted":333657,"submitted":413391,"acceptance":0.8071220708723702},{"id":729,"title":"My Calendar I","slug":"my-calendar-i","difficulty":2,"accepted":458492,"submitted":786818,"acceptance":0.5827167146659075},{"id":730,"title":"Count Different Palindromic Subsequences","slug":"count-different-palindromic-subsequences","difficulty":3,"accepted":45320,"submitted":95090,"acceptance":0.47660111473341044},{"id":731,"title":"My Calendar II","slug":"my-calendar-ii","difficulty":2,"accepted":214195,"submitted":339874,"acceptance":0.6302188458075639},{"id":732,"title":"My Calendar III","slug":"my-calendar-iii","difficulty":3,"accepted":111606,"submitted":155868,"acceptance":0.7160289475710216},{"id":733,"title":"Flood Fill","slug":"flood-fill","difficulty":1,"accepted":1385883,"submitted":2036215,"acceptance":0.6806172236232422},{"id":734,"title":"Sentence Similarity","slug":"sentence-similarity","difficulty":1,"accepted":75637,"submitted":168771,"acceptance":0.4481634878029993},{"id":735,"title":"Asteroid Collision","slug":"asteroid-collision","difficulty":2,"accepted":1006722,"submitted":2116381,"acceptance":0.475680891106091},{"id":736,"title":"Parse Lisp Expression","slug":"parse-lisp-expression","difficulty":3,"accepted":27892,"submitted":52224,"acceptance":0.5340839460784313},{"id":737,"title":"Sentence Similarity II","slug":"sentence-similarity-ii","difficulty":2,"accepted":79020,"submitted":154312,"acceptance":0.512079423505625},{"id":738,"title":"Monotone Increasing Digits","slug":"monotone-increasing-digits","difficulty":2,"accepted":68802,"submitted":138983,"acceptance":0.4950389615996201},{"id":739,"title":"Daily Temperatures","slug":"daily-temperatures","difficulty":2,"accepted":1685933,"submitted":2459550,"acceptance":0.6854640076436747},{"id":740,"title":"Delete and Earn","slug":"delete-and-earn","difficulty":2,"accepted":446039,"submitted":780481,"acceptance":0.5714924514498111},{"id":741,"title":"Cherry Pickup","slug":"cherry-pickup","difficulty":3,"accepted":111485,"submitted":283520,"acceptance":0.3932174097065463},{"id":742,"title":"Closest Leaf in a Binary Tree","slug":"closest-leaf-in-a-binary-tree","difficulty":2,"accepted":55885,"submitted":117834,"acceptance":0.4742688867389718},{"id":743,"title":"Network Delay Time","slug":"network-delay-time","difficulty":2,"accepted":862928,"submitted":1436271,"acceptance":0.6008114067609803},{"id":744,"title":"Find Smallest Letter Greater Than Target","slug":"find-smallest-letter-greater-than-target","difficulty":1,"accepted":835784,"submitted":1415563,"acceptance":0.5904251523951954},{"id":745,"title":"Prefix and Suffix Search","slug":"prefix-and-suffix-search","difficulty":3,"accepted":110587,"submitted":270599,"acceptance":0.4086748288057236},{"id":746,"title":"Min Cost Climbing Stairs","slug":"min-cost-climbing-stairs","difficulty":1,"accepted":1733806,"submitted":2543947,"acceptance":0.6815417145089894},{"id":747,"title":"Largest Number At Least Twice of Others","slug":"largest-number-at-least-twice-of-others","difficulty":1,"accepted":338001,"submitted":646229,"acceptance":0.5230359516518138},{"id":748,"title":"Shortest Completing Word","slug":"shortest-completing-word","difficulty":1,"accepted":108964,"submitted":173075,"acceptance":0.6295767730752564},{"id":749,"title":"Contain Virus","slug":"contain-virus","difficulty":3,"accepted":18582,"submitted":33987,"acceptance":0.546738458822491},{"id":750,"title":"Number Of Corner Rectangles","slug":"number-of-corner-rectangles","difficulty":2,"accepted":40315,"submitted":59394,"acceptance":0.6787722665589117},{"id":751,"title":"IP to CIDR","slug":"ip-to-cidr","difficulty":2,"accepted":39312,"submitted":73121,"acceptance":0.537629408788173},{"id":752,"title":"Open the Lock","slug":"open-the-lock","difficulty":2,"accepted":402974,"submitted":658189,"acceptance":0.6122466343253989},{"id":753,"title":"Cracking the Safe","slug":"cracking-the-safe","difficulty":3,"accepted":71358,"submitted":122136,"acceptance":0.5842503438789546},{"id":754,"title":"Reach a Number","slug":"reach-a-number","difficulty":2,"accepted":71853,"submitted":159776,"acceptance":0.44971084518325655},{"id":755,"title":"Pour Water","slug":"pour-water","difficulty":2,"accepted":46487,"submitted":95341,"acceptance":0.48758666261104877},{"id":756,"title":"Pyramid Transition Matrix","slug":"pyramid-transition-matrix","difficulty":2,"accepted":107366,"submitted":177240,"acceptance":0.6057661927330174},{"id":757,"title":"Set Intersection Size At Least Two","slug":"set-intersection-size-at-least-two","difficulty":3,"accepted":96854,"submitted":167020,"acceptance":0.5798946233983954},{"id":758,"title":"Bold Words in String","slug":"bold-words-in-string","difficulty":2,"accepted":20835,"submitted":39668,"acceptance":0.5252344459009781},{"id":759,"title":"Employee Free Time","slug":"employee-free-time","difficulty":3,"accepted":177660,"submitted":244098,"acceptance":0.7278224319740432},{"id":760,"title":"Find Anagram Mappings","slug":"find-anagram-mappings","difficulty":1,"accepted":112171,"submitted":133576,"acceptance":0.839754147451638},{"id":761,"title":"Special Binary String","slug":"special-binary-string","difficulty":3,"accepted":97044,"submitted":122342,"acceptance":0.7932190090075363},{"id":762,"title":"Prime Number of Set Bits in Binary Representation","slug":"prime-number-of-set-bits-in-binary-representation","difficulty":1,"accepted":256512,"submitted":325771,"acceptance":0.7873997378526634},{"id":763,"title":"Partition Labels","slug":"partition-labels","difficulty":2,"accepted":791463,"submitted":967130,"acceptance":0.818362577936782},{"id":764,"title":"Largest Plus Sign","slug":"largest-plus-sign","difficulty":2,"accepted":69710,"submitted":141974,"acceptance":0.4910053953540789},{"id":765,"title":"Couples Holding Hands","slug":"couples-holding-hands","difficulty":3,"accepted":82879,"submitted":139854,"acceptance":0.5926108656170006},{"id":766,"title":"Toeplitz Matrix","slug":"toeplitz-matrix","difficulty":1,"accepted":452187,"submitted":649093,"acceptance":0.6966443945628746},{"id":767,"title":"Reorganize String","slug":"reorganize-string","difficulty":2,"accepted":593178,"submitted":1041332,"acceptance":0.5696338919768144},{"id":768,"title":"Max Chunks To Make Sorted II","slug":"max-chunks-to-make-sorted-ii","difficulty":3,"accepted":86569,"submitted":158207,"acceptance":0.5471881775142693},{"id":769,"title":"Max Chunks To Make Sorted","slug":"max-chunks-to-make-sorted","difficulty":2,"accepted":237414,"submitted":370228,"acceptance":0.6412643019976879},{"id":770,"title":"Basic Calculator IV","slug":"basic-calculator-iv","difficulty":3,"accepted":16361,"submitted":32803,"acceptance":0.4987653568271195},{"id":771,"title":"Jewels and Stones","slug":"jewels-and-stones","difficulty":1,"accepted":1367236,"submitted":1527256,"acceptance":0.8952238524517173},{"id":772,"title":"Basic Calculator III","slug":"basic-calculator-iii","difficulty":3,"accepted":155873,"submitted":292719,"acceptance":0.5325004526525439},{"id":773,"title":"Sliding Puzzle","slug":"sliding-puzzle","difficulty":3,"accepted":200035,"submitted":269028,"acceptance":0.7435471400746391},{"id":774,"title":"Minimize Max Distance to Gas Station","slug":"minimize-max-distance-to-gas-station","difficulty":3,"accepted":37456,"submitted":69435,"acceptance":0.5394397638078778},{"id":775,"title":"Global and Local Inversions","slug":"global-and-local-inversions","difficulty":2,"accepted":85829,"submitted":200750,"acceptance":0.42754171855541717},{"id":776,"title":"Split BST","slug":"split-bst","difficulty":2,"accepted":112302,"submitted":136645,"acceptance":0.8218522448680888},{"id":777,"title":"Swap Adjacent in LR String","slug":"swap-adjacent-in-lr-string","difficulty":2,"accepted":97084,"submitted":255427,"acceptance":0.3800851123804453},{"id":778,"title":"Swim in Rising Water","slug":"swim-in-rising-water","difficulty":3,"accepted":373081,"submitted":550945,"acceptance":0.6771655972919257},{"id":779,"title":"K-th Symbol in Grammar","slug":"k-th-symbol-in-grammar","difficulty":2,"accepted":257378,"submitted":534125,"acceptance":0.4818684764802247},{"id":780,"title":"Reaching Points","slug":"reaching-points","difficulty":3,"accepted":81416,"submitted":237314,"acceptance":0.3430728907691919},{"id":781,"title":"Rabbits in Forest","slug":"rabbits-in-forest","difficulty":2,"accepted":186978,"submitted":322237,"acceptance":0.5802499402613605},{"id":782,"title":"Transform to Chessboard","slug":"transform-to-chessboard","difficulty":3,"accepted":21720,"submitted":42366,"acceptance":0.5126752584619743},{"id":783,"title":"Minimum Distance Between BST Nodes","slug":"minimum-distance-between-bst-nodes","difficulty":1,"accepted":326029,"submitted":532491,"acceptance":0.6122713811125446},{"id":784,"title":"Letter Case Permutation","slug":"letter-case-permutation","difficulty":2,"accepted":371470,"submitted":490174,"acceptance":0.7578329327952931},{"id":785,"title":"Is Graph Bipartite?","slug":"is-graph-bipartite","difficulty":2,"accepted":864224,"submitted":1462333,"acceptance":0.5909898771346882},{"id":786,"title":"K-th Smallest Prime Fraction","slug":"k-th-smallest-prime-fraction","difficulty":2,"accepted":172239,"submitted":249639,"acceptance":0.6899522911083604},{"id":787,"title":"Cheapest Flights Within K Stops","slug":"cheapest-flights-within-k-stops","difficulty":2,"accepted":901788,"submitted":2168804,"acceptance":0.41579967576599824},{"id":788,"title":"Rotated Digits","slug":"rotated-digits","difficulty":2,"accepted":130051,"submitted":228800,"acceptance":0.5684047202797203},{"id":789,"title":"Escape The Ghosts","slug":"escape-the-ghosts","difficulty":2,"accepted":38488,"submitted":60538,"acceptance":0.6357659651788959},{"id":790,"title":"Domino and Tromino Tiling","slug":"domino-and-tromino-tiling","difficulty":2,"accepted":280091,"submitted":545013,"acceptance":0.5139161818158466},{"id":791,"title":"Custom Sort String","slug":"custom-sort-string","difficulty":2,"accepted":577614,"submitted":799075,"acceptance":0.7228532991271157},{"id":792,"title":"Number of Matching Subsequences","slug":"number-of-matching-subsequences","difficulty":2,"accepted":274957,"submitted":543271,"acceptance":0.5061138915936981},{"id":793,"title":"Preimage Size of Factorial Zeroes Function","slug":"preimage-size-of-factorial-zeroes-function","difficulty":3,"accepted":24388,"submitted":52024,"acceptance":0.468783638320775},{"id":794,"title":"Valid Tic-Tac-Toe State","slug":"valid-tic-tac-toe-state","difficulty":2,"accepted":67580,"submitted":194331,"acceptance":0.3477571771873762},{"id":795,"title":"Number of Subarrays with Bounded Maximum","slug":"number-of-subarrays-with-bounded-maximum","difficulty":2,"accepted":89944,"submitted":163980,"acceptance":0.5485059153555312},{"id":796,"title":"Rotate String","slug":"rotate-string","difficulty":1,"accepted":803791,"submitted":1230673,"acceptance":0.6531312541999378},{"id":797,"title":"All Paths From Source to Target","slug":"all-paths-from-source-to-target","difficulty":2,"accepted":685899,"submitted":820635,"acceptance":0.8358149481803725},{"id":798,"title":"Smallest Rotation with Highest Score","slug":"smallest-rotation-with-highest-score","difficulty":3,"accepted":18330,"submitted":34220,"acceptance":0.5356516656925775},{"id":799,"title":"Champagne Tower","slug":"champagne-tower","difficulty":2,"accepted":250110,"submitted":390069,"acceptance":0.641194250248033},{"id":800,"title":"Similar RGB Color","slug":"similar-rgb-color","difficulty":1,"accepted":18506,"submitted":27248,"acceptance":0.6791691133294186},{"id":801,"title":"Minimum Swaps To Make Sequences Increasing","slug":"minimum-swaps-to-make-sequences-increasing","difficulty":3,"accepted":98343,"submitted":237455,"acceptance":0.4141542608073109},{"id":802,"title":"Find Eventual Safe States","slug":"find-eventual-safe-states","difficulty":2,"accepted":563370,"submitted":798678,"acceptance":0.7053781373720073},{"id":803,"title":"Bricks Falling When Hit","slug":"bricks-falling-when-hit","difficulty":3,"accepted":38163,"submitted":102864,"acceptance":0.37100443303779745},{"id":804,"title":"Unique Morse Code Words","slug":"unique-morse-code-words","difficulty":1,"accepted":406990,"submitted":486975,"acceptance":0.8357513219364444},{"id":805,"title":"Split Array With Same Average","slug":"split-array-with-same-average","difficulty":3,"accepted":47239,"submitted":175435,"acceptance":0.2692678199903098},{"id":806,"title":"Number of Lines To Write String","slug":"number-of-lines-to-write-string","difficulty":1,"accepted":113394,"submitted":156780,"acceptance":0.7232682740145426},{"id":807,"title":"Max Increase to Keep City Skyline","slug":"max-increase-to-keep-city-skyline","difficulty":2,"accepted":188367,"submitted":218020,"acceptance":0.8639895422438308},{"id":808,"title":"Soup Servings","slug":"soup-servings","difficulty":2,"accepted":150589,"submitted":252380,"acceptance":0.5966756478326334},{"id":809,"title":"Expressive Words","slug":"expressive-words","difficulty":2,"accepted":135682,"submitted":290192,"acceptance":0.4675594089430446},{"id":810,"title":"Chalkboard XOR Game","slug":"chalkboard-xor-game","difficulty":3,"accepted":19374,"submitted":29293,"acceptance":0.6613866794114635},{"id":811,"title":"Subdomain Visit Count","slug":"subdomain-visit-count","difficulty":2,"accepted":262036,"submitted":339455,"acceptance":0.7719314783991987},{"id":812,"title":"Largest Triangle Area","slug":"largest-triangle-area","difficulty":1,"accepted":179118,"submitted":250379,"acceptance":0.7153874725915512},{"id":813,"title":"Largest Sum of Averages","slug":"largest-sum-of-averages","difficulty":2,"accepted":66969,"submitted":121933,"acceptance":0.5492278546414835},{"id":814,"title":"Binary Tree Pruning","slug":"binary-tree-pruning","difficulty":2,"accepted":286708,"submitted":395502,"acceptance":0.7249217450227812},{"id":815,"title":"Bus Routes","slug":"bus-routes","difficulty":3,"accepted":285866,"submitted":605385,"acceptance":0.4722052908479728},{"id":816,"title":"Ambiguous Coordinates","slug":"ambiguous-coordinates","difficulty":2,"accepted":34852,"submitted":61718,"acceptance":0.5646974950581678},{"id":817,"title":"Linked List Components","slug":"linked-list-components","difficulty":2,"accepted":124573,"submitted":215314,"acceptance":0.5785643293051079},{"id":818,"title":"Race Car","slug":"race-car","difficulty":3,"accepted":106220,"submitted":237717,"acceptance":0.44683384023860306},{"id":819,"title":"Most Common Word","slug":"most-common-word","difficulty":1,"accepted":450771,"submitted":1000308,"acceptance":0.4506322052807735},{"id":820,"title":"Short Encoding of Words","slug":"short-encoding-of-words","difficulty":2,"accepted":105840,"submitted":173953,"acceptance":0.6084402108615545},{"id":821,"title":"Shortest Distance to a Character","slug":"shortest-distance-to-a-character","difficulty":1,"accepted":240863,"submitted":331142,"acceptance":0.7273707352132922},{"id":822,"title":"Card Flipping Game","slug":"card-flipping-game","difficulty":2,"accepted":26237,"submitted":52294,"acceptance":0.5017210387424944},{"id":823,"title":"Binary Trees With Factors","slug":"binary-trees-with-factors","difficulty":2,"accepted":159623,"submitted":300770,"acceptance":0.530714499451408},{"id":824,"title":"Goat Latin","slug":"goat-latin","difficulty":1,"accepted":244798,"submitted":349946,"acceptance":0.6995307847496471},{"id":825,"title":"Friends Of Appropriate Ages","slug":"friends-of-appropriate-ages","difficulty":2,"accepted":129637,"submitted":259843,"acceptance":0.4989051080844972},{"id":826,"title":"Most Profit Assigning Work","slug":"most-profit-assigning-work","difficulty":2,"accepted":243916,"submitted":434232,"acceptance":0.561718159877669},{"id":827,"title":"Making A Large Island","slug":"making-a-large-island","difficulty":3,"accepted":419558,"submitted":743197,"acceptance":0.5645313422955152},{"id":828,"title":"Count Unique Characters of All Substrings of a Given String","slug":"count-unique-characters-of-all-substrings-of-a-given-string","difficulty":3,"accepted":83937,"submitted":156681,"acceptance":0.5357190725103873},{"id":829,"title":"Consecutive Numbers Sum","slug":"consecutive-numbers-sum","difficulty":3,"accepted":101379,"submitted":237678,"acceptance":0.42653926741221315},{"id":830,"title":"Positions of Large Groups","slug":"positions-of-large-groups","difficulty":1,"accepted":119989,"submitted":222842,"acceptance":0.5384487663905368},{"id":831,"title":"Masking Personal Information","slug":"masking-personal-information","difficulty":2,"accepted":34628,"submitted":63349,"acceptance":0.5466226775481855},{"id":832,"title":"Flipping an Image","slug":"flipping-an-image","difficulty":1,"accepted":557283,"submitted":665968,"acceptance":0.8368014679383995},{"id":833,"title":"Find And Replace in String","slug":"find-and-replace-in-string","difficulty":2,"accepted":169075,"submitted":332464,"acceptance":0.5085513017950816},{"id":834,"title":"Sum of Distances in Tree","slug":"sum-of-distances-in-tree","difficulty":3,"accepted":182945,"submitted":279108,"acceptance":0.6554631182194706},{"id":835,"title":"Image Overlap","slug":"image-overlap","difficulty":2,"accepted":105493,"submitted":164820,"acceptance":0.640049751243781},{"id":836,"title":"Rectangle Overlap","slug":"rectangle-overlap","difficulty":1,"accepted":182688,"submitted":392282,"acceptance":0.4657057932813639},{"id":837,"title":"New 21 Game","slug":"new-21-game","difficulty":2,"accepted":160864,"submitted":309515,"acceptance":0.519729253832609},{"id":838,"title":"Push Dominoes","slug":"push-dominoes","difficulty":2,"accepted":228959,"submitted":363389,"acceptance":0.6300658522960244},{"id":839,"title":"Similar String Groups","slug":"similar-string-groups","difficulty":3,"accepted":142361,"submitted":253403,"acceptance":0.5617968216635162},{"id":840,"title":"Magic Squares In Grid","slug":"magic-squares-in-grid","difficulty":2,"accepted":227535,"submitted":412769,"acceptance":0.5512405243610833},{"id":841,"title":"Keys and Rooms","slug":"keys-and-rooms","difficulty":2,"accepted":681393,"submitted":900851,"acceptance":0.7563881263383179},{"id":842,"title":"Split Array into Fibonacci Sequence","slug":"split-array-into-fibonacci-sequence","difficulty":2,"accepted":46928,"submitted":116480,"acceptance":0.4028846153846154},{"id":843,"title":"Guess the Word","slug":"guess-the-word","difficulty":3,"accepted":169183,"submitted":459374,"acceptance":0.3682903255299603},{"id":844,"title":"Backspace String Compare","slug":"backspace-string-compare","difficulty":1,"accepted":1043662,"submitted":2093855,"acceptance":0.49844043641990493},{"id":845,"title":"Longest Mountain in Array","slug":"longest-mountain-in-array","difficulty":2,"accepted":198715,"submitted":472906,"acceptance":0.4201997860039839},{"id":846,"title":"Hand of Straights","slug":"hand-of-straights","difficulty":2,"accepted":446354,"submitted":771017,"acceptance":0.5789158993900264},{"id":847,"title":"Shortest Path Visiting All Nodes","slug":"shortest-path-visiting-all-nodes","difficulty":3,"accepted":150191,"submitted":228045,"acceptance":0.6586024688109803},{"id":848,"title":"Shifting Letters","slug":"shifting-letters","difficulty":2,"accepted":135855,"submitted":294289,"acceptance":0.46163804967226096},{"id":849,"title":"Maximize Distance to Closest Person","slug":"maximize-distance-to-closest-person","difficulty":2,"accepted":284226,"submitted":571830,"acceptance":0.4970463249567179},{"id":850,"title":"Rectangle Area II","slug":"rectangle-area-ii","difficulty":3,"accepted":43951,"submitted":78393,"acceptance":0.5606495477912569},{"id":851,"title":"Loud and Rich","slug":"loud-and-rich","difficulty":2,"accepted":77162,"submitted":121816,"acceptance":0.6334307480133973},{"id":852,"title":"Peak Index in a Mountain Array","slug":"peak-index-in-a-mountain-array","difficulty":2,"accepted":1188423,"submitted":1777096,"acceptance":0.668744400977775},{"id":853,"title":"Car Fleet","slug":"car-fleet","difficulty":2,"accepted":481004,"submitted":875415,"acceptance":0.5494582569409937},{"id":854,"title":"K-Similar Strings","slug":"k-similar-strings","difficulty":3,"accepted":54537,"submitted":133648,"acceptance":0.40806446785586015},{"id":855,"title":"Exam Room","slug":"exam-room","difficulty":2,"accepted":74921,"submitted":172829,"acceptance":0.43349785047648254},{"id":856,"title":"Score of Parentheses","slug":"score-of-parentheses","difficulty":2,"accepted":221896,"submitted":348831,"acceptance":0.6361131894814395},{"id":857,"title":"Minimum Cost to Hire K Workers","slug":"minimum-cost-to-hire-k-workers","difficulty":3,"accepted":159473,"submitted":250617,"acceptance":0.6363215583938839},{"id":858,"title":"Mirror Reflection","slug":"mirror-reflection","difficulty":2,"accepted":88664,"submitted":143231,"acceptance":0.6190280037142797},{"id":859,"title":"Buddy Strings","slug":"buddy-strings","difficulty":1,"accepted":294084,"submitted":865538,"acceptance":0.3397701776236283},{"id":860,"title":"Lemonade Change","slug":"lemonade-change","difficulty":1,"accepted":578989,"submitted":981026,"acceptance":0.590187212163592},{"id":861,"title":"Score After Flipping Matrix","slug":"score-after-flipping-matrix","difficulty":2,"accepted":167620,"submitted":208810,"acceptance":0.8027393324074518},{"id":862,"title":"Shortest Subarray with Sum at Least K","slug":"shortest-subarray-with-sum-at-least-k","difficulty":3,"accepted":210175,"submitted":642748,"acceptance":0.3269944052723618},{"id":863,"title":"All Nodes Distance K in Binary Tree","slug":"all-nodes-distance-k-in-binary-tree","difficulty":2,"accepted":687946,"submitted":1018304,"acceptance":0.6755801803783545},{"id":864,"title":"Shortest Path to Get All Keys","slug":"shortest-path-to-get-all-keys","difficulty":3,"accepted":95147,"submitted":174644,"acceptance":0.5448054327660842},{"id":865,"title":"Smallest Subtree with all the Deepest Nodes","slug":"smallest-subtree-with-all-the-deepest-nodes","difficulty":2,"accepted":271443,"submitted":349993,"acceptance":0.7755669399102267},{"id":866,"title":"Prime Palindrome","slug":"prime-palindrome","difficulty":2,"accepted":49498,"submitted":176463,"acceptance":0.28050072819797917},{"id":867,"title":"Transpose Matrix","slug":"transpose-matrix","difficulty":1,"accepted":595168,"submitted":781414,"acceptance":0.7616551533502087},{"id":868,"title":"Binary Gap","slug":"binary-gap","difficulty":1,"accepted":213881,"submitted":288091,"acceptance":0.7424077808747931},{"id":869,"title":"Reordered Power of 2","slug":"reordered-power-of-2","difficulty":2,"accepted":229227,"submitted":347599,"acceptance":0.6594581687519239},{"id":870,"title":"Advantage Shuffle","slug":"advantage-shuffle","difficulty":2,"accepted":81632,"submitted":150071,"acceptance":0.5439558608925109},{"id":871,"title":"Minimum Number of Refueling Stops","slug":"minimum-number-of-refueling-stops","difficulty":3,"accepted":164927,"submitted":399776,"acceptance":0.4125485271752181},{"id":872,"title":"Leaf-Similar Trees","slug":"leaf-similar-trees","difficulty":1,"accepted":677553,"submitted":965215,"acceptance":0.7019710634418238},{"id":873,"title":"Length of Longest Fibonacci Subsequence","slug":"length-of-longest-fibonacci-subsequence","difficulty":2,"accepted":192265,"submitted":334194,"acceptance":0.5753095507399894},{"id":874,"title":"Walking Robot Simulation","slug":"walking-robot-simulation","difficulty":2,"accepted":252078,"submitted":390785,"acceptance":0.6450554652814208},{"id":875,"title":"Koko Eating Bananas","slug":"koko-eating-bananas","difficulty":2,"accepted":1546976,"submitted":3102263,"acceptance":0.4986604939684353},{"id":876,"title":"Middle of the Linked List","slug":"middle-of-the-linked-list","difficulty":1,"accepted":2986227,"submitted":3654491,"acceptance":0.8171389668219186},{"id":877,"title":"Stone Game","slug":"stone-game","difficulty":2,"accepted":334223,"submitted":457063,"acceptance":0.7312405510837674},{"id":878,"title":"Nth Magical Number","slug":"nth-magical-number","difficulty":3,"accepted":50574,"submitted":138317,"acceptance":0.36563835248017235},{"id":879,"title":"Profitable Schemes","slug":"profitable-schemes","difficulty":3,"accepted":78479,"submitted":162560,"acceptance":0.482769438976378},{"id":880,"title":"Decoded String at Index","slug":"decoded-string-at-index","difficulty":2,"accepted":108014,"submitted":289846,"acceptance":0.37265996425688125},{"id":881,"title":"Boats to Save People","slug":"boats-to-save-people","difficulty":2,"accepted":562316,"submitted":912660,"acceptance":0.6161286788070037},{"id":882,"title":"Reachable Nodes In Subdivided Graph","slug":"reachable-nodes-in-subdivided-graph","difficulty":3,"accepted":37363,"submitted":71891,"acceptance":0.519717349876897},{"id":883,"title":"Projection Area of 3D Shapes","slug":"projection-area-of-3d-shapes","difficulty":1,"accepted":76027,"submitted":100288,"acceptance":0.7580867102744097},{"id":884,"title":"Uncommon Words from Two Sentences","slug":"uncommon-words-from-two-sentences","difficulty":1,"accepted":338514,"submitted":447576,"acceptance":0.7563274170196793},{"id":885,"title":"Spiral Matrix III","slug":"spiral-matrix-iii","difficulty":2,"accepted":175648,"submitted":207780,"acceptance":0.8453556646452979},{"id":886,"title":"Possible Bipartition","slug":"possible-bipartition","difficulty":2,"accepted":265003,"submitted":504628,"acceptance":0.5251452555149536},{"id":887,"title":"Super Egg Drop","slug":"super-egg-drop","difficulty":3,"accepted":99273,"submitted":330384,"acceptance":0.3004776260351591},{"id":888,"title":"Fair Candy Swap","slug":"fair-candy-swap","difficulty":1,"accepted":170332,"submitted":262974,"acceptance":0.647714222698822},{"id":889,"title":"Construct Binary Tree from Preorder and Postorder Traversal","slug":"construct-binary-tree-from-preorder-and-postorder-traversal","difficulty":2,"accepted":219275,"submitted":280940,"acceptance":0.7805047341069268},{"id":890,"title":"Find and Replace Pattern","slug":"find-and-replace-pattern","difficulty":2,"accepted":214527,"submitted":278572,"acceptance":0.7700953433941674},{"id":891,"title":"Sum of Subsequence Widths","slug":"sum-of-subsequence-widths","difficulty":3,"accepted":26598,"submitted":65759,"acceptance":0.4044769537249654},{"id":892,"title":"Surface Area of 3D Shapes","slug":"surface-area-of-3d-shapes","difficulty":1,"accepted":56695,"submitted":80298,"acceptance":0.7060574360507111},{"id":893,"title":"Groups of Special-Equivalent Strings","slug":"groups-of-special-equivalent-strings","difficulty":2,"accepted":59096,"submitted":80383,"acceptance":0.7351803241979026},{"id":894,"title":"All Possible Full Binary Trees","slug":"all-possible-full-binary-trees","difficulty":2,"accepted":213902,"submitted":258482,"acceptance":0.8275315108982444},{"id":895,"title":"Maximum Frequency Stack","slug":"maximum-frequency-stack","difficulty":3,"accepted":225984,"submitted":338572,"acceptance":0.6674621646208192},{"id":896,"title":"Monotonic Array","slug":"monotonic-array","difficulty":1,"accepted":576189,"submitted":925307,"acceptance":0.622700357827186},{"id":897,"title":"Increasing Order Search Tree","slug":"increasing-order-search-tree","difficulty":1,"accepted":337671,"submitted":427670,"acceptance":0.7895597072509177},{"id":898,"title":"Bitwise ORs of Subarrays","slug":"bitwise-ors-of-subarrays","difficulty":2,"accepted":134003,"submitted":235853,"acceptance":0.5681632203109565},{"id":899,"title":"Orderly Queue","slug":"orderly-queue","difficulty":3,"accepted":84298,"submitted":126021,"acceptance":0.6689202593218591},{"id":900,"title":"RLE Iterator","slug":"rle-iterator","difficulty":2,"accepted":88733,"submitted":149684,"acceptance":0.592802169904599},{"id":901,"title":"Online Stock Span","slug":"online-stock-span","difficulty":2,"accepted":593118,"submitted":860828,"acceptance":0.6890087218352563},{"id":902,"title":"Numbers At Most N Given Digit Set","slug":"numbers-at-most-n-given-digit-set","difficulty":3,"accepted":54641,"submitted":121787,"acceptance":0.44866036604892146},{"id":903,"title":"Valid Permutations for DI Sequence","slug":"valid-permutations-for-di-sequence","difficulty":3,"accepted":20653,"submitted":36726,"acceptance":0.562353645918423},{"id":904,"title":"Fruit Into Baskets","slug":"fruit-into-baskets","difficulty":2,"accepted":815608,"submitted":1604085,"acceptance":0.5084568461147633},{"id":905,"title":"Sort Array By Parity","slug":"sort-array-by-parity","difficulty":1,"accepted":1013508,"submitted":1324931,"acceptance":0.7649515333251317},{"id":906,"title":"Super Palindromes","slug":"super-palindromes","difficulty":3,"accepted":28615,"submitted":71682,"acceptance":0.39919366089115815},{"id":907,"title":"Sum of Subarray Minimums","slug":"sum-of-subarray-minimums","difficulty":2,"accepted":440707,"submitted":1147211,"acceptance":0.38415513798246353},{"id":908,"title":"Smallest Range I","slug":"smallest-range-i","difficulty":1,"accepted":124514,"submitted":169599,"acceptance":0.7341670646642964},{"id":909,"title":"Snakes and Ladders","slug":"snakes-and-ladders","difficulty":2,"accepted":361899,"submitted":753347,"acceptance":0.4803881876479232},{"id":910,"title":"Smallest Range II","slug":"smallest-range-ii","difficulty":2,"accepted":65929,"submitted":174254,"acceptance":0.3783499948351257},{"id":911,"title":"Online Election","slug":"online-election","difficulty":2,"accepted":78123,"submitted":148054,"acceptance":0.5276655814770287},{"id":912,"title":"Sort an Array","slug":"sort-an-array","difficulty":2,"accepted":1111422,"submitted":1988204,"acceptance":0.5590080293571484},{"id":913,"title":"Cat and Mouse","slug":"cat-and-mouse","difficulty":3,"accepted":27144,"submitted":77450,"acceptance":0.3504712717882505},{"id":914,"title":"X of a Kind in a Deck of Cards","slug":"x-of-a-kind-in-a-deck-of-cards","difficulty":1,"accepted":157359,"submitted":521072,"acceptance":0.30199089569195814},{"id":915,"title":"Partition Array into Disjoint Intervals","slug":"partition-array-into-disjoint-intervals","difficulty":2,"accepted":97859,"submitted":198043,"acceptance":0.494130062663159},{"id":916,"title":"Word Subsets","slug":"word-subsets","difficulty":2,"accepted":265575,"submitted":475001,"acceptance":0.5591040860966608},{"id":917,"title":"Reverse Only Letters","slug":"reverse-only-letters","difficulty":1,"accepted":325260,"submitted":476031,"acceptance":0.6832748287401451},{"id":918,"title":"Maximum Sum Circular Subarray","slug":"maximum-sum-circular-subarray","difficulty":2,"accepted":413615,"submitted":830123,"acceptance":0.4982574871434715},{"id":919,"title":"Complete Binary Tree Inserter","slug":"complete-binary-tree-inserter","difficulty":2,"accepted":66537,"submitted":102308,"acceptance":0.6503596981663213},{"id":920,"title":"Number of Music Playlists","slug":"number-of-music-playlists","difficulty":3,"accepted":79087,"submitted":131762,"acceptance":0.600226165358753},{"id":921,"title":"Minimum Add to Make Parentheses Valid","slug":"minimum-add-to-make-parentheses-valid","difficulty":2,"accepted":698777,"submitted":939186,"acceptance":0.7440240804270932},{"id":922,"title":"Sort Array By Parity II","slug":"sort-array-by-parity-ii","difficulty":1,"accepted":344416,"submitted":483373,"acceptance":0.7125263512856531},{"id":923,"title":"3Sum With Multiplicity","slug":"3sum-with-multiplicity","difficulty":2,"accepted":121026,"submitted":261677,"acceptance":0.462501480833241},{"id":924,"title":"Minimize Malware Spread","slug":"minimize-malware-spread","difficulty":3,"accepted":73921,"submitted":171662,"acceptance":0.4306194731507264},{"id":925,"title":"Long Pressed Name","slug":"long-pressed-name","difficulty":1,"accepted":191929,"submitted":584433,"acceptance":0.3284020580631142},{"id":926,"title":"Flip String to Monotone Increasing","slug":"flip-string-to-monotone-increasing","difficulty":2,"accepted":216816,"submitted":350438,"acceptance":0.6187000268235751},{"id":927,"title":"Three Equal Parts","slug":"three-equal-parts","difficulty":3,"accepted":35092,"submitted":84929,"acceptance":0.4131921958341674},{"id":928,"title":"Minimize Malware Spread II","slug":"minimize-malware-spread-ii","difficulty":3,"accepted":30314,"submitted":66497,"acceptance":0.455870189632615},{"id":929,"title":"Unique Email Addresses","slug":"unique-email-addresses","difficulty":1,"accepted":577439,"submitted":851287,"acceptance":0.6783129543855363},{"id":930,"title":"Binary Subarrays With Sum","slug":"binary-subarrays-with-sum","difficulty":2,"accepted":510517,"submitted":744298,"acceptance":0.6859040330620262},{"id":931,"title":"Minimum Falling Path Sum","slug":"minimum-falling-path-sum","difficulty":2,"accepted":655258,"submitted":1077621,"acceptance":0.6080597909654694},{"id":932,"title":"Beautiful Array","slug":"beautiful-array","difficulty":2,"accepted":60422,"submitted":87550,"acceptance":0.6901427755568247},{"id":933,"title":"Number of Recent Calls","slug":"number-of-recent-calls","difficulty":1,"accepted":518026,"submitted":661372,"acceptance":0.783259648125412},{"id":934,"title":"Shortest Bridge","slug":"shortest-bridge","difficulty":2,"accepted":274978,"submitted":463289,"acceptance":0.5935344892712756},{"id":935,"title":"Knight Dialer","slug":"knight-dialer","difficulty":2,"accepted":200643,"submitted":324565,"acceptance":0.6181905011322848},{"id":936,"title":"Stamping The Sequence","slug":"stamping-the-sequence","difficulty":3,"accepted":64497,"submitted":103608,"acceptance":0.6225098447996293},{"id":937,"title":"Reorder Data in Log Files","slug":"reorder-data-in-log-files","difficulty":2,"accepted":410934,"submitted":722859,"acceptance":0.5684843102181754},{"id":938,"title":"Range Sum of BST","slug":"range-sum-of-bst","difficulty":1,"accepted":1343524,"submitted":1533965,"acceptance":0.8758504920255678},{"id":939,"title":"Minimum Area Rectangle","slug":"minimum-area-rectangle","difficulty":2,"accepted":178622,"submitted":322615,"acceptance":0.5536692342265549},{"id":940,"title":"Distinct Subsequences II","slug":"distinct-subsequences-ii","difficulty":3,"accepted":51553,"submitted":116880,"acceptance":0.4410763175906913},{"id":941,"title":"Valid Mountain Array","slug":"valid-mountain-array","difficulty":1,"accepted":559897,"submitted":1593220,"acceptance":0.35142478753718887},{"id":942,"title":"DI String Match","slug":"di-string-match","difficulty":1,"accepted":207854,"submitted":256680,"acceptance":0.8097787127941406},{"id":943,"title":"Find the Shortest Superstring","slug":"find-the-shortest-superstring","difficulty":3,"accepted":35557,"submitted":78587,"acceptance":0.4524539682135722},{"id":944,"title":"Delete Columns to Make Sorted","slug":"delete-columns-to-make-sorted","difficulty":1,"accepted":320214,"submitted":410128,"acceptance":0.7807660047594898},{"id":945,"title":"Minimum Increment to Make Array Unique","slug":"minimum-increment-to-make-array-unique","difficulty":2,"accepted":269767,"submitted":444979,"acceptance":0.6062465869175849},{"id":946,"title":"Validate Stack Sequences","slug":"validate-stack-sequences","difficulty":2,"accepted":371314,"submitted":528238,"acceptance":0.7029293613863448},{"id":947,"title":"Most Stones Removed with Same Row or Column","slug":"most-stones-removed-with-same-row-or-column","difficulty":2,"accepted":400099,"submitted":636636,"acceptance":0.628458019967454},{"id":948,"title":"Bag of Tokens","slug":"bag-of-tokens","difficulty":2,"accepted":266116,"submitted":446803,"acceptance":0.5956002981179626},{"id":949,"title":"Largest Time for Given Digits","slug":"largest-time-for-given-digits","difficulty":2,"accepted":103274,"submitted":287846,"acceptance":0.3587821265537822},{"id":950,"title":"Reveal Cards In Increasing Order","slug":"reveal-cards-in-increasing-order","difficulty":2,"accepted":235413,"submitted":281879,"acceptance":0.8351562195126278},{"id":951,"title":"Flip Equivalent Binary Trees","slug":"flip-equivalent-binary-trees","difficulty":2,"accepted":268643,"submitted":386373,"acceptance":0.6952944434523116},{"id":952,"title":"Largest Component Size by Common Factor","slug":"largest-component-size-by-common-factor","difficulty":3,"accepted":66942,"submitted":156535,"acceptance":0.4276487686459897},{"id":953,"title":"Verifying an Alien Dictionary","slug":"verifying-an-alien-dictionary","difficulty":1,"accepted":581580,"submitted":1040168,"acceptance":0.5591212188800271},{"id":954,"title":"Array of Doubled Pairs","slug":"array-of-doubled-pairs","difficulty":2,"accepted":104772,"submitted":263574,"acceptance":0.39750506499123583},{"id":955,"title":"Delete Columns to Make Sorted II","slug":"delete-columns-to-make-sorted-ii","difficulty":2,"accepted":89281,"submitted":179770,"acceptance":0.49664015130444455},{"id":956,"title":"Tallest Billboard","slug":"tallest-billboard","difficulty":3,"accepted":70746,"submitted":136555,"acceptance":0.5180769653253268},{"id":957,"title":"Prison Cells After N Days","slug":"prison-cells-after-n-days","difficulty":2,"accepted":176389,"submitted":450504,"acceptance":0.3915370340773889},{"id":958,"title":"Check Completeness of a Binary Tree","slug":"check-completeness-of-a-binary-tree","difficulty":2,"accepted":319238,"submitted":540315,"acceptance":0.5908368266659264},{"id":959,"title":"Regions Cut By Slashes","slug":"regions-cut-by-slashes","difficulty":2,"accepted":150664,"submitted":194354,"acceptance":0.7752040091791268},{"id":960,"title":"Delete Columns to Make Sorted III","slug":"delete-columns-to-make-sorted-iii","difficulty":3,"accepted":73551,"submitted":101283,"acceptance":0.7261929445217855},{"id":961,"title":"N-Repeated Element in Size 2N Array","slug":"n-repeated-element-in-size-2n-array","difficulty":1,"accepted":469334,"submitted":587666,"acceptance":0.7986407244931645},{"id":962,"title":"Maximum Width Ramp","slug":"maximum-width-ramp","difficulty":2,"accepted":206882,"submitted":370295,"acceptance":0.5586950944517209},{"id":963,"title":"Minimum Area Rectangle II","slug":"minimum-area-rectangle-ii","difficulty":2,"accepted":36080,"submitted":64560,"acceptance":0.5588599752168525},{"id":964,"title":"Least Operators to Express Number","slug":"least-operators-to-express-number","difficulty":3,"accepted":12687,"submitted":26151,"acceptance":0.4851439715498451},{"id":965,"title":"Univalued Binary Tree","slug":"univalued-binary-tree","difficulty":1,"accepted":274756,"submitted":376566,"acceptance":0.7296357079502663},{"id":966,"title":"Vowel Spellchecker","slug":"vowel-spellchecker","difficulty":2,"accepted":140663,"submitted":229067,"acceptance":0.6140692461157653},{"id":967,"title":"Numbers With Same Consecutive Differences","slug":"numbers-with-same-consecutive-differences","difficulty":2,"accepted":156343,"submitted":264323,"acceptance":0.5914846608127178},{"id":968,"title":"Binary Tree Cameras","slug":"binary-tree-cameras","difficulty":3,"accepted":186155,"submitted":389516,"acceptance":0.47791361587200526},{"id":969,"title":"Pancake Sorting","slug":"pancake-sorting","difficulty":2,"accepted":113980,"submitted":158900,"acceptance":0.7173064820641913},{"id":970,"title":"Powerful Integers","slug":"powerful-integers","difficulty":2,"accepted":63989,"submitted":143590,"acceptance":0.4456368827912807},{"id":971,"title":"Flip Binary Tree To Match Preorder Traversal","slug":"flip-binary-tree-to-match-preorder-traversal","difficulty":2,"accepted":49447,"submitted":95332,"acceptance":0.518682079469643},{"id":972,"title":"Equal Rational Numbers","slug":"equal-rational-numbers","difficulty":3,"accepted":9961,"submitted":21621,"acceptance":0.4607094953979927},{"id":973,"title":"K Closest Points to Origin","slug":"k-closest-points-to-origin","difficulty":2,"accepted":1714987,"submitted":2489911,"acceptance":0.6887744180414481},{"id":974,"title":"Subarray Sums Divisible by K","slug":"subarray-sums-divisible-by-k","difficulty":2,"accepted":483658,"submitted":860929,"acceptance":0.5617861635512336},{"id":975,"title":"Odd Even Jump","slug":"odd-even-jump","difficulty":3,"accepted":103755,"submitted":252101,"acceptance":0.4115612393445484},{"id":976,"title":"Largest Perimeter Triangle","slug":"largest-perimeter-triangle","difficulty":1,"accepted":426551,"submitted":687120,"acceptance":0.6207809407381535},{"id":977,"title":"Squares of a Sorted Array","slug":"squares-of-a-sorted-array","difficulty":1,"accepted":2600668,"submitted":3529737,"acceptance":0.7367880383156026},{"id":978,"title":"Longest Turbulent Subarray","slug":"longest-turbulent-subarray","difficulty":2,"accepted":138631,"submitted":282747,"acceptance":0.4903005160090116},{"id":979,"title":"Distribute Coins in Binary Tree","slug":"distribute-coins-in-binary-tree","difficulty":2,"accepted":225840,"submitted":292214,"acceptance":0.7728582477225595},{"id":980,"title":"Unique Paths III","slug":"unique-paths-iii","difficulty":3,"accepted":258213,"submitted":311827,"acceptance":0.8280649206130323},{"id":981,"title":"Time Based Key-Value Store","slug":"time-based-key-value-store","difficulty":2,"accepted":726609,"submitted":1458130,"acceptance":0.4983156508678924},{"id":982,"title":"Triples with Bitwise AND Equal To Zero","slug":"triples-with-bitwise-and-equal-to-zero","difficulty":3,"accepted":24662,"submitted":41065,"acceptance":0.6005600876658955},{"id":983,"title":"Minimum Cost For Tickets","slug":"minimum-cost-for-tickets","difficulty":2,"accepted":470325,"submitted":697625,"acceptance":0.6741802544346891},{"id":984,"title":"String Without AAA or BBB","slug":"string-without-aaa-or-bbb","difficulty":2,"accepted":60842,"submitted":134875,"acceptance":0.4510991658943466},{"id":985,"title":"Sum of Even Numbers After Queries","slug":"sum-of-even-numbers-after-queries","difficulty":2,"accepted":155497,"submitted":225995,"acceptance":0.6880550454656077},{"id":986,"title":"Interval List Intersections","slug":"interval-list-intersections","difficulty":2,"accepted":568011,"submitted":778239,"acceptance":0.7298670459845883},{"id":987,"title":"Vertical Order Traversal of a Binary Tree","slug":"vertical-order-traversal-of-a-binary-tree","difficulty":3,"accepted":709682,"submitted":1326109,"acceptance":0.5351611368296272},{"id":988,"title":"Smallest String Starting From Leaf","slug":"smallest-string-starting-from-leaf","difficulty":2,"accepted":221557,"submitted":362062,"acceptance":0.6119311057222244},{"id":989,"title":"Add to Array-Form of Integer","slug":"add-to-array-form-of-integer","difficulty":1,"accepted":338776,"submitted":745119,"acceptance":0.45466026232051526},{"id":990,"title":"Satisfiability of Equality Equations","slug":"satisfiability-of-equality-equations","difficulty":2,"accepted":166912,"submitted":322913,"acceptance":0.5168946434488546},{"id":991,"title":"Broken Calculator","slug":"broken-calculator","difficulty":2,"accepted":122474,"submitted":218746,"acceptance":0.5598913808709645},{"id":992,"title":"Subarrays with K Different Integers","slug":"subarrays-with-k-different-integers","difficulty":3,"accepted":392220,"submitted":577622,"acceptance":0.6790253833822119},{"id":993,"title":"Cousins in Binary Tree","slug":"cousins-in-binary-tree","difficulty":1,"accepted":349176,"submitted":589798,"acceptance":0.5920264226057057},{"id":994,"title":"Rotting Oranges","slug":"rotting-oranges","difficulty":2,"accepted":1616470,"submitted":2766449,"acceptance":0.5843122356493831},{"id":995,"title":"Minimum Number of K Consecutive Bit Flips","slug":"minimum-number-of-k-consecutive-bit-flips","difficulty":3,"accepted":142917,"submitted":229357,"acceptance":0.6231202884586038},{"id":996,"title":"Number of Squareful Arrays","slug":"number-of-squareful-arrays","difficulty":3,"accepted":50020,"submitted":97430,"acceptance":0.5133942317561326},{"id":997,"title":"Find the Town Judge","slug":"find-the-town-judge","difficulty":1,"accepted":746330,"submitted":1474149,"acceptance":0.5062785376512143},{"id":998,"title":"Maximum Binary Tree II","slug":"maximum-binary-tree-ii","difficulty":2,"accepted":45458,"submitted":64551,"acceptance":0.7042183699710307},{"id":999,"title":"Available Captures for Rook","slug":"available-captures-for-rook","difficulty":1,"accepted":89509,"submitted":124948,"acceptance":0.7163700099241285},{"id":1000,"title":"Minimum Cost to Merge Stones","slug":"minimum-cost-to-merge-stones","difficulty":3,"accepted":51862,"submitted":112959,"acceptance":0.4591223364229499},{"id":1001,"title":"Grid Illumination","slug":"grid-illumination","difficulty":3,"accepted":27145,"submitted":69247,"acceptance":0.39200254162635206},{"id":1002,"title":"Find Common Characters","slug":"find-common-characters","difficulty":1,"accepted":429844,"submitted":575661,"acceptance":0.7466964063919563},{"id":1003,"title":"Check If Word Is Valid After Substitutions","slug":"check-if-word-is-valid-after-substitutions","difficulty":2,"accepted":85132,"submitted":139270,"acceptance":0.6112730667049616},{"id":1004,"title":"Max Consecutive Ones III","slug":"max-consecutive-ones-iii","difficulty":2,"accepted":1371638,"submitted":2031236,"acceptance":0.6752725926480232},{"id":1005,"title":"Maximize Sum Of Array After K Negations","slug":"maximize-sum-of-array-after-k-negations","difficulty":1,"accepted":138514,"submitted":257998,"acceptance":0.5368801308537275},{"id":1006,"title":"Clumsy Factorial","slug":"clumsy-factorial","difficulty":2,"accepted":48268,"submitted":78837,"acceptance":0.6122505929956746},{"id":1007,"title":"Minimum Domino Rotations For Equal Row","slug":"minimum-domino-rotations-for-equal-row","difficulty":2,"accepted":319471,"submitted":565608,"acceptance":0.5648275837682636},{"id":1008,"title":"Construct Binary Search Tree from Preorder Traversal","slug":"construct-binary-search-tree-from-preorder-traversal","difficulty":2,"accepted":541463,"submitted":643214,"acceptance":0.8418084805368042},{"id":1009,"title":"Complement of Base 10 Integer","slug":"complement-of-base-10-integer","difficulty":1,"accepted":441998,"submitted":697630,"acceptance":0.6335708040078551},{"id":1010,"title":"Pairs of Songs With Total Durations Divisible by 60","slug":"pairs-of-songs-with-total-durations-divisible-by-60","difficulty":2,"accepted":326038,"submitted":610139,"acceptance":0.534366759049987},{"id":1011,"title":"Capacity To Ship Packages Within D Days","slug":"capacity-to-ship-packages-within-d-days","difficulty":2,"accepted":756815,"submitted":1026433,"acceptance":0.7373252808512587},{"id":1012,"title":"Numbers With Repeated Digits","slug":"numbers-with-repeated-digits","difficulty":3,"accepted":25128,"submitted":54373,"acceptance":0.46214113622570024},{"id":1013,"title":"Partition Array Into Three Parts With Equal Sum","slug":"partition-array-into-three-parts-with-equal-sum","difficulty":1,"accepted":124400,"submitted":291797,"acceptance":0.42632377988807285},{"id":1014,"title":"Best Sightseeing Pair","slug":"best-sightseeing-pair","difficulty":2,"accepted":218730,"submitted":349204,"acceptance":0.6263673955624792},{"id":1015,"title":"Smallest Integer Divisible by K","slug":"smallest-integer-divisible-by-k","difficulty":2,"accepted":187250,"submitted":344470,"acceptance":0.5435887014834383},{"id":1016,"title":"Binary String With Substrings Representing 1 To N","slug":"binary-string-with-substrings-representing-1-to-n","difficulty":2,"accepted":49337,"submitted":84367,"acceptance":0.5847902615951734},{"id":1017,"title":"Convert to Base -2","slug":"convert-to-base-2","difficulty":2,"accepted":37407,"submitted":60488,"acceptance":0.6184201825155403},{"id":1018,"title":"Binary Prefix Divisible By 5","slug":"binary-prefix-divisible-by-5","difficulty":1,"accepted":182404,"submitted":340689,"acceptance":0.5353973858856611},{"id":1019,"title":"Next Greater Node In Linked List","slug":"next-greater-node-in-linked-list","difficulty":2,"accepted":222877,"submitted":347734,"acceptance":0.6409410641467328},{"id":1020,"title":"Number of Enclaves","slug":"number-of-enclaves","difficulty":2,"accepted":410376,"submitted":572933,"acceptance":0.7162722342752119},{"id":1021,"title":"Remove Outermost Parentheses","slug":"remove-outermost-parentheses","difficulty":1,"accepted":658163,"submitted":756667,"acceptance":0.8698185595512954},{"id":1022,"title":"Sum of Root To Leaf Binary Numbers","slug":"sum-of-root-to-leaf-binary-numbers","difficulty":1,"accepted":359497,"submitted":469202,"acceptance":0.766188123665287},{"id":1023,"title":"Camelcase Matching","slug":"camelcase-matching","difficulty":2,"accepted":64776,"submitted":99362,"acceptance":0.6519192447817073},{"id":1024,"title":"Video Stitching","slug":"video-stitching","difficulty":2,"accepted":88091,"submitted":167473,"acceptance":0.5260012061645758},{"id":1025,"title":"Divisor Game","slug":"divisor-game","difficulty":1,"accepted":378834,"submitted":528207,"acceptance":0.717207458439589},{"id":1026,"title":"Maximum Difference Between Node and Ancestor","slug":"maximum-difference-between-node-and-ancestor","difficulty":2,"accepted":383369,"submitted":490618,"acceptance":0.7814001932256868},{"id":1027,"title":"Longest Arithmetic Subsequence","slug":"longest-arithmetic-subsequence","difficulty":2,"accepted":212001,"submitted":424619,"acceptance":0.4992734663309932},{"id":1028,"title":"Recover a Tree From Preorder Traversal","slug":"recover-a-tree-from-preorder-traversal","difficulty":3,"accepted":165418,"submitted":198799,"acceptance":0.8320866805165016},{"id":1029,"title":"Two City Scheduling","slug":"two-city-scheduling","difficulty":2,"accepted":286291,"submitted":418233,"acceptance":0.6845251331195769},{"id":1030,"title":"Matrix Cells in Distance Order","slug":"matrix-cells-in-distance-order","difficulty":1,"accepted":78660,"submitted":106250,"acceptance":0.7403294117647059},{"id":1031,"title":"Maximum Sum of Two Non-Overlapping Subarrays","slug":"maximum-sum-of-two-non-overlapping-subarrays","difficulty":2,"accepted":84796,"submitted":139419,"acceptance":0.6082097848930204},{"id":1032,"title":"Stream of Characters","slug":"stream-of-characters","difficulty":3,"accepted":107965,"submitted":207137,"acceptance":0.5212250829161377},{"id":1033,"title":"Moving Stones Until Consecutive","slug":"moving-stones-until-consecutive","difficulty":2,"accepted":34377,"submitted":65815,"acceptance":0.5223277368381068},{"id":1034,"title":"Coloring A Border","slug":"coloring-a-border","difficulty":2,"accepted":50759,"submitted":99176,"acceptance":0.5118072920867952},{"id":1035,"title":"Uncrossed Lines","slug":"uncrossed-lines","difficulty":2,"accepted":194905,"submitted":299183,"acceptance":0.651457469174385},{"id":1036,"title":"Escape a Large Maze","slug":"escape-a-large-maze","difficulty":3,"accepted":28548,"submitted":78187,"acceptance":0.36512463708800696},{"id":1037,"title":"Valid Boomerang","slug":"valid-boomerang","difficulty":1,"accepted":75483,"submitted":191793,"acceptance":0.3935649371979165},{"id":1038,"title":"Binary Search Tree to Greater Sum Tree","slug":"binary-search-tree-to-greater-sum-tree","difficulty":2,"accepted":342208,"submitted":387276,"acceptance":0.8836282134704965},{"id":1039,"title":"Minimum Score Triangulation of Polygon","slug":"minimum-score-triangulation-of-polygon","difficulty":2,"accepted":140856,"submitted":208940,"acceptance":0.6741456877572509},{"id":1040,"title":"Moving Stones Until Consecutive II","slug":"moving-stones-until-consecutive-ii","difficulty":2,"accepted":15136,"submitted":25757,"acceptance":0.5876460767946577},{"id":1041,"title":"Robot Bounded In Circle","slug":"robot-bounded-in-circle","difficulty":2,"accepted":272850,"submitted":482971,"acceptance":0.5649407521362566},{"id":1042,"title":"Flower Planting With No Adjacent","slug":"flower-planting-with-no-adjacent","difficulty":2,"accepted":103496,"submitted":193324,"acceptance":0.5353499824129441},{"id":1043,"title":"Partition Array for Maximum Sum","slug":"partition-array-for-maximum-sum","difficulty":2,"accepted":265038,"submitted":342683,"acceptance":0.7734203330775089},{"id":1044,"title":"Longest Duplicate Substring","slug":"longest-duplicate-substring","difficulty":3,"accepted":84580,"submitted":272081,"acceptance":0.31086330908810245},{"id":1045,"title":"Customers Who Bought All Products","slug":"customers-who-bought-all-products","difficulty":2,"accepted":478160,"submitted":748630,"acceptance":0.6387133831131534},{"id":1046,"title":"Last Stone Weight","slug":"last-stone-weight","difficulty":1,"accepted":921559,"submitted":1387455,"acceptance":0.6642082085545117},{"id":1047,"title":"Remove All Adjacent Duplicates In String","slug":"remove-all-adjacent-duplicates-in-string","difficulty":1,"accepted":864385,"submitted":1183031,"acceptance":0.7306528738469237},{"id":1048,"title":"Longest String Chain","slug":"longest-string-chain","difficulty":2,"accepted":522991,"submitted":831030,"acceptance":0.6293286644284803},{"id":1049,"title":"Last Stone Weight II","slug":"last-stone-weight-ii","difficulty":2,"accepted":133892,"submitted":224794,"acceptance":0.5956208795608424},{"id":1050,"title":"Actors and Directors Who Cooperated At Least Three Times","slug":"actors-and-directors-who-cooperated-at-least-three-times","difficulty":1,"accepted":314201,"submitted":442414,"acceptance":0.7101967840077393},{"id":1051,"title":"Height Checker","slug":"height-checker","difficulty":1,"accepted":636449,"submitted":779714,"acceptance":0.8162595515791687},{"id":1052,"title":"Grumpy Bookstore Owner","slug":"grumpy-bookstore-owner","difficulty":2,"accepted":237067,"submitted":370515,"acceptance":0.6398310459765462},{"id":1053,"title":"Previous Permutation With One Swap","slug":"previous-permutation-with-one-swap","difficulty":2,"accepted":48531,"submitted":98545,"acceptance":0.4924755187985184},{"id":1054,"title":"Distant Barcodes","slug":"distant-barcodes","difficulty":2,"accepted":57331,"submitted":117418,"acceptance":0.48826415030063536},{"id":1055,"title":"Shortest Way to Form String","slug":"shortest-way-to-form-string","difficulty":2,"accepted":110754,"submitted":179827,"acceptance":0.6158919405873423},{"id":1056,"title":"Confusing Number","slug":"confusing-number","difficulty":1,"accepted":55485,"submitted":112504,"acceptance":0.49318246462348003},{"id":1057,"title":"Campus Bikes","slug":"campus-bikes","difficulty":2,"accepted":78030,"submitted":132088,"acceptance":0.5907425352795106},{"id":1058,"title":"Minimize Rounding Error to Meet Target","slug":"minimize-rounding-error-to-meet-target","difficulty":2,"accepted":11401,"submitted":24871,"acceptance":0.4584053717180652},{"id":1059,"title":"All Paths from Source Lead to Destination","slug":"all-paths-from-source-lead-to-destination","difficulty":2,"accepted":75141,"submitted":202966,"acceptance":0.37021471576520204},{"id":1060,"title":"Missing Element in Sorted Array","slug":"missing-element-in-sorted-array","difficulty":2,"accepted":170489,"submitted":285679,"acceptance":0.5967852029725671},{"id":1061,"title":"Lexicographically Smallest Equivalent String","slug":"lexicographically-smallest-equivalent-string","difficulty":2,"accepted":180915,"submitted":222972,"acceptance":0.8113799042032184},{"id":1062,"title":"Longest Repeating Substring","slug":"longest-repeating-substring","difficulty":2,"accepted":57699,"submitted":91013,"acceptance":0.6339643787151286},{"id":1063,"title":"Number of Valid Subarrays","slug":"number-of-valid-subarrays","difficulty":3,"accepted":19427,"submitted":24326,"acceptance":0.7986105401627888},{"id":1064,"title":"Fixed Point","slug":"fixed-point","difficulty":1,"accepted":49426,"submitted":77469,"acceptance":0.6380100427267681},{"id":1065,"title":"Index Pairs of a String","slug":"index-pairs-of-a-string","difficulty":1,"accepted":31313,"submitted":45633,"acceptance":0.6861920101680801},{"id":1066,"title":"Campus Bikes II","slug":"campus-bikes-ii","difficulty":2,"accepted":57268,"submitted":102542,"acceptance":0.5584833531626066},{"id":1067,"title":"Digit Count in Range","slug":"digit-count-in-range","difficulty":3,"accepted":4706,"submitted":10136,"acceptance":0.4642857142857143},{"id":1068,"title":"Product Sales Analysis I","slug":"product-sales-analysis-i","difficulty":1,"accepted":1316640,"submitted":1536605,"acceptance":0.8568500037420157},{"id":1069,"title":"Product Sales Analysis II","slug":"product-sales-analysis-ii","difficulty":1,"accepted":62315,"submitted":75406,"acceptance":0.8263931252155001},{"id":1070,"title":"Product Sales Analysis III","slug":"product-sales-analysis-iii","difficulty":2,"accepted":439766,"submitted":959232,"acceptance":0.458456348412063},{"id":1071,"title":"Greatest Common Divisor of Strings","slug":"greatest-common-divisor-of-strings","difficulty":1,"accepted":942740,"submitted":1758379,"acceptance":0.5361415258030265},{"id":1072,"title":"Flip Columns For Maximum Number of Equal Rows","slug":"flip-columns-for-maximum-number-of-equal-rows","difficulty":2,"accepted":118650,"submitted":151034,"acceptance":0.785584702782155},{"id":1073,"title":"Adding Two Negabinary Numbers","slug":"adding-two-negabinary-numbers","difficulty":2,"accepted":21912,"submitted":57996,"acceptance":0.377819159942065},{"id":1074,"title":"Number of Submatrices That Sum to Target","slug":"number-of-submatrices-that-sum-to-target","difficulty":3,"accepted":171804,"submitted":230322,"acceptance":0.7459296115872561},{"id":1075,"title":"Project Employees I","slug":"project-employees-i","difficulty":1,"accepted":671079,"submitted":1006857,"acceptance":0.6665087495046467},{"id":1076,"title":"Project Employees II","slug":"project-employees-ii","difficulty":1,"accepted":66661,"submitted":132289,"acceptance":0.5039043306699725},{"id":1077,"title":"Project Employees III","slug":"project-employees-iii","difficulty":2,"accepted":72418,"submitted":93850,"acceptance":0.771635588705381},{"id":1078,"title":"Occurrences After Bigram","slug":"occurrences-after-bigram","difficulty":1,"accepted":90818,"submitted":142253,"acceptance":0.6384259031443976},{"id":1079,"title":"Letter Tile Possibilities","slug":"letter-tile-possibilities","difficulty":2,"accepted":256195,"submitted":306710,"acceptance":0.8353004466760132},{"id":1080,"title":"Insufficient Nodes in Root to Leaf Paths","slug":"insufficient-nodes-in-root-to-leaf-paths","difficulty":2,"accepted":50995,"submitted":92711,"acceptance":0.5500426055160661},{"id":1081,"title":"Smallest Subsequence of Distinct Characters","slug":"smallest-subsequence-of-distinct-characters","difficulty":2,"accepted":96229,"submitted":152028,"acceptance":0.6329689267766464},{"id":1082,"title":"Sales Analysis I","slug":"sales-analysis-i","difficulty":1,"accepted":68115,"submitted":91073,"acceptance":0.7479165065387107},{"id":1083,"title":"Sales Analysis II","slug":"sales-analysis-ii","difficulty":1,"accepted":66982,"submitted":133685,"acceptance":0.5010434977746194},{"id":1084,"title":"Sales Analysis III","slug":"sales-analysis-iii","difficulty":1,"accepted":227166,"submitted":478758,"acceptance":0.47449024350506935},{"id":1085,"title":"Sum of Digits in the Minimum Number","slug":"sum-of-digits-in-the-minimum-number","difficulty":1,"accepted":26063,"submitted":33988,"acceptance":0.7668294692244322},{"id":1086,"title":"High Five","slug":"high-five","difficulty":1,"accepted":123314,"submitted":166156,"acceptance":0.7421579720262885},{"id":1087,"title":"Brace Expansion","slug":"brace-expansion","difficulty":2,"accepted":65806,"submitted":98487,"acceptance":0.6681694030684253},{"id":1088,"title":"Confusing Number II","slug":"confusing-number-ii","difficulty":3,"accepted":39328,"submitted":83422,"acceptance":0.47143439380499147},{"id":1089,"title":"Duplicate Zeros","slug":"duplicate-zeros","difficulty":1,"accepted":548902,"submitted":1026048,"acceptance":0.5349671750249501},{"id":1090,"title":"Largest Values From Labels","slug":"largest-values-from-labels","difficulty":2,"accepted":50186,"submitted":78240,"acceptance":0.6414366053169734},{"id":1091,"title":"Shortest Path in Binary Matrix","slug":"shortest-path-in-binary-matrix","difficulty":2,"accepted":835240,"submitted":1627578,"acceptance":0.5131797062875021},{"id":1092,"title":"Shortest Common Supersequence ","slug":"shortest-common-supersequence","difficulty":3,"accepted":309239,"submitted":500117,"acceptance":0.6183333100054588},{"id":1093,"title":"Statistics from a Large Sample","slug":"statistics-from-a-large-sample","difficulty":2,"accepted":26165,"submitted":60779,"acceptance":0.430494085128087},{"id":1094,"title":"Car Pooling","slug":"car-pooling","difficulty":2,"accepted":321648,"submitted":571664,"acceptance":0.5626521872988329},{"id":1095,"title":"Find in Mountain Array","slug":"find-in-mountain-array","difficulty":3,"accepted":202338,"submitted":488559,"acceptance":0.4141526407250711},{"id":1096,"title":"Brace Expansion II","slug":"brace-expansion-ii","difficulty":3,"accepted":29531,"submitted":46255,"acceptance":0.6384390876661983},{"id":1097,"title":"Game Play Analysis V","slug":"game-play-analysis-v","difficulty":3,"accepted":29074,"submitted":57764,"acceptance":0.5033238695381206},{"id":1098,"title":"Unpopular Books","slug":"unpopular-books","difficulty":2,"accepted":48330,"submitted":111454,"acceptance":0.43363181222746605},{"id":1099,"title":"Two Sum Less Than K","slug":"two-sum-less-than-k","difficulty":1,"accepted":148783,"submitted":239482,"acceptance":0.6212700745776301},{"id":1100,"title":"Find K-Length Substrings With No Repeated Characters","slug":"find-k-length-substrings-with-no-repeated-characters","difficulty":2,"accepted":56195,"submitted":73461,"acceptance":0.7649637222471788},{"id":1101,"title":"The Earliest Moment When Everyone Become Friends","slug":"the-earliest-moment-when-everyone-become-friends","difficulty":2,"accepted":132590,"submitted":201010,"acceptance":0.6596189244316203},{"id":1102,"title":"Path With Maximum Minimum Value","slug":"path-with-maximum-minimum-value","difficulty":2,"accepted":72296,"submitted":132300,"acceptance":0.5464550264550264},{"id":1103,"title":"Distribute Candies to People","slug":"distribute-candies-to-people","difficulty":1,"accepted":109557,"submitted":162274,"acceptance":0.6751358812872056},{"id":1104,"title":"Path In Zigzag Labelled Binary Tree","slug":"path-in-zigzag-labelled-binary-tree","difficulty":2,"accepted":53581,"submitted":70751,"acceptance":0.7573179177679468},{"id":1105,"title":"Filling Bookcase Shelves","slug":"filling-bookcase-shelves","difficulty":2,"accepted":158538,"submitted":231032,"acceptance":0.6862166279995845},{"id":1106,"title":"Parsing A Boolean Expression","slug":"parsing-a-boolean-expression","difficulty":3,"accepted":148031,"submitted":212054,"acceptance":0.6980816207192507},{"id":1107,"title":"New Users Daily Count","slug":"new-users-daily-count","difficulty":2,"accepted":44965,"submitted":100621,"acceptance":0.44687490682859443},{"id":1108,"title":"Defanging an IP Address","slug":"defanging-an-ip-address","difficulty":1,"accepted":851252,"submitted":945833,"acceptance":0.9000024317189187},{"id":1109,"title":"Corporate Flight Bookings","slug":"corporate-flight-bookings","difficulty":2,"accepted":103817,"submitted":155116,"acceptance":0.6692862116093762},{"id":1110,"title":"Delete Nodes And Return Forest","slug":"delete-nodes-and-return-forest","difficulty":2,"accepted":392707,"submitted":541847,"acceptance":0.7247562503806425},{"id":1111,"title":"Maximum Nesting Depth of Two Valid Parentheses Strings","slug":"maximum-nesting-depth-of-two-valid-parentheses-strings","difficulty":2,"accepted":33457,"submitted":46561,"acceptance":0.7185627456454973},{"id":1112,"title":"Highest Grade For Each Student","slug":"highest-grade-for-each-student","difficulty":2,"accepted":78339,"submitted":110132,"acceptance":0.7113191442995678},{"id":1113,"title":"Reported Posts","slug":"reported-posts","difficulty":1,"accepted":54084,"submitted":83436,"acceptance":0.6482094060117934},{"id":1114,"title":"Print in Order","slug":"print-in-order","difficulty":1,"accepted":235994,"submitted":323576,"acceptance":0.7293309763394071},{"id":1115,"title":"Print FooBar Alternately","slug":"print-foobar-alternately","difficulty":2,"accepted":137781,"submitted":190437,"acceptance":0.7234991099418705},{"id":1116,"title":"Print Zero Even Odd","slug":"print-zero-even-odd","difficulty":2,"accepted":83865,"submitted":127845,"acceptance":0.6559896749970667},{"id":1117,"title":"Building H2O","slug":"building-h2o","difficulty":2,"accepted":86593,"submitted":148119,"acceptance":0.5846177735469453},{"id":1118,"title":"Number of Days in a Month","slug":"number-of-days-in-a-month","difficulty":1,"accepted":9710,"submitted":16379,"acceptance":0.5928322852432993},{"id":1119,"title":"Remove Vowels from a String","slug":"remove-vowels-from-a-string","difficulty":1,"accepted":117962,"submitted":129220,"acceptance":0.9128772635814889},{"id":1120,"title":"Maximum Average Subtree","slug":"maximum-average-subtree","difficulty":2,"accepted":74005,"submitted":110577,"acceptance":0.6692621431219874},{"id":1121,"title":"Divide Array Into Increasing Sequences","slug":"divide-array-into-increasing-sequences","difficulty":3,"accepted":7305,"submitted":11172,"acceptance":0.6538668098818474},{"id":1122,"title":"Relative Sort Array","slug":"relative-sort-array","difficulty":1,"accepted":403912,"submitted":537347,"acceptance":0.7516781521065531},{"id":1123,"title":"Lowest Common Ancestor of Deepest Leaves","slug":"lowest-common-ancestor-of-deepest-leaves","difficulty":2,"accepted":251087,"submitted":316013,"acceptance":0.7945464268875014},{"id":1124,"title":"Longest Well-Performing Interval","slug":"longest-well-performing-interval","difficulty":2,"accepted":46770,"submitted":124828,"acceptance":0.3746755535617009},{"id":1125,"title":"Smallest Sufficient Team","slug":"smallest-sufficient-team","difficulty":3,"accepted":73065,"submitted":131849,"acceptance":0.5541566488938103},{"id":1126,"title":"Active Businesses","slug":"active-businesses","difficulty":2,"accepted":52859,"submitted":80081,"acceptance":0.6600691799552952},{"id":1127,"title":"User Purchase Platform","slug":"user-purchase-platform","difficulty":3,"accepted":19853,"submitted":42912,"acceptance":0.4626444817300522},{"id":1128,"title":"Number of Equivalent Domino Pairs","slug":"number-of-equivalent-domino-pairs","difficulty":1,"accepted":203035,"submitted":334749,"acceptance":0.6065290710353131},{"id":1129,"title":"Shortest Path with Alternating Colors","slug":"shortest-path-with-alternating-colors","difficulty":2,"accepted":152687,"submitted":319032,"acceptance":0.47859462373680384},{"id":1130,"title":"Minimum Cost Tree From Leaf Values","slug":"minimum-cost-tree-from-leaf-values","difficulty":2,"accepted":120965,"submitted":178320,"acceptance":0.6783591296545536},{"id":1131,"title":"Maximum of Absolute Value Expression","slug":"maximum-of-absolute-value-expression","difficulty":2,"accepted":30594,"submitted":62888,"acceptance":0.4864839078997583},{"id":1132,"title":"Reported Posts II","slug":"reported-posts-ii","difficulty":2,"accepted":45018,"submitted":140607,"acceptance":0.3201689816296486},{"id":1133,"title":"Largest Unique Number","slug":"largest-unique-number","difficulty":1,"accepted":110934,"submitted":155659,"acceptance":0.7126732151690555},{"id":1134,"title":"Armstrong Number","slug":"armstrong-number","difficulty":1,"accepted":42678,"submitted":54827,"acceptance":0.7784120962299597},{"id":1135,"title":"Connecting Cities With Minimum Cost","slug":"connecting-cities-with-minimum-cost","difficulty":2,"accepted":91445,"submitted":144053,"acceptance":0.6348010801579974},{"id":1136,"title":"Parallel Courses","slug":"parallel-courses","difficulty":2,"accepted":109715,"submitted":176545,"acceptance":0.621456285932765},{"id":1137,"title":"N-th Tribonacci Number","slug":"n-th-tribonacci-number","difficulty":1,"accepted":1076486,"submitted":1702868,"acceptance":0.6321605667614871},{"id":1138,"title":"Alphabet Board Path","slug":"alphabet-board-path","difficulty":2,"accepted":59405,"submitted":114637,"acceptance":0.5182009298917453},{"id":1139,"title":"Largest 1-Bordered Square","slug":"largest-1-bordered-square","difficulty":2,"accepted":33217,"submitted":63791,"acceptance":0.5207160884764308},{"id":1140,"title":"Stone Game II","slug":"stone-game-ii","difficulty":2,"accepted":197487,"submitted":271104,"acceptance":0.7284547627478754},{"id":1141,"title":"User Activity for the Past 30 Days I","slug":"user-activity-for-the-past-30-days-i","difficulty":1,"accepted":543300,"submitted":1072350,"acceptance":0.5066442859141138},{"id":1142,"title":"User Activity for the Past 30 Days II","slug":"user-activity-for-the-past-30-days-ii","difficulty":1,"accepted":49319,"submitted":138433,"acceptance":0.3562662082018016},{"id":1143,"title":"Longest Common Subsequence","slug":"longest-common-subsequence","difficulty":2,"accepted":1811185,"submitted":3067940,"acceptance":0.5903586771579626},{"id":1144,"title":"Decrease Elements To Make Array Zigzag","slug":"decrease-elements-to-make-array-zigzag","difficulty":2,"accepted":25680,"submitted":52297,"acceptance":0.4910415511406008},{"id":1145,"title":"Binary Tree Coloring Game","slug":"binary-tree-coloring-game","difficulty":2,"accepted":55110,"submitted":104267,"acceptance":0.5285469036224308},{"id":1146,"title":"Snapshot Array","slug":"snapshot-array","difficulty":2,"accepted":277658,"submitted":756657,"acceptance":0.3669535866317235},{"id":1147,"title":"Longest Chunked Palindrome Decomposition","slug":"longest-chunked-palindrome-decomposition","difficulty":3,"accepted":31296,"submitted":53093,"acceptance":0.5894562371687416},{"id":1148,"title":"Article Views I","slug":"article-views-i","difficulty":1,"accepted":1606262,"submitted":2094607,"acceptance":0.7668560259752785},{"id":1149,"title":"Article Views II","slug":"article-views-ii","difficulty":2,"accepted":44578,"submitted":94286,"acceptance":0.47279553698322124},{"id":1150,"title":"Check If a Number Is Majority Element in a Sorted Array","slug":"check-if-a-number-is-majority-element-in-a-sorted-array","difficulty":1,"accepted":62103,"submitted":103668,"acceptance":0.5990566037735849},{"id":1151,"title":"Minimum Swaps to Group All 1's Together","slug":"minimum-swaps-to-group-all-1s-together","difficulty":2,"accepted":88552,"submitted":144638,"acceptance":0.61223191692363},{"id":1152,"title":"Analyze User Website Visit Pattern","slug":"analyze-user-website-visit-pattern","difficulty":2,"accepted":131540,"submitted":297158,"acceptance":0.4426601336662651},{"id":1153,"title":"String Transforms Into Another String","slug":"string-transforms-into-another-string","difficulty":3,"accepted":54363,"submitted":156908,"acceptance":0.3464641700869299},{"id":1154,"title":"Day of the Year","slug":"day-of-the-year","difficulty":1,"accepted":94644,"submitted":190025,"acceptance":0.49806078147612154},{"id":1155,"title":"Number of Dice Rolls With Target Sum","slug":"number-of-dice-rolls-with-target-sum","difficulty":2,"accepted":351648,"submitted":564611,"acceptance":0.6228146458358056},{"id":1156,"title":"Swap For Longest Repeated Character Substring","slug":"swap-for-longest-repeated-character-substring","difficulty":2,"accepted":40965,"submitted":92584,"acceptance":0.44246306057202106},{"id":1157,"title":"Online Majority Element In Subarray","slug":"online-majority-element-in-subarray","difficulty":3,"accepted":21209,"submitted":52562,"acceptance":0.40350443286024124},{"id":1158,"title":"Market Analysis I","slug":"market-analysis-i","difficulty":2,"accepted":170923,"submitted":298195,"acceptance":0.5731920387665789},{"id":1159,"title":"Market Analysis II","slug":"market-analysis-ii","difficulty":3,"accepted":23825,"submitted":41243,"acceptance":0.5776737870668962},{"id":1160,"title":"Find Words That Can Be Formed by Characters","slug":"find-words-that-can-be-formed-by-characters","difficulty":1,"accepted":330648,"submitted":462355,"acceptance":0.7151388002725179},{"id":1161,"title":"Maximum Level Sum of a Binary Tree","slug":"maximum-level-sum-of-a-binary-tree","difficulty":2,"accepted":568011,"submitted":811717,"acceptance":0.6997648195122191},{"id":1162,"title":"As Far from Land as Possible","slug":"as-far-from-land-as-possible","difficulty":2,"accepted":184267,"submitted":352747,"acceptance":0.522377227871534},{"id":1163,"title":"Last Substring in Lexicographical Order","slug":"last-substring-in-lexicographical-order","difficulty":3,"accepted":43137,"submitted":123169,"acceptance":0.35022611208989274},{"id":1164,"title":"Product Price at a Given Date","slug":"product-price-at-a-given-date","difficulty":2,"accepted":336676,"submitted":582777,"acceptance":0.5777098272581107},{"id":1165,"title":"Single-Row Keyboard","slug":"single-row-keyboard","difficulty":1,"accepted":93947,"submitted":107005,"acceptance":0.8779683192374188},{"id":1166,"title":"Design File System","slug":"design-file-system","difficulty":2,"accepted":90331,"submitted":138758,"acceptance":0.6509966992894103},{"id":1167,"title":"Minimum Cost to Connect Sticks","slug":"minimum-cost-to-connect-sticks","difficulty":2,"accepted":149276,"submitted":207747,"acceptance":0.7185470788988529},{"id":1168,"title":"Optimize Water Distribution in a Village","slug":"optimize-water-distribution-in-a-village","difficulty":3,"accepted":59606,"submitted":90971,"acceptance":0.6552197953193875},{"id":1169,"title":"Invalid Transactions","slug":"invalid-transactions","difficulty":2,"accepted":113759,"submitted":353431,"acceptance":0.3218704641075627},{"id":1170,"title":"Compare Strings by Frequency of the Smallest Character","slug":"compare-strings-by-frequency-of-the-smallest-character","difficulty":2,"accepted":92937,"submitted":146841,"acceptance":0.6329090649069402},{"id":1171,"title":"Remove Zero Sum Consecutive Nodes from Linked List","slug":"remove-zero-sum-consecutive-nodes-from-linked-list","difficulty":2,"accepted":187398,"submitted":352660,"acceptance":0.5313843361878297},{"id":1172,"title":"Dinner Plate Stacks","slug":"dinner-plate-stacks","difficulty":3,"accepted":23948,"submitted":71162,"acceptance":0.33652792220567157},{"id":1173,"title":"Immediate Food Delivery I","slug":"immediate-food-delivery-i","difficulty":1,"accepted":91871,"submitted":113892,"acceptance":0.8066501598005128},{"id":1174,"title":"Immediate Food Delivery II","slug":"immediate-food-delivery-ii","difficulty":2,"accepted":446904,"submitted":800080,"acceptance":0.5585741425857415},{"id":1175,"title":"Prime Arrangements","slug":"prime-arrangements","difficulty":1,"accepted":43473,"submitted":71391,"acceptance":0.6089423036517208},{"id":1176,"title":"Diet Plan Performance","slug":"diet-plan-performance","difficulty":1,"accepted":41748,"submitted":74640,"acceptance":0.5593247588424437},{"id":1177,"title":"Can Make Palindrome from Substring","slug":"can-make-palindrome-from-substring","difficulty":2,"accepted":36094,"submitted":86943,"acceptance":0.4151455551338233},{"id":1178,"title":"Number of Valid Words for Each Puzzle","slug":"number-of-valid-words-for-each-puzzle","difficulty":3,"accepted":34972,"submitted":73166,"acceptance":0.4779815761419238},{"id":1179,"title":"Reformat Department Table","slug":"reformat-department-table","difficulty":1,"accepted":182669,"submitted":239380,"acceptance":0.7630921547330604},{"id":1180,"title":"Count Substrings with Only One Distinct Letter","slug":"count-substrings-with-only-one-distinct-letter","difficulty":1,"accepted":31302,"submitted":38689,"acceptance":0.8090671767168963},{"id":1181,"title":"Before and After Puzzle","slug":"before-and-after-puzzle","difficulty":2,"accepted":13082,"submitted":25240,"acceptance":0.5183042789223454},{"id":1182,"title":"Shortest Distance to Target Color","slug":"shortest-distance-to-target-color","difficulty":2,"accepted":41112,"submitted":72763,"acceptance":0.5650124376400093},{"id":1183,"title":"Maximum Number of Ones","slug":"maximum-number-of-ones","difficulty":3,"accepted":7718,"submitted":10943,"acceptance":0.7052910536415974},{"id":1184,"title":"Distance Between Bus Stops","slug":"distance-between-bus-stops","difficulty":1,"accepted":78779,"submitted":142550,"acceptance":0.5526411785338478},{"id":1185,"title":"Day of the Week","slug":"day-of-the-week","difficulty":1,"accepted":89899,"submitted":152171,"acceptance":0.5907761662866118},{"id":1186,"title":"Maximum Subarray Sum with One Deletion","slug":"maximum-subarray-sum-with-one-deletion","difficulty":2,"accepted":77928,"submitted":165252,"acceptance":0.47157069203398444},{"id":1187,"title":"Make Array Strictly Increasing","slug":"make-array-strictly-increasing","difficulty":3,"accepted":67139,"submitted":115992,"acceptance":0.5788244016828746},{"id":1188,"title":"Design Bounded Blocking Queue","slug":"design-bounded-blocking-queue","difficulty":2,"accepted":69232,"submitted":93943,"acceptance":0.7369575167920973},{"id":1189,"title":"Maximum Number of Balloons","slug":"maximum-number-of-balloons","difficulty":1,"accepted":327523,"submitted":544808,"acceptance":0.6011714218587099},{"id":1190,"title":"Reverse Substrings Between Each Pair of Parentheses","slug":"reverse-substrings-between-each-pair-of-parentheses","difficulty":2,"accepted":244341,"submitted":339513,"acceptance":0.719680836963533},{"id":1191,"title":"K-Concatenation Maximum Sum","slug":"k-concatenation-maximum-sum","difficulty":2,"accepted":44801,"submitted":176295,"acceptance":0.25412518789528915},{"id":1192,"title":"Critical Connections in a Network","slug":"critical-connections-in-a-network","difficulty":3,"accepted":319478,"submitted":537040,"acceptance":0.594886786831521},{"id":1193,"title":"Monthly Transactions I","slug":"monthly-transactions-i","difficulty":2,"accepted":528937,"submitted":895545,"acceptance":0.5906314032237353},{"id":1194,"title":"Tournament Winners","slug":"tournament-winners","difficulty":3,"accepted":25015,"submitted":49934,"acceptance":0.5009612688749149},{"id":1195,"title":"Fizz Buzz Multithreaded","slug":"fizz-buzz-multithreaded","difficulty":2,"accepted":76306,"submitted":102132,"acceptance":0.747131163592214},{"id":1196,"title":"How Many Apples Can You Put into the Basket","slug":"how-many-apples-can-you-put-into-the-basket","difficulty":1,"accepted":51707,"submitted":77132,"acceptance":0.6703702743349064},{"id":1197,"title":"Minimum Knight Moves","slug":"minimum-knight-moves","difficulty":2,"accepted":191042,"submitted":456326,"acceptance":0.418652454604822},{"id":1198,"title":"Find Smallest Common Element in All Rows","slug":"find-smallest-common-element-in-all-rows","difficulty":2,"accepted":55482,"submitted":72271,"acceptance":0.7676938190975633},{"id":1199,"title":"Minimum Time to Build Blocks","slug":"minimum-time-to-build-blocks","difficulty":3,"accepted":7193,"submitted":15457,"acceptance":0.4653555023613897},{"id":1200,"title":"Minimum Absolute Difference","slug":"minimum-absolute-difference","difficulty":1,"accepted":434116,"submitted":578178,"acceptance":0.7508345180895849},{"id":1201,"title":"Ugly Number III","slug":"ugly-number-iii","difficulty":2,"accepted":43583,"submitted":139064,"acceptance":0.3134024621756889},{"id":1202,"title":"Smallest String With Swaps","slug":"smallest-string-with-swaps","difficulty":2,"accepted":147527,"submitted":244042,"acceptance":0.6045147966333664},{"id":1203,"title":"Sort Items by Groups Respecting Dependencies","slug":"sort-items-by-groups-respecting-dependencies","difficulty":3,"accepted":66403,"submitted":101036,"acceptance":0.6572211884872718},{"id":1204,"title":"Last Person to Fit in the Bus","slug":"last-person-to-fit-in-the-bus","difficulty":2,"accepted":335263,"submitted":484924,"acceptance":0.6913722562710858},{"id":1205,"title":"Monthly Transactions II","slug":"monthly-transactions-ii","difficulty":2,"accepted":28496,"submitted":67936,"acceptance":0.41945360339142723},{"id":1206,"title":"Design Skiplist","slug":"design-skiplist","difficulty":3,"accepted":34950,"submitted":58574,"acceptance":0.5966811213166251},{"id":1207,"title":"Unique Number of Occurrences","slug":"unique-number-of-occurrences","difficulty":1,"accepted":973974,"submitted":1238060,"acceptance":0.7866936982052566},{"id":1208,"title":"Get Equal Substrings Within Budget","slug":"get-equal-substrings-within-budget","difficulty":2,"accepted":201026,"submitted":337205,"acceptance":0.5961536750641301},{"id":1209,"title":"Remove All Adjacent Duplicates in String II","slug":"remove-all-adjacent-duplicates-in-string-ii","difficulty":2,"accepted":420889,"submitted":688234,"acceptance":0.6115492695798231},{"id":1210,"title":"Minimum Moves to Reach Target with Rotations","slug":"minimum-moves-to-reach-target-with-rotations","difficulty":3,"accepted":12693,"submitted":24398,"acceptance":0.5202475612755144},{"id":1211,"title":"Queries Quality and Percentage","slug":"queries-quality-and-percentage","difficulty":1,"accepted":513659,"submitted":974241,"acceptance":0.5272401797912426},{"id":1212,"title":"Team Scores in Football Tournament","slug":"team-scores-in-football-tournament","difficulty":2,"accepted":51944,"submitted":93179,"acceptance":0.5574646647849837},{"id":1213,"title":"Intersection of Three Sorted Arrays","slug":"intersection-of-three-sorted-arrays","difficulty":1,"accepted":103041,"submitted":128774,"acceptance":0.8001692888315964},{"id":1214,"title":"Two Sum BSTs","slug":"two-sum-bsts","difficulty":2,"accepted":61293,"submitted":89919,"acceptance":0.6816468154672538},{"id":1215,"title":"Stepping Numbers","slug":"stepping-numbers","difficulty":2,"accepted":11223,"submitted":23221,"acceptance":0.48331251884070453},{"id":1216,"title":"Valid Palindrome III","slug":"valid-palindrome-iii","difficulty":3,"accepted":108807,"submitted":221407,"acceptance":0.4914343268279684},{"id":1217,"title":"Minimum Cost to Move Chips to The Same Position","slug":"minimum-cost-to-move-chips-to-the-same-position","difficulty":1,"accepted":169498,"submitted":232738,"acceptance":0.7282781496790383},{"id":1218,"title":"Longest Arithmetic Subsequence of Given Difference","slug":"longest-arithmetic-subsequence-of-given-difference","difficulty":2,"accepted":171554,"submitted":315789,"acceptance":0.5432551482160557},{"id":1219,"title":"Path with Maximum Gold","slug":"path-with-maximum-gold","difficulty":2,"accepted":254521,"submitted":372257,"acceptance":0.6837238789331027},{"id":1220,"title":"Count Vowels Permutation","slug":"count-vowels-permutation","difficulty":3,"accepted":183279,"submitted":298763,"acceptance":0.6134594979967399},{"id":1221,"title":"Split a String in Balanced Strings","slug":"split-a-string-in-balanced-strings","difficulty":1,"accepted":386556,"submitted":442486,"acceptance":0.87360052069444},{"id":1222,"title":"Queens That Can Attack the King","slug":"queens-that-can-attack-the-king","difficulty":2,"accepted":51187,"submitted":70502,"acceptance":0.7260361408187002},{"id":1223,"title":"Dice Roll Simulation","slug":"dice-roll-simulation","difficulty":3,"accepted":37838,"submitted":74448,"acceptance":0.5082473672899205},{"id":1224,"title":"Maximum Equal Frequency","slug":"maximum-equal-frequency","difficulty":3,"accepted":19317,"submitted":50655,"acceptance":0.3813443885105123},{"id":1225,"title":"Report Contiguous Dates","slug":"report-contiguous-dates","difficulty":3,"accepted":32923,"submitted":57715,"acceptance":0.5704409598891103},{"id":1226,"title":"The Dining Philosophers","slug":"the-dining-philosophers","difficulty":2,"accepted":55556,"submitted":102914,"acceptance":0.5398293720970908},{"id":1227,"title":"Airplane Seat Assignment Probability","slug":"airplane-seat-assignment-probability","difficulty":2,"accepted":56981,"submitted":84703,"acceptance":0.6727152521162179},{"id":1228,"title":"Missing Number In Arithmetic Progression","slug":"missing-number-in-arithmetic-progression","difficulty":1,"accepted":31908,"submitted":61119,"acceptance":0.5220635154370982},{"id":1229,"title":"Meeting Scheduler","slug":"meeting-scheduler","difficulty":2,"accepted":104925,"submitted":190097,"acceptance":0.5519550545247952},{"id":1230,"title":"Toss Strange Coins","slug":"toss-strange-coins","difficulty":2,"accepted":23152,"submitted":39838,"acceptance":0.5811536723731111},{"id":1231,"title":"Divide Chocolate","slug":"divide-chocolate","difficulty":3,"accepted":70407,"submitted":116384,"acceptance":0.6049542892493813},{"id":1232,"title":"Check If It Is a Straight Line","slug":"check-if-it-is-a-straight-line","difficulty":1,"accepted":306149,"submitted":765038,"acceptance":0.4001748932732753},{"id":1233,"title":"Remove Sub-Folders from the Filesystem","slug":"remove-sub-folders-from-the-filesystem","difficulty":2,"accepted":265291,"submitted":337522,"acceptance":0.7859961721013742},{"id":1234,"title":"Replace the Substring for Balanced String","slug":"replace-the-substring-for-balanced-string","difficulty":2,"accepted":47740,"submitted":117036,"acceptance":0.4079086776718275},{"id":1235,"title":"Maximum Profit in Job Scheduling","slug":"maximum-profit-in-job-scheduling","difficulty":3,"accepted":416317,"submitted":761087,"acceptance":0.5470031678375796},{"id":1236,"title":"Web Crawler","slug":"web-crawler","difficulty":2,"accepted":55031,"submitted":79889,"acceptance":0.6888432700371766},{"id":1237,"title":"Find Positive Integer Solution for a Given Equation","slug":"find-positive-integer-solution-for-a-given-equation","difficulty":2,"accepted":82186,"submitted":117600,"acceptance":0.6988605442176871},{"id":1238,"title":"Circular Permutation in Binary Representation","slug":"circular-permutation-in-binary-representation","difficulty":2,"accepted":24664,"submitted":33968,"acceptance":0.7260951483749412},{"id":1239,"title":"Maximum Length of a Concatenated String with Unique Characters","slug":"maximum-length-of-a-concatenated-string-with-unique-characters","difficulty":2,"accepted":323944,"submitted":592096,"acceptance":0.5471139815165108},{"id":1240,"title":"Tiling a Rectangle with the Fewest Squares","slug":"tiling-a-rectangle-with-the-fewest-squares","difficulty":3,"accepted":27526,"submitted":50139,"acceptance":0.5489937972436626},{"id":1241,"title":"Number of Comments per Post","slug":"number-of-comments-per-post","difficulty":1,"accepted":41232,"submitted":62831,"acceptance":0.656236571119352},{"id":1242,"title":"Web Crawler Multithreaded","slug":"web-crawler-multithreaded","difficulty":2,"accepted":102684,"submitted":200695,"acceptance":0.5116420438974564},{"id":1243,"title":"Array Transformation","slug":"array-transformation","difficulty":1,"accepted":16318,"submitted":30413,"acceptance":0.5365468714036761},{"id":1244,"title":"Design A Leaderboard","slug":"design-a-leaderboard","difficulty":2,"accepted":97859,"submitted":143740,"acceptance":0.6808056212606094},{"id":1245,"title":"Tree Diameter","slug":"tree-diameter","difficulty":2,"accepted":56423,"submitted":92127,"acceptance":0.61244803369262},{"id":1246,"title":"Palindrome Removal","slug":"palindrome-removal","difficulty":3,"accepted":11982,"submitted":25940,"acceptance":0.46191210485736317},{"id":1247,"title":"Minimum Swaps to Make Strings Equal","slug":"minimum-swaps-to-make-strings-equal","difficulty":2,"accepted":51717,"submitted":79205,"acceptance":0.652951202575595},{"id":1248,"title":"Count Number of Nice Subarrays","slug":"count-number-of-nice-subarrays","difficulty":2,"accepted":483812,"submitted":645565,"acceptance":0.7494396381464299},{"id":1249,"title":"Minimum Remove to Make Valid Parentheses","slug":"minimum-remove-to-make-valid-parentheses","difficulty":2,"accepted":1050706,"submitted":1472231,"acceptance":0.7136828391740155},{"id":1250,"title":"Check If It Is a Good Array","slug":"check-if-it-is-a-good-array","difficulty":3,"accepted":38257,"submitted":60139,"acceptance":0.6361429355326826},{"id":1251,"title":"Average Selling Price","slug":"average-selling-price","difficulty":1,"accepted":639686,"submitted":1718941,"acceptance":0.3721395905967686},{"id":1252,"title":"Cells with Odd Values in a Matrix","slug":"cells-with-odd-values-in-a-matrix","difficulty":1,"accepted":143114,"submitted":179519,"acceptance":0.7972080949648783},{"id":1253,"title":"Reconstruct a 2-Row Binary Matrix","slug":"reconstruct-a-2-row-binary-matrix","difficulty":2,"accepted":34396,"submitted":70371,"acceptance":0.488780889855196},{"id":1254,"title":"Number of Closed Islands","slug":"number-of-closed-islands","difficulty":2,"accepted":279499,"submitted":416786,"acceptance":0.6706055385737525},{"id":1255,"title":"Maximum Score Words Formed by Letters","slug":"maximum-score-words-formed-by-letters","difficulty":3,"accepted":135726,"submitted":166487,"acceptance":0.8152348231393443},{"id":1256,"title":"Encode Number","slug":"encode-number","difficulty":2,"accepted":8682,"submitted":12345,"acceptance":0.7032806804374241},{"id":1257,"title":"Smallest Common Region","slug":"smallest-common-region","difficulty":2,"accepted":37652,"submitted":55160,"acceptance":0.6825960841189268},{"id":1258,"title":"Synonymous Sentences","slug":"synonymous-sentences","difficulty":2,"accepted":29474,"submitted":51551,"acceptance":0.5717444860429478},{"id":1259,"title":"Handshakes That Don't Cross","slug":"handshakes-that-dont-cross","difficulty":3,"accepted":13822,"submitted":23076,"acceptance":0.5989772924250303},{"id":1260,"title":"Shift 2D Grid","slug":"shift-2d-grid","difficulty":1,"accepted":125407,"submitted":184479,"acceptance":0.6797901116116197},{"id":1261,"title":"Find Elements in a Contaminated Binary Tree","slug":"find-elements-in-a-contaminated-binary-tree","difficulty":2,"accepted":203828,"submitted":242372,"acceptance":0.8409717294076874},{"id":1262,"title":"Greatest Sum Divisible by Three","slug":"greatest-sum-divisible-by-three","difficulty":2,"accepted":163269,"submitted":286181,"acceptance":0.5705095726131364},{"id":1263,"title":"Minimum Moves to Move a Box to Their Target Location","slug":"minimum-moves-to-move-a-box-to-their-target-location","difficulty":3,"accepted":32040,"submitted":64634,"acceptance":0.49571432991923753},{"id":1264,"title":"Page Recommendations","slug":"page-recommendations","difficulty":2,"accepted":54394,"submitted":83189,"acceptance":0.6538604863623796},{"id":1265,"title":"Print Immutable Linked List in Reverse","slug":"print-immutable-linked-list-in-reverse","difficulty":2,"accepted":67098,"submitted":71340,"acceptance":0.94053826745164},{"id":1266,"title":"Minimum Time Visiting All Points","slug":"minimum-time-visiting-all-points","difficulty":1,"accepted":406186,"submitted":479069,"acceptance":0.8478653388134069},{"id":1267,"title":"Count Servers that Communicate","slug":"count-servers-that-communicate","difficulty":2,"accepted":200086,"submitted":272160,"acceptance":0.7351778365667254},{"id":1268,"title":"Search Suggestions System","slug":"search-suggestions-system","difficulty":2,"accepted":439355,"submitted":674369,"acceptance":0.6515053331336405},{"id":1269,"title":"Number of Ways to Stay in the Same Place After Some Steps","slug":"number-of-ways-to-stay-in-the-same-place-after-some-steps","difficulty":3,"accepted":103459,"submitted":206479,"acceptance":0.5010630621031679},{"id":1270,"title":"All People Report to the Given Manager","slug":"all-people-report-to-the-given-manager","difficulty":2,"accepted":66975,"submitted":79829,"acceptance":0.838980821505969},{"id":1271,"title":"Hexspeak","slug":"hexspeak","difficulty":1,"accepted":13067,"submitted":22404,"acceptance":0.5832440635600785},{"id":1272,"title":"Remove Interval","slug":"remove-interval","difficulty":2,"accepted":42386,"submitted":63078,"acceptance":0.6719616982149085},{"id":1273,"title":"Delete Tree Nodes","slug":"delete-tree-nodes","difficulty":2,"accepted":11571,"submitted":18767,"acceptance":0.6165609847071988},{"id":1274,"title":"Number of Ships in a Rectangle","slug":"number-of-ships-in-a-rectangle","difficulty":3,"accepted":34648,"submitted":50307,"acceptance":0.688731190490389},{"id":1275,"title":"Find Winner on a Tic Tac Toe Game","slug":"find-winner-on-a-tic-tac-toe-game","difficulty":1,"accepted":169015,"submitted":309688,"acceptance":0.5457589574022887},{"id":1276,"title":"Number of Burgers with No Waste of Ingredients","slug":"number-of-burgers-with-no-waste-of-ingredients","difficulty":2,"accepted":32883,"submitted":64578,"acceptance":0.5091981789463904},{"id":1277,"title":"Count Square Submatrices with All Ones","slug":"count-square-submatrices-with-all-ones","difficulty":2,"accepted":478351,"submitted":592851,"acceptance":0.8068654687265434},{"id":1278,"title":"Palindrome Partitioning III","slug":"palindrome-partitioning-iii","difficulty":3,"accepted":37497,"submitted":60256,"acceptance":0.6222948751991503},{"id":1279,"title":"Traffic Light Controlled Intersection","slug":"traffic-light-controlled-intersection","difficulty":1,"accepted":21077,"submitted":28927,"acceptance":0.7286272340719743},{"id":1280,"title":"Students and Examinations","slug":"students-and-examinations","difficulty":1,"accepted":735517,"submitted":1204206,"acceptance":0.6107900143330959},{"id":1281,"title":"Subtract the Product and Sum of Digits of an Integer","slug":"subtract-the-product-and-sum-of-digits-of-an-integer","difficulty":1,"accepted":659227,"submitted":761668,"acceptance":0.8655043929901217},{"id":1282,"title":"Group the People Given the Group Size They Belong To","slug":"group-the-people-given-the-group-size-they-belong-to","difficulty":2,"accepted":250303,"submitted":286115,"acceptance":0.8748335459518026},{"id":1283,"title":"Find the Smallest Divisor Given a Threshold","slug":"find-the-smallest-divisor-given-a-threshold","difficulty":2,"accepted":445291,"submitted":677471,"acceptance":0.6572842232361238},{"id":1284,"title":"Minimum Number of Flips to Convert Binary Matrix to Zero Matrix","slug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix","difficulty":3,"accepted":39303,"submitted":54245,"acceptance":0.7245460411097797},{"id":1285,"title":"Find the Start and End Number of Continuous Ranges","slug":"find-the-start-and-end-number-of-continuous-ranges","difficulty":2,"accepted":49715,"submitted":60763,"acceptance":0.8181788259302536},{"id":1286,"title":"Iterator for Combination","slug":"iterator-for-combination","difficulty":2,"accepted":82353,"submitted":113303,"acceptance":0.7268386538750077},{"id":1287,"title":"Element Appearing More Than 25% In Sorted Array","slug":"element-appearing-more-than-25-in-sorted-array","difficulty":1,"accepted":256529,"submitted":419465,"acceptance":0.6115623472756965},{"id":1288,"title":"Remove Covered Intervals","slug":"remove-covered-intervals","difficulty":2,"accepted":142848,"submitted":254726,"acceptance":0.5607908105179683},{"id":1289,"title":"Minimum Falling Path Sum II","slug":"minimum-falling-path-sum-ii","difficulty":3,"accepted":164589,"submitted":260630,"acceptance":0.6315044315696582},{"id":1290,"title":"Convert Binary Number in a Linked List to Integer","slug":"convert-binary-number-in-a-linked-list-to-integer","difficulty":1,"accepted":725941,"submitted":881603,"acceptance":0.8234329964848123},{"id":1291,"title":"Sequential Digits","slug":"sequential-digits","difficulty":2,"accepted":235267,"submitted":360051,"acceptance":0.6534268756370625},{"id":1292,"title":"Maximum Side Length of a Square with Sum Less than or Equal to Threshold","slug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold","difficulty":2,"accepted":124557,"submitted":190348,"acceptance":0.6543646374009708},{"id":1293,"title":"Shortest Path in a Grid with Obstacles Elimination","slug":"shortest-path-in-a-grid-with-obstacles-elimination","difficulty":3,"accepted":272683,"submitted":590204,"acceptance":0.462014828771069},{"id":1294,"title":"Weather Type in Each Country","slug":"weather-type-in-each-country","difficulty":1,"accepted":45734,"submitted":68226,"acceptance":0.6703309588719842},{"id":1295,"title":"Find Numbers with Even Number of Digits","slug":"find-numbers-with-even-number-of-digits","difficulty":1,"accepted":1069508,"submitted":1341926,"acceptance":0.7969947672226337},{"id":1296,"title":"Divide Array in Sets of K Consecutive Numbers","slug":"divide-array-in-sets-of-k-consecutive-numbers","difficulty":2,"accepted":127377,"submitted":215264,"acceptance":0.5917245800505426},{"id":1297,"title":"Maximum Number of Occurrences of a Substring","slug":"maximum-number-of-occurrences-of-a-substring","difficulty":2,"accepted":83992,"submitted":154422,"acceptance":0.5439121368716893},{"id":1298,"title":"Maximum Candies You Can Get from Boxes","slug":"maximum-candies-you-can-get-from-boxes","difficulty":3,"accepted":105785,"submitted":156226,"acceptance":0.6771280068618539},{"id":1299,"title":"Replace Elements with Greatest Element on Right Side","slug":"replace-elements-with-greatest-element-on-right-side","difficulty":1,"accepted":535956,"submitted":743940,"acceptance":0.7204290668602307},{"id":1300,"title":"Sum of Mutated Array Closest to Target","slug":"sum-of-mutated-array-closest-to-target","difficulty":2,"accepted":49375,"submitted":106777,"acceptance":0.46241231725933485},{"id":1301,"title":"Number of Paths with Max Score","slug":"number-of-paths-with-max-score","difficulty":3,"accepted":19007,"submitted":44893,"acceptance":0.42338449201434525},{"id":1302,"title":"Deepest Leaves Sum","slug":"deepest-leaves-sum","difficulty":2,"accepted":404889,"submitted":467965,"acceptance":0.8652121419336917},{"id":1303,"title":"Find the Team Size","slug":"find-the-team-size","difficulty":1,"accepted":81488,"submitted":91021,"acceptance":0.8952659276430713},{"id":1304,"title":"Find N Unique Integers Sum up to Zero","slug":"find-n-unique-integers-sum-up-to-zero","difficulty":1,"accepted":397538,"submitted":506793,"acceptance":0.7844188850280095},{"id":1305,"title":"All Elements in Two Binary Search Trees","slug":"all-elements-in-two-binary-search-trees","difficulty":2,"accepted":261970,"submitted":326506,"acceptance":0.8023436016489743},{"id":1306,"title":"Jump Game III","slug":"jump-game-iii","difficulty":2,"accepted":298923,"submitted":447582,"acceptance":0.6678619783637412},{"id":1307,"title":"Verbal Arithmetic Puzzle","slug":"verbal-arithmetic-puzzle","difficulty":3,"accepted":17654,"submitted":50593,"acceptance":0.3489415531792936},{"id":1308,"title":"Running Total for Different Genders","slug":"running-total-for-different-genders","difficulty":2,"accepted":47318,"submitted":54978,"acceptance":0.8606715413438103},{"id":1309,"title":"Decrypt String from Alphabet to Integer Mapping","slug":"decrypt-string-from-alphabet-to-integer-mapping","difficulty":1,"accepted":149265,"submitted":185291,"acceptance":0.8055706969037891},{"id":1310,"title":"XOR Queries of a Subarray","slug":"xor-queries-of-a-subarray","difficulty":2,"accepted":217348,"submitted":278377,"acceptance":0.7807685261354207},{"id":1311,"title":"Get Watched Videos by Your Friends","slug":"get-watched-videos-by-your-friends","difficulty":2,"accepted":41279,"submitted":78485,"acceptance":0.5259476333057272},{"id":1312,"title":"Minimum Insertion Steps to Make a String Palindrome","slug":"minimum-insertion-steps-to-make-a-string-palindrome","difficulty":3,"accepted":307726,"submitted":416962,"acceptance":0.7380192919258829},{"id":1313,"title":"Decompress Run-Length Encoded List","slug":"decompress-run-length-encoded-list","difficulty":1,"accepted":306667,"submitted":355804,"acceptance":0.861898685793302},{"id":1314,"title":"Matrix Block Sum","slug":"matrix-block-sum","difficulty":2,"accepted":110714,"submitted":144812,"acceptance":0.7645360881694887},{"id":1315,"title":"Sum of Nodes with Even-Valued Grandparent","slug":"sum-of-nodes-with-even-valued-grandparent","difficulty":2,"accepted":184092,"submitted":214266,"acceptance":0.8591750441040575},{"id":1316,"title":"Distinct Echo Substrings","slug":"distinct-echo-substrings","difficulty":3,"accepted":22385,"submitted":42106,"acceptance":0.531634446397188},{"id":1317,"title":"Convert Integer to the Sum of Two No-Zero Integers","slug":"convert-integer-to-the-sum-of-two-no-zero-integers","difficulty":1,"accepted":208180,"submitted":352139,"acceptance":0.5911870028596662},{"id":1318,"title":"Minimum Flips to Make a OR b Equal to c","slug":"minimum-flips-to-make-a-or-b-equal-to-c","difficulty":2,"accepted":196879,"submitted":273715,"acceptance":0.7192846573991195},{"id":1319,"title":"Number of Operations to Make Network Connected","slug":"number-of-operations-to-make-network-connected","difficulty":2,"accepted":357648,"submitted":538964,"acceptance":0.6635842097060286},{"id":1320,"title":"Minimum Distance to Type a Word Using Two Fingers","slug":"minimum-distance-to-type-a-word-using-two-fingers","difficulty":3,"accepted":38210,"submitted":64231,"acceptance":0.5948840902368016},{"id":1321,"title":"Restaurant Growth","slug":"restaurant-growth","difficulty":2,"accepted":253521,"submitted":433371,"acceptance":0.5849976117460559},{"id":1322,"title":"Ads Performance","slug":"ads-performance","difficulty":1,"accepted":52858,"submitted":90139,"acceptance":0.58640544048636},{"id":1323,"title":"Maximum 69 Number","slug":"maximum-69-number","difficulty":1,"accepted":487907,"submitted":577120,"acceptance":0.8454168976989188},{"id":1324,"title":"Print Words Vertically","slug":"print-words-vertically","difficulty":2,"accepted":52290,"submitted":77517,"acceptance":0.6745617090444677},{"id":1325,"title":"Delete Leaves With a Given Value","slug":"delete-leaves-with-a-given-value","difficulty":2,"accepted":255962,"submitted":331372,"acceptance":0.7724309839093224},{"id":1326,"title":"Minimum Number of Taps to Open to Water a Garden","slug":"minimum-number-of-taps-to-open-to-water-a-garden","difficulty":3,"accepted":159750,"submitted":313327,"acceptance":0.5098507310254143},{"id":1327,"title":"List the Products Ordered in a Period","slug":"list-the-products-ordered-in-a-period","difficulty":1,"accepted":313504,"submitted":437274,"acceptance":0.7169509277935574},{"id":1328,"title":"Break a Palindrome","slug":"break-a-palindrome","difficulty":2,"accepted":196656,"submitted":381482,"acceptance":0.5155053187306348},{"id":1329,"title":"Sort the Matrix Diagonally","slug":"sort-the-matrix-diagonally","difficulty":2,"accepted":197029,"submitted":236896,"acceptance":0.8317109617722545},{"id":1330,"title":"Reverse Subarray To Maximize Array Value","slug":"reverse-subarray-to-maximize-array-value","difficulty":3,"accepted":8786,"submitted":19931,"acceptance":0.44082083186995136},{"id":1331,"title":"Rank Transform of an Array","slug":"rank-transform-of-an-array","difficulty":1,"accepted":320861,"submitted":452876,"acceptance":0.7084963654510286},{"id":1332,"title":"Remove Palindromic Subsequences","slug":"remove-palindromic-subsequences","difficulty":1,"accepted":153198,"submitted":198927,"acceptance":0.770121702936253},{"id":1333,"title":"Filter Restaurants by Vegan-Friendly, Price and Distance","slug":"filter-restaurants-by-vegan-friendly-price-and-distance","difficulty":2,"accepted":37530,"submitted":58524,"acceptance":0.6412753742054542},{"id":1334,"title":"Find the City With the Smallest Number of Neighbors at a Threshold Distance","slug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance","difficulty":2,"accepted":321212,"submitted":443234,"acceptance":0.724700722417504},{"id":1335,"title":"Minimum Difficulty of a Job Schedule","slug":"minimum-difficulty-of-a-job-schedule","difficulty":3,"accepted":227390,"submitted":380600,"acceptance":0.5974513925380978},{"id":1336,"title":"Number of Transactions per Visit","slug":"number-of-transactions-per-visit","difficulty":3,"accepted":15805,"submitted":32980,"acceptance":0.4792298362644027},{"id":1337,"title":"The K Weakest Rows in a Matrix","slug":"the-k-weakest-rows-in-a-matrix","difficulty":1,"accepted":421966,"submitted":567791,"acceptance":0.743171342976553},{"id":1338,"title":"Reduce Array Size to The Half","slug":"reduce-array-size-to-the-half","difficulty":2,"accepted":232346,"submitted":335002,"acceptance":0.6935660085611429},{"id":1339,"title":"Maximum Product of Splitted Binary Tree","slug":"maximum-product-of-splitted-binary-tree","difficulty":2,"accepted":257573,"submitted":462769,"acceptance":0.5565908693106064},{"id":1340,"title":"Jump Game V","slug":"jump-game-v","difficulty":3,"accepted":42429,"submitted":65389,"acceptance":0.6488706051476548},{"id":1341,"title":"Movie Rating","slug":"movie-rating","difficulty":2,"accepted":289468,"submitted":671632,"acceptance":0.4309919717940777},{"id":1342,"title":"Number of Steps to Reduce a Number to Zero","slug":"number-of-steps-to-reduce-a-number-to-zero","difficulty":1,"accepted":915654,"submitted":1067682,"acceptance":0.8576092881588339},{"id":1343,"title":"Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold","slug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold","difficulty":2,"accepted":192286,"submitted":264833,"acceptance":0.7260651051794905},{"id":1344,"title":"Angle Between Hands of a Clock","slug":"angle-between-hands-of-a-clock","difficulty":2,"accepted":143427,"submitted":222621,"acceptance":0.64426536580107},{"id":1345,"title":"Jump Game IV","slug":"jump-game-iv","difficulty":3,"accepted":163511,"submitted":353290,"acceptance":0.4628237425344618},{"id":1346,"title":"Check If N and Its Double Exist","slug":"check-if-n-and-its-double-exist","difficulty":1,"accepted":627740,"submitted":1504302,"acceptance":0.41729652689420077},{"id":1347,"title":"Minimum Number of Steps to Make Two Strings Anagram","slug":"minimum-number-of-steps-to-make-two-strings-anagram","difficulty":2,"accepted":335705,"submitted":407003,"acceptance":0.8248219300594836},{"id":1348,"title":"Tweet Counts Per Frequency","slug":"tweet-counts-per-frequency","difficulty":2,"accepted":39496,"submitted":85881,"acceptance":0.4598921763836006},{"id":1349,"title":"Maximum Students Taking Exam","slug":"maximum-students-taking-exam","difficulty":3,"accepted":23517,"submitted":43799,"acceptance":0.5369300668965045},{"id":1350,"title":"Students With Invalid Departments","slug":"students-with-invalid-departments","difficulty":1,"accepted":66560,"submitted":74187,"acceptance":0.8971922304446871},{"id":1351,"title":"Count Negative Numbers in a Sorted Matrix","slug":"count-negative-numbers-in-a-sorted-matrix","difficulty":1,"accepted":661014,"submitted":830715,"acceptance":0.7957169426337553},{"id":1352,"title":"Product of the Last K Numbers","slug":"product-of-the-last-k-numbers","difficulty":2,"accepted":261042,"submitted":414946,"acceptance":0.6290987260992996},{"id":1353,"title":"Maximum Number of Events That Can Be Attended","slug":"maximum-number-of-events-that-can-be-attended","difficulty":2,"accepted":226222,"submitted":580977,"acceptance":0.38938202372899444},{"id":1354,"title":"Construct Target Array With Multiple Sums","slug":"construct-target-array-with-multiple-sums","difficulty":3,"accepted":83636,"submitted":226774,"acceptance":0.36880771164242815},{"id":1355,"title":"Activity Participants","slug":"activity-participants","difficulty":2,"accepted":35453,"submitted":49239,"acceptance":0.7200186843762059},{"id":1356,"title":"Sort Integers by The Number of 1 Bits","slug":"sort-integers-by-the-number-of-1-bits","difficulty":1,"accepted":393989,"submitted":478704,"acceptance":0.8230326046993549},{"id":1357,"title":"Apply Discount Every n Orders","slug":"apply-discount-every-n-orders","difficulty":2,"accepted":29620,"submitted":45217,"acceptance":0.6550633611252406},{"id":1358,"title":"Number of Substrings Containing All Three Characters","slug":"number-of-substrings-containing-all-three-characters","difficulty":2,"accepted":448051,"submitted":608556,"acceptance":0.736252703120173},{"id":1359,"title":"Count All Valid Pickup and Delivery Options","slug":"count-all-valid-pickup-and-delivery-options","difficulty":3,"accepted":134390,"submitted":207219,"acceptance":0.6485409156496267},{"id":1360,"title":"Number of Days Between Two Dates","slug":"number-of-days-between-two-dates","difficulty":1,"accepted":73589,"submitted":140074,"acceptance":0.5253580250439054},{"id":1361,"title":"Validate Binary Tree Nodes","slug":"validate-binary-tree-nodes","difficulty":2,"accepted":135482,"submitted":307276,"acceptance":0.44091305536390735},{"id":1362,"title":"Closest Divisors","slug":"closest-divisors","difficulty":2,"accepted":28879,"submitted":46501,"acceptance":0.621040407733167},{"id":1363,"title":"Largest Multiple of Three","slug":"largest-multiple-of-three","difficulty":3,"accepted":26336,"submitted":79280,"acceptance":0.33218970736629666},{"id":1364,"title":"Number of Trusted Contacts of a Customer","slug":"number-of-trusted-contacts-of-a-customer","difficulty":2,"accepted":25008,"submitted":33488,"acceptance":0.7467749641662685},{"id":1365,"title":"How Many Numbers Are Smaller Than the Current Number","slug":"how-many-numbers-are-smaller-than-the-current-number","difficulty":1,"accepted":874780,"submitted":1000486,"acceptance":0.8743550634391686},{"id":1366,"title":"Rank Teams by Votes","slug":"rank-teams-by-votes","difficulty":2,"accepted":102284,"submitted":170277,"acceptance":0.6006918139267194},{"id":1367,"title":"Linked List in Binary Tree","slug":"linked-list-in-binary-tree","difficulty":2,"accepted":209037,"submitted":402359,"acceptance":0.5195285801982806},{"id":1368,"title":"Minimum Cost to Make at Least One Valid Path in a Grid","slug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid","difficulty":3,"accepted":166199,"submitted":234289,"acceptance":0.7093760270435232},{"id":1369,"title":"Get the Second Most Recent Activity","slug":"get-the-second-most-recent-activity","difficulty":3,"accepted":26336,"submitted":39103,"acceptance":0.6735033117663607},{"id":1370,"title":"Increasing Decreasing String","slug":"increasing-decreasing-string","difficulty":1,"accepted":98923,"submitted":128066,"acceptance":0.7724376493370606},{"id":1371,"title":"Find the Longest Substring Containing Vowels in Even Counts","slug":"find-the-longest-substring-containing-vowels-in-even-counts","difficulty":2,"accepted":141102,"submitted":186565,"acceptance":0.7563154932597218},{"id":1372,"title":"Longest ZigZag Path in a Binary Tree","slug":"longest-zigzag-path-in-a-binary-tree","difficulty":2,"accepted":283203,"submitted":422407,"acceptance":0.6704505370412895},{"id":1373,"title":"Maximum Sum BST in Binary Tree","slug":"maximum-sum-bst-in-binary-tree","difficulty":3,"accepted":126522,"submitted":269461,"acceptance":0.4695373356441192},{"id":1374,"title":"Generate a String With Characters That Have Odd Counts","slug":"generate-a-string-with-characters-that-have-odd-counts","difficulty":1,"accepted":114114,"submitted":145394,"acceptance":0.7848604481615472},{"id":1375,"title":"Number of Times Binary String Is Prefix-Aligned","slug":"number-of-times-binary-string-is-prefix-aligned","difficulty":2,"accepted":60127,"submitted":91069,"acceptance":0.6602356454995663},{"id":1376,"title":"Time Needed to Inform All Employees","slug":"time-needed-to-inform-all-employees","difficulty":2,"accepted":258375,"submitted":427357,"acceptance":0.6045882014334619},{"id":1377,"title":"Frog Position After T Seconds","slug":"frog-position-after-t-seconds","difficulty":3,"accepted":43268,"submitted":112979,"acceptance":0.3829738269943972},{"id":1378,"title":"Replace Employee ID With The Unique Identifier","slug":"replace-employee-id-with-the-unique-identifier","difficulty":1,"accepted":1308874,"submitted":1566793,"acceptance":0.8353841254077596},{"id":1379,"title":"Find a Corresponding Node of a Binary Tree in a Clone of That Tree","slug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree","difficulty":1,"accepted":264966,"submitted":308666,"acceptance":0.8584230203520958},{"id":1380,"title":"Lucky Numbers in a Matrix","slug":"lucky-numbers-in-a-matrix","difficulty":1,"accepted":295318,"submitted":369338,"acceptance":0.7995873698346772},{"id":1381,"title":"Design a Stack With Increment Operation","slug":"design-a-stack-with-increment-operation","difficulty":2,"accepted":261001,"submitted":326560,"acceptance":0.7992436305732484},{"id":1382,"title":"Balance a Binary Search Tree","slug":"balance-a-binary-search-tree","difficulty":2,"accepted":402994,"submitted":467018,"acceptance":0.8629089242812911},{"id":1383,"title":"Maximum Performance of a Team","slug":"maximum-performance-of-a-team","difficulty":3,"accepted":109979,"submitted":230371,"acceptance":0.47739949906889323},{"id":1384,"title":"Total Sales Amount by Year","slug":"total-sales-amount-by-year","difficulty":3,"accepted":19967,"submitted":32555,"acceptance":0.6133312855168177},{"id":1385,"title":"Find the Distance Value Between Two Arrays","slug":"find-the-distance-value-between-two-arrays","difficulty":1,"accepted":147134,"submitted":205557,"acceptance":0.7157819972075872},{"id":1386,"title":"Cinema Seat Allocation","slug":"cinema-seat-allocation","difficulty":2,"accepted":64984,"submitted":146552,"acceptance":0.4434194006223047},{"id":1387,"title":"Sort Integers by The Power Value","slug":"sort-integers-by-the-power-value","difficulty":2,"accepted":121893,"submitted":170136,"acceptance":0.716444491465651},{"id":1388,"title":"Pizza With 3n Slices","slug":"pizza-with-3n-slices","difficulty":3,"accepted":37758,"submitted":70144,"acceptance":0.5382926551094891},{"id":1389,"title":"Create Target Array in the Given Order","slug":"create-target-array-in-the-given-order","difficulty":1,"accepted":314947,"submitted":364272,"acceptance":0.8645929415381912},{"id":1390,"title":"Four Divisors","slug":"four-divisors","difficulty":2,"accepted":195608,"submitted":345501,"acceptance":0.5661575509188107},{"id":1391,"title":"Check if There is a Valid Path in a Grid","slug":"check-if-there-is-a-valid-path-in-a-grid","difficulty":2,"accepted":37807,"submitted":75234,"acceptance":0.5025254539171119},{"id":1392,"title":"Longest Happy Prefix","slug":"longest-happy-prefix","difficulty":3,"accepted":98561,"submitted":187414,"acceptance":0.5258998794113566},{"id":1393,"title":"Capital Gain/Loss","slug":"capital-gainloss","difficulty":2,"accepted":167207,"submitted":197551,"acceptance":0.8463991576858634},{"id":1394,"title":"Find Lucky Integer in an Array","slug":"find-lucky-integer-in-an-array","difficulty":1,"accepted":337501,"submitted":446998,"acceptance":0.755039172434776},{"id":1395,"title":"Count Number of Teams","slug":"count-number-of-teams","difficulty":2,"accepted":243816,"submitted":347532,"acceptance":0.7015641725078554},{"id":1396,"title":"Design Underground System","slug":"design-underground-system","difficulty":2,"accepted":270539,"submitted":363282,"acceptance":0.7447079679147329},{"id":1397,"title":"Find All Good Strings","slug":"find-all-good-strings","difficulty":3,"accepted":9461,"submitted":20911,"acceptance":0.4524412988379322},{"id":1398,"title":"Customers Who Bought Products A and B but Not C","slug":"customers-who-bought-products-a-and-b-but-not-c","difficulty":2,"accepted":68831,"submitted":96289,"acceptance":0.7148376242353748},{"id":1399,"title":"Count Largest Group","slug":"count-largest-group","difficulty":1,"accepted":184987,"submitted":247611,"acceptance":0.7470871649482455},{"id":1400,"title":"Construct K Palindrome Strings","slug":"construct-k-palindrome-strings","difficulty":2,"accepted":210358,"submitted":306871,"acceptance":0.6854932528652105},{"id":1401,"title":"Circle and Rectangle Overlapping","slug":"circle-and-rectangle-overlapping","difficulty":2,"accepted":24234,"submitted":48522,"acceptance":0.499443551378756},{"id":1402,"title":"Reducing Dishes","slug":"reducing-dishes","difficulty":3,"accepted":185441,"submitted":241769,"acceptance":0.7670172768220905},{"id":1403,"title":"Minimum Subsequence in Non-Increasing Order","slug":"minimum-subsequence-in-non-increasing-order","difficulty":1,"accepted":91639,"submitted":124392,"acceptance":0.736695285870474},{"id":1404,"title":"Number of Steps to Reduce a Number in Binary Representation to One","slug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one","difficulty":2,"accepted":267116,"submitted":419103,"acceptance":0.6373516772726514},{"id":1405,"title":"Longest Happy String","slug":"longest-happy-string","difficulty":2,"accepted":218544,"submitted":333715,"acceptance":0.6548821599268837},{"id":1406,"title":"Stone Game III","slug":"stone-game-iii","difficulty":3,"accepted":110983,"submitted":175335,"acceptance":0.6329768728434141},{"id":1407,"title":"Top Travellers","slug":"top-travellers","difficulty":1,"accepted":211125,"submitted":368988,"acceptance":0.5721730787993106},{"id":1408,"title":"String Matching in an Array","slug":"string-matching-in-an-array","difficulty":1,"accepted":293287,"submitted":420413,"acceptance":0.6976163915007385},{"id":1409,"title":"Queries on a Permutation With Key","slug":"queries-on-a-permutation-with-key","difficulty":2,"accepted":59148,"submitted":69742,"acceptance":0.8480972728054831},{"id":1410,"title":"HTML Entity Parser","slug":"html-entity-parser","difficulty":2,"accepted":31688,"submitted":63175,"acceptance":0.5015908191531461},{"id":1411,"title":"Number of Ways to Paint N × 3 Grid","slug":"number-of-ways-to-paint-n-3-grid","difficulty":3,"accepted":134133,"submitted":166556,"acceptance":0.8053327409399842},{"id":1412,"title":"Find the Quiet Students in All Exams","slug":"find-the-quiet-students-in-all-exams","difficulty":3,"accepted":35301,"submitted":60785,"acceptance":0.5807518302212717},{"id":1413,"title":"Minimum Value to Get Positive Step by Step Sum","slug":"minimum-value-to-get-positive-step-by-step-sum","difficulty":1,"accepted":228184,"submitted":352907,"acceptance":0.6465839442119312},{"id":1414,"title":"Find the Minimum Number of Fibonacci Numbers Whose Sum Is K","slug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k","difficulty":2,"accepted":52325,"submitted":80661,"acceptance":0.6487025948103793},{"id":1415,"title":"The k-th Lexicographical String of All Happy Strings of Length n","slug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n","difficulty":2,"accepted":273858,"submitted":314367,"acceptance":0.8711410548817147},{"id":1416,"title":"Restore The Array","slug":"restore-the-array","difficulty":3,"accepted":67927,"submitted":145266,"acceptance":0.4676042570181598},{"id":1417,"title":"Reformat The String","slug":"reformat-the-string","difficulty":1,"accepted":72036,"submitted":138154,"acceptance":0.5214181275967399},{"id":1418,"title":"Display Table of Food Orders in a Restaurant","slug":"display-table-of-food-orders-in-a-restaurant","difficulty":2,"accepted":37401,"submitted":48958,"acceptance":0.7639405204460966},{"id":1419,"title":"Minimum Number of Frogs Croaking","slug":"minimum-number-of-frogs-croaking","difficulty":2,"accepted":63310,"submitted":123817,"acceptance":0.511319124191347},{"id":1420,"title":"Build Array Where You Can Find The Maximum Exactly K Comparisons","slug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons","difficulty":3,"accepted":72773,"submitted":110645,"acceptance":0.6577161191197072},{"id":1421,"title":"NPV Queries","slug":"npv-queries","difficulty":1,"accepted":31523,"submitted":38043,"acceptance":0.8286149883027101},{"id":1422,"title":"Maximum Score After Splitting a String","slug":"maximum-score-after-splitting-a-string","difficulty":1,"accepted":372187,"submitted":572195,"acceptance":0.6504548274626657},{"id":1423,"title":"Maximum Points You Can Obtain from Cards","slug":"maximum-points-you-can-obtain-from-cards","difficulty":2,"accepted":513014,"submitted":892547,"acceptance":0.5747753339600044},{"id":1424,"title":"Diagonal Traverse II","slug":"diagonal-traverse-ii","difficulty":2,"accepted":178511,"submitted":306112,"acceptance":0.5831558383859502},{"id":1425,"title":"Constrained Subsequence Sum","slug":"constrained-subsequence-sum","difficulty":3,"accepted":91831,"submitted":162858,"acceptance":0.563871593658279},{"id":1426,"title":"Counting Elements","slug":"counting-elements","difficulty":1,"accepted":167458,"submitted":275496,"acceptance":0.6078418561431019},{"id":1427,"title":"Perform String Shifts","slug":"perform-string-shifts","difficulty":1,"accepted":93875,"submitted":167711,"acceptance":0.5597426525391894},{"id":1428,"title":"Leftmost Column with at Least a One","slug":"leftmost-column-with-at-least-a-one","difficulty":2,"accepted":197570,"submitted":358258,"acceptance":0.5514740773409107},{"id":1429,"title":"First Unique Number","slug":"first-unique-number","difficulty":2,"accepted":112407,"submitted":196234,"acceptance":0.5728212236411631},{"id":1430,"title":"Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree","slug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree","difficulty":2,"accepted":46457,"submitted":97825,"acceptance":0.47489905443393815},{"id":1431,"title":"Kids With the Greatest Number of Candies","slug":"kids-with-the-greatest-number-of-candies","difficulty":1,"accepted":1493181,"submitted":1696161,"acceptance":0.8803297564323198},{"id":1432,"title":"Max Difference You Can Get From Changing an Integer","slug":"max-difference-you-can-get-from-changing-an-integer","difficulty":2,"accepted":112829,"submitted":231379,"acceptance":0.48763716672645313},{"id":1433,"title":"Check If a String Can Break Another String","slug":"check-if-a-string-can-break-another-string","difficulty":2,"accepted":53586,"submitted":75565,"acceptance":0.7091378283596903},{"id":1434,"title":"Number of Ways to Wear Different Hats to Each Other","slug":"number-of-ways-to-wear-different-hats-to-each-other","difficulty":3,"accepted":22276,"submitted":48587,"acceptance":0.45847654722456627},{"id":1435,"title":"Create a Session Bar Chart","slug":"create-a-session-bar-chart","difficulty":1,"accepted":27336,"submitted":36743,"acceptance":0.7439784448738536},{"id":1436,"title":"Destination City","slug":"destination-city","difficulty":1,"accepted":325804,"submitted":409812,"acceptance":0.7950084428957669},{"id":1437,"title":"Check If All 1's Are at Least Length K Places Away","slug":"check-if-all-1s-are-at-least-length-k-places-away","difficulty":1,"accepted":214013,"submitted":332993,"acceptance":0.6426951917908185},{"id":1438,"title":"Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit","slug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit","difficulty":2,"accepted":311704,"submitted":541748,"acceptance":0.5753671448717854},{"id":1439,"title":"Find the Kth Smallest Sum of a Matrix With Sorted Rows","slug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows","difficulty":3,"accepted":43468,"submitted":69773,"acceptance":0.622991701661101},{"id":1440,"title":"Evaluate Boolean Expression","slug":"evaluate-boolean-expression","difficulty":2,"accepted":38709,"submitted":53985,"acceptance":0.7170325090302861},{"id":1441,"title":"Build an Array With Stack Operations","slug":"build-an-array-with-stack-operations","difficulty":2,"accepted":259199,"submitted":320133,"acceptance":0.8096603599129112},{"id":1442,"title":"Count Triplets That Can Form Two Arrays of Equal XOR","slug":"count-triplets-that-can-form-two-arrays-of-equal-xor","difficulty":2,"accepted":141895,"submitted":167386,"acceptance":0.8477112781236185},{"id":1443,"title":"Minimum Time to Collect All Apples in a Tree","slug":"minimum-time-to-collect-all-apples-in-a-tree","difficulty":2,"accepted":155379,"submitted":244254,"acceptance":0.6361369721683166},{"id":1444,"title":"Number of Ways of Cutting a Pizza","slug":"number-of-ways-of-cutting-a-pizza","difficulty":3,"accepted":76384,"submitted":124015,"acceptance":0.6159254928839253},{"id":1445,"title":"Apples & Oranges","slug":"apples-oranges","difficulty":2,"accepted":65966,"submitted":76685,"acceptance":0.8602203820825455},{"id":1446,"title":"Consecutive Characters","slug":"consecutive-characters","difficulty":1,"accepted":229093,"submitted":379673,"acceptance":0.603395553542127},{"id":1447,"title":"Simplified Fractions","slug":"simplified-fractions","difficulty":2,"accepted":45187,"submitted":64846,"acceptance":0.6968355796810906},{"id":1448,"title":"Count Good Nodes in Binary Tree","slug":"count-good-nodes-in-binary-tree","difficulty":2,"accepted":869715,"submitted":1178372,"acceptance":0.7380648895255488},{"id":1449,"title":"Form Largest Integer With Digits That Add up to Target","slug":"form-largest-integer-with-digits-that-add-up-to-target","difficulty":3,"accepted":23232,"submitted":46845,"acceptance":0.4959333973743196},{"id":1450,"title":"Number of Students Doing Homework at a Given Time","slug":"number-of-students-doing-homework-at-a-given-time","difficulty":1,"accepted":150155,"submitted":198035,"acceptance":0.7582245562653066},{"id":1451,"title":"Rearrange Words in a Sentence","slug":"rearrange-words-in-a-sentence","difficulty":2,"accepted":64396,"submitted":96179,"acceptance":0.6695432474864575},{"id":1452,"title":"People Whose List of Favorite Companies Is Not a Subset of Another List","slug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list","difficulty":2,"accepted":35309,"submitted":58287,"acceptance":0.6057783039099628},{"id":1453,"title":"Maximum Number of Darts Inside of a Circular Dartboard","slug":"maximum-number-of-darts-inside-of-a-circular-dartboard","difficulty":3,"accepted":8682,"submitted":21424,"acceptance":0.4052464525765497},{"id":1454,"title":"Active Users","slug":"active-users","difficulty":2,"accepted":47300,"submitted":129320,"acceptance":0.3657593566347046},{"id":1455,"title":"Check If a Word Occurs As a Prefix of Any Word in a Sentence","slug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence","difficulty":1,"accepted":237788,"submitted":345812,"acceptance":0.6876221762113518},{"id":1456,"title":"Maximum Number of Vowels in a Substring of Given Length","slug":"maximum-number-of-vowels-in-a-substring-of-given-length","difficulty":2,"accepted":680116,"submitted":1101035,"acceptance":0.6177060674728778},{"id":1457,"title":"Pseudo-Palindromic Paths in a Binary Tree","slug":"pseudo-palindromic-paths-in-a-binary-tree","difficulty":2,"accepted":236401,"submitted":345766,"acceptance":0.6837022726352504},{"id":1458,"title":"Max Dot Product of Two Subsequences","slug":"max-dot-product-of-two-subsequences","difficulty":3,"accepted":185485,"submitted":267452,"acceptance":0.6935263150023182},{"id":1459,"title":"Rectangles Area","slug":"rectangles-area","difficulty":2,"accepted":20147,"submitted":29289,"acceptance":0.6878691658984601},{"id":1460,"title":"Make Two Arrays Equal by Reversing Subarrays","slug":"make-two-arrays-equal-by-reversing-subarrays","difficulty":1,"accepted":333056,"submitted":439374,"acceptance":0.7580239158439052},{"id":1461,"title":"Check If a String Contains All Binary Codes of Size K","slug":"check-if-a-string-contains-all-binary-codes-of-size-k","difficulty":2,"accepted":263036,"submitted":427405,"acceptance":0.6154256501444766},{"id":1462,"title":"Course Schedule IV","slug":"course-schedule-iv","difficulty":2,"accepted":203621,"submitted":340475,"acceptance":0.598049783390851},{"id":1463,"title":"Cherry Pickup II","slug":"cherry-pickup-ii","difficulty":3,"accepted":233646,"submitted":322974,"acceptance":0.7234204610897471},{"id":1464,"title":"Maximum Product of Two Elements in an Array","slug":"maximum-product-of-two-elements-in-an-array","difficulty":1,"accepted":491623,"submitted":588209,"acceptance":0.8357964601017666},{"id":1465,"title":"Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts","slug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts","difficulty":2,"accepted":176302,"submitted":425705,"acceptance":0.41414124804735675},{"id":1466,"title":"Reorder Routes to Make All Paths Lead to the City Zero","slug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero","difficulty":2,"accepted":316666,"submitted":481873,"acceptance":0.6571565536977585},{"id":1467,"title":"Probability of a Two Boxes Having The Same Number of Distinct Balls","slug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls","difficulty":3,"accepted":11797,"submitted":19333,"acceptance":0.6102001758651011},{"id":1468,"title":"Calculate Salaries","slug":"calculate-salaries","difficulty":2,"accepted":29184,"submitted":37759,"acceptance":0.7729018247305278},{"id":1469,"title":"Find All The Lonely Nodes","slug":"find-all-the-lonely-nodes","difficulty":1,"accepted":61472,"submitted":73075,"acceptance":0.841217926787547},{"id":1470,"title":"Shuffle the Array","slug":"shuffle-the-array","difficulty":1,"accepted":1061441,"submitted":1193925,"acceptance":0.8890349058776724},{"id":1471,"title":"The k Strongest Values in an Array","slug":"the-k-strongest-values-in-an-array","difficulty":2,"accepted":47221,"submitted":75397,"acceptance":0.6262981285727549},{"id":1472,"title":"Design Browser History","slug":"design-browser-history","difficulty":2,"accepted":339669,"submitted":433822,"acceptance":0.7829685908045235},{"id":1473,"title":"Paint House III","slug":"paint-house-iii","difficulty":3,"accepted":72558,"submitted":118562,"acceptance":0.6119836035154602},{"id":1474,"title":"Delete N Nodes After M Nodes of a Linked List","slug":"delete-n-nodes-after-m-nodes-of-a-linked-list","difficulty":1,"accepted":41911,"submitted":56306,"acceptance":0.7443434092281462},{"id":1475,"title":"Final Prices With a Special Discount in a Shop","slug":"final-prices-with-a-special-discount-in-a-shop","difficulty":1,"accepted":405245,"submitted":481826,"acceptance":0.8410608808989137},{"id":1476,"title":"Subrectangle Queries","slug":"subrectangle-queries","difficulty":2,"accepted":128285,"submitted":148609,"acceptance":0.8632384310506093},{"id":1477,"title":"Find Two Non-overlapping Sub-arrays Each With Target Sum","slug":"find-two-non-overlapping-sub-arrays-each-with-target-sum","difficulty":2,"accepted":55234,"submitted":150086,"acceptance":0.3680156710152846},{"id":1478,"title":"Allocate Mailboxes","slug":"allocate-mailboxes","difficulty":3,"accepted":33805,"submitted":59827,"acceptance":0.5650458822939476},{"id":1479,"title":"Sales by Day of the Week","slug":"sales-by-day-of-the-week","difficulty":3,"accepted":21330,"submitted":27947,"acceptance":0.7632304004007586},{"id":1480,"title":"Running Sum of 1d Array","slug":"running-sum-of-1d-array","difficulty":1,"accepted":2371123,"submitted":2727682,"acceptance":0.8692813165171014},{"id":1481,"title":"Least Number of Unique Integers after K Removals","slug":"least-number-of-unique-integers-after-k-removals","difficulty":2,"accepted":282074,"submitted":442229,"acceptance":0.6378460028627702},{"id":1482,"title":"Minimum Number of Days to Make m Bouquets","slug":"minimum-number-of-days-to-make-m-bouquets","difficulty":2,"accepted":506106,"submitted":897453,"acceptance":0.5639359387065395},{"id":1483,"title":"Kth Ancestor of a Tree Node","slug":"kth-ancestor-of-a-tree-node","difficulty":3,"accepted":51871,"submitted":138725,"acceptance":0.3739124166516489},{"id":1484,"title":"Group Sold Products By The Date","slug":"group-sold-products-by-the-date","difficulty":1,"accepted":406650,"submitted":522116,"acceptance":0.7788499107478032},{"id":1485,"title":"Clone Binary Tree With Random Pointer","slug":"clone-binary-tree-with-random-pointer","difficulty":2,"accepted":35986,"submitted":44485,"acceptance":0.8089468360121389},{"id":1486,"title":"XOR Operation in an Array","slug":"xor-operation-in-an-array","difficulty":1,"accepted":267771,"submitted":305967,"acceptance":0.8751630077753483},{"id":1487,"title":"Making File Names Unique","slug":"making-file-names-unique","difficulty":2,"accepted":39612,"submitted":102784,"acceptance":0.38539072229140725},{"id":1488,"title":"Avoid Flood in The City","slug":"avoid-flood-in-the-city","difficulty":2,"accepted":133754,"submitted":343139,"acceptance":0.38979538904059285},{"id":1489,"title":"Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree","slug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree","difficulty":3,"accepted":72909,"submitted":109792,"acceptance":0.664064777032935},{"id":1490,"title":"Clone N-ary Tree","slug":"clone-n-ary-tree","difficulty":2,"accepted":34355,"submitted":41358,"acceptance":0.8306736302529136},{"id":1491,"title":"Average Salary Excluding the Minimum and Maximum Salary","slug":"average-salary-excluding-the-minimum-and-maximum-salary","difficulty":1,"accepted":392702,"submitted":618004,"acceptance":0.6354360165953619},{"id":1492,"title":"The kth Factor of n","slug":"the-kth-factor-of-n","difficulty":2,"accepted":351834,"submitted":500652,"acceptance":0.7027516118980849},{"id":1493,"title":"Longest Subarray of 1's After Deleting One Element","slug":"longest-subarray-of-1s-after-deleting-one-element","difficulty":2,"accepted":637237,"submitted":895829,"acceptance":0.7113377664710564},{"id":1494,"title":"Parallel Courses II","slug":"parallel-courses-ii","difficulty":3,"accepted":26791,"submitted":86974,"acceptance":0.30803458504840525},{"id":1495,"title":"Friendly Movies Streamed Last Month","slug":"friendly-movies-streamed-last-month","difficulty":1,"accepted":40410,"submitted":82644,"acceptance":0.4889647161318426},{"id":1496,"title":"Path Crossing","slug":"path-crossing","difficulty":1,"accepted":195789,"submitted":312791,"acceptance":0.6259419228814128},{"id":1497,"title":"Check If Array Pairs Are Divisible by k","slug":"check-if-array-pairs-are-divisible-by-k","difficulty":2,"accepted":207848,"submitted":450331,"acceptance":0.4615449524905014},{"id":1498,"title":"Number of Subsequences That Satisfy the Given Sum Condition","slug":"number-of-subsequences-that-satisfy-the-given-sum-condition","difficulty":2,"accepted":249928,"submitted":507918,"acceptance":0.4920636795703243},{"id":1499,"title":"Max Value of Equation","slug":"max-value-of-equation","difficulty":3,"accepted":55498,"submitted":123365,"acceptance":0.44986827706399707},{"id":1500,"title":"Design a File Sharing System","slug":"design-a-file-sharing-system","difficulty":2,"accepted":6726,"submitted":16116,"acceptance":0.41734921816827997},{"id":1501,"title":"Countries You Can Safely Invest In","slug":"countries-you-can-safely-invest-in","difficulty":2,"accepted":49609,"submitted":97844,"acceptance":0.507021380973795},{"id":1502,"title":"Can Make Arithmetic Progression From Sequence","slug":"can-make-arithmetic-progression-from-sequence","difficulty":1,"accepted":337192,"submitted":488278,"acceptance":0.6905738124592957},{"id":1503,"title":"Last Moment Before All Ants Fall Out of a Plank","slug":"last-moment-before-all-ants-fall-out-of-a-plank","difficulty":2,"accepted":99242,"submitted":145581,"acceptance":0.6816961004526689},{"id":1504,"title":"Count Submatrices With All Ones","slug":"count-submatrices-with-all-ones","difficulty":2,"accepted":148248,"submitted":208709,"acceptance":0.7103095697837659},{"id":1505,"title":"Minimum Possible Integer After at Most K Adjacent Swaps On Digits","slug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits","difficulty":3,"accepted":12879,"submitted":31259,"acceptance":0.4120093413097028},{"id":1506,"title":"Find Root of N-Ary Tree","slug":"find-root-of-n-ary-tree","difficulty":2,"accepted":41354,"submitted":52645,"acceptance":0.7855256909488081},{"id":1507,"title":"Reformat Date","slug":"reformat-date","difficulty":1,"accepted":96657,"submitted":141362,"acceptance":0.6837551817320072},{"id":1508,"title":"Range Sum of Sorted Subarray Sums","slug":"range-sum-of-sorted-subarray-sums","difficulty":2,"accepted":186525,"submitted":295778,"acceptance":0.6306249957738574},{"id":1509,"title":"Minimum Difference Between Largest and Smallest Value in Three Moves","slug":"minimum-difference-between-largest-and-smallest-value-in-three-moves","difficulty":2,"accepted":250991,"submitted":423932,"acceptance":0.5920548578545616},{"id":1510,"title":"Stone Game IV","slug":"stone-game-iv","difficulty":3,"accepted":83212,"submitted":139709,"acceptance":0.5956094453471144},{"id":1511,"title":"Customer Order Frequency","slug":"customer-order-frequency","difficulty":1,"accepted":52874,"submitted":79607,"acceptance":0.6641878226789102},{"id":1512,"title":"Number of Good Pairs","slug":"number-of-good-pairs","difficulty":1,"accepted":1047565,"submitted":1166490,"acceptance":0.8980488473968915},{"id":1513,"title":"Number of Substrings With Only 1s","slug":"number-of-substrings-with-only-1s","difficulty":2,"accepted":159613,"submitted":278127,"acceptance":0.5738853113865249},{"id":1514,"title":"Path with Maximum Probability","slug":"path-with-maximum-probability","difficulty":2,"accepted":371630,"submitted":567332,"acceptance":0.6550485430048014},{"id":1515,"title":"Best Position for a Service Centre","slug":"best-position-for-a-service-centre","difficulty":3,"accepted":19348,"submitted":55045,"acceptance":0.3514942319920065},{"id":1516,"title":"Move Sub-Tree of N-Ary Tree","slug":"move-sub-tree-of-n-ary-tree","difficulty":3,"accepted":2690,"submitted":4510,"acceptance":0.5964523281596452},{"id":1517,"title":"Find Users With Valid E-Mails","slug":"find-users-with-valid-e-mails","difficulty":1,"accepted":287199,"submitted":791457,"acceptance":0.3628737884686092},{"id":1518,"title":"Water Bottles","slug":"water-bottles","difficulty":1,"accepted":438007,"submitted":603638,"acceptance":0.7256120390035087},{"id":1519,"title":"Number of Nodes in the Sub-Tree With the Same Label","slug":"number-of-nodes-in-the-sub-tree-with-the-same-label","difficulty":2,"accepted":94271,"submitted":170189,"acceptance":0.5539194660054411},{"id":1520,"title":"Maximum Number of Non-Overlapping Substrings","slug":"maximum-number-of-non-overlapping-substrings","difficulty":3,"accepted":24751,"submitted":59089,"acceptance":0.41887660985970315},{"id":1521,"title":"Find a Value of a Mysterious Function Closest to Target","slug":"find-a-value-of-a-mysterious-function-closest-to-target","difficulty":3,"accepted":14001,"submitted":29712,"acceptance":0.4712237479806139},{"id":1522,"title":"Diameter of N-Ary Tree","slug":"diameter-of-n-ary-tree","difficulty":2,"accepted":61925,"submitted":82089,"acceptance":0.7543641657225694},{"id":1523,"title":"Count Odd Numbers in an Interval Range","slug":"count-odd-numbers-in-an-interval-range","difficulty":1,"accepted":549254,"submitted":1008556,"acceptance":0.5445944498867689},{"id":1524,"title":"Number of Sub-arrays With Odd Sum","slug":"number-of-sub-arrays-with-odd-sum","difficulty":2,"accepted":175988,"submitted":315918,"acceptance":0.5570686064105242},{"id":1525,"title":"Number of Good Ways to Split a String","slug":"number-of-good-ways-to-split-a-string","difficulty":2,"accepted":124316,"submitted":181679,"acceptance":0.6842618024097447},{"id":1526,"title":"Minimum Number of Increments on Subarrays to Form a Target Array","slug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array","difficulty":3,"accepted":154039,"submitted":197098,"acceptance":0.7815350739226172},{"id":1527,"title":"Patients With a Condition","slug":"patients-with-a-condition","difficulty":1,"accepted":441264,"submitted":1136255,"acceptance":0.3883494462070574},{"id":1528,"title":"Shuffle String","slug":"shuffle-string","difficulty":1,"accepted":494382,"submitted":579041,"acceptance":0.8537944636044771},{"id":1529,"title":"Minimum Suffix Flips","slug":"minimum-suffix-flips","difficulty":2,"accepted":66835,"submitted":90474,"acceptance":0.7387205163914494},{"id":1530,"title":"Number of Good Leaf Nodes Pairs","slug":"number-of-good-leaf-nodes-pairs","difficulty":2,"accepted":161651,"submitted":225215,"acceptance":0.7177630264414004},{"id":1531,"title":"String Compression II","slug":"string-compression-ii","difficulty":3,"accepted":105904,"submitted":202938,"acceptance":0.5218539652504706},{"id":1532,"title":"The Most Recent Three Orders","slug":"the-most-recent-three-orders","difficulty":2,"accepted":39008,"submitted":56434,"acceptance":0.6912145160718716},{"id":1533,"title":"Find the Index of the Large Integer","slug":"find-the-index-of-the-large-integer","difficulty":2,"accepted":18136,"submitted":32093,"acceptance":0.5651076558751129},{"id":1534,"title":"Count Good Triplets","slug":"count-good-triplets","difficulty":1,"accepted":287330,"submitted":335980,"acceptance":0.8551997142687064},{"id":1535,"title":"Find the Winner of an Array Game","slug":"find-the-winner-of-an-array-game","difficulty":2,"accepted":126204,"submitted":222106,"acceptance":0.568215176537329},{"id":1536,"title":"Minimum Swaps to Arrange a Binary Grid","slug":"minimum-swaps-to-arrange-a-binary-grid","difficulty":2,"accepted":104352,"submitted":148812,"acceptance":0.7012337714700427},{"id":1537,"title":"Get the Maximum Score","slug":"get-the-maximum-score","difficulty":3,"accepted":36231,"submitted":88407,"acceptance":0.40982048932776816},{"id":1538,"title":"Guess the Majority in a Hidden Array","slug":"guess-the-majority-in-a-hidden-array","difficulty":2,"accepted":5177,"submitted":7521,"acceptance":0.6883393165802419},{"id":1539,"title":"Kth Missing Positive Number","slug":"kth-missing-positive-number","difficulty":1,"accepted":829404,"submitted":1309032,"acceptance":0.6336010120455421},{"id":1540,"title":"Can Convert String in K Moves","slug":"can-convert-string-in-k-moves","difficulty":2,"accepted":26441,"submitted":70312,"acceptance":0.376052451928547},{"id":1541,"title":"Minimum Insertions to Balance a Parentheses String","slug":"minimum-insertions-to-balance-a-parentheses-string","difficulty":2,"accepted":82858,"submitted":154947,"acceptance":0.5347505921379568},{"id":1542,"title":"Find Longest Awesome Substring","slug":"find-longest-awesome-substring","difficulty":3,"accepted":20403,"submitted":43696,"acceptance":0.46693061149761994},{"id":1543,"title":"Fix Product Name Format","slug":"fix-product-name-format","difficulty":1,"accepted":23960,"submitted":40723,"acceptance":0.5883652972521671},{"id":1544,"title":"Make The String Great","slug":"make-the-string-great","difficulty":1,"accepted":406996,"submitted":594229,"acceptance":0.6849144016868918},{"id":1545,"title":"Find Kth Bit in Nth Binary String","slug":"find-kth-bit-in-nth-binary-string","difficulty":2,"accepted":279072,"submitted":378719,"acceptance":0.736884075000198},{"id":1546,"title":"Maximum Number of Non-Overlapping Subarrays With Sum Equals Target","slug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target","difficulty":2,"accepted":35632,"submitted":72929,"acceptance":0.4885847879444391},{"id":1547,"title":"Minimum Cost to Cut a Stick","slug":"minimum-cost-to-cut-a-stick","difficulty":3,"accepted":225423,"submitted":358202,"acceptance":0.6293180942596636},{"id":1548,"title":"The Most Similar Path in a Graph","slug":"the-most-similar-path-in-a-graph","difficulty":3,"accepted":17889,"submitted":30107,"acceptance":0.594180755306075},{"id":1549,"title":"The Most Recent Orders for Each Product","slug":"the-most-recent-orders-for-each-product","difficulty":2,"accepted":38885,"submitted":59815,"acceptance":0.6500877706260971},{"id":1550,"title":"Three Consecutive Odds","slug":"three-consecutive-odds","difficulty":1,"accepted":442615,"submitted":638690,"acceptance":0.6930044309445897},{"id":1551,"title":"Minimum Operations to Make Array Equal","slug":"minimum-operations-to-make-array-equal","difficulty":2,"accepted":117525,"submitted":142126,"acceptance":0.8269071105920099},{"id":1552,"title":"Magnetic Force Between Two Balls","slug":"magnetic-force-between-two-balls","difficulty":2,"accepted":221208,"submitted":307369,"acceptance":0.7196822060780365},{"id":1553,"title":"Minimum Number of Days to Eat N Oranges","slug":"minimum-number-of-days-to-eat-n-oranges","difficulty":3,"accepted":44103,"submitted":121992,"acceptance":0.36152370647255555},{"id":1554,"title":"Strings Differ by One Character","slug":"strings-differ-by-one-character","difficulty":2,"accepted":27669,"submitted":69224,"acceptance":0.3997024153472784},{"id":1555,"title":"Bank Account Summary","slug":"bank-account-summary","difficulty":2,"accepted":22814,"submitted":43713,"acceptance":0.5219042390135658},{"id":1556,"title":"Thousand Separator","slug":"thousand-separator","difficulty":1,"accepted":67427,"submitted":125640,"acceptance":0.5366682585163961},{"id":1557,"title":"Minimum Number of Vertices to Reach All Nodes","slug":"minimum-number-of-vertices-to-reach-all-nodes","difficulty":2,"accepted":232900,"submitted":285628,"acceptance":0.8153962496673995},{"id":1558,"title":"Minimum Numbers of Function Calls to Make Target Array","slug":"minimum-numbers-of-function-calls-to-make-target-array","difficulty":2,"accepted":25984,"submitted":41400,"acceptance":0.6276328502415459},{"id":1559,"title":"Detect Cycles in 2D Grid","slug":"detect-cycles-in-2d-grid","difficulty":2,"accepted":68109,"submitted":128934,"acceptance":0.5282470100981898},{"id":1560,"title":"Most Visited Sector in  a Circular Track","slug":"most-visited-sector-in-a-circular-track","difficulty":1,"accepted":39784,"submitted":66471,"acceptance":0.5985166463570579},{"id":1561,"title":"Maximum Number of Coins You Can Get","slug":"maximum-number-of-coins-you-can-get","difficulty":2,"accepted":199421,"submitted":235320,"acceptance":0.847446030936597},{"id":1562,"title":"Find Latest Group of Size M","slug":"find-latest-group-of-size-m","difficulty":2,"accepted":22275,"submitted":50891,"acceptance":0.43770018274351064},{"id":1563,"title":"Stone Game V","slug":"stone-game-v","difficulty":3,"accepted":26275,"submitted":62931,"acceptance":0.4175207767237133},{"id":1564,"title":"Put Boxes Into the Warehouse I","slug":"put-boxes-into-the-warehouse-i","difficulty":2,"accepted":19423,"submitted":28786,"acceptance":0.6747377197248663},{"id":1565,"title":"Unique Orders and Customers Per Month","slug":"unique-orders-and-customers-per-month","difficulty":1,"accepted":26009,"submitted":31740,"acceptance":0.8194391934467549},{"id":1566,"title":"Detect Pattern of Length M Repeated K or More Times","slug":"detect-pattern-of-length-m-repeated-k-or-more-times","difficulty":1,"accepted":46114,"submitted":105287,"acceptance":0.4379837966700542},{"id":1567,"title":"Maximum Length of Subarray With Positive Product","slug":"maximum-length-of-subarray-with-positive-product","difficulty":2,"accepted":110971,"submitted":248585,"acceptance":0.4464106844741235},{"id":1568,"title":"Minimum Number of Days to Disconnect Island","slug":"minimum-number-of-days-to-disconnect-island","difficulty":3,"accepted":99043,"submitted":168595,"acceptance":0.5874610753581067},{"id":1569,"title":"Number of Ways to Reorder Array to Get Same BST","slug":"number-of-ways-to-reorder-array-to-get-same-bst","difficulty":3,"accepted":63070,"submitted":116727,"acceptance":0.5403205770729994},{"id":1570,"title":"Dot Product of Two Sparse Vectors","slug":"dot-product-of-two-sparse-vectors","difficulty":2,"accepted":405653,"submitted":451238,"acceptance":0.8989779229586161},{"id":1571,"title":"Warehouse Manager","slug":"warehouse-manager","difficulty":1,"accepted":51851,"submitted":59435,"acceptance":0.872398418440313},{"id":1572,"title":"Matrix Diagonal Sum","slug":"matrix-diagonal-sum","difficulty":1,"accepted":518461,"submitted":615614,"acceptance":0.8421852004665261},{"id":1573,"title":"Number of Ways to Split a String","slug":"number-of-ways-to-split-a-string","difficulty":2,"accepted":35961,"submitted":103999,"acceptance":0.3457821709824133},{"id":1574,"title":"Shortest Subarray to be Removed to Make Array Sorted","slug":"shortest-subarray-to-be-removed-to-make-array-sorted","difficulty":2,"accepted":127799,"submitted":249288,"acceptance":0.5126560444144925},{"id":1575,"title":"Count All Possible Routes","slug":"count-all-possible-routes","difficulty":3,"accepted":66073,"submitted":101895,"acceptance":0.6484420236517984},{"id":1576,"title":"Replace All ?'s to Avoid Consecutive Repeating Characters","slug":"replace-all-s-to-avoid-consecutive-repeating-characters","difficulty":1,"accepted":73953,"submitted":163498,"acceptance":0.4523174595407895},{"id":1577,"title":"Number of Ways Where Square of Number Is Equal to Product of Two Numbers","slug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers","difficulty":2,"accepted":26862,"submitted":62005,"acceptance":0.43322312716716393},{"id":1578,"title":"Minimum Time to Make Rope Colorful","slug":"minimum-time-to-make-rope-colorful","difficulty":2,"accepted":408577,"submitted":626459,"acceptance":0.6522007026796646},{"id":1579,"title":"Remove Max Number of Edges to Keep Graph Fully Traversable","slug":"remove-max-number-of-edges-to-keep-graph-fully-traversable","difficulty":3,"accepted":144385,"submitted":205695,"acceptance":0.7019373344028781},{"id":1580,"title":"Put Boxes Into the Warehouse II","slug":"put-boxes-into-the-warehouse-ii","difficulty":2,"accepted":10787,"submitted":16385,"acceptance":0.6583460482148307},{"id":1581,"title":"Customer Who Visited but Did Not Make Any Transactions","slug":"customer-who-visited-but-did-not-make-any-transactions","difficulty":1,"accepted":1138059,"submitted":1682535,"acceptance":0.6763954390250426},{"id":1582,"title":"Special Positions in a Binary Matrix","slug":"special-positions-in-a-binary-matrix","difficulty":1,"accepted":284027,"submitted":391038,"acceptance":0.7263411740035495},{"id":1583,"title":"Count Unhappy Friends","slug":"count-unhappy-friends","difficulty":2,"accepted":34432,"submitted":55131,"acceptance":0.6245488019444596},{"id":1584,"title":"Min Cost to Connect All Points","slug":"min-cost-to-connect-all-points","difficulty":2,"accepted":463190,"submitted":655748,"acceptance":0.7063536602475341},{"id":1585,"title":"Check If String Is Transformable With Substring Sort Operations","slug":"check-if-string-is-transformable-with-substring-sort-operations","difficulty":3,"accepted":12571,"submitted":24442,"acceptance":0.5143196137795598},{"id":1586,"title":"Binary Search Tree Iterator II","slug":"binary-search-tree-iterator-ii","difficulty":2,"accepted":17262,"submitted":27256,"acceptance":0.6333284414440857},{"id":1587,"title":"Bank Account Summary II","slug":"bank-account-summary-ii","difficulty":1,"accepted":168607,"submitted":203222,"acceptance":0.8296690318961529},{"id":1588,"title":"Sum of All Odd Length Subarrays","slug":"sum-of-all-odd-length-subarrays","difficulty":1,"accepted":255681,"submitted":304536,"acceptance":0.839575616675861},{"id":1589,"title":"Maximum Sum Obtained of Any Permutation","slug":"maximum-sum-obtained-of-any-permutation","difficulty":2,"accepted":28908,"submitted":71198,"acceptance":0.40602264108542374},{"id":1590,"title":"Make Sum Divisible by P","slug":"make-sum-divisible-by-p","difficulty":2,"accepted":225662,"submitted":529662,"acceptance":0.4260490652529349},{"id":1591,"title":"Strange Printer II","slug":"strange-printer-ii","difficulty":3,"accepted":16445,"submitted":27073,"acceptance":0.6074317585786577},{"id":1592,"title":"Rearrange Spaces Between Words","slug":"rearrange-spaces-between-words","difficulty":1,"accepted":72710,"submitted":164699,"acceptance":0.441472018652208},{"id":1593,"title":"Split a String Into the Max Number of Unique Substrings","slug":"split-a-string-into-the-max-number-of-unique-substrings","difficulty":2,"accepted":149725,"submitted":218179,"acceptance":0.6862484473757786},{"id":1594,"title":"Maximum Non Negative Product in a Matrix","slug":"maximum-non-negative-product-in-a-matrix","difficulty":2,"accepted":109569,"submitted":212392,"acceptance":0.515881012467513},{"id":1595,"title":"Minimum Cost to Connect Two Groups of Points","slug":"minimum-cost-to-connect-two-groups-of-points","difficulty":3,"accepted":12219,"submitted":24521,"acceptance":0.49830757310060764},{"id":1596,"title":"The Most Frequently Ordered Products for Each Customer","slug":"the-most-frequently-ordered-products-for-each-customer","difficulty":2,"accepted":45695,"submitted":58842,"acceptance":0.7765711566568098},{"id":1597,"title":"Build Binary Expression Tree From Infix Expression","slug":"build-binary-expression-tree-from-infix-expression","difficulty":3,"accepted":14794,"submitted":23563,"acceptance":0.627848745915206},{"id":1598,"title":"Crawler Log Folder","slug":"crawler-log-folder","difficulty":1,"accepted":290801,"submitted":405858,"acceptance":0.7165092224374042},{"id":1599,"title":"Maximum Profit of Operating a Centennial Wheel","slug":"maximum-profit-of-operating-a-centennial-wheel","difficulty":2,"accepted":15221,"submitted":34191,"acceptance":0.44517563101400953},{"id":1600,"title":"Throne Inheritance","slug":"throne-inheritance","difficulty":2,"accepted":28158,"submitted":42005,"acceptance":0.670348768003809},{"id":1601,"title":"Maximum Number of Achievable Transfer Requests","slug":"maximum-number-of-achievable-transfer-requests","difficulty":3,"accepted":64066,"submitted":99103,"acceptance":0.646458734851619},{"id":1602,"title":"Find Nearest Right Node in Binary Tree","slug":"find-nearest-right-node-in-binary-tree","difficulty":2,"accepted":25042,"submitted":33361,"acceptance":0.7506369713138096},{"id":1603,"title":"Design Parking System","slug":"design-parking-system","difficulty":1,"accepted":356797,"submitted":409333,"acceptance":0.8716546186112529},{"id":1604,"title":"Alert Using Same Key-Card Three or More Times in a One Hour Period","slug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period","difficulty":2,"accepted":49234,"submitted":106611,"acceptance":0.4618097569669171},{"id":1605,"title":"Find Valid Matrix Given Row and Column Sums","slug":"find-valid-matrix-given-row-and-column-sums","difficulty":2,"accepted":161407,"submitted":195349,"acceptance":0.826249430506427},{"id":1606,"title":"Find Servers That Handled Most Number of Requests","slug":"find-servers-that-handled-most-number-of-requests","difficulty":3,"accepted":28782,"submitted":63523,"acceptance":0.4530957291059931},{"id":1607,"title":"Sellers With No Sales","slug":"sellers-with-no-sales","difficulty":1,"accepted":45587,"submitted":83896,"acceptance":0.5433751311147135},{"id":1608,"title":"Special Array With X Elements Greater Than or Equal X","slug":"special-array-with-x-elements-greater-than-or-equal-x","difficulty":1,"accepted":233809,"submitted":350121,"acceptance":0.6677948480668112},{"id":1609,"title":"Even Odd Tree","slug":"even-odd-tree","difficulty":2,"accepted":194602,"submitted":289983,"acceptance":0.671080718524879},{"id":1610,"title":"Maximum Number of Visible Points","slug":"maximum-number-of-visible-points","difficulty":3,"accepted":53059,"submitted":139402,"acceptance":0.3806186424871953},{"id":1611,"title":"Minimum One Bit Operations to Make Integers Zero","slug":"minimum-one-bit-operations-to-make-integers-zero","difficulty":3,"accepted":121206,"submitted":154591,"acceptance":0.7840430555465713},{"id":1612,"title":"Check If Two Expression Trees are Equivalent","slug":"check-if-two-expression-trees-are-equivalent","difficulty":2,"accepted":8678,"submitted":12105,"acceptance":0.7168938455183809},{"id":1613,"title":"Find the Missing IDs","slug":"find-the-missing-ids","difficulty":2,"accepted":23283,"submitted":31913,"acceptance":0.7295772882524363},{"id":1614,"title":"Maximum Nesting Depth of the Parentheses","slug":"maximum-nesting-depth-of-the-parentheses","difficulty":1,"accepted":549440,"submitted":647722,"acceptance":0.8482651507899994},{"id":1615,"title":"Maximal Network Rank","slug":"maximal-network-rank","difficulty":2,"accepted":169830,"submitted":257584,"acceptance":0.6593189017951425},{"id":1616,"title":"Split Two Strings to Make Palindrome","slug":"split-two-strings-to-make-palindrome","difficulty":2,"accepted":32486,"submitted":101114,"acceptance":0.3212809304349546},{"id":1617,"title":"Count Subtrees With Max Distance Between Cities","slug":"count-subtrees-with-max-distance-between-cities","difficulty":3,"accepted":14906,"submitted":22171,"acceptance":0.6723196969013576},{"id":1618,"title":"Maximum Font to Fit a Sentence in a Screen","slug":"maximum-font-to-fit-a-sentence-in-a-screen","difficulty":2,"accepted":7525,"submitted":12140,"acceptance":0.6198517298187809},{"id":1619,"title":"Mean of Array After Removing Some Elements","slug":"mean-of-array-after-removing-some-elements","difficulty":1,"accepted":84752,"submitted":118248,"acceptance":0.7167309383668222},{"id":1620,"title":"Coordinate With Maximum Network Quality","slug":"coordinate-with-maximum-network-quality","difficulty":2,"accepted":11575,"submitted":29352,"acceptance":0.3943513218860725},{"id":1621,"title":"Number of Sets of K Non-Overlapping Line Segments","slug":"number-of-sets-of-k-non-overlapping-line-segments","difficulty":2,"accepted":13194,"submitted":28849,"acceptance":0.45734687510832267},{"id":1622,"title":"Fancy Sequence","slug":"fancy-sequence","difficulty":3,"accepted":76653,"submitted":185053,"acceptance":0.414221871571928},{"id":1623,"title":"All Valid Triplets That Can Represent a Country","slug":"all-valid-triplets-that-can-represent-a-country","difficulty":1,"accepted":23329,"submitted":28830,"acceptance":0.8091918140825529},{"id":1624,"title":"Largest Substring Between Two Equal Characters","slug":"largest-substring-between-two-equal-characters","difficulty":1,"accepted":180959,"submitted":264941,"acceptance":0.6830162187052966},{"id":1625,"title":"Lexicographically Smallest String After Applying Operations","slug":"lexicographically-smallest-string-after-applying-operations","difficulty":2,"accepted":86178,"submitted":108569,"acceptance":0.7937624920557433},{"id":1626,"title":"Best Team With No Conflicts","slug":"best-team-with-no-conflicts","difficulty":2,"accepted":99029,"submitted":195506,"acceptance":0.5065266539134349},{"id":1627,"title":"Graph Connectivity With Threshold","slug":"graph-connectivity-with-threshold","difficulty":3,"accepted":23692,"submitted":48057,"acceptance":0.49299789832906754},{"id":1628,"title":"Design an Expression Tree With Evaluate Function","slug":"design-an-expression-tree-with-evaluate-function","difficulty":2,"accepted":29745,"submitted":36048,"acceptance":0.8251498002663116},{"id":1629,"title":"Slowest Key","slug":"slowest-key","difficulty":1,"accepted":116768,"submitted":196032,"acceptance":0.5956578517793013},{"id":1630,"title":"Arithmetic Subarrays","slug":"arithmetic-subarrays","difficulty":2,"accepted":157032,"submitted":187557,"acceptance":0.8372494761592476},{"id":1631,"title":"Path With Minimum Effort","slug":"path-with-minimum-effort","difficulty":2,"accepted":452561,"submitted":718254,"acceptance":0.6300849003277392},{"id":1632,"title":"Rank Transform of a Matrix","slug":"rank-transform-of-a-matrix","difficulty":3,"accepted":27472,"submitted":65137,"acceptance":0.42175721939911265},{"id":1633,"title":"Percentage of Users Attended a Contest","slug":"percentage-of-users-attended-a-contest","difficulty":1,"accepted":532098,"submitted":884666,"acceptance":0.6014676725453448},{"id":1634,"title":"Add Two Polynomials Represented as Linked Lists","slug":"add-two-polynomials-represented-as-linked-lists","difficulty":2,"accepted":16427,"submitted":26915,"acceptance":0.6103288129295932},{"id":1635,"title":"Hopper Company Queries I","slug":"hopper-company-queries-i","difficulty":3,"accepted":11262,"submitted":23388,"acceptance":0.48152898922524373},{"id":1636,"title":"Sort Array by Increasing Frequency","slug":"sort-array-by-increasing-frequency","difficulty":1,"accepted":347072,"submitted":429709,"acceptance":0.8076907860901215},{"id":1637,"title":"Widest Vertical Area Between Two Points Containing No Points","slug":"widest-vertical-area-between-two-points-containing-no-points","difficulty":1,"accepted":200845,"submitted":230552,"acceptance":0.8711483743363753},{"id":1638,"title":"Count Substrings That Differ by One Character","slug":"count-substrings-that-differ-by-one-character","difficulty":2,"accepted":37803,"submitted":52314,"acceptance":0.7226172726230072},{"id":1639,"title":"Number of Ways to Form a Target String Given a Dictionary","slug":"number-of-ways-to-form-a-target-string-given-a-dictionary","difficulty":3,"accepted":133768,"submitted":236567,"acceptance":0.5654550296533328},{"id":1640,"title":"Check Array Formation Through Concatenation","slug":"check-array-formation-through-concatenation","difficulty":1,"accepted":92379,"submitted":161202,"acceptance":0.5730636096326348},{"id":1641,"title":"Count Sorted Vowel Strings","slug":"count-sorted-vowel-strings","difficulty":2,"accepted":205834,"submitted":259876,"acceptance":0.7920469762502116},{"id":1642,"title":"Furthest Building You Can Reach","slug":"furthest-building-you-can-reach","difficulty":2,"accepted":270240,"submitted":532006,"acceptance":0.5079641958925275},{"id":1643,"title":"Kth Smallest Instructions","slug":"kth-smallest-instructions","difficulty":3,"accepted":17919,"submitted":40058,"acceptance":0.4473263767537071},{"id":1644,"title":"Lowest Common Ancestor of a Binary Tree II","slug":"lowest-common-ancestor-of-a-binary-tree-ii","difficulty":2,"accepted":120722,"submitted":173458,"acceptance":0.6959725120778517},{"id":1645,"title":"Hopper Company Queries II","slug":"hopper-company-queries-ii","difficulty":3,"accepted":8577,"submitted":21518,"acceptance":0.39859652384050565},{"id":1646,"title":"Get Maximum in Generated Array","slug":"get-maximum-in-generated-array","difficulty":1,"accepted":124520,"submitted":242179,"acceptance":0.5141651423120914},{"id":1647,"title":"Minimum Deletions to Make Character Frequencies Unique","slug":"minimum-deletions-to-make-character-frequencies-unique","difficulty":2,"accepted":300598,"submitted":489033,"acceptance":0.614678355039435},{"id":1648,"title":"Sell Diminishing-Valued Colored Balls","slug":"sell-diminishing-valued-colored-balls","difficulty":2,"accepted":45367,"submitted":150379,"acceptance":0.3016844107222418},{"id":1649,"title":"Create Sorted Array through Instructions","slug":"create-sorted-array-through-instructions","difficulty":3,"accepted":32247,"submitted":77619,"acceptance":0.41545240211803813},{"id":1650,"title":"Lowest Common Ancestor of a Binary Tree III","slug":"lowest-common-ancestor-of-a-binary-tree-iii","difficulty":2,"accepted":405993,"submitted":489282,"acceptance":0.8297730143352913},{"id":1651,"title":"Hopper Company Queries III","slug":"hopper-company-queries-iii","difficulty":3,"accepted":8745,"submitted":13362,"acceptance":0.6544678940278401},{"id":1652,"title":"Defuse the Bomb","slug":"defuse-the-bomb","difficulty":1,"accepted":221046,"submitted":278798,"acceptance":0.7928536072712142},{"id":1653,"title":"Minimum Deletions to Make String Balanced","slug":"minimum-deletions-to-make-string-balanced","difficulty":2,"accepted":289616,"submitted":424716,"acceptance":0.681905084809614},{"id":1654,"title":"Minimum Jumps to Reach Home","slug":"minimum-jumps-to-reach-home","difficulty":2,"accepted":52638,"submitted":171543,"acceptance":0.3068501775065144},{"id":1655,"title":"Distribute Repeating Integers","slug":"distribute-repeating-integers","difficulty":3,"accepted":21397,"submitted":52749,"acceptance":0.4056380215738687},{"id":1656,"title":"Design an Ordered Stream","slug":"design-an-ordered-stream","difficulty":1,"accepted":109917,"submitted":133050,"acceptance":0.8261330326944758},{"id":1657,"title":"Determine if Two Strings Are Close","slug":"determine-if-two-strings-are-close","difficulty":2,"accepted":564260,"submitted":1039942,"acceptance":0.5425879520204011},{"id":1658,"title":"Minimum Operations to Reduce X to Zero","slug":"minimum-operations-to-reduce-x-to-zero","difficulty":2,"accepted":232426,"submitted":573845,"acceptance":0.40503271789420486},{"id":1659,"title":"Maximize Grid Happiness","slug":"maximize-grid-happiness","difficulty":3,"accepted":7495,"submitted":18312,"acceptance":0.4092944517256444},{"id":1660,"title":"Correct a Binary Tree","slug":"correct-a-binary-tree","difficulty":2,"accepted":23212,"submitted":31232,"acceptance":0.7432120901639344},{"id":1661,"title":"Average Time of Process per Machine","slug":"average-time-of-process-per-machine","difficulty":1,"accepted":772055,"submitted":1155152,"acceptance":0.6683579303849191},{"id":1662,"title":"Check If Two String Arrays are Equivalent","slug":"check-if-two-string-arrays-are-equivalent","difficulty":1,"accepted":611889,"submitted":710863,"acceptance":0.8607692340155557},{"id":1663,"title":"Smallest String With A Given Numeric Value","slug":"smallest-string-with-a-given-numeric-value","difficulty":2,"accepted":105096,"submitted":155834,"acceptance":0.6744099490483463},{"id":1664,"title":"Ways to Make a Fair Array","slug":"ways-to-make-a-fair-array","difficulty":2,"accepted":57316,"submitted":86031,"acceptance":0.6662249654194419},{"id":1665,"title":"Minimum Initial Energy to Finish Tasks","slug":"minimum-initial-energy-to-finish-tasks","difficulty":3,"accepted":23397,"submitted":38531,"acceptance":0.607225351016065},{"id":1666,"title":"Change the Root of a Binary Tree","slug":"change-the-root-of-a-binary-tree","difficulty":2,"accepted":5941,"submitted":7910,"acceptance":0.7510745891276864},{"id":1667,"title":"Fix Names in a Table","slug":"fix-names-in-a-table","difficulty":1,"accepted":453269,"submitted":748083,"acceptance":0.6059073658938915},{"id":1668,"title":"Maximum Repeating Substring","slug":"maximum-repeating-substring","difficulty":1,"accepted":107888,"submitted":260464,"acceptance":0.41421463234842437},{"id":1669,"title":"Merge In Between Linked Lists","slug":"merge-in-between-linked-lists","difficulty":2,"accepted":276959,"submitted":333987,"acceptance":0.829250839104516},{"id":1670,"title":"Design Front Middle Back Queue","slug":"design-front-middle-back-queue","difficulty":2,"accepted":43298,"submitted":75988,"acceptance":0.5698004948149707},{"id":1671,"title":"Minimum Number of Removals to Make Mountain Array","slug":"minimum-number-of-removals-to-make-mountain-array","difficulty":3,"accepted":123190,"submitted":224899,"acceptance":0.5477569931391425},{"id":1672,"title":"Richest Customer Wealth","slug":"richest-customer-wealth","difficulty":1,"accepted":1223055,"submitted":1379081,"acceptance":0.8868623380352568},{"id":1673,"title":"Find the Most Competitive Subsequence","slug":"find-the-most-competitive-subsequence","difficulty":2,"accepted":83488,"submitted":158176,"acceptance":0.52781711511228},{"id":1674,"title":"Minimum Moves to Make Array Complementary","slug":"minimum-moves-to-make-array-complementary","difficulty":2,"accepted":13043,"submitted":30112,"acceptance":0.43314957492029754},{"id":1675,"title":"Minimize Deviation in Array","slug":"minimize-deviation-in-array","difficulty":3,"accepted":100785,"submitted":186759,"acceptance":0.5396527075000401},{"id":1676,"title":"Lowest Common Ancestor of a Binary Tree IV","slug":"lowest-common-ancestor-of-a-binary-tree-iv","difficulty":2,"accepted":63223,"submitted":79465,"acceptance":0.7956081293651293},{"id":1677,"title":"Product's Worth Over Invoices","slug":"products-worth-over-invoices","difficulty":1,"accepted":20442,"submitted":52964,"acceptance":0.38596027490370816},{"id":1678,"title":"Goal Parser Interpretation","slug":"goal-parser-interpretation","difficulty":1,"accepted":324311,"submitted":368411,"acceptance":0.8802967338108797},{"id":1679,"title":"Max Number of K-Sum Pairs","slug":"max-number-of-k-sum-pairs","difficulty":2,"accepted":596340,"submitted":1046778,"acceptance":0.5696909946521612},{"id":1680,"title":"Concatenation of Consecutive Binary Numbers","slug":"concatenation-of-consecutive-binary-numbers","difficulty":2,"accepted":191420,"submitted":287504,"acceptance":0.6657994323557237},{"id":1681,"title":"Minimum Incompatibility","slug":"minimum-incompatibility","difficulty":3,"accepted":11112,"submitted":27023,"acceptance":0.4112052695851682},{"id":1682,"title":"Longest Palindromic Subsequence II","slug":"longest-palindromic-subsequence-ii","difficulty":2,"accepted":6421,"submitted":12753,"acceptance":0.503489375049008},{"id":1683,"title":"Invalid Tweets","slug":"invalid-tweets","difficulty":1,"accepted":1409090,"submitted":1654470,"acceptance":0.8516866428523938},{"id":1684,"title":"Count the Number of Consistent Strings","slug":"count-the-number-of-consistent-strings","difficulty":1,"accepted":441480,"submitted":498847,"acceptance":0.8850008118721773},{"id":1685,"title":"Sum of Absolute Differences in a Sorted Array","slug":"sum-of-absolute-differences-in-a-sorted-array","difficulty":2,"accepted":133991,"submitted":196409,"acceptance":0.6822039723230605},{"id":1686,"title":"Stone Game VI","slug":"stone-game-vi","difficulty":2,"accepted":28486,"submitted":47076,"acceptance":0.6051066360778316},{"id":1687,"title":"Delivering Boxes from Storage to Ports","slug":"delivering-boxes-from-storage-to-ports","difficulty":3,"accepted":9142,"submitted":22914,"acceptance":0.3989700619708475},{"id":1688,"title":"Count of Matches in Tournament","slug":"count-of-matches-in-tournament","difficulty":1,"accepted":323657,"submitted":374587,"acceptance":0.8640369260011693},{"id":1689,"title":"Partitioning Into Minimum Number Of Deci-Binary Numbers","slug":"partitioning-into-minimum-number-of-deci-binary-numbers","difficulty":2,"accepted":372588,"submitted":411940,"acceptance":0.9044715249793659},{"id":1690,"title":"Stone Game VII","slug":"stone-game-vii","difficulty":2,"accepted":43773,"submitted":74570,"acceptance":0.5870054981896204},{"id":1691,"title":"Maximum Height by Stacking Cuboids ","slug":"maximum-height-by-stacking-cuboids","difficulty":3,"accepted":45235,"submitted":73141,"acceptance":0.6184629687863168},{"id":1692,"title":"Count Ways to Distribute Candies","slug":"count-ways-to-distribute-candies","difficulty":3,"accepted":3133,"submitted":4914,"acceptance":0.6375661375661376},{"id":1693,"title":"Daily Leads and Partners","slug":"daily-leads-and-partners","difficulty":1,"accepted":208434,"submitted":240559,"acceptance":0.8664568775227699},{"id":1694,"title":"Reformat Phone Number","slug":"reformat-phone-number","difficulty":1,"accepted":49529,"submitted":73194,"acceptance":0.6766811487280379},{"id":1695,"title":"Maximum Erasure Value","slug":"maximum-erasure-value","difficulty":2,"accepted":295619,"submitted":460502,"acceptance":0.641949437787458},{"id":1696,"title":"Jump Game VI","slug":"jump-game-vi","difficulty":2,"accepted":128393,"submitted":276824,"acceptance":0.46380732884431985},{"id":1697,"title":"Checking Existence of Edge Length Limited Paths","slug":"checking-existence-of-edge-length-limited-paths","difficulty":3,"accepted":61154,"submitted":96729,"acceptance":0.6322199133662086},{"id":1698,"title":"Number of Distinct Substrings in a String","slug":"number-of-distinct-substrings-in-a-string","difficulty":2,"accepted":14382,"submitted":22215,"acceptance":0.6474004051316677},{"id":1699,"title":"Number of Calls Between Two Persons","slug":"number-of-calls-between-two-persons","difficulty":2,"accepted":53296,"submitted":65964,"acceptance":0.807955854708629},{"id":1700,"title":"Number of Students Unable to Eat Lunch","slug":"number-of-students-unable-to-eat-lunch","difficulty":1,"accepted":369492,"submitted":464744,"acceptance":0.7950441533403336},{"id":1701,"title":"Average Waiting Time","slug":"average-waiting-time","difficulty":2,"accepted":220226,"submitted":301405,"acceptance":0.7306647202269372},{"id":1702,"title":"Maximum Binary String After Change","slug":"maximum-binary-string-after-change","difficulty":2,"accepted":17950,"submitted":37394,"acceptance":0.4800235331871423},{"id":1703,"title":"Minimum Adjacent Swaps for K Consecutive Ones","slug":"minimum-adjacent-swaps-for-k-consecutive-ones","difficulty":3,"accepted":14257,"submitted":33769,"acceptance":0.4221919511978442},{"id":1704,"title":"Determine if String Halves Are Alike","slug":"determine-if-string-halves-are-alike","difficulty":1,"accepted":402716,"submitted":511077,"acceptance":0.7879751974751359},{"id":1705,"title":"Maximum Number of Eaten Apples","slug":"maximum-number-of-eaten-apples","difficulty":2,"accepted":32977,"submitted":76557,"acceptance":0.43075094374126466},{"id":1706,"title":"Where Will the Ball Fall","slug":"where-will-the-ball-fall","difficulty":2,"accepted":149230,"submitted":206524,"acceptance":0.7225794580775116},{"id":1707,"title":"Maximum XOR With an Element From Array","slug":"maximum-xor-with-an-element-from-array","difficulty":3,"accepted":45825,"submitted":79251,"acceptance":0.5782261422568801},{"id":1708,"title":"Largest Subarray Length K","slug":"largest-subarray-length-k","difficulty":1,"accepted":10636,"submitted":16186,"acceptance":0.6571110836525392},{"id":1709,"title":"Biggest Window Between Visits","slug":"biggest-window-between-visits","difficulty":2,"accepted":32930,"submitted":47311,"acceptance":0.6960326351165691},{"id":1710,"title":"Maximum Units on a Truck","slug":"maximum-units-on-a-truck","difficulty":1,"accepted":388347,"submitted":519306,"acceptance":0.7478192048618734},{"id":1711,"title":"Count Good Meals","slug":"count-good-meals","difficulty":2,"accepted":53699,"submitted":164210,"acceptance":0.32701418914804214},{"id":1712,"title":"Ways to Split Array Into Three Subarrays","slug":"ways-to-split-array-into-three-subarrays","difficulty":2,"accepted":41344,"submitted":120831,"acceptance":0.3421638486812159},{"id":1713,"title":"Minimum Operations to Make a Subsequence","slug":"minimum-operations-to-make-a-subsequence","difficulty":3,"accepted":16218,"submitted":32699,"acceptance":0.4959784702896113},{"id":1714,"title":"Sum Of Special Evenly-Spaced Elements In Array","slug":"sum-of-special-evenly-spaced-elements-in-array","difficulty":3,"accepted":1724,"submitted":3456,"acceptance":0.4988425925925926},{"id":1715,"title":"Count Apples and Oranges","slug":"count-apples-and-oranges","difficulty":2,"accepted":19262,"submitted":25409,"acceptance":0.7580778464323665},{"id":1716,"title":"Calculate Money in Leetcode Bank","slug":"calculate-money-in-leetcode-bank","difficulty":1,"accepted":301524,"submitted":366128,"acceptance":0.8235480487698291},{"id":1717,"title":"Maximum Score From Removing Substrings","slug":"maximum-score-from-removing-substrings","difficulty":2,"accepted":242747,"submitted":364830,"acceptance":0.6653701724090673},{"id":1718,"title":"Construct the Lexicographically Largest Valid Sequence","slug":"construct-the-lexicographically-largest-valid-sequence","difficulty":2,"accepted":112885,"submitted":155248,"acceptance":0.7271269195094301},{"id":1719,"title":"Number Of Ways To Reconstruct A Tree","slug":"number-of-ways-to-reconstruct-a-tree","difficulty":3,"accepted":6871,"submitted":15017,"acceptance":0.45754811213957514},{"id":1720,"title":"Decode XORed Array","slug":"decode-xored-array","difficulty":1,"accepted":191359,"submitted":219087,"acceptance":0.8734384057474884},{"id":1721,"title":"Swapping Nodes in a Linked List","slug":"swapping-nodes-in-a-linked-list","difficulty":2,"accepted":459281,"submitted":662406,"acceptance":0.6933527172157257},{"id":1722,"title":"Minimize Hamming Distance After Swap Operations","slug":"minimize-hamming-distance-after-swap-operations","difficulty":2,"accepted":22605,"submitted":45908,"acceptance":0.49239783915657404},{"id":1723,"title":"Find Minimum Time to Finish All Jobs","slug":"find-minimum-time-to-finish-all-jobs","difficulty":3,"accepted":43091,"submitted":94590,"acceptance":0.45555555555555555},{"id":1724,"title":"Checking Existence of Edge Length Limited Paths II","slug":"checking-existence-of-edge-length-limited-paths-ii","difficulty":3,"accepted":4151,"submitted":8038,"acceptance":0.516421995521274},{"id":1725,"title":"Number Of Rectangles That Can Form The Largest Square","slug":"number-of-rectangles-that-can-form-the-largest-square","difficulty":1,"accepted":86572,"submitted":109112,"acceptance":0.7934232715008431},{"id":1726,"title":"Tuple with Same Product","slug":"tuple-with-same-product","difficulty":2,"accepted":199095,"submitted":284049,"acceptance":0.7009177993937665},{"id":1727,"title":"Largest Submatrix With Rearrangements","slug":"largest-submatrix-with-rearrangements","difficulty":2,"accepted":157022,"submitted":195768,"acceptance":0.8020820563115525},{"id":1728,"title":"Cat and Mouse II","slug":"cat-and-mouse-ii","difficulty":3,"accepted":9516,"submitted":23578,"acceptance":0.40359657307659685},{"id":1729,"title":"Find Followers Count","slug":"find-followers-count","difficulty":1,"accepted":467850,"submitted":672452,"acceptance":0.6957373909215825},{"id":1730,"title":"Shortest Path to Get Food","slug":"shortest-path-to-get-food","difficulty":2,"accepted":82890,"submitted":144994,"acceptance":0.5716788280894382},{"id":1731,"title":"The Number of Employees Which Report to Each Employee","slug":"the-number-of-employees-which-report-to-each-employee","difficulty":1,"accepted":376302,"submitted":707760,"acceptance":0.5316802305866395},{"id":1732,"title":"Find the Highest Altitude","slug":"find-the-highest-altitude","difficulty":1,"accepted":717902,"submitted":855888,"acceptance":0.8387803077038117},{"id":1733,"title":"Minimum Number of People to Teach","slug":"minimum-number-of-people-to-teach","difficulty":2,"accepted":99208,"submitted":146768,"acceptance":0.6759511610160253},{"id":1734,"title":"Decode XORed Permutation","slug":"decode-xored-permutation","difficulty":2,"accepted":20295,"submitted":30395,"acceptance":0.6677085046882711},{"id":1735,"title":"Count Ways to Make Array With Product","slug":"count-ways-to-make-array-with-product","difficulty":3,"accepted":9206,"submitted":16980,"acceptance":0.5421672555948175},{"id":1736,"title":"Latest Time by Replacing Hidden Digits","slug":"latest-time-by-replacing-hidden-digits","difficulty":1,"accepted":48100,"submitted":110011,"acceptance":0.43722900437229006},{"id":1737,"title":"Change Minimum Characters to Satisfy One of Three Conditions","slug":"change-minimum-characters-to-satisfy-one-of-three-conditions","difficulty":2,"accepted":16514,"submitted":43630,"acceptance":0.3785010314004126},{"id":1738,"title":"Find Kth Largest XOR Coordinate Value","slug":"find-kth-largest-xor-coordinate-value","difficulty":2,"accepted":30500,"submitted":47519,"acceptance":0.6418485237483954},{"id":1739,"title":"Building Boxes","slug":"building-boxes","difficulty":3,"accepted":9650,"submitted":18436,"acceptance":0.5234324148405294},{"id":1740,"title":"Find Distance in a Binary Tree","slug":"find-distance-in-a-binary-tree","difficulty":2,"accepted":35590,"submitted":47909,"acceptance":0.7428666847565175},{"id":1741,"title":"Find Total Time Spent by Each Employee","slug":"find-total-time-spent-by-each-employee","difficulty":1,"accepted":221262,"submitted":256124,"acceptance":0.86388624260124},{"id":1742,"title":"Maximum Number of Balls in a Box","slug":"maximum-number-of-balls-in-a-box","difficulty":1,"accepted":84753,"submitted":113296,"acceptance":0.7480670103092784},{"id":1743,"title":"Restore the Array From Adjacent Pairs","slug":"restore-the-array-from-adjacent-pairs","difficulty":2,"accepted":127185,"submitted":169530,"acceptance":0.7502211997876482},{"id":1744,"title":"Can You Eat Your Favorite Candy on Your Favorite Day?","slug":"can-you-eat-your-favorite-candy-on-your-favorite-day","difficulty":2,"accepted":13948,"submitted":38691,"acceptance":0.360497273267685},{"id":1745,"title":"Palindrome Partitioning IV","slug":"palindrome-partitioning-iv","difficulty":3,"accepted":32787,"submitted":72501,"acceptance":0.4522282451276534},{"id":1746,"title":"Maximum Subarray Sum After One Operation","slug":"maximum-subarray-sum-after-one-operation","difficulty":2,"accepted":13939,"submitted":21389,"acceptance":0.65169012109028},{"id":1747,"title":"Leetflex Banned Accounts","slug":"leetflex-banned-accounts","difficulty":2,"accepted":30643,"submitted":49613,"acceptance":0.61764053776228},{"id":1748,"title":"Sum of Unique Elements","slug":"sum-of-unique-elements","difficulty":1,"accepted":259810,"submitted":325244,"acceptance":0.7988156583980027},{"id":1749,"title":"Maximum Absolute Sum of Any Subarray","slug":"maximum-absolute-sum-of-any-subarray","difficulty":2,"accepted":189585,"submitted":266758,"acceptance":0.7107003351352162},{"id":1750,"title":"Minimum Length of String After Deleting Similar Ends","slug":"minimum-length-of-string-after-deleting-similar-ends","difficulty":2,"accepted":187592,"submitted":334687,"acceptance":0.5604998102704916},{"id":1751,"title":"Maximum Number of Events That Can Be Attended II","slug":"maximum-number-of-events-that-can-be-attended-ii","difficulty":3,"accepted":163294,"submitted":256973,"acceptance":0.6354519735536418},{"id":1752,"title":"Check if Array Is Sorted and Rotated","slug":"check-if-array-is-sorted-and-rotated","difficulty":1,"accepted":850093,"submitted":1520331,"acceptance":0.5591499482678443},{"id":1753,"title":"Maximum Score From Removing Stones","slug":"maximum-score-from-removing-stones","difficulty":2,"accepted":53687,"submitted":78356,"acceptance":0.6851676961560059},{"id":1754,"title":"Largest Merge Of Two Strings","slug":"largest-merge-of-two-strings","difficulty":2,"accepted":34989,"submitted":65191,"acceptance":0.536715190747189},{"id":1755,"title":"Closest Subsequence Sum","slug":"closest-subsequence-sum","difficulty":3,"accepted":28014,"submitted":64444,"acceptance":0.43470299795171},{"id":1756,"title":"Design Most Recently Used Queue","slug":"design-most-recently-used-queue","difficulty":2,"accepted":27512,"submitted":35129,"acceptance":0.7831705997893479},{"id":1757,"title":"Recyclable and Low Fat Products","slug":"recyclable-and-low-fat-products","difficulty":1,"accepted":2365239,"submitted":2666704,"acceptance":0.8869522076690927},{"id":1758,"title":"Minimum Changes To Make Alternating Binary String","slug":"minimum-changes-to-make-alternating-binary-string","difficulty":1,"accepted":296727,"submitted":437514,"acceptance":0.6782114400910599},{"id":1759,"title":"Count Number of Homogenous Substrings","slug":"count-number-of-homogenous-substrings","difficulty":2,"accepted":132168,"submitted":230486,"acceptance":0.5734317919526566},{"id":1760,"title":"Minimum Limit of Balls in a Bag","slug":"minimum-limit-of-balls-in-a-bag","difficulty":2,"accepted":153566,"submitted":231314,"acceptance":0.6638854544039704},{"id":1761,"title":"Minimum Degree of a Connected Trio in a Graph","slug":"minimum-degree-of-a-connected-trio-in-a-graph","difficulty":3,"accepted":29677,"submitted":66922,"acceptance":0.4434565613699531},{"id":1762,"title":"Buildings With an Ocean View","slug":"buildings-with-an-ocean-view","difficulty":2,"accepted":341819,"submitted":422650,"acceptance":0.8087519223944162},{"id":1763,"title":"Longest Nice Substring","slug":"longest-nice-substring","difficulty":1,"accepted":95355,"submitted":148992,"acceptance":0.6400008054123711},{"id":1764,"title":"Form Array by Concatenating Subarrays of Another Array","slug":"form-array-by-concatenating-subarrays-of-another-array","difficulty":2,"accepted":20730,"submitted":37933,"acceptance":0.5464898637070624},{"id":1765,"title":"Map of Highest Peak","slug":"map-of-highest-peak","difficulty":2,"accepted":160777,"submitted":212235,"acceptance":0.7575423469267557},{"id":1766,"title":"Tree of Coprimes","slug":"tree-of-coprimes","difficulty":3,"accepted":14026,"submitted":31879,"acceptance":0.43997615985444966},{"id":1767,"title":"Find the Subtasks That Did Not Execute","slug":"find-the-subtasks-that-did-not-execute","difficulty":3,"accepted":19624,"submitted":25074,"acceptance":0.7826433756081997},{"id":1768,"title":"Merge Strings Alternately","slug":"merge-strings-alternately","difficulty":1,"accepted":2034375,"submitted":2478042,"acceptance":0.8209606616837003},{"id":1769,"title":"Minimum Number of Operations to Move All Balls to Each Box","slug":"minimum-number-of-operations-to-move-all-balls-to-each-box","difficulty":2,"accepted":337652,"submitted":374653,"acceptance":0.9012392800805011},{"id":1770,"title":"Maximum Score from Performing Multiplication Operations","slug":"maximum-score-from-performing-multiplication-operations","difficulty":3,"accepted":134996,"submitted":311966,"acceptance":0.4327266432880506},{"id":1771,"title":"Maximize Palindrome Length From Subsequences","slug":"maximize-palindrome-length-from-subsequences","difficulty":3,"accepted":14546,"submitted":37924,"acceptance":0.3835565868579264},{"id":1772,"title":"Sort Features by Popularity","slug":"sort-features-by-popularity","difficulty":2,"accepted":7442,"submitted":11203,"acceptance":0.6642863518700348},{"id":1773,"title":"Count Items Matching a Rule","slug":"count-items-matching-a-rule","difficulty":1,"accepted":284880,"submitted":333924,"acceptance":0.8531282567290761},{"id":1774,"title":"Closest Dessert Cost","slug":"closest-dessert-cost","difficulty":2,"accepted":38594,"submitted":79569,"acceptance":0.48503814299538767},{"id":1775,"title":"Equal Sum Arrays With Minimum Number of Operations","slug":"equal-sum-arrays-with-minimum-number-of-operations","difficulty":2,"accepted":35619,"submitted":65270,"acceptance":0.5457177876512946},{"id":1776,"title":"Car Fleet II","slug":"car-fleet-ii","difficulty":3,"accepted":33352,"submitted":57679,"acceptance":0.5782347128070875},{"id":1777,"title":"Product's Price for Each Store","slug":"products-price-for-each-store","difficulty":1,"accepted":24857,"submitted":30270,"acceptance":0.8211760819293029},{"id":1778,"title":"Shortest Path in a Hidden Grid","slug":"shortest-path-in-a-hidden-grid","difficulty":2,"accepted":17398,"submitted":39055,"acceptance":0.44547433107156575},{"id":1779,"title":"Find Nearest Point That Has the Same X or Y Coordinate","slug":"find-nearest-point-that-has-the-same-x-or-y-coordinate","difficulty":1,"accepted":133726,"submitted":191217,"acceptance":0.6993415857376698},{"id":1780,"title":"Check if Number is a Sum of Powers of Three","slug":"check-if-number-is-a-sum-of-powers-of-three","difficulty":2,"accepted":216407,"submitted":272567,"acceptance":0.7939589165232769},{"id":1781,"title":"Sum of Beauty of All Substrings","slug":"sum-of-beauty-of-all-substrings","difficulty":2,"accepted":183855,"submitted":249205,"acceptance":0.7377660961858711},{"id":1782,"title":"Count Pairs Of Nodes","slug":"count-pairs-of-nodes","difficulty":3,"accepted":9918,"submitted":23223,"acceptance":0.4270766050897817},{"id":1783,"title":"Grand Slam Titles","slug":"grand-slam-titles","difficulty":2,"accepted":34332,"submitted":41399,"acceptance":0.8292953936085413},{"id":1784,"title":"Check if Binary String Has at Most One Segment of Ones","slug":"check-if-binary-string-has-at-most-one-segment-of-ones","difficulty":1,"accepted":190100,"submitted":387453,"acceptance":0.4906401550639691},{"id":1785,"title":"Minimum Elements to Add to Form a Given Sum","slug":"minimum-elements-to-add-to-form-a-given-sum","difficulty":2,"accepted":27437,"submitted":60942,"acceptance":0.450214958485117},{"id":1786,"title":"Number of Restricted Paths From First to Last Node","slug":"number-of-restricted-paths-from-first-to-last-node","difficulty":2,"accepted":34505,"submitted":84053,"acceptance":0.4105147942369695},{"id":1787,"title":"Make the XOR of All Segments Equal to Zero","slug":"make-the-xor-of-all-segments-equal-to-zero","difficulty":3,"accepted":7000,"submitted":17149,"acceptance":0.4081870663012421},{"id":1788,"title":"Maximize the Beauty of the Garden","slug":"maximize-the-beauty-of-the-garden","difficulty":3,"accepted":2793,"submitted":4310,"acceptance":0.6480278422273782},{"id":1789,"title":"Primary Department for Each Employee","slug":"primary-department-for-each-employee","difficulty":1,"accepted":351627,"submitted":473919,"acceptance":0.7419559038569882},{"id":1790,"title":"Check if One String Swap Can Make Strings Equal","slug":"check-if-one-string-swap-can-make-strings-equal","difficulty":1,"accepted":310565,"submitted":627449,"acceptance":0.49496453098180093},{"id":1791,"title":"Find Center of Star Graph","slug":"find-center-of-star-graph","difficulty":1,"accepted":439967,"submitted":507923,"acceptance":0.866208066970781},{"id":1792,"title":"Maximum Average Pass Ratio","slug":"maximum-average-pass-ratio","difficulty":2,"accepted":209461,"submitted":282709,"acceptance":0.7409067274122861},{"id":1793,"title":"Maximum Score of a Good Subarray","slug":"maximum-score-of-a-good-subarray","difficulty":3,"accepted":89649,"submitted":139270,"acceptance":0.6437064694478352},{"id":1794,"title":"Count Pairs of Equal Substrings With Minimum Difference","slug":"count-pairs-of-equal-substrings-with-minimum-difference","difficulty":2,"accepted":2473,"submitted":3869,"acceptance":0.6391832514861722},{"id":1795,"title":"Rearrange Products Table","slug":"rearrange-products-table","difficulty":1,"accepted":201190,"submitted":235277,"acceptance":0.8551197099588995},{"id":1796,"title":"Second Largest Digit in a String","slug":"second-largest-digit-in-a-string","difficulty":1,"accepted":101248,"submitted":187026,"acceptance":0.5413578860693166},{"id":1797,"title":"Design Authentication Manager","slug":"design-authentication-manager","difficulty":2,"accepted":56963,"submitted":97387,"acceptance":0.5849137975294444},{"id":1798,"title":"Maximum Number of Consecutive Values You Can Make","slug":"maximum-number-of-consecutive-values-you-can-make","difficulty":2,"accepted":26463,"submitted":41446,"acceptance":0.638493461371423},{"id":1799,"title":"Maximize Score After N Operations","slug":"maximize-score-after-n-operations","difficulty":3,"accepted":69958,"submitted":120714,"acceptance":0.5795350994913597},{"id":1800,"title":"Maximum Ascending Subarray Sum","slug":"maximum-ascending-subarray-sum","difficulty":1,"accepted":249282,"submitted":376042,"acceptance":0.6629099940964042},{"id":1801,"title":"Number of Orders in the Backlog","slug":"number-of-orders-in-the-backlog","difficulty":2,"accepted":36647,"submitted":68209,"acceptance":0.5372751396443285},{"id":1802,"title":"Maximum Value at a Given Index in a Bounded Array","slug":"maximum-value-at-a-given-index-in-a-bounded-array","difficulty":2,"accepted":88457,"submitted":227518,"acceptance":0.38879121651913257},{"id":1803,"title":"Count Pairs With XOR in a Range","slug":"count-pairs-with-xor-in-a-range","difficulty":3,"accepted":12215,"submitted":26468,"acceptance":0.4615006800664954},{"id":1804,"title":"Implement Trie II (Prefix Tree)","slug":"implement-trie-ii-prefix-tree","difficulty":2,"accepted":27095,"submitted":42735,"acceptance":0.634023634023634},{"id":1805,"title":"Number of Different Integers in a String","slug":"number-of-different-integers-in-a-string","difficulty":1,"accepted":64077,"submitted":159431,"acceptance":0.401910544373428},{"id":1806,"title":"Minimum Number of Operations to Reinitialize a Permutation","slug":"minimum-number-of-operations-to-reinitialize-a-permutation","difficulty":2,"accepted":23191,"submitted":31954,"acceptance":0.7257620329223259},{"id":1807,"title":"Evaluate the Bracket Pairs of a String","slug":"evaluate-the-bracket-pairs-of-a-string","difficulty":2,"accepted":41867,"submitted":60330,"acceptance":0.693966517487154},{"id":1808,"title":"Maximize Number of Nice Divisors","slug":"maximize-number-of-nice-divisors","difficulty":3,"accepted":10247,"submitted":28715,"acceptance":0.35685181960647744},{"id":1809,"title":"Ad-Free Sessions","slug":"ad-free-sessions","difficulty":1,"accepted":19606,"submitted":33259,"acceptance":0.5894945728975616},{"id":1810,"title":"Minimum Path Cost in a Hidden Grid","slug":"minimum-path-cost-in-a-hidden-grid","difficulty":2,"accepted":5528,"submitted":9405,"acceptance":0.587772461456672},{"id":1811,"title":"Find Interview Candidates","slug":"find-interview-candidates","difficulty":2,"accepted":19538,"submitted":32164,"acceptance":0.607449322223604},{"id":1812,"title":"Determine Color of a Chessboard Square","slug":"determine-color-of-a-chessboard-square","difficulty":1,"accepted":118458,"submitted":148387,"acceptance":0.7983044336768046},{"id":1813,"title":"Sentence Similarity III","slug":"sentence-similarity-iii","difficulty":2,"accepted":132510,"submitted":273585,"acceptance":0.48434672953561053},{"id":1814,"title":"Count Nice Pairs in an Array","slug":"count-nice-pairs-in-an-array","difficulty":2,"accepted":134989,"submitted":278669,"acceptance":0.4844062310483046},{"id":1815,"title":"Maximum Number of Groups Getting Fresh Donuts","slug":"maximum-number-of-groups-getting-fresh-donuts","difficulty":3,"accepted":8498,"submitted":20505,"acceptance":0.414435503535723},{"id":1816,"title":"Truncate Sentence","slug":"truncate-sentence","difficulty":1,"accepted":233680,"submitted":269383,"acceptance":0.8674637968988392},{"id":1817,"title":"Finding the Users Active Minutes","slug":"finding-the-users-active-minutes","difficulty":2,"accepted":70461,"submitted":87203,"acceptance":0.8080111922754951},{"id":1818,"title":"Minimum Absolute Sum Difference","slug":"minimum-absolute-sum-difference","difficulty":2,"accepted":32636,"submitted":100899,"acceptance":0.32345216503632346},{"id":1819,"title":"Number of Different Subsequences GCDs","slug":"number-of-different-subsequences-gcds","difficulty":3,"accepted":13084,"submitted":28980,"acceptance":0.45148378191856453},{"id":1820,"title":"Maximum Number of Accepted Invitations","slug":"maximum-number-of-accepted-invitations","difficulty":2,"accepted":11025,"submitted":21014,"acceptance":0.5246502331778814},{"id":1821,"title":"Find Customers With Positive Revenue this Year","slug":"find-customers-with-positive-revenue-this-year","difficulty":1,"accepted":37061,"submitted":42258,"acceptance":0.8770173694921671},{"id":1822,"title":"Sign of the Product of an Array","slug":"sign-of-the-product-of-an-array","difficulty":1,"accepted":440202,"submitted":679250,"acceptance":0.6480706661759293},{"id":1823,"title":"Find the Winner of the Circular Game","slug":"find-the-winner-of-the-circular-game","difficulty":2,"accepted":374934,"submitted":455921,"acceptance":0.8223661555401045},{"id":1824,"title":"Minimum Sideway Jumps","slug":"minimum-sideway-jumps","difficulty":2,"accepted":58697,"submitted":113807,"acceptance":0.5157591360812603},{"id":1825,"title":"Finding MK Average","slug":"finding-mk-average","difficulty":3,"accepted":28715,"submitted":74201,"acceptance":0.3869893936739397},{"id":1826,"title":"Faulty Sensor","slug":"faulty-sensor","difficulty":1,"accepted":7032,"submitted":13935,"acceptance":0.5046286329386437},{"id":1827,"title":"Minimum Operations to Make the Array Increasing","slug":"minimum-operations-to-make-the-array-increasing","difficulty":1,"accepted":135348,"submitted":165192,"acceptance":0.8193374981839314},{"id":1828,"title":"Queries on Number of Points Inside a Circle","slug":"queries-on-number-of-points-inside-a-circle","difficulty":2,"accepted":95506,"submitted":110071,"acceptance":0.8676763180129189},{"id":1829,"title":"Maximum XOR for Each Query","slug":"maximum-xor-for-each-query","difficulty":2,"accepted":144965,"submitted":171177,"acceptance":0.8468719512551336},{"id":1830,"title":"Minimum Number of Operations to Make String Sorted","slug":"minimum-number-of-operations-to-make-string-sorted","difficulty":3,"accepted":5556,"submitted":11011,"acceptance":0.504586322768141},{"id":1831,"title":"Maximum Transaction Each Day","slug":"maximum-transaction-each-day","difficulty":2,"accepted":28068,"submitted":34057,"acceptance":0.8241477522976187},{"id":1832,"title":"Check if the Sentence Is Pangram","slug":"check-if-the-sentence-is-pangram","difficulty":1,"accepted":541397,"submitted":643274,"acceptance":0.8416273625235903},{"id":1833,"title":"Maximum Ice Cream Bars","slug":"maximum-ice-cream-bars","difficulty":2,"accepted":190099,"submitted":256066,"acceptance":0.7423828231783993},{"id":1834,"title":"Single-Threaded CPU","slug":"single-threaded-cpu","difficulty":2,"accepted":154432,"submitted":324916,"acceptance":0.47529823092737816},{"id":1835,"title":"Find XOR Sum of All Pairs Bitwise AND","slug":"find-xor-sum-of-all-pairs-bitwise-and","difficulty":3,"accepted":26418,"submitted":42293,"acceptance":0.6246423758068711},{"id":1836,"title":"Remove Duplicates From an Unsorted Linked List","slug":"remove-duplicates-from-an-unsorted-linked-list","difficulty":2,"accepted":39965,"submitted":52828,"acceptance":0.7565116983417884},{"id":1837,"title":"Sum of Digits in Base K","slug":"sum-of-digits-in-base-k","difficulty":1,"accepted":79221,"submitted":100796,"acceptance":0.7859538076907814},{"id":1838,"title":"Frequency of the Most Frequent Element","slug":"frequency-of-the-most-frequent-element","difficulty":2,"accepted":268546,"submitted":600337,"acceptance":0.4473254188897236},{"id":1839,"title":"Longest Substring Of All Vowels in Order","slug":"longest-substring-of-all-vowels-in-order","difficulty":2,"accepted":46548,"submitted":89963,"acceptance":0.5174127141158031},{"id":1840,"title":"Maximum Building Height","slug":"maximum-building-height","difficulty":3,"accepted":9665,"submitted":25146,"acceptance":0.38435536467032533},{"id":1841,"title":"League Statistics","slug":"league-statistics","difficulty":2,"accepted":16418,"submitted":30716,"acceptance":0.5345097017840865},{"id":1842,"title":"Next Palindrome Using Same Digits","slug":"next-palindrome-using-same-digits","difficulty":3,"accepted":6988,"submitted":12904,"acceptance":0.541537507749535},{"id":1843,"title":"Suspicious Bank Accounts","slug":"suspicious-bank-accounts","difficulty":2,"accepted":15101,"submitted":34144,"acceptance":0.44227389878163076},{"id":1844,"title":"Replace All Digits with Characters","slug":"replace-all-digits-with-characters","difficulty":1,"accepted":114726,"submitted":138744,"acceptance":0.826889811451306},{"id":1845,"title":"Seat Reservation Manager","slug":"seat-reservation-manager","difficulty":2,"accepted":148920,"submitted":221807,"acceptance":0.6713945006244167},{"id":1846,"title":"Maximum Element After Decreasing and Rearranging","slug":"maximum-element-after-decreasing-and-rearranging","difficulty":2,"accepted":114976,"submitted":174901,"acceptance":0.6573776021863798},{"id":1847,"title":"Closest Room","slug":"closest-room","difficulty":3,"accepted":12380,"submitted":30103,"acceptance":0.41125469222336647},{"id":1848,"title":"Minimum Distance to the Target Element","slug":"minimum-distance-to-the-target-element","difficulty":1,"accepted":61100,"submitted":112463,"acceptance":0.5432897930875044},{"id":1849,"title":"Splitting a String Into Descending Consecutive Values","slug":"splitting-a-string-into-descending-consecutive-values","difficulty":2,"accepted":34670,"submitted":92311,"acceptance":0.37557820844753065},{"id":1850,"title":"Minimum Adjacent Swaps to Reach the Kth Smallest Number","slug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number","difficulty":2,"accepted":28018,"submitted":38992,"acceptance":0.718557652851867},{"id":1851,"title":"Minimum Interval to Include Each Query","slug":"minimum-interval-to-include-each-query","difficulty":3,"accepted":70581,"submitted":130194,"acceptance":0.5421217567629845},{"id":1852,"title":"Distinct Numbers in Each Subarray","slug":"distinct-numbers-in-each-subarray","difficulty":2,"accepted":16823,"submitted":21773,"acceptance":0.772654204749001},{"id":1853,"title":"Convert Date Format","slug":"convert-date-format","difficulty":1,"accepted":16019,"submitted":18859,"acceptance":0.8494087703483748},{"id":1854,"title":"Maximum Population Year","slug":"maximum-population-year","difficulty":1,"accepted":115870,"submitted":181590,"acceptance":0.6380857976760835},{"id":1855,"title":"Maximum Distance Between a Pair of Values","slug":"maximum-distance-between-a-pair-of-values","difficulty":2,"accepted":62483,"submitted":115107,"acceptance":0.5428253711763837},{"id":1856,"title":"Maximum Subarray Min-Product","slug":"maximum-subarray-min-product","difficulty":2,"accepted":40437,"submitted":100512,"acceptance":0.40231017191977075},{"id":1857,"title":"Largest Color Value in a Directed Graph","slug":"largest-color-value-in-a-directed-graph","difficulty":3,"accepted":149657,"submitted":261186,"acceptance":0.5729901296394141},{"id":1858,"title":"Longest Word With All Prefixes","slug":"longest-word-with-all-prefixes","difficulty":2,"accepted":14486,"submitted":20109,"acceptance":0.7203739619076036},{"id":1859,"title":"Sorting the Sentence","slug":"sorting-the-sentence","difficulty":1,"accepted":235038,"submitted":279565,"acceptance":0.8407275588861267},{"id":1860,"title":"Incremental Memory Leak","slug":"incremental-memory-leak","difficulty":2,"accepted":26174,"submitted":35917,"acceptance":0.7287356961884345},{"id":1861,"title":"Rotating the Box","slug":"rotating-the-box","difficulty":2,"accepted":169799,"submitted":214519,"acceptance":0.7915336170688844},{"id":1862,"title":"Sum of Floored Pairs","slug":"sum-of-floored-pairs","difficulty":3,"accepted":12214,"submitted":39681,"acceptance":0.3078047428240216},{"id":1863,"title":"Sum of All Subset XOR Totals","slug":"sum-of-all-subset-xor-totals","difficulty":1,"accepted":357534,"submitted":396775,"acceptance":0.9011001197152039},{"id":1864,"title":"Minimum Number of Swaps to Make the Binary String Alternating","slug":"minimum-number-of-swaps-to-make-the-binary-string-alternating","difficulty":2,"accepted":35775,"submitted":81560,"acceptance":0.43863413437959786},{"id":1865,"title":"Finding Pairs With a Certain Sum","slug":"finding-pairs-with-a-certain-sum","difficulty":2,"accepted":144723,"submitted":235079,"acceptance":0.6156355948425848},{"id":1866,"title":"Number of Ways to Rearrange Sticks With K Sticks Visible","slug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible","difficulty":3,"accepted":22703,"submitted":37175,"acceptance":0.6107061197041023},{"id":1867,"title":"Orders With Maximum Quantity Above Average","slug":"orders-with-maximum-quantity-above-average","difficulty":2,"accepted":19586,"submitted":27722,"acceptance":0.7065146814804126},{"id":1868,"title":"Product of Two Run-Length Encoded Arrays","slug":"product-of-two-run-length-encoded-arrays","difficulty":2,"accepted":63719,"submitted":106960,"acceptance":0.5957273747195213},{"id":1869,"title":"Longer Contiguous Segments of Ones than Zeros","slug":"longer-contiguous-segments-of-ones-than-zeros","difficulty":1,"accepted":66062,"submitted":105938,"acceptance":0.623591157091884},{"id":1870,"title":"Minimum Speed to Arrive on Time","slug":"minimum-speed-to-arrive-on-time","difficulty":2,"accepted":127224,"submitted":266425,"acceptance":0.47752275499671576},{"id":1871,"title":"Jump Game VII","slug":"jump-game-vii","difficulty":2,"accepted":66840,"submitted":252837,"acceptance":0.26436004224065307},{"id":1872,"title":"Stone Game VIII","slug":"stone-game-viii","difficulty":3,"accepted":13003,"submitted":24103,"acceptance":0.5394764137244327},{"id":1873,"title":"Calculate Special Bonus","slug":"calculate-special-bonus","difficulty":1,"accepted":342570,"submitted":600947,"acceptance":0.5700502706561477},{"id":1874,"title":"Minimize Product Sum of Two Arrays","slug":"minimize-product-sum-of-two-arrays","difficulty":2,"accepted":25461,"submitted":28335,"acceptance":0.8985706723133934},{"id":1875,"title":"Group Employees of the Same Salary","slug":"group-employees-of-the-same-salary","difficulty":2,"accepted":15382,"submitted":23512,"acceptance":0.6542191221503912},{"id":1876,"title":"Substrings of Size Three with Distinct Characters","slug":"substrings-of-size-three-with-distinct-characters","difficulty":1,"accepted":213859,"submitted":278929,"acceptance":0.7667148270706883},{"id":1877,"title":"Minimize Maximum Pair Sum in Array","slug":"minimize-maximum-pair-sum-in-array","difficulty":2,"accepted":331631,"submitted":398096,"acceptance":0.8330427836501748},{"id":1878,"title":"Get Biggest Three Rhombus Sums in a Grid","slug":"get-biggest-three-rhombus-sums-in-a-grid","difficulty":2,"accepted":88061,"submitted":123393,"acceptance":0.7136628495943854},{"id":1879,"title":"Minimum XOR Sum of Two Arrays","slug":"minimum-xor-sum-of-two-arrays","difficulty":3,"accepted":20535,"submitted":40303,"acceptance":0.5095154206882863},{"id":1880,"title":"Check if Word Equals Summation of Two Words","slug":"check-if-word-equals-summation-of-two-words","difficulty":1,"accepted":82893,"submitted":110214,"acceptance":0.7521095323643094},{"id":1881,"title":"Maximum Value after Insertion","slug":"maximum-value-after-insertion","difficulty":2,"accepted":33860,"submitted":86165,"acceptance":0.39296698195322927},{"id":1882,"title":"Process Tasks Using Servers","slug":"process-tasks-using-servers","difficulty":2,"accepted":46809,"submitted":111614,"acceptance":0.41938287311627576},{"id":1883,"title":"Minimum Skips to Arrive at Meeting On Time","slug":"minimum-skips-to-arrive-at-meeting-on-time","difficulty":3,"accepted":8662,"submitted":22373,"acceptance":0.3871630983775086},{"id":1884,"title":"Egg Drop With 2 Eggs and N Floors","slug":"egg-drop-with-2-eggs-and-n-floors","difficulty":2,"accepted":64089,"submitted":85926,"acceptance":0.7458627190838628},{"id":1885,"title":"Count Pairs in Two Arrays","slug":"count-pairs-in-two-arrays","difficulty":2,"accepted":12154,"submitted":20154,"acceptance":0.6030564652178227},{"id":1886,"title":"Determine Whether Matrix Can Be Obtained By Rotation","slug":"determine-whether-matrix-can-be-obtained-by-rotation","difficulty":1,"accepted":186929,"submitted":274097,"acceptance":0.6819811964377575},{"id":1887,"title":"Reduction Operations to Make the Array Elements Equal","slug":"reduction-operations-to-make-the-array-elements-equal","difficulty":2,"accepted":109546,"submitted":151027,"acceptance":0.7253405020294384},{"id":1888,"title":"Minimum Number of Flips to Make the Binary String Alternating","slug":"minimum-number-of-flips-to-make-the-binary-string-alternating","difficulty":2,"accepted":125709,"submitted":234870,"acceptance":0.5352279984672372},{"id":1889,"title":"Minimum Space Wasted From Packaging","slug":"minimum-space-wasted-from-packaging","difficulty":3,"accepted":17867,"submitted":53266,"acceptance":0.33542973003416815},{"id":1890,"title":"The Latest Login in 2020","slug":"the-latest-login-in-2020","difficulty":1,"accepted":144347,"submitted":187391,"acceptance":0.7702984668420575},{"id":1891,"title":"Cutting Ribbons","slug":"cutting-ribbons","difficulty":2,"accepted":87607,"submitted":165214,"acceptance":0.5302637790986237},{"id":1892,"title":"Page Recommendations II","slug":"page-recommendations-ii","difficulty":3,"accepted":10500,"submitted":23021,"acceptance":0.45610529516528386},{"id":1893,"title":"Check if All the Integers in a Range Are Covered","slug":"check-if-all-the-integers-in-a-range-are-covered","difficulty":1,"accepted":67803,"submitted":133199,"acceptance":0.5090353531182666},{"id":1894,"title":"Find the Student that Will Replace the Chalk","slug":"find-the-student-that-will-replace-the-chalk","difficulty":2,"accepted":203208,"submitted":382172,"acceptance":0.5317187025737102},{"id":1895,"title":"Largest Magic Square","slug":"largest-magic-square","difficulty":2,"accepted":88730,"submitted":117910,"acceptance":0.7525231108472564},{"id":1896,"title":"Minimum Cost to Change the Final Value of Expression","slug":"minimum-cost-to-change-the-final-value-of-expression","difficulty":3,"accepted":5322,"submitted":10528,"acceptance":0.5055091185410334},{"id":1897,"title":"Redistribute Characters to Make All Strings Equal","slug":"redistribute-characters-to-make-all-strings-equal","difficulty":1,"accepted":158969,"submitted":237800,"acceptance":0.6684987384356602},{"id":1898,"title":"Maximum Number of Removable Characters","slug":"maximum-number-of-removable-characters","difficulty":2,"accepted":42826,"submitted":91108,"acceptance":0.4700575141590201},{"id":1899,"title":"Merge Triplets to Form Target Triplet","slug":"merge-triplets-to-form-target-triplet","difficulty":2,"accepted":117800,"submitted":170872,"acceptance":0.6894049346879536},{"id":1900,"title":"The Earliest and Latest Rounds Where Players Compete","slug":"the-earliest-and-latest-rounds-where-players-compete","difficulty":3,"accepted":62331,"submitted":85943,"acceptance":0.7252597651932094},{"id":1901,"title":"Find a Peak Element II","slug":"find-a-peak-element-ii","difficulty":2,"accepted":179861,"submitted":329536,"acceptance":0.5458007622839386},{"id":1902,"title":"Depth of BST Given Insertion Order","slug":"depth-of-bst-given-insertion-order","difficulty":2,"accepted":2986,"submitted":7031,"acceptance":0.4246906556677571},{"id":1903,"title":"Largest Odd Number in String","slug":"largest-odd-number-in-string","difficulty":1,"accepted":562837,"submitted":837260,"acceptance":0.6722368201036715},{"id":1904,"title":"The Number of Full Rounds You Have Played","slug":"the-number-of-full-rounds-you-have-played","difficulty":2,"accepted":25726,"submitted":59238,"acceptance":0.4342820486849657},{"id":1905,"title":"Count Sub Islands","slug":"count-sub-islands","difficulty":2,"accepted":221393,"submitted":303229,"acceptance":0.7301181615214903},{"id":1906,"title":"Minimum Absolute Difference Queries","slug":"minimum-absolute-difference-queries","difficulty":2,"accepted":13848,"submitted":30295,"acceptance":0.45710513286020793},{"id":1907,"title":"Count Salary Categories","slug":"count-salary-categories","difficulty":2,"accepted":299571,"submitted":466140,"acceptance":0.6426631484103488},{"id":1908,"title":"Game of Nim","slug":"game-of-nim","difficulty":2,"accepted":5297,"submitted":8413,"acceptance":0.6296208249138239},{"id":1909,"title":"Remove One Element to Make the Array Strictly Increasing","slug":"remove-one-element-to-make-the-array-strictly-increasing","difficulty":1,"accepted":85974,"submitted":289576,"acceptance":0.29689615161477473},{"id":1910,"title":"Remove All Occurrences of a Substring","slug":"remove-all-occurrences-of-a-substring","difficulty":2,"accepted":398379,"submitted":507757,"acceptance":0.784585933822675},{"id":1911,"title":"Maximum Alternating Subsequence Sum","slug":"maximum-alternating-subsequence-sum","difficulty":2,"accepted":64576,"submitted":109409,"acceptance":0.5902256669926605},{"id":1912,"title":"Design Movie Rental System","slug":"design-movie-rental-system","difficulty":3,"accepted":73136,"submitted":117147,"acceptance":0.624309628074129},{"id":1913,"title":"Maximum Product Difference Between Two Pairs","slug":"maximum-product-difference-between-two-pairs","difficulty":1,"accepted":297396,"submitted":358143,"acceptance":0.8303833943424833},{"id":1914,"title":"Cyclically Rotating a Grid","slug":"cyclically-rotating-a-grid","difficulty":2,"accepted":16256,"submitted":31505,"acceptance":0.515981590223774},{"id":1915,"title":"Number of Wonderful Substrings","slug":"number-of-wonderful-substrings","difficulty":2,"accepted":89996,"submitted":135154,"acceptance":0.6658774435088861},{"id":1916,"title":"Count Ways to Build Rooms in an Ant Colony","slug":"count-ways-to-build-rooms-in-an-ant-colony","difficulty":3,"accepted":11076,"submitted":21686,"acceptance":0.5107442589689201},{"id":1917,"title":"Leetcodify Friends Recommendations","slug":"leetcodify-friends-recommendations","difficulty":3,"accepted":8945,"submitted":31207,"acceptance":0.28663440894671066},{"id":1918,"title":"Kth Smallest Subarray Sum","slug":"kth-smallest-subarray-sum","difficulty":2,"accepted":5908,"submitted":11070,"acceptance":0.5336946702800361},{"id":1919,"title":"Leetcodify Similar Friends","slug":"leetcodify-similar-friends","difficulty":3,"accepted":7781,"submitted":18020,"acceptance":0.43179800221975584},{"id":1920,"title":"Build Array from Permutation","slug":"build-array-from-permutation","difficulty":1,"accepted":859433,"submitted":943405,"acceptance":0.9109905077882776},{"id":1921,"title":"Eliminate Maximum Number of Monsters","slug":"eliminate-maximum-number-of-monsters","difficulty":2,"accepted":123363,"submitted":241553,"acceptance":0.5107077949766717},{"id":1922,"title":"Count Good Numbers","slug":"count-good-numbers","difficulty":2,"accepted":278270,"submitted":483634,"acceptance":0.5753731127257389},{"id":1923,"title":"Longest Common Subpath","slug":"longest-common-subpath","difficulty":3,"accepted":10147,"submitted":34463,"acceptance":0.2944317093694687},{"id":1924,"title":"Erect the Fence II","slug":"erect-the-fence-ii","difficulty":3,"accepted":995,"submitted":1933,"acceptance":0.5147439213657528},{"id":1925,"title":"Count Square Sum Triples","slug":"count-square-sum-triples","difficulty":1,"accepted":185544,"submitted":240551,"acceptance":0.7713291568108218},{"id":1926,"title":"Nearest Exit from Entrance in Maze","slug":"nearest-exit-from-entrance-in-maze","difficulty":2,"accepted":277430,"submitted":572568,"acceptance":0.4845363345489095},{"id":1927,"title":"Sum Game","slug":"sum-game","difficulty":2,"accepted":16826,"submitted":34001,"acceptance":0.494867798005941},{"id":1928,"title":"Minimum Cost to Reach Destination in Time","slug":"minimum-cost-to-reach-destination-in-time","difficulty":3,"accepted":37044,"submitted":89717,"acceptance":0.4128983358783731},{"id":1929,"title":"Concatenation of Array","slug":"concatenation-of-array","difficulty":1,"accepted":1415436,"submitted":1565387,"acceptance":0.9042083523116009},{"id":1930,"title":"Unique Length-3 Palindromic Subsequences","slug":"unique-length-3-palindromic-subsequences","difficulty":2,"accepted":366912,"submitted":497244,"acceptance":0.7378912566064145},{"id":1931,"title":"Painting a Grid With Three Different Colors","slug":"painting-a-grid-with-three-different-colors","difficulty":3,"accepted":75838,"submitted":98275,"acceptance":0.7716916815059781},{"id":1932,"title":"Merge BSTs to Create Single BST","slug":"merge-bsts-to-create-single-bst","difficulty":3,"accepted":15773,"submitted":40955,"acceptance":0.38513002075448666},{"id":1933,"title":"Check if String Is Decomposable Into Value-Equal Substrings","slug":"check-if-string-is-decomposable-into-value-equal-substrings","difficulty":1,"accepted":4777,"submitted":9370,"acceptance":0.5098185699039488},{"id":1934,"title":"Confirmation Rate","slug":"confirmation-rate","difficulty":2,"accepted":595376,"submitted":963469,"acceptance":0.6179503440172959},{"id":1935,"title":"Maximum Number of Words You Can Type","slug":"maximum-number-of-words-you-can-type","difficulty":1,"accepted":231315,"submitted":278954,"acceptance":0.8292227392329918},{"id":1936,"title":"Add Minimum Number of Rungs","slug":"add-minimum-number-of-rungs","difficulty":2,"accepted":35342,"submitted":80618,"acceptance":0.43838844922970055},{"id":1937,"title":"Maximum Number of Points with Cost","slug":"maximum-number-of-points-with-cost","difficulty":2,"accepted":158283,"submitted":378963,"acceptance":0.41767402094663597},{"id":1938,"title":"Maximum Genetic Difference Query","slug":"maximum-genetic-difference-query","difficulty":3,"accepted":7924,"submitted":16957,"acceptance":0.46729964026655657},{"id":1939,"title":"Users That Actively Request Confirmation Messages","slug":"users-that-actively-request-confirmation-messages","difficulty":1,"accepted":14514,"submitted":25553,"acceptance":0.5679959300277854},{"id":1940,"title":"Longest Common Subsequence Between Sorted Arrays","slug":"longest-common-subsequence-between-sorted-arrays","difficulty":2,"accepted":14953,"submitted":18395,"acceptance":0.8128839358521337},{"id":1941,"title":"Check if All Characters Have Equal Number of Occurrences","slug":"check-if-all-characters-have-equal-number-of-occurrences","difficulty":1,"accepted":176781,"submitted":222550,"acceptance":0.7943428443046506},{"id":1942,"title":"The Number of the Smallest Unoccupied Chair","slug":"the-number-of-the-smallest-unoccupied-chair","difficulty":2,"accepted":128286,"submitted":212556,"acceptance":0.6035397730480438},{"id":1943,"title":"Describe the Painting","slug":"describe-the-painting","difficulty":2,"accepted":19803,"submitted":38010,"acceptance":0.5209944751381216},{"id":1944,"title":"Number of Visible People in a Queue","slug":"number-of-visible-people-in-a-queue","difficulty":3,"accepted":125081,"submitted":171782,"acceptance":0.7281379888463285},{"id":1945,"title":"Sum of Digits of String After Convert","slug":"sum-of-digits-of-string-after-convert","difficulty":1,"accepted":237452,"submitted":317528,"acceptance":0.7478143659771737},{"id":1946,"title":"Largest Number After Mutating Substring","slug":"largest-number-after-mutating-substring","difficulty":2,"accepted":26569,"submitted":69899,"acceptance":0.3801055809095981},{"id":1947,"title":"Maximum Compatibility Score Sum","slug":"maximum-compatibility-score-sum","difficulty":2,"accepted":33786,"submitted":52501,"acceptance":0.643530599417154},{"id":1948,"title":"Delete Duplicate Folders in System","slug":"delete-duplicate-folders-in-system","difficulty":3,"accepted":68055,"submitted":87702,"acceptance":0.775980023260587},{"id":1949,"title":"Strong Friendship","slug":"strong-friendship","difficulty":2,"accepted":16734,"submitted":30642,"acceptance":0.5461131779909928},{"id":1950,"title":"Maximum of Minimum Values in All Subarrays","slug":"maximum-of-minimum-values-in-all-subarrays","difficulty":2,"accepted":3595,"submitted":7489,"acceptance":0.480037388169315},{"id":1951,"title":"All the Pairs With the Maximum Number of Common Followers","slug":"all-the-pairs-with-the-maximum-number-of-common-followers","difficulty":2,"accepted":14347,"submitted":20589,"acceptance":0.6968284035164408},{"id":1952,"title":"Three Divisors","slug":"three-divisors","difficulty":1,"accepted":135101,"submitted":210773,"acceptance":0.6409786832279277},{"id":1953,"title":"Maximum Number of Weeks for Which You Can Work","slug":"maximum-number-of-weeks-for-which-you-can-work","difficulty":2,"accepted":30612,"submitted":72266,"acceptance":0.4236016937425622},{"id":1954,"title":"Minimum Garden Perimeter to Collect Enough Apples","slug":"minimum-garden-perimeter-to-collect-enough-apples","difficulty":2,"accepted":21339,"submitted":38450,"acceptance":0.5549804941482445},{"id":1955,"title":"Count Number of Special Subsequences","slug":"count-number-of-special-subsequences","difficulty":3,"accepted":15412,"submitted":29243,"acceptance":0.5270321102486065},{"id":1956,"title":"Minimum Time For K Virus Variants to Spread","slug":"minimum-time-for-k-virus-variants-to-spread","difficulty":3,"accepted":1359,"submitted":2671,"acceptance":0.5087982029202546},{"id":1957,"title":"Delete Characters to Make Fancy String","slug":"delete-characters-to-make-fancy-string","difficulty":1,"accepted":340902,"submitted":460083,"acceptance":0.7409576098225755},{"id":1958,"title":"Check if Move is Legal","slug":"check-if-move-is-legal","difficulty":2,"accepted":18265,"submitted":36559,"acceptance":0.4996033808364561},{"id":1959,"title":"Minimum Total Space Wasted With K Resizing Operations","slug":"minimum-total-space-wasted-with-k-resizing-operations","difficulty":2,"accepted":11117,"submitted":25289,"acceptance":0.43959824429593897},{"id":1960,"title":"Maximum Product of the Length of Two Palindromic Substrings","slug":"maximum-product-of-the-length-of-two-palindromic-substrings","difficulty":3,"accepted":5014,"submitted":16231,"acceptance":0.3089150391226665},{"id":1961,"title":"Check If String Is a Prefix of Array","slug":"check-if-string-is-a-prefix-of-array","difficulty":1,"accepted":84752,"submitted":160570,"acceptance":0.52781964252351},{"id":1962,"title":"Remove Stones to Minimize the Total","slug":"remove-stones-to-minimize-the-total","difficulty":2,"accepted":149754,"submitted":228216,"acceptance":0.6561941318750657},{"id":1963,"title":"Minimum Number of Swaps to Make the String Balanced","slug":"minimum-number-of-swaps-to-make-the-string-balanced","difficulty":2,"accepted":244692,"submitted":313049,"acceptance":0.7816412127174979},{"id":1964,"title":"Find the Longest Valid Obstacle Course at Each Position","slug":"find-the-longest-valid-obstacle-course-at-each-position","difficulty":3,"accepted":68798,"submitted":110033,"acceptance":0.6252487889996637},{"id":1965,"title":"Employees With Missing Information","slug":"employees-with-missing-information","difficulty":1,"accepted":179214,"submitted":245145,"acceptance":0.7310530502355749},{"id":1966,"title":"Binary Searchable Numbers in an Unsorted Array","slug":"binary-searchable-numbers-in-an-unsorted-array","difficulty":2,"accepted":3842,"submitted":6048,"acceptance":0.6352513227513228},{"id":1967,"title":"Number of Strings That Appear as Substrings in Word","slug":"number-of-strings-that-appear-as-substrings-in-word","difficulty":1,"accepted":105092,"submitted":127412,"acceptance":0.8248202681066148},{"id":1968,"title":"Array With Elements Not Equal to Average of Neighbors","slug":"array-with-elements-not-equal-to-average-of-neighbors","difficulty":2,"accepted":49589,"submitted":97871,"acceptance":0.5066771566654065},{"id":1969,"title":"Minimum Non-Zero Product of the Array Elements","slug":"minimum-non-zero-product-of-the-array-elements","difficulty":2,"accepted":15958,"submitted":42569,"acceptance":0.3748737344076675},{"id":1970,"title":"Last Day Where You Can Still Cross","slug":"last-day-where-you-can-still-cross","difficulty":3,"accepted":130355,"submitted":189870,"acceptance":0.6865486912097751},{"id":1971,"title":"Find if Path Exists in Graph","slug":"find-if-path-exists-in-graph","difficulty":1,"accepted":680809,"submitted":1238607,"acceptance":0.5496569937034104},{"id":1972,"title":"First and Last Call On the Same Day","slug":"first-and-last-call-on-the-same-day","difficulty":3,"accepted":12400,"submitted":24233,"acceptance":0.5116989229562993},{"id":1973,"title":"Count Nodes Equal to Sum of Descendants","slug":"count-nodes-equal-to-sum-of-descendants","difficulty":2,"accepted":15869,"submitted":20519,"acceptance":0.7733807690433256},{"id":1974,"title":"Minimum Time to Type Word Using Special Typewriter","slug":"minimum-time-to-type-word-using-special-typewriter","difficulty":1,"accepted":66640,"submitted":84897,"acceptance":0.7849511761310765},{"id":1975,"title":"Maximum Matrix Sum","slug":"maximum-matrix-sum","difficulty":2,"accepted":235290,"submitted":348374,"acceptance":0.675394834287289},{"id":1976,"title":"Number of Ways to Arrive at Destination","slug":"number-of-ways-to-arrive-at-destination","difficulty":2,"accepted":254014,"submitted":679031,"acceptance":0.3740830683724307},{"id":1977,"title":"Number of Ways to Separate Numbers","slug":"number-of-ways-to-separate-numbers","difficulty":3,"accepted":8573,"submitted":39643,"acceptance":0.21625507655828266},{"id":1978,"title":"Employees Whose Manager Left the Company","slug":"employees-whose-manager-left-the-company","difficulty":1,"accepted":355973,"submitted":731803,"acceptance":0.486432824134364},{"id":1979,"title":"Find Greatest Common Divisor of Array","slug":"find-greatest-common-divisor-of-array","difficulty":1,"accepted":244989,"submitted":307012,"acceptance":0.797978580641799},{"id":1980,"title":"Find Unique Binary String","slug":"find-unique-binary-string","difficulty":2,"accepted":412426,"submitted":507672,"acceptance":0.8123867378937581},{"id":1981,"title":"Minimize the Difference Between Target and Chosen Elements","slug":"minimize-the-difference-between-target-and-chosen-elements","difficulty":2,"accepted":38953,"submitted":105795,"acceptance":0.36819320383761045},{"id":1982,"title":"Find Array Given Subset Sums","slug":"find-array-given-subset-sums","difficulty":3,"accepted":7904,"submitted":15966,"acceptance":0.4950519854691219},{"id":1983,"title":"Widest Pair of Indices With Equal Range Sum","slug":"widest-pair-of-indices-with-equal-range-sum","difficulty":2,"accepted":3569,"submitted":6618,"acceptance":0.5392867935932306},{"id":1984,"title":"Minimum Difference Between Highest and Lowest of K Scores","slug":"minimum-difference-between-highest-and-lowest-of-k-scores","difficulty":1,"accepted":251527,"submitted":379640,"acceptance":0.6625408281529871},{"id":1985,"title":"Find the Kth Largest Integer in the Array","slug":"find-the-kth-largest-integer-in-the-array","difficulty":2,"accepted":102402,"submitted":214309,"acceptance":0.47782407645035907},{"id":1986,"title":"Minimum Number of Work Sessions to Finish the Tasks","slug":"minimum-number-of-work-sessions-to-finish-the-tasks","difficulty":2,"accepted":34717,"submitted":99939,"acceptance":0.34738190296080607},{"id":1987,"title":"Number of Unique Good Subsequences","slug":"number-of-unique-good-subsequences","difficulty":3,"accepted":16911,"submitted":32194,"acceptance":0.5252842144498975},{"id":1988,"title":"Find Cutoff Score for Each School","slug":"find-cutoff-score-for-each-school","difficulty":2,"accepted":14015,"submitted":20923,"acceptance":0.6698370214596377},{"id":1989,"title":"Maximum Number of People That Can Be Caught in Tag","slug":"maximum-number-of-people-that-can-be-caught-in-tag","difficulty":2,"accepted":2792,"submitted":5661,"acceptance":0.4931990814343756},{"id":1990,"title":"Count the Number of Experiments","slug":"count-the-number-of-experiments","difficulty":2,"accepted":9855,"submitted":20187,"acceptance":0.4881854658938921},{"id":1991,"title":"Find the Middle Index in Array","slug":"find-the-middle-index-in-array","difficulty":1,"accepted":164994,"submitted":237801,"acceptance":0.6938322378795716},{"id":1992,"title":"Find All Groups of Farmland","slug":"find-all-groups-of-farmland","difficulty":2,"accepted":142159,"submitted":188334,"acceptance":0.7548238767296399},{"id":1993,"title":"Operations on Tree","slug":"operations-on-tree","difficulty":2,"accepted":24777,"submitted":54829,"acceptance":0.4518958945083806},{"id":1994,"title":"The Number of Good Subsets","slug":"the-number-of-good-subsets","difficulty":3,"accepted":11361,"submitted":30538,"acceptance":0.37202829261903203},{"id":1995,"title":"Count Special Quadruplets","slug":"count-special-quadruplets","difficulty":1,"accepted":62346,"submitted":96618,"acceptance":0.645283487548904},{"id":1996,"title":"The Number of Weak Characters in the Game","slug":"the-number-of-weak-characters-in-the-game","difficulty":2,"accepted":118220,"submitted":265548,"acceptance":0.4451925828852034},{"id":1997,"title":"First Day Where You Have Been in All the Rooms","slug":"first-day-where-you-have-been-in-all-the-rooms","difficulty":2,"accepted":15793,"submitted":39027,"acceptance":0.4046685627898634},{"id":1998,"title":"GCD Sort of an Array","slug":"gcd-sort-of-an-array","difficulty":3,"accepted":14814,"submitted":29867,"acceptance":0.49599892858338634},{"id":1999,"title":"Smallest Greater Multiple Made of Two Digits","slug":"smallest-greater-multiple-made-of-two-digits","difficulty":2,"accepted":2642,"submitted":5498,"acceptance":0.4805383775918516},{"id":2000,"title":"Reverse Prefix of Word","slug":"reverse-prefix-of-word","difficulty":1,"accepted":380818,"submitted":440531,"acceptance":0.8644522178915899},{"id":2001,"title":"Number of Pairs of Interchangeable Rectangles","slug":"number-of-pairs-of-interchangeable-rectangles","difficulty":2,"accepted":59176,"submitted":112690,"acceptance":0.5251220161505014},{"id":2002,"title":"Maximum Product of the Length of Two Palindromic Subsequences","slug":"maximum-product-of-the-length-of-two-palindromic-subsequences","difficulty":2,"accepted":39290,"submitted":62954,"acceptance":0.6241064904533469},{"id":2003,"title":"Smallest Missing Genetic Value in Each Subtree","slug":"smallest-missing-genetic-value-in-each-subtree","difficulty":3,"accepted":11227,"submitted":23503,"acceptance":0.4776836999531975},{"id":2004,"title":"The Number of Seniors and Juniors to Join the Company","slug":"the-number-of-seniors-and-juniors-to-join-the-company","difficulty":3,"accepted":10856,"submitted":23514,"acceptance":0.4616824019732925},{"id":2005,"title":"Subtree Removal Game with Fibonacci Tree","slug":"subtree-removal-game-with-fibonacci-tree","difficulty":3,"accepted":916,"submitted":1599,"acceptance":0.5728580362726704},{"id":2006,"title":"Count Number of Pairs With Absolute Difference K","slug":"count-number-of-pairs-with-absolute-difference-k","difficulty":1,"accepted":234634,"submitted":274881,"acceptance":0.8535839144939082},{"id":2007,"title":"Find Original Array From Doubled Array","slug":"find-original-array-from-doubled-array","difficulty":2,"accepted":155183,"submitted":380567,"acceptance":0.4077678831848269},{"id":2008,"title":"Maximum Earnings From Taxi","slug":"maximum-earnings-from-taxi","difficulty":2,"accepted":48990,"submitted":105589,"acceptance":0.46396878462718655},{"id":2009,"title":"Minimum Number of Operations to Make Array Continuous","slug":"minimum-number-of-operations-to-make-array-continuous","difficulty":3,"accepted":86980,"submitted":167086,"acceptance":0.5205702452629185},{"id":2010,"title":"The Number of Seniors and Juniors to Join the Company II","slug":"the-number-of-seniors-and-juniors-to-join-the-company-ii","difficulty":3,"accepted":7361,"submitted":11167,"acceptance":0.659174353004388},{"id":2011,"title":"Final Value of Variable After Performing Operations","slug":"final-value-of-variable-after-performing-operations","difficulty":1,"accepted":653180,"submitted":721219,"acceptance":0.9056611098709269},{"id":2012,"title":"Sum of Beauty in the Array","slug":"sum-of-beauty-in-the-array","difficulty":2,"accepted":32674,"submitted":63754,"acceptance":0.5125011763967751},{"id":2013,"title":"Detect Squares","slug":"detect-squares","difficulty":2,"accepted":107831,"submitted":205481,"acceptance":0.5247735800390304},{"id":2014,"title":"Longest Subsequence Repeated k Times","slug":"longest-subsequence-repeated-k-times","difficulty":3,"accepted":73768,"submitted":103553,"acceptance":0.712369511264763},{"id":2015,"title":"Average Height of Buildings in Each Segment","slug":"average-height-of-buildings-in-each-segment","difficulty":2,"accepted":2736,"submitted":4684,"acceptance":0.5841161400512382},{"id":2016,"title":"Maximum Difference Between Increasing Elements","slug":"maximum-difference-between-increasing-elements","difficulty":1,"accepted":287661,"submitted":432471,"acceptance":0.6651567388333554},{"id":2017,"title":"Grid Game","slug":"grid-game","difficulty":2,"accepted":139051,"submitted":228415,"acceptance":0.6087647483746689},{"id":2018,"title":"Check if Word Can Be Placed In Crossword","slug":"check-if-word-can-be-placed-in-crossword","difficulty":2,"accepted":28656,"submitted":56517,"acceptance":0.5070332820213387},{"id":2019,"title":"The Score of Students Solving Math Expression","slug":"the-score-of-students-solving-math-expression","difficulty":3,"accepted":9367,"submitted":27434,"acceptance":0.34143763213530653},{"id":2020,"title":"Number of Accounts That Did Not Stream","slug":"number-of-accounts-that-did-not-stream","difficulty":2,"accepted":13982,"submitted":19404,"acceptance":0.7205730777159348},{"id":2021,"title":"Brightest Position on Street","slug":"brightest-position-on-street","difficulty":2,"accepted":16905,"submitted":27949,"acceptance":0.604851694157215},{"id":2022,"title":"Convert 1D Array Into 2D Array","slug":"convert-1d-array-into-2d-array","difficulty":1,"accepted":292047,"submitted":404633,"acceptance":0.7217577409652698},{"id":2023,"title":"Number of Pairs of Strings With Concatenation Equal to Target","slug":"number-of-pairs-of-strings-with-concatenation-equal-to-target","difficulty":2,"accepted":62843,"submitted":83393,"acceptance":0.753576439269483},{"id":2024,"title":"Maximize the Confusion of an Exam","slug":"maximize-the-confusion-of-an-exam","difficulty":2,"accepted":144775,"submitted":207211,"acceptance":0.6986839501763903},{"id":2025,"title":"Maximum Number of Ways to Partition an Array","slug":"maximum-number-of-ways-to-partition-an-array","difficulty":3,"accepted":13820,"submitted":38785,"acceptance":0.35632332087147095},{"id":2026,"title":"Low-Quality Problems","slug":"low-quality-problems","difficulty":1,"accepted":15726,"submitted":18693,"acceptance":0.841277483549992},{"id":2027,"title":"Minimum Moves to Convert String","slug":"minimum-moves-to-convert-string","difficulty":1,"accepted":60077,"submitted":103888,"acceptance":0.5782862313260434},{"id":2028,"title":"Find Missing Observations","slug":"find-missing-observations","difficulty":2,"accepted":174720,"submitted":304454,"acceptance":0.5738797979333495},{"id":2029,"title":"Stone Game IX","slug":"stone-game-ix","difficulty":2,"accepted":11681,"submitted":38735,"acceptance":0.30156189492706853},{"id":2030,"title":"Smallest K-Length Subsequence With Occurrences of a Letter","slug":"smallest-k-length-subsequence-with-occurrences-of-a-letter","difficulty":3,"accepted":11414,"submitted":28756,"acceptance":0.3969258589511754},{"id":2031,"title":"Count Subarrays With More Ones Than Zeros","slug":"count-subarrays-with-more-ones-than-zeros","difficulty":2,"accepted":5421,"submitted":11029,"acceptance":0.4915223501677396},{"id":2032,"title":"Two Out of Three","slug":"two-out-of-three","difficulty":1,"accepted":103078,"submitted":132935,"acceptance":0.7754015120171512},{"id":2033,"title":"Minimum Operations to Make a Uni-Value Grid","slug":"minimum-operations-to-make-a-uni-value-grid","difficulty":2,"accepted":142281,"submitted":210887,"acceptance":0.6746788564491885},{"id":2034,"title":"Stock Price Fluctuation ","slug":"stock-price-fluctuation","difficulty":2,"accepted":98393,"submitted":201005,"acceptance":0.4895052361881545},{"id":2035,"title":"Partition Array Into Two Arrays to Minimize Sum Difference","slug":"partition-array-into-two-arrays-to-minimize-sum-difference","difficulty":3,"accepted":58469,"submitted":251489,"acceptance":0.23249128192485555},{"id":2036,"title":"Maximum Alternating Subarray Sum","slug":"maximum-alternating-subarray-sum","difficulty":2,"accepted":4377,"submitted":10981,"acceptance":0.39859757763409526},{"id":2037,"title":"Minimum Number of Moves to Seat Everyone","slug":"minimum-number-of-moves-to-seat-everyone","difficulty":1,"accepted":284371,"submitted":326226,"acceptance":0.8716993740535702},{"id":2038,"title":"Remove Colored Pieces if Both Neighbors are the Same Color","slug":"remove-colored-pieces-if-both-neighbors-are-the-same-color","difficulty":2,"accepted":161934,"submitted":256782,"acceptance":0.6306283150688132},{"id":2039,"title":"The Time When the Network Becomes Idle","slug":"the-time-when-the-network-becomes-idle","difficulty":2,"accepted":23534,"submitted":42423,"acceptance":0.5547462461400655},{"id":2040,"title":"Kth Smallest Product of Two Sorted Arrays","slug":"kth-smallest-product-of-two-sorted-arrays","difficulty":3,"accepted":83967,"submitted":172016,"acceptance":0.48813482466747277},{"id":2041,"title":"Accepted Candidates From the Interviews","slug":"accepted-candidates-from-the-interviews","difficulty":2,"accepted":16407,"submitted":20895,"acceptance":0.7852117731514716},{"id":2042,"title":"Check if Numbers Are Ascending in a Sentence","slug":"check-if-numbers-are-ascending-in-a-sentence","difficulty":1,"accepted":86001,"submitted":117767,"acceptance":0.7302639958562246},{"id":2043,"title":"Simple Bank System","slug":"simple-bank-system","difficulty":2,"accepted":180253,"submitted":258428,"acceptance":0.6974979491386383},{"id":2044,"title":"Count Number of Maximum Bitwise-OR Subsets","slug":"count-number-of-maximum-bitwise-or-subsets","difficulty":2,"accepted":249150,"submitted":278317,"acceptance":0.8952022334244764},{"id":2045,"title":"Second Minimum Time to Reach Destination","slug":"second-minimum-time-to-reach-destination","difficulty":3,"accepted":91612,"submitted":146905,"acceptance":0.623613900139546},{"id":2046,"title":"Sort Linked List Already Sorted Using Absolute Values","slug":"sort-linked-list-already-sorted-using-absolute-values","difficulty":2,"accepted":11219,"submitted":16721,"acceptance":0.6709526942168531},{"id":2047,"title":"Number of Valid Words in a Sentence","slug":"number-of-valid-words-in-a-sentence","difficulty":1,"accepted":42563,"submitted":136938,"acceptance":0.31081949495392075},{"id":2048,"title":"Next Greater Numerically Balanced Number","slug":"next-greater-numerically-balanced-number","difficulty":2,"accepted":106308,"submitted":168468,"acceptance":0.6310278509865375},{"id":2049,"title":"Count Nodes With the Highest Score","slug":"count-nodes-with-the-highest-score","difficulty":2,"accepted":41795,"submitted":79412,"acceptance":0.5263058479826727},{"id":2050,"title":"Parallel Courses III","slug":"parallel-courses-iii","difficulty":3,"accepted":113738,"submitted":170180,"acceptance":0.668339405335527},{"id":2051,"title":"The Category of Each Member in the Store","slug":"the-category-of-each-member-in-the-store","difficulty":2,"accepted":10856,"submitted":15405,"acceptance":0.7047062641999351},{"id":2052,"title":"Minimum Cost to Separate Sentence Into Rows","slug":"minimum-cost-to-separate-sentence-into-rows","difficulty":2,"accepted":2481,"submitted":4858,"acceptance":0.5107039934129272},{"id":2053,"title":"Kth Distinct String in an Array","slug":"kth-distinct-string-in-an-array","difficulty":1,"accepted":272370,"submitted":331692,"acceptance":0.8211533591404073},{"id":2054,"title":"Two Best Non-Overlapping Events","slug":"two-best-non-overlapping-events","difficulty":2,"accepted":177901,"submitted":277932,"acceptance":0.64008822301858},{"id":2055,"title":"Plates Between Candles","slug":"plates-between-candles","difficulty":2,"accepted":77427,"submitted":163270,"acceptance":0.47422674098119677},{"id":2056,"title":"Number of Valid Move Combinations On Chessboard","slug":"number-of-valid-move-combinations-on-chessboard","difficulty":3,"accepted":5751,"submitted":11805,"acceptance":0.4871664548919949},{"id":2057,"title":"Smallest Index With Equal Value","slug":"smallest-index-with-equal-value","difficulty":1,"accepted":86474,"submitted":118175,"acceptance":0.731745292997673},{"id":2058,"title":"Find the Minimum and Maximum Number of Nodes Between Critical Points","slug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points","difficulty":2,"accepted":204177,"submitted":293908,"acceptance":0.6946969800073493},{"id":2059,"title":"Minimum Operations to Convert Number","slug":"minimum-operations-to-convert-number","difficulty":2,"accepted":21976,"submitted":42474,"acceptance":0.5173988793144041},{"id":2060,"title":"Check if an Original String Exists Given Two Encoded Strings","slug":"check-if-an-original-string-exists-given-two-encoded-strings","difficulty":3,"accepted":19894,"submitted":45800,"acceptance":0.43436681222707424},{"id":2061,"title":"Number of Spaces Cleaning Robot Cleaned","slug":"number-of-spaces-cleaning-robot-cleaned","difficulty":2,"accepted":10991,"submitted":17562,"acceptance":0.6258398815624644},{"id":2062,"title":"Count Vowel Substrings of a String","slug":"count-vowel-substrings-of-a-string","difficulty":1,"accepted":76607,"submitted":104871,"acceptance":0.7304879327936227},{"id":2063,"title":"Vowels of All Substrings","slug":"vowels-of-all-substrings","difficulty":2,"accepted":43173,"submitted":78007,"acceptance":0.5534503313805171},{"id":2064,"title":"Minimized Maximum of Products Distributed to Any Store","slug":"minimized-maximum-of-products-distributed-to-any-store","difficulty":2,"accepted":150675,"submitted":239000,"acceptance":0.6304393305439331},{"id":2065,"title":"Maximum Path Quality of a Graph","slug":"maximum-path-quality-of-a-graph","difficulty":3,"accepted":33618,"submitted":54230,"acceptance":0.6199151761017887},{"id":2066,"title":"Account Balance","slug":"account-balance","difficulty":2,"accepted":12860,"submitted":15751,"acceptance":0.8164560980255222},{"id":2067,"title":"Number of Equal Count Substrings","slug":"number-of-equal-count-substrings","difficulty":2,"accepted":4022,"submitted":8873,"acceptance":0.4532852473796912},{"id":2068,"title":"Check Whether Two Strings are Almost Equivalent","slug":"check-whether-two-strings-are-almost-equivalent","difficulty":1,"accepted":81875,"submitted":127438,"acceptance":0.6424692791788948},{"id":2069,"title":"Walking Robot Simulation II","slug":"walking-robot-simulation-ii","difficulty":2,"accepted":86787,"submitted":200758,"acceptance":0.4322965959015332},{"id":2070,"title":"Most Beautiful Item for Each Query","slug":"most-beautiful-item-for-each-query","difficulty":2,"accepted":130011,"submitted":209317,"acceptance":0.6211201192449729},{"id":2071,"title":"Maximum Number of Tasks You Can Assign","slug":"maximum-number-of-tasks-you-can-assign","difficulty":3,"accepted":85867,"submitted":171427,"acceptance":0.500895424874728},{"id":2072,"title":"The Winner University","slug":"the-winner-university","difficulty":1,"accepted":14904,"submitted":19723,"acceptance":0.755665973736247},{"id":2073,"title":"Time Needed to Buy Tickets","slug":"time-needed-to-buy-tickets","difficulty":1,"accepted":311648,"submitted":430211,"acceptance":0.7244073257076179},{"id":2074,"title":"Reverse Nodes in Even Length Groups","slug":"reverse-nodes-in-even-length-groups","difficulty":2,"accepted":45850,"submitted":71846,"acceptance":0.6381705314144142},{"id":2075,"title":"Decode the Slanted Ciphertext","slug":"decode-the-slanted-ciphertext","difficulty":2,"accepted":100057,"submitted":148015,"acceptance":0.6759922980778975},{"id":2076,"title":"Process Restricted Friend Requests","slug":"process-restricted-friend-requests","difficulty":3,"accepted":25197,"submitted":41952,"acceptance":0.6006149885583524},{"id":2077,"title":"Paths in Maze That Lead to Same Room","slug":"paths-in-maze-that-lead-to-same-room","difficulty":2,"accepted":6452,"submitted":11424,"acceptance":0.5647759103641457},{"id":2078,"title":"Two Furthest Houses With Different Colors","slug":"two-furthest-houses-with-different-colors","difficulty":1,"accepted":93504,"submitted":142824,"acceptance":0.6546798857334901},{"id":2079,"title":"Watering Plants","slug":"watering-plants","difficulty":2,"accepted":68326,"submitted":85512,"acceptance":0.7990223594349332},{"id":2080,"title":"Range Frequency Queries","slug":"range-frequency-queries","difficulty":2,"accepted":34023,"submitted":79769,"acceptance":0.4265190738256716},{"id":2081,"title":"Sum of k-Mirror Numbers","slug":"sum-of-k-mirror-numbers","difficulty":3,"accepted":77629,"submitted":121876,"acceptance":0.6369506711739801},{"id":2082,"title":"The Number of Rich Customers","slug":"the-number-of-rich-customers","difficulty":1,"accepted":30785,"submitted":39780,"acceptance":0.7738813474107592},{"id":2083,"title":"Substrings That Begin and End With the Same Letter","slug":"substrings-that-begin-and-end-with-the-same-letter","difficulty":2,"accepted":14005,"submitted":18817,"acceptance":0.7442737949726311},{"id":2084,"title":"Drop Type 1 Orders for Customers With Type 0 Orders","slug":"drop-type-1-orders-for-customers-with-type-0-orders","difficulty":2,"accepted":14585,"submitted":16833,"acceptance":0.8664528010455652},{"id":2085,"title":"Count Common Words With One Occurrence","slug":"count-common-words-with-one-occurrence","difficulty":1,"accepted":110659,"submitted":150958,"acceptance":0.7330449529008068},{"id":2086,"title":"Minimum Number of Food Buckets to Feed the Hamsters","slug":"minimum-number-of-food-buckets-to-feed-the-hamsters","difficulty":2,"accepted":30148,"submitted":62547,"acceptance":0.4820055318400563},{"id":2087,"title":"Minimum Cost Homecoming of a Robot in a Grid","slug":"minimum-cost-homecoming-of-a-robot-in-a-grid","difficulty":2,"accepted":27131,"submitted":52379,"acceptance":0.5179747608774509},{"id":2088,"title":"Count Fertile Pyramids in a Land","slug":"count-fertile-pyramids-in-a-land","difficulty":3,"accepted":13172,"submitted":19843,"acceptance":0.663810915688152},{"id":2089,"title":"Find Target Indices After Sorting Array","slug":"find-target-indices-after-sorting-array","difficulty":1,"accepted":274646,"submitted":352423,"acceptance":0.7793078204316971},{"id":2090,"title":"K Radius Subarray Averages","slug":"k-radius-subarray-averages","difficulty":2,"accepted":198190,"submitted":429561,"acceptance":0.4613780115047688},{"id":2091,"title":"Removing Minimum and Maximum From Array","slug":"removing-minimum-and-maximum-from-array","difficulty":2,"accepted":60899,"submitted":108010,"acceptance":0.5638274233867234},{"id":2092,"title":"Find All People With Secret","slug":"find-all-people-with-secret","difficulty":3,"accepted":166968,"submitted":344893,"acceptance":0.48411536331557903},{"id":2093,"title":"Minimum Cost to Reach City With Discounts","slug":"minimum-cost-to-reach-city-with-discounts","difficulty":2,"accepted":12592,"submitted":20887,"acceptance":0.6028630248479916},{"id":2094,"title":"Finding 3-Digit Even Numbers","slug":"finding-3-digit-even-numbers","difficulty":1,"accepted":181803,"submitted":230774,"acceptance":0.7877967188678101},{"id":2095,"title":"Delete the Middle Node of a Linked List","slug":"delete-the-middle-node-of-a-linked-list","difficulty":2,"accepted":932629,"submitted":1566667,"acceptance":0.5952949797244724},{"id":2096,"title":"Step-By-Step Directions From a Binary Tree Node to Another","slug":"step-by-step-directions-from-a-binary-tree-node-to-another","difficulty":2,"accepted":238230,"submitted":422244,"acceptance":0.5641998465342314},{"id":2097,"title":"Valid Arrangement of Pairs","slug":"valid-arrangement-of-pairs","difficulty":3,"accepted":82323,"submitted":123775,"acceptance":0.6651019995960412},{"id":2098,"title":"Subsequence of Size K With the Largest Even Sum","slug":"subsequence-of-size-k-with-the-largest-even-sum","difficulty":2,"accepted":4824,"submitted":13555,"acceptance":0.35588343784581333},{"id":2099,"title":"Find Subsequence of Length K With the Largest Sum","slug":"find-subsequence-of-length-k-with-the-largest-sum","difficulty":1,"accepted":180379,"submitted":314325,"acceptance":0.5738614491370397},{"id":2100,"title":"Find Good Days to Rob the Bank","slug":"find-good-days-to-rob-the-bank","difficulty":2,"accepted":44162,"submitted":85657,"acceptance":0.5155679045495406},{"id":2101,"title":"Detonate the Maximum Bombs","slug":"detonate-the-maximum-bombs","difficulty":2,"accepted":177896,"submitted":355482,"acceptance":0.5004360277032311},{"id":2102,"title":"Sequentially Ordinal Rank Tracker","slug":"sequentially-ordinal-rank-tracker","difficulty":3,"accepted":20182,"submitted":32869,"acceptance":0.6140132039307554},{"id":2103,"title":"Rings and Rods","slug":"rings-and-rods","difficulty":1,"accepted":95096,"submitted":116741,"acceptance":0.8145895615079535},{"id":2104,"title":"Sum of Subarray Ranges","slug":"sum-of-subarray-ranges","difficulty":2,"accepted":221310,"submitted":363159,"acceptance":0.609402493122847},{"id":2105,"title":"Watering Plants II","slug":"watering-plants-ii","difficulty":2,"accepted":30834,"submitted":63358,"acceptance":0.4866630891126614},{"id":2106,"title":"Maximum Fruits Harvested After at Most K Steps","slug":"maximum-fruits-harvested-after-at-most-k-steps","difficulty":3,"accepted":86480,"submitted":141729,"acceptance":0.6101785802482202},{"id":2107,"title":"Number of Unique Flavors After Sharing K Candies","slug":"number-of-unique-flavors-after-sharing-k-candies","difficulty":2,"accepted":9679,"submitted":16012,"acceptance":0.604484136897327},{"id":2108,"title":"Find First Palindromic String in the Array","slug":"find-first-palindromic-string-in-the-array","difficulty":1,"accepted":383670,"submitted":456823,"acceptance":0.8398657685799533},{"id":2109,"title":"Adding Spaces to a String","slug":"adding-spaces-to-a-string","difficulty":2,"accepted":224067,"submitted":312069,"acceptance":0.7180046720436827},{"id":2110,"title":"Number of Smooth Descent Periods of a Stock","slug":"number-of-smooth-descent-periods-of-a-stock","difficulty":2,"accepted":142845,"submitted":210952,"acceptance":0.6771445636922143},{"id":2111,"title":"Minimum Operations to Make the Array K-Increasing","slug":"minimum-operations-to-make-the-array-k-increasing","difficulty":3,"accepted":16190,"submitted":39978,"acceptance":0.40497273500425235},{"id":2112,"title":"The Airport With the Most Traffic","slug":"the-airport-with-the-most-traffic","difficulty":2,"accepted":11998,"submitted":16759,"acceptance":0.7159138373411301},{"id":2113,"title":"Elements in Array After Removing and Replacing Elements","slug":"elements-in-array-after-removing-and-replacing-elements","difficulty":2,"accepted":2431,"submitted":3458,"acceptance":0.7030075187969925},{"id":2114,"title":"Maximum Number of Words Found in Sentences","slug":"maximum-number-of-words-found-in-sentences","difficulty":1,"accepted":408815,"submitted":471651,"acceptance":0.8667743734244177},{"id":2115,"title":"Find All Possible Recipes from Given Supplies","slug":"find-all-possible-recipes-from-given-supplies","difficulty":2,"accepted":234807,"submitted":413027,"acceptance":0.5685027855321807},{"id":2116,"title":"Check if a Parentheses String Can Be Valid","slug":"check-if-a-parentheses-string-can-be-valid","difficulty":2,"accepted":156061,"submitted":345897,"acceptance":0.4511776627146231},{"id":2117,"title":"Abbreviating the Product of a Range","slug":"abbreviating-the-product-of-a-range","difficulty":3,"accepted":4740,"submitted":19018,"acceptance":0.24923756441266168},{"id":2118,"title":"Build the Equation","slug":"build-the-equation","difficulty":3,"accepted":3760,"submitted":6602,"acceptance":0.5695243865495304},{"id":2119,"title":"A Number After a Double Reversal","slug":"a-number-after-a-double-reversal","difficulty":1,"accepted":156007,"submitted":190029,"acceptance":0.8209641686268938},{"id":2120,"title":"Execution of All Suffix Instructions Staying in a Grid","slug":"execution-of-all-suffix-instructions-staying-in-a-grid","difficulty":2,"accepted":38656,"submitted":47102,"acceptance":0.8206870196594624},{"id":2121,"title":"Intervals Between Identical Elements","slug":"intervals-between-identical-elements","difficulty":2,"accepted":27105,"submitted":59345,"acceptance":0.45673603504928806},{"id":2122,"title":"Recover the Original Array","slug":"recover-the-original-array","difficulty":3,"accepted":14006,"submitted":33731,"acceptance":0.4152263496486911},{"id":2123,"title":"Minimum Operations to Remove Adjacent Ones in Matrix","slug":"minimum-operations-to-remove-adjacent-ones-in-matrix","difficulty":3,"accepted":1320,"submitted":3072,"acceptance":0.4296875},{"id":2124,"title":"Check if All A's Appears Before All B's","slug":"check-if-all-as-appears-before-all-bs","difficulty":1,"accepted":124551,"submitted":170183,"acceptance":0.7318651099110957},{"id":2125,"title":"Number of Laser Beams in a Bank","slug":"number-of-laser-beams-in-a-bank","difficulty":2,"accepted":349260,"submitted":401362,"acceptance":0.8701870132199859},{"id":2126,"title":"Destroying Asteroids","slug":"destroying-asteroids","difficulty":2,"accepted":68124,"submitted":127380,"acceptance":0.5348092322185587},{"id":2127,"title":"Maximum Employees to Be Invited to a Meeting","slug":"maximum-employees-to-be-invited-to-a-meeting","difficulty":3,"accepted":88654,"submitted":143514,"acceptance":0.6177376423206098},{"id":2128,"title":"Remove All Ones With Row and Column Flips","slug":"remove-all-ones-with-row-and-column-flips","difficulty":2,"accepted":34638,"submitted":45456,"acceptance":0.7620116156282999},{"id":2129,"title":"Capitalize the Title","slug":"capitalize-the-title","difficulty":1,"accepted":95501,"submitted":140373,"acceptance":0.6803373868194026},{"id":2130,"title":"Maximum Twin Sum of a Linked List","slug":"maximum-twin-sum-of-a-linked-list","difficulty":2,"accepted":498080,"submitted":609869,"acceptance":0.8166999798317344},{"id":2131,"title":"Longest Palindrome by Concatenating Two Letter Words","slug":"longest-palindrome-by-concatenating-two-letter-words","difficulty":2,"accepted":243616,"submitted":455172,"acceptance":0.5352174562582935},{"id":2132,"title":"Stamping the Grid","slug":"stamping-the-grid","difficulty":3,"accepted":10196,"submitted":29018,"acceptance":0.3513681163415811},{"id":2133,"title":"Check if Every Row and Column Contains All Numbers","slug":"check-if-every-row-and-column-contains-all-numbers","difficulty":1,"accepted":115319,"submitted":213388,"acceptance":0.5404193300466755},{"id":2134,"title":"Minimum Swaps to Group All 1's Together II","slug":"minimum-swaps-to-group-all-1s-together-ii","difficulty":2,"accepted":176903,"submitted":269489,"acceptance":0.6564386672554353},{"id":2135,"title":"Count Words Obtained After Adding a Letter","slug":"count-words-obtained-after-adding-a-letter","difficulty":2,"accepted":41315,"submitted":93874,"acceptance":0.44011121290240107},{"id":2136,"title":"Earliest Possible Day of Full Bloom","slug":"earliest-possible-day-of-full-bloom","difficulty":3,"accepted":64222,"submitted":90229,"acceptance":0.7117667268838178},{"id":2137,"title":"Pour Water Between Buckets to Make Water Levels Equal","slug":"pour-water-between-buckets-to-make-water-levels-equal","difficulty":2,"accepted":3841,"submitted":5623,"acceptance":0.6830873199359773},{"id":2138,"title":"Divide a String Into Groups of Size k","slug":"divide-a-string-into-groups-of-size-k","difficulty":1,"accepted":175636,"submitted":227821,"acceptance":0.7709385877509097},{"id":2139,"title":"Minimum Moves to Reach Target Score","slug":"minimum-moves-to-reach-target-score","difficulty":2,"accepted":61393,"submitted":117284,"acceptance":0.5234558848606801},{"id":2140,"title":"Solving Questions With Brainpower","slug":"solving-questions-with-brainpower","difficulty":2,"accepted":255692,"submitted":424645,"acceptance":0.6021311919367943},{"id":2141,"title":"Maximum Running Time of N Computers","slug":"maximum-running-time-of-n-computers","difficulty":3,"accepted":139764,"submitted":247856,"acceptance":0.5638919372538893},{"id":2142,"title":"The Number of Passengers in Each Bus I","slug":"the-number-of-passengers-in-each-bus-i","difficulty":2,"accepted":12058,"submitted":24541,"acceptance":0.4913410211482825},{"id":2143,"title":"Choose Numbers From Two Arrays in Range","slug":"choose-numbers-from-two-arrays-in-range","difficulty":3,"accepted":1379,"submitted":2600,"acceptance":0.5303846153846153},{"id":2144,"title":"Minimum Cost of Buying Candies With Discount","slug":"minimum-cost-of-buying-candies-with-discount","difficulty":1,"accepted":79905,"submitted":127353,"acceptance":0.6274292713952557},{"id":2145,"title":"Count the Hidden Sequences","slug":"count-the-hidden-sequences","difficulty":2,"accepted":122435,"submitted":215818,"acceptance":0.5673067121370785},{"id":2146,"title":"K Highest Ranked Items Within a Price Range","slug":"k-highest-ranked-items-within-a-price-range","difficulty":2,"accepted":21719,"submitted":46690,"acceptance":0.46517455557935317},{"id":2147,"title":"Number of Ways to Divide a Long Corridor","slug":"number-of-ways-to-divide-a-long-corridor","difficulty":3,"accepted":140919,"submitted":258211,"acceptance":0.5457513428939897},{"id":2148,"title":"Count Elements With Strictly Smaller and Greater Elements ","slug":"count-elements-with-strictly-smaller-and-greater-elements","difficulty":1,"accepted":82272,"submitted":137359,"acceptance":0.5989560203554191},{"id":2149,"title":"Rearrange Array Elements by Sign","slug":"rearrange-array-elements-by-sign","difficulty":2,"accepted":840665,"submitted":993751,"acceptance":0.8459513499860629},{"id":2150,"title":"Find All Lonely Numbers in the Array","slug":"find-all-lonely-numbers-in-the-array","difficulty":2,"accepted":70831,"submitted":112632,"acceptance":0.6288710135663044},{"id":2151,"title":"Maximum Good People Based on Statements","slug":"maximum-good-people-based-on-statements","difficulty":3,"accepted":17156,"submitted":32766,"acceptance":0.5235915278032106},{"id":2152,"title":"Minimum Number of Lines to Cover Points","slug":"minimum-number-of-lines-to-cover-points","difficulty":2,"accepted":2842,"submitted":6467,"acceptance":0.43946188340807174},{"id":2153,"title":"The Number of Passengers in Each Bus II","slug":"the-number-of-passengers-in-each-bus-ii","difficulty":3,"accepted":3968,"submitted":9853,"acceptance":0.402719983761291},{"id":2154,"title":"Keep Multiplying Found Values by Two","slug":"keep-multiplying-found-values-by-two","difficulty":1,"accepted":281148,"submitted":374634,"acceptance":0.750460449398613},{"id":2155,"title":"All Divisions With the Highest Score of a Binary Array","slug":"all-divisions-with-the-highest-score-of-a-binary-array","difficulty":2,"accepted":36890,"submitted":56319,"acceptance":0.6550187325769279},{"id":2156,"title":"Find Substring With Given Hash Value","slug":"find-substring-with-given-hash-value","difficulty":3,"accepted":16735,"submitted":64235,"acceptance":0.26052774966918346},{"id":2157,"title":"Groups of Strings","slug":"groups-of-strings","difficulty":3,"accepted":12008,"submitted":43464,"acceptance":0.27627461807472853},{"id":2158,"title":"Amount of New Area Painted Each Day","slug":"amount-of-new-area-painted-each-day","difficulty":3,"accepted":33061,"submitted":59430,"acceptance":0.556301531213192},{"id":2159,"title":"Order Two Columns Independently","slug":"order-two-columns-independently","difficulty":2,"accepted":10833,"submitted":17586,"acceptance":0.6160013647219379},{"id":2160,"title":"Minimum Sum of Four Digit Number After Splitting Digits","slug":"minimum-sum-of-four-digit-number-after-splitting-digits","difficulty":1,"accepted":169673,"submitted":196710,"acceptance":0.8625540135224442},{"id":2161,"title":"Partition Array According to Given Pivot","slug":"partition-array-according-to-given-pivot","difficulty":2,"accepted":311041,"submitted":346443,"acceptance":0.8978129158331962},{"id":2162,"title":"Minimum Cost to Set Cooking Time","slug":"minimum-cost-to-set-cooking-time","difficulty":2,"accepted":19901,"submitted":47897,"acceptance":0.4154957512996639},{"id":2163,"title":"Minimum Difference in Sums After Removal of Elements","slug":"minimum-difference-in-sums-after-removal-of-elements","difficulty":3,"accepted":83001,"submitted":119021,"acceptance":0.6973643306643366},{"id":2164,"title":"Sort Even and Odd Indices Independently","slug":"sort-even-and-odd-indices-independently","difficulty":1,"accepted":91194,"submitted":144217,"acceptance":0.6323387672743158},{"id":2165,"title":"Smallest Value of the Rearranged Number","slug":"smallest-value-of-the-rearranged-number","difficulty":2,"accepted":48161,"submitted":90005,"acceptance":0.5350924948613965},{"id":2166,"title":"Design Bitset","slug":"design-bitset","difficulty":2,"accepted":28315,"submitted":86686,"acceptance":0.32663867291142745},{"id":2167,"title":"Minimum Time to Remove All Cars Containing Illegal Goods","slug":"minimum-time-to-remove-all-cars-containing-illegal-goods","difficulty":3,"accepted":15301,"submitted":36484,"acceptance":0.4193893213463436},{"id":2168,"title":"Unique Substrings With Equal Digit Frequency","slug":"unique-substrings-with-equal-digit-frequency","difficulty":2,"accepted":9876,"submitted":15284,"acceptance":0.6461659251504842},{"id":2169,"title":"Count Operations to Obtain Zero","slug":"count-operations-to-obtain-zero","difficulty":1,"accepted":228038,"submitted":285846,"acceptance":0.7977652302288645},{"id":2170,"title":"Minimum Operations to Make the Array Alternating","slug":"minimum-operations-to-make-the-array-alternating","difficulty":2,"accepted":30327,"submitted":85016,"acceptance":0.35672108779523853},{"id":2171,"title":"Removing Minimum Number of Magic Beans","slug":"removing-minimum-number-of-magic-beans","difficulty":2,"accepted":35586,"submitted":79937,"acceptance":0.44517557576591565},{"id":2172,"title":"Maximum AND Sum of Array","slug":"maximum-and-sum-of-array","difficulty":3,"accepted":17860,"submitted":35259,"acceptance":0.5065373379846281},{"id":2173,"title":"Longest Winning Streak","slug":"longest-winning-streak","difficulty":3,"accepted":7677,"submitted":14186,"acceptance":0.5411673480896658},{"id":2174,"title":"Remove All Ones With Row and Column Flips II","slug":"remove-all-ones-with-row-and-column-flips-ii","difficulty":2,"accepted":5659,"submitted":8411,"acceptance":0.6728094162406373},{"id":2175,"title":"The Change in Global Rankings","slug":"the-change-in-global-rankings","difficulty":2,"accepted":8997,"submitted":14741,"acceptance":0.6103385116342175},{"id":2176,"title":"Count Equal and Divisible Pairs in an Array","slug":"count-equal-and-divisible-pairs-in-an-array","difficulty":1,"accepted":235322,"submitted":280308,"acceptance":0.8395122508098235},{"id":2177,"title":"Find Three Consecutive Integers That Sum to a Given Number","slug":"find-three-consecutive-integers-that-sum-to-a-given-number","difficulty":2,"accepted":66056,"submitted":101159,"acceptance":0.6529918247511344},{"id":2178,"title":"Maximum Split of Positive Even Integers","slug":"maximum-split-of-positive-even-integers","difficulty":2,"accepted":56198,"submitted":94193,"acceptance":0.5966260762477041},{"id":2179,"title":"Count Good Triplets in an Array","slug":"count-good-triplets-in-an-array","difficulty":3,"accepted":77089,"submitted":117382,"acceptance":0.6567361264929887},{"id":2180,"title":"Count Integers With Even Digit Sum","slug":"count-integers-with-even-digit-sum","difficulty":1,"accepted":97084,"submitted":138692,"acceptance":0.6999971159115161},{"id":2181,"title":"Merge Nodes in Between Zeros","slug":"merge-nodes-in-between-zeros","difficulty":2,"accepted":343667,"submitted":383266,"acceptance":0.8966801125067185},{"id":2182,"title":"Construct String With Repeat Limit","slug":"construct-string-with-repeat-limit","difficulty":2,"accepted":129956,"submitted":183488,"acceptance":0.7082534007673527},{"id":2183,"title":"Count Array Pairs Divisible by K","slug":"count-array-pairs-divisible-by-k","difficulty":3,"accepted":23291,"submitted":76013,"acceptance":0.30640811440148397},{"id":2184,"title":"Number of Ways to Build Sturdy Brick Wall","slug":"number-of-ways-to-build-sturdy-brick-wall","difficulty":2,"accepted":10106,"submitted":20402,"acceptance":0.4953435937653171},{"id":2185,"title":"Counting Words With a Given Prefix","slug":"counting-words-with-a-given-prefix","difficulty":1,"accepted":304265,"submitted":360357,"acceptance":0.8443432485007922},{"id":2186,"title":"Minimum Number of Steps to Make Two Strings Anagram II","slug":"minimum-number-of-steps-to-make-two-strings-anagram-ii","difficulty":2,"accepted":54415,"submitted":74550,"acceptance":0.7299128101945004},{"id":2187,"title":"Minimum Time to Complete Trips","slug":"minimum-time-to-complete-trips","difficulty":2,"accepted":153642,"submitted":387599,"acceptance":0.39639421154337345},{"id":2188,"title":"Minimum Time to Finish the Race","slug":"minimum-time-to-finish-the-race","difficulty":3,"accepted":15700,"submitted":36256,"acceptance":0.43303177405119153},{"id":2189,"title":"Number of Ways to Build House of Cards","slug":"number-of-ways-to-build-house-of-cards","difficulty":2,"accepted":3793,"submitted":6030,"acceptance":0.6290215588723052},{"id":2190,"title":"Most Frequent Number Following Key In an Array","slug":"most-frequent-number-following-key-in-an-array","difficulty":1,"accepted":50860,"submitted":85585,"acceptance":0.5942630133785126},{"id":2191,"title":"Sort the Jumbled Numbers","slug":"sort-the-jumbled-numbers","difficulty":2,"accepted":155401,"submitted":259146,"acceptance":0.5996658254420288},{"id":2192,"title":"All Ancestors of a Node in a Directed Acyclic Graph","slug":"all-ancestors-of-a-node-in-a-directed-acyclic-graph","difficulty":2,"accepted":160826,"submitted":259000,"acceptance":0.620949806949807},{"id":2193,"title":"Minimum Number of Moves to Make Palindrome","slug":"minimum-number-of-moves-to-make-palindrome","difficulty":3,"accepted":35096,"submitted":66609,"acceptance":0.5268957648365836},{"id":2194,"title":"Cells in a Range on an Excel Sheet","slug":"cells-in-a-range-on-an-excel-sheet","difficulty":1,"accepted":86313,"submitted":102577,"acceptance":0.8414459381732747},{"id":2195,"title":"Append K Integers With Minimal Sum","slug":"append-k-integers-with-minimal-sum","difficulty":2,"accepted":42162,"submitted":156529,"acceptance":0.2693558382152828},{"id":2196,"title":"Create Binary Tree From Descriptions","slug":"create-binary-tree-from-descriptions","difficulty":2,"accepted":170909,"submitted":209158,"acceptance":0.8171286778416317},{"id":2197,"title":"Replace Non-Coprime Numbers in Array","slug":"replace-non-coprime-numbers-in-array","difficulty":3,"accepted":114137,"submitted":197810,"acceptance":0.5770031848743744},{"id":2198,"title":"Number of Single Divisor Triplets","slug":"number-of-single-divisor-triplets","difficulty":2,"accepted":1571,"submitted":2872,"acceptance":0.5470055710306406},{"id":2199,"title":"Finding the Topic of Each Post","slug":"finding-the-topic-of-each-post","difficulty":3,"accepted":5407,"submitted":10737,"acceptance":0.5035857315823787},{"id":2200,"title":"Find All K-Distant Indices in an Array","slug":"find-all-k-distant-indices-in-an-array","difficulty":1,"accepted":181063,"submitted":234003,"acceptance":0.7737635842275526},{"id":2201,"title":"Count Artifacts That Can Be Extracted","slug":"count-artifacts-that-can-be-extracted","difficulty":2,"accepted":23285,"submitted":40778,"acceptance":0.5710186865466673},{"id":2202,"title":"Maximize the Topmost Element After K Moves","slug":"maximize-the-topmost-element-after-k-moves","difficulty":2,"accepted":38414,"submitted":159570,"acceptance":0.2407344738986025},{"id":2203,"title":"Minimum Weighted Subgraph With the Required Paths","slug":"minimum-weighted-subgraph-with-the-required-paths","difficulty":3,"accepted":21919,"submitted":52696,"acceptance":0.41595187490511615},{"id":2204,"title":"Distance to a Cycle in Undirected Graph","slug":"distance-to-a-cycle-in-undirected-graph","difficulty":3,"accepted":7221,"submitted":9782,"acceptance":0.7381925986505827},{"id":2205,"title":"The Number of Users That Are Eligible for Discount","slug":"the-number-of-users-that-are-eligible-for-discount","difficulty":1,"accepted":8533,"submitted":16853,"acceptance":0.5063193496706818},{"id":2206,"title":"Divide Array Into Equal Pairs","slug":"divide-array-into-equal-pairs","difficulty":1,"accepted":301610,"submitted":380642,"acceptance":0.7923718349525276},{"id":2207,"title":"Maximize Number of Subsequences in a String","slug":"maximize-number-of-subsequences-in-a-string","difficulty":2,"accepted":24798,"submitted":68815,"acceptance":0.36035748020053765},{"id":2208,"title":"Minimum Operations to Halve Array Sum","slug":"minimum-operations-to-halve-array-sum","difficulty":2,"accepted":53650,"submitted":107134,"acceptance":0.5007747307110721},{"id":2209,"title":"Minimum White Tiles After Covering With Carpets","slug":"minimum-white-tiles-after-covering-with-carpets","difficulty":3,"accepted":16273,"submitted":42017,"acceptance":0.3872956184401552},{"id":2210,"title":"Count Hills and Valleys in an Array","slug":"count-hills-and-valleys-in-an-array","difficulty":1,"accepted":181605,"submitted":262945,"acceptance":0.6906577421133697},{"id":2211,"title":"Count Collisions on a Road","slug":"count-collisions-on-a-road","difficulty":2,"accepted":127348,"submitted":219313,"acceptance":0.5806678126695636},{"id":2212,"title":"Maximum Points in an Archery Competition","slug":"maximum-points-in-an-archery-competition","difficulty":2,"accepted":19757,"submitted":38436,"acceptance":0.514023311478822},{"id":2213,"title":"Longest Substring of One Repeating Character","slug":"longest-substring-of-one-repeating-character","difficulty":3,"accepted":6687,"submitted":19510,"acceptance":0.34274730907227063},{"id":2214,"title":"Minimum Health to Beat Game","slug":"minimum-health-to-beat-game","difficulty":2,"accepted":40648,"submitted":69070,"acceptance":0.5885044158100478},{"id":2215,"title":"Find the Difference of Two Arrays","slug":"find-the-difference-of-two-arrays","difficulty":1,"accepted":640436,"submitted":786993,"acceptance":0.8137759802183755},{"id":2216,"title":"Minimum Deletions to Make Array Beautiful","slug":"minimum-deletions-to-make-array-beautiful","difficulty":2,"accepted":40430,"submitted":81011,"acceptance":0.499068027798694},{"id":2217,"title":"Find Palindrome With Fixed Length","slug":"find-palindrome-with-fixed-length","difficulty":2,"accepted":27769,"submitted":73059,"acceptance":0.38009006419469193},{"id":2218,"title":"Maximum Value of K Coins From Piles","slug":"maximum-value-of-k-coins-from-piles","difficulty":3,"accepted":82032,"submitted":135743,"acceptance":0.6043184547269472},{"id":2219,"title":"Maximum Sum Score of Array","slug":"maximum-sum-score-of-array","difficulty":2,"accepted":5824,"submitted":9309,"acceptance":0.6256311096788054},{"id":2220,"title":"Minimum Bit Flips to Convert Number","slug":"minimum-bit-flips-to-convert-number","difficulty":1,"accepted":372184,"submitted":423742,"acceptance":0.8783269064666708},{"id":2221,"title":"Find Triangular Sum of an Array","slug":"find-triangular-sum-of-an-array","difficulty":2,"accepted":239362,"submitted":292006,"acceptance":0.8197160332321939},{"id":2222,"title":"Number of Ways to Select Buildings","slug":"number-of-ways-to-select-buildings","difficulty":2,"accepted":53244,"submitted":104692,"acceptance":0.5085775417414893},{"id":2223,"title":"Sum of Scores of Built Strings","slug":"sum-of-scores-of-built-strings","difficulty":3,"accepted":15006,"submitted":31486,"acceptance":0.47659277139045925},{"id":2224,"title":"Minimum Number of Operations to Convert Time","slug":"minimum-number-of-operations-to-convert-time","difficulty":1,"accepted":55203,"submitted":83197,"acceptance":0.6635215212086975},{"id":2225,"title":"Find Players With Zero or One Losses","slug":"find-players-with-zero-or-one-losses","difficulty":2,"accepted":314427,"submitted":433965,"acceptance":0.7245446061318309},{"id":2226,"title":"Maximum Candies Allocated to K Children","slug":"maximum-candies-allocated-to-k-children","difficulty":2,"accepted":205353,"submitted":411679,"acceptance":0.498818254028017},{"id":2227,"title":"Encrypt and Decrypt Strings","slug":"encrypt-and-decrypt-strings","difficulty":3,"accepted":17462,"submitted":45669,"acceptance":0.38236002540016206},{"id":2228,"title":"Users With Two Purchases Within Seven Days","slug":"users-with-two-purchases-within-seven-days","difficulty":2,"accepted":12119,"submitted":25855,"acceptance":0.468729452717076},{"id":2229,"title":"Check if an Array Is Consecutive","slug":"check-if-an-array-is-consecutive","difficulty":1,"accepted":7931,"submitted":12769,"acceptance":0.6211136345837576},{"id":2230,"title":"The Users That Are Eligible for Discount","slug":"the-users-that-are-eligible-for-discount","difficulty":1,"accepted":7538,"submitted":14823,"acceptance":0.5085340349456925},{"id":2231,"title":"Largest Number After Digit Swaps by Parity","slug":"largest-number-after-digit-swaps-by-parity","difficulty":1,"accepted":66592,"submitted":102107,"acceptance":0.6521785969620104},{"id":2232,"title":"Minimize Result by Adding Parentheses to Expression","slug":"minimize-result-by-adding-parentheses-to-expression","difficulty":2,"accepted":27005,"submitted":39614,"acceptance":0.6817034381784217},{"id":2233,"title":"Maximum Product After K Increments","slug":"maximum-product-after-k-increments","difficulty":2,"accepted":44315,"submitted":102335,"acceptance":0.43303854986075146},{"id":2234,"title":"Maximum Total Beauty of the Gardens","slug":"maximum-total-beauty-of-the-gardens","difficulty":3,"accepted":9587,"submitted":31706,"acceptance":0.3023717908282344},{"id":2235,"title":"Add Two Integers","slug":"add-two-integers","difficulty":1,"accepted":881435,"submitted":1002239,"acceptance":0.8794658759038513},{"id":2236,"title":"Root Equals Sum of Children","slug":"root-equals-sum-of-children","difficulty":1,"accepted":350575,"submitted":412880,"acceptance":0.8490965898081767},{"id":2237,"title":"Count Positions on Street With Required Brightness","slug":"count-positions-on-street-with-required-brightness","difficulty":2,"accepted":5100,"submitted":8100,"acceptance":0.6296296296296297},{"id":2238,"title":"Number of Times a Driver Was a Passenger","slug":"number-of-times-a-driver-was-a-passenger","difficulty":2,"accepted":11300,"submitted":15755,"acceptance":0.7172326245636306},{"id":2239,"title":"Find Closest Number to Zero","slug":"find-closest-number-to-zero","difficulty":1,"accepted":208898,"submitted":436751,"acceptance":0.47829999244420734},{"id":2240,"title":"Number of Ways to Buy Pens and Pencils","slug":"number-of-ways-to-buy-pens-and-pencils","difficulty":2,"accepted":39165,"submitted":69080,"acceptance":0.5669513607411697},{"id":2241,"title":"Design an ATM Machine","slug":"design-an-atm-machine","difficulty":2,"accepted":35339,"submitted":78618,"acceptance":0.44950265842427944},{"id":2242,"title":"Maximum Score of a Node Sequence","slug":"maximum-score-of-a-node-sequence","difficulty":3,"accepted":17451,"submitted":43718,"acceptance":0.3991719657806853},{"id":2243,"title":"Calculate Digit Sum of a String","slug":"calculate-digit-sum-of-a-string","difficulty":1,"accepted":54500,"submitted":80483,"acceptance":0.6771616366189133},{"id":2244,"title":"Minimum Rounds to Complete All Tasks","slug":"minimum-rounds-to-complete-all-tasks","difficulty":2,"accepted":173056,"submitted":273527,"acceptance":0.6326834279614079},{"id":2245,"title":"Maximum Trailing Zeros in a Cornered Path","slug":"maximum-trailing-zeros-in-a-cornered-path","difficulty":2,"accepted":9718,"submitted":25925,"acceptance":0.37485053037608485},{"id":2246,"title":"Longest Path With Different Adjacent Characters","slug":"longest-path-with-different-adjacent-characters","difficulty":3,"accepted":92601,"submitted":171588,"acceptance":0.5396706063361074},{"id":2247,"title":"Maximum Cost of Trip With K Highways","slug":"maximum-cost-of-trip-with-k-highways","difficulty":3,"accepted":2400,"submitted":4703,"acceptance":0.5103125664469488},{"id":2248,"title":"Intersection of Multiple Arrays","slug":"intersection-of-multiple-arrays","difficulty":1,"accepted":128153,"submitted":186664,"acceptance":0.6865437363390906},{"id":2249,"title":"Count Lattice Points Inside a Circle","slug":"count-lattice-points-inside-a-circle","difficulty":2,"accepted":32649,"submitted":57743,"acceptance":0.5654191850094383},{"id":2250,"title":"Count Number of Rectangles Containing Each Point","slug":"count-number-of-rectangles-containing-each-point","difficulty":2,"accepted":23270,"submitted":62046,"acceptance":0.3750443219546788},{"id":2251,"title":"Number of Flowers in Full Bloom","slug":"number-of-flowers-in-full-bloom","difficulty":3,"accepted":108462,"submitted":187773,"acceptance":0.5776229809397517},{"id":2252,"title":"Dynamic Pivoting of a Table","slug":"dynamic-pivoting-of-a-table","difficulty":3,"accepted":2198,"submitted":3849,"acceptance":0.5710574175110418},{"id":2253,"title":"Dynamic Unpivoting of a Table","slug":"dynamic-unpivoting-of-a-table","difficulty":3,"accepted":1459,"submitted":2105,"acceptance":0.6931116389548694},{"id":2254,"title":"Design Video Sharing Platform","slug":"design-video-sharing-platform","difficulty":3,"accepted":5579,"submitted":8713,"acceptance":0.6403075863652015},{"id":2255,"title":"Count Prefixes of a Given String","slug":"count-prefixes-of-a-given-string","difficulty":1,"accepted":89000,"submitted":119834,"acceptance":0.7426940601164945},{"id":2256,"title":"Minimum Average Difference","slug":"minimum-average-difference","difficulty":2,"accepted":97716,"submitted":222909,"acceptance":0.43836722608777573},{"id":2257,"title":"Count Unguarded Cells in the Grid","slug":"count-unguarded-cells-in-the-grid","difficulty":2,"accepted":206385,"submitted":299186,"acceptance":0.6898217162567767},{"id":2258,"title":"Escape the Spreading Fire","slug":"escape-the-spreading-fire","difficulty":3,"accepted":20614,"submitted":54300,"acceptance":0.3796316758747698},{"id":2259,"title":"Remove Digit From Number to Maximize Result","slug":"remove-digit-from-number-to-maximize-result","difficulty":1,"accepted":129012,"submitted":266641,"acceptance":0.48384156975108855},{"id":2260,"title":"Minimum Consecutive Cards to Pick Up","slug":"minimum-consecutive-cards-to-pick-up","difficulty":2,"accepted":120474,"submitted":224521,"acceptance":0.5365823241478526},{"id":2261,"title":"K Divisible Elements Subarrays","slug":"k-divisible-elements-subarrays","difficulty":2,"accepted":48855,"submitted":89055,"acceptance":0.5485935657739599},{"id":2262,"title":"Total Appeal of A String","slug":"total-appeal-of-a-string","difficulty":3,"accepted":46736,"submitted":82878,"acceptance":0.5639132218441565},{"id":2263,"title":"Make Array Non-decreasing or Non-increasing","slug":"make-array-non-decreasing-or-non-increasing","difficulty":3,"accepted":4792,"submitted":7309,"acceptance":0.6556300451498153},{"id":2264,"title":"Largest 3-Same-Digit Number in String","slug":"largest-3-same-digit-number-in-string","difficulty":1,"accepted":325642,"submitted":448008,"acceptance":0.726866484527062},{"id":2265,"title":"Count Nodes Equal to Average of Subtree","slug":"count-nodes-equal-to-average-of-subtree","difficulty":2,"accepted":198018,"submitted":228252,"acceptance":0.867541138741391},{"id":2266,"title":"Count Number of Texts","slug":"count-number-of-texts","difficulty":2,"accepted":29571,"submitted":59047,"acceptance":0.5008044439175572},{"id":2267,"title":" Check if There Is a Valid Parentheses String Path","slug":"check-if-there-is-a-valid-parentheses-string-path","difficulty":3,"accepted":20110,"submitted":50116,"acceptance":0.4012690557905659},{"id":2268,"title":"Minimum Number of Keypresses","slug":"minimum-number-of-keypresses","difficulty":2,"accepted":37159,"submitted":52004,"acceptance":0.714541189139297},{"id":2269,"title":"Find the K-Beauty of a Number","slug":"find-the-k-beauty-of-a-number","difficulty":1,"accepted":90871,"submitted":143720,"acceptance":0.6322780406345672},{"id":2270,"title":"Number of Ways to Split Array","slug":"number-of-ways-to-split-array","difficulty":2,"accepted":236503,"submitted":423152,"acceptance":0.5589079101599426},{"id":2271,"title":"Maximum White Tiles Covered by a Carpet","slug":"maximum-white-tiles-covered-by-a-carpet","difficulty":2,"accepted":21932,"submitted":61245,"acceptance":0.3581027022614091},{"id":2272,"title":"Substring With Largest Variance","slug":"substring-with-largest-variance","difficulty":3,"accepted":75948,"submitted":165056,"acceptance":0.46013474214811945},{"id":2273,"title":"Find Resultant Array After Removing Anagrams","slug":"find-resultant-array-after-removing-anagrams","difficulty":1,"accepted":208210,"submitted":297727,"acceptance":0.6993319383193328},{"id":2274,"title":"Maximum Consecutive Floors Without Special Floors","slug":"maximum-consecutive-floors-without-special-floors","difficulty":2,"accepted":41599,"submitted":79178,"acceptance":0.5253858395008715},{"id":2275,"title":"Largest Combination With Bitwise AND Greater Than Zero","slug":"largest-combination-with-bitwise-and-greater-than-zero","difficulty":2,"accepted":156517,"submitted":193783,"acceptance":0.8076921092149466},{"id":2276,"title":"Count Integers in Intervals","slug":"count-integers-in-intervals","difficulty":3,"accepted":29131,"submitted":81307,"acceptance":0.3582840345849681},{"id":2277,"title":"Closest Node to Path in Tree","slug":"closest-node-to-path-in-tree","difficulty":3,"accepted":6616,"submitted":10614,"acceptance":0.6233276804220841},{"id":2278,"title":"Percentage of Letter in String","slug":"percentage-of-letter-in-string","difficulty":1,"accepted":100141,"submitted":133214,"acceptance":0.7517302986172625},{"id":2279,"title":"Maximum Bags With Full Capacity of Rocks","slug":"maximum-bags-with-full-capacity-of-rocks","difficulty":2,"accepted":112926,"submitted":165956,"acceptance":0.6804574706548724},{"id":2280,"title":"Minimum Lines to Represent a Line Chart","slug":"minimum-lines-to-represent-a-line-chart","difficulty":2,"accepted":32262,"submitted":119709,"acceptance":0.2695035460992908},{"id":2281,"title":"Sum of Total Strength of Wizards","slug":"sum-of-total-strength-of-wizards","difficulty":3,"accepted":25562,"submitted":87447,"acceptance":0.292314201745057},{"id":2282,"title":"Number of People That Can Be Seen in a Grid","slug":"number-of-people-that-can-be-seen-in-a-grid","difficulty":2,"accepted":2655,"submitted":5602,"acceptance":0.47393787932881115},{"id":2283,"title":"Check if Number Has Equal Digit Count and Digit Value","slug":"check-if-number-has-equal-digit-count-and-digit-value","difficulty":1,"accepted":84951,"submitted":116186,"acceptance":0.7311638235243489},{"id":2284,"title":"Sender With Largest Word Count","slug":"sender-with-largest-word-count","difficulty":2,"accepted":45065,"submitted":75550,"acceptance":0.5964923891462608},{"id":2285,"title":"Maximum Total Importance of Roads","slug":"maximum-total-importance-of-roads","difficulty":2,"accepted":161925,"submitted":234304,"acceptance":0.6910893540016388},{"id":2286,"title":"Booking Concert Tickets in Groups","slug":"booking-concert-tickets-in-groups","difficulty":3,"accepted":9810,"submitted":50261,"acceptance":0.19518115437416686},{"id":2287,"title":"Rearrange Characters to Make Target String","slug":"rearrange-characters-to-make-target-string","difficulty":1,"accepted":56243,"submitted":91920,"acceptance":0.6118690165361184},{"id":2288,"title":"Apply Discount to Prices","slug":"apply-discount-to-prices","difficulty":2,"accepted":31884,"submitted":93731,"acceptance":0.3401649400945258},{"id":2289,"title":"Steps to Make Array Non-decreasing","slug":"steps-to-make-array-non-decreasing","difficulty":2,"accepted":31374,"submitted":126877,"acceptance":0.24727886062879798},{"id":2290,"title":"Minimum Obstacle Removal to Reach Corner","slug":"minimum-obstacle-removal-to-reach-corner","difficulty":3,"accepted":122498,"submitted":173603,"acceptance":0.7056214466339867},{"id":2291,"title":"Maximum Profit From Trading Stocks","slug":"maximum-profit-from-trading-stocks","difficulty":2,"accepted":17590,"submitted":36540,"acceptance":0.4813902572523262},{"id":2292,"title":"Products With Three or More Orders in Two Consecutive Years","slug":"products-with-three-or-more-orders-in-two-consecutive-years","difficulty":2,"accepted":10637,"submitted":26152,"acceptance":0.40673753441419397},{"id":2293,"title":"Min Max Game","slug":"min-max-game","difficulty":1,"accepted":66122,"submitted":102854,"acceptance":0.6428724211017559},{"id":2294,"title":"Partition Array Such That Maximum Difference Is K","slug":"partition-array-such-that-maximum-difference-is-k","difficulty":2,"accepted":169844,"submitted":207592,"acceptance":0.8181625496165555},{"id":2295,"title":"Replace Elements in an Array","slug":"replace-elements-in-an-array","difficulty":2,"accepted":47747,"submitted":79962,"acceptance":0.5971211325379555},{"id":2296,"title":"Design a Text Editor","slug":"design-a-text-editor","difficulty":3,"accepted":42218,"submitted":83803,"acceptance":0.5037767144374307},{"id":2297,"title":"Jump Game VIII","slug":"jump-game-viii","difficulty":2,"accepted":7964,"submitted":17465,"acceptance":0.45599770970512454},{"id":2298,"title":"Tasks Count in the Weekend","slug":"tasks-count-in-the-weekend","difficulty":2,"accepted":9236,"submitted":11292,"acceptance":0.8179241941197308},{"id":2299,"title":"Strong Password Checker II","slug":"strong-password-checker-ii","difficulty":1,"accepted":57848,"submitted":104477,"acceptance":0.5536912430487093},{"id":2300,"title":"Successful Pairs of Spells and Potions","slug":"successful-pairs-of-spells-and-potions","difficulty":2,"accepted":383269,"submitted":773731,"acceptance":0.49535174369386775},{"id":2301,"title":"Match Substring After Replacement","slug":"match-substring-after-replacement","difficulty":3,"accepted":17934,"submitted":41445,"acceptance":0.4327180600796236},{"id":2302,"title":"Count Subarrays With Score Less Than K","slug":"count-subarrays-with-score-less-than-k","difficulty":3,"accepted":146446,"submitted":234998,"acceptance":0.6231797717427382},{"id":2303,"title":"Calculate Amount Paid in Taxes","slug":"calculate-amount-paid-in-taxes","difficulty":1,"accepted":57009,"submitted":82440,"acceptance":0.6915211062590976},{"id":2304,"title":"Minimum Path Cost in a Grid","slug":"minimum-path-cost-in-a-grid","difficulty":2,"accepted":40810,"submitted":59988,"acceptance":0.680302727212109},{"id":2305,"title":"Fair Distribution of Cookies","slug":"fair-distribution-of-cookies","difficulty":2,"accepted":120705,"submitted":172753,"acceptance":0.6987143493890121},{"id":2306,"title":"Naming a Company","slug":"naming-a-company","difficulty":3,"accepted":65551,"submitted":140960,"acceptance":0.4650326333711691},{"id":2307,"title":"Check for Contradictions in Equations","slug":"check-for-contradictions-in-equations","difficulty":3,"accepted":5254,"submitted":11991,"acceptance":0.43816195479943293},{"id":2308,"title":"Arrange Table by Gender","slug":"arrange-table-by-gender","difficulty":2,"accepted":8567,"submitted":12090,"acceptance":0.7086021505376344},{"id":2309,"title":"Greatest English Letter in Upper and Lower Case","slug":"greatest-english-letter-in-upper-and-lower-case","difficulty":1,"accepted":73011,"submitted":101431,"acceptance":0.7198095256874131},{"id":2310,"title":"Sum of Numbers With Units Digit K","slug":"sum-of-numbers-with-units-digit-k","difficulty":2,"accepted":32434,"submitted":115099,"acceptance":0.2817921962831997},{"id":2311,"title":"Longest Binary Subsequence Less Than or Equal to K","slug":"longest-binary-subsequence-less-than-or-equal-to-k","difficulty":2,"accepted":111403,"submitted":210994,"acceptance":0.5279913172886432},{"id":2312,"title":"Selling Pieces of Wood","slug":"selling-pieces-of-wood","difficulty":3,"accepted":15657,"submitted":29653,"acceptance":0.5280072842545442},{"id":2313,"title":"Minimum Flips in Binary Tree to Get Result","slug":"minimum-flips-in-binary-tree-to-get-result","difficulty":3,"accepted":5080,"submitted":8942,"acceptance":0.5681055692238872},{"id":2314,"title":"The First Day of the Maximum Recorded Degree in Each City","slug":"the-first-day-of-the-maximum-recorded-degree-in-each-city","difficulty":2,"accepted":8445,"submitted":11500,"acceptance":0.7343478260869565},{"id":2315,"title":"Count Asterisks","slug":"count-asterisks","difficulty":1,"accepted":97698,"submitted":117271,"acceptance":0.8330959913363065},{"id":2316,"title":"Count Unreachable Pairs of Nodes in an Undirected Graph","slug":"count-unreachable-pairs-of-nodes-in-an-undirected-graph","difficulty":2,"accepted":119815,"submitted":240129,"acceptance":0.4989609751425276},{"id":2317,"title":"Maximum XOR After Operations ","slug":"maximum-xor-after-operations","difficulty":2,"accepted":31749,"submitted":39768,"acceptance":0.7983554616777309},{"id":2318,"title":"Number of Distinct Roll Sequences","slug":"number-of-distinct-roll-sequences","difficulty":3,"accepted":14156,"submitted":24354,"acceptance":0.5812597519914593},{"id":2319,"title":"Check if Matrix Is X-Matrix","slug":"check-if-matrix-is-x-matrix","difficulty":1,"accepted":74663,"submitted":112191,"acceptance":0.6654990150725103},{"id":2320,"title":"Count Number of Ways to Place Houses","slug":"count-number-of-ways-to-place-houses","difficulty":2,"accepted":36322,"submitted":82815,"acceptance":0.4385920425043772},{"id":2321,"title":"Maximum Score Of Spliced Array","slug":"maximum-score-of-spliced-array","difficulty":3,"accepted":23928,"submitted":41015,"acceptance":0.5833963184200902},{"id":2322,"title":"Minimum Score After Removals on a Tree","slug":"minimum-score-after-removals-on-a-tree","difficulty":3,"accepted":69559,"submitted":91371,"acceptance":0.7612809315866085},{"id":2323,"title":"Find Minimum Time to Finish All Jobs II","slug":"find-minimum-time-to-finish-all-jobs-ii","difficulty":2,"accepted":12630,"submitted":19126,"acceptance":0.6603576283593015},{"id":2324,"title":"Product Sales Analysis IV","slug":"product-sales-analysis-iv","difficulty":2,"accepted":11376,"submitted":14970,"acceptance":0.7599198396793587},{"id":2325,"title":"Decode the Message","slug":"decode-the-message","difficulty":1,"accepted":153721,"submitted":179160,"acceptance":0.8580096003572226},{"id":2326,"title":"Spiral Matrix IV","slug":"spiral-matrix-iv","difficulty":2,"accepted":182658,"submitted":222001,"acceptance":0.8227800775672182},{"id":2327,"title":"Number of People Aware of a Secret","slug":"number-of-people-aware-of-a-secret","difficulty":2,"accepted":126920,"submitted":208692,"acceptance":0.6081689762904184},{"id":2328,"title":"Number of Increasing Paths in a Grid","slug":"number-of-increasing-paths-in-a-grid","difficulty":3,"accepted":82711,"submitted":144149,"acceptance":0.5737882330089005},{"id":2329,"title":"Product Sales Analysis V","slug":"product-sales-analysis-v","difficulty":1,"accepted":10680,"submitted":15067,"acceptance":0.7088338753567399},{"id":2330,"title":"Valid Palindrome IV","slug":"valid-palindrome-iv","difficulty":2,"accepted":20967,"submitted":27725,"acceptance":0.756248872858431},{"id":2331,"title":"Evaluate Boolean Binary Tree","slug":"evaluate-boolean-binary-tree","difficulty":1,"accepted":225433,"submitted":273558,"acceptance":0.8240775265208841},{"id":2332,"title":"The Latest Time to Catch a Bus","slug":"the-latest-time-to-catch-a-bus","difficulty":2,"accepted":35593,"submitted":118543,"acceptance":0.3002539163004142},{"id":2333,"title":"Minimum Sum of Squared Difference","slug":"minimum-sum-of-squared-difference","difficulty":2,"accepted":19040,"submitted":71084,"acceptance":0.26785211862022396},{"id":2334,"title":"Subarray With Elements Greater Than Varying Threshold","slug":"subarray-with-elements-greater-than-varying-threshold","difficulty":3,"accepted":17882,"submitted":39422,"acceptance":0.453604586271625},{"id":2335,"title":"Minimum Amount of Time to Fill Cups","slug":"minimum-amount-of-time-to-fill-cups","difficulty":1,"accepted":67943,"submitted":112865,"acceptance":0.6019846719532185},{"id":2336,"title":"Smallest Number in Infinite Set","slug":"smallest-number-in-infinite-set","difficulty":2,"accepted":230942,"submitted":327171,"acceptance":0.7058755207521449},{"id":2337,"title":"Move Pieces to Obtain a String","slug":"move-pieces-to-obtain-a-string","difficulty":2,"accepted":149467,"submitted":263682,"acceptance":0.5668456701633028},{"id":2338,"title":"Count the Number of Ideal Arrays","slug":"count-the-number-of-ideal-arrays","difficulty":3,"accepted":70223,"submitted":123296,"acceptance":0.5695480794186348},{"id":2339,"title":"All the Matches of the League","slug":"all-the-matches-of-the-league","difficulty":1,"accepted":11558,"submitted":13051,"acceptance":0.8856026358133476},{"id":2340,"title":"Minimum Adjacent Swaps to Make a Valid Array","slug":"minimum-adjacent-swaps-to-make-a-valid-array","difficulty":2,"accepted":40617,"submitted":56234,"acceptance":0.7222854500835794},{"id":2341,"title":"Maximum Number of Pairs in Array","slug":"maximum-number-of-pairs-in-array","difficulty":1,"accepted":91838,"submitted":120772,"acceptance":0.7604246017288776},{"id":2342,"title":"Max Sum of a Pair With Equal Sum of Digits","slug":"max-sum-of-a-pair-with-equal-sum-of-digits","difficulty":2,"accepted":249785,"submitted":378770,"acceptance":0.6594635266784592},{"id":2343,"title":"Query Kth Smallest Trimmed Number","slug":"query-kth-smallest-trimmed-number","difficulty":2,"accepted":40402,"submitted":85308,"acceptance":0.4736015379565809},{"id":2344,"title":"Minimum Deletions to Make Array Divisible","slug":"minimum-deletions-to-make-array-divisible","difficulty":3,"accepted":47490,"submitted":77848,"acceptance":0.6100349398828486},{"id":2345,"title":"Finding the Number of Visible Mountains","slug":"finding-the-number-of-visible-mountains","difficulty":2,"accepted":13369,"submitted":35928,"acceptance":0.37210532175462036},{"id":2346,"title":"Compute the Rank as a Percentage","slug":"compute-the-rank-as-a-percentage","difficulty":2,"accepted":7432,"submitted":21919,"acceptance":0.33906656325562295},{"id":2347,"title":"Best Poker Hand","slug":"best-poker-hand","difficulty":1,"accepted":54063,"submitted":87624,"acceptance":0.616988496302383},{"id":2348,"title":"Number of Zero-Filled Subarrays","slug":"number-of-zero-filled-subarrays","difficulty":2,"accepted":308023,"submitted":439479,"acceptance":0.7008821809460748},{"id":2349,"title":"Design a Number Container System","slug":"design-a-number-container-system","difficulty":2,"accepted":149138,"submitted":261238,"acceptance":0.570889380564849},{"id":2350,"title":"Shortest Impossible Sequence of Rolls","slug":"shortest-impossible-sequence-of-rolls","difficulty":3,"accepted":19031,"submitted":27501,"acceptance":0.692011199592742},{"id":2351,"title":"First Letter to Appear Twice","slug":"first-letter-to-appear-twice","difficulty":1,"accepted":197685,"submitted":263752,"acceptance":0.7495109041827172},{"id":2352,"title":"Equal Row and Column Pairs","slug":"equal-row-and-column-pairs","difficulty":2,"accepted":401122,"submitted":565968,"acceptance":0.7087361829644079},{"id":2353,"title":"Design a Food Rating System","slug":"design-a-food-rating-system","difficulty":2,"accepted":181744,"submitted":343855,"acceptance":0.5285483706795016},{"id":2354,"title":"Number of Excellent Pairs","slug":"number-of-excellent-pairs","difficulty":3,"accepted":18634,"submitted":37961,"acceptance":0.4908722109533469},{"id":2355,"title":"Maximum Number of Books You Can Take","slug":"maximum-number-of-books-you-can-take","difficulty":3,"accepted":13420,"submitted":33992,"acceptance":0.3947987761826312},{"id":2356,"title":"Number of Unique Subjects Taught by Each Teacher","slug":"number-of-unique-subjects-taught-by-each-teacher","difficulty":1,"accepted":513731,"submitted":575831,"acceptance":0.8921558582292374},{"id":2357,"title":"Make Array Zero by Subtracting Equal Amounts","slug":"make-array-zero-by-subtracting-equal-amounts","difficulty":1,"accepted":179591,"submitted":243441,"acceptance":0.7377187901791399},{"id":2358,"title":"Maximum Number of Groups Entering a Competition","slug":"maximum-number-of-groups-entering-a-competition","difficulty":2,"accepted":45046,"submitted":65732,"acceptance":0.6852978762246699},{"id":2359,"title":"Find Closest Node to Given Two Nodes","slug":"find-closest-node-to-given-two-nodes","difficulty":2,"accepted":168227,"submitted":317501,"acceptance":0.5298471500877162},{"id":2360,"title":"Longest Cycle in a Graph","slug":"longest-cycle-in-a-graph","difficulty":3,"accepted":105927,"submitted":209595,"acceptance":0.5053889644314035},{"id":2361,"title":"Minimum Costs Using the Train Line","slug":"minimum-costs-using-the-train-line","difficulty":3,"accepted":15053,"submitted":19314,"acceptance":0.779382831106969},{"id":2362,"title":"Generate the Invoice","slug":"generate-the-invoice","difficulty":3,"accepted":5578,"submitted":7340,"acceptance":0.7599455040871934},{"id":2363,"title":"Merge Similar Items","slug":"merge-similar-items","difficulty":1,"accepted":80672,"submitted":104178,"acceptance":0.7743669488759622},{"id":2364,"title":"Count Number of Bad Pairs","slug":"count-number-of-bad-pairs","difficulty":2,"accepted":186132,"submitted":343404,"acceptance":0.5420204773386449},{"id":2365,"title":"Task Scheduler II","slug":"task-scheduler-ii","difficulty":2,"accepted":57801,"submitted":105569,"acceptance":0.5475186844622948},{"id":2366,"title":"Minimum Replacements to Sort the Array","slug":"minimum-replacements-to-sort-the-array","difficulty":3,"accepted":74746,"submitted":140650,"acceptance":0.5314326341983647},{"id":2367,"title":"Number of Arithmetic Triplets","slug":"number-of-arithmetic-triplets","difficulty":1,"accepted":183488,"submitted":214791,"acceptance":0.8542629812236081},{"id":2368,"title":"Reachable Nodes With Restrictions","slug":"reachable-nodes-with-restrictions","difficulty":2,"accepted":87181,"submitted":144630,"acceptance":0.6027864205213302},{"id":2369,"title":"Check if There is a Valid Partition For The Array","slug":"check-if-there-is-a-valid-partition-for-the-array","difficulty":2,"accepted":101370,"submitted":193841,"acceptance":0.5229543801362972},{"id":2370,"title":"Longest Ideal Subsequence","slug":"longest-ideal-subsequence","difficulty":2,"accepted":124420,"submitted":266722,"acceptance":0.46647820577230226},{"id":2371,"title":"Minimize Maximum Value in a Grid","slug":"minimize-maximum-value-in-a-grid","difficulty":3,"accepted":7432,"submitted":10603,"acceptance":0.7009336980099972},{"id":2372,"title":"Calculate the Influence of Each Salesperson","slug":"calculate-the-influence-of-each-salesperson","difficulty":2,"accepted":8062,"submitted":9614,"acceptance":0.8385687539005617},{"id":2373,"title":"Largest Local Values in a Matrix","slug":"largest-local-values-in-a-matrix","difficulty":1,"accepted":199553,"submitted":227526,"acceptance":0.8770558090064432},{"id":2374,"title":"Node With Highest Edge Score","slug":"node-with-highest-edge-score","difficulty":2,"accepted":45111,"submitted":91548,"acceptance":0.4927578974963953},{"id":2375,"title":"Construct Smallest Number From DI String","slug":"construct-smallest-number-from-di-string","difficulty":2,"accepted":168242,"submitted":196522,"acceptance":0.8560975361537131},{"id":2376,"title":"Count Special Integers","slug":"count-special-integers","difficulty":3,"accepted":17279,"submitted":40892,"acceptance":0.42255208842805436},{"id":2377,"title":"Sort the Olympic Table","slug":"sort-the-olympic-table","difficulty":1,"accepted":8995,"submitted":11323,"acceptance":0.7944007771791928},{"id":2378,"title":"Choose Edges to Maximize Score in a Tree","slug":"choose-edges-to-maximize-score-in-a-tree","difficulty":2,"accepted":2133,"submitted":3772,"acceptance":0.5654825026511134},{"id":2379,"title":"Minimum Recolors to Get K Consecutive Black Blocks","slug":"minimum-recolors-to-get-k-consecutive-black-blocks","difficulty":1,"accepted":231619,"submitted":337523,"acceptance":0.6862317530953446},{"id":2380,"title":"Time Needed to Rearrange a Binary String","slug":"time-needed-to-rearrange-a-binary-string","difficulty":2,"accepted":43595,"submitted":82515,"acceptance":0.5283281827546507},{"id":2381,"title":"Shifting Letters II","slug":"shifting-letters-ii","difficulty":2,"accepted":160852,"submitted":300112,"acceptance":0.5359732366583142},{"id":2382,"title":"Maximum Segment Sum After Removals","slug":"maximum-segment-sum-after-removals","difficulty":3,"accepted":12495,"submitted":25224,"acceptance":0.4953615604186489},{"id":2383,"title":"Minimum Hours of Training to Win a Competition","slug":"minimum-hours-of-training-to-win-a-competition","difficulty":1,"accepted":39934,"submitted":93887,"acceptance":0.425341101536954},{"id":2384,"title":"Largest Palindromic Number","slug":"largest-palindromic-number","difficulty":2,"accepted":53736,"submitted":144961,"acceptance":0.37069280703085655},{"id":2385,"title":"Amount of Time for Binary Tree to Be Infected","slug":"amount-of-time-for-binary-tree-to-be-infected","difficulty":2,"accepted":204911,"submitted":313834,"acceptance":0.6529279810345596},{"id":2386,"title":"Find the K-Sum of an Array","slug":"find-the-k-sum-of-an-array","difficulty":3,"accepted":13906,"submitted":33636,"acceptance":0.4134260910928767},{"id":2387,"title":"Median of a Row Wise Sorted Matrix","slug":"median-of-a-row-wise-sorted-matrix","difficulty":2,"accepted":5983,"submitted":8429,"acceptance":0.7098113655237869},{"id":2388,"title":"Change Null Values in a Table to the Previous Value","slug":"change-null-values-in-a-table-to-the-previous-value","difficulty":2,"accepted":6772,"submitted":13204,"acceptance":0.5128748863980612},{"id":2389,"title":"Longest Subsequence With Limited Sum","slug":"longest-subsequence-with-limited-sum","difficulty":1,"accepted":165081,"submitted":224601,"acceptance":0.7349967275301534},{"id":2390,"title":"Removing Stars From a String","slug":"removing-stars-from-a-string","difficulty":2,"accepted":618593,"submitted":781721,"acceptance":0.7913219678120454},{"id":2391,"title":"Minimum Amount of Time to Collect Garbage","slug":"minimum-amount-of-time-to-collect-garbage","difficulty":2,"accepted":154798,"submitted":181968,"acceptance":0.8506880330607579},{"id":2392,"title":"Build a Matrix With Conditions","slug":"build-a-matrix-with-conditions","difficulty":3,"accepted":105849,"submitted":133454,"acceptance":0.7931496995219327},{"id":2393,"title":"Count Strictly Increasing Subarrays","slug":"count-strictly-increasing-subarrays","difficulty":2,"accepted":8234,"submitted":11599,"acceptance":0.7098887835158203},{"id":2394,"title":"Employees With Deductions","slug":"employees-with-deductions","difficulty":2,"accepted":7398,"submitted":17332,"acceptance":0.42684052619432267},{"id":2395,"title":"Find Subarrays With Equal Sum","slug":"find-subarrays-with-equal-sum","difficulty":1,"accepted":73267,"submitted":109450,"acceptance":0.6694106898126999},{"id":2396,"title":"Strictly Palindromic Number","slug":"strictly-palindromic-number","difficulty":2,"accepted":181927,"submitted":201503,"acceptance":0.9028500816365017},{"id":2397,"title":"Maximum Rows Covered by Columns","slug":"maximum-rows-covered-by-columns","difficulty":2,"accepted":20037,"submitted":34646,"acceptance":0.5783351613461871},{"id":2398,"title":"Maximum Number of Robots Within Budget","slug":"maximum-number-of-robots-within-budget","difficulty":3,"accepted":34520,"submitted":90165,"acceptance":0.38285365718405145},{"id":2399,"title":"Check Distances Between Same Letters","slug":"check-distances-between-same-letters","difficulty":1,"accepted":63576,"submitted":88910,"acceptance":0.715060173208863},{"id":2400,"title":"Number of Ways to Reach a Position After Exactly k Steps","slug":"number-of-ways-to-reach-a-position-after-exactly-k-steps","difficulty":2,"accepted":39493,"submitted":107054,"acceptance":0.3689072804379098},{"id":2401,"title":"Longest Nice Subarray","slug":"longest-nice-subarray","difficulty":2,"accepted":176451,"submitted":272285,"acceptance":0.64803790146354},{"id":2402,"title":"Meeting Rooms III","slug":"meeting-rooms-iii","difficulty":3,"accepted":295262,"submitted":572885,"acceptance":0.5153948872810424},{"id":2403,"title":"Minimum Time to Kill All Monsters","slug":"minimum-time-to-kill-all-monsters","difficulty":3,"accepted":1879,"submitted":3272,"acceptance":0.5742665036674817},{"id":2404,"title":"Most Frequent Even Element","slug":"most-frequent-even-element","difficulty":1,"accepted":136077,"submitted":254524,"acceptance":0.5346332762332825},{"id":2405,"title":"Optimal Partition of String","slug":"optimal-partition-of-string","difficulty":2,"accepted":275784,"submitted":351837,"acceptance":0.7838402442039922},{"id":2406,"title":"Divide Intervals Into Minimum Number of Groups","slug":"divide-intervals-into-minimum-number-of-groups","difficulty":2,"accepted":143257,"submitted":225378,"acceptance":0.635629919512996},{"id":2407,"title":"Longest Increasing Subsequence II","slug":"longest-increasing-subsequence-ii","difficulty":3,"accepted":24178,"submitted":92364,"acceptance":0.26176865445411635},{"id":2408,"title":"Design SQL","slug":"design-sql","difficulty":2,"accepted":20477,"submitted":31778,"acceptance":0.6443766127509598},{"id":2409,"title":"Count Days Spent Together","slug":"count-days-spent-together","difficulty":1,"accepted":30828,"submitted":64446,"acceptance":0.4783539707662229},{"id":2410,"title":"Maximum Matching of Players With Trainers","slug":"maximum-matching-of-players-with-trainers","difficulty":2,"accepted":182585,"submitted":242597,"acceptance":0.7526267843378113},{"id":2411,"title":"Smallest Subarrays With Maximum Bitwise OR","slug":"smallest-subarrays-with-maximum-bitwise-or","difficulty":2,"accepted":95259,"submitted":153723,"acceptance":0.6196795534825628},{"id":2412,"title":"Minimum Money Required Before Transactions","slug":"minimum-money-required-before-transactions","difficulty":3,"accepted":13615,"submitted":32401,"acceptance":0.42020308015184715},{"id":2413,"title":"Smallest Even Multiple","slug":"smallest-even-multiple","difficulty":1,"accepted":290540,"submitted":328931,"acceptance":0.8832855522890819},{"id":2414,"title":"Length of the Longest Alphabetical Continuous Substring","slug":"length-of-the-longest-alphabetical-continuous-substring","difficulty":2,"accepted":63949,"submitted":105700,"acceptance":0.6050047303689687},{"id":2415,"title":"Reverse Odd Levels of Binary Tree","slug":"reverse-odd-levels-of-binary-tree","difficulty":2,"accepted":187640,"submitted":216511,"acceptance":0.8666534263848026},{"id":2416,"title":"Sum of Prefix Scores of Strings","slug":"sum-of-prefix-scores-of-strings","difficulty":3,"accepted":121035,"submitted":199082,"acceptance":0.6079655619292553},{"id":2417,"title":"Closest Fair Integer","slug":"closest-fair-integer","difficulty":2,"accepted":1421,"submitted":3208,"acceptance":0.4429551122194514},{"id":2418,"title":"Sort the People","slug":"sort-the-people","difficulty":1,"accepted":381342,"submitted":449633,"acceptance":0.8481183543022865},{"id":2419,"title":"Longest Subarray With Maximum Bitwise AND","slug":"longest-subarray-with-maximum-bitwise-and","difficulty":2,"accepted":253688,"submitted":388086,"acceptance":0.653690161459058},{"id":2420,"title":"Find All Good Indices","slug":"find-all-good-indices","difficulty":2,"accepted":32307,"submitted":79069,"acceptance":0.40859249516245305},{"id":2421,"title":"Number of Good Paths","slug":"number-of-good-paths","difficulty":3,"accepted":65148,"submitted":115696,"acceptance":0.5630963905407275},{"id":2422,"title":"Merge Operations to Turn Array Into a Palindrome","slug":"merge-operations-to-turn-array-into-a-palindrome","difficulty":2,"accepted":19021,"submitted":27604,"acceptance":0.6890668019127663},{"id":2423,"title":"Remove Letter To Equalize Frequency","slug":"remove-letter-to-equalize-frequency","difficulty":1,"accepted":76351,"submitted":395258,"acceptance":0.19316750072104802},{"id":2424,"title":"Longest Uploaded Prefix","slug":"longest-uploaded-prefix","difficulty":2,"accepted":28623,"submitted":52114,"acceptance":0.54923820854281},{"id":2425,"title":"Bitwise XOR of All Pairings","slug":"bitwise-xor-of-all-pairings","difficulty":2,"accepted":152762,"submitted":228297,"acceptance":0.6691371327700321},{"id":2426,"title":"Number of Pairs Satisfying Inequality","slug":"number-of-pairs-satisfying-inequality","difficulty":3,"accepted":19113,"submitted":40635,"acceptance":0.4703580657069029},{"id":2427,"title":"Number of Common Factors","slug":"number-of-common-factors","difficulty":1,"accepted":160967,"submitted":201123,"acceptance":0.8003410848087986},{"id":2428,"title":"Maximum Sum of an Hourglass","slug":"maximum-sum-of-an-hourglass","difficulty":2,"accepted":53861,"submitted":70571,"acceptance":0.7632171855294668},{"id":2429,"title":"Minimize XOR","slug":"minimize-xor","difficulty":2,"accepted":139605,"submitted":223699,"acceptance":0.6240752082038811},{"id":2430,"title":"Maximum Deletions on a String","slug":"maximum-deletions-on-a-string","difficulty":3,"accepted":17285,"submitted":48298,"acceptance":0.35788231396745207},{"id":2431,"title":"Maximize Total Tastiness of Purchased Fruits","slug":"maximize-total-tastiness-of-purchased-fruits","difficulty":2,"accepted":4019,"submitted":6225,"acceptance":0.6456224899598394},{"id":2432,"title":"The Employee That Worked on the Longest Task","slug":"the-employee-that-worked-on-the-longest-task","difficulty":1,"accepted":44085,"submitted":85424,"acceptance":0.5160727664356621},{"id":2433,"title":"Find The Original Array of Prefix Xor","slug":"find-the-original-array-of-prefix-xor","difficulty":2,"accepted":190958,"submitted":216192,"acceptance":0.8832796773238603},{"id":2434,"title":"Using a Robot to Print the Lexicographically Smallest String","slug":"using-a-robot-to-print-the-lexicographically-smallest-string","difficulty":2,"accepted":108199,"submitted":173212,"acceptance":0.6246622635845092},{"id":2435,"title":"Paths in Matrix Whose Sum Is Divisible by K","slug":"paths-in-matrix-whose-sum-is-divisible-by-k","difficulty":3,"accepted":103865,"submitted":176865,"acceptance":0.5872558165832698},{"id":2436,"title":"Minimum Split Into Subarrays With GCD Greater Than One","slug":"minimum-split-into-subarrays-with-gcd-greater-than-one","difficulty":2,"accepted":2913,"submitted":4144,"acceptance":0.7029440154440154},{"id":2437,"title":"Number of Valid Clock Times","slug":"number-of-valid-clock-times","difficulty":1,"accepted":38383,"submitted":79993,"acceptance":0.4798294850799445},{"id":2438,"title":"Range Product Queries of Powers","slug":"range-product-queries-of-powers","difficulty":2,"accepted":118479,"submitted":192915,"acceptance":0.6141513101625068},{"id":2439,"title":"Minimize Maximum of Array","slug":"minimize-maximum-of-array","difficulty":2,"accepted":99492,"submitted":213922,"acceptance":0.4650854049606866},{"id":2440,"title":"Create Components With Same Value","slug":"create-components-with-same-value","difficulty":3,"accepted":11122,"submitted":20830,"acceptance":0.5339414306289006},{"id":2441,"title":"Largest Positive Integer That Exists With Its Negative","slug":"largest-positive-integer-that-exists-with-its-negative","difficulty":1,"accepted":267177,"submitted":358579,"acceptance":0.745099406267517},{"id":2442,"title":"Count Number of Distinct Integers After Reverse Operations","slug":"count-number-of-distinct-integers-after-reverse-operations","difficulty":2,"accepted":100820,"submitted":123858,"acceptance":0.8139966736101019},{"id":2443,"title":"Sum of Number and Its Reverse","slug":"sum-of-number-and-its-reverse","difficulty":2,"accepted":46644,"submitted":94349,"acceptance":0.4943772589004653},{"id":2444,"title":"Count Subarrays With Fixed Bounds","slug":"count-subarrays-with-fixed-bounds","difficulty":3,"accepted":233977,"submitted":338014,"acceptance":0.692210973509973},{"id":2445,"title":"Number of Nodes With Value One","slug":"number-of-nodes-with-value-one","difficulty":2,"accepted":2906,"submitted":4376,"acceptance":0.6640767824497258},{"id":2446,"title":"Determine if Two Events Have Conflict","slug":"determine-if-two-events-have-conflict","difficulty":1,"accepted":64382,"submitted":121136,"acceptance":0.5314852727512878},{"id":2447,"title":"Number of Subarrays With GCD Equal to K","slug":"number-of-subarrays-with-gcd-equal-to-k","difficulty":2,"accepted":34284,"submitted":65356,"acceptance":0.5245731072893078},{"id":2448,"title":"Minimum Cost to Make Array Equal","slug":"minimum-cost-to-make-array-equal","difficulty":3,"accepted":77736,"submitted":166362,"acceptance":0.46727016987052333},{"id":2449,"title":"Minimum Number of Operations to Make Arrays Similar","slug":"minimum-number-of-operations-to-make-arrays-similar","difficulty":3,"accepted":17433,"submitted":28367,"acceptance":0.6145521204216167},{"id":2450,"title":"Number of Distinct Binary Strings After Applying Operations","slug":"number-of-distinct-binary-strings-after-applying-operations","difficulty":2,"accepted":1366,"submitted":2138,"acceptance":0.6389148737137512},{"id":2451,"title":"Odd String Difference","slug":"odd-string-difference","difficulty":1,"accepted":44292,"submitted":71556,"acceptance":0.6189837330202917},{"id":2452,"title":"Words Within Two Edits of Dictionary","slug":"words-within-two-edits-of-dictionary","difficulty":2,"accepted":29385,"submitted":47559,"acceptance":0.6178641266637229},{"id":2453,"title":"Destroy Sequential Targets","slug":"destroy-sequential-targets","difficulty":2,"accepted":23423,"submitted":55977,"acceptance":0.41843971631205673},{"id":2454,"title":"Next Greater Element IV","slug":"next-greater-element-iv","difficulty":3,"accepted":18559,"submitted":44490,"acceptance":0.4171499213306361},{"id":2455,"title":"Average Value of Even Numbers That Are Divisible by Three","slug":"average-value-of-even-numbers-that-are-divisible-by-three","difficulty":1,"accepted":94711,"submitted":150203,"acceptance":0.6305533178431856},{"id":2456,"title":"Most Popular Video Creator","slug":"most-popular-video-creator","difficulty":2,"accepted":28432,"submitted":62781,"acceptance":0.452875870088084},{"id":2457,"title":"Minimum Addition to Make Integer Beautiful","slug":"minimum-addition-to-make-integer-beautiful","difficulty":2,"accepted":25195,"submitted":65225,"acceptance":0.3862782675354542},{"id":2458,"title":"Height of Binary Tree After Subtree Removal Queries","slug":"height-of-binary-tree-after-subtree-removal-queries","difficulty":3,"accepted":104689,"submitted":190827,"acceptance":0.5486068533278834},{"id":2459,"title":"Sort Array by Moving Items to Empty Space","slug":"sort-array-by-moving-items-to-empty-space","difficulty":3,"accepted":2956,"submitted":6471,"acceptance":0.45680729408128573},{"id":2460,"title":"Apply Operations to an Array","slug":"apply-operations-to-an-array","difficulty":1,"accepted":273604,"submitted":366121,"acceptance":0.7473048527672546},{"id":2461,"title":"Maximum Sum of Distinct Subarrays With Length K","slug":"maximum-sum-of-distinct-subarrays-with-length-k","difficulty":2,"accepted":265331,"submitted":618040,"acceptance":0.42931040062131903},{"id":2462,"title":"Total Cost to Hire K Workers","slug":"total-cost-to-hire-k-workers","difficulty":2,"accepted":165083,"submitted":378920,"acceptance":0.43566715929483796},{"id":2463,"title":"Minimum Total Distance Traveled","slug":"minimum-total-distance-traveled","difficulty":3,"accepted":75568,"submitted":128540,"acceptance":0.5878948187334682},{"id":2464,"title":"Minimum Subarrays in a Valid Split","slug":"minimum-subarrays-in-a-valid-split","difficulty":2,"accepted":3518,"submitted":5436,"acceptance":0.6471670345842532},{"id":2465,"title":"Number of Distinct Averages","slug":"number-of-distinct-averages","difficulty":1,"accepted":74522,"submitted":126465,"acceptance":0.5892697584311865},{"id":2466,"title":"Count Ways To Build Good Strings","slug":"count-ways-to-build-good-strings","difficulty":2,"accepted":180400,"submitted":306133,"acceptance":0.5892863559302656},{"id":2467,"title":"Most Profitable Path in a Tree","slug":"most-profitable-path-in-a-tree","difficulty":2,"accepted":109154,"submitted":162152,"acceptance":0.6731585179337906},{"id":2468,"title":"Split Message Based on Limit","slug":"split-message-based-on-limit","difficulty":3,"accepted":22601,"submitted":53605,"acceptance":0.4216211174330753},{"id":2469,"title":"Convert the Temperature","slug":"convert-the-temperature","difficulty":1,"accepted":300941,"submitted":333383,"acceptance":0.9026884994135874},{"id":2470,"title":"Number of Subarrays With LCM Equal to K","slug":"number-of-subarrays-with-lcm-equal-to-k","difficulty":2,"accepted":32134,"submitted":73564,"acceptance":0.436816921320211},{"id":2471,"title":"Minimum Number of Operations to Sort a Binary Tree by Level","slug":"minimum-number-of-operations-to-sort-a-binary-tree-by-level","difficulty":2,"accepted":114302,"submitted":153987,"acceptance":0.7422834395111275},{"id":2472,"title":"Maximum Number of Non-overlapping Palindrome Substrings","slug":"maximum-number-of-non-overlapping-palindrome-substrings","difficulty":3,"accepted":25727,"submitted":57771,"acceptance":0.4453272403108826},{"id":2473,"title":"Minimum Cost to Buy Apples","slug":"minimum-cost-to-buy-apples","difficulty":2,"accepted":7321,"submitted":10878,"acceptance":0.6730097444383158},{"id":2474,"title":"Customers With Strictly Increasing Purchases","slug":"customers-with-strictly-increasing-purchases","difficulty":3,"accepted":5999,"submitted":11957,"acceptance":0.5017144768754704},{"id":2475,"title":"Number of Unequal Triplets in Array","slug":"number-of-unequal-triplets-in-array","difficulty":1,"accepted":62112,"submitted":84752,"acceptance":0.7328676609401548},{"id":2476,"title":"Closest Nodes Queries in a Binary Search Tree","slug":"closest-nodes-queries-in-a-binary-search-tree","difficulty":2,"accepted":38953,"submitted":87848,"acceptance":0.4434136235315545},{"id":2477,"title":"Minimum Fuel Cost to Report to the Capital","slug":"minimum-fuel-cost-to-report-to-the-capital","difficulty":2,"accepted":88880,"submitted":136538,"acceptance":0.650954313085002},{"id":2478,"title":"Number of Beautiful Partitions","slug":"number-of-beautiful-partitions","difficulty":3,"accepted":13333,"submitted":40503,"acceptance":0.3291854924326593},{"id":2479,"title":"Maximum XOR of Two Non-Overlapping Subtrees","slug":"maximum-xor-of-two-non-overlapping-subtrees","difficulty":3,"accepted":961,"submitted":1849,"acceptance":0.5197404002163332},{"id":2480,"title":"Form a Chemical Bond","slug":"form-a-chemical-bond","difficulty":1,"accepted":7366,"submitted":9202,"acceptance":0.8004781569224082},{"id":2481,"title":"Minimum Cuts to Divide a Circle","slug":"minimum-cuts-to-divide-a-circle","difficulty":1,"accepted":73211,"submitted":130411,"acceptance":0.5613866928403279},{"id":2482,"title":"Difference Between Ones and Zeros in Row and Column","slug":"difference-between-ones-and-zeros-in-row-and-column","difficulty":2,"accepted":145446,"submitted":172215,"acceptance":0.8445605783468338},{"id":2483,"title":"Minimum Penalty for a Shop","slug":"minimum-penalty-for-a-shop","difficulty":2,"accepted":233968,"submitted":328496,"acceptance":0.7122400272758268},{"id":2484,"title":"Count Palindromic Subsequences","slug":"count-palindromic-subsequences","difficulty":3,"accepted":21601,"submitted":52574,"acceptance":0.41086849012820026},{"id":2485,"title":"Find the Pivot Integer","slug":"find-the-pivot-integer","difficulty":1,"accepted":305984,"submitted":365020,"acceptance":0.8382663963618432},{"id":2486,"title":"Append Characters to String to Make Subsequence","slug":"append-characters-to-string-to-make-subsequence","difficulty":2,"accepted":223281,"submitted":305757,"acceptance":0.7302563800665234},{"id":2487,"title":"Remove Nodes From Linked List","slug":"remove-nodes-from-linked-list","difficulty":2,"accepted":268863,"submitted":359107,"acceptance":0.7486988557727919},{"id":2488,"title":"Count Subarrays With Median K","slug":"count-subarrays-with-median-k","difficulty":3,"accepted":20541,"submitted":42324,"acceptance":0.4853274737737454},{"id":2489,"title":"Number of Substrings With Fixed Ratio","slug":"number-of-substrings-with-fixed-ratio","difficulty":2,"accepted":1714,"submitted":3004,"acceptance":0.570572569906791},{"id":2490,"title":"Circular Sentence","slug":"circular-sentence","difficulty":1,"accepted":189429,"submitted":269890,"acceptance":0.701874837896921},{"id":2491,"title":"Divide Players Into Teams of Equal Skill","slug":"divide-players-into-teams-of-equal-skill","difficulty":2,"accepted":202599,"submitted":293925,"acceptance":0.6892880836948201},{"id":2492,"title":"Minimum Score of a Path Between Two Cities","slug":"minimum-score-of-a-path-between-two-cities","difficulty":2,"accepted":109856,"submitted":187137,"acceptance":0.5870351667494936},{"id":2493,"title":"Divide Nodes Into the Maximum Number of Groups","slug":"divide-nodes-into-the-maximum-number-of-groups","difficulty":3,"accepted":86440,"submitted":129089,"acceptance":0.6696155365677943},{"id":2494,"title":"Merge Overlapping Events in the Same Hall","slug":"merge-overlapping-events-in-the-same-hall","difficulty":3,"accepted":3162,"submitted":8495,"acceptance":0.372218952324897},{"id":2495,"title":"Number of Subarrays Having Even Product","slug":"number-of-subarrays-having-even-product","difficulty":2,"accepted":2807,"submitted":4438,"acceptance":0.6324921135646687},{"id":2496,"title":"Maximum Value of a String in an Array","slug":"maximum-value-of-a-string-in-an-array","difficulty":1,"accepted":64573,"submitted":87030,"acceptance":0.7419625416523038},{"id":2497,"title":"Maximum Star Sum of a Graph","slug":"maximum-star-sum-of-a-graph","difficulty":2,"accepted":31188,"submitted":73865,"acceptance":0.42222974345089015},{"id":2498,"title":"Frog Jump II","slug":"frog-jump-ii","difficulty":2,"accepted":38907,"submitted":62539,"acceptance":0.6221237947520747},{"id":2499,"title":"Minimum Total Cost to Make Arrays Unequal","slug":"minimum-total-cost-to-make-arrays-unequal","difficulty":3,"accepted":6375,"submitted":15451,"acceptance":0.4125946540676979},{"id":2500,"title":"Delete Greatest Value in Each Row","slug":"delete-greatest-value-in-each-row","difficulty":1,"accepted":91845,"submitted":115031,"acceptance":0.7984369430849075},{"id":2501,"title":"Longest Square Streak in an Array","slug":"longest-square-streak-in-an-array","difficulty":2,"accepted":155900,"submitted":293677,"acceptance":0.5308553274515879},{"id":2502,"title":"Design Memory Allocator","slug":"design-memory-allocator","difficulty":2,"accepted":45971,"submitted":91944,"acceptance":0.4999891238144958},{"id":2503,"title":"Maximum Number of Points From Grid Queries","slug":"maximum-number-of-points-from-grid-queries","difficulty":3,"accepted":97830,"submitted":164923,"acceptance":0.5931859110008914},{"id":2504,"title":"Concatenate the Name and the Profession","slug":"concatenate-the-name-and-the-profession","difficulty":1,"accepted":7096,"submitted":8840,"acceptance":0.8027149321266969},{"id":2505,"title":"Bitwise OR of All Subsequence Sums","slug":"bitwise-or-of-all-subsequence-sums","difficulty":2,"accepted":4434,"submitted":6918,"acceptance":0.6409366869037294},{"id":2506,"title":"Count Pairs Of Similar Strings","slug":"count-pairs-of-similar-strings","difficulty":1,"accepted":71753,"submitted":97364,"acceptance":0.7369561644961177},{"id":2507,"title":"Smallest Value After Replacing With Sum of Prime Factors","slug":"smallest-value-after-replacing-with-sum-of-prime-factors","difficulty":2,"accepted":32539,"submitted":65277,"acceptance":0.49847572651929467},{"id":2508,"title":"Add Edges to Make Degrees of All Nodes Even","slug":"add-edges-to-make-degrees-of-all-nodes-even","difficulty":3,"accepted":22696,"submitted":63494,"acceptance":0.3574510977415189},{"id":2509,"title":"Cycle Length Queries in a Tree","slug":"cycle-length-queries-in-a-tree","difficulty":3,"accepted":19328,"submitted":32085,"acceptance":0.6023998753311516},{"id":2510,"title":"Check if There is a Path With Equal Number of 0's And 1's","slug":"check-if-there-is-a-path-with-equal-number-of-0s-and-1s","difficulty":2,"accepted":7822,"submitted":15068,"acceptance":0.5191133528006371},{"id":2511,"title":"Maximum Enemy Forts That Can Be Captured","slug":"maximum-enemy-forts-that-can-be-captured","difficulty":1,"accepted":34693,"submitted":84092,"acceptance":0.4125600532749845},{"id":2512,"title":"Reward Top K Students","slug":"reward-top-k-students","difficulty":2,"accepted":30492,"submitted":64908,"acceptance":0.4697726012201886},{"id":2513,"title":"Minimize the Maximum of Two Arrays","slug":"minimize-the-maximum-of-two-arrays","difficulty":2,"accepted":16844,"submitted":52266,"acceptance":0.32227451880763786},{"id":2514,"title":"Count Anagrams","slug":"count-anagrams","difficulty":3,"accepted":20191,"submitted":54051,"acceptance":0.3735546058352297},{"id":2515,"title":"Shortest Distance to Target String in a Circular Array","slug":"shortest-distance-to-target-string-in-a-circular-array","difficulty":1,"accepted":39343,"submitted":77769,"acceptance":0.5058956653679487},{"id":2516,"title":"Take K of Each Character From Left and Right","slug":"take-k-of-each-character-from-left-and-right","difficulty":2,"accepted":114802,"submitted":223159,"acceptance":0.5144403765924744},{"id":2517,"title":"Maximum Tastiness of Candy Basket","slug":"maximum-tastiness-of-candy-basket","difficulty":2,"accepted":39808,"submitted":58547,"acceptance":0.6799323620339215},{"id":2518,"title":"Number of Great Partitions","slug":"number-of-great-partitions","difficulty":3,"accepted":13689,"submitted":40922,"acceptance":0.3345144421093788},{"id":2519,"title":"Count the Number of K-Big Indices","slug":"count-the-number-of-k-big-indices","difficulty":3,"accepted":9713,"submitted":18101,"acceptance":0.5366001878349262},{"id":2520,"title":"Count the Digits That Divide a Number","slug":"count-the-digits-that-divide-a-number","difficulty":1,"accepted":174583,"submitted":203303,"acceptance":0.8587330241068749},{"id":2521,"title":"Distinct Prime Factors of Product of Array","slug":"distinct-prime-factors-of-product-of-array","difficulty":2,"accepted":47444,"submitted":87344,"acceptance":0.5431855651218171},{"id":2522,"title":"Partition String Into Substrings With Values at Most K","slug":"partition-string-into-substrings-with-values-at-most-k","difficulty":2,"accepted":26846,"submitted":56371,"acceptance":0.4762377818381792},{"id":2523,"title":"Closest Prime Numbers in Range","slug":"closest-prime-numbers-in-range","difficulty":2,"accepted":189699,"submitted":366856,"acceptance":0.5170939006040517},{"id":2524,"title":"Maximum Frequency Score of a Subarray","slug":"maximum-frequency-score-of-a-subarray","difficulty":3,"accepted":1671,"submitted":4565,"acceptance":0.3660460021905805},{"id":2525,"title":"Categorize Box According to Criteria","slug":"categorize-box-according-to-criteria","difficulty":1,"accepted":50642,"submitted":130128,"acceptance":0.3891706627320792},{"id":2526,"title":"Find Consecutive Integers from a Data Stream","slug":"find-consecutive-integers-from-a-data-stream","difficulty":2,"accepted":37287,"submitted":73081,"acceptance":0.5102146932855325},{"id":2527,"title":"Find Xor-Beauty of Array","slug":"find-xor-beauty-of-array","difficulty":2,"accepted":26636,"submitted":37703,"acceptance":0.7064689812481766},{"id":2528,"title":"Maximize the Minimum Powered City","slug":"maximize-the-minimum-powered-city","difficulty":3,"accepted":68167,"submitted":110407,"acceptance":0.6174155624190495},{"id":2529,"title":"Maximum Count of Positive Integer and Negative Integer","slug":"maximum-count-of-positive-integer-and-negative-integer","difficulty":1,"accepted":361431,"submitted":486544,"acceptance":0.7428536781873787},{"id":2530,"title":"Maximal Score After Applying K Operations","slug":"maximal-score-after-applying-k-operations","difficulty":2,"accepted":164073,"submitted":256181,"acceptance":0.6404573329013471},{"id":2531,"title":"Make Number of Distinct Characters Equal","slug":"make-number-of-distinct-characters-equal","difficulty":2,"accepted":24096,"submitted":87457,"acceptance":0.27551825468515956},{"id":2532,"title":"Time to Cross a Bridge","slug":"time-to-cross-a-bridge","difficulty":3,"accepted":5795,"submitted":13091,"acceptance":0.4426705370101596},{"id":2533,"title":"Number of Good Binary Strings","slug":"number-of-good-binary-strings","difficulty":2,"accepted":7724,"submitted":14604,"acceptance":0.5288961928238839},{"id":2534,"title":"Time Taken to Cross the Door","slug":"time-taken-to-cross-the-door","difficulty":3,"accepted":14011,"submitted":27937,"acceptance":0.5015212800229086},{"id":2535,"title":"Difference Between Element Sum and Digit Sum of an Array","slug":"difference-between-element-sum-and-digit-sum-of-an-array","difficulty":1,"accepted":204972,"submitted":240316,"acceptance":0.8529269794770219},{"id":2536,"title":"Increment Submatrices by One","slug":"increment-submatrices-by-one","difficulty":2,"accepted":107630,"submitted":145830,"acceptance":0.7380511554549818},{"id":2537,"title":"Count the Number of Good Subarrays","slug":"count-the-number-of-good-subarrays","difficulty":2,"accepted":130923,"submitted":198539,"acceptance":0.659432151869406},{"id":2538,"title":"Difference Between Maximum and Minimum Price Sum","slug":"difference-between-maximum-and-minimum-price-sum","difficulty":3,"accepted":11015,"submitted":32989,"acceptance":0.33389917851405015},{"id":2539,"title":"Count the Number of Good Subsequences","slug":"count-the-number-of-good-subsequences","difficulty":2,"accepted":4019,"submitted":8322,"acceptance":0.48293679403989426},{"id":2540,"title":"Minimum Common Value","slug":"minimum-common-value","difficulty":1,"accepted":312209,"submitted":538143,"acceptance":0.580159920318577},{"id":2541,"title":"Minimum Operations to Make Array Equal II","slug":"minimum-operations-to-make-array-equal-ii","difficulty":2,"accepted":28257,"submitted":85372,"acceptance":0.3309867403832638},{"id":2542,"title":"Maximum Subsequence Score","slug":"maximum-subsequence-score","difficulty":2,"accepted":152184,"submitted":278601,"acceptance":0.5462435526074925},{"id":2543,"title":"Check if Point Is Reachable","slug":"check-if-point-is-reachable","difficulty":3,"accepted":10871,"submitted":24212,"acceptance":0.44899223525524534},{"id":2544,"title":"Alternating Digit Sum","slug":"alternating-digit-sum","difficulty":1,"accepted":101761,"submitted":147408,"acceptance":0.6903356669922935},{"id":2545,"title":"Sort the Students by Their Kth Score","slug":"sort-the-students-by-their-kth-score","difficulty":2,"accepted":89625,"submitted":104261,"acceptance":0.8596215267453794},{"id":2546,"title":"Apply Bitwise Operations to Make Strings Equal","slug":"apply-bitwise-operations-to-make-strings-equal","difficulty":2,"accepted":22783,"submitted":53474,"acceptance":0.4260575232823428},{"id":2547,"title":"Minimum Cost to Split an Array","slug":"minimum-cost-to-split-an-array","difficulty":3,"accepted":16683,"submitted":37647,"acceptance":0.44314287991074985},{"id":2548,"title":"Maximum Price to Fill a Bag","slug":"maximum-price-to-fill-a-bag","difficulty":2,"accepted":1950,"submitted":3018,"acceptance":0.6461232604373758},{"id":2549,"title":"Count Distinct Numbers on Board","slug":"count-distinct-numbers-on-board","difficulty":1,"accepted":64064,"submitted":103805,"acceptance":0.6171571696931747},{"id":2550,"title":"Count Collisions of Monkeys on a Polygon","slug":"count-collisions-of-monkeys-on-a-polygon","difficulty":2,"accepted":27150,"submitted":90465,"acceptance":0.30011606698723264},{"id":2551,"title":"Put Marbles in Bags","slug":"put-marbles-in-bags","difficulty":3,"accepted":153666,"submitted":213009,"acceptance":0.7214061377688267},{"id":2552,"title":"Count Increasing Quadruplets","slug":"count-increasing-quadruplets","difficulty":3,"accepted":12399,"submitted":35925,"acceptance":0.3451356993736952},{"id":2553,"title":"Separate the Digits in an Array","slug":"separate-the-digits-in-an-array","difficulty":1,"accepted":103411,"submitted":127934,"acceptance":0.8083152250379102},{"id":2554,"title":"Maximum Number of Integers to Choose From a Range I","slug":"maximum-number-of-integers-to-choose-from-a-range-i","difficulty":2,"accepted":169382,"submitted":249194,"acceptance":0.6797194153952343},{"id":2555,"title":"Maximize Win From Two Segments","slug":"maximize-win-from-two-segments","difficulty":2,"accepted":15486,"submitted":41133,"acceptance":0.37648603311209977},{"id":2556,"title":"Disconnect Path in a Binary Matrix by at Most One Flip","slug":"disconnect-path-in-a-binary-matrix-by-at-most-one-flip","difficulty":2,"accepted":18920,"submitted":67986,"acceptance":0.27829258965081044},{"id":2557,"title":"Maximum Number of Integers to Choose From a Range II","slug":"maximum-number-of-integers-to-choose-from-a-range-ii","difficulty":2,"accepted":2875,"submitted":8243,"acceptance":0.34878078369525656},{"id":2558,"title":"Take Gifts From the Richest Pile","slug":"take-gifts-from-the-richest-pile","difficulty":1,"accepted":198914,"submitted":263452,"acceptance":0.7550293791658442},{"id":2559,"title":"Count Vowel Strings in Ranges","slug":"count-vowel-strings-in-ranges","difficulty":2,"accepted":202892,"submitted":299173,"acceptance":0.678176172315015},{"id":2560,"title":"House Robber IV","slug":"house-robber-iv","difficulty":2,"accepted":139852,"submitted":216010,"acceptance":0.6474329892134624},{"id":2561,"title":"Rearranging Fruits","slug":"rearranging-fruits","difficulty":3,"accepted":98216,"submitted":171210,"acceptance":0.5736580807195841},{"id":2562,"title":"Find the Array Concatenation Value","slug":"find-the-array-concatenation-value","difficulty":1,"accepted":68904,"submitted":95798,"acceptance":0.7192634501764129},{"id":2563,"title":"Count the Number of Fair Pairs","slug":"count-the-number-of-fair-pairs","difficulty":2,"accepted":238218,"submitted":452226,"acceptance":0.5267675896564992},{"id":2564,"title":"Substring XOR Queries","slug":"substring-xor-queries","difficulty":2,"accepted":16288,"submitted":45830,"acceptance":0.3554003927558368},{"id":2565,"title":"Subsequence With the Minimum Score","slug":"subsequence-with-the-minimum-score","difficulty":3,"accepted":10354,"submitted":31236,"acceptance":0.3314765014726598},{"id":2566,"title":"Maximum Difference by Remapping a Digit","slug":"maximum-difference-by-remapping-a-digit","difficulty":1,"accepted":133819,"submitted":175823,"acceptance":0.7611006523606126},{"id":2567,"title":"Minimum Score by Changing Two Elements","slug":"minimum-score-by-changing-two-elements","difficulty":2,"accepted":22481,"submitted":45111,"acceptance":0.4983485180997983},{"id":2568,"title":"Minimum Impossible OR","slug":"minimum-impossible-or","difficulty":2,"accepted":20251,"submitted":34370,"acceptance":0.5892057026476578},{"id":2569,"title":"Handling Sum Queries After Update","slug":"handling-sum-queries-after-update","difficulty":3,"accepted":7889,"submitted":25634,"acceptance":0.3077553249590388},{"id":2570,"title":"Merge Two 2D Arrays by Summing Values","slug":"merge-two-2d-arrays-by-summing-values","difficulty":1,"accepted":212817,"submitted":260507,"acceptance":0.8169339019680854},{"id":2571,"title":"Minimum Operations to Reduce an Integer to 0","slug":"minimum-operations-to-reduce-an-integer-to-0","difficulty":2,"accepted":54941,"submitted":88825,"acceptance":0.618530819026175},{"id":2572,"title":"Count the Number of Square-Free Subsets","slug":"count-the-number-of-square-free-subsets","difficulty":2,"accepted":14053,"submitted":53013,"acceptance":0.26508592232094014},{"id":2573,"title":"Find the String with LCP","slug":"find-the-string-with-lcp","difficulty":3,"accepted":62923,"submitted":99570,"acceptance":0.6319473737069399},{"id":2574,"title":"Left and Right Sum Differences","slug":"left-and-right-sum-differences","difficulty":1,"accepted":223550,"submitted":253984,"acceptance":0.8801735542396372},{"id":2575,"title":"Find the Divisibility Array of a String","slug":"find-the-divisibility-array-of-a-string","difficulty":2,"accepted":38822,"submitted":108226,"acceptance":0.3587123242104485},{"id":2576,"title":"Find the Maximum Number of Marked Indices","slug":"find-the-maximum-number-of-marked-indices","difficulty":2,"accepted":26498,"submitted":64346,"acceptance":0.4118049295993535},{"id":2577,"title":"Minimum Time to Visit a Cell In a Grid","slug":"minimum-time-to-visit-a-cell-in-a-grid","difficulty":3,"accepted":88216,"submitted":156753,"acceptance":0.5627707284709065},{"id":2578,"title":"Split With Minimum Sum","slug":"split-with-minimum-sum","difficulty":1,"accepted":52108,"submitted":70952,"acceptance":0.7344119968429361},{"id":2579,"title":"Count Total Number of Colored Cells","slug":"count-total-number-of-colored-cells","difficulty":2,"accepted":203995,"submitted":308548,"acceptance":0.661145105461711},{"id":2580,"title":"Count Ways to Group Overlapping Ranges","slug":"count-ways-to-group-overlapping-ranges","difficulty":2,"accepted":23386,"submitted":59719,"acceptance":0.3916006631055443},{"id":2581,"title":"Count Number of Possible Root Nodes","slug":"count-number-of-possible-root-nodes","difficulty":3,"accepted":9058,"submitted":18817,"acceptance":0.48137322633788593},{"id":2582,"title":"Pass the Pillow","slug":"pass-the-pillow","difficulty":1,"accepted":215579,"submitted":381160,"acceptance":0.5655866302864938},{"id":2583,"title":"Kth Largest Sum in a Binary Tree","slug":"kth-largest-sum-in-a-binary-tree","difficulty":2,"accepted":181651,"submitted":308010,"acceptance":0.5897568260770755},{"id":2584,"title":"Split the Array to Make Coprime Products","slug":"split-the-array-to-make-coprime-products","difficulty":3,"accepted":18985,"submitted":66176,"acceptance":0.2868864845261122},{"id":2585,"title":"Number of Ways to Earn Points","slug":"number-of-ways-to-earn-points","difficulty":3,"accepted":23561,"submitted":39543,"acceptance":0.5958323849986091},{"id":2586,"title":"Count the Number of Vowel Strings in Range","slug":"count-the-number-of-vowel-strings-in-range","difficulty":1,"accepted":89357,"submitted":120391,"acceptance":0.7422232558912211},{"id":2587,"title":"Rearrange Array to Maximize Prefix Score","slug":"rearrange-array-to-maximize-prefix-score","difficulty":2,"accepted":39923,"submitted":93596,"acceptance":0.4265460062395829},{"id":2588,"title":"Count the Number of Beautiful Subarrays","slug":"count-the-number-of-beautiful-subarrays","difficulty":2,"accepted":25731,"submitted":47987,"acceptance":0.5362077229249589},{"id":2589,"title":"Minimum Time to Complete All Tasks","slug":"minimum-time-to-complete-all-tasks","difficulty":3,"accepted":14381,"submitted":36055,"acceptance":0.3988628484260158},{"id":2590,"title":"Design a Todo List","slug":"design-a-todo-list","difficulty":2,"accepted":4260,"submitted":7133,"acceptance":0.5972241693537081},{"id":2591,"title":"Distribute Money to Maximum Children","slug":"distribute-money-to-maximum-children","difficulty":1,"accepted":48751,"submitted":237496,"acceptance":0.20527082561390508},{"id":2592,"title":"Maximize Greatness of an Array","slug":"maximize-greatness-of-an-array","difficulty":2,"accepted":41933,"submitted":68249,"acceptance":0.6144119327755718},{"id":2593,"title":"Find Score of an Array After Marking All Elements","slug":"find-score-of-an-array-after-marking-all-elements","difficulty":2,"accepted":135686,"submitted":210340,"acceptance":0.6450793952648094},{"id":2594,"title":"Minimum Time to Repair Cars","slug":"minimum-time-to-repair-cars","difficulty":2,"accepted":155094,"submitted":260331,"acceptance":0.5957569402030491},{"id":2595,"title":"Number of Even and Odd Bits","slug":"number-of-even-and-odd-bits","difficulty":1,"accepted":69388,"submitted":94414,"acceptance":0.7349333785243714},{"id":2596,"title":"Check Knight Tour Configuration","slug":"check-knight-tour-configuration","difficulty":2,"accepted":54946,"submitted":90122,"acceptance":0.6096846496970773},{"id":2597,"title":"The Number of Beautiful Subsets","slug":"the-number-of-beautiful-subsets","difficulty":2,"accepted":131220,"submitted":257596,"acceptance":0.5094023199117999},{"id":2598,"title":"Smallest Missing Non-negative Integer After Operations","slug":"smallest-missing-non-negative-integer-after-operations","difficulty":2,"accepted":114502,"submitted":204603,"acceptance":0.5596301129504455},{"id":2599,"title":"Make the Prefix Sum Non-negative","slug":"make-the-prefix-sum-non-negative","difficulty":2,"accepted":8437,"submitted":16240,"acceptance":0.5195197044334975},{"id":2600,"title":"K Items With the Maximum Sum","slug":"k-items-with-the-maximum-sum","difficulty":1,"accepted":63938,"submitted":106151,"acceptance":0.6023306421983777},{"id":2601,"title":"Prime Subtraction Operation","slug":"prime-subtraction-operation","difficulty":2,"accepted":119858,"submitted":215723,"acceptance":0.5556106673836355},{"id":2602,"title":"Minimum Operations to Make All Array Elements Equal","slug":"minimum-operations-to-make-all-array-elements-equal","difficulty":2,"accepted":29437,"submitted":77270,"acceptance":0.3809628575126181},{"id":2603,"title":"Collect Coins in a Tree","slug":"collect-coins-in-a-tree","difficulty":3,"accepted":17011,"submitted":42700,"acceptance":0.398384074941452},{"id":2604,"title":"Minimum Time to Eat All Grains","slug":"minimum-time-to-eat-all-grains","difficulty":3,"accepted":2231,"submitted":5479,"acceptance":0.40719109326519437},{"id":2605,"title":"Form Smallest Number From Two Digit Arrays","slug":"form-smallest-number-from-two-digit-arrays","difficulty":1,"accepted":51156,"submitted":92828,"acceptance":0.5510837247382255},{"id":2606,"title":"Find the Substring With Maximum Cost","slug":"find-the-substring-with-maximum-cost","difficulty":2,"accepted":32114,"submitted":55497,"acceptance":0.578661909652774},{"id":2607,"title":"Make K-Subarray Sums Equal","slug":"make-k-subarray-sums-equal","difficulty":2,"accepted":14352,"submitted":37415,"acceptance":0.38358946946411865},{"id":2608,"title":"Shortest Cycle in a Graph","slug":"shortest-cycle-in-a-graph","difficulty":3,"accepted":30683,"submitted":77863,"acceptance":0.39406393280505503},{"id":2609,"title":"Find the Longest Balanced Substring of a Binary String","slug":"find-the-longest-balanced-substring-of-a-binary-string","difficulty":1,"accepted":39138,"submitted":84315,"acceptance":0.46418786692759295},{"id":2610,"title":"Convert an Array Into a 2D Array With Conditions","slug":"convert-an-array-into-a-2d-array-with-conditions","difficulty":2,"accepted":225429,"submitted":260993,"acceptance":0.8637358090063718},{"id":2611,"title":"Mice and Cheese","slug":"mice-and-cheese","difficulty":2,"accepted":38783,"submitted":79732,"acceptance":0.48641699693974816},{"id":2612,"title":"Minimum Reverse Operations","slug":"minimum-reverse-operations","difficulty":3,"accepted":7146,"submitted":42355,"acceptance":0.16871679848896234},{"id":2613,"title":"Beautiful Pairs","slug":"beautiful-pairs","difficulty":3,"accepted":1085,"submitted":2211,"acceptance":0.49072817729534146},{"id":2614,"title":"Prime In Diagonal","slug":"prime-in-diagonal","difficulty":1,"accepted":70330,"submitted":187143,"acceptance":0.3758088734283409},{"id":2615,"title":"Sum of Distances","slug":"sum-of-distances","difficulty":2,"accepted":29069,"submitted":89214,"acceptance":0.32583451027865584},{"id":2616,"title":"Minimize the Maximum Difference of Pairs","slug":"minimize-the-maximum-difference-of-pairs","difficulty":2,"accepted":169497,"submitted":332979,"acceptance":0.5090321011234943},{"id":2617,"title":"Minimum Number of Visited Cells in a Grid","slug":"minimum-number-of-visited-cells-in-a-grid","difficulty":3,"accepted":11959,"submitted":50354,"acceptance":0.237498510545339},{"id":2618,"title":"Check if Object Instance of Class","slug":"check-if-object-instance-of-class","difficulty":2,"accepted":39169,"submitted":133347,"acceptance":0.29373739191732845},{"id":2619,"title":"Array Prototype Last","slug":"array-prototype-last","difficulty":1,"accepted":239447,"submitted":320652,"acceptance":0.7467503711188453},{"id":2620,"title":"Counter","slug":"counter","difficulty":1,"accepted":705839,"submitted":856416,"acceptance":0.8241777360535067},{"id":2621,"title":"Sleep","slug":"sleep","difficulty":1,"accepted":249703,"submitted":285683,"acceptance":0.8740562091549025},{"id":2622,"title":"Cache With Time Limit","slug":"cache-with-time-limit","difficulty":2,"accepted":83635,"submitted":109858,"acceptance":0.7613009521382148},{"id":2623,"title":"Memoize","slug":"memoize","difficulty":2,"accepted":184215,"submitted":283739,"acceptance":0.6492410278460135},{"id":2624,"title":"Snail Traversal","slug":"snail-traversal","difficulty":2,"accepted":19538,"submitted":28563,"acceptance":0.6840317893778665},{"id":2625,"title":"Flatten Deeply Nested Array","slug":"flatten-deeply-nested-array","difficulty":2,"accepted":81223,"submitted":123587,"acceptance":0.6572131373040854},{"id":2626,"title":"Array Reduce Transformation","slug":"array-reduce-transformation","difficulty":1,"accepted":291316,"submitted":340515,"acceptance":0.8555159097249754},{"id":2627,"title":"Debounce","slug":"debounce","difficulty":2,"accepted":92530,"submitted":100850,"acceptance":0.9175012394645513},{"id":2628,"title":"JSON Deep Equal","slug":"json-deep-equal","difficulty":2,"accepted":15092,"submitted":38079,"acceptance":0.39633393734079153},{"id":2629,"title":"Function Composition","slug":"function-composition","difficulty":1,"accepted":244052,"submitted":280943,"acceptance":0.8686886663842843},{"id":2630,"title":"Memoize II","slug":"memoize-ii","difficulty":3,"accepted":11770,"submitted":30453,"acceptance":0.3864972252323252},{"id":2631,"title":"Group By","slug":"group-by","difficulty":2,"accepted":78201,"submitted":96061,"acceptance":0.8140764722415965},{"id":2632,"title":"Curry","slug":"curry","difficulty":2,"accepted":18855,"submitted":21082,"acceptance":0.8943648610188787},{"id":2633,"title":"Convert Object to JSON String","slug":"convert-object-to-json-string","difficulty":2,"accepted":13960,"submitted":17903,"acceptance":0.7797575825280679},{"id":2634,"title":"Filter Elements from Array","slug":"filter-elements-from-array","difficulty":1,"accepted":309395,"submitted":361539,"acceptance":0.8557721297010834},{"id":2635,"title":"Apply Transform Over Each Element in Array","slug":"apply-transform-over-each-element-in-array","difficulty":1,"accepted":339160,"submitted":393284,"acceptance":0.8623793492743158},{"id":2636,"title":"Promise Pool","slug":"promise-pool","difficulty":2,"accepted":15035,"submitted":18944,"acceptance":0.7936549831081081},{"id":2637,"title":"Promise Time Limit","slug":"promise-time-limit","difficulty":2,"accepted":97581,"submitted":117274,"acceptance":0.8320770162184287},{"id":2638,"title":"Count the Number of K-Free Subsets","slug":"count-the-number-of-k-free-subsets","difficulty":2,"accepted":5299,"submitted":11210,"acceptance":0.4727029438001784},{"id":2639,"title":"Find the Width of Columns of a Grid","slug":"find-the-width-of-columns-of-a-grid","difficulty":1,"accepted":40642,"submitted":57729,"acceptance":0.7040135806960107},{"id":2640,"title":"Find the Score of All Prefixes of an Array","slug":"find-the-score-of-all-prefixes-of-an-array","difficulty":2,"accepted":44886,"submitted":61612,"acceptance":0.7285269103421411},{"id":2641,"title":"Cousins in Binary Tree II","slug":"cousins-in-binary-tree-ii","difficulty":2,"accepted":128745,"submitted":169921,"acceptance":0.7576756257319578},{"id":2642,"title":"Design Graph With Shortest Path Calculator","slug":"design-graph-with-shortest-path-calculator","difficulty":3,"accepted":79358,"submitted":122068,"acceptance":0.6501130517416522},{"id":2643,"title":"Row With Maximum Ones","slug":"row-with-maximum-ones","difficulty":1,"accepted":120480,"submitted":162185,"acceptance":0.7428553812004809},{"id":2644,"title":"Find the Maximum Divisibility Score","slug":"find-the-maximum-divisibility-score","difficulty":1,"accepted":42410,"submitted":81913,"acceptance":0.5177444361700829},{"id":2645,"title":"Minimum Additions to Make Valid String","slug":"minimum-additions-to-make-valid-string","difficulty":2,"accepted":38201,"submitted":74899,"acceptance":0.5100335117958851},{"id":2646,"title":"Minimize the Total Price of the Trips","slug":"minimize-the-total-price-of-the-trips","difficulty":3,"accepted":13799,"submitted":28741,"acceptance":0.480115514421906},{"id":2647,"title":"Color the Triangle Red","slug":"color-the-triangle-red","difficulty":3,"accepted":468,"submitted":788,"acceptance":0.5939086294416244},{"id":2648,"title":"Generate Fibonacci Sequence","slug":"generate-fibonacci-sequence","difficulty":1,"accepted":49818,"submitted":59556,"acceptance":0.8364900261938344},{"id":2649,"title":"Nested Array Generator","slug":"nested-array-generator","difficulty":2,"accepted":19228,"submitted":23893,"acceptance":0.8047545306156615},{"id":2650,"title":"Design Cancellable Function","slug":"design-cancellable-function","difficulty":3,"accepted":4677,"submitted":8248,"acceptance":0.5670465567410281},{"id":2651,"title":"Calculate Delayed Arrival Time","slug":"calculate-delayed-arrival-time","difficulty":1,"accepted":90194,"submitted":119295,"acceptance":0.7560585104153569},{"id":2652,"title":"Sum Multiples","slug":"sum-multiples","difficulty":1,"accepted":194769,"submitted":226761,"acceptance":0.8589175387302049},{"id":2653,"title":"Sliding Subarray Beauty","slug":"sliding-subarray-beauty","difficulty":2,"accepted":34369,"submitted":93541,"acceptance":0.36742177227098277},{"id":2654,"title":"Minimum Number of Operations to Make All Array Elements Equal to 1","slug":"minimum-number-of-operations-to-make-all-array-elements-equal-to-1","difficulty":2,"accepted":88344,"submitted":161516,"acceptance":0.5469674830976498},{"id":2655,"title":"Find Maximal Uncovered Ranges","slug":"find-maximal-uncovered-ranges","difficulty":2,"accepted":2220,"submitted":4490,"acceptance":0.49443207126948774},{"id":2656,"title":"Maximum Sum With Exactly K Elements ","slug":"maximum-sum-with-exactly-k-elements","difficulty":1,"accepted":105040,"submitted":130320,"acceptance":0.8060159607120934},{"id":2657,"title":"Find the Prefix Common Array of Two Arrays","slug":"find-the-prefix-common-array-of-two-arrays","difficulty":2,"accepted":237769,"submitted":273438,"acceptance":0.8695536099591132},{"id":2658,"title":"Maximum Number of Fish in a Grid","slug":"maximum-number-of-fish-in-a-grid","difficulty":2,"accepted":162933,"submitted":230976,"acceptance":0.7054109517871987},{"id":2659,"title":"Make Array Empty","slug":"make-array-empty","difficulty":3,"accepted":14680,"submitted":54590,"acceptance":0.268913720461623},{"id":2660,"title":"Determine the Winner of a Bowling Game","slug":"determine-the-winner-of-a-bowling-game","difficulty":1,"accepted":45003,"submitted":120371,"acceptance":0.3738691212999809},{"id":2661,"title":"First Completely Painted Row or Column","slug":"first-completely-painted-row-or-column","difficulty":2,"accepted":159220,"submitted":249310,"acceptance":0.638642653724279},{"id":2662,"title":"Minimum Cost of a Path With Special Roads","slug":"minimum-cost-of-a-path-with-special-roads","difficulty":2,"accepted":19792,"submitted":46149,"acceptance":0.4288716981949771},{"id":2663,"title":"Lexicographically Smallest Beautiful String","slug":"lexicographically-smallest-beautiful-string","difficulty":3,"accepted":10975,"submitted":28790,"acceptance":0.3812087530392497},{"id":2664,"title":"The Knight’s Tour","slug":"the-knights-tour","difficulty":2,"accepted":6767,"submitted":9310,"acceptance":0.7268528464017185},{"id":2665,"title":"Counter II","slug":"counter-ii","difficulty":1,"accepted":381315,"submitted":469333,"acceptance":0.8124615145323256},{"id":2666,"title":"Allow One Function Call","slug":"allow-one-function-call","difficulty":1,"accepted":194153,"submitted":223959,"acceptance":0.8669131403515822},{"id":2667,"title":"Create Hello World Function","slug":"create-hello-world-function","difficulty":1,"accepted":836432,"submitted":1020885,"acceptance":0.819320491534306},{"id":2668,"title":"Find Latest Salaries","slug":"find-latest-salaries","difficulty":1,"accepted":6788,"submitted":9047,"acceptance":0.750303968166243},{"id":2669,"title":"Count Artist Occurrences On Spotify Ranking List","slug":"count-artist-occurrences-on-spotify-ranking-list","difficulty":1,"accepted":6063,"submitted":8173,"acceptance":0.7418328643093112},{"id":2670,"title":"Find the Distinct Difference Array","slug":"find-the-distinct-difference-array","difficulty":1,"accepted":51925,"submitted":67309,"acceptance":0.7714421548381346},{"id":2671,"title":"Frequency Tracker","slug":"frequency-tracker","difficulty":2,"accepted":29112,"submitted":93554,"acceptance":0.31117857066507043},{"id":2672,"title":"Number of Adjacent Elements With the Same Color","slug":"number-of-adjacent-elements-with-the-same-color","difficulty":2,"accepted":32851,"submitted":55428,"acceptance":0.5926787905029949},{"id":2673,"title":"Make Costs of Paths Equal in a Binary Tree","slug":"make-costs-of-paths-equal-in-a-binary-tree","difficulty":2,"accepted":24025,"submitted":41180,"acceptance":0.5834142787761049},{"id":2674,"title":"Split a Circular Linked List","slug":"split-a-circular-linked-list","difficulty":2,"accepted":3332,"submitted":4299,"acceptance":0.775063968364736},{"id":2675,"title":"Array of Objects to Matrix","slug":"array-of-objects-to-matrix","difficulty":3,"accepted":6238,"submitted":9092,"acceptance":0.6860976682798064},{"id":2676,"title":"Throttle","slug":"throttle","difficulty":2,"accepted":11589,"submitted":13897,"acceptance":0.8339209901417572},{"id":2677,"title":"Chunk Array","slug":"chunk-array","difficulty":1,"accepted":115023,"submitted":135879,"acceptance":0.8465104983109973},{"id":2678,"title":"Number of Senior Citizens","slug":"number-of-senior-citizens","difficulty":1,"accepted":301106,"submitted":370565,"acceptance":0.8125592001403262},{"id":2679,"title":"Sum in a Matrix","slug":"sum-in-a-matrix","difficulty":2,"accepted":49148,"submitted":81192,"acceptance":0.6053305744408316},{"id":2680,"title":"Maximum OR","slug":"maximum-or","difficulty":2,"accepted":19217,"submitted":44791,"acceptance":0.4290370833426358},{"id":2681,"title":"Power of Heroes","slug":"power-of-heroes","difficulty":3,"accepted":12887,"submitted":40902,"acceptance":0.31507016771796},{"id":2682,"title":"Find the Losers of the Circular Game","slug":"find-the-losers-of-the-circular-game","difficulty":1,"accepted":34298,"submitted":68670,"acceptance":0.4994611912043105},{"id":2683,"title":"Neighboring Bitwise XOR","slug":"neighboring-bitwise-xor","difficulty":2,"accepted":163766,"submitted":205207,"acceptance":0.7980526980073779},{"id":2684,"title":"Maximum Number of Moves in a Grid","slug":"maximum-number-of-moves-in-a-grid","difficulty":2,"accepted":132915,"submitted":226260,"acceptance":0.5874436488994962},{"id":2685,"title":"Count the Number of Complete Components","slug":"count-the-number-of-complete-components","difficulty":2,"accepted":159346,"submitted":204914,"acceptance":0.777623783636062},{"id":2686,"title":"Immediate Food Delivery III","slug":"immediate-food-delivery-iii","difficulty":2,"accepted":5837,"submitted":8305,"acceptance":0.7028296207104154},{"id":2687,"title":"Bikes Last Time Used ","slug":"bikes-last-time-used","difficulty":1,"accepted":6472,"submitted":8044,"acceptance":0.8045748383888612},{"id":2688,"title":"Find Active Users","slug":"find-active-users","difficulty":2,"accepted":6008,"submitted":13336,"acceptance":0.4505098980203959},{"id":2689,"title":"Extract Kth Character From The Rope Tree","slug":"extract-kth-character-from-the-rope-tree","difficulty":1,"accepted":4879,"submitted":6650,"acceptance":0.7336842105263158},{"id":2690,"title":"Infinite Method Object","slug":"infinite-method-object","difficulty":1,"accepted":2111,"submitted":2268,"acceptance":0.9307760141093474},{"id":2691,"title":"Immutability Helper","slug":"immutability-helper","difficulty":3,"accepted":388,"submitted":974,"acceptance":0.39835728952772076},{"id":2692,"title":"Make Object Immutable","slug":"make-object-immutable","difficulty":2,"accepted":734,"submitted":1176,"acceptance":0.6241496598639455},{"id":2693,"title":"Call Function with Custom Context","slug":"call-function-with-custom-context","difficulty":2,"accepted":14716,"submitted":18914,"acceptance":0.7780480067674739},{"id":2694,"title":"Event Emitter","slug":"event-emitter","difficulty":2,"accepted":46627,"submitted":62189,"acceptance":0.7497628197912815},{"id":2695,"title":"Array Wrapper","slug":"array-wrapper","difficulty":1,"accepted":72985,"submitted":81910,"acceptance":0.8910389451837383},{"id":2696,"title":"Minimum String Length After Removing Substrings","slug":"minimum-string-length-after-removing-substrings","difficulty":1,"accepted":248681,"submitted":322245,"acceptance":0.7717140684882621},{"id":2697,"title":"Lexicographically Smallest Palindrome","slug":"lexicographically-smallest-palindrome","difficulty":1,"accepted":84302,"submitted":103736,"acceptance":0.8126590576077736},{"id":2698,"title":"Find the Punishment Number of an Integer","slug":"find-the-punishment-number-of-an-integer","difficulty":2,"accepted":151579,"submitted":185499,"acceptance":0.8171418713847514},{"id":2699,"title":"Modify Graph Edge Weights","slug":"modify-graph-edge-weights","difficulty":3,"accepted":67606,"submitted":121628,"acceptance":0.5558424047094419},{"id":2700,"title":"Differences Between Two Objects","slug":"differences-between-two-objects","difficulty":2,"accepted":7867,"submitted":10553,"acceptance":0.7454752203164977},{"id":2701,"title":"Consecutive Transactions with Increasing Amounts","slug":"consecutive-transactions-with-increasing-amounts","difficulty":3,"accepted":5618,"submitted":16135,"acceptance":0.34818717074682365},{"id":2702,"title":"Minimum Operations to Make Numbers Non-positive","slug":"minimum-operations-to-make-numbers-non-positive","difficulty":3,"accepted":6282,"submitted":14242,"acceptance":0.4410897345878388},{"id":2703,"title":"Return Length of Arguments Passed","slug":"return-length-of-arguments-passed","difficulty":1,"accepted":298681,"submitted":316036,"acceptance":0.9450853700211368},{"id":2704,"title":"To Be Or Not To Be","slug":"to-be-or-not-to-be","difficulty":1,"accepted":354115,"submitted":559175,"acceptance":0.6332811731568829},{"id":2705,"title":"Compact Object","slug":"compact-object","difficulty":2,"accepted":47396,"submitted":69727,"acceptance":0.6797366873664434},{"id":2706,"title":"Buy Two Chocolates","slug":"buy-two-chocolates","difficulty":1,"accepted":223589,"submitted":327127,"acceptance":0.6834929553353897},{"id":2707,"title":"Extra Characters in a String","slug":"extra-characters-in-a-string","difficulty":2,"accepted":198717,"submitted":346689,"acceptance":0.5731851890310913},{"id":2708,"title":"Maximum Strength of a Group","slug":"maximum-strength-of-a-group","difficulty":2,"accepted":38329,"submitted":149419,"acceptance":0.25652025512150395},{"id":2709,"title":"Greatest Common Divisor Traversal","slug":"greatest-common-divisor-traversal","difficulty":3,"accepted":76638,"submitted":183460,"acceptance":0.41773683636760056},{"id":2710,"title":"Remove Trailing Zeros From a String","slug":"remove-trailing-zeros-from-a-string","difficulty":1,"accepted":95092,"submitted":119615,"acceptance":0.7949839067006647},{"id":2711,"title":"Difference of Number of Distinct Values on Diagonals","slug":"difference-of-number-of-distinct-values-on-diagonals","difficulty":2,"accepted":22789,"submitted":33330,"acceptance":0.6837383738373838},{"id":2712,"title":"Minimum Cost to Make All Characters Equal","slug":"minimum-cost-to-make-all-characters-equal","difficulty":2,"accepted":22836,"submitted":42033,"acceptance":0.5432874170294768},{"id":2713,"title":"Maximum Strictly Increasing Cells in a Matrix","slug":"maximum-strictly-increasing-cells-in-a-matrix","difficulty":3,"accepted":16513,"submitted":52659,"acceptance":0.3135836229324522},{"id":2714,"title":"Find Shortest Path with K Hops","slug":"find-shortest-path-with-k-hops","difficulty":3,"accepted":2366,"submitted":3439,"acceptance":0.6879906949694679},{"id":2715,"title":"Timeout Cancellation","slug":"timeout-cancellation","difficulty":1,"accepted":101264,"submitted":112948,"acceptance":0.8965541665191061},{"id":2716,"title":"Minimize String Length","slug":"minimize-string-length","difficulty":1,"accepted":79668,"submitted":100746,"acceptance":0.7907807754154011},{"id":2717,"title":"Semi-Ordered Permutation","slug":"semi-ordered-permutation","difficulty":1,"accepted":38160,"submitted":59443,"acceptance":0.6419595242501219},{"id":2718,"title":"Sum of Matrix After Queries","slug":"sum-of-matrix-after-queries","difficulty":2,"accepted":25010,"submitted":78013,"acceptance":0.32058759437529644},{"id":2719,"title":"Count of Integers","slug":"count-of-integers","difficulty":3,"accepted":19998,"submitted":52056,"acceptance":0.38416320885200556},{"id":2720,"title":"Popularity Percentage","slug":"popularity-percentage","difficulty":3,"accepted":3963,"submitted":7438,"acceptance":0.5328045173433719},{"id":2721,"title":"Execute Asynchronous Functions in Parallel","slug":"execute-asynchronous-functions-in-parallel","difficulty":2,"accepted":54695,"submitted":69686,"acceptance":0.7848778807794966},{"id":2722,"title":"Join Two Arrays by ID","slug":"join-two-arrays-by-id","difficulty":2,"accepted":60774,"submitted":106030,"acceptance":0.5731774026218994},{"id":2723,"title":"Add Two Promises","slug":"add-two-promises","difficulty":1,"accepted":186348,"submitted":203102,"acceptance":0.9175094287599335},{"id":2724,"title":"Sort By","slug":"sort-by","difficulty":1,"accepted":80649,"submitted":96911,"acceptance":0.8321965514750648},{"id":2725,"title":"Interval Cancellation","slug":"interval-cancellation","difficulty":1,"accepted":83874,"submitted":98880,"acceptance":0.848240291262136},{"id":2726,"title":"Calculator with Method Chaining","slug":"calculator-with-method-chaining","difficulty":1,"accepted":55657,"submitted":71673,"acceptance":0.7765406778005665},{"id":2727,"title":"Is Object Empty","slug":"is-object-empty","difficulty":1,"accepted":119516,"submitted":145928,"acceptance":0.8190066334082561},{"id":2728,"title":"Count Houses in a Circular Street","slug":"count-houses-in-a-circular-street","difficulty":1,"accepted":3290,"submitted":3818,"acceptance":0.8617077003666841},{"id":2729,"title":"Check if The Number is Fascinating","slug":"check-if-the-number-is-fascinating","difficulty":1,"accepted":62112,"submitted":117206,"acceptance":0.5299387403375254},{"id":2730,"title":"Find the Longest Semi-Repetitive Substring","slug":"find-the-longest-semi-repetitive-substring","difficulty":2,"accepted":33119,"submitted":85359,"acceptance":0.3879965791539264},{"id":2731,"title":"Movement of Robots","slug":"movement-of-robots","difficulty":2,"accepted":18561,"submitted":66424,"acceptance":0.27943213296398894},{"id":2732,"title":"Find a Good Subset of the Matrix","slug":"find-a-good-subset-of-the-matrix","difficulty":3,"accepted":8313,"submitted":17783,"acceptance":0.4674689310015183},{"id":2733,"title":"Neither Minimum nor Maximum","slug":"neither-minimum-nor-maximum","difficulty":1,"accepted":136127,"submitted":178292,"acceptance":0.7635059340856573},{"id":2734,"title":"Lexicographically Smallest String After Substring Operation","slug":"lexicographically-smallest-string-after-substring-operation","difficulty":2,"accepted":35956,"submitted":103415,"acceptance":0.3476865058260407},{"id":2735,"title":"Collecting Chocolates","slug":"collecting-chocolates","difficulty":2,"accepted":15252,"submitted":43717,"acceptance":0.3488802982821328},{"id":2736,"title":"Maximum Sum Queries","slug":"maximum-sum-queries","difficulty":3,"accepted":8245,"submitted":27353,"acceptance":0.3014294592914854},{"id":2737,"title":"Find the Closest Marked Node","slug":"find-the-closest-marked-node","difficulty":2,"accepted":7382,"submitted":11288,"acceptance":0.6539688164422396},{"id":2738,"title":"Count Occurrences in Text","slug":"count-occurrences-in-text","difficulty":2,"accepted":11696,"submitted":21450,"acceptance":0.5452680652680653},{"id":2739,"title":"Total Distance Traveled","slug":"total-distance-traveled","difficulty":1,"accepted":63082,"submitted":152604,"acceptance":0.41337055385179944},{"id":2740,"title":"Find the Value of the Partition","slug":"find-the-value-of-the-partition","difficulty":2,"accepted":41085,"submitted":63372,"acceptance":0.6483147131225147},{"id":2741,"title":"Special Permutations","slug":"special-permutations","difficulty":2,"accepted":17778,"submitted":60336,"acceptance":0.2946499602227526},{"id":2742,"title":"Painting the Walls","slug":"painting-the-walls","difficulty":3,"accepted":80008,"submitted":163328,"acceptance":0.4898608934169279},{"id":2743,"title":"Count Substrings Without Repeating Character","slug":"count-substrings-without-repeating-character","difficulty":2,"accepted":9277,"submitted":12214,"acceptance":0.7595382348125103},{"id":2744,"title":"Find Maximum Number of String Pairs","slug":"find-maximum-number-of-string-pairs","difficulty":1,"accepted":115545,"submitted":140247,"acceptance":0.8238678902222507},{"id":2745,"title":"Construct the Longest New String","slug":"construct-the-longest-new-string","difficulty":2,"accepted":26771,"submitted":48928,"acceptance":0.5471509156311315},{"id":2746,"title":"Decremental String Concatenation","slug":"decremental-string-concatenation","difficulty":2,"accepted":11139,"submitted":40317,"acceptance":0.276285437904606},{"id":2747,"title":"Count Zero Request Servers","slug":"count-zero-request-servers","difficulty":2,"accepted":12753,"submitted":35681,"acceptance":0.35741711274908217},{"id":2748,"title":"Number of Beautiful Pairs","slug":"number-of-beautiful-pairs","difficulty":1,"accepted":47453,"submitted":90861,"acceptance":0.5222592751565578},{"id":2749,"title":"Minimum Operations to Make the Integer Zero","slug":"minimum-operations-to-make-the-integer-zero","difficulty":2,"accepted":96988,"submitted":166670,"acceptance":0.5819163616727665},{"id":2750,"title":"Ways to Split Array Into Good Subarrays","slug":"ways-to-split-array-into-good-subarrays","difficulty":2,"accepted":28009,"submitted":80123,"acceptance":0.34957502839384447},{"id":2751,"title":"Robot Collisions","slug":"robot-collisions","difficulty":3,"accepted":190077,"submitted":308496,"acceptance":0.6161408899953322},{"id":2752,"title":"Customers with Maximum Number of Transactions on Consecutive Days","slug":"customers-with-maximum-number-of-transactions-on-consecutive-days","difficulty":3,"accepted":3186,"submitted":7510,"acceptance":0.42423435419440747},{"id":2753,"title":"Count Houses in a Circular Street II","slug":"count-houses-in-a-circular-street-ii","difficulty":3,"accepted":945,"submitted":1527,"acceptance":0.618860510805501},{"id":2754,"title":"Bind Function to Context","slug":"bind-function-to-context","difficulty":2,"accepted":1100,"submitted":1261,"acceptance":0.8723235527359239},{"id":2755,"title":"Deep Merge of Two Objects","slug":"deep-merge-of-two-objects","difficulty":2,"accepted":917,"submitted":1419,"acceptance":0.6462297392529951},{"id":2756,"title":"Query Batching","slug":"query-batching","difficulty":3,"accepted":537,"submitted":790,"acceptance":0.6797468354430379},{"id":2757,"title":"Generate Circular Array Values","slug":"generate-circular-array-values","difficulty":2,"accepted":702,"submitted":932,"acceptance":0.7532188841201717},{"id":2758,"title":"Next Day","slug":"next-day","difficulty":1,"accepted":1607,"submitted":1871,"acceptance":0.8588989845002672},{"id":2759,"title":"Convert JSON String to Object","slug":"convert-json-string-to-object","difficulty":3,"accepted":933,"submitted":1515,"acceptance":0.6158415841584158},{"id":2760,"title":"Longest Even Odd Subarray With Threshold","slug":"longest-even-odd-subarray-with-threshold","difficulty":1,"accepted":52877,"submitted":165713,"acceptance":0.31908782050895224},{"id":2761,"title":"Prime Pairs With Target Sum","slug":"prime-pairs-with-target-sum","difficulty":2,"accepted":40219,"submitted":107790,"acceptance":0.3731236663883477},{"id":2762,"title":"Continuous Subarrays","slug":"continuous-subarrays","difficulty":2,"accepted":118960,"submitted":205302,"acceptance":0.5794390702477326},{"id":2763,"title":"Sum of Imbalance Numbers of All Subarrays","slug":"sum-of-imbalance-numbers-of-all-subarrays","difficulty":3,"accepted":9820,"submitted":22717,"acceptance":0.432275388475591},{"id":2764,"title":"Is Array a Preorder of Some ‌Binary Tree","slug":"is-array-a-preorder-of-some-binary-tree","difficulty":2,"accepted":1959,"submitted":2884,"acceptance":0.6792649098474342},{"id":2765,"title":"Longest Alternating Subarray","slug":"longest-alternating-subarray","difficulty":1,"accepted":33572,"submitted":95317,"acceptance":0.352214190543135},{"id":2766,"title":"Relocate Marbles","slug":"relocate-marbles","difficulty":2,"accepted":25468,"submitted":49511,"acceptance":0.5143907414513946},{"id":2767,"title":"Partition String Into Minimum Beautiful Substrings","slug":"partition-string-into-minimum-beautiful-substrings","difficulty":2,"accepted":22231,"submitted":41194,"acceptance":0.5396659707724426},{"id":2768,"title":"Number of Black Blocks","slug":"number-of-black-blocks","difficulty":2,"accepted":21597,"submitted":51828,"acceptance":0.4167052558462607},{"id":2769,"title":"Find the Maximum Achievable Number","slug":"find-the-maximum-achievable-number","difficulty":1,"accepted":205247,"submitted":224933,"acceptance":0.9124806053358111},{"id":2770,"title":"Maximum Number of Jumps to Reach the Last Index","slug":"maximum-number-of-jumps-to-reach-the-last-index","difficulty":2,"accepted":35003,"submitted":107196,"acceptance":0.3265327064442703},{"id":2771,"title":"Longest Non-decreasing Subarray From Two Arrays","slug":"longest-non-decreasing-subarray-from-two-arrays","difficulty":2,"accepted":36385,"submitted":117059,"acceptance":0.31082616458367146},{"id":2772,"title":"Apply Operations to Make All Array Elements Equal to Zero","slug":"apply-operations-to-make-all-array-elements-equal-to-zero","difficulty":2,"accepted":18303,"submitted":54881,"acceptance":0.3335033982616935},{"id":2773,"title":"Height of Special Binary Tree","slug":"height-of-special-binary-tree","difficulty":2,"accepted":1452,"submitted":1948,"acceptance":0.7453798767967146},{"id":2774,"title":"Array Upper Bound","slug":"array-upper-bound","difficulty":1,"accepted":2287,"submitted":2781,"acceptance":0.8223660553757641},{"id":2775,"title":"Undefined to Null","slug":"undefined-to-null","difficulty":2,"accepted":1011,"submitted":1401,"acceptance":0.721627408993576},{"id":2776,"title":"Convert Callback Based Function to Promise Based Function","slug":"convert-callback-based-function-to-promise-based-function","difficulty":2,"accepted":1278,"submitted":1408,"acceptance":0.9076704545454546},{"id":2777,"title":"Date Range Generator","slug":"date-range-generator","difficulty":2,"accepted":717,"submitted":867,"acceptance":0.8269896193771626},{"id":2778,"title":"Sum of Squares of Special Elements ","slug":"sum-of-squares-of-special-elements","difficulty":1,"accepted":101234,"submitted":123411,"acceptance":0.820299649139866},{"id":2779,"title":"Maximum Beauty of an Array After Applying Operation","slug":"maximum-beauty-of-an-array-after-applying-operation","difficulty":2,"accepted":132234,"submitted":226548,"acceptance":0.5836908734572805},{"id":2780,"title":"Minimum Index of a Valid Split","slug":"minimum-index-of-a-valid-split","difficulty":2,"accepted":148960,"submitted":197295,"acceptance":0.7550115309561823},{"id":2781,"title":"Length of the Longest Valid Substring","slug":"length-of-the-longest-valid-substring","difficulty":3,"accepted":38614,"submitted":100771,"acceptance":0.38318563872542694},{"id":2782,"title":"Number of Unique Categories","slug":"number-of-unique-categories","difficulty":2,"accepted":3524,"submitted":4204,"acceptance":0.8382492863939106},{"id":2783,"title":"Flight Occupancy and Waitlist Analysis","slug":"flight-occupancy-and-waitlist-analysis","difficulty":2,"accepted":4995,"submitted":12882,"acceptance":0.38775034932463903},{"id":2784,"title":"Check if Array is Good","slug":"check-if-array-is-good","difficulty":1,"accepted":65306,"submitted":133833,"acceptance":0.4879663461179231},{"id":2785,"title":"Sort Vowels in a String","slug":"sort-vowels-in-a-string","difficulty":2,"accepted":309887,"submitted":371447,"acceptance":0.8342697612310774},{"id":2786,"title":"Visit Array Positions to Maximize Score","slug":"visit-array-positions-to-maximize-score","difficulty":2,"accepted":25038,"submitted":66708,"acceptance":0.3753372908796546},{"id":2787,"title":"Ways to Express an Integer as Sum of Powers","slug":"ways-to-express-an-integer-as-sum-of-powers","difficulty":2,"accepted":118764,"submitted":238322,"acceptance":0.4983341865207576},{"id":2788,"title":"Split Strings by Separator","slug":"split-strings-by-separator","difficulty":1,"accepted":79181,"submitted":104064,"acceptance":0.7608875307503075},{"id":2789,"title":"Largest Element in an Array after Merge Operations","slug":"largest-element-in-an-array-after-merge-operations","difficulty":2,"accepted":37509,"submitted":78512,"acceptance":0.4777486244141023},{"id":2790,"title":"Maximum Number of Groups With Increasing Length","slug":"maximum-number-of-groups-with-increasing-length","difficulty":3,"accepted":13723,"submitted":59611,"acceptance":0.23020918957910452},{"id":2791,"title":"Count Paths That Can Form a Palindrome in a Tree","slug":"count-paths-that-can-form-a-palindrome-in-a-tree","difficulty":3,"accepted":13578,"submitted":26452,"acceptance":0.5133071223347951},{"id":2792,"title":"Count Nodes That Are Great Enough","slug":"count-nodes-that-are-great-enough","difficulty":3,"accepted":1423,"submitted":2502,"acceptance":0.5687450039968026},{"id":2793,"title":"Status of Flight Tickets","slug":"status-of-flight-tickets","difficulty":3,"accepted":3509,"submitted":4443,"acceptance":0.7897816790456899},{"id":2794,"title":"Create Object from Two Arrays","slug":"create-object-from-two-arrays","difficulty":1,"accepted":1774,"submitted":2754,"acceptance":0.6441539578794481},{"id":2795,"title":"Parallel Execution of Promises for Individual Results Retrieval","slug":"parallel-execution-of-promises-for-individual-results-retrieval","difficulty":2,"accepted":1085,"submitted":1240,"acceptance":0.875},{"id":2796,"title":"Repeat String","slug":"repeat-string","difficulty":1,"accepted":3863,"submitted":4148,"acceptance":0.9312921890067503},{"id":2797,"title":"Partial Function with Placeholders","slug":"partial-function-with-placeholders","difficulty":1,"accepted":1762,"submitted":1973,"acceptance":0.8930562595032945},{"id":2798,"title":"Number of Employees Who Met the Target","slug":"number-of-employees-who-met-the-target","difficulty":1,"accepted":242865,"submitted":276524,"acceptance":0.8782781964675761},{"id":2799,"title":"Count Complete Subarrays in an Array","slug":"count-complete-subarrays-in-an-array","difficulty":2,"accepted":171061,"submitted":225221,"acceptance":0.7595250886906638},{"id":2800,"title":"Shortest String That Contains Three Strings","slug":"shortest-string-that-contains-three-strings","difficulty":2,"accepted":19416,"submitted":61432,"acceptance":0.31605677822633155},{"id":2801,"title":"Count Stepping Numbers in Range","slug":"count-stepping-numbers-in-range","difficulty":3,"accepted":11001,"submitted":39207,"acceptance":0.2805876501645114},{"id":2802,"title":"Find The K-th Lucky Number","slug":"find-the-k-th-lucky-number","difficulty":2,"accepted":6324,"submitted":8309,"acceptance":0.7611024190636659},{"id":2803,"title":"Factorial Generator","slug":"factorial-generator","difficulty":1,"accepted":1615,"submitted":1890,"acceptance":0.8544973544973545},{"id":2804,"title":"Array Prototype ForEach","slug":"array-prototype-foreach","difficulty":1,"accepted":1568,"submitted":1747,"acceptance":0.8975386376645679},{"id":2805,"title":"Custom Interval","slug":"custom-interval","difficulty":2,"accepted":748,"submitted":883,"acceptance":0.8471121177802945},{"id":2806,"title":"Account Balance After Rounded Purchase","slug":"account-balance-after-rounded-purchase","difficulty":1,"accepted":62599,"submitted":111039,"acceptance":0.5637568782139608},{"id":2807,"title":"Insert Greatest Common Divisors in Linked List","slug":"insert-greatest-common-divisors-in-linked-list","difficulty":2,"accepted":294732,"submitted":322470,"acceptance":0.9139826960647502},{"id":2808,"title":"Minimum Seconds to Equalize a Circular Array","slug":"minimum-seconds-to-equalize-a-circular-array","difficulty":2,"accepted":18647,"submitted":65291,"acceptance":0.2855983213612902},{"id":2809,"title":"Minimum Time to Make Array Sum At Most x","slug":"minimum-time-to-make-array-sum-at-most-x","difficulty":3,"accepted":6581,"submitted":24137,"acceptance":0.27265194514645563},{"id":2810,"title":"Faulty Keyboard","slug":"faulty-keyboard","difficulty":1,"accepted":119230,"submitted":148807,"acceptance":0.8012391890166457},{"id":2811,"title":"Check if it is Possible to Split Array","slug":"check-if-it-is-possible-to-split-array","difficulty":2,"accepted":33561,"submitted":97357,"acceptance":0.3447209753792742},{"id":2812,"title":"Find the Safest Path in a Grid","slug":"find-the-safest-path-in-a-grid","difficulty":2,"accepted":113335,"submitted":232655,"acceptance":0.48713760718660676},{"id":2813,"title":"Maximum Elegance of a K-Length Subsequence","slug":"maximum-elegance-of-a-k-length-subsequence","difficulty":3,"accepted":8541,"submitted":29837,"acceptance":0.28625532057512487},{"id":2814,"title":"Minimum Time Takes to Reach Destination Without Drowning","slug":"minimum-time-takes-to-reach-destination-without-drowning","difficulty":3,"accepted":1579,"submitted":2887,"acceptance":0.546934534118462},{"id":2815,"title":"Max Pair Sum in an Array","slug":"max-pair-sum-in-an-array","difficulty":1,"accepted":60524,"submitted":99967,"acceptance":0.6054397951323937},{"id":2816,"title":"Double a Number Represented as a Linked List","slug":"double-a-number-represented-as-a-linked-list","difficulty":2,"accepted":201499,"submitted":329014,"acceptance":0.6124329055906436},{"id":2817,"title":"Minimum Absolute Difference Between Elements With Constraint","slug":"minimum-absolute-difference-between-elements-with-constraint","difficulty":2,"accepted":41288,"submitted":110255,"acceptance":0.3744773479660786},{"id":2818,"title":"Apply Operations to Maximize Score","slug":"apply-operations-to-maximize-score","difficulty":3,"accepted":76171,"submitted":142024,"acceptance":0.536324846504816},{"id":2819,"title":"Minimum Relative Loss After Buying Chocolates","slug":"minimum-relative-loss-after-buying-chocolates","difficulty":3,"accepted":700,"submitted":1501,"acceptance":0.46635576282478347},{"id":2820,"title":"Election Results","slug":"election-results","difficulty":2,"accepted":4312,"submitted":6485,"acceptance":0.6649190439475713},{"id":2821,"title":"Delay the Resolution of Each Promise","slug":"delay-the-resolution-of-each-promise","difficulty":2,"accepted":1090,"submitted":1456,"acceptance":0.7486263736263736},{"id":2822,"title":"Inversion of Object","slug":"inversion-of-object","difficulty":1,"accepted":1504,"submitted":2441,"acceptance":0.6161409258500614},{"id":2823,"title":"Deep Object Filter","slug":"deep-object-filter","difficulty":2,"accepted":743,"submitted":1310,"acceptance":0.567175572519084},{"id":2824,"title":"Count Pairs Whose Sum is Less than Target","slug":"count-pairs-whose-sum-is-less-than-target","difficulty":1,"accepted":264307,"submitted":301273,"acceptance":0.8773006542239099},{"id":2825,"title":"Make String a Subsequence Using Cyclic Increments","slug":"make-string-a-subsequence-using-cyclic-increments","difficulty":2,"accepted":163137,"submitted":248327,"acceptance":0.6569442710619465},{"id":2826,"title":"Sorting Three Groups","slug":"sorting-three-groups","difficulty":2,"accepted":26431,"submitted":61528,"acceptance":0.4295767780522689},{"id":2827,"title":"Number of Beautiful Integers in the Range","slug":"number-of-beautiful-integers-in-the-range","difficulty":3,"accepted":13672,"submitted":62349,"acceptance":0.21928178479205762},{"id":2828,"title":"Check if a String Is an Acronym of Words","slug":"check-if-a-string-is-an-acronym-of-words","difficulty":1,"accepted":128530,"submitted":154957,"acceptance":0.8294559135760243},{"id":2829,"title":"Determine the Minimum Sum of a k-avoiding Array","slug":"determine-the-minimum-sum-of-a-k-avoiding-array","difficulty":2,"accepted":40883,"submitted":67265,"acceptance":0.6077900839961347},{"id":2830,"title":"Maximize the Profit as the Salesman","slug":"maximize-the-profit-as-the-salesman","difficulty":2,"accepted":26999,"submitted":70717,"acceptance":0.3817893858619568},{"id":2831,"title":"Find the Longest Equal Subarray","slug":"find-the-longest-equal-subarray","difficulty":2,"accepted":30624,"submitted":80806,"acceptance":0.3789817587802886},{"id":2832,"title":"Maximal Range That Each Element Is Maximum in It","slug":"maximal-range-that-each-element-is-maximum-in-it","difficulty":2,"accepted":6400,"submitted":8479,"acceptance":0.7548059912725558},{"id":2833,"title":"Furthest Point From Origin","slug":"furthest-point-from-origin","difficulty":1,"accepted":62675,"submitted":95483,"acceptance":0.6563995685095776},{"id":2834,"title":"Find the Minimum Possible Sum of a Beautiful Array","slug":"find-the-minimum-possible-sum-of-a-beautiful-array","difficulty":2,"accepted":32911,"submitted":93797,"acceptance":0.35087476145292495},{"id":2835,"title":"Minimum Operations to Form Subsequence With Target Sum","slug":"minimum-operations-to-form-subsequence-with-target-sum","difficulty":3,"accepted":14261,"submitted":43974,"acceptance":0.3243052712966753},{"id":2836,"title":"Maximize Value of Function in a Ball Passing Game","slug":"maximize-value-of-function-in-a-ball-passing-game","difficulty":3,"accepted":6613,"submitted":21585,"acceptance":0.3063701644660644},{"id":2837,"title":"Total Traveled Distance","slug":"total-traveled-distance","difficulty":1,"accepted":5774,"submitted":7525,"acceptance":0.7673089700996678},{"id":2838,"title":"Maximum Coins Heroes Can Collect","slug":"maximum-coins-heroes-can-collect","difficulty":2,"accepted":7102,"submitted":10329,"acceptance":0.6875786620195566},{"id":2839,"title":"Check if Strings Can be Made Equal With Operations I","slug":"check-if-strings-can-be-made-equal-with-operations-i","difficulty":1,"accepted":145901,"submitted":235864,"acceptance":0.6185810467048808},{"id":2840,"title":"Check if Strings Can be Made Equal With Operations II","slug":"check-if-strings-can-be-made-equal-with-operations-ii","difficulty":2,"accepted":138245,"submitted":186909,"acceptance":0.7396380056605086},{"id":2841,"title":"Maximum Sum of Almost Unique Subarray","slug":"maximum-sum-of-almost-unique-subarray","difficulty":2,"accepted":35759,"submitted":87087,"acceptance":0.4106123761296175},{"id":2842,"title":"Count K-Subsequences of a String With Maximum Beauty","slug":"count-k-subsequences-of-a-string-with-maximum-beauty","difficulty":3,"accepted":14947,"submitted":49311,"acceptance":0.3031169515929509},{"id":2843,"title":"  Count Symmetric Integers","slug":"count-symmetric-integers","difficulty":1,"accepted":197315,"submitted":237572,"acceptance":0.8305482127523446},{"id":2844,"title":"Minimum Operations to Make a Special Number","slug":"minimum-operations-to-make-a-special-number","difficulty":2,"accepted":29710,"submitted":77165,"acceptance":0.3850191148836908},{"id":2845,"title":"Count of Interesting Subarrays","slug":"count-of-interesting-subarrays","difficulty":2,"accepted":92266,"submitted":159057,"acceptance":0.580081354482984},{"id":2846,"title":"Minimum Edge Weight Equilibrium Queries in a Tree","slug":"minimum-edge-weight-equilibrium-queries-in-a-tree","difficulty":3,"accepted":9622,"submitted":21059,"acceptance":0.45690678569732657},{"id":2847,"title":"Smallest Number With Given Digit Product","slug":"smallest-number-with-given-digit-product","difficulty":2,"accepted":1390,"submitted":3200,"acceptance":0.434375},{"id":2848,"title":"Points That Intersect With Cars","slug":"points-that-intersect-with-cars","difficulty":1,"accepted":75861,"submitted":103470,"acceptance":0.7331690345027544},{"id":2849,"title":"Determine if a Cell Is Reachable at a Given Time","slug":"determine-if-a-cell-is-reachable-at-a-given-time","difficulty":2,"accepted":110242,"submitted":296779,"acceptance":0.3714615926329019},{"id":2850,"title":"Minimum Moves to Spread Stones Over Grid","slug":"minimum-moves-to-spread-stones-over-grid","difficulty":2,"accepted":30085,"submitted":66050,"acceptance":0.4554882664647994},{"id":2851,"title":"String Transformation","slug":"string-transformation","difficulty":3,"accepted":6959,"submitted":25859,"acceptance":0.26911326810781544},{"id":2852,"title":"Sum of Remoteness of All Cells","slug":"sum-of-remoteness-of-all-cells","difficulty":2,"accepted":6528,"submitted":9216,"acceptance":0.7083333333333334},{"id":2853,"title":"Highest Salaries Difference","slug":"highest-salaries-difference","difficulty":1,"accepted":6050,"submitted":8258,"acceptance":0.7326229111164931},{"id":2854,"title":"Rolling Average Steps","slug":"rolling-average-steps","difficulty":2,"accepted":5428,"submitted":7851,"acceptance":0.6913768946631003},{"id":2855,"title":"Minimum Right Shifts to Sort the Array","slug":"minimum-right-shifts-to-sort-the-array","difficulty":1,"accepted":42782,"submitted":74584,"acceptance":0.5736082805963746},{"id":2856,"title":"Minimum Array Length After Pair Removals","slug":"minimum-array-length-after-pair-removals","difficulty":2,"accepted":32447,"submitted":118804,"acceptance":0.27311369987542505},{"id":2857,"title":"Count Pairs of Points With Distance k","slug":"count-pairs-of-points-with-distance-k","difficulty":2,"accepted":13544,"submitted":41206,"acceptance":0.32868999660243653},{"id":2858,"title":"Minimum Edge Reversals So Every Node Is Reachable","slug":"minimum-edge-reversals-so-every-node-is-reachable","difficulty":3,"accepted":21569,"submitted":36693,"acceptance":0.5878232905458807},{"id":2859,"title":"Sum of Values at Indices With K Set Bits","slug":"sum-of-values-at-indices-with-k-set-bits","difficulty":1,"accepted":97095,"submitted":112755,"acceptance":0.8611148064387388},{"id":2860,"title":"Happy Students","slug":"happy-students","difficulty":2,"accepted":25654,"submitted":50371,"acceptance":0.5093009866788429},{"id":2861,"title":"Maximum Number of Alloys","slug":"maximum-number-of-alloys","difficulty":2,"accepted":20147,"submitted":49483,"acceptance":0.40714993027908575},{"id":2862,"title":"Maximum Element-Sum of a Complete Subset of Indices","slug":"maximum-element-sum-of-a-complete-subset-of-indices","difficulty":3,"accepted":9552,"submitted":22315,"acceptance":0.42805287922921803},{"id":2863,"title":"Maximum Length of Semi-Decreasing Subarrays","slug":"maximum-length-of-semi-decreasing-subarrays","difficulty":2,"accepted":14407,"submitted":20565,"acceptance":0.700559202528568},{"id":2864,"title":"Maximum Odd Binary Number","slug":"maximum-odd-binary-number","difficulty":1,"accepted":233608,"submitted":281812,"acceptance":0.8289497963181128},{"id":2865,"title":"Beautiful Towers I","slug":"beautiful-towers-i","difficulty":2,"accepted":33991,"submitted":76462,"acceptance":0.4445476184248385},{"id":2866,"title":"Beautiful Towers II","slug":"beautiful-towers-ii","difficulty":2,"accepted":18397,"submitted":50630,"acceptance":0.36336164329448944},{"id":2867,"title":"Count Valid Paths in a Tree","slug":"count-valid-paths-in-a-tree","difficulty":3,"accepted":9717,"submitted":26957,"acceptance":0.3604629595281374},{"id":2868,"title":"The Wording Game","slug":"the-wording-game","difficulty":3,"accepted":779,"submitted":1385,"acceptance":0.5624548736462094},{"id":2869,"title":"Minimum Operations to Collect Elements","slug":"minimum-operations-to-collect-elements","difficulty":1,"accepted":50062,"submitted":80414,"acceptance":0.6225532867411148},{"id":2870,"title":"Minimum Number of Operations to Make Array Empty","slug":"minimum-number-of-operations-to-make-array-empty","difficulty":2,"accepted":198630,"submitted":319902,"acceptance":0.6209089033516515},{"id":2871,"title":"Split Array Into Maximum Number of Subarrays","slug":"split-array-into-maximum-number-of-subarrays","difficulty":2,"accepted":19485,"submitted":45953,"acceptance":0.42402019454660195},{"id":2872,"title":"Maximum Number of K-Divisible Components","slug":"maximum-number-of-k-divisible-components","difficulty":3,"accepted":145192,"submitted":196057,"acceptance":0.7405601432236544},{"id":2873,"title":"Maximum Value of an Ordered Triplet I","slug":"maximum-value-of-an-ordered-triplet-i","difficulty":1,"accepted":204762,"submitted":352081,"acceptance":0.5815763986128192},{"id":2874,"title":"Maximum Value of an Ordered Triplet II","slug":"maximum-value-of-an-ordered-triplet-ii","difficulty":2,"accepted":158803,"submitted":281543,"acceptance":0.5640452790515126},{"id":2875,"title":"Minimum Size Subarray in Infinite Array","slug":"minimum-size-subarray-in-infinite-array","difficulty":2,"accepted":25747,"submitted":80223,"acceptance":0.3209428717450108},{"id":2876,"title":"Count Visited Nodes in a Directed Graph","slug":"count-visited-nodes-in-a-directed-graph","difficulty":3,"accepted":14121,"submitted":46418,"acceptance":0.3042138825455642},{"id":2877,"title":"Create a DataFrame from List","slug":"create-a-dataframe-from-list","difficulty":1,"accepted":250671,"submitted":309366,"acceptance":0.8102732685556913},{"id":2878,"title":"Get the Size of a DataFrame","slug":"get-the-size-of-a-dataframe","difficulty":1,"accepted":195826,"submitted":230751,"acceptance":0.8486463763970687},{"id":2879,"title":"Display the First Three Rows","slug":"display-the-first-three-rows","difficulty":1,"accepted":209206,"submitted":224917,"acceptance":0.9301475655464015},{"id":2880,"title":"Select Data","slug":"select-data","difficulty":1,"accepted":165938,"submitted":211146,"acceptance":0.7858922262320859},{"id":2881,"title":"Create a New Column","slug":"create-a-new-column","difficulty":1,"accepted":155409,"submitted":172366,"acceptance":0.9016221296543402},{"id":2882,"title":"Drop Duplicate Rows","slug":"drop-duplicate-rows","difficulty":1,"accepted":139962,"submitted":164289,"acceptance":0.8519255701842485},{"id":2883,"title":"Drop Missing Data","slug":"drop-missing-data","difficulty":1,"accepted":130609,"submitted":202398,"acceptance":0.6453077599581023},{"id":2884,"title":"Modify Columns","slug":"modify-columns","difficulty":1,"accepted":144416,"submitted":156422,"acceptance":0.9232460907033537},{"id":2885,"title":"Rename Columns","slug":"rename-columns","difficulty":1,"accepted":123664,"submitted":144977,"acceptance":0.852990474351104},{"id":2886,"title":"Change Data Type","slug":"change-data-type","difficulty":1,"accepted":121725,"submitted":139322,"acceptance":0.8736954680524253},{"id":2887,"title":"Fill Missing Data","slug":"fill-missing-data","difficulty":1,"accepted":116193,"submitted":160344,"acceptance":0.7246482562490645},{"id":2888,"title":"Reshape Data: Concatenate","slug":"reshape-data-concatenate","difficulty":1,"accepted":122510,"submitted":135445,"acceptance":0.9044999815423235},{"id":2889,"title":"Reshape Data: Pivot","slug":"reshape-data-pivot","difficulty":1,"accepted":102868,"submitted":123793,"acceptance":0.8309678253213025},{"id":2890,"title":"Reshape Data: Melt","slug":"reshape-data-melt","difficulty":1,"accepted":97131,"submitted":113000,"acceptance":0.8595663716814159},{"id":2891,"title":"Method Chaining","slug":"method-chaining","difficulty":1,"accepted":100221,"submitted":131663,"acceptance":0.7611933496882192},{"id":2892,"title":"Minimizing Array After Replacing Pairs With Their Product","slug":"minimizing-array-after-replacing-pairs-with-their-product","difficulty":2,"accepted":1819,"submitted":4476,"acceptance":0.4063896336014298},{"id":2893,"title":"Calculate Orders Within Each Interval","slug":"calculate-orders-within-each-interval","difficulty":2,"accepted":4249,"submitted":6320,"acceptance":0.6723101265822785},{"id":2894,"title":"Divisible and Non-divisible Sums Difference","slug":"divisible-and-non-divisible-sums-difference","difficulty":1,"accepted":323557,"submitted":355386,"acceptance":0.9104382277298487},{"id":2895,"title":"Minimum Processing Time","slug":"minimum-processing-time","difficulty":2,"accepted":45120,"submitted":64215,"acceptance":0.7026395701938799},{"id":2896,"title":"Apply Operations to Make Two Strings Equal","slug":"apply-operations-to-make-two-strings-equal","difficulty":2,"accepted":15406,"submitted":55704,"acceptance":0.27656900761166164},{"id":2897,"title":"Apply Operations on Array to Maximize Sum of Squares","slug":"apply-operations-on-array-to-maximize-sum-of-squares","difficulty":3,"accepted":8558,"submitted":19215,"acceptance":0.44538121259432734},{"id":2898,"title":"Maximum Linear Stock Score","slug":"maximum-linear-stock-score","difficulty":2,"accepted":1355,"submitted":2198,"acceptance":0.6164695177434031},{"id":2899,"title":"Last Visited Integers","slug":"last-visited-integers","difficulty":1,"accepted":33213,"submitted":53426,"acceptance":0.621663609478531},{"id":2900,"title":"Longest Unequal Adjacent Groups Subsequence I","slug":"longest-unequal-adjacent-groups-subsequence-i","difficulty":1,"accepted":149178,"submitted":222682,"acceptance":0.669914945976774},{"id":2901,"title":"Longest Unequal Adjacent Groups Subsequence II","slug":"longest-unequal-adjacent-groups-subsequence-ii","difficulty":2,"accepted":83555,"submitted":162469,"acceptance":0.5142827247044052},{"id":2902,"title":"Count of Sub-Multisets With Bounded Sum","slug":"count-of-sub-multisets-with-bounded-sum","difficulty":3,"accepted":6067,"submitted":27241,"acceptance":0.2227157593333578},{"id":2903,"title":"Find Indices With Index and Value Difference I","slug":"find-indices-with-index-and-value-difference-i","difficulty":1,"accepted":54188,"submitted":89971,"acceptance":0.6022829578419713},{"id":2904,"title":"Shortest and Lexicographically Smallest Beautiful String","slug":"shortest-and-lexicographically-smallest-beautiful-string","difficulty":2,"accepted":33603,"submitted":81944,"acceptance":0.4100727325978717},{"id":2905,"title":"Find Indices With Index and Value Difference II","slug":"find-indices-with-index-and-value-difference-ii","difficulty":2,"accepted":23092,"submitted":70641,"acceptance":0.32689231466145724},{"id":2906,"title":"Construct Product Matrix","slug":"construct-product-matrix","difficulty":2,"accepted":103363,"submitted":199719,"acceptance":0.5175421467161362},{"id":2907,"title":"Maximum Profitable Triplets With Increasing Prices I","slug":"maximum-profitable-triplets-with-increasing-prices-i","difficulty":2,"accepted":1890,"submitted":3384,"acceptance":0.5585106382978723},{"id":2908,"title":"Minimum Sum of Mountain Triplets I","slug":"minimum-sum-of-mountain-triplets-i","difficulty":1,"accepted":48388,"submitted":71870,"acceptance":0.673271184082371},{"id":2909,"title":"Minimum Sum of Mountain Triplets II","slug":"minimum-sum-of-mountain-triplets-ii","difficulty":2,"accepted":32126,"submitted":58904,"acceptance":0.5453958984109738},{"id":2910,"title":"Minimum Number of Groups to Create a Valid Assignment","slug":"minimum-number-of-groups-to-create-a-valid-assignment","difficulty":2,"accepted":16480,"submitted":65642,"acceptance":0.25105877334633314},{"id":2911,"title":"Minimum Changes to Make K Semi-palindromes","slug":"minimum-changes-to-make-k-semi-palindromes","difficulty":3,"accepted":5206,"submitted":14404,"acceptance":0.36142738128297697},{"id":2912,"title":"Number of Ways to Reach Destination in the Grid","slug":"number-of-ways-to-reach-destination-in-the-grid","difficulty":3,"accepted":1181,"submitted":2027,"acceptance":0.5826344351258017},{"id":2913,"title":"Subarrays Distinct Element Sum of Squares I","slug":"subarrays-distinct-element-sum-of-squares-i","difficulty":1,"accepted":44526,"submitted":55594,"acceptance":0.8009137676727704},{"id":2914,"title":"Minimum Number of Changes to Make Binary String Beautiful","slug":"minimum-number-of-changes-to-make-binary-string-beautiful","difficulty":2,"accepted":164368,"submitted":215194,"acceptance":0.7638131174661004},{"id":2915,"title":"Length of the Longest Subsequence That Sums to Target","slug":"length-of-the-longest-subsequence-that-sums-to-target","difficulty":2,"accepted":37730,"submitted":95375,"acceptance":0.39559633027522934},{"id":2916,"title":"Subarrays Distinct Element Sum of Squares II","slug":"subarrays-distinct-element-sum-of-squares-ii","difficulty":3,"accepted":4667,"submitted":20320,"acceptance":0.2296751968503937},{"id":2917,"title":"Find the K-or of an Array","slug":"find-the-k-or-of-an-array","difficulty":1,"accepted":35350,"submitted":48595,"acceptance":0.7274410947628357},{"id":2918,"title":"Minimum Equal Sum of Two Arrays After Replacing Zeros","slug":"minimum-equal-sum-of-two-arrays-after-replacing-zeros","difficulty":2,"accepted":143977,"submitted":286871,"acceptance":0.5018876080189354},{"id":2919,"title":"Minimum Increment Operations to Make Array Beautiful","slug":"minimum-increment-operations-to-make-array-beautiful","difficulty":2,"accepted":17213,"submitted":49609,"acceptance":0.3469733314519543},{"id":2920,"title":"Maximum Points After Collecting Coins From All Nodes","slug":"maximum-points-after-collecting-coins-from-all-nodes","difficulty":3,"accepted":11128,"submitted":30526,"acceptance":0.36454170215553955},{"id":2921,"title":"Maximum Profitable Triplets With Increasing Prices II","slug":"maximum-profitable-triplets-with-increasing-prices-ii","difficulty":3,"accepted":776,"submitted":1688,"acceptance":0.4597156398104265},{"id":2922,"title":"Market Analysis III","slug":"market-analysis-iii","difficulty":2,"accepted":4096,"submitted":9751,"acceptance":0.4200594810788637},{"id":2923,"title":"Find Champion I","slug":"find-champion-i","difficulty":1,"accepted":53113,"submitted":72453,"acceptance":0.7330683339544256},{"id":2924,"title":"Find Champion II","slug":"find-champion-ii","difficulty":2,"accepted":135104,"submitted":192165,"acceptance":0.703062472354487},{"id":2925,"title":"Maximum Score After Applying Operations on a Tree","slug":"maximum-score-after-applying-operations-on-a-tree","difficulty":2,"accepted":17028,"submitted":36122,"acceptance":0.4714024694092243},{"id":2926,"title":"Maximum Balanced Subsequence Sum","slug":"maximum-balanced-subsequence-sum","difficulty":3,"accepted":9996,"submitted":38641,"acceptance":0.258688957325121},{"id":2927,"title":"Distribute Candies Among Children III","slug":"distribute-candies-among-children-iii","difficulty":3,"accepted":3024,"submitted":5280,"acceptance":0.5727272727272728},{"id":2928,"title":"Distribute Candies Among Children I","slug":"distribute-candies-among-children-i","difficulty":1,"accepted":42389,"submitted":55558,"acceptance":0.7629684293891069},{"id":2929,"title":"Distribute Candies Among Children II","slug":"distribute-candies-among-children-ii","difficulty":2,"accepted":105072,"submitted":188778,"acceptance":0.5565902806471092},{"id":2930,"title":"Number of Strings Which Can Be Rearranged to Contain Substring","slug":"number-of-strings-which-can-be-rearranged-to-contain-substring","difficulty":2,"accepted":8908,"submitted":15657,"acceptance":0.5689467969598263},{"id":2931,"title":"Maximum Spending After Buying Items","slug":"maximum-spending-after-buying-items","difficulty":3,"accepted":15780,"submitted":25811,"acceptance":0.6113672465228004},{"id":2932,"title":"Maximum Strong Pair XOR I","slug":"maximum-strong-pair-xor-i","difficulty":1,"accepted":58764,"submitted":77311,"acceptance":0.7600988216424571},{"id":2933,"title":"High-Access Employees","slug":"high-access-employees","difficulty":2,"accepted":33303,"submitted":70259,"acceptance":0.47400333053416643},{"id":2934,"title":"Minimum Operations to Maximize Last Elements in Arrays","slug":"minimum-operations-to-maximize-last-elements-in-arrays","difficulty":2,"accepted":15035,"submitted":34193,"acceptance":0.4397098821396192},{"id":2935,"title":"Maximum Strong Pair XOR II","slug":"maximum-strong-pair-xor-ii","difficulty":3,"accepted":8758,"submitted":27020,"acceptance":0.3241302738712065},{"id":2936,"title":"Number of Equal Numbers Blocks","slug":"number-of-equal-numbers-blocks","difficulty":2,"accepted":2430,"submitted":3883,"acceptance":0.6258047901107391},{"id":2937,"title":"Make Three Strings Equal","slug":"make-three-strings-equal","difficulty":1,"accepted":40195,"submitted":89757,"acceptance":0.44782022572055663},{"id":2938,"title":"Separate Black and White Balls","slug":"separate-black-and-white-balls","difficulty":2,"accepted":181383,"submitted":283717,"acceptance":0.6393095937148637},{"id":2939,"title":"Maximum Xor Product","slug":"maximum-xor-product","difficulty":2,"accepted":15596,"submitted":52562,"acceptance":0.29671625889425823},{"id":2940,"title":"Find Building Where Alice and Bob Can Meet","slug":"find-building-where-alice-and-bob-can-meet","difficulty":3,"accepted":76423,"submitted":146273,"acceptance":0.5224682614016257},{"id":2941,"title":"Maximum GCD-Sum of a Subarray","slug":"maximum-gcd-sum-of-a-subarray","difficulty":3,"accepted":684,"submitted":1781,"acceptance":0.3840539023020775},{"id":2942,"title":"Find Words Containing Character","slug":"find-words-containing-character","difficulty":1,"accepted":393543,"submitted":435372,"acceptance":0.9039235412474849},{"id":2943,"title":"Maximize Area of Square Hole in Grid","slug":"maximize-area-of-square-hole-in-grid","difficulty":2,"accepted":98436,"submitted":158999,"acceptance":0.6190982333222221},{"id":2944,"title":"Minimum Number of Coins for Fruits","slug":"minimum-number-of-coins-for-fruits","difficulty":2,"accepted":23956,"submitted":48895,"acceptance":0.4899478474281624},{"id":2945,"title":"Find Maximum Non-decreasing Array Length","slug":"find-maximum-non-decreasing-array-length","difficulty":3,"accepted":6688,"submitted":35743,"acceptance":0.18711356069719945},{"id":2946,"title":"Matrix Similarity After Cyclic Shifts","slug":"matrix-similarity-after-cyclic-shifts","difficulty":1,"accepted":128888,"submitted":173426,"acceptance":0.743187296022511},{"id":2947,"title":"Count Beautiful Substrings I","slug":"count-beautiful-substrings-i","difficulty":2,"accepted":28617,"submitted":46823,"acceptance":0.6111739956858808},{"id":2948,"title":"Make Lexicographically Smallest Array by Swapping Elements","slug":"make-lexicographically-smallest-array-by-swapping-elements","difficulty":2,"accepted":101780,"submitted":168976,"acceptance":0.6023340592746899},{"id":2949,"title":"Count Beautiful Substrings II","slug":"count-beautiful-substrings-ii","difficulty":3,"accepted":8140,"submitted":29862,"acceptance":0.2725872346125511},{"id":2950,"title":"Number of Divisible Substrings","slug":"number-of-divisible-substrings","difficulty":2,"accepted":3668,"submitted":4913,"acceptance":0.7465906777936088},{"id":2951,"title":"Find the Peaks","slug":"find-the-peaks","difficulty":1,"accepted":80284,"submitted":106898,"acceptance":0.7510336956725102},{"id":2952,"title":"Minimum Number of Coins to be Added","slug":"minimum-number-of-coins-to-be-added","difficulty":2,"accepted":26996,"submitted":46503,"acceptance":0.5805216867728964},{"id":2953,"title":"Count Complete Substrings","slug":"count-complete-substrings","difficulty":3,"accepted":11138,"submitted":36841,"acceptance":0.30232621264352216},{"id":2954,"title":"Count the Number of Infection Sequences","slug":"count-the-number-of-infection-sequences","difficulty":3,"accepted":6188,"submitted":16695,"acceptance":0.3706498951781971},{"id":2955,"title":"Number of Same-End Substrings","slug":"number-of-same-end-substrings","difficulty":2,"accepted":8970,"submitted":14553,"acceptance":0.6163677592249021},{"id":2956,"title":"Find Common Elements Between Two Arrays","slug":"find-common-elements-between-two-arrays","difficulty":1,"accepted":105853,"submitted":125357,"acceptance":0.8444123583046819},{"id":2957,"title":"Remove Adjacent Almost-Equal Characters","slug":"remove-adjacent-almost-equal-characters","difficulty":2,"accepted":30425,"submitted":56761,"acceptance":0.5360194499744543},{"id":2958,"title":"Length of Longest Subarray With at Most K Frequency","slug":"length-of-longest-subarray-with-at-most-k-frequency","difficulty":2,"accepted":191657,"submitted":339168,"acceptance":0.5650798424379658},{"id":2959,"title":"Number of Possible Sets of Closing Branches","slug":"number-of-possible-sets-of-closing-branches","difficulty":3,"accepted":10858,"submitted":21383,"acceptance":0.5077865594163588},{"id":2960,"title":"Count Tested Devices After Test Operations","slug":"count-tested-devices-after-test-operations","difficulty":1,"accepted":55402,"submitted":70297,"acceptance":0.7881132907520947},{"id":2961,"title":"Double Modular Exponentiation","slug":"double-modular-exponentiation","difficulty":2,"accepted":25569,"submitted":53298,"acceptance":0.4797365754812563},{"id":2962,"title":"Count Subarrays Where Max Element Appears at Least K Times","slug":"count-subarrays-where-max-element-appears-at-least-k-times","difficulty":2,"accepted":259074,"submitted":415243,"acceptance":0.6239093735475372},{"id":2963,"title":"Count the Number of Good Partitions","slug":"count-the-number-of-good-partitions","difficulty":3,"accepted":15727,"submitted":31980,"acceptance":0.491776110068793},{"id":2964,"title":"Number of Divisible Triplet Sums","slug":"number-of-divisible-triplet-sums","difficulty":2,"accepted":9449,"submitted":13999,"acceptance":0.674976784056004},{"id":2965,"title":"Find Missing and Repeated Values","slug":"find-missing-and-repeated-values","difficulty":1,"accepted":334104,"submitted":401529,"acceptance":0.8320793765830115},{"id":2966,"title":"Divide Array Into Arrays With Max Difference","slug":"divide-array-into-arrays-with-max-difference","difficulty":2,"accepted":282257,"submitted":357352,"acceptance":0.7898570597058363},{"id":2967,"title":"Minimum Cost to Make Array Equalindromic","slug":"minimum-cost-to-make-array-equalindromic","difficulty":2,"accepted":16371,"submitted":69878,"acceptance":0.23427974469790205},{"id":2968,"title":"Apply Operations to Maximize Frequency Score","slug":"apply-operations-to-maximize-frequency-score","difficulty":3,"accepted":10110,"submitted":26089,"acceptance":0.3875196442945303},{"id":2969,"title":"Minimum Number of Coins for Fruits II","slug":"minimum-number-of-coins-for-fruits-ii","difficulty":3,"accepted":983,"submitted":2076,"acceptance":0.4735067437379576},{"id":2970,"title":"Count the Number of Incremovable Subarrays I","slug":"count-the-number-of-incremovable-subarrays-i","difficulty":1,"accepted":29949,"submitted":53144,"acceptance":0.5635443323799488},{"id":2971,"title":"Find Polygon With the Largest Perimeter","slug":"find-polygon-with-the-largest-perimeter","difficulty":2,"accepted":145700,"submitted":222398,"acceptance":0.655131790753514},{"id":2972,"title":"Count the Number of Incremovable Subarrays II","slug":"count-the-number-of-incremovable-subarrays-ii","difficulty":3,"accepted":11268,"submitted":28071,"acceptance":0.40141070856043604},{"id":2973,"title":"Find Number of Coins to Place in Tree Nodes","slug":"find-number-of-coins-to-place-in-tree-nodes","difficulty":3,"accepted":11275,"submitted":30159,"acceptance":0.373851918167048},{"id":2974,"title":"Minimum Number Game","slug":"minimum-number-game","difficulty":1,"accepted":151221,"submitted":177008,"acceptance":0.8543173189912321},{"id":2975,"title":"Maximum Square Area by Removing Fences From a Field","slug":"maximum-square-area-by-removing-fences-from-a-field","difficulty":2,"accepted":97703,"submitted":197600,"acceptance":0.4944483805668016},{"id":2976,"title":"Minimum Cost to Convert String I","slug":"minimum-cost-to-convert-string-i","difficulty":2,"accepted":193761,"submitted":306622,"acceptance":0.6319213885500714},{"id":2977,"title":"Minimum Cost to Convert String II","slug":"minimum-cost-to-convert-string-ii","difficulty":3,"accepted":64514,"submitted":108155,"acceptance":0.5964957699597799},{"id":2978,"title":"Symmetric Coordinates","slug":"symmetric-coordinates","difficulty":2,"accepted":3092,"submitted":7575,"acceptance":0.4081848184818482},{"id":2979,"title":"Most Expensive Item That Can Not Be Bought","slug":"most-expensive-item-that-can-not-be-bought","difficulty":2,"accepted":6446,"submitted":8019,"acceptance":0.803840877914952},{"id":2980,"title":"Check if Bitwise OR Has Trailing Zeros","slug":"check-if-bitwise-or-has-trailing-zeros","difficulty":1,"accepted":49837,"submitted":69986,"acceptance":0.7120995627696968},{"id":2981,"title":"Find Longest Special Substring That Occurs Thrice I","slug":"find-longest-special-substring-that-occurs-thrice-i","difficulty":2,"accepted":131683,"submitted":212965,"acceptance":0.618331650740732},{"id":2982,"title":"Find Longest Special Substring That Occurs Thrice II","slug":"find-longest-special-substring-that-occurs-thrice-ii","difficulty":2,"accepted":31845,"submitted":81312,"acceptance":0.39163961038961037},{"id":2983,"title":"Palindrome Rearrangement Queries","slug":"palindrome-rearrangement-queries","difficulty":3,"accepted":4364,"submitted":17510,"acceptance":0.24922901199314676},{"id":2984,"title":"Find Peak Calling Hours for Each City","slug":"find-peak-calling-hours-for-each-city","difficulty":2,"accepted":3987,"submitted":6468,"acceptance":0.6164192949907236},{"id":2985,"title":"Calculate Compressed Mean","slug":"calculate-compressed-mean","difficulty":1,"accepted":5698,"submitted":6607,"acceptance":0.8624186468896625},{"id":2986,"title":"Find Third Transaction","slug":"find-third-transaction","difficulty":2,"accepted":4392,"submitted":8157,"acceptance":0.5384332475174697},{"id":2987,"title":"Find Expensive Cities","slug":"find-expensive-cities","difficulty":1,"accepted":5843,"submitted":7590,"acceptance":0.7698287220026351},{"id":2988,"title":"Manager of the Largest Department","slug":"manager-of-the-largest-department","difficulty":2,"accepted":4615,"submitted":5702,"acceptance":0.8093651350403367},{"id":2989,"title":"Class Performance","slug":"class-performance","difficulty":2,"accepted":5907,"submitted":6653,"acceptance":0.8878701337742372},{"id":2990,"title":"Loan Types","slug":"loan-types","difficulty":1,"accepted":6170,"submitted":9643,"acceptance":0.6398423727055895},{"id":2991,"title":"Top Three Wineries ","slug":"top-three-wineries","difficulty":3,"accepted":3628,"submitted":6731,"acceptance":0.5389986629029861},{"id":2992,"title":"Number of Self-Divisible Permutations","slug":"number-of-self-divisible-permutations","difficulty":2,"accepted":2227,"submitted":3098,"acceptance":0.7188508715300194},{"id":2993,"title":"Friday Purchases I","slug":"friday-purchases-i","difficulty":2,"accepted":4163,"submitted":5168,"acceptance":0.8055340557275542},{"id":2994,"title":"Friday Purchases II ","slug":"friday-purchases-ii","difficulty":3,"accepted":2635,"submitted":3550,"acceptance":0.7422535211267606},{"id":2995,"title":"Viewers Turned Streamers","slug":"viewers-turned-streamers","difficulty":3,"accepted":4336,"submitted":10140,"acceptance":0.42761341222879684},{"id":2996,"title":"Smallest Missing Integer Greater Than Sequential Prefix Sum","slug":"smallest-missing-integer-greater-than-sequential-prefix-sum","difficulty":1,"accepted":50610,"submitted":143302,"acceptance":0.35317022791028735},{"id":2997,"title":"Minimum Number of Operations to Make Array XOR Equal to K","slug":"minimum-number-of-operations-to-make-array-xor-equal-to-k","difficulty":2,"accepted":123844,"submitted":144920,"acceptance":0.854568037537952},{"id":2998,"title":"Minimum Number of Operations to Make X and Y Equal","slug":"minimum-number-of-operations-to-make-x-and-y-equal","difficulty":2,"accepted":28344,"submitted":58358,"acceptance":0.48569176462524416},{"id":2999,"title":"Count the Number of Powerful Integers","slug":"count-the-number-of-powerful-integers","difficulty":3,"accepted":77775,"submitted":168109,"acceptance":0.4626462592722579},{"id":3000,"title":"Maximum Area of Longest Diagonal Rectangle","slug":"maximum-area-of-longest-diagonal-rectangle","difficulty":1,"accepted":186314,"submitted":406033,"acceptance":0.4588641809902151},{"id":3001,"title":"Minimum Moves to Capture The Queen","slug":"minimum-moves-to-capture-the-queen","difficulty":2,"accepted":22794,"submitted":102033,"acceptance":0.223398312310723},{"id":3002,"title":"Maximum Size of a Set After Removals","slug":"maximum-size-of-a-set-after-removals","difficulty":2,"accepted":20415,"submitted":44201,"acceptance":0.4618673785660958},{"id":3003,"title":"Maximize the Number of Partitions After Operations","slug":"maximize-the-number-of-partitions-after-operations","difficulty":3,"accepted":54865,"submitted":102611,"acceptance":0.5346892633343404},{"id":3004,"title":"Maximum Subtree of the Same Color","slug":"maximum-subtree-of-the-same-color","difficulty":2,"accepted":2447,"submitted":4169,"acceptance":0.58695130726793},{"id":3005,"title":"Count Elements With Maximum Frequency","slug":"count-elements-with-maximum-frequency","difficulty":1,"accepted":421090,"submitted":527390,"acceptance":0.798441381141091},{"id":3006,"title":"Find Beautiful Indices in the Given Array I","slug":"find-beautiful-indices-in-the-given-array-i","difficulty":2,"accepted":47750,"submitted":117364,"acceptance":0.40685389046044784},{"id":3007,"title":"Maximum Number That Sum of the Prices Is Less Than or Equal to K","slug":"maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k","difficulty":2,"accepted":13008,"submitted":33744,"acceptance":0.38549075391180654},{"id":3008,"title":"Find Beautiful Indices in the Given Array II","slug":"find-beautiful-indices-in-the-given-array-ii","difficulty":3,"accepted":17369,"submitted":62693,"acceptance":0.2770484743113266},{"id":3009,"title":"Maximum Number of Intersections on the Chart","slug":"maximum-number-of-intersections-on-the-chart","difficulty":3,"accepted":4375,"submitted":9698,"acceptance":0.45112394308104764},{"id":3010,"title":"Divide an Array Into Subarrays With Minimum Cost I","slug":"divide-an-array-into-subarrays-with-minimum-cost-i","difficulty":1,"accepted":184853,"submitted":229526,"acceptance":0.8053684549898487},{"id":3011,"title":"Find if Array Can Be Sorted","slug":"find-if-array-can-be-sorted","difficulty":2,"accepted":150224,"submitted":226191,"acceptance":0.6641466725024426},{"id":3012,"title":"Minimize Length of Array Using Operations","slug":"minimize-length-of-array-using-operations","difficulty":2,"accepted":17550,"submitted":49131,"acceptance":0.35720827990474446},{"id":3013,"title":"Divide an Array Into Subarrays With Minimum Cost II","slug":"divide-an-array-into-subarrays-with-minimum-cost-ii","difficulty":3,"accepted":73483,"submitted":134286,"acceptance":0.547212665504967},{"id":3014,"title":"Minimum Number of Pushes to Type Word I","slug":"minimum-number-of-pushes-to-type-word-i","difficulty":1,"accepted":51392,"submitted":76671,"acceptance":0.670292548682031},{"id":3015,"title":"Count the Number of Houses at a Certain Distance I","slug":"count-the-number-of-houses-at-a-certain-distance-i","difficulty":2,"accepted":27276,"submitted":47420,"acceptance":0.5752003374103754},{"id":3016,"title":"Minimum Number of Pushes to Type Word II","slug":"minimum-number-of-pushes-to-type-word-ii","difficulty":2,"accepted":186939,"submitted":233776,"acceptance":0.7996500923961399},{"id":3017,"title":"Count the Number of Houses at a Certain Distance II","slug":"count-the-number-of-houses-at-a-certain-distance-ii","difficulty":3,"accepted":4374,"submitted":18507,"acceptance":0.23634300534932728},{"id":3018,"title":"Maximum Number of Removal Queries That Can Be Processed I","slug":"maximum-number-of-removal-queries-that-can-be-processed-i","difficulty":3,"accepted":661,"submitted":1481,"acceptance":0.4463200540175557},{"id":3019,"title":"Number of Changing Keys","slug":"number-of-changing-keys","difficulty":1,"accepted":83170,"submitted":103181,"acceptance":0.8060592550954149},{"id":3020,"title":"Find the Maximum Number of Elements in Subset","slug":"find-the-maximum-number-of-elements-in-subset","difficulty":2,"accepted":28791,"submitted":107142,"acceptance":0.268718149745198},{"id":3021,"title":"Alice and Bob Playing Flower Game","slug":"alice-and-bob-playing-flower-game","difficulty":2,"accepted":127759,"submitted":212807,"acceptance":0.6003514921971552},{"id":3022,"title":"Minimize OR of Remaining Elements Using Operations","slug":"minimize-or-of-remaining-elements-using-operations","difficulty":3,"accepted":4363,"submitted":14440,"acceptance":0.30214681440443214},{"id":3023,"title":"Find Pattern in Infinite Stream I","slug":"find-pattern-in-infinite-stream-i","difficulty":2,"accepted":1942,"submitted":3408,"acceptance":0.5698356807511737},{"id":3024,"title":"Type of Triangle","slug":"type-of-triangle","difficulty":1,"accepted":217019,"submitted":492545,"acceptance":0.440607457186653},{"id":3025,"title":"Find the Number of Ways to Place People I","slug":"find-the-number-of-ways-to-place-people-i","difficulty":2,"accepted":115713,"submitted":180759,"acceptance":0.6401506978905614},{"id":3026,"title":"Maximum Good Subarray Sum","slug":"maximum-good-subarray-sum","difficulty":2,"accepted":31901,"submitted":147814,"acceptance":0.2158185286914636},{"id":3027,"title":"Find the Number of Ways to Place People II","slug":"find-the-number-of-ways-to-place-people-ii","difficulty":3,"accepted":88409,"submitted":137246,"acceptance":0.6441644929542574},{"id":3028,"title":"Ant on the Boundary","slug":"ant-on-the-boundary","difficulty":1,"accepted":75058,"submitted":100990,"acceptance":0.7432221011981385},{"id":3029,"title":"Minimum Time to Revert Word to Initial State I","slug":"minimum-time-to-revert-word-to-initial-state-i","difficulty":2,"accepted":24012,"submitted":56616,"acceptance":0.4241203899957609},{"id":3030,"title":"Find the Grid of Region Average","slug":"find-the-grid-of-region-average","difficulty":2,"accepted":12077,"submitted":27849,"acceptance":0.43366009551509926},{"id":3031,"title":"Minimum Time to Revert Word to Initial State II","slug":"minimum-time-to-revert-word-to-initial-state-ii","difficulty":3,"accepted":13559,"submitted":38598,"acceptance":0.35128763148349657},{"id":3032,"title":"Count Numbers With Unique Digits II","slug":"count-numbers-with-unique-digits-ii","difficulty":1,"accepted":8429,"submitted":9679,"acceptance":0.8708544271102386},{"id":3033,"title":"Modify the Matrix","slug":"modify-the-matrix","difficulty":1,"accepted":57824,"submitted":83743,"acceptance":0.6904935337878987},{"id":3034,"title":"Number of Subarrays That Match a Pattern I","slug":"number-of-subarrays-that-match-a-pattern-i","difficulty":2,"accepted":35929,"submitted":52448,"acceptance":0.6850404209884076},{"id":3035,"title":"Maximum Palindromes After Operations","slug":"maximum-palindromes-after-operations","difficulty":2,"accepted":21738,"submitted":47135,"acceptance":0.4611859552349634},{"id":3036,"title":"Number of Subarrays That Match a Pattern II","slug":"number-of-subarrays-that-match-a-pattern-ii","difficulty":3,"accepted":14116,"submitted":42117,"acceptance":0.335161573711328},{"id":3037,"title":"Find Pattern in Infinite Stream II","slug":"find-pattern-in-infinite-stream-ii","difficulty":3,"accepted":1386,"submitted":2056,"acceptance":0.6741245136186771},{"id":3038,"title":"Maximum Number of Operations With the Same Score I","slug":"maximum-number-of-operations-with-the-same-score-i","difficulty":1,"accepted":41592,"submitted":78890,"acceptance":0.527215109646343},{"id":3039,"title":"Apply Operations to Make String Empty","slug":"apply-operations-to-make-string-empty","difficulty":2,"accepted":32558,"submitted":56610,"acceptance":0.5751280692457164},{"id":3040,"title":"Maximum Number of Operations With the Same Score II","slug":"maximum-number-of-operations-with-the-same-score-ii","difficulty":2,"accepted":25434,"submitted":74473,"acceptance":0.3415197454110886},{"id":3041,"title":"Maximize Consecutive Elements in an Array After Modification","slug":"maximize-consecutive-elements-in-an-array-after-modification","difficulty":3,"accepted":11316,"submitted":33590,"acceptance":0.3368859779696338},{"id":3042,"title":"Count Prefix and Suffix Pairs I","slug":"count-prefix-and-suffix-pairs-i","difficulty":1,"accepted":213321,"submitted":274359,"acceptance":0.7775250675210217},{"id":3043,"title":"Find the Length of the Longest Common Prefix","slug":"find-the-length-of-the-longest-common-prefix","difficulty":2,"accepted":176646,"submitted":309633,"acceptance":0.5705012062667739},{"id":3044,"title":"Most Frequent Prime","slug":"most-frequent-prime","difficulty":2,"accepted":18848,"submitted":41080,"acceptance":0.4588120740019474},{"id":3045,"title":"Count Prefix and Suffix Pairs II","slug":"count-prefix-and-suffix-pairs-ii","difficulty":3,"accepted":16832,"submitted":59759,"acceptance":0.2816646864907378},{"id":3046,"title":"Split the Array","slug":"split-the-array","difficulty":1,"accepted":82748,"submitted":135428,"acceptance":0.6110110169241221},{"id":3047,"title":"Find the Largest Area of Square Inside Two Rectangles","slug":"find-the-largest-area-of-square-inside-two-rectangles","difficulty":2,"accepted":100512,"submitted":150236,"acceptance":0.669027396895551},{"id":3048,"title":"Earliest Second to Mark Indices I","slug":"earliest-second-to-mark-indices-i","difficulty":2,"accepted":11267,"submitted":30664,"acceptance":0.3674341247064962},{"id":3049,"title":"Earliest Second to Mark Indices II","slug":"earliest-second-to-mark-indices-ii","difficulty":3,"accepted":4001,"submitted":17748,"acceptance":0.22543385170160019},{"id":3050,"title":"Pizza Toppings Cost Analysis","slug":"pizza-toppings-cost-analysis","difficulty":2,"accepted":3776,"submitted":5484,"acceptance":0.6885485047410649},{"id":3051,"title":"Find Candidates for Data Scientist Position","slug":"find-candidates-for-data-scientist-position","difficulty":1,"accepted":5542,"submitted":7387,"acceptance":0.7502369026668472},{"id":3052,"title":"Maximize Items","slug":"maximize-items","difficulty":3,"accepted":2054,"submitted":2760,"acceptance":0.7442028985507246},{"id":3053,"title":"Classifying Triangles by Lengths","slug":"classifying-triangles-by-lengths","difficulty":1,"accepted":3952,"submitted":7713,"acceptance":0.5123816932451705},{"id":3054,"title":"Binary Tree Nodes","slug":"binary-tree-nodes","difficulty":2,"accepted":3870,"submitted":4912,"acceptance":0.7878664495114006},{"id":3055,"title":"Top Percentile Fraud","slug":"top-percentile-fraud","difficulty":2,"accepted":3301,"submitted":5714,"acceptance":0.5777038851942597},{"id":3056,"title":"Snaps Analysis","slug":"snaps-analysis","difficulty":2,"accepted":3486,"submitted":5934,"acceptance":0.5874620829120324},{"id":3057,"title":"Employees Project Allocation","slug":"employees-project-allocation","difficulty":3,"accepted":2468,"submitted":3658,"acceptance":0.6746856205576818},{"id":3058,"title":"Friends With No Mutual Friends","slug":"friends-with-no-mutual-friends","difficulty":2,"accepted":3061,"submitted":6284,"acceptance":0.4871101209420751},{"id":3059,"title":"Find All Unique Email Domains","slug":"find-all-unique-email-domains","difficulty":1,"accepted":4264,"submitted":6091,"acceptance":0.7000492529962239},{"id":3060,"title":"User Activities within Time Bounds","slug":"user-activities-within-time-bounds","difficulty":3,"accepted":2400,"submitted":5795,"acceptance":0.4141501294219154},{"id":3061,"title":"Calculate Trapping Rain Water","slug":"calculate-trapping-rain-water","difficulty":3,"accepted":1709,"submitted":2084,"acceptance":0.8200575815738963},{"id":3062,"title":"Winner of the Linked List Game","slug":"winner-of-the-linked-list-game","difficulty":1,"accepted":11990,"submitted":15452,"acceptance":0.7759513331607559},{"id":3063,"title":"Linked List Frequency","slug":"linked-list-frequency","difficulty":1,"accepted":14996,"submitted":17557,"acceptance":0.8541322549410492},{"id":3064,"title":"Guess the Number Using Bitwise Questions I","slug":"guess-the-number-using-bitwise-questions-i","difficulty":2,"accepted":2328,"submitted":2616,"acceptance":0.8899082568807339},{"id":3065,"title":"Minimum Operations to Exceed Threshold Value I","slug":"minimum-operations-to-exceed-threshold-value-i","difficulty":1,"accepted":104683,"submitted":120751,"acceptance":0.8669327790246043},{"id":3066,"title":"Minimum Operations to Exceed Threshold Value II","slug":"minimum-operations-to-exceed-threshold-value-ii","difficulty":2,"accepted":190111,"submitted":414850,"acceptance":0.4582644329275642},{"id":3067,"title":"Count Pairs of Connectable Servers in a Weighted Tree Network","slug":"count-pairs-of-connectable-servers-in-a-weighted-tree-network","difficulty":2,"accepted":16542,"submitted":29638,"acceptance":0.5581348269113975},{"id":3068,"title":"Find the Maximum Sum of Node Values","slug":"find-the-maximum-sum-of-node-values","difficulty":3,"accepted":138597,"submitted":199521,"acceptance":0.6946486835972153},{"id":3069,"title":"Distribute Elements Into Two Arrays I","slug":"distribute-elements-into-two-arrays-i","difficulty":1,"accepted":59075,"submitted":79947,"acceptance":0.7389270391634458},{"id":3070,"title":"Count Submatrices with Top-Left Element and Sum Less Than k","slug":"count-submatrices-with-top-left-element-and-sum-less-than-k","difficulty":2,"accepted":120752,"submitted":161449,"acceptance":0.7479265898209342},{"id":3071,"title":"Minimum Operations to Write the Letter Y on a Grid","slug":"minimum-operations-to-write-the-letter-y-on-a-grid","difficulty":2,"accepted":36484,"submitted":56604,"acceptance":0.6445480884743128},{"id":3072,"title":"Distribute Elements Into Two Arrays II","slug":"distribute-elements-into-two-arrays-ii","difficulty":3,"accepted":14120,"submitted":46283,"acceptance":0.30507961886653845},{"id":3073,"title":"Maximum Increasing Triplet Value","slug":"maximum-increasing-triplet-value","difficulty":2,"accepted":1377,"submitted":3844,"acceptance":0.3582206035379813},{"id":3074,"title":"Apple Redistribution into Boxes","slug":"apple-redistribution-into-boxes","difficulty":1,"accepted":167248,"submitted":213142,"acceptance":0.7846787587617644},{"id":3075,"title":"Maximize Happiness of Selected Children","slug":"maximize-happiness-of-selected-children","difficulty":2,"accepted":287285,"submitted":489551,"acceptance":0.5868336496095402},{"id":3076,"title":"Shortest Uncommon Substring in an Array","slug":"shortest-uncommon-substring-in-an-array","difficulty":2,"accepted":36126,"submitted":71836,"acceptance":0.5028954841583607},{"id":3077,"title":"Maximum Strength of K Disjoint Subarrays","slug":"maximum-strength-of-k-disjoint-subarrays","difficulty":3,"accepted":8598,"submitted":31081,"acceptance":0.27663202599658954},{"id":3078,"title":"Match Alphanumerical Pattern in Matrix I","slug":"match-alphanumerical-pattern-in-matrix-i","difficulty":2,"accepted":1302,"submitted":2022,"acceptance":0.6439169139465876},{"id":3079,"title":"Find the Sum of Encrypted Integers","slug":"find-the-sum-of-encrypted-integers","difficulty":1,"accepted":62579,"submitted":83644,"acceptance":0.7481588637559179},{"id":3080,"title":"Mark Elements on Array by Performing Queries","slug":"mark-elements-on-array-by-performing-queries","difficulty":2,"accepted":22515,"submitted":45735,"acceptance":0.4922925549360446},{"id":3081,"title":"Replace Question Marks in String to Minimize Its Value","slug":"replace-question-marks-in-string-to-minimize-its-value","difficulty":2,"accepted":17789,"submitted":61276,"acceptance":0.2903094196749135},{"id":3082,"title":"Find the Sum of the Power of All Subsequences","slug":"find-the-sum-of-the-power-of-all-subsequences","difficulty":3,"accepted":9972,"submitted":26125,"acceptance":0.38170334928229666},{"id":3083,"title":"Existence of a Substring in a String and Its Reverse","slug":"existence-of-a-substring-in-a-string-and-its-reverse","difficulty":1,"accepted":56511,"submitted":85042,"acceptance":0.6645069495073023},{"id":3084,"title":"Count Substrings Starting and Ending with Given Character","slug":"count-substrings-starting-and-ending-with-given-character","difficulty":2,"accepted":46186,"submitted":92437,"acceptance":0.4996484091867975},{"id":3085,"title":"Minimum Deletions to Make String K-Special","slug":"minimum-deletions-to-make-string-k-special","difficulty":2,"accepted":110669,"submitted":164790,"acceptance":0.6715759451423023},{"id":3086,"title":"Minimum Moves to Pick K Ones","slug":"minimum-moves-to-pick-k-ones","difficulty":3,"accepted":4273,"submitted":19958,"acceptance":0.21409960917927648},{"id":3087,"title":"Find Trending Hashtags","slug":"find-trending-hashtags","difficulty":2,"accepted":2773,"submitted":4526,"acceptance":0.6126822801590809},{"id":3088,"title":"Make String Anti-palindrome","slug":"make-string-anti-palindrome","difficulty":3,"accepted":950,"submitted":2063,"acceptance":0.46049442559379544},{"id":3089,"title":"Find Bursty Behavior","slug":"find-bursty-behavior","difficulty":2,"accepted":2455,"submitted":6486,"acceptance":0.3785075547332717},{"id":3090,"title":"Maximum Length Substring With Two Occurrences","slug":"maximum-length-substring-with-two-occurrences","difficulty":1,"accepted":63782,"submitted":97601,"acceptance":0.6534974026905462},{"id":3091,"title":"Apply Operations to Make Sum of Array Greater Than or Equal to k","slug":"apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k","difficulty":2,"accepted":32543,"submitted":73518,"acceptance":0.44265349982317254},{"id":3092,"title":"Most Frequent IDs","slug":"most-frequent-ids","difficulty":2,"accepted":24970,"submitted":58595,"acceptance":0.4261455755610547},{"id":3093,"title":"Longest Common Suffix Queries","slug":"longest-common-suffix-queries","difficulty":3,"accepted":14324,"submitted":40058,"acceptance":0.3575815068151181},{"id":3094,"title":"Guess the Number Using Bitwise Questions II","slug":"guess-the-number-using-bitwise-questions-ii","difficulty":2,"accepted":1069,"submitted":1286,"acceptance":0.8312597200622084},{"id":3095,"title":"Shortest Subarray With OR at Least K I","slug":"shortest-subarray-with-or-at-least-k-i","difficulty":1,"accepted":39363,"submitted":88719,"acceptance":0.4436817367193048},{"id":3096,"title":"Minimum Levels to Gain More Points","slug":"minimum-levels-to-gain-more-points","difficulty":2,"accepted":27524,"submitted":68382,"acceptance":0.40250358281419085},{"id":3097,"title":"Shortest Subarray With OR at Least K II","slug":"shortest-subarray-with-or-at-least-k-ii","difficulty":2,"accepted":99458,"submitted":198057,"acceptance":0.5021685676345699},{"id":3098,"title":"Find the Sum of Subsequence Powers","slug":"find-the-sum-of-subsequence-powers","difficulty":3,"accepted":7101,"submitted":28328,"acceptance":0.25067071448743294},{"id":3099,"title":"Harshad Number","slug":"harshad-number","difficulty":1,"accepted":110433,"submitted":132587,"acceptance":0.8329097121135556},{"id":3100,"title":"Water Bottles II","slug":"water-bottles-ii","difficulty":2,"accepted":168321,"submitted":215380,"acceptance":0.7815071037236512},{"id":3101,"title":"Count Alternating Subarrays","slug":"count-alternating-subarrays","difficulty":2,"accepted":45245,"submitted":78857,"acceptance":0.5737600973914808},{"id":3102,"title":"Minimize Manhattan Distances","slug":"minimize-manhattan-distances","difficulty":3,"accepted":10696,"submitted":32560,"acceptance":0.3285012285012285},{"id":3103,"title":"Find Trending Hashtags II ","slug":"find-trending-hashtags-ii","difficulty":3,"accepted":1608,"submitted":2415,"acceptance":0.6658385093167701},{"id":3104,"title":"Find Longest Self-Contained Substring","slug":"find-longest-self-contained-substring","difficulty":3,"accepted":3009,"submitted":5118,"acceptance":0.5879249706916765},{"id":3105,"title":"Longest Strictly Increasing or Strictly Decreasing Subarray","slug":"longest-strictly-increasing-or-strictly-decreasing-subarray","difficulty":1,"accepted":218105,"submitted":335923,"acceptance":0.64927081503797},{"id":3106,"title":"Lexicographically Smallest String After Operations With Constraint","slug":"lexicographically-smallest-string-after-operations-with-constraint","difficulty":2,"accepted":29324,"submitted":46629,"acceptance":0.6288790237834824},{"id":3107,"title":"Minimum Operations to Make Median of Array Equal to K","slug":"minimum-operations-to-make-median-of-array-equal-to-k","difficulty":2,"accepted":30907,"submitted":64667,"acceptance":0.47794083535651877},{"id":3108,"title":"Minimum Cost Walk in Weighted Graph","slug":"minimum-cost-walk-in-weighted-graph","difficulty":3,"accepted":106445,"submitted":155980,"acceptance":0.6824272342608027},{"id":3109,"title":"Find the Index of Permutation","slug":"find-the-index-of-permutation","difficulty":2,"accepted":862,"submitted":2366,"acceptance":0.3643279797125951},{"id":3110,"title":"Score of a String","slug":"score-of-a-string","difficulty":1,"accepted":443189,"submitted":485163,"acceptance":0.9134847463635932},{"id":3111,"title":"Minimum Rectangles to Cover Points","slug":"minimum-rectangles-to-cover-points","difficulty":2,"accepted":32843,"submitted":51577,"acceptance":0.6367760823622932},{"id":3112,"title":"Minimum Time to Visit Disappearing Nodes","slug":"minimum-time-to-visit-disappearing-nodes","difficulty":2,"accepted":27785,"submitted":73888,"acceptance":0.37604211779991337},{"id":3113,"title":"Find the Number of Subarrays Where Boundary Elements Are Maximum","slug":"find-the-number-of-subarrays-where-boundary-elements-are-maximum","difficulty":3,"accepted":14684,"submitted":44421,"acceptance":0.3305643727066027},{"id":3114,"title":"Latest Time You Can Obtain After Replacing Characters","slug":"latest-time-you-can-obtain-after-replacing-characters","difficulty":1,"accepted":41284,"submitted":117318,"acceptance":0.3518982594316303},{"id":3115,"title":"Maximum Prime Difference","slug":"maximum-prime-difference","difficulty":2,"accepted":50876,"submitted":86558,"acceptance":0.5877677395503593},{"id":3116,"title":"Kth Smallest Amount With Single Denomination Combination","slug":"kth-smallest-amount-with-single-denomination-combination","difficulty":3,"accepted":11776,"submitted":58637,"acceptance":0.20082882821426745},{"id":3117,"title":"Minimum Sum of Values by Dividing Array","slug":"minimum-sum-of-values-by-dividing-array","difficulty":3,"accepted":7012,"submitted":25219,"acceptance":0.27804433165470477},{"id":3118,"title":"Friday Purchase III ","slug":"friday-purchase-iii","difficulty":2,"accepted":2411,"submitted":4373,"acceptance":0.5513377544020124},{"id":3119,"title":"Maximum Number of Potholes That Can Be Fixed","slug":"maximum-number-of-potholes-that-can-be-fixed","difficulty":2,"accepted":4053,"submitted":7587,"acceptance":0.5342032423882958},{"id":3120,"title":"Count the Number of Special Characters I","slug":"count-the-number-of-special-characters-i","difficulty":1,"accepted":64885,"submitted":97016,"acceptance":0.6688072070586295},{"id":3121,"title":"Count the Number of Special Characters II","slug":"count-the-number-of-special-characters-ii","difficulty":2,"accepted":41440,"submitted":95431,"acceptance":0.43424044597667427},{"id":3122,"title":"Minimum Number of Operations to Satisfy Conditions","slug":"minimum-number-of-operations-to-satisfy-conditions","difficulty":2,"accepted":19142,"submitted":45781,"acceptance":0.4181210545859636},{"id":3123,"title":"Find Edges in Shortest Paths","slug":"find-edges-in-shortest-paths","difficulty":3,"accepted":19302,"submitted":41556,"acceptance":0.4644816632977187},{"id":3124,"title":"Find Longest Calls","slug":"find-longest-calls","difficulty":2,"accepted":3015,"submitted":4737,"acceptance":0.6364787840405319},{"id":3125,"title":"Maximum Number That Makes Result of Bitwise AND Zero","slug":"maximum-number-that-makes-result-of-bitwise-and-zero","difficulty":2,"accepted":1330,"submitted":1898,"acceptance":0.7007376185458377},{"id":3126,"title":"Server Utilization Time","slug":"server-utilization-time","difficulty":2,"accepted":2820,"submitted":4660,"acceptance":0.6051502145922747},{"id":3127,"title":"Make a Square with the Same Color","slug":"make-a-square-with-the-same-color","difficulty":1,"accepted":34077,"submitted":64212,"acceptance":0.5306951971594095},{"id":3128,"title":"Right Triangles","slug":"right-triangles","difficulty":2,"accepted":23795,"submitted":48997,"acceptance":0.48564197808029064},{"id":3129,"title":"Find All Possible Stable Binary Arrays I","slug":"find-all-possible-stable-binary-arrays-i","difficulty":2,"accepted":84386,"submitted":156967,"acceptance":0.5376034453101607},{"id":3130,"title":"Find All Possible Stable Binary Arrays II","slug":"find-all-possible-stable-binary-arrays-ii","difficulty":3,"accepted":66865,"submitted":113343,"acceptance":0.5899349761343885},{"id":3131,"title":"Find the Integer Added to Array I","slug":"find-the-integer-added-to-array-i","difficulty":1,"accepted":82925,"submitted":100047,"acceptance":0.8288604355952702},{"id":3132,"title":"Find the Integer Added to Array II","slug":"find-the-integer-added-to-array-ii","difficulty":2,"accepted":26168,"submitted":79614,"acceptance":0.32868590951340215},{"id":3133,"title":"Minimum Array End","slug":"minimum-array-end","difficulty":2,"accepted":110252,"submitted":198840,"acceptance":0.5544759605713137},{"id":3134,"title":"Find the Median of the Uniqueness Array","slug":"find-the-median-of-the-uniqueness-array","difficulty":3,"accepted":8884,"submitted":29633,"acceptance":0.29980089764789253},{"id":3135,"title":"Equalize Strings by Adding or Removing Characters at Ends","slug":"equalize-strings-by-adding-or-removing-characters-at-ends","difficulty":2,"accepted":1441,"submitted":2568,"acceptance":0.5611370716510904},{"id":3136,"title":"Valid Word","slug":"valid-word","difficulty":1,"accepted":207937,"submitted":408737,"acceptance":0.5087305528983185},{"id":3137,"title":"Minimum Number of Operations to Make Word K-Periodic","slug":"minimum-number-of-operations-to-make-word-k-periodic","difficulty":2,"accepted":28274,"submitted":46614,"acceptance":0.6065559703093492},{"id":3138,"title":"Minimum Length of Anagram Concatenation","slug":"minimum-length-of-anagram-concatenation","difficulty":2,"accepted":33667,"submitted":84608,"acceptance":0.3979174546142209},{"id":3139,"title":"Minimum Cost to Equalize Array","slug":"minimum-cost-to-equalize-array","difficulty":3,"accepted":6418,"submitted":34181,"acceptance":0.1877651326760481},{"id":3140,"title":"Consecutive Available Seats II","slug":"consecutive-available-seats-ii","difficulty":2,"accepted":2862,"submitted":5158,"acceptance":0.5548662272198527},{"id":3141,"title":"Maximum Hamming Distances","slug":"maximum-hamming-distances","difficulty":3,"accepted":639,"submitted":1296,"acceptance":0.4930555555555556},{"id":3142,"title":"Check if Grid Satisfies Conditions","slug":"check-if-grid-satisfies-conditions","difficulty":1,"accepted":45462,"submitted":100731,"acceptance":0.45132084462578553},{"id":3143,"title":"Maximum Points Inside the Square","slug":"maximum-points-inside-the-square","difficulty":2,"accepted":21327,"submitted":54222,"acceptance":0.39332743166980194},{"id":3144,"title":"Minimum Substring Partition of Equal Character Frequency","slug":"minimum-substring-partition-of-equal-character-frequency","difficulty":2,"accepted":18132,"submitted":45239,"acceptance":0.40080461548663765},{"id":3145,"title":"Find Products of Elements of Big Array","slug":"find-products-of-elements-of-big-array","difficulty":3,"accepted":3109,"submitted":12635,"acceptance":0.24606252473288484},{"id":3146,"title":"Permutation Difference between Two Strings","slug":"permutation-difference-between-two-strings","difficulty":1,"accepted":110592,"submitted":125986,"acceptance":0.8778118203609925},{"id":3147,"title":"Taking Maximum Energy From the Mystic Dungeon","slug":"taking-maximum-energy-from-the-mystic-dungeon","difficulty":2,"accepted":142649,"submitted":233748,"acceptance":0.610268323151428},{"id":3148,"title":"Maximum Difference Score in a Grid","slug":"maximum-difference-score-in-a-grid","difficulty":2,"accepted":23724,"submitted":49571,"acceptance":0.4785862701983014},{"id":3149,"title":"Find the Minimum Cost Array Permutation","slug":"find-the-minimum-cost-array-permutation","difficulty":3,"accepted":7167,"submitted":28066,"acceptance":0.2553623601510725},{"id":3150,"title":"Invalid Tweets II","slug":"invalid-tweets-ii","difficulty":1,"accepted":3998,"submitted":4711,"acceptance":0.8486520908511993},{"id":3151,"title":"Special Array I","slug":"special-array-i","difficulty":1,"accepted":261583,"submitted":320512,"acceptance":0.8161410493210862},{"id":3152,"title":"Special Array II","slug":"special-array-ii","difficulty":2,"accepted":138138,"submitted":301823,"acceptance":0.4576788382595097},{"id":3153,"title":"Sum of Digit Differences of All Pairs","slug":"sum-of-digit-differences-of-all-pairs","difficulty":2,"accepted":29344,"submitted":68208,"acceptance":0.4302134646962233},{"id":3154,"title":"Find Number of Ways to Reach the K-th Stair","slug":"find-number-of-ways-to-reach-the-k-th-stair","difficulty":3,"accepted":15745,"submitted":41912,"acceptance":0.37566806642489026},{"id":3155,"title":"Maximum Number of Upgradable Servers","slug":"maximum-number-of-upgradable-servers","difficulty":2,"accepted":3367,"submitted":7771,"acceptance":0.43327757045425297},{"id":3156,"title":"Employee Task Duration and Concurrent Tasks","slug":"employee-task-duration-and-concurrent-tasks","difficulty":3,"accepted":1657,"submitted":4136,"acceptance":0.40062862669245647},{"id":3157,"title":"Find the Level of Tree with Minimum Sum","slug":"find-the-level-of-tree-with-minimum-sum","difficulty":2,"accepted":3241,"submitted":4657,"acceptance":0.695941593300408},{"id":3158,"title":"Find the XOR of Numbers Which Appear Twice","slug":"find-the-xor-of-numbers-which-appear-twice","difficulty":1,"accepted":77378,"submitted":98117,"acceptance":0.7886299010365176},{"id":3159,"title":"Find Occurrences of an Element in an Array","slug":"find-occurrences-of-an-element-in-an-array","difficulty":2,"accepted":58770,"submitted":80191,"acceptance":0.7328752603159956},{"id":3160,"title":"Find the Number of Distinct Colors Among the Balls","slug":"find-the-number-of-distinct-colors-among-the-balls","difficulty":2,"accepted":170844,"submitted":315532,"acceptance":0.5414474601625192},{"id":3161,"title":"Block Placement Queries","slug":"block-placement-queries","difficulty":3,"accepted":12734,"submitted":68859,"acceptance":0.18492862225707604},{"id":3162,"title":"Find the Number of Good Pairs I","slug":"find-the-number-of-good-pairs-i","difficulty":1,"accepted":96459,"submitted":111676,"acceptance":0.8637397471256134},{"id":3163,"title":"String Compression III","slug":"string-compression-iii","difficulty":2,"accepted":202481,"submitted":302064,"acceptance":0.6703248318237195},{"id":3164,"title":"Find the Number of Good Pairs II","slug":"find-the-number-of-good-pairs-ii","difficulty":2,"accepted":29604,"submitted":111143,"acceptance":0.2663595548077702},{"id":3165,"title":"Maximum Sum of Subsequence With Non-adjacent Elements","slug":"maximum-sum-of-subsequence-with-non-adjacent-elements","difficulty":3,"accepted":8767,"submitted":55309,"acceptance":0.15850946500569527},{"id":3166,"title":"Calculate Parking Fees and Duration","slug":"calculate-parking-fees-and-duration","difficulty":2,"accepted":2672,"submitted":5035,"acceptance":0.5306852035749752},{"id":3167,"title":"Better Compression of String","slug":"better-compression-of-string","difficulty":2,"accepted":5836,"submitted":7748,"acceptance":0.7532266391326794},{"id":3168,"title":"Minimum Number of Chairs in a Waiting Room","slug":"minimum-number-of-chairs-in-a-waiting-room","difficulty":1,"accepted":70858,"submitted":89369,"acceptance":0.7928700108538755},{"id":3169,"title":"Count Days Without Meetings","slug":"count-days-without-meetings","difficulty":2,"accepted":182948,"submitted":380265,"acceptance":0.4811065967154484},{"id":3170,"title":"Lexicographically Minimum String After Removing Stars","slug":"lexicographically-minimum-string-after-removing-stars","difficulty":2,"accepted":119492,"submitted":234528,"acceptance":0.5094999317778688},{"id":3171,"title":"Find Subarray With Bitwise OR Closest to K","slug":"find-subarray-with-bitwise-or-closest-to-k","difficulty":3,"accepted":15601,"submitted":50433,"acceptance":0.3093411060218508},{"id":3172,"title":"Second Day Verification","slug":"second-day-verification","difficulty":1,"accepted":3781,"submitted":5658,"acceptance":0.6682573347472606},{"id":3173,"title":"Bitwise OR of Adjacent Elements","slug":"bitwise-or-of-adjacent-elements","difficulty":1,"accepted":6556,"submitted":6918,"acceptance":0.9476727377854871},{"id":3174,"title":"Clear Digits","slug":"clear-digits","difficulty":1,"accepted":279443,"submitted":337929,"acceptance":0.8269281417102409},{"id":3175,"title":"Find The First Player to win K Games in a Row","slug":"find-the-first-player-to-win-k-games-in-a-row","difficulty":2,"accepted":36459,"submitted":90794,"acceptance":0.4015573716324867},{"id":3176,"title":"Find the Maximum Length of a Good Subsequence I","slug":"find-the-maximum-length-of-a-good-subsequence-i","difficulty":2,"accepted":23468,"submitted":71851,"acceptance":0.3266203671486827},{"id":3177,"title":"Find the Maximum Length of a Good Subsequence II","slug":"find-the-maximum-length-of-a-good-subsequence-ii","difficulty":3,"accepted":9641,"submitted":38325,"acceptance":0.2515590345727332},{"id":3178,"title":"Find the Child Who Has the Ball After K Seconds","slug":"find-the-child-who-has-the-ball-after-k-seconds","difficulty":1,"accepted":59502,"submitted":95950,"acceptance":0.6201354872329338},{"id":3179,"title":"Find the N-th Value After K Seconds","slug":"find-the-n-th-value-after-k-seconds","difficulty":2,"accepted":45290,"submitted":84126,"acceptance":0.5383591279747046},{"id":3180,"title":"Maximum Total Reward Using Operations I","slug":"maximum-total-reward-using-operations-i","difficulty":2,"accepted":30915,"submitted":100289,"acceptance":0.30825913111108894},{"id":3181,"title":"Maximum Total Reward Using Operations II","slug":"maximum-total-reward-using-operations-ii","difficulty":3,"accepted":8680,"submitted":39710,"acceptance":0.21858473936036263},{"id":3182,"title":"Find Top Scoring Students","slug":"find-top-scoring-students","difficulty":2,"accepted":2993,"submitted":6015,"acceptance":0.49758935993349956},{"id":3183,"title":"The Number of Ways to Make the Sum","slug":"the-number-of-ways-to-make-the-sum","difficulty":2,"accepted":1993,"submitted":3897,"acceptance":0.5114190402874006},{"id":3184,"title":"Count Pairs That Form a Complete Day I","slug":"count-pairs-that-form-a-complete-day-i","difficulty":1,"accepted":76122,"submitted":97441,"acceptance":0.7812111944663951},{"id":3185,"title":"Count Pairs That Form a Complete Day II","slug":"count-pairs-that-form-a-complete-day-ii","difficulty":2,"accepted":48457,"submitted":110897,"acceptance":0.4369550123087189},{"id":3186,"title":"Maximum Total Damage With Spell Casting","slug":"maximum-total-damage-with-spell-casting","difficulty":2,"accepted":114465,"submitted":253857,"acceptance":0.4509034613975585},{"id":3187,"title":"Peaks in Array","slug":"peaks-in-array","difficulty":3,"accepted":11897,"submitted":43396,"acceptance":0.27414969121578026},{"id":3188,"title":"Find Top Scoring Students II","slug":"find-top-scoring-students-ii","difficulty":3,"accepted":2330,"submitted":5819,"acceptance":0.4004124420003437},{"id":3189,"title":"Minimum Moves to Get a Peaceful Board","slug":"minimum-moves-to-get-a-peaceful-board","difficulty":2,"accepted":4790,"submitted":6316,"acceptance":0.7583913869537682},{"id":3190,"title":"Find Minimum Operations to Make All Elements Divisible by Three","slug":"find-minimum-operations-to-make-all-elements-divisible-by-three","difficulty":1,"accepted":269926,"submitted":297076,"acceptance":0.9086092447723815},{"id":3191,"title":"Minimum Operations to Make Binary Array Elements Equal to One I","slug":"minimum-operations-to-make-binary-array-elements-equal-to-one-i","difficulty":2,"accepted":210976,"submitted":262379,"acceptance":0.8040887418581517},{"id":3192,"title":"Minimum Operations to Make Binary Array Elements Equal to One II","slug":"minimum-operations-to-make-binary-array-elements-equal-to-one-ii","difficulty":2,"accepted":43615,"submitted":66973,"acceptance":0.6512325862661072},{"id":3193,"title":"Count the Number of Inversions","slug":"count-the-number-of-inversions","difficulty":3,"accepted":10202,"submitted":33967,"acceptance":0.3003503400359172},{"id":3194,"title":"Minimum Average of Smallest and Largest Elements","slug":"minimum-average-of-smallest-and-largest-elements","difficulty":1,"accepted":109694,"submitted":128600,"acceptance":0.8529860031104199},{"id":3195,"title":"Find the Minimum Area to Cover All Ones I","slug":"find-the-minimum-area-to-cover-all-ones-i","difficulty":2,"accepted":167001,"submitted":213704,"acceptance":0.7814594017893909},{"id":3196,"title":"Maximize Total Cost of Alternating Subarrays","slug":"maximize-total-cost-of-alternating-subarrays","difficulty":2,"accepted":25643,"submitted":86540,"acceptance":0.29631384330945226},{"id":3197,"title":"Find the Minimum Area to Cover All Ones II","slug":"find-the-minimum-area-to-cover-all-ones-ii","difficulty":3,"accepted":65039,"submitted":102415,"acceptance":0.6350534589659718},{"id":3198,"title":"Find Cities in Each State","slug":"find-cities-in-each-state","difficulty":1,"accepted":3840,"submitted":4831,"acceptance":0.7948664872697164},{"id":3199,"title":"Count Triplets with Even XOR Set Bits I","slug":"count-triplets-with-even-xor-set-bits-i","difficulty":1,"accepted":1873,"submitted":2252,"acceptance":0.8317051509769094},{"id":3200,"title":"Maximum Height of a Triangle","slug":"maximum-height-of-a-triangle","difficulty":1,"accepted":44268,"submitted":99955,"acceptance":0.4428792956830574},{"id":3201,"title":"Find the Maximum Length of Valid Subsequence I","slug":"find-the-maximum-length-of-valid-subsequence-i","difficulty":2,"accepted":142220,"submitted":259167,"acceptance":0.5487581366454835},{"id":3202,"title":"Find the Maximum Length of Valid Subsequence II","slug":"find-the-maximum-length-of-valid-subsequence-ii","difficulty":2,"accepted":101923,"submitted":178215,"acceptance":0.5719103330247174},{"id":3203,"title":"Find Minimum Diameter After Merging Two Trees","slug":"find-minimum-diameter-after-merging-two-trees","difficulty":3,"accepted":78424,"submitted":137405,"acceptance":0.5707507004839707},{"id":3204,"title":"Bitwise User Permissions Analysis","slug":"bitwise-user-permissions-analysis","difficulty":2,"accepted":2103,"submitted":2263,"acceptance":0.929297392841361},{"id":3205,"title":"Maximum Array Hopping Score I","slug":"maximum-array-hopping-score-i","difficulty":2,"accepted":2629,"submitted":3419,"acceptance":0.7689382860485522},{"id":3206,"title":"Alternating Groups I","slug":"alternating-groups-i","difficulty":1,"accepted":74114,"submitted":107480,"acceptance":0.689560848529959},{"id":3207,"title":"Maximum Points After Enemy Battles","slug":"maximum-points-after-enemy-battles","difficulty":2,"accepted":30613,"submitted":91993,"acceptance":0.3327753198612938},{"id":3208,"title":"Alternating Groups II","slug":"alternating-groups-ii","difficulty":2,"accepted":159896,"submitted":266658,"acceptance":0.5996294879583587},{"id":3209,"title":"Number of Subarrays With AND Value of K","slug":"number-of-subarrays-with-and-value-of-k","difficulty":3,"accepted":13913,"submitted":39571,"acceptance":0.3515958656591949},{"id":3210,"title":"Find the Encrypted String","slug":"find-the-encrypted-string","difficulty":1,"accepted":68016,"submitted":99770,"acceptance":0.6817279743409843},{"id":3211,"title":"Generate Binary Strings Without Adjacent Zeros","slug":"generate-binary-strings-without-adjacent-zeros","difficulty":2,"accepted":82096,"submitted":92967,"acceptance":0.8830660341841728},{"id":3212,"title":"Count Submatrices With Equal Frequency of X and Y","slug":"count-submatrices-with-equal-frequency-of-x-and-y","difficulty":2,"accepted":106541,"submitted":153124,"acceptance":0.6957825030694078},{"id":3213,"title":"Construct String with Minimum Cost","slug":"construct-string-with-minimum-cost","difficulty":3,"accepted":13112,"submitted":69079,"acceptance":0.18981166490539816},{"id":3214,"title":"Year on Year Growth Rate","slug":"year-on-year-growth-rate","difficulty":3,"accepted":3602,"submitted":7035,"acceptance":0.5120113717128643},{"id":3215,"title":"Count Triplets with Even XOR Set Bits II","slug":"count-triplets-with-even-xor-set-bits-ii","difficulty":2,"accepted":805,"submitted":1315,"acceptance":0.6121673003802282},{"id":3216,"title":"Lexicographically Smallest String After a Swap","slug":"lexicographically-smallest-string-after-a-swap","difficulty":1,"accepted":55356,"submitted":101417,"acceptance":0.5458256505319621},{"id":3217,"title":"Delete Nodes From Linked List Present in Array","slug":"delete-nodes-from-linked-list-present-in-array","difficulty":2,"accepted":338044,"submitted":486617,"acceptance":0.6946818545180296},{"id":3218,"title":"Minimum Cost for Cutting Cake I","slug":"minimum-cost-for-cutting-cake-i","difficulty":2,"accepted":30949,"submitted":52909,"acceptance":0.5849477404600352},{"id":3219,"title":"Minimum Cost for Cutting Cake II","slug":"minimum-cost-for-cutting-cake-ii","difficulty":3,"accepted":24176,"submitted":43798,"acceptance":0.5519886752819764},{"id":3220,"title":"Odd and Even Transactions","slug":"odd-and-even-transactions","difficulty":2,"accepted":35302,"submitted":51750,"acceptance":0.6821642512077295},{"id":3221,"title":"Maximum Array Hopping Score II","slug":"maximum-array-hopping-score-ii","difficulty":2,"accepted":1147,"submitted":1923,"acceptance":0.5964638585543421},{"id":3222,"title":"Find the Winning Player in Coin Game","slug":"find-the-winning-player-in-coin-game","difficulty":1,"accepted":57558,"submitted":108121,"acceptance":0.5323480174989133},{"id":3223,"title":"Minimum Length of String After Operations","slug":"minimum-length-of-string-after-operations","difficulty":2,"accepted":194854,"submitted":259685,"acceptance":0.7503475364383773},{"id":3224,"title":"Minimum Array Changes to Make Differences Equal","slug":"minimum-array-changes-to-make-differences-equal","difficulty":2,"accepted":15351,"submitted":63036,"acceptance":0.24352750809061488},{"id":3225,"title":"Maximum Score From Grid Operations","slug":"maximum-score-from-grid-operations","difficulty":3,"accepted":3373,"submitted":12420,"acceptance":0.2715780998389694},{"id":3226,"title":"Number of Bit Changes to Make Two Integers Equal","slug":"number-of-bit-changes-to-make-two-integers-equal","difficulty":1,"accepted":51588,"submitted":81299,"acceptance":0.6345465503880736},{"id":3227,"title":"Vowels Game in a String","slug":"vowels-game-in-a-string","difficulty":2,"accepted":193398,"submitted":250889,"acceptance":0.7708508543618892},{"id":3228,"title":"Maximum Number of Operations to Move Ones to the End","slug":"maximum-number-of-operations-to-move-ones-to-the-end","difficulty":2,"accepted":124372,"submitted":185277,"acceptance":0.6712759813684376},{"id":3229,"title":"Minimum Operations to Make Array Equal to Target","slug":"minimum-operations-to-make-array-equal-to-target","difficulty":3,"accepted":23977,"submitted":57863,"acceptance":0.41437533484264555},{"id":3230,"title":"Customer Purchasing Behavior Analysis","slug":"customer-purchasing-behavior-analysis","difficulty":2,"accepted":2939,"submitted":8031,"acceptance":0.365956916946831},{"id":3231,"title":"Minimum Number of Increasing Subsequence to Be Removed","slug":"minimum-number-of-increasing-subsequence-to-be-removed","difficulty":3,"accepted":609,"submitted":1304,"acceptance":0.46702453987730064},{"id":3232,"title":"Find if Digit Game Can Be Won","slug":"find-if-digit-game-can-be-won","difficulty":1,"accepted":111791,"submitted":137127,"acceptance":0.8152369701080021},{"id":3233,"title":"Find the Count of Numbers Which Are Not Special","slug":"find-the-count-of-numbers-which-are-not-special","difficulty":2,"accepted":37895,"submitted":137127,"acceptance":0.2763496612629169},{"id":3234,"title":"Count the Number of Substrings With Dominant Ones","slug":"count-the-number-of-substrings-with-dominant-ones","difficulty":2,"accepted":65055,"submitted":154656,"acceptance":0.42064323401613907},{"id":3235,"title":"Check if the Rectangle Corner Is Reachable","slug":"check-if-the-rectangle-corner-is-reachable","difficulty":3,"accepted":8015,"submitted":31710,"acceptance":0.25275938189845476},{"id":3236,"title":"CEO Subordinate Hierarchy","slug":"ceo-subordinate-hierarchy","difficulty":3,"accepted":1529,"submitted":2204,"acceptance":0.6937386569872959},{"id":3237,"title":"Alt and Tab Simulation","slug":"alt-and-tab-simulation","difficulty":2,"accepted":1229,"submitted":2333,"acceptance":0.5267895413630519},{"id":3238,"title":"Find the Number of Winning Players","slug":"find-the-number-of-winning-players","difficulty":1,"accepted":47823,"submitted":79036,"acceptance":0.6050786983146921},{"id":3239,"title":"Minimum Number of Flips to Make Binary Grid Palindromic I","slug":"minimum-number-of-flips-to-make-binary-grid-palindromic-i","difficulty":2,"accepted":38841,"submitted":51898,"acceptance":0.748410343365833},{"id":3240,"title":"Minimum Number of Flips to Make Binary Grid Palindromic II","slug":"minimum-number-of-flips-to-make-binary-grid-palindromic-ii","difficulty":2,"accepted":12508,"submitted":49043,"acceptance":0.25504149419896827},{"id":3241,"title":"Time Taken to Mark All Nodes","slug":"time-taken-to-mark-all-nodes","difficulty":3,"accepted":6699,"submitted":24065,"acceptance":0.2783710783295242},{"id":3242,"title":"Design Neighbor Sum Service","slug":"design-neighbor-sum-service","difficulty":1,"accepted":46549,"submitted":60901,"acceptance":0.7643388450107551},{"id":3243,"title":"Shortest Distance After Road Addition Queries I","slug":"shortest-distance-after-road-addition-queries-i","difficulty":2,"accepted":116602,"submitted":188441,"acceptance":0.6187719233075605},{"id":3244,"title":"Shortest Distance After Road Addition Queries II","slug":"shortest-distance-after-road-addition-queries-ii","difficulty":3,"accepted":15476,"submitted":58153,"acceptance":0.2661255653190721},{"id":3245,"title":"Alternating Groups III","slug":"alternating-groups-iii","difficulty":3,"accepted":2894,"submitted":15156,"acceptance":0.19094747954605437},{"id":3246,"title":"Premier League Table Ranking","slug":"premier-league-table-ranking","difficulty":1,"accepted":3705,"submitted":4721,"acceptance":0.7847913577631858},{"id":3247,"title":"Number of Subsequences with Odd Sum","slug":"number-of-subsequences-with-odd-sum","difficulty":2,"accepted":1084,"submitted":2305,"acceptance":0.4702819956616052},{"id":3248,"title":"Snake in Matrix","slug":"snake-in-matrix","difficulty":1,"accepted":75724,"submitted":91947,"acceptance":0.823561399501887},{"id":3249,"title":"Count the Number of Good Nodes","slug":"count-the-number-of-good-nodes","difficulty":2,"accepted":31153,"submitted":56306,"acceptance":0.5532802898447767},{"id":3250,"title":"Find the Count of Monotonic Pairs I","slug":"find-the-count-of-monotonic-pairs-i","difficulty":3,"accepted":20630,"submitted":43465,"acceptance":0.47463476360289886},{"id":3251,"title":"Find the Count of Monotonic Pairs II","slug":"find-the-count-of-monotonic-pairs-ii","difficulty":3,"accepted":8152,"submitted":33084,"acceptance":0.24640309515173497},{"id":3252,"title":"Premier League Table Ranking II","slug":"premier-league-table-ranking-ii","difficulty":2,"accepted":2039,"submitted":3672,"acceptance":0.5552832244008714},{"id":3253,"title":"Construct String with Minimum Cost (Easy)","slug":"construct-string-with-minimum-cost-easy","difficulty":2,"accepted":803,"submitted":1363,"acceptance":0.5891415994130594},{"id":3254,"title":"Find the Power of K-Size Subarrays I","slug":"find-the-power-of-k-size-subarrays-i","difficulty":2,"accepted":153801,"submitted":247683,"acceptance":0.6209590484611378},{"id":3255,"title":"Find the Power of K-Size Subarrays II","slug":"find-the-power-of-k-size-subarrays-ii","difficulty":2,"accepted":35007,"submitted":111157,"acceptance":0.3149329326987954},{"id":3256,"title":"Maximum Value Sum by Placing Three Rooks I","slug":"maximum-value-sum-by-placing-three-rooks-i","difficulty":3,"accepted":9769,"submitted":59243,"acceptance":0.16489711864692874},{"id":3257,"title":"Maximum Value Sum by Placing Three Rooks II","slug":"maximum-value-sum-by-placing-three-rooks-ii","difficulty":3,"accepted":5552,"submitted":20687,"acceptance":0.26838110890897665},{"id":3258,"title":"Count Substrings That Satisfy K-Constraint I","slug":"count-substrings-that-satisfy-k-constraint-i","difficulty":1,"accepted":57789,"submitted":73247,"acceptance":0.7889606400262127},{"id":3259,"title":"Maximum Energy Boost From Two Drinks","slug":"maximum-energy-boost-from-two-drinks","difficulty":2,"accepted":35718,"submitted":71317,"acceptance":0.5008343031815696},{"id":3260,"title":"Find the Largest Palindrome Divisible by K","slug":"find-the-largest-palindrome-divisible-by-k","difficulty":3,"accepted":9293,"submitted":54737,"acceptance":0.16977547180152364},{"id":3261,"title":"Count Substrings That Satisfy K-Constraint II","slug":"count-substrings-that-satisfy-k-constraint-ii","difficulty":3,"accepted":5939,"submitted":25317,"acceptance":0.23458545641268713},{"id":3262,"title":"Find Overlapping Shifts","slug":"find-overlapping-shifts","difficulty":2,"accepted":2470,"submitted":4212,"acceptance":0.5864197530864198},{"id":3263,"title":"Convert Doubly Linked List to Array I","slug":"convert-doubly-linked-list-to-array-i","difficulty":1,"accepted":9131,"submitted":9619,"acceptance":0.9492670755795821},{"id":3264,"title":"Final Array State After K Multiplication Operations I","slug":"final-array-state-after-k-multiplication-operations-i","difficulty":1,"accepted":205080,"submitted":235909,"acceptance":0.8693182540725449},{"id":3265,"title":"Count Almost Equal Pairs I","slug":"count-almost-equal-pairs-i","difficulty":2,"accepted":29232,"submitted":76406,"acceptance":0.38258775488835955},{"id":3266,"title":"Final Array State After K Multiplication Operations II","slug":"final-array-state-after-k-multiplication-operations-ii","difficulty":3,"accepted":11341,"submitted":86168,"acceptance":0.13161498468108812},{"id":3267,"title":"Count Almost Equal Pairs II","slug":"count-almost-equal-pairs-ii","difficulty":3,"accepted":9216,"submitted":33941,"acceptance":0.2715300079549807},{"id":3268,"title":"Find Overlapping Shifts II","slug":"find-overlapping-shifts-ii","difficulty":3,"accepted":1286,"submitted":2283,"acceptance":0.5632939115199299},{"id":3269,"title":"Constructing Two Increasing Arrays","slug":"constructing-two-increasing-arrays","difficulty":3,"accepted":514,"submitted":819,"acceptance":0.6275946275946276},{"id":3270,"title":"Find the Key of the Numbers","slug":"find-the-key-of-the-numbers","difficulty":1,"accepted":52957,"submitted":69217,"acceptance":0.7650866116705434},{"id":3271,"title":"Hash Divided String","slug":"hash-divided-string","difficulty":2,"accepted":51377,"submitted":61744,"acceptance":0.8320970458668049},{"id":3272,"title":"Find the Count of Good Integers","slug":"find-the-count-of-good-integers","difficulty":3,"accepted":72980,"submitted":105208,"acceptance":0.6936734849060908},{"id":3273,"title":"Minimum Amount of Damage Dealt to Bob","slug":"minimum-amount-of-damage-dealt-to-bob","difficulty":3,"accepted":14386,"submitted":36271,"acceptance":0.3966254032146894},{"id":3274,"title":"Check if Two Chessboard Squares Have the Same Color","slug":"check-if-two-chessboard-squares-have-the-same-color","difficulty":1,"accepted":70759,"submitted":97874,"acceptance":0.722960132415146},{"id":3275,"title":"K-th Nearest Obstacle Queries","slug":"k-th-nearest-obstacle-queries","difficulty":2,"accepted":36195,"submitted":73898,"acceptance":0.48979674686730357},{"id":3276,"title":"Select Cells in Grid With Maximum Score","slug":"select-cells-in-grid-with-maximum-score","difficulty":3,"accepted":12516,"submitted":79633,"acceptance":0.1571710220637173},{"id":3277,"title":"Maximum XOR Score Subarray Queries","slug":"maximum-xor-score-subarray-queries","difficulty":3,"accepted":5559,"submitted":12709,"acceptance":0.4374065622787001},{"id":3278,"title":"Find Candidates for Data Scientist Position II","slug":"find-candidates-for-data-scientist-position-ii","difficulty":2,"accepted":2191,"submitted":5113,"acceptance":0.42851554860160374},{"id":3279,"title":"Maximum Total Area Occupied by Pistons","slug":"maximum-total-area-occupied-by-pistons","difficulty":3,"accepted":511,"submitted":1253,"acceptance":0.40782122905027934},{"id":3280,"title":"Convert Date to Binary","slug":"convert-date-to-binary","difficulty":1,"accepted":88318,"submitted":99490,"acceptance":0.887707307267062},{"id":3281,"title":"Maximize Score of Numbers in Ranges","slug":"maximize-score-of-numbers-in-ranges","difficulty":2,"accepted":23709,"submitted":66553,"acceptance":0.3562423932805433},{"id":3282,"title":"Reach End of Array With Max Score","slug":"reach-end-of-array-with-max-score","difficulty":2,"accepted":29220,"submitted":87081,"acceptance":0.33554966066076414},{"id":3283,"title":"Maximum Number of Moves to Kill All Pawns","slug":"maximum-number-of-moves-to-kill-all-pawns","difficulty":3,"accepted":7313,"submitted":21667,"acceptance":0.33751788434024094},{"id":3284,"title":"Sum of Consecutive Subarrays","slug":"sum-of-consecutive-subarrays","difficulty":2,"accepted":863,"submitted":2037,"acceptance":0.42366224840451644},{"id":3285,"title":"Find Indices of Stable Mountains","slug":"find-indices-of-stable-mountains","difficulty":1,"accepted":69208,"submitted":79691,"acceptance":0.8684544051398527},{"id":3286,"title":"Find a Safe Walk Through a Grid","slug":"find-a-safe-walk-through-a-grid","difficulty":2,"accepted":36187,"submitted":109702,"acceptance":0.32986636524402474},{"id":3287,"title":"Find the Maximum Sequence Value of Array","slug":"find-the-maximum-sequence-value-of-array","difficulty":3,"accepted":5892,"submitted":27556,"acceptance":0.21381913194948468},{"id":3288,"title":"Length of the Longest Increasing Path","slug":"length-of-the-longest-increasing-path","difficulty":3,"accepted":6004,"submitted":31015,"acceptance":0.1935837497984846},{"id":3289,"title":"The Two Sneaky Numbers of Digitville","slug":"the-two-sneaky-numbers-of-digitville","difficulty":1,"accepted":253461,"submitted":282237,"acceptance":0.8980431339618831},{"id":3290,"title":"Maximum Multiplication Score","slug":"maximum-multiplication-score","difficulty":2,"accepted":36504,"submitted":88418,"acceptance":0.4128571105431021},{"id":3291,"title":"Minimum Number of Valid Strings to Form Target I","slug":"minimum-number-of-valid-strings-to-form-target-i","difficulty":2,"accepted":15083,"submitted":69190,"acceptance":0.21799392975863563},{"id":3292,"title":"Minimum Number of Valid Strings to Form Target II","slug":"minimum-number-of-valid-strings-to-form-target-ii","difficulty":3,"accepted":5562,"submitted":27136,"acceptance":0.20496757075471697},{"id":3293,"title":"Calculate Product Final Price","slug":"calculate-product-final-price","difficulty":2,"accepted":2850,"submitted":3592,"acceptance":0.7934298440979956},{"id":3294,"title":"Convert Doubly Linked List to Array II","slug":"convert-doubly-linked-list-to-array-ii","difficulty":2,"accepted":3446,"submitted":4172,"acceptance":0.8259827420901247},{"id":3295,"title":"Report Spam Message","slug":"report-spam-message","difficulty":2,"accepted":57690,"submitted":118720,"acceptance":0.4859332884097035},{"id":3296,"title":"Minimum Number of Seconds to Make Mountain Height Zero","slug":"minimum-number-of-seconds-to-make-mountain-height-zero","difficulty":2,"accepted":103936,"submitted":177986,"acceptance":0.583956041486409},{"id":3297,"title":"Count Substrings That Can Be Rearranged to Contain a String I","slug":"count-substrings-that-can-be-rearranged-to-contain-a-string-i","difficulty":2,"accepted":19813,"submitted":46151,"acceptance":0.42930814066867456},{"id":3298,"title":"Count Substrings That Can Be Rearranged to Contain a String II","slug":"count-substrings-that-can-be-rearranged-to-contain-a-string-ii","difficulty":3,"accepted":17309,"submitted":30827,"acceptance":0.5614883057060369},{"id":3299,"title":"Sum of Consecutive Subsequences","slug":"sum-of-consecutive-subsequences","difficulty":3,"accepted":538,"submitted":1239,"acceptance":0.43422114608555284},{"id":3300,"title":"Minimum Element After Replacement With Digit Sum","slug":"minimum-element-after-replacement-with-digit-sum","difficulty":1,"accepted":72002,"submitted":85024,"acceptance":0.8468432442604441},{"id":3301,"title":"Maximize the Total Height of Unique Towers","slug":"maximize-the-total-height-of-unique-towers","difficulty":2,"accepted":34739,"submitted":92986,"acceptance":0.37359387434667585},{"id":3302,"title":"Find the Lexicographically Smallest Valid Sequence","slug":"find-the-lexicographically-smallest-valid-sequence","difficulty":2,"accepted":7627,"submitted":35024,"acceptance":0.2177649611694838},{"id":3303,"title":"Find the Occurrence of First Almost Equal Substring","slug":"find-the-occurrence-of-first-almost-equal-substring","difficulty":3,"accepted":5488,"submitted":35531,"acceptance":0.15445667163885057},{"id":3304,"title":"Find the K-th Character in String Game I","slug":"find-the-k-th-character-in-string-game-i","difficulty":1,"accepted":212763,"submitted":260598,"acceptance":0.8164414155135497},{"id":3305,"title":"Count of Substrings Containing Every Vowel and K Consonants I","slug":"count-of-substrings-containing-every-vowel-and-k-consonants-i","difficulty":2,"accepted":32866,"submitted":78628,"acceptance":0.4179935900696953},{"id":3306,"title":"Count of Substrings Containing Every Vowel and K Consonants II","slug":"count-of-substrings-containing-every-vowel-and-k-consonants-ii","difficulty":2,"accepted":114525,"submitted":281799,"acceptance":0.4064066941330523},{"id":3307,"title":"Find the K-th Character in String Game II","slug":"find-the-k-th-character-in-string-game-ii","difficulty":3,"accepted":87797,"submitted":181116,"acceptance":0.48475562622849444},{"id":3308,"title":"Find Top Performing Driver","slug":"find-top-performing-driver","difficulty":2,"accepted":2538,"submitted":5160,"acceptance":0.49186046511627907},{"id":3309,"title":"Maximum Possible Number by Binary Concatenation","slug":"maximum-possible-number-by-binary-concatenation","difficulty":2,"accepted":37143,"submitted":56694,"acceptance":0.6551486929833845},{"id":3310,"title":"Remove Methods From Project","slug":"remove-methods-from-project","difficulty":2,"accepted":27006,"submitted":53486,"acceptance":0.5049171745877425},{"id":3311,"title":"Construct 2D Grid Matching Graph Layout","slug":"construct-2d-grid-matching-graph-layout","difficulty":3,"accepted":4501,"submitted":15202,"acceptance":0.2960794632285226},{"id":3312,"title":"Sorted GCD Pair Queries","slug":"sorted-gcd-pair-queries","difficulty":3,"accepted":5980,"submitted":26356,"acceptance":0.22689330702686294},{"id":3313,"title":"Find the Last Marked Nodes in Tree","slug":"find-the-last-marked-nodes-in-tree","difficulty":3,"accepted":643,"submitted":1149,"acceptance":0.5596170583115753},{"id":3314,"title":"Construct the Minimum Bitwise Array I","slug":"construct-the-minimum-bitwise-array-i","difficulty":1,"accepted":136547,"submitted":160165,"acceptance":0.8525395685699123},{"id":3315,"title":"Construct the Minimum Bitwise Array II","slug":"construct-the-minimum-bitwise-array-ii","difficulty":2,"accepted":102480,"submitted":154065,"acceptance":0.665173790283322},{"id":3316,"title":"Find Maximum Removals From Source String","slug":"find-maximum-removals-from-source-string","difficulty":2,"accepted":12123,"submitted":30896,"acceptance":0.3923808907301916},{"id":3317,"title":"Find the Number of Possible Ways for an Event","slug":"find-the-number-of-possible-ways-for-an-event","difficulty":3,"accepted":5311,"submitted":15225,"acceptance":0.34883415435139575},{"id":3318,"title":"Find X-Sum of All K-Long Subarrays I","slug":"find-x-sum-of-all-k-long-subarrays-i","difficulty":1,"accepted":142913,"submitted":187888,"acceptance":0.7606286724005791},{"id":3319,"title":"K-th Largest Perfect Subtree Size in Binary Tree","slug":"k-th-largest-perfect-subtree-size-in-binary-tree","difficulty":2,"accepted":29513,"submitted":47452,"acceptance":0.6219548174997893},{"id":3320,"title":"Count The Number of Winning Sequences","slug":"count-the-number-of-winning-sequences","difficulty":3,"accepted":10713,"submitted":33355,"acceptance":0.3211812321990706},{"id":3321,"title":"Find X-Sum of All K-Long Subarrays II","slug":"find-x-sum-of-all-k-long-subarrays-ii","difficulty":3,"accepted":65448,"submitted":159223,"acceptance":0.4110461428311236},{"id":3322,"title":"Premier League Table Ranking III","slug":"premier-league-table-ranking-iii","difficulty":2,"accepted":2065,"submitted":2913,"acceptance":0.7088911774802609},{"id":3323,"title":"Minimize Connected Groups by Inserting Interval","slug":"minimize-connected-groups-by-inserting-interval","difficulty":2,"accepted":1449,"submitted":2878,"acceptance":0.5034746351633078},{"id":3324,"title":"Find the Sequence of Strings Appeared on the Screen","slug":"find-the-sequence-of-strings-appeared-on-the-screen","difficulty":2,"accepted":42602,"submitted":53098,"acceptance":0.8023277712908208},{"id":3325,"title":"Count Substrings With K-Frequency Characters I","slug":"count-substrings-with-k-frequency-characters-i","difficulty":2,"accepted":37366,"submitted":67029,"acceptance":0.5574602037923884},{"id":3326,"title":"Minimum Division Operations to Make Array Non Decreasing","slug":"minimum-division-operations-to-make-array-non-decreasing","difficulty":2,"accepted":24040,"submitted":82556,"acceptance":0.2911962788894811},{"id":3327,"title":"Check if DFS Strings Are Palindromes","slug":"check-if-dfs-strings-are-palindromes","difficulty":3,"accepted":6883,"submitted":33749,"acceptance":0.2039467836084032},{"id":3328,"title":"Find Cities in Each State II","slug":"find-cities-in-each-state-ii","difficulty":2,"accepted":2118,"submitted":3092,"acceptance":0.684993531694696},{"id":3329,"title":"Count Substrings With K-Frequency Characters II","slug":"count-substrings-with-k-frequency-characters-ii","difficulty":3,"accepted":980,"submitted":1409,"acceptance":0.6955287437899219},{"id":3330,"title":"Find the Original Typed String I","slug":"find-the-original-typed-string-i","difficulty":1,"accepted":197136,"submitted":273560,"acceptance":0.7206316712969733},{"id":3331,"title":"Find Subtree Sizes After Changes","slug":"find-subtree-sizes-after-changes","difficulty":2,"accepted":16656,"submitted":30908,"acceptance":0.538889607868513},{"id":3332,"title":"Maximum Points Tourist Can Earn","slug":"maximum-points-tourist-can-earn","difficulty":2,"accepted":15291,"submitted":32169,"acceptance":0.47533339550498926},{"id":3333,"title":"Find the Original Typed String II","slug":"find-the-original-typed-string-ii","difficulty":3,"accepted":70122,"submitted":154039,"acceptance":0.45522237874823906},{"id":3334,"title":"Find the Maximum Factor Score of Array","slug":"find-the-maximum-factor-score-of-array","difficulty":2,"accepted":24095,"submitted":58791,"acceptance":0.4098416424282628},{"id":3335,"title":"Total Characters in String After Transformations I","slug":"total-characters-in-string-after-transformations-i","difficulty":2,"accepted":117062,"submitted":256450,"acceptance":0.4564710469877169},{"id":3336,"title":"Find the Number of Subsequences With Equal GCD","slug":"find-the-number-of-subsequences-with-equal-gcd","difficulty":3,"accepted":7841,"submitted":24883,"acceptance":0.315114736969015},{"id":3337,"title":"Total Characters in String After Transformations II","slug":"total-characters-in-string-after-transformations-ii","difficulty":3,"accepted":63504,"submitted":109554,"acceptance":0.5796593460759077},{"id":3338,"title":"Second Highest Salary II","slug":"second-highest-salary-ii","difficulty":2,"accepted":3010,"submitted":3476,"acceptance":0.8659378596087457},{"id":3339,"title":"Find the Number of K-Even Arrays","slug":"find-the-number-of-k-even-arrays","difficulty":2,"accepted":634,"submitted":1033,"acceptance":0.6137463697967086},{"id":3340,"title":"Check Balanced String","slug":"check-balanced-string","difficulty":1,"accepted":77228,"submitted":93568,"acceptance":0.8253676470588235},{"id":3341,"title":"Find Minimum Time to Reach Last Room I","slug":"find-minimum-time-to-reach-last-room-i","difficulty":2,"accepted":115946,"submitted":208999,"acceptance":0.554768204632558},{"id":3342,"title":"Find Minimum Time to Reach Last Room II","slug":"find-minimum-time-to-reach-last-room-ii","difficulty":2,"accepted":96100,"submitted":141792,"acceptance":0.6777533288196795},{"id":3343,"title":"Count Number of Balanced Permutations","slug":"count-number-of-balanced-permutations","difficulty":3,"accepted":59321,"submitted":120874,"acceptance":0.4907672452305707},{"id":3344,"title":"Maximum Sized Array","slug":"maximum-sized-array","difficulty":2,"accepted":620,"submitted":1210,"acceptance":0.512396694214876},{"id":3345,"title":"Smallest Divisible Digit Product I","slug":"smallest-divisible-digit-product-i","difficulty":1,"accepted":39019,"submitted":60641,"acceptance":0.643442555366831},{"id":3346,"title":"Maximum Frequency of an Element After Performing Operations I","slug":"maximum-frequency-of-an-element-after-performing-operations-i","difficulty":2,"accepted":89640,"submitted":223704,"acceptance":0.4007080785323463},{"id":3347,"title":"Maximum Frequency of an Element After Performing Operations II","slug":"maximum-frequency-of-an-element-after-performing-operations-ii","difficulty":3,"accepted":67254,"submitted":124956,"acceptance":0.538221453951791},{"id":3348,"title":"Smallest Divisible Digit Product II","slug":"smallest-divisible-digit-product-ii","difficulty":3,"accepted":4860,"submitted":33394,"acceptance":0.1455351260705516},{"id":3349,"title":"Adjacent Increasing Subarrays Detection I","slug":"adjacent-increasing-subarrays-detection-i","difficulty":1,"accepted":161093,"submitted":335723,"acceptance":0.4798390339655013},{"id":3350,"title":"Adjacent Increasing Subarrays Detection II","slug":"adjacent-increasing-subarrays-detection-ii","difficulty":2,"accepted":120447,"submitted":204618,"acceptance":0.588643227868516},{"id":3351,"title":"Sum of Good Subsequences","slug":"sum-of-good-subsequences","difficulty":3,"accepted":12256,"submitted":39689,"acceptance":0.3088009272090504},{"id":3352,"title":"Count K-Reducible Numbers Less Than N","slug":"count-k-reducible-numbers-less-than-n","difficulty":3,"accepted":4594,"submitted":16511,"acceptance":0.27823874992429287},{"id":3353,"title":"Minimum Total Operations","slug":"minimum-total-operations","difficulty":1,"accepted":1356,"submitted":2128,"acceptance":0.6372180451127819},{"id":3354,"title":"Make Array Elements Equal to Zero","slug":"make-array-elements-equal-to-zero","difficulty":1,"accepted":136026,"submitted":199161,"acceptance":0.6829951647159835},{"id":3355,"title":"Zero Array Transformation I","slug":"zero-array-transformation-i","difficulty":2,"accepted":155473,"submitted":285496,"acceptance":0.544571552666237},{"id":3356,"title":"Zero Array Transformation II","slug":"zero-array-transformation-ii","difficulty":2,"accepted":133179,"submitted":305540,"acceptance":0.4358807357465471},{"id":3357,"title":"Minimize the Maximum Adjacent Element Difference","slug":"minimize-the-maximum-adjacent-element-difference","difficulty":3,"accepted":3633,"submitted":18497,"acceptance":0.19641022868573282},{"id":3358,"title":"Books with NULL Ratings","slug":"books-with-null-ratings","difficulty":1,"accepted":3634,"submitted":4390,"acceptance":0.8277904328018223},{"id":3359,"title":"Find Sorted Submatrices With Maximum Element at Most K","slug":"find-sorted-submatrices-with-maximum-element-at-most-k","difficulty":3,"accepted":428,"submitted":841,"acceptance":0.5089179548156956},{"id":3360,"title":"Stone Removal Game","slug":"stone-removal-game","difficulty":1,"accepted":33290,"submitted":78477,"acceptance":0.4242007212304242},{"id":3361,"title":"Shift Distance Between Two Strings","slug":"shift-distance-between-two-strings","difficulty":2,"accepted":17383,"submitted":32495,"acceptance":0.5349438375134636},{"id":3362,"title":"Zero Array Transformation III","slug":"zero-array-transformation-iii","difficulty":2,"accepted":76671,"submitted":139841,"acceptance":0.5482726811164108},{"id":3363,"title":"Find the Maximum Number of Fruits Collected","slug":"find-the-maximum-number-of-fruits-collected","difficulty":3,"accepted":71064,"submitted":109292,"acceptance":0.6502214251729312},{"id":3364,"title":"Minimum Positive Sum Subarray ","slug":"minimum-positive-sum-subarray","difficulty":1,"accepted":46333,"submitted":102869,"acceptance":0.45040780021192},{"id":3365,"title":"Rearrange K Substrings to Form Target String","slug":"rearrange-k-substrings-to-form-target-string","difficulty":2,"accepted":27905,"submitted":49197,"acceptance":0.5672093826859361},{"id":3366,"title":"Minimum Array Sum","slug":"minimum-array-sum","difficulty":2,"accepted":16761,"submitted":53728,"acceptance":0.311960244192972},{"id":3367,"title":"Maximize Sum of Weights after Edge Removals","slug":"maximize-sum-of-weights-after-edge-removals","difficulty":3,"accepted":4504,"submitted":14648,"acceptance":0.3074822501365374},{"id":3368,"title":"First Letter Capitalization","slug":"first-letter-capitalization","difficulty":3,"accepted":1246,"submitted":1435,"acceptance":0.8682926829268293},{"id":3369,"title":"Design an Array Statistics Tracker ","slug":"design-an-array-statistics-tracker","difficulty":3,"accepted":1422,"submitted":3995,"acceptance":0.3559449311639549},{"id":3370,"title":"Smallest Number With All Set Bits","slug":"smallest-number-with-all-set-bits","difficulty":1,"accepted":174094,"submitted":216727,"acceptance":0.8032870846733448},{"id":3371,"title":"Identify the Largest Outlier in an Array","slug":"identify-the-largest-outlier-in-an-array","difficulty":2,"accepted":52377,"submitted":144480,"acceptance":0.3625207641196013},{"id":3372,"title":"Maximize the Number of Target Nodes After Connecting Trees I","slug":"maximize-the-number-of-target-nodes-after-connecting-trees-i","difficulty":2,"accepted":84311,"submitted":121383,"acceptance":0.6945865566018306},{"id":3373,"title":"Maximize the Number of Target Nodes After Connecting Trees II","slug":"maximize-the-number-of-target-nodes-after-connecting-trees-ii","difficulty":3,"accepted":69956,"submitted":95684,"acceptance":0.7311149199448184},{"id":3374,"title":"First Letter Capitalization II","slug":"first-letter-capitalization-ii","difficulty":3,"accepted":9740,"submitted":18811,"acceptance":0.5177821487427569},{"id":3375,"title":"Minimum Operations to Make Array Values Equal to K","slug":"minimum-operations-to-make-array-values-equal-to-k","difficulty":1,"accepted":168119,"submitted":229500,"acceptance":0.7325446623093682},{"id":3376,"title":"Minimum Time to Break Locks I","slug":"minimum-time-to-break-locks-i","difficulty":2,"accepted":14146,"submitted":43759,"acceptance":0.32327064146804085},{"id":3377,"title":"Digit Operations to Make Two Integers Equal","slug":"digit-operations-to-make-two-integers-equal","difficulty":2,"accepted":9920,"submitted":32813,"acceptance":0.3023192027550056},{"id":3378,"title":"Count Connected Components in LCM Graph","slug":"count-connected-components-in-lcm-graph","difficulty":3,"accepted":5463,"submitted":17680,"acceptance":0.30899321266968327},{"id":3379,"title":"Transformed Array","slug":"transformed-array","difficulty":1,"accepted":173336,"submitted":245998,"acceptance":0.7046236148261368},{"id":3380,"title":"Maximum Area Rectangle With Point Constraints I","slug":"maximum-area-rectangle-with-point-constraints-i","difficulty":2,"accepted":15852,"submitted":30774,"acceptance":0.5151101579255215},{"id":3381,"title":"Maximum Subarray Sum With Length Divisible by K","slug":"maximum-subarray-sum-with-length-divisible-by-k","difficulty":2,"accepted":86210,"submitted":173757,"acceptance":0.49615267298583654},{"id":3382,"title":"Maximum Area Rectangle With Point Constraints II","slug":"maximum-area-rectangle-with-point-constraints-ii","difficulty":3,"accepted":3150,"submitted":13141,"acceptance":0.23970778479567764},{"id":3383,"title":"Minimum Runes to Add to Cast Spell","slug":"minimum-runes-to-add-to-cast-spell","difficulty":3,"accepted":774,"submitted":1730,"acceptance":0.44739884393063584},{"id":3384,"title":"Team Dominance by Pass Success","slug":"team-dominance-by-pass-success","difficulty":3,"accepted":1447,"submitted":2014,"acceptance":0.7184707050645481},{"id":3385,"title":"Minimum Time to Break Locks II","slug":"minimum-time-to-break-locks-ii","difficulty":3,"accepted":347,"submitted":767,"acceptance":0.45241199478487615},{"id":3386,"title":"Button with Longest Push Time","slug":"button-with-longest-push-time","difficulty":1,"accepted":36336,"submitted":88558,"acceptance":0.4103073691817792},{"id":3387,"title":"Maximize Amount After Two Days of Conversions","slug":"maximize-amount-after-two-days-of-conversions","difficulty":2,"accepted":19076,"submitted":31164,"acceptance":0.6121165447311},{"id":3388,"title":"Count Beautiful Splits in an Array","slug":"count-beautiful-splits-in-an-array","difficulty":2,"accepted":8000,"submitted":42824,"acceptance":0.18681113394358304},{"id":3389,"title":"Minimum Operations to Make Character Frequencies Equal","slug":"minimum-operations-to-make-character-frequencies-equal","difficulty":3,"accepted":4649,"submitted":17633,"acceptance":0.2636533771904951},{"id":3390,"title":"Longest Team Pass Streak","slug":"longest-team-pass-streak","difficulty":3,"accepted":979,"submitted":2420,"acceptance":0.40454545454545454},{"id":3391,"title":"Design a 3D Binary Matrix with Efficient Layer Tracking","slug":"design-a-3d-binary-matrix-with-efficient-layer-tracking","difficulty":2,"accepted":1121,"submitted":1695,"acceptance":0.6613569321533923},{"id":3392,"title":"Count Subarrays of Length Three With a Condition","slug":"count-subarrays-of-length-three-with-a-condition","difficulty":1,"accepted":151457,"submitted":246488,"acceptance":0.6144599331407614},{"id":3393,"title":"Count Paths With the Given XOR Value","slug":"count-paths-with-the-given-xor-value","difficulty":2,"accepted":21312,"submitted":52517,"acceptance":0.40581145152998077},{"id":3394,"title":"Check if Grid can be Cut into Sections","slug":"check-if-grid-can-be-cut-into-sections","difficulty":2,"accepted":113304,"submitted":165984,"acceptance":0.68262001156738},{"id":3395,"title":"Subsequences with a Unique Middle Mode I","slug":"subsequences-with-a-unique-middle-mode-i","difficulty":3,"accepted":2733,"submitted":12934,"acceptance":0.21130354105458482},{"id":3396,"title":"Minimum Number of Operations to Make Elements in Array Distinct","slug":"minimum-number-of-operations-to-make-elements-in-array-distinct","difficulty":1,"accepted":182240,"submitted":255687,"acceptance":0.7127464438942926},{"id":3397,"title":"Maximum Number of Distinct Elements After Operations","slug":"maximum-number-of-distinct-elements-after-operations","difficulty":2,"accepted":103529,"submitted":198171,"acceptance":0.5224225542586958},{"id":3398,"title":"Smallest Substring With Identical Characters I","slug":"smallest-substring-with-identical-characters-i","difficulty":3,"accepted":7523,"submitted":36775,"acceptance":0.20456832087015636},{"id":3399,"title":"Smallest Substring With Identical Characters II","slug":"smallest-substring-with-identical-characters-ii","difficulty":3,"accepted":6980,"submitted":17383,"acceptance":0.4015417361790255},{"id":3400,"title":"Maximum Number of Matching Indices After Right Shifts","slug":"maximum-number-of-matching-indices-after-right-shifts","difficulty":2,"accepted":1642,"submitted":1936,"acceptance":0.8481404958677686},{"id":3401,"title":"Find Circular Gift Exchange Chains","slug":"find-circular-gift-exchange-chains","difficulty":3,"accepted":851,"submitted":1663,"acceptance":0.5117257967528562},{"id":3402,"title":"Minimum Operations to Make Columns Strictly Increasing","slug":"minimum-operations-to-make-columns-strictly-increasing","difficulty":1,"accepted":37883,"submitted":52133,"acceptance":0.7266606563980588},{"id":3403,"title":"Find the Lexicographically Largest String From the Box I","slug":"find-the-lexicographically-largest-string-from-the-box-i","difficulty":2,"accepted":111163,"submitted":271561,"acceptance":0.40934817591627665},{"id":3404,"title":"Count Special Subsequences","slug":"count-special-subsequences","difficulty":2,"accepted":11391,"submitted":38203,"acceptance":0.2981703007617203},{"id":3405,"title":"Count the Number of Arrays with K Matching Adjacent Elements","slug":"count-the-number-of-arrays-with-k-matching-adjacent-elements","difficulty":3,"accepted":68121,"submitted":116894,"acceptance":0.5827587386863312},{"id":3406,"title":"Find the Lexicographically Largest String From the Box II","slug":"find-the-lexicographically-largest-string-from-the-box-ii","difficulty":3,"accepted":652,"submitted":1320,"acceptance":0.49393939393939396},{"id":3407,"title":"Substring Matching Pattern","slug":"substring-matching-pattern","difficulty":1,"accepted":38360,"submitted":134304,"acceptance":0.28562068143912317},{"id":3408,"title":"Design Task Manager","slug":"design-task-manager","difficulty":2,"accepted":102099,"submitted":208283,"acceptance":0.4901936307811967},{"id":3409,"title":"Longest Subsequence With Decreasing Adjacent Difference","slug":"longest-subsequence-with-decreasing-adjacent-difference","difficulty":2,"accepted":7230,"submitted":43081,"acceptance":0.1678234024279845},{"id":3410,"title":"Maximize Subarray Sum After Removing All Occurrences of One Element","slug":"maximize-subarray-sum-after-removing-all-occurrences-of-one-element","difficulty":3,"accepted":4126,"submitted":17904,"acceptance":0.23045129579982127},{"id":3411,"title":"Maximum Subarray With Equal Products","slug":"maximum-subarray-with-equal-products","difficulty":1,"accepted":28991,"submitted":62081,"acceptance":0.4669866786939643},{"id":3412,"title":"Find Mirror Score of a String","slug":"find-mirror-score-of-a-string","difficulty":2,"accepted":25027,"submitted":70458,"acceptance":0.35520451900422945},{"id":3413,"title":"Maximum Coins From K Consecutive Bags","slug":"maximum-coins-from-k-consecutive-bags","difficulty":2,"accepted":8724,"submitted":35575,"acceptance":0.2452283907238229},{"id":3414,"title":"Maximum Score of Non-overlapping Intervals","slug":"maximum-score-of-non-overlapping-intervals","difficulty":3,"accepted":4296,"submitted":13765,"acceptance":0.31209589538685073},{"id":3415,"title":"Find Products with Three Consecutive Digits ","slug":"find-products-with-three-consecutive-digits","difficulty":1,"accepted":2091,"submitted":2591,"acceptance":0.807024314936318},{"id":3416,"title":"Subsequences with a Unique Middle Mode II","slug":"subsequences-with-a-unique-middle-mode-ii","difficulty":3,"accepted":241,"submitted":1693,"acceptance":0.14235085646780862},{"id":3417,"title":"Zigzag Grid Traversal With Skip","slug":"zigzag-grid-traversal-with-skip","difficulty":1,"accepted":38668,"submitted":59420,"acceptance":0.6507573207674183},{"id":3418,"title":"Maximum Amount of Money Robot Can Earn","slug":"maximum-amount-of-money-robot-can-earn","difficulty":2,"accepted":101375,"submitted":211790,"acceptance":0.47865810472637993},{"id":3419,"title":"Minimize the Maximum Edge Weight of Graph","slug":"minimize-the-maximum-edge-weight-of-graph","difficulty":2,"accepted":15316,"submitted":34726,"acceptance":0.44105281345389624},{"id":3420,"title":"Count Non-Decreasing Subarrays After K Operations","slug":"count-non-decreasing-subarrays-after-k-operations","difficulty":3,"accepted":4199,"submitted":17533,"acceptance":0.23949124508070496},{"id":3421,"title":"Find Students Who Improved","slug":"find-students-who-improved","difficulty":2,"accepted":25935,"submitted":53618,"acceptance":0.4836995038979447},{"id":3422,"title":"Minimum Operations to Make Subarray Elements Equal","slug":"minimum-operations-to-make-subarray-elements-equal","difficulty":2,"accepted":716,"submitted":1534,"acceptance":0.4667535853976532},{"id":3423,"title":"Maximum Difference Between Adjacent Elements in a Circular Array","slug":"maximum-difference-between-adjacent-elements-in-a-circular-array","difficulty":1,"accepted":167433,"submitted":221308,"acceptance":0.756560991920762},{"id":3424,"title":"Minimum Cost to Make Arrays Identical","slug":"minimum-cost-to-make-arrays-identical","difficulty":2,"accepted":25261,"submitted":66866,"acceptance":0.37778542158944756},{"id":3425,"title":"Longest Special Path","slug":"longest-special-path","difficulty":3,"accepted":6019,"submitted":26662,"acceptance":0.22575200660115521},{"id":3426,"title":"Manhattan Distances of All Arrangements of Pieces","slug":"manhattan-distances-of-all-arrangements-of-pieces","difficulty":3,"accepted":3921,"submitted":11122,"acceptance":0.3525445063837439},{"id":3427,"title":"Sum of Variable Length Subarrays","slug":"sum-of-variable-length-subarrays","difficulty":1,"accepted":57318,"submitted":67007,"acceptance":0.855403166833316},{"id":3428,"title":"Maximum and Minimum Sums of at Most Size K Subsequences","slug":"maximum-and-minimum-sums-of-at-most-size-k-subsequences","difficulty":2,"accepted":12876,"submitted":59216,"acceptance":0.21744123209943259},{"id":3429,"title":"Paint House IV","slug":"paint-house-iv","difficulty":2,"accepted":10935,"submitted":24267,"acceptance":0.45061194214365186},{"id":3430,"title":"Maximum and Minimum Sums of at Most Size K Subarrays","slug":"maximum-and-minimum-sums-of-at-most-size-k-subarrays","difficulty":3,"accepted":4415,"submitted":17400,"acceptance":0.25373563218390804},{"id":3431,"title":"Minimum Unlocked Indices to Sort Nums","slug":"minimum-unlocked-indices-to-sort-nums","difficulty":2,"accepted":545,"submitted":935,"acceptance":0.5828877005347594},{"id":3432,"title":"Count Partitions with Even Sum Difference","slug":"count-partitions-with-even-sum-difference","difficulty":1,"accepted":171483,"submitted":201289,"acceptance":0.8519243475798479},{"id":3433,"title":"Count Mentions Per User","slug":"count-mentions-per-user","difficulty":2,"accepted":85226,"submitted":167844,"acceptance":0.5077691189437812},{"id":3434,"title":"Maximum Frequency After Subarray Operation","slug":"maximum-frequency-after-subarray-operation","difficulty":2,"accepted":25306,"submitted":81504,"acceptance":0.3104878288182175},{"id":3435,"title":"Frequencies of Shortest Supersequences","slug":"frequencies-of-shortest-supersequences","difficulty":3,"accepted":2939,"submitted":13205,"acceptance":0.22256720939038244},{"id":3436,"title":"Find Valid Emails","slug":"find-valid-emails","difficulty":1,"accepted":28248,"submitted":64059,"acceptance":0.44096848218048984},{"id":3437,"title":"Permutations III","slug":"permutations-iii","difficulty":2,"accepted":3134,"submitted":3602,"acceptance":0.8700721821210439},{"id":3438,"title":"Find Valid Pair of Adjacent Digits in String","slug":"find-valid-pair-of-adjacent-digits-in-string","difficulty":1,"accepted":47246,"submitted":77776,"acceptance":0.6074624562847151},{"id":3439,"title":"Reschedule Meetings for Maximum Free Time I","slug":"reschedule-meetings-for-maximum-free-time-i","difficulty":2,"accepted":109035,"submitted":202124,"acceptance":0.5394460826027587},{"id":3440,"title":"Reschedule Meetings for Maximum Free Time II","slug":"reschedule-meetings-for-maximum-free-time-ii","difficulty":2,"accepted":84506,"submitted":139982,"acceptance":0.6036919032447029},{"id":3441,"title":"Minimum Cost Good Caption","slug":"minimum-cost-good-caption","difficulty":3,"accepted":3837,"submitted":18480,"acceptance":0.20762987012987014},{"id":3442,"title":"Maximum Difference Between Even and Odd Frequency I","slug":"maximum-difference-between-even-and-odd-frequency-i","difficulty":1,"accepted":181496,"submitted":298863,"acceptance":0.6072882892830495},{"id":3443,"title":"Maximum Manhattan Distance After K Changes","slug":"maximum-manhattan-distance-after-k-changes","difficulty":2,"accepted":101007,"submitted":186514,"acceptance":0.541551840612501},{"id":3444,"title":"Minimum Increments for Target Multiples in an Array","slug":"minimum-increments-for-target-multiples-in-an-array","difficulty":3,"accepted":6666,"submitted":24215,"acceptance":0.27528391492876314},{"id":3445,"title":"Maximum Difference Between Even and Odd Frequency II","slug":"maximum-difference-between-even-and-odd-frequency-ii","difficulty":3,"accepted":58792,"submitted":120864,"acceptance":0.48643102991792425},{"id":3446,"title":"Sort Matrix by Diagonals","slug":"sort-matrix-by-diagonals","difficulty":2,"accepted":134434,"submitted":158799,"acceptance":0.8465670438730722},{"id":3447,"title":"Assign Elements to Groups with Constraints","slug":"assign-elements-to-groups-with-constraints","difficulty":2,"accepted":20581,"submitted":76544,"acceptance":0.26887803093645485},{"id":3448,"title":"Count Substrings Divisible By Last Digit","slug":"count-substrings-divisible-by-last-digit","difficulty":3,"accepted":6163,"submitted":26612,"acceptance":0.23158725387043438},{"id":3449,"title":"Maximize the Minimum Game Score","slug":"maximize-the-minimum-game-score","difficulty":3,"accepted":4269,"submitted":16260,"acceptance":0.2625461254612546},{"id":3450,"title":"Maximum Students on a Single Bench","slug":"maximum-students-on-a-single-bench","difficulty":1,"accepted":2243,"submitted":2548,"acceptance":0.880298273155416},{"id":3451,"title":"Find Invalid IP Addresses","slug":"find-invalid-ip-addresses","difficulty":3,"accepted":11487,"submitted":22132,"acceptance":0.5190222302548346},{"id":3452,"title":"Sum of Good Numbers","slug":"sum-of-good-numbers","difficulty":1,"accepted":52190,"submitted":74958,"acceptance":0.6962565703460605},{"id":3453,"title":"Separate Squares I","slug":"separate-squares-i","difficulty":2,"accepted":125962,"submitted":217326,"acceptance":0.5795993116332147},{"id":3454,"title":"Separate Squares II","slug":"separate-squares-ii","difficulty":3,"accepted":60779,"submitted":101720,"acceptance":0.5975127801808887},{"id":3455,"title":"Shortest Matching Substring","slug":"shortest-matching-substring","difficulty":3,"accepted":6464,"submitted":26915,"acceptance":0.240163477614713},{"id":3456,"title":"Find Special Substring of Length K","slug":"find-special-substring-of-length-k","difficulty":1,"accepted":41887,"submitted":119216,"acceptance":0.35135384512146023},{"id":3457,"title":"Eat Pizzas!","slug":"eat-pizzas","difficulty":2,"accepted":24963,"submitted":75162,"acceptance":0.3321226151512732},{"id":3458,"title":"Select K Disjoint Special Substrings","slug":"select-k-disjoint-special-substrings","difficulty":2,"accepted":11353,"submitted":59035,"acceptance":0.19230964681968324},{"id":3459,"title":"Length of Longest V-Shaped Diagonal Segment","slug":"length-of-longest-v-shaped-diagonal-segment","difficulty":3,"accepted":73897,"submitted":131382,"acceptance":0.562459088764062},{"id":3460,"title":"Longest Common Prefix After at Most One Removal","slug":"longest-common-prefix-after-at-most-one-removal","difficulty":2,"accepted":1200,"submitted":1781,"acceptance":0.673778775968557},{"id":3461,"title":"Check If Digits Are Equal in String After Operations I","slug":"check-if-digits-are-equal-in-string-after-operations-i","difficulty":1,"accepted":173546,"submitted":210412,"acceptance":0.8247913617094083},{"id":3462,"title":"Maximum Sum With at Most K Elements","slug":"maximum-sum-with-at-most-k-elements","difficulty":2,"accepted":39453,"submitted":65042,"acceptance":0.6065772885212631},{"id":3463,"title":"Check If Digits Are Equal in String After Operations II","slug":"check-if-digits-are-equal-in-string-after-operations-ii","difficulty":3,"accepted":13731,"submitted":95608,"acceptance":0.14361768889632667},{"id":3464,"title":"Maximize the Distance Between Points on a Square","slug":"maximize-the-distance-between-points-on-a-square","difficulty":3,"accepted":4455,"submitted":18792,"acceptance":0.23706896551724138},{"id":3465,"title":"Find Products with Valid Serial Numbers","slug":"find-products-with-valid-serial-numbers","difficulty":1,"accepted":20073,"submitted":65988,"acceptance":0.3041916712129478},{"id":3466,"title":"Maximum Coin Collection ","slug":"maximum-coin-collection","difficulty":2,"accepted":2660,"submitted":5033,"acceptance":0.5285118219749653},{"id":3467,"title":"Transform Array by Parity","slug":"transform-array-by-parity","difficulty":1,"accepted":94124,"submitted":104877,"acceptance":0.8974703700525377},{"id":3468,"title":"Find the Number of Copy Arrays","slug":"find-the-number-of-copy-arrays","difficulty":2,"accepted":21278,"submitted":45353,"acceptance":0.4691641126276101},{"id":3469,"title":"Find Minimum Cost to Remove Array Elements","slug":"find-minimum-cost-to-remove-array-elements","difficulty":2,"accepted":12633,"submitted":58752,"acceptance":0.21502246732026145},{"id":3470,"title":"Permutations IV","slug":"permutations-iv","difficulty":3,"accepted":4366,"submitted":12740,"acceptance":0.34270015698587125},{"id":3471,"title":"Find the Largest Almost Missing Integer","slug":"find-the-largest-almost-missing-integer","difficulty":1,"accepted":36127,"submitted":97144,"acceptance":0.3718912130445524},{"id":3472,"title":"Longest Palindromic Subsequence After at Most K Operations","slug":"longest-palindromic-subsequence-after-at-most-k-operations","difficulty":2,"accepted":15412,"submitted":40983,"acceptance":0.37605836566381184},{"id":3473,"title":"Sum of K Subarrays With Length at Least M","slug":"sum-of-k-subarrays-with-length-at-least-m","difficulty":2,"accepted":8057,"submitted":30962,"acceptance":0.2602222078677088},{"id":3474,"title":"Lexicographically Smallest Generated String","slug":"lexicographically-smallest-generated-string","difficulty":3,"accepted":63549,"submitted":118576,"acceptance":0.5359347591418162},{"id":3475,"title":"DNA Pattern Recognition ","slug":"dna-pattern-recognition","difficulty":2,"accepted":23059,"submitted":27174,"acceptance":0.8485684845808493},{"id":3476,"title":"Maximize Profit from Task Assignment","slug":"maximize-profit-from-task-assignment","difficulty":2,"accepted":1037,"submitted":1575,"acceptance":0.6584126984126984},{"id":3477,"title":"Fruits Into Baskets II","slug":"fruits-into-baskets-ii","difficulty":1,"accepted":199750,"submitted":284407,"acceptance":0.7023385500356883},{"id":3478,"title":"Choose K Elements With Maximum Sum","slug":"choose-k-elements-with-maximum-sum","difficulty":2,"accepted":20140,"submitted":60037,"acceptance":0.3354597997901294},{"id":3479,"title":"Fruits Into Baskets III","slug":"fruits-into-baskets-iii","difficulty":2,"accepted":87020,"submitted":221977,"acceptance":0.39202259693571856},{"id":3480,"title":"Maximize Subarrays After Removing One Conflicting Pair","slug":"maximize-subarrays-after-removing-one-conflicting-pair","difficulty":3,"accepted":57540,"submitted":89077,"acceptance":0.6459579914006983},{"id":3481,"title":"Apply Substitutions","slug":"apply-substitutions","difficulty":2,"accepted":14782,"submitted":19097,"acceptance":0.774048279834529},{"id":3482,"title":"Analyze Organization Hierarchy","slug":"analyze-organization-hierarchy","difficulty":3,"accepted":8943,"submitted":14925,"acceptance":0.5991959798994975},{"id":3483,"title":"Unique 3-Digit Even Numbers","slug":"unique-3-digit-even-numbers","difficulty":1,"accepted":45817,"submitted":65907,"acceptance":0.6951765366349553},{"id":3484,"title":"Design Spreadsheet","slug":"design-spreadsheet","difficulty":2,"accepted":119647,"submitted":161222,"acceptance":0.7421257644738312},{"id":3485,"title":"Longest Common Prefix of K Strings After Removal","slug":"longest-common-prefix-of-k-strings-after-removal","difficulty":3,"accepted":6470,"submitted":27237,"acceptance":0.23754451665014503},{"id":3486,"title":"Longest Special Path II","slug":"longest-special-path-ii","difficulty":3,"accepted":2562,"submitted":13501,"acceptance":0.1897637212058366},{"id":3487,"title":"Maximum Unique Subarray Sum After Deletion","slug":"maximum-unique-subarray-sum-after-deletion","difficulty":1,"accepted":157745,"submitted":389760,"acceptance":0.4047234195402299},{"id":3488,"title":"Closest Equal Element Queries","slug":"closest-equal-element-queries","difficulty":2,"accepted":21845,"submitted":66296,"acceptance":0.3295070592494268},{"id":3489,"title":"Zero Array Transformation IV","slug":"zero-array-transformation-iv","difficulty":2,"accepted":11660,"submitted":37498,"acceptance":0.3109499173289242},{"id":3490,"title":"Count Beautiful Numbers","slug":"count-beautiful-numbers","difficulty":3,"accepted":5465,"submitted":23179,"acceptance":0.23577376073169679},{"id":3491,"title":"Phone Number Prefix","slug":"phone-number-prefix","difficulty":1,"accepted":1867,"submitted":2649,"acceptance":0.704794261985655},{"id":3492,"title":"Maximum Containers on a Ship","slug":"maximum-containers-on-a-ship","difficulty":1,"accepted":50351,"submitted":66922,"acceptance":0.752383371686441},{"id":3493,"title":"Properties Graph","slug":"properties-graph","difficulty":2,"accepted":25411,"submitted":52242,"acceptance":0.4864094023965392},{"id":3494,"title":"Find the Minimum Amount of Time to Brew Potions","slug":"find-the-minimum-amount-of-time-to-brew-potions","difficulty":2,"accepted":87166,"submitted":139104,"acceptance":0.6266246836899011},{"id":3495,"title":"Minimum Operations to Make Array Elements Zero","slug":"minimum-operations-to-make-array-elements-zero","difficulty":3,"accepted":79292,"submitted":131340,"acceptance":0.6037155474341404},{"id":3496,"title":"Maximize Score After Pair Deletions","slug":"maximize-score-after-pair-deletions","difficulty":2,"accepted":1171,"submitted":2228,"acceptance":0.5255834829443446},{"id":3497,"title":"Analyze Subscription Conversion ","slug":"analyze-subscription-conversion","difficulty":2,"accepted":22010,"submitted":29695,"acceptance":0.7412022225963967},{"id":3498,"title":"Reverse Degree of a String","slug":"reverse-degree-of-a-string","difficulty":1,"accepted":66265,"submitted":74749,"acceptance":0.886500153848212},{"id":3499,"title":"Maximize Active Section with Trade I","slug":"maximize-active-section-with-trade-i","difficulty":2,"accepted":14021,"submitted":44695,"acceptance":0.31370399373531715},{"id":3500,"title":"Minimum Cost to Divide Array Into Subarrays","slug":"minimum-cost-to-divide-array-into-subarrays","difficulty":3,"accepted":5020,"submitted":18003,"acceptance":0.27884241515303004},{"id":3501,"title":"Maximize Active Section with Trade II","slug":"maximize-active-section-with-trade-ii","difficulty":3,"accepted":1802,"submitted":8664,"acceptance":0.2079870729455217},{"id":3502,"title":"Minimum Cost to Reach Every Position","slug":"minimum-cost-to-reach-every-position","difficulty":1,"accepted":40540,"submitted":48690,"acceptance":0.8326144998973095},{"id":3503,"title":"Longest Palindrome After Substring Concatenation I","slug":"longest-palindrome-after-substring-concatenation-i","difficulty":2,"accepted":22209,"submitted":50682,"acceptance":0.4382029122765479},{"id":3504,"title":"Longest Palindrome After Substring Concatenation II","slug":"longest-palindrome-after-substring-concatenation-ii","difficulty":3,"accepted":6624,"submitted":37065,"acceptance":0.17871307163091865},{"id":3505,"title":"Minimum Operations to Make Elements Within K Subarrays Equal","slug":"minimum-operations-to-make-elements-within-k-subarrays-equal","difficulty":3,"accepted":4348,"submitted":15494,"acceptance":0.2806247579708274},{"id":3506,"title":"Find Time Required to Eliminate Bacterial Strains","slug":"find-time-required-to-eliminate-bacterial-strains","difficulty":3,"accepted":518,"submitted":848,"acceptance":0.6108490566037735},{"id":3507,"title":"Minimum Pair Removal to Sort Array I","slug":"minimum-pair-removal-to-sort-array-i","difficulty":1,"accepted":146145,"submitted":224063,"acceptance":0.6522495905169529},{"id":3508,"title":"Implement Router","slug":"implement-router","difficulty":2,"accepted":89259,"submitted":228352,"acceptance":0.3908833730381166},{"id":3509,"title":"Maximum Product of Subsequences With an Alternating Sum Equal to K","slug":"maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k","difficulty":3,"accepted":5999,"submitted":46043,"acceptance":0.13029124948417783},{"id":3510,"title":"Minimum Pair Removal to Sort Array II","slug":"minimum-pair-removal-to-sort-array-ii","difficulty":3,"accepted":65516,"submitted":167665,"acceptance":0.3907553753019414},{"id":3511,"title":"Make a Positive Array","slug":"make-a-positive-array","difficulty":2,"accepted":720,"submitted":2038,"acceptance":0.35328753680078506},{"id":3512,"title":"Minimum Operations to Make Array Sum Divisible by K","slug":"minimum-operations-to-make-array-sum-divisible-by-k","difficulty":1,"accepted":188149,"submitted":203735,"acceptance":0.9234986624782192},{"id":3513,"title":"Number of Unique XOR Triplets I","slug":"number-of-unique-xor-triplets-i","difficulty":2,"accepted":16121,"submitted":60616,"acceptance":0.26595288372706877},{"id":3514,"title":"Number of Unique XOR Triplets II","slug":"number-of-unique-xor-triplets-ii","difficulty":2,"accepted":14449,"submitted":44525,"acceptance":0.3245143177989893},{"id":3515,"title":"Shortest Path in a Weighted Tree","slug":"shortest-path-in-a-weighted-tree","difficulty":3,"accepted":7186,"submitted":16990,"acceptance":0.4229546792230724},{"id":3516,"title":"Find Closest Person","slug":"find-closest-person","difficulty":1,"accepted":215381,"submitted":242137,"acceptance":0.8895005719902369},{"id":3517,"title":"Smallest Palindromic Rearrangement I","slug":"smallest-palindromic-rearrangement-i","difficulty":2,"accepted":35182,"submitted":55331,"acceptance":0.6358460898953571},{"id":3518,"title":"Smallest Palindromic Rearrangement II","slug":"smallest-palindromic-rearrangement-ii","difficulty":3,"accepted":6086,"submitted":42130,"acceptance":0.14445763114170426},{"id":3519,"title":"Count Numbers with Non-Decreasing Digits ","slug":"count-numbers-with-non-decreasing-digits","difficulty":3,"accepted":6803,"submitted":17587,"acceptance":0.38681981008699606},{"id":3520,"title":"Minimum Threshold for Inversion Pairs Count","slug":"minimum-threshold-for-inversion-pairs-count","difficulty":2,"accepted":671,"submitted":1226,"acceptance":0.5473083197389886},{"id":3521,"title":"Find Product Recommendation Pairs","slug":"find-product-recommendation-pairs","difficulty":2,"accepted":14898,"submitted":24197,"acceptance":0.6156961606810761},{"id":3522,"title":"Calculate Score After Performing Instructions","slug":"calculate-score-after-performing-instructions","difficulty":2,"accepted":40404,"submitted":70889,"acceptance":0.5699614890885751},{"id":3523,"title":"Make Array Non-decreasing","slug":"make-array-non-decreasing","difficulty":2,"accepted":32821,"submitted":57544,"acceptance":0.5703635478937856},{"id":3524,"title":"Find X Value of Array I","slug":"find-x-value-of-array-i","difficulty":2,"accepted":11353,"submitted":30409,"acceptance":0.37334341806701965},{"id":3525,"title":"Find X Value of Array II","slug":"find-x-value-of-array-ii","difficulty":3,"accepted":3563,"submitted":11516,"acceptance":0.30939562348037514},{"id":3526,"title":"Range XOR Queries with Subarray Reversals","slug":"range-xor-queries-with-subarray-reversals","difficulty":3,"accepted":395,"submitted":624,"acceptance":0.6330128205128205},{"id":3527,"title":"Find the Most Common Response","slug":"find-the-most-common-response","difficulty":2,"accepted":37415,"submitted":49922,"acceptance":0.7494691719081767},{"id":3528,"title":"Unit Conversion I","slug":"unit-conversion-i","difficulty":2,"accepted":19872,"submitted":36707,"acceptance":0.5413681314190754},{"id":3529,"title":"Count Cells in Overlapping Horizontal and Vertical Substrings","slug":"count-cells-in-overlapping-horizontal-and-vertical-substrings","difficulty":2,"accepted":7539,"submitted":27758,"acceptance":0.27159737733266087},{"id":3530,"title":"Maximum Profit from Valid Topological Order in DAG","slug":"maximum-profit-from-valid-topological-order-in-dag","difficulty":3,"accepted":6002,"submitted":19874,"acceptance":0.30200261648384824},{"id":3531,"title":"Count Covered Buildings","slug":"count-covered-buildings","difficulty":2,"accepted":104019,"submitted":176922,"acceptance":0.5879370570081731},{"id":3532,"title":"Path Existence Queries in a Graph I","slug":"path-existence-queries-in-a-graph-i","difficulty":2,"accepted":22146,"submitted":40017,"acceptance":0.553414798710548},{"id":3533,"title":"Concatenated Divisibility","slug":"concatenated-divisibility","difficulty":3,"accepted":6182,"submitted":20135,"acceptance":0.30702756394338215},{"id":3534,"title":"Path Existence Queries in a Graph II","slug":"path-existence-queries-in-a-graph-ii","difficulty":3,"accepted":4312,"submitted":16305,"acceptance":0.264458754983134},{"id":3535,"title":"Unit Conversion II","slug":"unit-conversion-ii","difficulty":2,"accepted":594,"submitted":897,"acceptance":0.6622073578595318},{"id":3536,"title":"Maximum Product of Two Digits","slug":"maximum-product-of-two-digits","difficulty":1,"accepted":48708,"submitted":70297,"acceptance":0.692888743474117},{"id":3537,"title":"Fill a Special Grid","slug":"fill-a-special-grid","difficulty":2,"accepted":21028,"submitted":29686,"acceptance":0.7083473691302298},{"id":3538,"title":"Merge Operations for Minimum Travel Time","slug":"merge-operations-for-minimum-travel-time","difficulty":3,"accepted":4970,"submitted":16120,"acceptance":0.30831265508684863},{"id":3539,"title":"Find Sum of Array Product of Magical Sequences","slug":"find-sum-of-array-product-of-magical-sequences","difficulty":3,"accepted":52920,"submitted":85634,"acceptance":0.6179788401803022},{"id":3540,"title":"Minimum Time to Visit All Houses","slug":"minimum-time-to-visit-all-houses","difficulty":2,"accepted":1208,"submitted":1745,"acceptance":0.6922636103151862},{"id":3541,"title":"Find Most Frequent Vowel and Consonant","slug":"find-most-frequent-vowel-and-consonant","difficulty":1,"accepted":208473,"submitted":233377,"acceptance":0.8932885417157647},{"id":3542,"title":"Minimum Operations to Convert All Elements to Zero","slug":"minimum-operations-to-convert-all-elements-to-zero","difficulty":2,"accepted":87782,"submitted":165711,"acceptance":0.5297294687739498},{"id":3543,"title":"Maximum Weighted K-Edge Path","slug":"maximum-weighted-k-edge-path","difficulty":2,"accepted":9585,"submitted":47948,"acceptance":0.19990406273462918},{"id":3544,"title":"Subtree Inversion Sum","slug":"subtree-inversion-sum","difficulty":3,"accepted":4333,"submitted":9842,"acceptance":0.4402560455192034},{"id":3545,"title":"Minimum Deletions for At Most K Distinct Characters","slug":"minimum-deletions-for-at-most-k-distinct-characters","difficulty":1,"accepted":42602,"submitted":58282,"acceptance":0.730963247657939},{"id":3546,"title":"Equal Sum Grid Partition I","slug":"equal-sum-grid-partition-i","difficulty":2,"accepted":128151,"submitted":242567,"acceptance":0.5283117654091447},{"id":3547,"title":"Maximum Sum of Edge Values in a Graph","slug":"maximum-sum-of-edge-values-in-a-graph","difficulty":3,"accepted":6776,"submitted":18698,"acceptance":0.36239169964702106},{"id":3548,"title":"Equal Sum Grid Partition II","slug":"equal-sum-grid-partition-ii","difficulty":3,"accepted":67679,"submitted":171616,"acceptance":0.3943629964572068},{"id":3549,"title":"Multiply Two Polynomials","slug":"multiply-two-polynomials","difficulty":3,"accepted":368,"submitted":617,"acceptance":0.5964343598055105},{"id":3550,"title":"Smallest Index With Digit Sum Equal to Index","slug":"smallest-index-with-digit-sum-equal-to-index","difficulty":1,"accepted":54613,"submitted":68191,"acceptance":0.8008828144476544},{"id":3551,"title":"Minimum Swaps to Sort by Digit Sum","slug":"minimum-swaps-to-sort-by-digit-sum","difficulty":2,"accepted":25811,"submitted":51156,"acceptance":0.504554695441395},{"id":3552,"title":"Grid Teleportation Traversal","slug":"grid-teleportation-traversal","difficulty":2,"accepted":13666,"submitted":58151,"acceptance":0.2350088562535468},{"id":3553,"title":"Minimum Weighted Subgraph With the Required Paths II","slug":"minimum-weighted-subgraph-with-the-required-paths-ii","difficulty":3,"accepted":4611,"submitted":9250,"acceptance":0.49848648648648647},{"id":3554,"title":"Find Category Recommendation Pairs","slug":"find-category-recommendation-pairs","difficulty":3,"accepted":9824,"submitted":15563,"acceptance":0.6312407633489687},{"id":3555,"title":"Smallest Subarray to Sort in Every Sliding Window","slug":"smallest-subarray-to-sort-in-every-sliding-window","difficulty":2,"accepted":746,"submitted":1262,"acceptance":0.5911251980982567},{"id":3556,"title":"Sum of Largest Prime Substrings","slug":"sum-of-largest-prime-substrings","difficulty":2,"accepted":24767,"submitted":65346,"acceptance":0.37901325253267226},{"id":3557,"title":"Find Maximum Number of Non Intersecting Substrings","slug":"find-maximum-number-of-non-intersecting-substrings","difficulty":2,"accepted":16198,"submitted":52967,"acceptance":0.30581305341061416},{"id":3558,"title":"Number of Ways to Assign Edge Weights I","slug":"number-of-ways-to-assign-edge-weights-i","difficulty":2,"accepted":13686,"submitted":25736,"acceptance":0.5317842710599938},{"id":3559,"title":"Number of Ways to Assign Edge Weights II","slug":"number-of-ways-to-assign-edge-weights-ii","difficulty":3,"accepted":6838,"submitted":11502,"acceptance":0.5945053034254912},{"id":3560,"title":"Find Minimum Log Transportation Cost","slug":"find-minimum-log-transportation-cost","difficulty":1,"accepted":35571,"submitted":84212,"acceptance":0.42239823303092194},{"id":3561,"title":"Resulting String After Adjacent Removals","slug":"resulting-string-after-adjacent-removals","difficulty":2,"accepted":32645,"submitted":57553,"acceptance":0.5672163049710701},{"id":3562,"title":"Maximum Profit from Trading Stocks with Discounts","slug":"maximum-profit-from-trading-stocks-with-discounts","difficulty":3,"accepted":50254,"submitted":88552,"acceptance":0.5675083566717861},{"id":3563,"title":"Lexicographically Smallest String After Adjacent Removals","slug":"lexicographically-smallest-string-after-adjacent-removals","difficulty":3,"accepted":4045,"submitted":23268,"acceptance":0.17384390579336428},{"id":3564,"title":"Seasonal Sales Analysis","slug":"seasonal-sales-analysis","difficulty":2,"accepted":14044,"submitted":22700,"acceptance":0.6186784140969163},{"id":3565,"title":"Sequential Grid Path Cover","slug":"sequential-grid-path-cover","difficulty":2,"accepted":659,"submitted":1094,"acceptance":0.6023765996343693},{"id":3566,"title":"Partition Array into Two Equal Product Subsets","slug":"partition-array-into-two-equal-product-subsets","difficulty":2,"accepted":34581,"submitted":98511,"acceptance":0.3510369400371532},{"id":3567,"title":"Minimum Absolute Difference in Sliding Submatrix","slug":"minimum-absolute-difference-in-sliding-submatrix","difficulty":2,"accepted":93675,"submitted":118831,"acceptance":0.7883043986838452},{"id":3568,"title":"Minimum Moves to Clean the Classroom","slug":"minimum-moves-to-clean-the-classroom","difficulty":2,"accepted":9082,"submitted":34118,"acceptance":0.26619379799519316},{"id":3569,"title":"Maximize Count of Distinct Primes After Split","slug":"maximize-count-of-distinct-primes-after-split","difficulty":3,"accepted":2888,"submitted":15573,"acceptance":0.18544917485391382},{"id":3570,"title":"Find Books with No Available Copies","slug":"find-books-with-no-available-copies","difficulty":1,"accepted":20495,"submitted":38123,"acceptance":0.5376019725624951},{"id":3571,"title":"Find the Shortest Superstring II","slug":"find-the-shortest-superstring-ii","difficulty":1,"accepted":759,"submitted":1560,"acceptance":0.48653846153846153},{"id":3572,"title":"Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values","slug":"maximize-ysum-by-picking-a-triplet-of-distinct-xvalues","difficulty":2,"accepted":30910,"submitted":48820,"acceptance":0.6331421548545678},{"id":3573,"title":"Best Time to Buy and Sell Stock V","slug":"best-time-to-buy-and-sell-stock-v","difficulty":2,"accepted":79900,"submitted":131614,"acceptance":0.6070782743477138},{"id":3574,"title":"Maximize Subarray GCD Score","slug":"maximize-subarray-gcd-score","difficulty":3,"accepted":6194,"submitted":24900,"acceptance":0.2487550200803213},{"id":3575,"title":"Maximum Good Subtree Score","slug":"maximum-good-subtree-score","difficulty":3,"accepted":4746,"submitted":10450,"acceptance":0.4541626794258373},{"id":3576,"title":"Transform Array to All Equal Elements","slug":"transform-array-to-all-equal-elements","difficulty":2,"accepted":30598,"submitted":92337,"acceptance":0.3313731223669818},{"id":3577,"title":"Count the Number of Computer Unlocking Permutations","slug":"count-the-number-of-computer-unlocking-permutations","difficulty":2,"accepted":93637,"submitted":158771,"acceptance":0.589761354403512},{"id":3578,"title":"Count Partitions With Max-Min Difference at Most K","slug":"count-partitions-with-max-min-difference-at-most-k","difficulty":2,"accepted":65264,"submitted":111134,"acceptance":0.5872550254647543},{"id":3579,"title":"Minimum Steps to Convert String with Operations","slug":"minimum-steps-to-convert-string-with-operations","difficulty":3,"accepted":4346,"submitted":10043,"acceptance":0.43273922134820275},{"id":3580,"title":"Find Consistently Improving Employees","slug":"find-consistently-improving-employees","difficulty":2,"accepted":11918,"submitted":21338,"acceptance":0.5585340706720405},{"id":3581,"title":"Count Odd Letters from Number","slug":"count-odd-letters-from-number","difficulty":1,"accepted":1373,"submitted":1612,"acceptance":0.8517369727047146},{"id":3582,"title":"Generate Tag for Video Caption","slug":"generate-tag-for-video-caption","difficulty":1,"accepted":43357,"submitted":133841,"acceptance":0.32394408290434173},{"id":3583,"title":"Count Special Triplets","slug":"count-special-triplets","difficulty":2,"accepted":117407,"submitted":249249,"acceptance":0.4710430132116879},{"id":3584,"title":"Maximum Product of First and Last Elements of a Subsequence","slug":"maximum-product-of-first-and-last-elements-of-a-subsequence","difficulty":2,"accepted":19991,"submitted":63712,"acceptance":0.31377134605725765},{"id":3585,"title":"Find Weighted Median Node in Tree","slug":"find-weighted-median-node-in-tree","difficulty":3,"accepted":4552,"submitted":17203,"acceptance":0.2646050107539383},{"id":3586,"title":"Find COVID Recovery Patients","slug":"find-covid-recovery-patients","difficulty":2,"accepted":12247,"submitted":29378,"acceptance":0.4168765743073048},{"id":3587,"title":"Minimum Adjacent Swaps to Alternate Parity","slug":"minimum-adjacent-swaps-to-alternate-parity","difficulty":2,"accepted":20725,"submitted":49008,"acceptance":0.42289014038524325},{"id":3588,"title":"Find Maximum Area of a Triangle","slug":"find-maximum-area-of-a-triangle","difficulty":2,"accepted":12052,"submitted":41122,"acceptance":0.2930791303924906},{"id":3589,"title":"Count Prime-Gap Balanced Subarrays","slug":"count-prime-gap-balanced-subarrays","difficulty":2,"accepted":7266,"submitted":31954,"acceptance":0.22738937222256994},{"id":3590,"title":"Kth Smallest Path XOR Sum","slug":"kth-smallest-path-xor-sum","difficulty":3,"accepted":2773,"submitted":9417,"acceptance":0.29446745247955824},{"id":3591,"title":"Check if Any Element Has Prime Frequency","slug":"check-if-any-element-has-prime-frequency","difficulty":1,"accepted":53571,"submitted":85724,"acceptance":0.6249241752601372},{"id":3592,"title":"Inverse Coin Change","slug":"inverse-coin-change","difficulty":2,"accepted":21739,"submitted":42003,"acceptance":0.5175582696474061},{"id":3593,"title":"Minimum Increments to Equalize Leaf Paths","slug":"minimum-increments-to-equalize-leaf-paths","difficulty":2,"accepted":16098,"submitted":39043,"acceptance":0.41231462746202907},{"id":3594,"title":"Minimum Time to Transport All Individuals","slug":"minimum-time-to-transport-all-individuals","difficulty":3,"accepted":3430,"submitted":12231,"acceptance":0.2804349603466601},{"id":3595,"title":"Once Twice","slug":"once-twice","difficulty":2,"accepted":660,"submitted":869,"acceptance":0.759493670886076},{"id":3596,"title":"Minimum Cost Path with Alternating Directions I","slug":"minimum-cost-path-with-alternating-directions-i","difficulty":2,"accepted":454,"submitted":645,"acceptance":0.703875968992248},{"id":3597,"title":"Partition String ","slug":"partition-string","difficulty":2,"accepted":38853,"submitted":65965,"acceptance":0.588994163571591},{"id":3598,"title":"Longest Common Prefix Between Adjacent Strings After Removals","slug":"longest-common-prefix-between-adjacent-strings-after-removals","difficulty":2,"accepted":19176,"submitted":59089,"acceptance":0.32452740780856},{"id":3599,"title":"Partition Array to Minimize XOR","slug":"partition-array-to-minimize-xor","difficulty":2,"accepted":14348,"submitted":34772,"acceptance":0.41263085240998504},{"id":3600,"title":"Maximize Spanning Tree Stability with Upgrades","slug":"maximize-spanning-tree-stability-with-upgrades","difficulty":3,"accepted":68956,"submitted":103767,"acceptance":0.6645272581842011},{"id":3601,"title":"Find Drivers with Improved Fuel Efficiency","slug":"find-drivers-with-improved-fuel-efficiency","difficulty":2,"accepted":9738,"submitted":20984,"acceptance":0.46406786122760196},{"id":3602,"title":"Hexadecimal and Hexatrigesimal Conversion","slug":"hexadecimal-and-hexatrigesimal-conversion","difficulty":1,"accepted":30528,"submitted":37781,"acceptance":0.8080251978507715},{"id":3603,"title":"Minimum Cost Path with Alternating Directions II","slug":"minimum-cost-path-with-alternating-directions-ii","difficulty":2,"accepted":19063,"submitted":42630,"acceptance":0.44717335209946046},{"id":3604,"title":"Minimum Time to Reach Destination in Directed Graph","slug":"minimum-time-to-reach-destination-in-directed-graph","difficulty":2,"accepted":17394,"submitted":38143,"acceptance":0.45602076396717617},{"id":3605,"title":"Minimum Stability Factor of Array","slug":"minimum-stability-factor-of-array","difficulty":3,"accepted":4072,"submitted":19899,"acceptance":0.20463339866324942},{"id":3606,"title":"Coupon Code Validator","slug":"coupon-code-validator","difficulty":1,"accepted":125074,"submitted":192559,"acceptance":0.6495359863730078},{"id":3607,"title":"Power Grid Maintenance","slug":"power-grid-maintenance","difficulty":2,"accepted":93151,"submitted":165690,"acceptance":0.5622004949001147},{"id":3608,"title":"Minimum Time for K Connected Components","slug":"minimum-time-for-k-connected-components","difficulty":2,"accepted":17436,"submitted":38491,"acceptance":0.4529890104180198},{"id":3609,"title":"Minimum Moves to Reach Target in Grid","slug":"minimum-moves-to-reach-target-in-grid","difficulty":3,"accepted":5212,"submitted":34784,"acceptance":0.1498390064397424},{"id":3610,"title":"Minimum Number of Primes to Sum to Target","slug":"minimum-number-of-primes-to-sum-to-target","difficulty":2,"accepted":3403,"submitted":5694,"acceptance":0.5976466455918511},{"id":3611,"title":"Find Overbooked Employees","slug":"find-overbooked-employees","difficulty":2,"accepted":9919,"submitted":22472,"acceptance":0.4413937344250623},{"id":3612,"title":"Process String with Special Operations I","slug":"process-string-with-special-operations-i","difficulty":2,"accepted":48331,"submitted":74354,"acceptance":0.650012104258009},{"id":3613,"title":"Minimize Maximum Component Cost","slug":"minimize-maximum-component-cost","difficulty":2,"accepted":24001,"submitted":55175,"acceptance":0.4349977344811962},{"id":3614,"title":"Process String with Special Operations II","slug":"process-string-with-special-operations-ii","difficulty":3,"accepted":11071,"submitted":65140,"acceptance":0.1699570156585815},{"id":3615,"title":"Longest Palindromic Path in Graph","slug":"longest-palindromic-path-in-graph","difficulty":3,"accepted":7306,"submitted":33062,"acceptance":0.22097876716472084},{"id":3616,"title":"Number of Student Replacements","slug":"number-of-student-replacements","difficulty":2,"accepted":971,"submitted":1125,"acceptance":0.8631111111111112},{"id":3617,"title":"Find Students with Study Spiral Pattern","slug":"find-students-with-study-spiral-pattern","difficulty":3,"accepted":3625,"submitted":12244,"acceptance":0.2960633779810519},{"id":3618,"title":"Split Array by Prime Indices","slug":"split-array-by-prime-indices","difficulty":2,"accepted":37289,"submitted":75506,"acceptance":0.4938547929965831},{"id":3619,"title":"Count Islands With Total Value Divisible by K","slug":"count-islands-with-total-value-divisible-by-k","difficulty":2,"accepted":30854,"submitted":54817,"acceptance":0.5628545889049018},{"id":3620,"title":"Network Recovery Pathways","slug":"network-recovery-pathways","difficulty":3,"accepted":14868,"submitted":49659,"acceptance":0.29940192110191505},{"id":3621,"title":"Number of Integers With Popcount-Depth Equal to K I","slug":"number-of-integers-with-popcount-depth-equal-to-k-i","difficulty":3,"accepted":4653,"submitted":20691,"acceptance":0.22488038277511962},{"id":3622,"title":"Check Divisibility by Digit Sum and Product","slug":"check-divisibility-by-digit-sum-and-product","difficulty":1,"accepted":72753,"submitted":104547,"acceptance":0.695887973829952},{"id":3623,"title":"Count Number of Trapezoids I","slug":"count-number-of-trapezoids-i","difficulty":2,"accepted":117418,"submitted":244290,"acceptance":0.4806500470751975},{"id":3624,"title":"Number of Integers With Popcount-Depth Equal to K II","slug":"number-of-integers-with-popcount-depth-equal-to-k-ii","difficulty":3,"accepted":20275,"submitted":34093,"acceptance":0.594696858592673},{"id":3625,"title":"Count Number of Trapezoids II","slug":"count-number-of-trapezoids-ii","difficulty":3,"accepted":57658,"submitted":144097,"acceptance":0.40013324357897806},{"id":3626,"title":"Find Stores with Inventory Imbalance","slug":"find-stores-with-inventory-imbalance","difficulty":2,"accepted":7783,"submitted":16302,"acceptance":0.4774260826892406},{"id":3627,"title":"Maximum Median Sum of Subsequences of Size 3","slug":"maximum-median-sum-of-subsequences-of-size-3","difficulty":2,"accepted":62731,"submitted":96404,"acceptance":0.6507095141280445},{"id":3628,"title":"Maximum Number of Subsequences After One Inserting","slug":"maximum-number-of-subsequences-after-one-inserting","difficulty":2,"accepted":30616,"submitted":96161,"acceptance":0.3183827123262029},{"id":3629,"title":"Minimum Jumps to Reach End via Prime Teleportation","slug":"minimum-jumps-to-reach-end-via-prime-teleportation","difficulty":2,"accepted":26640,"submitted":83765,"acceptance":0.3180325911776995},{"id":3630,"title":"Partition Array for Maximum XOR and AND","slug":"partition-array-for-maximum-xor-and-and","difficulty":3,"accepted":7378,"submitted":41838,"acceptance":0.1763468617046704},{"id":3631,"title":"Sort Threats by Severity and Exploitability","slug":"sort-threats-by-severity-and-exploitability","difficulty":2,"accepted":567,"submitted":892,"acceptance":0.6356502242152466},{"id":3632,"title":"Subarrays with XOR at Least K","slug":"subarrays-with-xor-at-least-k","difficulty":3,"accepted":268,"submitted":625,"acceptance":0.4288},{"id":3633,"title":"Earliest Finish Time for Land and Water Rides I","slug":"earliest-finish-time-for-land-and-water-rides-i","difficulty":1,"accepted":33388,"submitted":53898,"acceptance":0.6194663994953431},{"id":3634,"title":"Minimum Removals to Balance Array","slug":"minimum-removals-to-balance-array","difficulty":2,"accepted":143029,"submitted":298841,"acceptance":0.47861237246562555},{"id":3635,"title":"Earliest Finish Time for Land and Water Rides II","slug":"earliest-finish-time-for-land-and-water-rides-ii","difficulty":2,"accepted":13027,"submitted":37049,"acceptance":0.351615428216686},{"id":3636,"title":"Threshold Majority Queries","slug":"threshold-majority-queries","difficulty":3,"accepted":4672,"submitted":21356,"acceptance":0.21876755946806517},{"id":3637,"title":"Trionic Array I","slug":"trionic-array-i","difficulty":1,"accepted":194745,"submitted":393240,"acceptance":0.49523191943851086},{"id":3638,"title":"Maximum Balanced Shipments","slug":"maximum-balanced-shipments","difficulty":2,"accepted":52486,"submitted":85508,"acceptance":0.6138139121485708},{"id":3639,"title":"Minimum Time to Activate String","slug":"minimum-time-to-activate-string","difficulty":2,"accepted":35012,"submitted":71145,"acceptance":0.49212172324126785},{"id":3640,"title":"Trionic Array II","slug":"trionic-array-ii","difficulty":3,"accepted":84706,"submitted":178979,"acceptance":0.4732734007900368},{"id":3641,"title":"Longest Semi-Repeating Subarray","slug":"longest-semi-repeating-subarray","difficulty":2,"accepted":951,"submitted":1481,"acceptance":0.6421336934503714},{"id":3642,"title":"Find Books with Polarized Opinions","slug":"find-books-with-polarized-opinions","difficulty":2,"accepted":9560,"submitted":22740,"acceptance":0.4204045734388742},{"id":3643,"title":"Flip Square Submatrix Vertically","slug":"flip-square-submatrix-vertically","difficulty":1,"accepted":153755,"submitted":193751,"acceptance":0.7935700977027216},{"id":3644,"title":"Maximum K to Sort a Permutation","slug":"maximum-k-to-sort-a-permutation","difficulty":2,"accepted":32988,"submitted":88324,"acceptance":0.37348851954168744},{"id":3645,"title":"Maximum Total from Optimal Activation Order","slug":"maximum-total-from-optimal-activation-order","difficulty":2,"accepted":17709,"submitted":53394,"acceptance":0.33166647937970556},{"id":3646,"title":"Next Special Palindrome Number","slug":"next-special-palindrome-number","difficulty":3,"accepted":11873,"submitted":42418,"acceptance":0.27990475741430526},{"id":3647,"title":"Maximum Weight in Two Bags","slug":"maximum-weight-in-two-bags","difficulty":2,"accepted":680,"submitted":1177,"acceptance":0.5777400169923534},{"id":3648,"title":"Minimum Sensors to Cover Grid","slug":"minimum-sensors-to-cover-grid","difficulty":2,"accepted":29332,"submitted":42691,"acceptance":0.6870769014546392},{"id":3649,"title":"Number of Perfect Pairs","slug":"number-of-perfect-pairs","difficulty":2,"accepted":21964,"submitted":65012,"acceptance":0.3378453208638405},{"id":3650,"title":"Minimum Cost Path with Edge Reversals","slug":"minimum-cost-path-with-edge-reversals","difficulty":2,"accepted":103298,"submitted":167070,"acceptance":0.6182917340037111},{"id":3651,"title":"Minimum Cost Path with Teleportations","slug":"minimum-cost-path-with-teleportations","difficulty":3,"accepted":65635,"submitted":143837,"acceptance":0.4563151344925158},{"id":3652,"title":"Best Time to Buy and Sell Stock using Strategy","slug":"best-time-to-buy-and-sell-stock-using-strategy","difficulty":2,"accepted":112495,"submitted":188178,"acceptance":0.597811646419879},{"id":3653,"title":"XOR After Range Multiplication Queries I","slug":"xor-after-range-multiplication-queries-i","difficulty":2,"accepted":129921,"submitted":176803,"acceptance":0.7348348161513096},{"id":3654,"title":"Minimum Sum After Divisible Sum Deletions","slug":"minimum-sum-after-divisible-sum-deletions","difficulty":2,"accepted":29339,"submitted":63096,"acceptance":0.4649898567262584},{"id":3655,"title":"XOR After Range Multiplication Queries II","slug":"xor-after-range-multiplication-queries-ii","difficulty":3,"accepted":39670,"submitted":91398,"acceptance":0.43403575570581415},{"id":3656,"title":"Determine if a Simple Graph Exists","slug":"determine-if-a-simple-graph-exists","difficulty":2,"accepted":386,"submitted":813,"acceptance":0.4747847478474785},{"id":3657,"title":"Find Loyal Customers","slug":"find-loyal-customers","difficulty":2,"accepted":10249,"submitted":16998,"acceptance":0.6029532886221909},{"id":3658,"title":"GCD of Odd and Even Sums","slug":"gcd-of-odd-and-even-sums","difficulty":1,"accepted":92841,"submitted":109334,"acceptance":0.849150310059085},{"id":3659,"title":"Partition Array Into K-Distinct Groups","slug":"partition-array-into-k-distinct-groups","difficulty":2,"accepted":54375,"submitted":115435,"acceptance":0.4710443106510157},{"id":3660,"title":"Jump Game IX","slug":"jump-game-ix","difficulty":2,"accepted":17054,"submitted":70973,"acceptance":0.2402885604384766},{"id":3661,"title":"Maximum Walls Destroyed by Robots","slug":"maximum-walls-destroyed-by-robots","difficulty":3,"accepted":62416,"submitted":130114,"acceptance":0.47970241480547826},{"id":3662,"title":"Filter Characters by Frequency","slug":"filter-characters-by-frequency","difficulty":1,"accepted":1397,"submitted":1610,"acceptance":0.8677018633540373},{"id":3663,"title":"Find The Least Frequent Digit","slug":"find-the-least-frequent-digit","difficulty":1,"accepted":43327,"submitted":62095,"acceptance":0.6977534423061438},{"id":3664,"title":"Two-Letter Card Game","slug":"two-letter-card-game","difficulty":2,"accepted":10702,"submitted":85176,"acceptance":0.12564572179956796},{"id":3665,"title":"Twisted Mirror Path Count","slug":"twisted-mirror-path-count","difficulty":2,"accepted":14753,"submitted":30612,"acceptance":0.4819351888148439},{"id":3666,"title":"Minimum Operations to Equalize Binary String","slug":"minimum-operations-to-equalize-binary-string","difficulty":3,"accepted":60857,"submitted":134679,"acceptance":0.4518670319797444},{"id":3667,"title":"Sort Array By Absolute Value","slug":"sort-array-by-absolute-value","difficulty":1,"accepted":1516,"submitted":1756,"acceptance":0.8633257403189066},{"id":3668,"title":"Restore Finishing Order","slug":"restore-finishing-order","difficulty":1,"accepted":99343,"submitted":108979,"acceptance":0.9115792950935502},{"id":3669,"title":"Balanced K-Factor Decomposition","slug":"balanced-k-factor-decomposition","difficulty":2,"accepted":27609,"submitted":68668,"acceptance":0.40206500844643794},{"id":3670,"title":"Maximum Product of Two Integers With No Common Bits","slug":"maximum-product-of-two-integers-with-no-common-bits","difficulty":2,"accepted":11527,"submitted":76073,"acceptance":0.15152550839325385},{"id":3671,"title":"Sum of Beautiful Subsequences","slug":"sum-of-beautiful-subsequences","difficulty":3,"accepted":9077,"submitted":28810,"acceptance":0.31506421381464766},{"id":3672,"title":"Sum of Weighted Modes in Subarrays","slug":"sum-of-weighted-modes-in-subarrays","difficulty":2,"accepted":483,"submitted":886,"acceptance":0.5451467268623025},{"id":3673,"title":"Find Zombie Sessions","slug":"find-zombie-sessions","difficulty":3,"accepted":5957,"submitted":12354,"acceptance":0.4821920025902542},{"id":3674,"title":"Minimum Operations to Equalize Array","slug":"minimum-operations-to-equalize-array","difficulty":1,"accepted":54716,"submitted":90772,"acceptance":0.6027849997796677},{"id":3675,"title":"Minimum Operations to Transform String","slug":"minimum-operations-to-transform-string","difficulty":2,"accepted":50946,"submitted":82306,"acceptance":0.6189828202075183},{"id":3676,"title":"Count Bowl Subarrays","slug":"count-bowl-subarrays","difficulty":2,"accepted":30258,"submitted":62831,"acceptance":0.48157756521462336},{"id":3677,"title":"Count Binary Palindromic Numbers","slug":"count-binary-palindromic-numbers","difficulty":3,"accepted":15980,"submitted":47286,"acceptance":0.3379435773801971},{"id":3678,"title":"Smallest Absent Positive Greater Than Average","slug":"smallest-absent-positive-greater-than-average","difficulty":1,"accepted":37041,"submitted":108252,"acceptance":0.3421738166500388},{"id":3679,"title":" Minimum Discards to Balance Inventory","slug":"minimum-discards-to-balance-inventory","difficulty":2,"accepted":19825,"submitted":56744,"acceptance":0.349376145495559},{"id":3680,"title":"Generate Schedule","slug":"generate-schedule","difficulty":2,"accepted":4682,"submitted":19282,"acceptance":0.2428171351519552},{"id":3681,"title":"Maximum XOR of Subsequences","slug":"maximum-xor-of-subsequences","difficulty":3,"accepted":7641,"submitted":14913,"acceptance":0.512371756185878},{"id":3682,"title":"Minimum Index Sum of Common Elements","slug":"minimum-index-sum-of-common-elements","difficulty":2,"accepted":716,"submitted":926,"acceptance":0.7732181425485961},{"id":3683,"title":"Earliest Time to Finish One Task","slug":"earliest-time-to-finish-one-task","difficulty":1,"accepted":71001,"submitted":83988,"acceptance":0.8453707672524646},{"id":3684,"title":"Maximize Sum of At Most K Distinct Elements","slug":"maximize-sum-of-at-most-k-distinct-elements","difficulty":1,"accepted":63541,"submitted":82613,"acceptance":0.7691404500502342},{"id":3685,"title":"Subsequence Sum After Capping Elements","slug":"subsequence-sum-after-capping-elements","difficulty":2,"accepted":20281,"submitted":80118,"acceptance":0.2531391197982975},{"id":3686,"title":"Number of Stable Subsequences","slug":"number-of-stable-subsequences","difficulty":3,"accepted":24477,"submitted":40642,"acceptance":0.6022587471089021},{"id":3687,"title":"Library Late Fee Calculator","slug":"library-late-fee-calculator","difficulty":1,"accepted":1997,"submitted":2118,"acceptance":0.9428706326723324},{"id":3688,"title":"Bitwise OR of Even Numbers in an Array","slug":"bitwise-or-of-even-numbers-in-an-array","difficulty":1,"accepted":72568,"submitted":85413,"acceptance":0.8496130565604767},{"id":3689,"title":"Maximum Total Subarray Value I","slug":"maximum-total-subarray-value-i","difficulty":2,"accepted":53626,"submitted":83266,"acceptance":0.6440323781615546},{"id":3690,"title":"Split and Merge Array Transformation","slug":"split-and-merge-array-transformation","difficulty":2,"accepted":25096,"submitted":42725,"acceptance":0.5873844353423054},{"id":3691,"title":"Maximum Total Subarray Value II","slug":"maximum-total-subarray-value-ii","difficulty":3,"accepted":11973,"submitted":53715,"acceptance":0.22289863166713209},{"id":3692,"title":"Majority Frequency Characters","slug":"majority-frequency-characters","difficulty":1,"accepted":30287,"submitted":45155,"acceptance":0.6707341379692171},{"id":3693,"title":"Climbing Stairs II","slug":"climbing-stairs-ii","difficulty":2,"accepted":29383,"submitted":45994,"acceptance":0.6388441970691829},{"id":3694,"title":"Distinct Points Reachable After Substring Removal","slug":"distinct-points-reachable-after-substring-removal","difficulty":2,"accepted":16390,"submitted":30423,"acceptance":0.53873713966407},{"id":3695,"title":"Maximize Alternating Sum Using Swaps","slug":"maximize-alternating-sum-using-swaps","difficulty":3,"accepted":9105,"submitted":14179,"acceptance":0.6421468368714296},{"id":3696,"title":"Maximum Distance Between Unequal Words in Array I","slug":"maximum-distance-between-unequal-words-in-array-i","difficulty":1,"accepted":1021,"submitted":1232,"acceptance":0.8287337662337663},{"id":3697,"title":"Compute Decimal Representation","slug":"compute-decimal-representation","difficulty":1,"accepted":61077,"submitted":94369,"acceptance":0.6472146573556994},{"id":3698,"title":"Split Array With Minimum Difference","slug":"split-array-with-minimum-difference","difficulty":2,"accepted":40713,"submitted":121168,"acceptance":0.3360045556582596},{"id":3699,"title":"Number of ZigZag Arrays I","slug":"number-of-zigzag-arrays-i","difficulty":3,"accepted":16066,"submitted":48635,"acceptance":0.3303382337822556},{"id":3700,"title":"Number of ZigZag Arrays II","slug":"number-of-zigzag-arrays-ii","difficulty":3,"accepted":14783,"submitted":25686,"acceptance":0.5755275247216383},{"id":3701,"title":"Compute Alternating Sum","slug":"compute-alternating-sum","difficulty":1,"accepted":72217,"submitted":80340,"acceptance":0.8988922081155091},{"id":3702,"title":"Longest Subsequence With Non-Zero Bitwise XOR","slug":"longest-subsequence-with-non-zero-bitwise-xor","difficulty":2,"accepted":32269,"submitted":86591,"acceptance":0.37265997620999874},{"id":3703,"title":"Remove K-Balanced Substrings","slug":"remove-k-balanced-substrings","difficulty":2,"accepted":19750,"submitted":60586,"acceptance":0.32598290034001254},{"id":3704,"title":"Count No-Zero Pairs That Sum to N","slug":"count-no-zero-pairs-that-sum-to-n","difficulty":3,"accepted":5248,"submitted":36285,"acceptance":0.14463276836158193},{"id":3705,"title":"Find Golden Hour Customers","slug":"find-golden-hour-customers","difficulty":2,"accepted":6278,"submitted":18302,"acceptance":0.34302262047863624},{"id":3706,"title":"Maximum Distance Between Unequal Words in Array II","slug":"maximum-distance-between-unequal-words-in-array-ii","difficulty":2,"accepted":588,"submitted":816,"acceptance":0.7205882352941176},{"id":3707,"title":"Equal Score Substrings","slug":"equal-score-substrings","difficulty":1,"accepted":36997,"submitted":65201,"acceptance":0.5674299473934449},{"id":3708,"title":"Longest Fibonacci Subarray","slug":"longest-fibonacci-subarray","difficulty":2,"accepted":32786,"submitted":47157,"acceptance":0.6952520304514707},{"id":3709,"title":"Design Exam Scores Tracker","slug":"design-exam-scores-tracker","difficulty":2,"accepted":19181,"submitted":43592,"acceptance":0.4400119287942742},{"id":3710,"title":"Maximum Partition Factor","slug":"maximum-partition-factor","difficulty":3,"accepted":6724,"submitted":21470,"acceptance":0.31318118304611087},{"id":3711,"title":"Maximum Transactions Without Negative Balance","slug":"maximum-transactions-without-negative-balance","difficulty":2,"accepted":674,"submitted":1451,"acceptance":0.46450723638869745},{"id":3712,"title":"Sum of Elements With Frequency Divisible by K","slug":"sum-of-elements-with-frequency-divisible-by-k","difficulty":1,"accepted":51900,"submitted":66727,"acceptance":0.7777960945344463},{"id":3713,"title":"Longest Balanced Substring I","slug":"longest-balanced-substring-i","difficulty":2,"accepted":134852,"submitted":193500,"acceptance":0.6969095607235142},{"id":3714,"title":"Longest Balanced Substring II","slug":"longest-balanced-substring-ii","difficulty":2,"accepted":74323,"submitted":177083,"acceptance":0.4197071429781515},{"id":3715,"title":"Sum of Perfect Square Ancestors","slug":"sum-of-perfect-square-ancestors","difficulty":3,"accepted":7170,"submitted":16874,"acceptance":0.42491406898186557},{"id":3716,"title":"Find Churn Risk Customers","slug":"find-churn-risk-customers","difficulty":2,"accepted":5871,"submitted":12606,"acceptance":0.46573060447405995},{"id":3717,"title":"Minimum Operations to Make the Array Beautiful","slug":"minimum-operations-to-make-the-array-beautiful","difficulty":2,"accepted":333,"submitted":881,"acceptance":0.3779795686719637},{"id":3718,"title":"Smallest Missing Multiple of K","slug":"smallest-missing-multiple-of-k","difficulty":1,"accepted":47353,"submitted":74979,"acceptance":0.6315501673801998},{"id":3719,"title":"Longest Balanced Subarray I","slug":"longest-balanced-subarray-i","difficulty":2,"accepted":142972,"submitted":217792,"acceptance":0.6564612106964444},{"id":3720,"title":"Lexicographically Smallest Permutation Greater Than Target","slug":"lexicographically-smallest-permutation-greater-than-target","difficulty":2,"accepted":12800,"submitted":48098,"acceptance":0.2661233315314566},{"id":3721,"title":"Longest Balanced Subarray II","slug":"longest-balanced-subarray-ii","difficulty":3,"accepted":59949,"submitted":177627,"acceptance":0.3374993666503403},{"id":3722,"title":"Lexicographically Smallest String After Reverse","slug":"lexicographically-smallest-string-after-reverse","difficulty":2,"accepted":24925,"submitted":45566,"acceptance":0.547008734582803},{"id":3723,"title":"Maximize Sum of Squares of Digits","slug":"maximize-sum-of-squares-of-digits","difficulty":2,"accepted":23059,"submitted":39110,"acceptance":0.5895934543594988},{"id":3724,"title":"Minimum Operations to Transform Array","slug":"minimum-operations-to-transform-array","difficulty":2,"accepted":14196,"submitted":35769,"acceptance":0.3968799798708379},{"id":3725,"title":"Count Ways to Choose Coprime Integers from Rows","slug":"count-ways-to-choose-coprime-integers-from-rows","difficulty":3,"accepted":9575,"submitted":19787,"acceptance":0.4839035730530146},{"id":3726,"title":"Remove Zeros in Decimal Representation","slug":"remove-zeros-in-decimal-representation","difficulty":1,"accepted":50895,"submitted":66643,"acceptance":0.7636961121198025},{"id":3727,"title":"Maximum Alternating Sum of Squares","slug":"maximum-alternating-sum-of-squares","difficulty":2,"accepted":33588,"submitted":54755,"acceptance":0.6134234316500776},{"id":3728,"title":"Stable Subarrays With Equal Boundary and Interior Sum","slug":"stable-subarrays-with-equal-boundary-and-interior-sum","difficulty":2,"accepted":16003,"submitted":61270,"acceptance":0.2611881834503019},{"id":3729,"title":"Count Distinct Subarrays Divisible by K in Sorted Array","slug":"count-distinct-subarrays-divisible-by-k-in-sorted-array","difficulty":3,"accepted":6001,"submitted":21661,"acceptance":0.2770416878260468},{"id":3730,"title":"Maximum Calories Burnt from Jumps","slug":"maximum-calories-burnt-from-jumps","difficulty":2,"accepted":729,"submitted":1004,"acceptance":0.7260956175298805},{"id":3731,"title":"Find Missing Elements","slug":"find-missing-elements","difficulty":1,"accepted":62180,"submitted":74960,"acceptance":0.8295090715048026},{"id":3732,"title":"Maximum Product of Three Elements After One Replacement","slug":"maximum-product-of-three-elements-after-one-replacement","difficulty":2,"accepted":31400,"submitted":66348,"acceptance":0.473262193283897},{"id":3733,"title":"Minimum Time to Complete All Deliveries","slug":"minimum-time-to-complete-all-deliveries","difficulty":2,"accepted":14548,"submitted":41609,"acceptance":0.349635896080175},{"id":3734,"title":"Lexicographically Smallest Palindromic Permutation Greater Than Target","slug":"lexicographically-smallest-palindromic-permutation-greater-than-target","difficulty":3,"accepted":5037,"submitted":20156,"acceptance":0.2499007739630879},{"id":3735,"title":"Lexicographically Smallest String After Reverse II","slug":"lexicographically-smallest-string-after-reverse-ii","difficulty":3,"accepted":304,"submitted":659,"acceptance":0.4613050075872534},{"id":3736,"title":"Minimum Moves to Equal Array Elements III","slug":"minimum-moves-to-equal-array-elements-iii","difficulty":1,"accepted":37235,"submitted":45665,"acceptance":0.8153947224351253},{"id":3737,"title":"Count Subarrays With Majority Element I","slug":"count-subarrays-with-majority-element-i","difficulty":2,"accepted":26603,"submitted":40639,"acceptance":0.654617485666478},{"id":3738,"title":"Longest Non-Decreasing Subarray After Replacing at Most One Element","slug":"longest-non-decreasing-subarray-after-replacing-at-most-one-element","difficulty":2,"accepted":14507,"submitted":66358,"acceptance":0.21861719762500376},{"id":3739,"title":"Count Subarrays With Majority Element II","slug":"count-subarrays-with-majority-element-ii","difficulty":3,"accepted":7166,"submitted":15882,"acceptance":0.4512026193174663},{"id":3740,"title":"Minimum Distance Between Three Equal Elements I","slug":"minimum-distance-between-three-equal-elements-i","difficulty":1,"accepted":38464,"submitted":63476,"acceptance":0.6059613082109774},{"id":3741,"title":"Minimum Distance Between Three Equal Elements II","slug":"minimum-distance-between-three-equal-elements-ii","difficulty":2,"accepted":30830,"submitted":47231,"acceptance":0.6527492536681417},{"id":3742,"title":"Maximum Path Score in a Grid","slug":"maximum-path-score-in-a-grid","difficulty":2,"accepted":18550,"submitted":50633,"acceptance":0.366361858866747},{"id":3743,"title":"Maximize Cyclic Partition Score","slug":"maximize-cyclic-partition-score","difficulty":3,"accepted":2956,"submitted":22923,"acceptance":0.12895345286393578},{"id":3744,"title":"Find Kth Character in Expanded String","slug":"find-kth-character-in-expanded-string","difficulty":2,"accepted":502,"submitted":877,"acceptance":0.572405929304447},{"id":3745,"title":"Maximize Expression of Three Elements","slug":"maximize-expression-of-three-elements","difficulty":1,"accepted":45349,"submitted":62487,"acceptance":0.725734952870197},{"id":3746,"title":"Minimum String Length After Balanced Removals","slug":"minimum-string-length-after-balanced-removals","difficulty":2,"accepted":39856,"submitted":50862,"acceptance":0.7836105540482089},{"id":3747,"title":"Count Distinct Integers After Removing Zeros","slug":"count-distinct-integers-after-removing-zeros","difficulty":2,"accepted":15339,"submitted":67781,"acceptance":0.22630235611749605},{"id":3748,"title":"Count Stable Subarrays","slug":"count-stable-subarrays","difficulty":3,"accepted":6071,"submitted":18707,"acceptance":0.32453092425295343},{"id":3749,"title":"Evaluate Valid Expressions","slug":"evaluate-valid-expressions","difficulty":3,"accepted":447,"submitted":621,"acceptance":0.7198067632850241},{"id":3750,"title":"Minimum Number of Flips to Reverse Binary String","slug":"minimum-number-of-flips-to-reverse-binary-string","difficulty":1,"accepted":31960,"submitted":41915,"acceptance":0.7624955266610999},{"id":3751,"title":"Total Waviness of Numbers in Range I","slug":"total-waviness-of-numbers-in-range-i","difficulty":2,"accepted":26426,"submitted":32757,"acceptance":0.8067283328754159},{"id":3752,"title":"Lexicographically Smallest Negated Permutation that Sums to Target","slug":"lexicographically-smallest-negated-permutation-that-sums-to-target","difficulty":2,"accepted":13142,"submitted":42465,"acceptance":0.30947839397150595},{"id":3753,"title":"Total Waviness of Numbers in Range II","slug":"total-waviness-of-numbers-in-range-ii","difficulty":3,"accepted":3975,"submitted":15485,"acceptance":0.25670003228931226},{"id":3754,"title":"Concatenate Non-Zero Digits and Multiply by Sum I","slug":"concatenate-non-zero-digits-and-multiply-by-sum-i","difficulty":1,"accepted":40075,"submitted":71839,"acceptance":0.5578446247859797},{"id":3755,"title":"Find Maximum Balanced XOR Subarray Length","slug":"find-maximum-balanced-xor-subarray-length","difficulty":2,"accepted":18793,"submitted":36977,"acceptance":0.508234848689726},{"id":3756,"title":"Concatenate Non-Zero Digits and Multiply by Sum II","slug":"concatenate-non-zero-digits-and-multiply-by-sum-ii","difficulty":2,"accepted":10402,"submitted":42879,"acceptance":0.24258961263089157},{"id":3757,"title":"Number of Effective Subsequences","slug":"number-of-effective-subsequences","difficulty":3,"accepted":2835,"submitted":9130,"acceptance":0.31051478641840086},{"id":3758,"title":"Convert Number Words to Digits","slug":"convert-number-words-to-digits","difficulty":2,"accepted":526,"submitted":752,"acceptance":0.699468085106383},{"id":3759,"title":"Count Elements With at Least K Greater Values","slug":"count-elements-with-at-least-k-greater-values","difficulty":2,"accepted":31678,"submitted":100954,"acceptance":0.313786477009331},{"id":3760,"title":"Maximum Substrings With Distinct Start","slug":"maximum-substrings-with-distinct-start","difficulty":2,"accepted":52487,"submitted":57426,"acceptance":0.9139936614077248},{"id":3761,"title":"Minimum Absolute Distance Between Mirror Pairs","slug":"minimum-absolute-distance-between-mirror-pairs","difficulty":2,"accepted":22271,"submitted":50146,"acceptance":0.4441231603717146},{"id":3762,"title":"Minimum Operations to Equalize Subarrays","slug":"minimum-operations-to-equalize-subarrays","difficulty":3,"accepted":3038,"submitted":15412,"acceptance":0.197119127952245},{"id":3763,"title":"Maximum Total Sum with Threshold Constraints","slug":"maximum-total-sum-with-threshold-constraints","difficulty":2,"accepted":651,"submitted":780,"acceptance":0.8346153846153846},{"id":3764,"title":"Most Common Course Pairs","slug":"most-common-course-pairs","difficulty":3,"accepted":3391,"submitted":6806,"acceptance":0.4982368498383779},{"id":3765,"title":"Complete Prime Number","slug":"complete-prime-number","difficulty":2,"accepted":27294,"submitted":73968,"acceptance":0.36899740428293315},{"id":3766,"title":"Minimum Operations to Make Binary Palindrome","slug":"minimum-operations-to-make-binary-palindrome","difficulty":2,"accepted":17167,"submitted":33128,"acceptance":0.5182021250905579},{"id":3767,"title":"Maximize Points After Choosing K Tasks","slug":"maximize-points-after-choosing-k-tasks","difficulty":2,"accepted":16369,"submitted":27287,"acceptance":0.5998827280389929},{"id":3768,"title":"Minimum Inversion Count in Subarrays of Fixed Length","slug":"minimum-inversion-count-in-subarrays-of-fixed-length","difficulty":3,"accepted":4966,"submitted":11651,"acceptance":0.4262295081967213},{"id":3769,"title":"Sort Integers by Binary Reflection","slug":"sort-integers-by-binary-reflection","difficulty":1,"accepted":30355,"submitted":49769,"acceptance":0.6099178203299243},{"id":3770,"title":"Largest Prime from Consecutive Prime Sum","slug":"largest-prime-from-consecutive-prime-sum","difficulty":2,"accepted":24807,"submitted":63500,"acceptance":0.39066141732283466},{"id":3771,"title":"Total Score of Dungeon Runs","slug":"total-score-of-dungeon-runs","difficulty":2,"accepted":10362,"submitted":33727,"acceptance":0.3072315948646485},{"id":3772,"title":"Maximum Subgraph Score in a Tree","slug":"maximum-subgraph-score-in-a-tree","difficulty":3,"accepted":5614,"submitted":7948,"acceptance":0.706341217916457},{"id":3773,"title":"Maximum Number of Equal Length Runs","slug":"maximum-number-of-equal-length-runs","difficulty":2,"accepted":680,"submitted":805,"acceptance":0.84472049689441},{"id":3774,"title":"Absolute Difference Between Maximum and Minimum K Elements","slug":"absolute-difference-between-maximum-and-minimum-k-elements","difficulty":1,"accepted":46152,"submitted":61118,"acceptance":0.7551294217742727},{"id":3775,"title":"Reverse Words With Same Vowel Count","slug":"reverse-words-with-same-vowel-count","difficulty":2,"accepted":35986,"submitted":53921,"acceptance":0.6673837651378869},{"id":3776,"title":"Minimum Moves to Balance Circular Array","slug":"minimum-moves-to-balance-circular-array","difficulty":2,"accepted":20919,"submitted":52022,"acceptance":0.402118334550767},{"id":3777,"title":"Minimum Deletions to Make Alternating Substring","slug":"minimum-deletions-to-make-alternating-substring","difficulty":3,"accepted":5945,"submitted":13229,"acceptance":0.44939148839670423},{"id":3778,"title":"Minimum Distance Excluding One Maximum Weighted Edge","slug":"minimum-distance-excluding-one-maximum-weighted-edge","difficulty":2,"accepted":303,"submitted":672,"acceptance":0.45089285714285715},{"id":3779,"title":"Minimum Number of Operations to Have Distinct Elements","slug":"minimum-number-of-operations-to-have-distinct-elements","difficulty":2,"accepted":27870,"submitted":66076,"acceptance":0.4217870331133846},{"id":3780,"title":"Maximum Sum of Three Numbers Divisible by Three","slug":"maximum-sum-of-three-numbers-divisible-by-three","difficulty":2,"accepted":22540,"submitted":47239,"acceptance":0.47714811913884714},{"id":3781,"title":"Maximum Score After Binary Swaps","slug":"maximum-score-after-binary-swaps","difficulty":2,"accepted":14333,"submitted":40902,"acceptance":0.3504229622023373},{"id":3782,"title":"Last Remaining Integer After Alternating Deletion Operations","slug":"last-remaining-integer-after-alternating-deletion-operations","difficulty":3,"accepted":7684,"submitted":15869,"acceptance":0.48421450627008633},{"id":3783,"title":"Mirror Distance of an Integer","slug":"mirror-distance-of-an-integer","difficulty":1,"accepted":55635,"submitted":63404,"acceptance":0.8774682985300611},{"id":3784,"title":"Minimum Deletion Cost to Make All Characters Equal","slug":"minimum-deletion-cost-to-make-all-characters-equal","difficulty":2,"accepted":36087,"submitted":65532,"acceptance":0.5506775315876213},{"id":3785,"title":"Minimum Swaps to Avoid Forbidden Values","slug":"minimum-swaps-to-avoid-forbidden-values","difficulty":3,"accepted":11407,"submitted":37512,"acceptance":0.3040893580720836},{"id":3786,"title":"Total Sum of Interaction Cost in Tree Groups","slug":"total-sum-of-interaction-cost-in-tree-groups","difficulty":3,"accepted":7286,"submitted":13519,"acceptance":0.5389451882535691},{"id":3787,"title":"Find Diameter Endpoints of a Tree","slug":"find-diameter-endpoints-of-a-tree","difficulty":2,"accepted":608,"submitted":885,"acceptance":0.6870056497175141},{"id":3788,"title":"Maximum Score of a Split","slug":"maximum-score-of-a-split","difficulty":2,"accepted":37965,"submitted":73315,"acceptance":0.5178340039555344},{"id":3789,"title":"Minimum Cost to Acquire Required Items","slug":"minimum-cost-to-acquire-required-items","difficulty":2,"accepted":23917,"submitted":68496,"acceptance":0.349173674375146},{"id":3790,"title":"Smallest All-Ones Multiple","slug":"smallest-all-ones-multiple","difficulty":2,"accepted":26889,"submitted":57182,"acceptance":0.4702353887587003},{"id":3791,"title":"Number of Balanced Integers in a Range","slug":"number-of-balanced-integers-in-a-range","difficulty":3,"accepted":7712,"submitted":21835,"acceptance":0.35319441264025647},{"id":3792,"title":"Sum of Increasing Product Blocks","slug":"sum-of-increasing-product-blocks","difficulty":2,"accepted":488,"submitted":705,"acceptance":0.6921985815602837},{"id":3793,"title":"Find Users with High Token Usage","slug":"find-users-with-high-token-usage","difficulty":1,"accepted":8327,"submitted":14670,"acceptance":0.5676209952283572},{"id":3794,"title":"Reverse String Prefix","slug":"reverse-string-prefix","difficulty":1,"accepted":59691,"submitted":66759,"acceptance":0.8941266346110637},{"id":3795,"title":"Minimum Subarray Length With Distinct Sum At Least K","slug":"minimum-subarray-length-with-distinct-sum-at-least-k","difficulty":2,"accepted":29225,"submitted":91938,"acceptance":0.317877265113446},{"id":3796,"title":"Find Maximum Value in a Constrained Sequence","slug":"find-maximum-value-in-a-constrained-sequence","difficulty":2,"accepted":13167,"submitted":21201,"acceptance":0.6210556105844064},{"id":3797,"title":"Count Routes to Climb a Rectangular Grid","slug":"count-routes-to-climb-a-rectangular-grid","difficulty":3,"accepted":3691,"submitted":15160,"acceptance":0.24346965699208442},{"id":3798,"title":"Largest Even Number","slug":"largest-even-number","difficulty":1,"accepted":44873,"submitted":64756,"acceptance":0.6929550929643585},{"id":3799,"title":"Word Squares II","slug":"word-squares-ii","difficulty":2,"accepted":19109,"submitted":34755,"acceptance":0.5498201697597468},{"id":3800,"title":"Minimum Cost to Make Two Binary Strings Equal","slug":"minimum-cost-to-make-two-binary-strings-equal","difficulty":2,"accepted":9097,"submitted":23412,"acceptance":0.38856142149325135},{"id":3801,"title":"Minimum Cost to Merge Sorted Lists","slug":"minimum-cost-to-merge-sorted-lists","difficulty":3,"accepted":4041,"submitted":11862,"acceptance":0.34066767830045525},{"id":3802,"title":"Number of Ways to Paint Sheets","slug":"number-of-ways-to-paint-sheets","difficulty":3,"accepted":422,"submitted":631,"acceptance":0.6687797147385103},{"id":3803,"title":"Count Residue Prefixes","slug":"count-residue-prefixes","difficulty":1,"accepted":46050,"submitted":70251,"acceptance":0.6555066831788872},{"id":3804,"title":"Number of Centered Subarrays","slug":"number-of-centered-subarrays","difficulty":2,"accepted":37740,"submitted":56279,"acceptance":0.6705876081664564},{"id":3805,"title":"Count Caesar Cipher Pairs","slug":"count-caesar-cipher-pairs","difficulty":2,"accepted":26079,"submitted":51055,"acceptance":0.5108020761923416},{"id":3806,"title":"Maximum Bitwise AND After Increment Operations","slug":"maximum-bitwise-and-after-increment-operations","difficulty":3,"accepted":6692,"submitted":21285,"acceptance":0.3143998120742307},{"id":3807,"title":"Minimum Cost to Repair Edges to Traverse a Graph","slug":"minimum-cost-to-repair-edges-to-traverse-a-graph","difficulty":2,"accepted":484,"submitted":800,"acceptance":0.605},{"id":3808,"title":"Find Emotionally Consistent Users","slug":"find-emotionally-consistent-users","difficulty":2,"accepted":4073,"submitted":8069,"acceptance":0.5047713471309951},{"id":3809,"title":"Best Reachable Tower","slug":"best-reachable-tower","difficulty":2,"accepted":31541,"submitted":56473,"acceptance":0.5585146884351814},{"id":3810,"title":"Minimum Operations to Reach Target Array","slug":"minimum-operations-to-reach-target-array","difficulty":2,"accepted":25069,"submitted":39546,"acceptance":0.6339199919081576},{"id":3811,"title":"Number of Alternating XOR Partitions","slug":"number-of-alternating-xor-partitions","difficulty":2,"accepted":8620,"submitted":32099,"acceptance":0.26854419140783203},{"id":3812,"title":"Minimum Edge Toggles on a Tree","slug":"minimum-edge-toggles-on-a-tree","difficulty":3,"accepted":5929,"submitted":8605,"acceptance":0.6890180127832656},{"id":3813,"title":"Vowel-Consonant Score","slug":"vowel-consonant-score","difficulty":1,"accepted":48340,"submitted":89607,"acceptance":0.5394667827290278},{"id":3814,"title":"Maximum Capacity Within Budget","slug":"maximum-capacity-within-budget","difficulty":2,"accepted":19210,"submitted":95195,"acceptance":0.20179631283155627},{"id":3815,"title":"Design Auction System","slug":"design-auction-system","difficulty":2,"accepted":15641,"submitted":37098,"acceptance":0.42161302496091435},{"id":3816,"title":"Lexicographically Smallest String After Deleting Duplicate Characters","slug":"lexicographically-smallest-string-after-deleting-duplicate-characters","difficulty":3,"accepted":5339,"submitted":27175,"acceptance":0.19646734130634774},{"id":3817,"title":"Good Indices in a Digit String","slug":"good-indices-in-a-digit-string","difficulty":2,"accepted":655,"submitted":744,"acceptance":0.8803763440860215},{"id":3818,"title":"Minimum Prefix Removal to Make Array Strictly Increasing","slug":"minimum-prefix-removal-to-make-array-strictly-increasing","difficulty":2,"accepted":51368,"submitted":69593,"acceptance":0.7381202132398373},{"id":3819,"title":"Rotate Non Negative Elements","slug":"rotate-non-negative-elements","difficulty":2,"accepted":42240,"submitted":88091,"acceptance":0.4795041491185252},{"id":3820,"title":"Pythagorean Distance Nodes in a Tree","slug":"pythagorean-distance-nodes-in-a-tree","difficulty":2,"accepted":21082,"submitted":36384,"acceptance":0.5794305189094108},{"id":3821,"title":"Find Nth Smallest Integer With K One Bits","slug":"find-nth-smallest-integer-with-k-one-bits","difficulty":3,"accepted":9565,"submitted":27611,"acceptance":0.34641990511028214},{"id":3822,"title":"Design Order Management System","slug":"design-order-management-system","difficulty":2,"accepted":905,"submitted":1150,"acceptance":0.7869565217391304},{"id":3823,"title":"Reverse Letters Then Special Characters in a String","slug":"reverse-letters-then-special-characters-in-a-string","difficulty":1,"accepted":52255,"submitted":63813,"acceptance":0.8188770313259054},{"id":3824,"title":"Minimum K to Reduce Array Within Limit","slug":"minimum-k-to-reduce-array-within-limit","difficulty":2,"accepted":46720,"submitted":113680,"acceptance":0.41097818437719913},{"id":3825,"title":"Longest Strictly Increasing Subsequence With Non-Zero Bitwise AND","slug":"longest-strictly-increasing-subsequence-with-non-zero-bitwise-and","difficulty":2,"accepted":22450,"submitted":44353,"acceptance":0.5061664374450432},{"id":3826,"title":"Minimum Partition Score","slug":"minimum-partition-score","difficulty":3,"accepted":6682,"submitted":19748,"acceptance":0.3383633785699818},{"id":3827,"title":"Count Monobit Integers","slug":"count-monobit-integers","difficulty":1,"accepted":51561,"submitted":77761,"acceptance":0.6630701765666593},{"id":3828,"title":"Final Element After Subarray Deletions","slug":"final-element-after-subarray-deletions","difficulty":2,"accepted":31704,"submitted":78554,"acceptance":0.4035949792499427},{"id":3829,"title":"Design Ride Sharing System","slug":"design-ride-sharing-system","difficulty":2,"accepted":28393,"submitted":44692,"acceptance":0.6353038575136489},{"id":3830,"title":"Longest Alternating Subarray After Removing At Most One Element","slug":"longest-alternating-subarray-after-removing-at-most-one-element","difficulty":3,"accepted":7928,"submitted":25761,"acceptance":0.30775202825977255},{"id":3831,"title":"Median of a Binary Search Tree Level","slug":"median-of-a-binary-search-tree-level","difficulty":2,"accepted":903,"submitted":1027,"acceptance":0.8792599805258033},{"id":3832,"title":"Find Users with Persistent Behavior Patterns","slug":"find-users-with-persistent-behavior-patterns","difficulty":3,"accepted":2884,"submitted":4538,"acceptance":0.6355222565006611},{"id":3833,"title":"Count Dominant Indices","slug":"count-dominant-indices","difficulty":1,"accepted":56074,"submitted":85060,"acceptance":0.6592287796849283},{"id":3834,"title":"Merge Adjacent Equal Elements","slug":"merge-adjacent-equal-elements","difficulty":2,"accepted":44051,"submitted":104326,"acceptance":0.42224373598144277},{"id":3835,"title":"Count Subarrays With Cost Less Than or Equal to K","slug":"count-subarrays-with-cost-less-than-or-equal-to-k","difficulty":2,"accepted":22356,"submitted":48886,"acceptance":0.45730884097696683},{"id":3836,"title":"Maximum Score Using Exactly K Pairs","slug":"maximum-score-using-exactly-k-pairs","difficulty":3,"accepted":14479,"submitted":34907,"acceptance":0.41478786489815794},{"id":3837,"title":"Delayed Count of Equal Elements","slug":"delayed-count-of-equal-elements","difficulty":2,"accepted":410,"submitted":509,"acceptance":0.8055009823182712},{"id":3838,"title":"Weighted Word Mapping","slug":"weighted-word-mapping","difficulty":1,"accepted":47752,"submitted":55803,"acceptance":0.8557246026199308},{"id":3839,"title":"Number of Prefix Connected Groups","slug":"number-of-prefix-connected-groups","difficulty":2,"accepted":38395,"submitted":63350,"acceptance":0.6060773480662983},{"id":3840,"title":"House Robber V","slug":"house-robber-v","difficulty":2,"accepted":30495,"submitted":56588,"acceptance":0.5388951721212978},{"id":3841,"title":"Palindromic Path Queries in a Tree","slug":"palindromic-path-queries-in-a-tree","difficulty":3,"accepted":3667,"submitted":10380,"acceptance":0.3532755298651252},{"id":3842,"title":"Toggle Light Bulbs","slug":"toggle-light-bulbs","difficulty":1,"accepted":58603,"submitted":81527,"acceptance":0.7188170790045015},{"id":3843,"title":"First Element with Unique Frequency","slug":"first-element-with-unique-frequency","difficulty":2,"accepted":48154,"submitted":68807,"acceptance":0.699841585885157},{"id":3844,"title":"Longest Almost-Palindromic Substring","slug":"longest-almost-palindromic-substring","difficulty":2,"accepted":14478,"submitted":64767,"acceptance":0.22353976562138125},{"id":3845,"title":"Maximum Subarray XOR with Bounded Range","slug":"maximum-subarray-xor-with-bounded-range","difficulty":3,"accepted":5012,"submitted":15715,"acceptance":0.31893095768374163},{"id":3846,"title":"Total Distance to Type a String Using One Finger","slug":"total-distance-to-type-a-string-using-one-finger","difficulty":2,"accepted":598,"submitted":657,"acceptance":0.9101978691019786},{"id":3847,"title":"Find the Score Difference in a Game","slug":"find-the-score-difference-in-a-game","difficulty":2,"accepted":51554,"submitted":71369,"acceptance":0.7223584469447519},{"id":3848,"title":"Check Digitorial Permutation","slug":"check-digitorial-permutation","difficulty":2,"accepted":41682,"submitted":89379,"acceptance":0.46635115631188534},{"id":3849,"title":"Maximum Bitwise XOR After Rearrangement","slug":"maximum-bitwise-xor-after-rearrangement","difficulty":2,"accepted":32336,"submitted":45444,"acceptance":0.7115570812428483},{"id":3850,"title":"Count Sequences to K","slug":"count-sequences-to-k","difficulty":3,"accepted":15147,"submitted":42224,"acceptance":0.358729632436529},{"id":3851,"title":"Maximum Requests Without Violating the Limit","slug":"maximum-requests-without-violating-the-limit","difficulty":2,"accepted":386,"submitted":583,"acceptance":0.6620926243567753},{"id":3852,"title":"Smallest Pair With Different Frequencies","slug":"smallest-pair-with-different-frequencies","difficulty":1,"accepted":36954,"submitted":53282,"acceptance":0.69355504673248},{"id":3853,"title":"Merge Close Characters","slug":"merge-close-characters","difficulty":2,"accepted":28029,"submitted":51463,"acceptance":0.5446437246176865},{"id":3854,"title":"Minimum Operations to Make Array Parity Alternating","slug":"minimum-operations-to-make-array-parity-alternating","difficulty":2,"accepted":8002,"submitted":47605,"acceptance":0.16809158701817037},{"id":3855,"title":"Sum of K-Digit Numbers in a Range","slug":"sum-of-k-digit-numbers-in-a-range","difficulty":3,"accepted":6627,"submitted":13124,"acceptance":0.5049527583053947},{"id":3856,"title":"Trim Trailing Vowels","slug":"trim-trailing-vowels","difficulty":1,"accepted":54711,"submitted":70768,"acceptance":0.7731036626723943},{"id":3857,"title":"Minimum Cost to Split into Ones","slug":"minimum-cost-to-split-into-ones","difficulty":2,"accepted":47142,"submitted":56614,"acceptance":0.8326915603914227},{"id":3858,"title":"Minimum Bitwise OR From Grid","slug":"minimum-bitwise-or-from-grid","difficulty":2,"accepted":13751,"submitted":51681,"acceptance":0.2660745728604323},{"id":3859,"title":"Count Subarrays With K Distinct Integers","slug":"count-subarrays-with-k-distinct-integers","difficulty":3,"accepted":6885,"submitted":34970,"acceptance":0.19688304260794967},{"id":3860,"title":"Unique Email Groups","slug":"unique-email-groups","difficulty":2,"accepted":530,"submitted":606,"acceptance":0.8745874587458746},{"id":3861,"title":"Minimum Capacity Box","slug":"minimum-capacity-box","difficulty":1,"accepted":52661,"submitted":72673,"acceptance":0.7246295047679331},{"id":3862,"title":"Find the Smallest Balanced Index","slug":"find-the-smallest-balanced-index","difficulty":2,"accepted":36176,"submitted":188263,"acceptance":0.1921567169332264},{"id":3863,"title":"Minimum Operations to Sort a String","slug":"minimum-operations-to-sort-a-string","difficulty":2,"accepted":16807,"submitted":89741,"acceptance":0.1872834044639574},{"id":3864,"title":"Minimum Cost to Partition a Binary String","slug":"minimum-cost-to-partition-a-binary-string","difficulty":3,"accepted":11080,"submitted":21179,"acceptance":0.5231597336984749},{"id":3865,"title":"Reverse K Subarrays","slug":"reverse-k-subarrays","difficulty":2,"accepted":559,"submitted":599,"acceptance":0.9332220367278798},{"id":3866,"title":"First Unique Even Element","slug":"first-unique-even-element","difficulty":1,"accepted":43646,"submitted":65863,"acceptance":0.6626785904073608},{"id":3867,"title":"Sum of GCD of Formed Pairs","slug":"sum-of-gcd-of-formed-pairs","difficulty":2,"accepted":30261,"submitted":46116,"acceptance":0.6561930783242259},{"id":3868,"title":"Minimum Cost to Equalize Arrays Using Swaps","slug":"minimum-cost-to-equalize-arrays-using-swaps","difficulty":2,"accepted":24121,"submitted":49972,"acceptance":0.48269030657168016},{"id":3869,"title":"Count Fancy Numbers in a Range","slug":"count-fancy-numbers-in-a-range","difficulty":3,"accepted":4711,"submitted":18266,"acceptance":0.2579108726595861},{"id":3870,"title":"Count Commas in Range","slug":"count-commas-in-range","difficulty":1,"accepted":55430,"submitted":80668,"acceptance":0.6871374026875589},{"id":3871,"title":"Count Commas in Range II","slug":"count-commas-in-range-ii","difficulty":2,"accepted":40755,"submitted":99576,"acceptance":0.40928536996866716},{"id":3872,"title":"Longest Arithmetic Sequence After Changing At Most One Element","slug":"longest-arithmetic-sequence-after-changing-at-most-one-element","difficulty":2,"accepted":10494,"submitted":50396,"acceptance":0.2082308119692039},{"id":3873,"title":"Maximum Points Activated with One Addition","slug":"maximum-points-activated-with-one-addition","difficulty":3,"accepted":7461,"submitted":17093,"acceptance":0.4364944714210496},{"id":3874,"title":"Valid Subarrays With Exactly One Peak","slug":"valid-subarrays-with-exactly-one-peak","difficulty":2,"accepted":331,"submitted":457,"acceptance":0.7242888402625821},{"id":3875,"title":"Construct Uniform Parity Array I","slug":"construct-uniform-parity-array-i","difficulty":1,"accepted":51245,"submitted":67389,"acceptance":0.7604356794135542},{"id":3876,"title":"Construct Uniform Parity Array II","slug":"construct-uniform-parity-array-ii","difficulty":2,"accepted":36336,"submitted":73067,"acceptance":0.497297001382293},{"id":3877,"title":"Minimum Removals to Achieve Target XOR","slug":"minimum-removals-to-achieve-target-xor","difficulty":2,"accepted":20839,"submitted":50168,"acceptance":0.4153843087226918},{"id":3878,"title":"Count Good Subarrays","slug":"count-good-subarrays","difficulty":3,"accepted":6283,"submitted":26069,"acceptance":0.2410142314626568},{"id":3879,"title":"Maximum Distinct Path Sum in a Binary Tree","slug":"maximum-distinct-path-sum-in-a-binary-tree","difficulty":2,"accepted":299,"submitted":486,"acceptance":0.6152263374485597},{"id":3880,"title":"Minimum Absolute Difference Between Two Values","slug":"minimum-absolute-difference-between-two-values","difficulty":1,"accepted":36708,"submitted":55483,"acceptance":0.6616080601265253},{"id":3881,"title":"Direction Assignments with Exactly K Visible People","slug":"direction-assignments-with-exactly-k-visible-people","difficulty":2,"accepted":14601,"submitted":40497,"acceptance":0.3605452255722646},{"id":3882,"title":"Minimum XOR Path in a Grid","slug":"minimum-xor-path-in-a-grid","difficulty":2,"accepted":15026,"submitted":38259,"acceptance":0.39274419090932855},{"id":3883,"title":"Count Non Decreasing Arrays With Given Digit Sums","slug":"count-non-decreasing-arrays-with-given-digit-sums","difficulty":3,"accepted":5665,"submitted":13556,"acceptance":0.4178961345529655},{"id":3884,"title":"First Matching Character From Both Ends","slug":"first-matching-character-from-both-ends","difficulty":1,"accepted":49271,"submitted":60404,"acceptance":0.8156910138401431},{"id":3885,"title":"Design Event Manager","slug":"design-event-manager","difficulty":2,"accepted":27208,"submitted":53585,"acceptance":0.5077540356443034},{"id":3886,"title":"Sum of Sortable Integers","slug":"sum-of-sortable-integers","difficulty":3,"accepted":11091,"submitted":36001,"acceptance":0.308074775700675},{"id":3887,"title":"Incremental Even-Weighted Cycle Queries","slug":"incremental-even-weighted-cycle-queries","difficulty":3,"accepted":7019,"submitted":13621,"acceptance":0.5153072461640115},{"id":3888,"title":"Minimum Operations to Make All Grid Elements Equal","slug":"minimum-operations-to-make-all-grid-elements-equal","difficulty":3,"accepted":289,"submitted":433,"acceptance":0.6674364896073903},{"id":3889,"title":"Mirror Frequency Distance","slug":"mirror-frequency-distance","difficulty":2,"accepted":37737,"submitted":62203,"acceptance":0.6066749192161149},{"id":3890,"title":"Integers With Multiple Sum of Two Cubes","slug":"integers-with-multiple-sum-of-two-cubes","difficulty":2,"accepted":28283,"submitted":50519,"acceptance":0.5598487697697896},{"id":3891,"title":"Minimum Increase to Maximize Special Indices","slug":"minimum-increase-to-maximize-special-indices","difficulty":2,"accepted":11871,"submitted":63732,"acceptance":0.18626435699491622},{"id":3892,"title":"Minimum Operations to Achieve At Least K Peaks","slug":"minimum-operations-to-achieve-at-least-k-peaks","difficulty":3,"accepted":5812,"submitted":19338,"acceptance":0.3005481435515565},{"id":3893,"title":"Maximum Team Size with Overlapping Intervals","slug":"maximum-team-size-with-overlapping-intervals","difficulty":2,"accepted":169,"submitted":252,"acceptance":0.6706349206349206}]