759 lines
724 KiB
Plaintext
759 lines
724 KiB
Plaintext
|
SQLite format 3 @ µ .�ú
|
|||
|
|
w Z�tabletagstagsCREATE TABLE tags (
|
|||
|
|
tag TEXT NOT NULL,
|
|||
|
|
refs TEXT NOT NULL
|
|||
|
|
)ƒ …_tableproblemsproblemsCREATE TABLE problems (
|
|||
|
|
category TEXT NOT NULL,
|
|||
|
|
fid INTEGER NOT NULL,
|
|||
|
|
id INTEGER NOT NULL PRIMARY KEY,
|
|||
|
|
level INTEGER NOT NULL,
|
|||
|
|
locked BOOLEAN NOT NULL DEFAULT 0,
|
|||
|
|
name TEXT NOT NULL,
|
|||
|
|
percent FLOAT NOT NULL,
|
|||
|
|
slug TEXT NOT NULL,
|
|||
|
|
starred BOOLEAN NOT NULL DEFAULT 0,
|
|||
|
|
status TEXT NOT NULL,
|
|||
|
|
desc TEXT NOT NULL DEFAULT ""
|
|||
|
|
) ° à ûô à æ ì ò ø þ
|
|||
|
|
" ( . 4 : @ F L R X ^ d j p v | ‚ ˆ Ž ” š ¦ ¬ ² ¸ ¾ Ä Ê Ð Ö Ü â è î ô ú
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
$
|
|||
|
|
*
|
|||
|
|
0
|
|||
|
|
6
|
|||
|
|
<
|
|||
|
|
B
|
|||
|
|
H
|
|||
|
|
N
|
|||
|
|
T
|
|||
|
|
Z
|
|||
|
|
`
|
|||
|
|
f
|
|||
|
|
l
|
|||
|
|
r
|
|||
|
|
x
|
|||
|
|
~
|
|||
|
|
„
|
|||
|
|
Š
|
|||
|
|
�
|
|||
|
|
–
|
|||
|
|
œ
|
|||
|
|
¢
|
|||
|
|
¨
|
|||
|
|
®
|
|||
|
|
´
|
|||
|
|
º
|
|||
|
|
À
|
|||
|
|
Æ
|
|||
|
|
Ì
|
|||
|
|
Ò
|
|||
|
|
Ø
|
|||
|
|
Þ
|
|||
|
|
ä
|
|||
|
|
ê
|
|||
|
|
ð
|
|||
|
|
ö
|
|||
|
|
ü &,28>DJPV\bhntz€†Œ’˜ž¤ª°¶¼ÂÈÎÔÚàæìòøþ
|
|||
|
|
"(.4:@FLRX^djpv|‚ˆŽ”š ¦¬²¸¾ÄÊÐÖÜâèî � ´�' ³�P ²�i ±� °‚ ¯‚3 ®‚I ‚` ¬‚y «ƒ ªƒ) ©ƒE ¨ƒa §ƒ} ¦„ ¥„* ¤„P £„y ¢… ¡…* …K Ÿ…d ž…{ �† œ†' ›†= š†[ ™†u ˜‡ —‡" –‡; •‡T ”‡k “ˆ ’ˆ ‘ˆ) �ˆ@ �ˆW Žˆk �‰ Œ‰( ‹‰E Š‰_ ‰‰y ˆŠ ‡Š, †ŠD …ŠW „Šm ƒ‹ ‚‹ �‹+ €‹@ ‹S ~‹k }Œ |Œ {Œ' zŒM yŒ` xŒt w�
|
|||
|
|
v�! u�3 t�I s�\ r�q qŽ pŽ oŽ3 nŽR mŽg lŽ{ k� j�' i�> h�Q g�d f�x e� d�# c�8 b�K a�^ `�r _‘ ^‘ ]‘- \‘A [‘S Z‘c Y‘u X’
|
|||
|
|
W’ V’1 U’E T’[ S’p R“ Q“ P“3 O“H N“^ M“q L” K” J”( I”< H”P G”c F”v E• D• C•< B•g A– @–! ?–> >–X =—# <—Z ;˜ :˜L 9˜h 8˜| 7™ 6™ 5™0 4™E 3™b 2™v 1š 0š /š5 .šI -šZ ,šm +› *› )›' (›: '›N &›c %›t $œ #œ "œ0 !œD œb œt � � �4 �H �] �p ž ž ž* ž@ žW žm Ÿ Ÿ" Ÿ8 ŸS Ÿe
|
|||
|
|
Ÿw ,
|
|||
|
|
> U r g 3
|
|||
|
|
|
|||
|
|
µ
|
|||
|
|
L
|
|||
|
|
|
|||
|
|
… ;Å�+Ë8éo1ï§W
|
|||
|
|
ɃG É�Mæô²X ! CC
|
|||
|
|
algorithmsMedian of Two Sorted Arrays@G 9 median-of-two-sorted-arraysac@ ! ++
|
|||
|
|
algorithmsReverse Integer@?š` reverse-integerac\ ! GG
|
|||
|
|
algorithmsLongest Palindromic Substring@B¸÷ longest-palindromic-substringacD ! //
|
|||
|
|
algorithmsZigzag Conversion@J×` zigzag-conversionac B . !
|
|||
|
|
algorithmsTwo Sum@L–å@ two-sumac@ ! ++
|
|||
|
|
algorithmsAdd Two Numbers@H N@ add-two-numbersac~ ! ii
|
|||
|
|
algorithmsLongest Substring Without Repeating Characters@CQ0` longest-substring-without-repeating-charactersac23 !
|
|||
|
|
algorithms3N-Queens@RÄ!€ n-queensac12 !
|
|||
|
|
algorithms2Pow(x, n)@C,6@ powx-nac>1 ! ))
|
|||
|
|
algorithms1Group Anagrams@Rb@ group-anagramsac:0 ! %%
|
|||
|
|
algorithms0Rotate Image@SÛ}à rotate-imageac@/ ! ++
|
|||
|
|
algorithms/Permutations II@OŠe@ permutations-iiac:. ! %%
|
|||
|
|
algorithms.Permutations@Tm € permutationsac:- ! %%
|
|||
|
|
algorithms-Jump Game II@EGpà jump-game-iiacD, ! //
|
|||
|
|
algorithms,Wildcard Matching@?„Æ wildcard-matchingacB+ ! --
|
|||
|
|
algorithms+Multiply Strings@EÚÀ multiply-stringsacH* ! 33
|
|||
|
|
algorithms*Trapping Rain Water@P»s` trapping-rain-wateracN) ! 99
|
|||
|
|
algorithms)First Missing Positive@EEšÀ first-missing-positiveacF( ! 11
|
|||
|
|
algorithms(Combination Sum II@M‹À@ combination-sum-iiac@' ! ++
|
|||
|
|
algorithms'Combination Sum@S º` combination-sumac<& ! ''
|
|||
|
|
algorithms&Count and Say@O9Và count-and-sayac<% ! ''
|
|||
|
|
algorithms%Sudoku Solver@PYN` sudoku-solverac:$ ! %%
|
|||
|
|
algorithms$Valid Sudoku@P"` valid-sudokuacM# ! 99
|
|||
|
|
algorithms#Search Insert Position@IlŠ€ search-insert-positionac�" ! {{
|
|||
|
|
algorithms"Find First and Last Position of Element in Sorted Array@H=²à find-first-and-last-position-of-element-in-sorted-arrayac^! ! II
|
|||
|
|
algorithms!Search in Rotated Sorted Array@F‰@ search-in-rotated-sorted-arrayacT ! ??
|
|||
|
|
algorithms Longest Valid Parentheses@C •@ longest-valid-parenthesesacB ! --
|
|||
|
|
algorithms Next Permutation@Fm)À next-permutationact ! __
|
|||
|
|
algorithms Substring with Concatenation of All Words@A XÀ substring-with-concatenation-of-all-wordsacH ! 33
|
|||
|
|
algorithms Divide Two Integers@3y¾ divide-two-integersac� ! qq
|
|||
|
|
algorithms Find the Index of the First Occurrence in a String@G+\ find-the-index-of-the-first-occurrence-in-a-stringac= ! ))
|
|||
|
|
algorithmsRemove Element@N½€ remove-elementacg ! SS
|
|||
|
|
algorithmsRemove Duplicates from Sorted Array@O3?` remove-duplicates-from-sorted-arrayacR ! ==
|
|||
|
|
algorithmsReverse Nodes in k-Group@Pbz` reverse-nodes-in-k-groupacH ! 33
|
|||
|
|
algorithmsSwap Nodes in Pairs@QE] swap-nodes-in-pairsacJ ! 55
|
|||
|
|
algorithmsMerge k Sorted Lists@M‡¢@ merge-k-sorted-listsacJ ! 55
|
|||
|
|
algorithmsGenerate Parentheses@S—ð generate-parenthesesacM ! 99
|
|||
|
|
algorithmsMerge Two Sorted Lists@Q merge-two-sorted-listsacC ! //
|
|||
|
|
algorithmsValid Parentheses@Eé
|
|||
|
|
@ valid-parenthesesacb ! MM
|
|||
|
|
algorithmsRemove Nth Node From End of List@I�. remove-nth-node-from-end-of-listac* !
|
|||
|
|
algorithms4Sum@D¬€ 4sumacl ! WW
|
|||
|
|
algorithmsLetter Combinations of a Phone Number@Phê letter-combinations-of-a-phone-numberac: ! %%
|
|||
|
|
algorithms3Sum Closest@H@ 3sum-closestac* !
|
|||
|
|
algorithms3Sum@CY® 3sumacK ! 77
|
|||
|
|
algorithmsLongest Common Prefix@Gš~ longest-common-prefixacA
|
|||
|
|
! --
|
|||
|
|
algorithms
|
|||
|
|
Roman to Integer@P–B roman-to-integeracB ! --
|
|||
|
|
algorithms Integer to Roman@Q¤À integer-to-romanacT ! ??
|
|||
|
|
algorithms Container With Most Water@MÒÆ` container-with-most-wateracX
|
|||
|
|
! CC
|
|||
|
|
algorithms
|
|||
|
|
Regular Expression Matching@>�õ regular-expression-matchingacC ! //
|
|||
|
|
algorithms Palindrome Number@N+ palindrome-numberacP ! =9
|
|||
|
|
algorithmsString to Integer (atoi)@4®à string-to-integer-atoiac
|
|||
|
|
? 4 } RÐÕ“ñÐŒk1õ³o3h1éºy;ý·ŒR } ÑÆVð‚
|
|||
|
|
»
|
|||
|
|
u
|
|||
|
|
5 ó ¬ v > ´ h
|
|||
|
|
|
|||
|
|
U
|
|||
|
|
± Y $å �j3d ! RL ! ==
|
|||
|
|
algorithmsLMinimum Window Substring@G‹ À minimum-window-substringac0N !
|
|||
|
|
algorithmsNSubsets@T‡d subsetsac:M ! %%
|
|||
|
|
algorithmsMCombinations@R‘± combinationsacÔ 8K ! ##
|
|||
|
|
algorithmsKSort Colors@QR:€ sort-colorsacFJ ! 11
|
|||
|
|
algorithmsJSearch a 2D Matrix@JÐÃà search-a-2d-matrixac› @9 ! ++
|
|||
|
|
algorithms9Insert Interval@Fn> insert-intervalac:A ! %%
|
|||
|
|
algorithmsAValid Number@6¯ä@ valid-numberacB@ ! --
|
|||
|
|
algorithms@Minimum Path Sum@PúT€ minimum-path-sumac@? ! ++
|
|||
|
|
algorithms?Unique Paths II@F unique-paths-iiac:> ! %%
|
|||
|
|
algorithms>Unique Paths@P§�à unique-pathsac8= ! ##
|
|||
|
|
algorithms=Rotate List@D¬z@ rotate-listacJ< ! 55
|
|||
|
|
algorithms<Permutation Sequence@J+@ permutation-sequenceacDI ! //
|
|||
|
|
algorithmsISet Matrix Zeroes@OF5à set-matrix-zeroesac<H ! ''
|
|||
|
|
algorithmsHEdit Distance@N �@ edit-distanceac<G ! ''
|
|||
|
|
algorithmsGSimplify Path@IÅà simplify-pathac?F ! ++
|
|||
|
|
algorithmsFClimbing Stairs@JùIÀ climbing-stairsac-E !
|
|||
|
|
algorithmsESqrt(x)@DÄD sqrtxacFD ! 11
|
|||
|
|
algorithmsDText Justification@IID text-justificationac5C ! !!
|
|||
|
|
algorithmsCAdd Binary@Làvà add-binaryac1B !
|
|||
|
|
algorithmsBPlus One@HÓS€ plus-oneac 5 <6 ! ''
|
|||
|
|
algorithms6Spiral Matrix@L&© spiral-matrixacB5 ! --
|
|||
|
|
algorithms5Maximum Subarray@J†ñà maximum-subarrayac84 ! ##
|
|||
|
|
algorithms4N-Queens II@S’ n-queens-iiacB; ! --
|
|||
|
|
algorithms;Spiral Matrix II@R¯#@ spiral-matrix-iiacG: ! 33
|
|||
|
|
algorithms:Length of Last Word@M5O` length-of-last-wordac z @8 ! ++
|
|||
|
|
algorithms8Merge Intervals@I«±` merge-intervalsac47 !
|
|||
|
|
algorithms7Jump Game@DHŸ@ jump-gameacrg ! ]]
|
|||
|
|
algorithmsgBinary Tree Zigzag Level Order Traversal@O¦À binary-tree-zigzag-level-order-traversalacdf ! OO
|
|||
|
|
algorithmsfBinary Tree Level Order Traversal@RÈ binary-tree-level-order-traversalac=e ! ))
|
|||
|
|
algorithmseSymmetric Tree@Nl‘@ symmetric-treeac3d !
|
|||
|
|
algorithmsdSame Tree@P°R€ same-treeacVc ! AA
|
|||
|
|
algorithmscRecover Binary Search Tree@M}È` recover-binary-search-treeacXb ! CC
|
|||
|
|
algorithmsbValidate Binary Search Tree@AºK€ validate-binary-search-treeacHa ! 33
|
|||
|
|
algorithmsaInterleaving String@EÐÙ interleaving-stringacV` ! AA
|
|||
|
|
algorithms`Unique Binary Search Trees@O³w` unique-binary-search-treesac\_ ! GG
|
|||
|
|
algorithms_Unique Binary Search Trees II@O
|
|||
|
|
TÀ unique-binary-search-trees-iiac[^ ! GG
|
|||
|
|
algorithms^Binary Tree Inorder Traversal@SóªÀ binary-tree-inorder-traversalacJ] ! 55
|
|||
|
|
algorithms]Restore IP Addresses@K½ restore-ip-addressesacN\ ! 99
|
|||
|
|
algorithms\Reverse Linked List II@I�±€ reverse-linked-list-iiac8[ ! ##
|
|||
|
|
algorithms[Decode Ways@BÚ@ decode-waysac6Z ! !!
|
|||
|
|
algorithmsZSubsets II@N} € subsets-iiac4Y !
|
|||
|
|
algorithmsYGray Code@P@ gray-codeacEX ! 11
|
|||
|
|
algorithmsXMerge Sorted Array@K@ merge-sorted-arrayac@W ! ++
|
|||
|
|
algorithmsWScramble String@Fÿ@ scramble-stringac>V ! ))
|
|||
|
|
algorithmsVPartition List@N`1 partition-listacDU ! //
|
|||
|
|
algorithmsUMaximal Rectangle@M - maximal-rectangleac^T ! II
|
|||
|
|
algorithmsTLargest Rectangle in Histogram@H¹Ê@ largest-rectangle-in-histogramaceS ! QQ
|
|||
|
|
algorithmsSRemove Duplicates from Sorted List@L0ÿ remove-duplicates-from-sorted-listaclR ! WW
|
|||
|
|
algorithmsRRemove Duplicates from Sorted List II@I·÷À remove-duplicates-from-sorted-list-iiacdQ ! OO
|
|||
|
|
algorithmsQSearch in Rotated Sorted Array II@CçM` search-in-rotated-sorted-array-iiacnP ! YY
|
|||
|
|
algorithmsPRemove Duplicates from Sorted Array II@P€ remove-duplicates-from-sorted-array-iiac8O ! ##
|
|||
|
|
algorithmsOWord Search@G{# word-searchac
|
|||
|
|
Ì * k ¸!%®â—< ÏgŸ Û‘X kŒô ^ ý º
|
|||
|
|
ž
|
|||
|
|
@ v ,
|
|||
|
|
ئj.þ¿y
|
|||
|
|
ß
|
|||
|
|
Ÿ
|
|||
|
|
X
|
|||
|
|
Ê g Ý¡Mí… Æ _y ! KK
|
|||
|
|
algorithmsyBest Time to Buy and Sell Stock@L?a@ best-time-to-buy-and-sell-stockac ÌU �i !
|
|||
|
|
algorithmsiConstruct Binary Tree from Preorder and Inorder Traversal@Q à construct-binary-tree-from-preorder-and-inorder-traversalacYh ! EE
|
|||
|
|
algorithmshMaximum Depth of Binary Tree@S~ì maximum-depth-of-binary-treeac�j! ��
|
|||
|
|
algorithmsjConstruct Binary Tree from Inorder and Postorder Traversal@Q construct-binary-tree-from-inorder-and-postorder-traversalacul ! aa
|
|||
|
|
algorithmslConvert Sorted Array to Binary Search Tree@RÒ–à convert-sorted-array-to-binary-search-treeacjk ! UU
|
|||
|
|
algorithmskBinary Tree Level Order Traversal II@Pñæ binary-tree-level-order-traversal-iiacHw ! 53
|
|||
|
|
algorithmswPascal's Triangle II@PÌaÀ pascals-triangle-iiacBv ! /-
|
|||
|
|
algorithmsvPascal's Triangle@S®õÀ pascals-triangleac~u ! ii
|
|||
|
|
algorithmsuPopulating Next Right Pointers in Each Node II@L�.à populating-next-right-pointers-in-each-node-iiacxt ! cc
|
|||
|
|
algorithmstPopulating Next Right Pointers in Each Node@Pºö populating-next-right-pointers-in-each-nodeacLs ! 77
|
|||
|
|
algorithmssDistinct Subsequences@IË- distinct-subsequencesacfr ! QQ
|
|||
|
|
algorithmsrFlatten Binary Tree to Linked List@Q•â flatten-binary-tree-to-linked-listac8q ! ##
|
|||
|
|
algorithmsqPath Sum II@Nî¾@ path-sum-iiac1p !
|
|||
|
|
algorithmspPath Sum@KDrÀ path-sumacYo ! EE
|
|||
|
|
algorithmsoMinimum Depth of Binary Tree@J>÷€ minimum-depth-of-binary-treeacIn ! 55
|
|||
|
|
algorithmsnBalanced Binary Tree@Lü¦` balanced-binary-treeactm ! __
|
|||
|
|
algorithmsmConvert Sorted List to Binary Search Tree@P‰� convert-sorted-list-to-binary-search-treeac2x !
|
|||
|
|
algorithmsxTriangle@Mîf triangleacfz ! QQ
|
|||
|
|
algorithmszBest Time to Buy and Sell Stock II@Q´ À best-time-to-buy-and-sell-stock-iiach{ ! SS
|
|||
|
|
algorithms{Best Time to Buy and Sell Stock III@J£í best-time-to-buy-and-sell-stock-iiiacZ| ! EE
|
|||
|
|
algorithms|Binary Tree Maximum Path Sum@E
|
|||
|
|
à binary-tree-maximum-path-sumacA~ ! ))
|
|||
|
|
algorithms~Word Ladder II@;’· word-ladder-iinotacA} ! --
|
|||
|
|
algorithms}Valid Palindrome@Jti valid-palindromeac[� ! EE
|
|||
|
|
algorithms €Longest Consecutive Sequence@Gƒ€ longest-consecutive-sequenceac8 ! ##
|
|||
|
|
algorithmsWord Ladder@F…“ word-ladderacQ� ! ;;
|
|||
|
|
algorithms ƒPalindrome Partitioning@Rq+à palindrome-partitioningacG� ! 11
|
|||
|
|
algorithms ‚Surrounded Regions@Fo- surrounded-regionsacS� ! ==
|
|||
|
|
algorithms �Sum Root to Leaf Numbers@QkP sum-root-to-leaf-numbersac 8 `� ! KK
|
|||
|
|
algorithms ‘Binary Tree Postorder Traversal@Soaà binary-tree-postorder-traversalac`� ! II
|
|||
|
|
algorithms �Binary Tree Preorder Traversal@RÓñ binary-tree-preorder-traversalNull=� ! %%
|
|||
|
|
algorithms �Reorder List@P1* reorder-listNullK� ! 55
|
|||
|
|
algorithms ŽLinked List Cycle II@L³Å linked-list-cycle-iiacD�
|
|||
|
|
! //
|
|||
|
|
algorithms �Linked List Cycle@JÿQà linked-list-cycleac=� ! ''
|
|||
|
|
algorithms ŒWord Break II@K™Ž@ word-break-iiac7� ! !!
|
|||
|
|
algorithms ‹Word Break@H™0à word-breakac]�
|
|||
|
|
! GG
|
|||
|
|
algorithms ŠCopy List with Random Pointer@OAV copy-list-with-random-pointeracC� ! --
|
|||
|
|
algorithms ‰Single Number II@P²ñ single-number-iiac<� ! ''
|
|||
|
|
algorithms ˆSingle Number@S[W€ single-numberac-� !
|
|||
|
|
algorithms ‡Candy@H E candyac9� ! ##
|
|||
|
|
algorithms †Gas Station@GÏ gas-stationac9� ! ##
|
|||
|
|
algorithms …Clone Graph@P5y` clone-graphacW� ! AA
|
|||
|
|
algorithms „Palindrome Partitioning II@BY1€ palindrome-partitioning-iiac
|
|||
|
|
› u*Èu$
|
|||
|
|
¶
|
|||
|
|
' ¹ I Û {›
|
|||
|
|
Æ
|
|||
|
|
O å } 6çg {¡ ee
|
|||
|
|
databaseøFind Users with Persistent Behavior Patterns@P>" find-users-with-persistent-behavior-patternsNullK¡% ! 33
|
|||
|
|
algorithmsReverse K Subarrays@WðÀ reverse-k-subarraysNull}¡ ! ee
|
|||
|
|
algorithms Maximum Requests Without Violating the Limit@Qb maximum-requests-without-violating-the-limitNullL¡ ! 55
|
|||
|
|
algorithmsMinimum Capacity Box@R¾à minimum-capacity-boxNullD¡ ! 33
|
|||
|
|
algorithmsUnique Email GroupsZunique-email-groupsNulle¡ ! MM
|
|||
|
|
algorithmsFind the Smallest Balanced Index@3 ` find-the-smallest-balanced-indexNullg¡ ! OO
|
|||
|
|
algorithmsSum of K-Digit Numbers in a Range@Hóë` sum-of-k-digit-numbers-in-a-rangeNullt¡ ! ]]
|
|||
|
|
algorithms Smallest Pair With Different Frequencies@QR¥€ smallest-pair-with-different-frequenciesNullL¡ ! 55
|
|||
|
|
algorithmsTrim Trailing Vowels@SE®à trim-trailing-vowelsNullc¡ ! KK
|
|||
|
|
algorithmsýDelayed Count of Equal Elements@T2Ü` delayed-count-of-equal-elementsNull]¡ ! EE
|
|||
|
|
algorithmsCheck Digitorial Permutation@G:<` check-digitorial-permutationNullk¡ ! SS
|
|||
|
|
algorithmsFind the Score Difference in a Game@R%@ find-the-score-difference-in-a-gameNullm } ! UU
|
|||
|
|
algorithmsLongest Almost-Palindromic Substring@6˜€ longest-almost-palindromic-substringNullk | ! SS
|
|||
|
|
algorithmsMinimum Operations to Sort a String@2®€ minimum-operations-to-sort-a-stringNull� { ! ss
|
|||
|
|
algorithmsMinimum Operations to Make Array Parity Alternating@0Kî€ minimum-operations-to-make-array-parity-alternatingNullk y ! SS
|
|||
|
|
algorithmsFirst Element with Unique Frequency@Qob first-element-with-unique-frequencyNullN x ! 77
|
|||
|
|
algorithmsþWeighted Word Mapping@USûà weighted-word-mappingNullP v ! 99
|
|||
|
|
algorithmsùCount Dominant Indices@Pp& count-dominant-indicesNull_ u ! GG
|
|||
|
|
algorithmsúMerge Adjacent Equal Elements@DúI merge-adjacent-equal-elementsNullH t ! 11
|
|||
|
|
algorithmsToggle Light Bulbs@Q÷D toggle-light-bulbsNull� s ! oo
|
|||
|
|
algorithmsûCount Subarrays With Cost Less Than or Equal to K@F¿@ count-subarrays-with-cost-less-than-or-equal-to-kNull
|
|||
|
|
– ¦S‰
|
|||
|
|
—
|
|||
|
|
D– » y
|
|||
|
|
ë
|
|||
|
|
‡
|
|||
|
|
£ ?ûÓc b c MM
|
|||
|
|
databaseÑFind Users with High Token Usage@LwºÀ find-users-with-high-token-usageNulle p OO
|
|||
|
|
databaseàFind Emotionally Consistent Users@I㉠find-emotionally-consistent-usersNullm r ! UU
|
|||
|
|
algorithms÷Median of a Binary Search Tree Level@V™/` median-of-a-binary-search-tree-levelNulli q ! QQ
|
|||
|
|
algorithmsPalindromic Path Queries in a Tree@AzT palindromic-path-queries-in-a-treeNulla o ! II
|
|||
|
|
algorithmséGood Indices in a Digit String@V
|
|||
|
|
j good-indices-in-a-digit-stringNulls l ! [[
|
|||
|
|
algorithmsMaximum Subarray XOR with Bounded Range@??’` maximum-subarray-xor-with-bounded-rangeNullk j ! SS
|
|||
|
|
algorithmsüMaximum Score Using Exactly K Pairs@D®_ maximum-score-using-exactly-k-pairsNulla i ! II
|
|||
|
|
algorithmsîDesign Order Management System@TFÈ€ design-order-management-systemNull�
|
|||
|
|
h ! ss
|
|||
|
|
algorithmsïReverse Letters Then Special Characters in a String@TkpÀ reverse-letters-then-special-characters-in-a-stringNull� g ! }}
|
|||
|
|
algorithmsêMinimum Prefix Removal to Make Array Strictly Increasing@Rk®€ minimum-prefix-removal-to-make-array-strictly-increasingNull�% f! � �
|
|||
|
|
algorithmsöLongest Alternating Subarray After Removing At Most One Element@>t� longest-alternating-subarray-after-removing-at-most-one-elementNull� e ! mm
|
|||
|
|
algorithmsßMinimum Cost to Repair Edges to Traverse a Graph@Mõ ` minimum-cost-to-repair-edges-to-traverse-a-graphNullP b ! 99
|
|||
|
|
algorithmsóCount Monobit Integers@Pˆ6 count-monobit-integersNullw ` ! __
|
|||
|
|
algorithmsMinimum Cost to Partition a Binary String@JPP€ minimum-cost-to-partition-a-binary-stringNullu ^ ! ]]
|
|||
|
|
algorithmsâMinimum Operations to Reach Target Array@O². minimum-operations-to-reach-target-arrayNullw ] ! __
|
|||
|
|
algorithmsíFind Nth Smallest Integer With K One Bits@A#ï find-nth-smallest-integer-with-k-one-bitsNullM [ ! 55
|
|||
|
|
algorithmsáBest Reachable Tower@KÒ{€ best-reachable-towerNullP Z ! 99
|
|||
|
|
algorithmsÛCount Residue Prefixes@PZ‰` count-residue-prefixesNullW W ! ??
|
|||
|
|
algorithmsÝCount Caesar Cipher Pairs@IwV` count-caesar-cipher-pairsNull
|
|||
|
|
y„
|
|||
|
|
á
|
|||
|
|
w ÷ –
|
|||
|
|
E
|
|||
|
|
í
|
|||
|
|
‘
|
|||
|
|
Ì { .¾Z S I ==
|
|||
|
|
database´Most Common Course Pairs@I B` most-common-course-pairsNulla U ! II
|
|||
|
|
algorithmsäMinimum Edge Toggles on a Tree@Q3± minimum-edge-toggles-on-a-treeNullm T ! UU
|
|||
|
|
algorithmsìPythagorean Distance Nodes in a Tree@LÙ.à pythagorean-distance-nodes-in-a-treeNullJ S ! 33
|
|||
|
|
algorithmsÖLargest Even Number@QOc€ largest-even-numberNullN R ! 77
|
|||
|
|
algorithmsåVowel-Consonant Score@Jùkà vowel-consonant-scoreNullN Q ! 77
|
|||
|
|
algorithmsÒReverse String Prefix@V\X reverse-string-prefixNullq P ! YY
|
|||
|
|
algorithmsðMinimum K to Reduce Array Within Limit@D‰ minimum-k-to-reduce-array-within-limitNullY O ! AA
|
|||
|
|
algorithmsÎSmallest All-Ones Multiple@Gp« smallest-all-ones-multipleNullU M ! ==
|
|||
|
|
algorithmsÌMaximum Score of a Split@IÇ[À maximum-score-of-a-splitNulle L ! MM
|
|||
|
|
algorithmsÐSum of Increasing Product Blocks@Q÷ sum-of-increasing-product-blocksNull] K ! EE
|
|||
|
|
algorithmsëRotate Non Negative Elements@GévÀ rotate-non-negative-elementsNull� J ! mm
|
|||
|
|
algorithmsTotal Distance to Type a String Using One Finger@VЬ total-distance-to-type-a-string-using-one-fingerNull^ H ! GG
|
|||
|
|
algorithmsÇMirror Distance of an Integer@Uãü mirror-distance-of-an-integerNull} F ! ee
|
|||
|
|
algorithms³Maximum Total Sum with Threshold Constraints@U ÿ maximum-total-sum-with-threshold-constraintsNullg E ! OO
|
|||
|
|
algorithmsËFind Diameter Endpoints of a Tree@QH find-diameter-endpoints-of-a-treeNull� D! ��
|
|||
|
|
algorithmsÆLast Remaining Integer After Alternating Deletion Operations@H=[ last-remaining-integer-after-alternating-deletion-operationsNull� B ! yy
|
|||
|
|
algorithmsÃMinimum Number of Operations to Have Distinct Elements@Eà minimum-number-of-operations-to-have-distinct-elementsNull] A ! EE
|
|||
|
|
algorithmsMinimum Bitwise OR From Grid@9íp minimum-bitwise-or-from-gridNull� @ ! kk
|
|||
|
|
algorithmsÄMaximum Sum of Three Numbers Divisible by Three@GÖ±à maximum-sum-of-three-numbers-divisible-by-threeNull
|
|||
|
|
~ ~¢
|
|||
|
|
³
|
|||
|
|
? Û p w
|
|||
|
|
ÿ
|
|||
|
|
z
|
|||
|
|
Š ~ � >! ��
|
|||
|
|
algorithms¾Absolute Difference Between Maximum and Minimum K Elements@RÚXà absolute-difference-between-maximum-and-minimum-k-elementsNullk = ! SS
|
|||
|
|
algorithms¿Reverse Words With Same Vowel Count@P¥Ïà reverse-words-with-same-vowel-countNull < ! gg
|
|||
|
|
algorithmsØMinimum Cost to Make Two Binary Strings Equal@CcIÀ minimum-cost-to-make-two-binary-strings-equalNullk ; ! SS
|
|||
|
|
algorithms½Maximum Number of Equal Length Runs@U
|
|||
|
|
à maximum-number-of-equal-length-runsNull� : ! ii
|
|||
|
|
algorithmsÞMaximum Bitwise AND After Increment Operations@?Q‰ maximum-bitwise-and-after-increment-operationsNullu 9 ! ]]
|
|||
|
|
algorithmsÕCount Routes to Climb a Rectangular Grid@8H count-routes-to-climb-a-rectangular-gridNull�
|
|||
|
|
8 ! uu
|
|||
|
|
algorithmsÓMinimum Subarray Length With Distinct Sum At Least K@?¨I minimum-subarray-length-with-distinct-sum-at-least-kNulle 7 ! MM
|
|||
|
|
algorithms¼Maximum Subgraph Score in a Tree@Q¤¦À maximum-subgraph-score-in-a-treeNullh 6 ! QQ
|
|||
|
|
algorithms¹Sort Integers by Binary Reflection@NbÎÀ sort-integers-by-binary-reflectionNulla 4 ! II
|
|||
|
|
algorithms®Convert Number Words to Digits@Q†ôà convert-number-words-to-digitsNullq 3 ! YY
|
|||
|
|
algorithmsÍMinimum Cost to Acquire Required Items@Afi@ minimum-cost-to-acquire-required-itemsNull[ 2 ! CC
|
|||
|
|
algorithms»Total Score of Dungeon Runs@>�# total-score-of-dungeon-runsNull�
|
|||
|
|
1 ! uu
|
|||
|
|
algorithms¸Minimum Inversion Count in Subarrays of Fixed Length@E3° minimum-inversion-count-in-subarrays-of-fixed-lengthNulli 0 ! QQ
|
|||
|
|
algorithmsÙMinimum Cost to Merge Sorted Lists@AÀ minimum-cost-to-merge-sorted-listsNullm / ! UU
|
|||
|
|
algorithmsãNumber of Alternating XOR Partitions@:°œ number-of-alternating-xor-partitionsNull - ! gg
|
|||
|
|
algorithms¯Count Elements With at Least K Greater Values@?F¢ count-elements-with-at-least-k-greater-valuesNull
|
|||
|
|
C ¤ÅQ
|
|||
|
|
É
|
|||
|
|
8 Æ f þ š 2
|
|||
|
|
¨
|
|||
|
|
± $ŸC Y , ! AA
|
|||
|
|
algorithms¥Evaluate Valid Expressions@R» evaluate-valid-expressionsNull� + ! ii
|
|||
|
|
algorithms±Minimum Absolute Distance Between Mirror Pairs@F,Þ€ minimum-absolute-distance-between-mirror-pairsNull� * ! qq
|
|||
|
|
algorithmsÈMinimum Deletion Cost to Make All Characters Equal@K€õ` minimum-deletion-cost-to-make-all-characters-equalNullg ) ! OO
|
|||
|
|
algorithmsÿNumber of Prefix Connected Groups@NBå@ number-of-prefix-connected-groupsNull� ( ! qq
|
|||
|
|
algorithms¬Concatenate Non-Zero Digits and Multiply by Sum II@8&:€ concatenate-non-zero-digits-and-multiply-by-sum-iiNull� ' ! oo
|
|||
|
|
algorithmsªConcatenate Non-Zero Digits and Multiply by Sum I@KÝ—À concatenate-non-zero-digits-and-multiply-by-sum-iNulle & ! MM
|
|||
|
|
algorithmsNumber of Effective Subsequences@>ª¡ number-of-effective-subsequencesNulla $ ! II
|
|||
|
|
algorithmsÚNumber of Ways to Paint Sheets@P£Î number-of-ways-to-paint-sheetsNulle " ! MM
|
|||
|
|
algorithmsÅMaximum Score After Binary Swaps@A€b maximum-score-after-binary-swapsNull] ! ! EE
|
|||
|
|
algorithmsÜNumber of Centered Subarrays@P¼Š number-of-centered-subarraysNullo ! WW
|
|||
|
|
algorithms©Total Waviness of Numbers in Range II@9pž@ total-waviness-of-numbers-in-range-iiNull�
|
|||
|
|
! uu
|
|||
|
|
algorithmsÂMinimum Distance Excluding One Maximum Weighted Edge@G2ŽÀ minimum-distance-excluding-one-maximum-weighted-edgeNull� ! mm
|
|||
|
|
algorithms¦Minimum Number of Flips to Reverse Binary String@S ’à minimum-number-of-flips-to-reverse-binary-stringNullq ! YY
|
|||
|
|
algorithmsôFinal Element After Subarray Deletions@D´ final-element-after-subarray-deletionsNullS ! ;;
|
|||
|
|
algorithmsòMinimum Partition Score@@ôÝ minimum-partition-scoreNull� ! mm
|
|||
|
|
algorithms�Minimum Distance Between Three Equal Elements II@PNÍ minimum-distance-between-three-equal-elements-iiNullY ! AA
|
|||
|
|
algorithmsõDesign Ride Sharing System@O³M` design-ride-sharing-systemNull
|
|||
|
|
Ç Œ
|
|||
|
|
Ç–
|
|||
|
|
å
|
|||
|
|
e
|
|||
|
|
|! ï ž
|
|||
|
|
¯
|
|||
|
|
[ ê xòy WŸ{ AA
|
|||
|
|
databaseyFind Golden Hour Customers@AR_À find-golden-hour-customersNullU ??
|
|||
|
|
database„Find Churn Risk Customers@G¹õÀ find-churn-risk-customersNullv ! __
|
|||
|
|
algorithms˜Minimum Moves to Equal Array Elements III@TUw@ minimum-moves-to-equal-array-elements-iiiNull� ! kk
|
|||
|
|
algorithmsœMinimum Distance Between Three Equal Elements I@N?߀ minimum-distance-between-three-equal-elements-iNullo ! WW
|
|||
|
|
algorithms Find Kth Character in Expanded String@Lê—@ find-kth-character-in-expanded-stringNulln ! WW
|
|||
|
|
algorithms¡Maximize Expression of Three Elements@RbÀ maximize-expression-of-three-elementsNullQ ! 99
|
|||
|
|
algorithms¤Count Stable Subarrays@@-é` count-stable-subarraysNullg
|
|||
|
|
! OO
|
|||
|
|
algorithms’Maximum Calories Burnt from Jumps@R6‘ maximum-calories-burnt-from-jumpsNull� ! ii
|
|||
|
|
algorithms…Minimum Operations to Make the Array Beautiful@Cv minimum-operations-to-make-the-array-beautifulNullN ! 77
|
|||
|
|
algorithms“Find Missing Elements@T¼Ó@ find-missing-elementsNull�
|
|||
|
|
! qq
|
|||
|
|
algorithms—Lexicographically Smallest String After Reverse II@Fu×` lexicographically-smallest-string-after-reverse-iiNull� ! {{
|
|||
|
|
algorithms”Maximum Product of Three Elements After One Replacement@G˜LÀ maximum-product-of-three-elements-after-one-replacementNullO ! 77
|
|||
|
|
algorithmsµComplete Prime Number@B. complete-prime-numberNull} ! ee
|
|||
|
|
algorithms¶Minimum Operations to Make Binary Palindrome@IË_à minimum-operations-to-make-binary-palindromeNull�- ! ��
|
|||
|
|
algorithmsšLongest Non-Decreasing Subarray After Replacing at Most One Element@5˜4@ longest-non-decreasing-subarray-after-replacing-at-most-one-elementNullqŸ ! YY
|
|||
|
|
algorithmsÏNumber of Balanced Integers in a Range@Axë number-of-balanced-integers-in-a-rangeNullŸz ! gg
|
|||
|
|
algorithms¢Minimum String Length After Balanced Removals@S˜·@ minimum-string-length-after-balanced-removalsNullqŸy ! YY
|
|||
|
|
algorithms·Maximize Points After Choosing K Tasks@Mõ€ maximize-points-after-choosing-k-tasksNull
|
|||
|
|
6 s-&
|
|||
|
|
°
|
|||
|
|
8 ‰ ¹ V
|
|||
|
|
Ô
|
|||
|
|
A × _ª6 qŸw ! YY
|
|||
|
|
algorithms°Maximum Substrings With Distinct Start@VÕ„ maximum-substrings-with-distinct-startNull�1Ÿv! ��
|
|||
|
|
algorithmsèLexicographically Smallest String After Deleting Duplicate Characters@3„²à lexicographically-smallest-string-after-deleting-duplicate-charactersNulluŸu ! ]]
|
|||
|
|
algorithmsºLargest Prime from Consecutive Prime Sum@Cy; largest-prime-from-consecutive-prime-sumNullgŸt ! OO
|
|||
|
|
algorithms‹Maximize Sum of Squares of Digits@Myúà maximize-sum-of-squares-of-digitsNull�Ÿs ! ww
|
|||
|
|
algorithms�Stable Subarrays With Equal Boundary and Interior Sum@9ú“ stable-subarrays-with-equal-boundary-and-interior-sumNullŸq ! gg
|
|||
|
|
algorithmsMaximum Transactions Without Negative Balance@G<¿À maximum-transactions-without-negative-balanceNull`Ÿp ! II
|
|||
|
|
algorithms†Smallest Missing Multiple of K@OŽSÀ smallest-missing-multiple-of-kNullaŸo ! II
|
|||
|
|
algorithmsæMaximum Capacity Within Budget@4A@ maximum-capacity-within-budgetNulliŸn ! QQ
|
|||
|
|
algorithms�Maximum Alternating Sum of Squares@N›M@ maximum-alternating-sum-of-squaresNull�+Ÿm! ��
|
|||
|
|
algorithms¨Lexicographically Smallest Negated Permutation that Sums to Target@>âœ` lexicographically-smallest-negated-permutation-that-sums-to-targetNulluŸk ! ]]
|
|||
|
|
algorithms›Count Subarrays With Majority Element II@FY À count-subarrays-with-majority-element-iiNullsŸj ! [[
|
|||
|
|
algorithms™Count Subarrays With Majority Element I@PT} count-subarrays-with-majority-element-iNull�Ÿi ! kk
|
|||
|
|
algorithmsŠLexicographically Smallest String After Reverse@KUé@ lexicographically-smallest-string-after-reverseNull}Ÿh ! ee
|
|||
|
|
algorithmsÊTotal Sum of Interaction Cost in Tree Groups@JÑ € total-sum-of-interaction-cost-in-tree-groupsNullCŸg ! ++
|
|||
|
|
algorithms×Word Squares II@Kk€ word-squares-iiNull� Ÿf ! qq
|
|||
|
|
algorithmszMaximum Distance Between Unequal Words in Array II@R1 maximum-distance-between-unequal-words-in-array-iiNull
|
|||
|
|
€ LÌl
|
|||
|
|
|
|||
|
|
š
|
|||
|
|
E é Œ Ò ;
|
|||
|
|
´
|
|||
|
|
d Ú ˆ € �Ÿe ! kk
|
|||
|
|
algorithms�Count Ways to Choose Coprime Integers from Rows@H*@ count-ways-to-choose-coprime-integers-from-rowsNull~Ÿd ! gg
|
|||
|
|
algorithms€Sum of Elements With Frequency Divisible by K@SlM@ sum-of-elements-with-frequency-divisible-by-kNullOŸc ! 77
|
|||
|
|
algorithmsçDesign Auction System@DøN` design-auction-systemNull�Ÿb ! oo
|
|||
|
|
algorithmspMaximum Distance Between Unequal Words in Array I@T§2€ maximum-distance-between-unequal-words-in-array-iNullMŸa ! 55
|
|||
|
|
algorithms
|
|||
|
|
Count Sequences to K@A¿@ count-sequences-to-kNull�Ÿ` ! kk
|
|||
|
|
algorithmsÁMinimum Deletions to Make Alternating Substring@Fvp minimum-deletions-to-make-alternating-substringNull�Ÿ_ ! {{
|
|||
|
|
algorithms‘Count Distinct Subarrays Divisible by K in Sorted Array@;p1€ count-distinct-subarrays-divisible-by-k-in-sorted-arrayNullAŸ^ ! ))
|
|||
|
|
algorithms House Robber V@Jø,€ house-robber-vNullsŸ] ! [[
|
|||
|
|
algorithmsÉMinimum Swaps to Avoid Forbidden Values@>R[€ minimum-swaps-to-avoid-forbidden-valuesNullZŸ\ ! CC
|
|||
|
|
algorithmsgLibrary Late Fee Calculator@W– À library-late-fee-calculatorNullYŸ[ ! AA
|
|||
|
|
algorithms}Design Exam Scores Tracker@Eù¢€ design-exam-scores-trackerNullRŸZ ! ;;
|
|||
|
|
algorithmsuCompute Alternating Sum@Vs’ compute-alternating-sumNullmŸY ! UU
|
|||
|
|
algorithms§Total Waviness of Numbers in Range I@T%] total-waviness-of-numbers-in-range-iNull_ŸX ! GG
|
|||
|
|
algorithms‚Longest Balanced Substring II@E M@ longest-balanced-substring-iiNull]ŸW ! EE
|
|||
|
|
algorithms�Longest Balanced Substring I@Qm? longest-balanced-substring-iNull}ŸV ! ee
|
|||
|
|
algorithms£Count Distinct Integers After Removing Zeros@6wt` count-distinct-integers-after-removing-zerosNull^ŸU ! GG
|
|||
|
|
algorithmslMajority Frequency Characters@PÃÝÀ majority-frequency-charactersNullPŸT ! 99
|
|||
|
|
algorithms{Equal Score Substrings@L\‰à equal-score-substringsNull
|
|||
|
|
{ {ž?Ù,
|
|||
|
|
ª
|
|||
|
|
R æ / Ì € É
|
|||
|
|
˜
|
|||
|
|
: Ú dúŠ KŸ9 55
|
|||
|
|
databaseIFind Loyal Customers@NWê find-loyal-customersNullKŸK 55
|
|||
|
|
databaseYFind Zombie Sessions@HP} find-zombie-sessionsNullpŸS ! YY
|
|||
|
|
algorithmsŽRemove Zeros in Decimal Representation@S[@ remove-zeros-in-decimal-representationNullmŸR ! UU
|
|||
|
|
algorithmsbMinimum Index Sum of Common Elements@S„,à minimum-index-sum-of-common-elementsNullgŸQ ! OO
|
|||
|
|
algorithmsxCount No-Zero Pairs That Sum to N@,Àß@ count-no-zero-pairs-that-sum-to-nNullsŸP ! [[
|
|||
|
|
algorithms•Minimum Time to Complete All Deliveries@AQÊà minimum-time-to-complete-all-deliveriesNull]ŸO ! EE
|
|||
|
|
algorithms‰Longest Balanced Subarray II@@Þ«@ longest-balanced-subarray-iiNull[ŸM ! CC
|
|||
|
|
algorithms‡Longest Balanced Subarray I@Pi›à longest-balanced-subarray-iNullsŸL ! [[
|
|||
|
|
algorithms Maximum Bitwise XOR After Rearrangement@Q¾å maximum-bitwise-xor-after-rearrangementNulloŸJ ! WW
|
|||
|
|
algorithmsŒMinimum Operations to Transform Array@C»¦À minimum-operations-to-transform-arrayNullIŸI ! 11
|
|||
|
|
algorithmsmClimbing Stairs II@P ‰` climbing-stairs-iiNull`ŸG ! II
|
|||
|
|
algorithmsqCompute Decimal Representation@P+I€ compute-decimal-representationNull�3ŸE! ��
|
|||
|
|
algorithms–Lexicographically Smallest Palindromic Permutation Greater Than Target@8Ó lexicographically-smallest-palindromic-permutation-greater-than-targetNulliŸD ! QQ
|
|||
|
|
algorithmsXSum of Weighted Modes in Subarrays@K8e sum-of-weighted-modes-in-subarraysNullUŸC ! ==
|
|||
|
|
algorithms~Maximum Partition Factor@?"
|
|||
|
|
@ maximum-partition-factorNullŸA ! gg
|
|||
|
|
algorithmsvLongest Subsequence With Non-Zero Bitwise XOR@B˜ƒ€ longest-subsequence-with-non-zero-bitwise-xorNull�)Ÿ@! ��
|
|||
|
|
algorithmsñLongest Strictly Increasing Subsequence With Non-Zero Bitwise AND@IP‰À longest-strictly-increasing-subsequence-with-non-zero-bitwise-andNullcŸ> ! KK
|
|||
|
|
algorithmsŸMaximize Cyclic Partition Score@)Mq` maximize-cyclic-partition-scoreNull\Ÿ= ! EE
|
|||
|
|
algorithmsSSort Array By Absolute Value@U§^ sort-array-by-absolute-valueNull_Ÿ; ! GG
|
|||
|
|
algorithmsfNumber of Stable Subsequences@N�@ number-of-stable-subsequencesNull
|
|||
|
|
ã ¤@Ôn
|
|||
|
|
¦
|
|||
|
|
6 µ N ú Œ )
|
|||
|
|
³
|
|||
|
|
S ´ )±Iã cŸ8 ! KK
|
|||
|
|
algorithmsMinimum Cost to Split into Ones@Tδ minimum-cost-to-split-into-onesNulleŸ7 ! MM
|
|||
|
|
algorithms]Count Binary Palindromic Numbers@@êÑ count-binary-palindromic-numbersNulluŸ6 ! ]]
|
|||
|
|
algorithms²Minimum Operations to Equalize Subarrays@3‡‚` minimum-operations-to-equalize-subarraysNull�Ÿ5 ! oo
|
|||
|
|
algorithmsnDistinct Points Reachable After Substring Removal@JêÍ€ distinct-points-reachable-after-substring-removalNull�Ÿ4! ��
|
|||
|
|
algorithmsˆLexicographically Smallest Permutation Greater Than Target@:†:@ lexicographically-smallest-permutation-greater-than-targetNull]Ÿ3 ! EE
|
|||
|
|
algorithmswRemove K-Balanced Substrings@@;ë@ remove-k-balanced-substringsNullsŸ2 ! [[
|
|||
|
|
algorithmsÀMinimum Moves to Balance Circular Array@D@ minimum-moves-to-balance-circular-arrayNull`Ÿ1 ! II
|
|||
|
|
algorithmsNFilter Characters by Frequency@U¼Q` filter-characters-by-frequencyNullkŸ/ ! SS
|
|||
|
|
algorithmsrSplit Array With Minimum Difference@@Î7€ split-array-with-minimum-differenceNullQŸ- ! 99
|
|||
|
|
algorithms
|
|||
|
|
Merge Close Characters@K‡À merge-close-charactersNulldŸ, ! MM
|
|||
|
|
algorithmscEarliest Time to Finish One Task@U AÀ earliest-time-to-finish-one-taskNull~Ÿ+ ! gg
|
|||
|
|
algorithms^Smallest Absent Positive Greater Than Average@A»€ smallest-absent-positive-greater-than-averageNullmŸ* ! UU
|
|||
|
|
algorithmsoMaximize Alternating Sum Using Swaps@Pœà maximize-alternating-sum-using-swapsNullpŸ) ! YY
|
|||
|
|
algorithmshBitwise OR of Even Numbers in an Array@U6.@ bitwise-or-of-even-numbers-in-an-arrayNullRŸ( ! ;;
|
|||
|
|
algorithmsTRestore Finishing Order@VïÀ restore-finishing-orderNullcŸ' ! KK
|
|||
|
|
algorithmskMaximum Total Subarray Value II@61Ú maximum-total-subarray-value-iiNulliŸ& ! QQ
|
|||
|
|
algorithmsHDetermine if a Simple Graph Exists@H9 ` determine-if-a-simple-graph-existsNullaŸ% ! II
|
|||
|
|
algorithmsiMaximum Total Subarray Value I@PD` maximum-total-subarray-value-iNullYŸ# ! AA
|
|||
|
|
algorithms|Longest Fibonacci Subarray@Q`ªà longest-fibonacci-subarrayNull
|
|||
|
|
u ˆš
|
|||
|
|
Õ
|
|||
|
|
k ë ‹ / Í o %
|
|||
|
|
¿
|
|||
|
|
^
|
|||
|
|
u Š §Wß gŸ QQ
|
|||
|
|
database:Find Books with Polarized Opinions@Dõ|€ find-books-with-polarized-opinionsNulluŸ" ! ]]
|
|||
|
|
algorithmsCount Subarrays With K Distinct Integers@2ßl€ count-subarrays-with-k-distinct-integersNullMŸ ! 55
|
|||
|
|
algorithms\Count Bowl Subarrays@HúÀ count-bowl-subarraysNullqŸ ! YY
|
|||
|
|
algorithms[Minimum Operations to Transform String@Nò” minimum-operations-to-transform-stringNulllŸ ! UU
|
|||
|
|
algorithmsZMinimum Operations to Equalize Array@Np` minimum-operations-to-equalize-arrayNullzŸ ! cc
|
|||
|
|
algorithmsdMaximize Sum of At Most K Distinct Elements@S0e maximize-sum-of-at-most-k-distinct-elementsNullTŸ ! ==
|
|||
|
|
algorithmsJGCD of Odd and Even Sums@U6f@ gcd-of-odd-and-even-sumsNull^Ÿ ! GG
|
|||
|
|
algorithmsOFind The Least Frequent Digit@Qqt find-the-least-frequent-digitNullcŸ ! KK
|
|||
|
|
algorithms9Longest Semi-Repeating Subarray@PI longest-semi-repeating-subarrayNullGŸ ! //
|
|||
|
|
algorithms`Generate Schedule@7ÿÀ generate-scheduleNull[Ÿ ! CC
|
|||
|
|
algorithmsaMaximum XOR of Subsequences@I¯s@ maximum-xor-of-subsequencesNull_Ÿ ! GG
|
|||
|
|
algorithmsWSum of Beautiful Subsequences@?€r@ sum-of-beautiful-subsequencesNullYŸ ! AA
|
|||
|
|
algorithms?Maximum Weight in Two Bags@Lîþ@ maximum-weight-in-two-bagsNull]Ÿ ! EE
|
|||
|
|
algorithmsžMaximum Path Score in a Grid@BIE maximum-path-score-in-a-gridNull}Ÿ ! ee
|
|||
|
|
algorithmsRMinimum Operations to Equalize Binary String@F¡Ä@ minimum-operations-to-equalize-binary-stringNullgŸ ! OO
|
|||
|
|
algorithmsMMaximum Walls Destroyed by Robots@:€ maximum-walls-destroyed-by-robotsNull=Ÿ
|
|||
|
|
! %%
|
|||
|
|
algorithmsLJump Game IX@7è3 jump-game-ixNull�Ÿ ! ii
|
|||
|
|
algorithmsDBest Time to Buy and Sell Stock using Strategy@MêÝ` best-time-to-buy-and-sell-stock-using-strategyNullqŸ ! YY
|
|||
|
|
algorithmsKPartition Array Into K-Distinct Groups@G‰J@ partition-array-into-k-distinct-groupsNullwŸ ! __
|
|||
|
|
algorithmsGXOR After Range Multiplication Queries II@B¥À xor-after-range-multiplication-queries-iiNulluŸ ! ]]
|
|||
|
|
algorithmsEXOR After Range Multiplication Queries I@RxMÀ xor-after-range-multiplication-queries-iNull
|
|||
|
|
o š6ð}!
|
|||
|
|
Å
|
|||
|
|
}
|
|||
|
|
/ Ëo q
|
|||
|
|
¿
|
|||
|
|
9 ¿ 6¸ãQ qžy [[
|
|||
|
|
database!Find Students with Study Spiral Pattern@=dñ find-students-with-study-spiral-patternNullkŸ UU
|
|||
|
|
database*Find Stores with Inventory Imbalance@GÚ ` find-stores-with-inventory-imbalanceNulldŸ ! MM
|
|||
|
|
algorithms;Flip Square Submatrix Vertically@R:Ûà flip-square-submatrix-verticallyNull{Ÿ ! cc
|
|||
|
|
algorithms/Sort Threats by Severity and Exploitability@OÙ†À sort-threats-by-severity-and-exploitabilityNull�ž ! mm
|
|||
|
|
algorithms3Earliest Finish Time for Land and Water Rides II@A‰ç earliest-finish-time-for-land-and-water-rides-iiNullwž~ ! __
|
|||
|
|
algorithmsFMinimum Sum After Divisible Sum Deletions@GDå minimum-sum-after-divisible-sum-deletionsNull�ž} ! kk
|
|||
|
|
algorithms1Earliest Finish Time for Land and Water Rides I@Nä<` earliest-finish-time-for-land-and-water-rides-iNullYž| ! AA
|
|||
|
|
algorithmstNumber of ZigZag Arrays II@LÎÖ` number-of-zigzag-arrays-iiNullSž{ ! ;;
|
|||
|
|
algorithmsANumber of Perfect Pairs@@Ç“@ number-of-perfect-pairsNullWžz ! ??
|
|||
|
|
algorithmssNumber of ZigZag Arrays I@@: number-of-zigzag-arrays-iNullažx ! II
|
|||
|
|
algorithms Number of Student Replacements@U˜[ number-of-student-replacementsNull{žw ! cc
|
|||
|
|
algorithms=Maximum Total from Optimal Activation Order@@‡w maximum-total-from-optimal-activation-orderNullgžv ! OO
|
|||
|
|
algorithms2Minimum Removals to Balance Array@Gî± minimum-removals-to-balance-arrayNullcžu ! KK
|
|||
|
|
algorithmsƒSum of Perfect Square Ancestors@EOb` sum-of-perfect-square-ancestorsNullEžt ! --
|
|||
|
|
algorithms8Trionic Array II@GªŠ` trionic-array-iiNullYžs ! AA
|
|||
|
|
algorithms4Threshold Majority Queries@5Æa threshold-majority-queriesNullYžr ! AA
|
|||
|
|
algorithms6Maximum Balanced Shipments@N$À maximum-balanced-shipmentsNullpžq ! YW
|
|||
|
|
algorithms_ Minimum Discards to Balance Inventory@An> minimum-discards-to-balance-inventoryNullCžp ! ++
|
|||
|
|
algorithms5Trionic Array I@HÄ8@ trionic-array-inotacažo ! II
|
|||
|
|
algorithms>Next Special Palindrome Number@;óÈ next-special-palindrome-numberNullcžn ! KK
|
|||
|
|
algorithms<Maximum K to Sort a Permutation@B¢® maximum-k-to-sort-a-permutationNull
|
|||
|
|
�.ÄL
|
|||
|
|
¿
|
|||
|
|
p
|
|||
|
|
4 Ô E ë q
|
|||
|
|
à_Ù
|
|||
|
|
z
|
|||
|
|
ž 8«1 [ž\ EE
|
|||
|
|
databaseFind COVID Recovery Patients@D®<` find-covid-recovery-patientsNullwžf aa
|
|||
|
|
databaseFind Drivers with Improved Fuel Efficiency@G ZÀ find-drivers-with-improved-fuel-efficiencyNullUžg ??
|
|||
|
|
databaseFind Overbooked Employees@F~Ä find-overbooked-employeesNullwžm ! __
|
|||
|
|
algorithmsMinimum Number of Primes to Sum to Target@Mß_ minimum-number-of-primes-to-sum-to-targetNull� žl ! qq
|
|||
|
|
algorithms,Maximum Number of Subsequences After One Inserting@?ÈG@ maximum-number-of-subsequences-after-one-insertingNullcžk ! KK
|
|||
|
|
algorithmsUBalanced K-Factor Decomposition@D0 balanced-k-factor-decompositionNullwžj ! __
|
|||
|
|
algorithms«Find Maximum Balanced XOR Subarray Length@Ih� find-maximum-balanced-xor-subarray-lengthNull_ži ! GG
|
|||
|
|
algorithms@Minimum Sensors to Cover Grid@Q+¾À minimum-sensors-to-cover-gridNullcžh ! KK
|
|||
|
|
algorithms7Minimum Time to Activate String@Hœ[ minimum-time-to-activate-stringNull�
|
|||
|
|
že ! uu
|
|||
|
|
algorithms(Number of Integers With Popcount-Depth Equal to K II@MÂ{€ number-of-integers-with-popcount-depth-equal-to-k-iiNullwžc ! __
|
|||
|
|
algorithms Process String with Special Operations II@0î process-string-with-special-operations-iiNullWžb ! ??
|
|||
|
|
algorithmsQTwisted Mirror Path Count@H € twisted-mirror-path-countNull� ža ! ss
|
|||
|
|
algorithms%Number of Integers With Popcount-Depth Equal to K I@6jÐ@ number-of-integers-with-popcount-depth-equal-to-k-iNull]ž` ! EE
|
|||
|
|
algorithms"Split Array by Prime Indices@H©û split-array-by-prime-indicesNull9ž_ ! !!
|
|||
|
|
algorithms Once Twice@S once-twiceNullLž^ ! 77
|
|||
|
|
algorithmsCoupon Code Validator@P>• coupon-code-validatorac� ž] ! qq
|
|||
|
|
algorithms-Minimum Jumps to Reach End via Prime Teleportation@?Û7 minimum-jumps-to-reach-end-via-prime-teleportationNulluž[ ! ]]
|
|||
|
|
algorithms Process String with Special Operations I@P>°À process-string-with-special-operations-iNullgžZ ! OO
|
|||
|
|
algorithms Longest Palindromic Path in Graph@68@ longest-palindromic-path-in-graphNull_žY ! GG
|
|||
|
|
algorithms0Subarrays with XOR at Least K@E:) subarrays-with-xor-at-least-kNullmžX ! UU
|
|||
|
|
algorithmsjSplit and Merge Array Transformation@MTD split-and-merge-array-transformationNull
|
|||
|
|
' ·]ñ{'
|
|||
|
|
š
|
|||
|
|
! » D µ &
|
|||
|
|
©
|
|||
|
|
O å’ s ‹ hžF SS
|
|||
|
|
database
|
|||
|
|
òFind Books with No Available Copies@J¶î find-books-with-no-available-copiesNullmžQ WW
|
|||
|
|
database
|
|||
|
|
üFind Consistently Improving Employees@KØI` find-consistently-improving-employeesNull�žW ! mm
|
|||
|
|
algorithmsMinimum Cost Path with Alternating Directions II@FVb minimum-cost-path-with-alternating-directions-iiNull�žU ! kk
|
|||
|
|
algorithms Minimum Cost Path with Alternating Directions I@Q”Q@ minimum-cost-path-with-alternating-directions-iNull^žT ! GG
|
|||
|
|
algorithms
|
|||
|
|
ýCount Odd Letters from Number@UYN` count-odd-letters-from-numberNulložR ! WW
|
|||
|
|
algorithmsMinimum Moves to Reach Target in Grid@-ÒlÀ minimum-moves-to-reach-target-in-gridNullgžP ! OO
|
|||
|
|
algorithmsMinimum Stability Factor of Array@4ZüÀ minimum-stability-factor-of-arrayNullWžO ! ??
|
|||
|
|
algorithms$Network Recovery Pathways@=êþ network-recovery-pathwaysNullzžN ! cc
|
|||
|
|
algorithms&Check Divisibility by Digit Sum and Product@Qg¾ check-divisibility-by-digit-sum-and-productNull� žL ! ss
|
|||
|
|
algorithmsMinimum Time to Reach Destination in Directed Graph@F¹ß@ minimum-time-to-reach-destination-in-directed-graphNull� žK ! ss
|
|||
|
|
algorithmsVMaximum Product of Two Integers With No Common Bits@.Fû maximum-product-of-two-integers-with-no-common-bitsNulltžJ ! ]]
|
|||
|
|
algorithmsCheck if Any Element Has Prime Frequency@OH@ check-if-any-element-has-prime-frequencyNullcžI ! KK
|
|||
|
|
algorithmsPartition Array to Minimize XOR@D”?à partition-array-to-minimize-xorNullvžH ! __
|
|||
|
|
algorithmsHexadecimal and Hexatrigesimal Conversion@T.Wà hexadecimal-and-hexatrigesimal-conversionNulldžG ! MM
|
|||
|
|
algorithms
|
|||
|
|
óFind the Shortest Superstring II@HSï find-the-shortest-superstring-iiNullwžE ! __
|
|||
|
|
algorithms Minimum Increments to Equalize Leaf Paths@D•À minimum-increments-to-equalize-leaf-pathsNullsžD ! [[
|
|||
|
|
algorithmsMinimum Time for K Connected Components@F›½ minimum-time-for-k-connected-componentsNulližC ! QQ
|
|||
|
|
algorithmsCount Prime-Gap Balanced Subarrays@6ŠçÀ count-prime-gap-balanced-subarraysNullWžB ! ??
|
|||
|
|
algorithmsKth Smallest Path XOR Sum@<üî` kth-smallest-path-xor-sumNullFžA ! /-
|
|||
|
|
algorithms
|
|||
|
|
Partition String @M`! partition-stringNull
|
|||
|
|
‡ ¨ Ím
|
|||
|
|
û
|
|||
|
|
�
|
|||
|
|
+ ‡ 6 Ó 7
|
|||
|
|
½
|
|||
|
|
Zñ þ ” ÁE gž3 QQ
|
|||
|
|
database
|
|||
|
|
âFind Category Recommendation Pairs@O\% find-category-recommendation-pairsNullQž: ;;
|
|||
|
|
database
|
|||
|
|
ìSeasonal Sales Analysis@NÌÀ seasonal-sales-analysisNullyž@ ! aa
|
|||
|
|
algorithmsMinimum Adjacent Swaps to Alternate Parity@E#T minimum-adjacent-swaps-to-alternate-parityNullKž? ! 33
|
|||
|
|
algorithmsInverse Coin Change@Iʶ` inverse-coin-changeNull�ž> ! ii
|
|||
|
|
algorithmsMaximize Spanning Tree Stability with Upgrades@P¯› maximize-spanning-tree-stability-with-upgradesNullgž< ! OO
|
|||
|
|
algorithmsFind Weighted Median Node in Tree@:4Ï@ find-weighted-median-node-in-treeNullYž; ! AA
|
|||
|
|
algorithms
|
|||
|
|
íSequential Grid Path Cover@MÔ'à sequential-grid-path-coverNull`ž9 ! GG
|
|||
|
|
algorithms)Count Number of Trapezoids II@D�À count-number-of-trapezoids-iinotacwž8 ! __
|
|||
|
|
algorithms
|
|||
|
|
Minimum Time to Transport All Individuals@< minimum-time-to-transport-all-individualsNull�ž6
|
|||
|
|
! �y
|
|||
|
|
algorithms
|
|||
|
|
ôMaximize Y‑Sum by Picking a Triplet of Distinct X‑Values@O�@ maximize-ysum-by-picking-a-triplet-of-distinct-xvaluesNull`ž5 ! II
|
|||
|
|
algorithms
|
|||
|
|
þGenerate Tag for Video Caption@@, generate-tag-for-video-captionNullgž4 ! OO
|
|||
|
|
algorithms
|
|||
|
|
õBest Time to Buy and Sell Stock V@N[ó` best-time-to-buy-and-sell-stock-vNull�ž2 ! oo
|
|||
|
|
algorithms
|
|||
|
|
ãSmallest Subarray to Sort in Every Sliding Window@Mª smallest-subarray-to-sort-in-every-sliding-windowNullož1 ! WW
|
|||
|
|
algorithmsCMinimum Cost Path with Teleportations@FÚ�à minimum-cost-path-with-teleportationsNull[ž0 ! CC
|
|||
|
|
algorithms
|
|||
|
|
öMaximize Subarray GCD Score@8ÒƒÀ maximize-subarray-gcd-scoreNullož/ ! WW
|
|||
|
|
algorithmsBMinimum Cost Path with Edge Reversals@Ní minimum-cost-path-with-edge-reversalsNull]ž. ! EE
|
|||
|
|
algorithms'Count Number of Trapezoids I@Hk count-number-of-trapezoids-iNullOž- ! 99
|
|||
|
|
algorithms
|
|||
|
|
ÿCount Special Triplets@GŽå€ count-special-tripletsac�ž, ! mm
|
|||
|
|
algorithms
|
|||
|
|
ïMinimum Absolute Difference in Sliding Submatrix@Q4½` minimum-absolute-difference-in-sliding-submatrixNullUž+ ! ==
|
|||
|
|
algorithms
|
|||
|
|
ÝMultiply Two Polynomials@N+€ multiply-two-polynomialsNull
|
|||
|
|
Ì sÌìQ
|
|||
|
|
ë
|
|||
|
|
l ü n û ‡ +
|
|||
|
|
¹
|
|||
|
|
i ç x ª4 ež OO
|
|||
|
|
database
|
|||
|
|
ÁFind Product Recommendation Pairs@N´ƒ@ find-product-recommendation-pairsNullsž* ! [[
|
|||
|
|
algorithms.Partition Array for Maximum XOR and AND@1™Ï partition-array-for-maximum-xor-and-andNullcž) ! KK
|
|||
|
|
algorithms Minimize Maximum Component Cost@E¹€ minimize-maximum-component-costNullež( ! MM
|
|||
|
|
algorithms
|
|||
|
|
ÔMinimum Time to Visit All Houses@QN1` minimum-time-to-visit-all-housesNulllž' ! UU
|
|||
|
|
algorithms
|
|||
|
|
èFind Minimum Log Transportation Cost@E1` find-minimum-log-transportation-costNullž& ! gg
|
|||
|
|
algorithms
|
|||
|
|
ñMaximize Count of Distinct Primes After Split@2~V` maximize-count-of-distinct-primes-after-splitNullMž% ! 55
|
|||
|
|
algorithmsPTwo-Letter Card Game@(µ%À two-letter-card-gameNullož$ ! WW
|
|||
|
|
algorithms
|
|||
|
|
øTransform Array to All Equal Elements@@ˆíÀ transform-array-to-all-equal-elementsNullYž# ! AA
|
|||
|
|
algorithms
|
|||
|
|
÷Maximum Good Subtree Score@F³O maximum-good-subtree-scoreNullqž! ! YY
|
|||
|
|
algorithmseSubsequence Sum After Capping Elements@967@ subsequence-sum-after-capping-elementsNullpž ! YY
|
|||
|
|
algorithms
|
|||
|
|
ÕFind Most Frequent Vowel and Consonant@VVbà find-most-frequent-vowel-and-consonantNull�
|
|||
|
|
ž ! ss
|
|||
|
|
algorithms
|
|||
|
|
ÙMinimum Deletions for At Most K Distinct Characters@R>’€ minimum-deletions-for-at-most-k-distinct-charactersNullmž ! UU
|
|||
|
|
algorithms
|
|||
|
|
ðMinimum Moves to Clean the Classroom@:Œ4À minimum-moves-to-clean-the-classroomNull|ž ! ee
|
|||
|
|
algorithms
|
|||
|
|
ÞSmallest Index With Digit Sum Equal to Index@TŸ` smallest-index-with-digit-sum-equal-to-indexNullcž ! KK
|
|||
|
|
algorithmsFind Maximum Area of a Triangle@=,Ç find-maximum-area-of-a-triangleNull�ž !
|
|||
|
|
algorithms
|
|||
|
|
ëLexicographically Smallest String After Adjacent Removals@1GS€ lexicographically-smallest-string-after-adjacent-removalsNull�ž ! kk
|
|||
|
|
algorithms
|
|||
|
|
ûMinimum Steps to Convert String with Operations@E|Ë` minimum-steps-to-convert-string-with-operationsNull� ž ! ss
|
|||
|
|
algorithms
|
|||
|
|
ùCount the Number of Computer Unlocking Permutations@M~a count-the-number-of-computer-unlocking-permutationsac
|
|||
|
|
® Ž ”®8
|
|||
|
|
Ú
|
|||
|
|
U å T É w
|
|||
|
|
Š
|
|||
|
|
8 × _ág bž MK
|
|||
|
|
database
|
|||
|
|
©Analyze Subscription Conversion @R‡w analyze-subscription-conversionNullQž ! 99
|
|||
|
|
algorithmsPower Grid Maintenance@L%6À power-grid-maintenanceNullwž ! __
|
|||
|
|
algorithms
|
|||
|
|
ÆRange XOR Queries with Subarray Reversals@O�éà range-xor-queries-with-subarray-reversalsNull{ž ! cc
|
|||
|
|
algorithms
|
|||
|
|
ÀMinimum Threshold for Inversion Pairs Count@KfÞà minimum-threshold-for-inversion-pairs-countNulluž ! ]]
|
|||
|
|
algorithms
|
|||
|
|
éResulting String After Adjacent Removals@LSf@ resulting-string-after-adjacent-removalsNull^ž ! GG
|
|||
|
|
algorithms
|
|||
|
|
ÐMaximum Product of Two Digits@QR�à maximum-product-of-two-digitsNullOž ! 77
|
|||
|
|
algorithms
|
|||
|
|
ØSubtree Inversion Sum@F
|
|||
|
|
�À subtree-inversion-sumNull� ž ! qq
|
|||
|
|
algorithms
|
|||
|
|
åFind Maximum Number of Non Intersecting Substrings@>}’` find-maximum-number-of-non-intersecting-substringsNull]ž ! EE
|
|||
|
|
algorithms
|
|||
|
|
×Maximum Weighted K-Edge Path@3èyà maximum-weighted-k-edge-pathNullOž ! 77
|
|||
|
|
algorithms
|
|||
|
|
·Make a Positive Array@A€ make-a-positive-arrayNull�ž ! oo
|
|||
|
|
algorithms
|
|||
|
|
êMaximum Profit from Trading Stocks with Discounts@Lež maximum-profit-from-trading-stocks-with-discountsNull�
|
|||
|
|
ž
|
|||
|
|
! uu
|
|||
|
|
algorithms
|
|||
|
|
áMinimum Weighted Subgraph With the Required Paths II@HáL@ minimum-weighted-subgraph-with-the-required-paths-iiNullmž ! UU
|
|||
|
|
algorithms
|
|||
|
|
ÎPath Existence Queries in a Graph II@:=M€ path-existence-queries-in-a-graph-iiNull�ž ! ii
|
|||
|
|
algorithms
|
|||
|
|
ÓFind Sum of Array Product of Magical Sequences@Nôhà find-sum-of-array-product-of-magical-sequencesNull[ž
|
|||
|
|
! CC
|
|||
|
|
algorithms
|
|||
|
|
ÜEqual Sum Grid Partition II@5¶LÀ equal-sum-grid-partition-iiNullYž ! AA
|
|||
|
|
algorithms
|
|||
|
|
ÚEqual Sum Grid Partition I@E#Æ equal-sum-grid-partition-iNulliž ! QQ
|
|||
|
|
algorithms
|
|||
|
|
ßMinimum Swaps to Sort by Digit Sum@I;X@ minimum-swaps-to-sort-by-digit-sumNull�
|
|||
|
|
ž ! ss
|
|||
|
|
algorithms
|
|||
|
|
¸Minimum Operations to Make Array Sum Divisible by K@W minimum-operations-to-make-array-sum-divisible-by-kNullož ! WW
|
|||
|
|
algorithms
|
|||
|
|
ÛMaximum Sum of Edge Values in a Graph@Aå•` maximum-sum-of-edge-values-in-a-graphNull
|
|||
|
|
à ²%ÝÃu(
|
|||
|
|
Ò
|
|||
|
|
c ë ^ Ó † &
|
|||
|
|
¸
|
|||
|
|
J ò ˜ ›% _�t II
|
|||
|
|
database
|
|||
|
|
šAnalyze Organization Hierarchy@MÞ9À analyze-organization-hierarchyNullsž ! [[
|
|||
|
|
algorithms
|
|||
|
|
æNumber of Ways to Assign Edge Weights I@J— à number-of-ways-to-assign-edge-weights-iNull�ž ! ii
|
|||
|
|
algorithms
|
|||
|
|
îPartition Array into Two Equal Product Subsets@A�^ partition-array-into-two-equal-product-subsetsNulluž ! ]]
|
|||
|
|
algorithms
|
|||
|
|
çNumber of Ways to Assign Edge Weights II@M»Ø@ number-of-ways-to-assign-edge-weights-iiNullWž ! ??
|
|||
|
|
algorithms
|
|||
|
|
ÍConcatenated Divisibility@>�U concatenated-divisibilityNullUž ! ==
|
|||
|
|
algorithms
|
|||
|
|
ÅFind X Value of Array II@>Ž¹ find-x-value-of-array-iiNullk� ! SS
|
|||
|
|
algorithms
|
|||
|
|
¨Maximize Score After Pair Deletions@JTï@ maximize-score-after-pair-deletionsNullk�~ ! SS
|
|||
|
|
algorithms
|
|||
|
|
ÌPath Existence Queries in a Graph I@K§æÀ path-existence-queries-in-a-graph-iNull]�} ! EE
|
|||
|
|
algorithms
|
|||
|
|
àGrid Teleportation Traversal@7T0à grid-teleportation-traversalNullJ�| ! 33
|
|||
|
|
algorithms
|
|||
|
|
£Phone Number Prefix@Q¢NÀ phone-number-prefixNull��{ ! qq
|
|||
|
|
algorithms
|
|||
|
|
úCount Partitions With Max-Min Difference at Most K@Md, count-partitions-with-max-min-difference-at-most-kac� �z ! qq
|
|||
|
|
algorithms
|
|||
|
|
ÖMinimum Operations to Convert All Elements to Zero@Jz÷@ minimum-operations-to-convert-all-elements-to-zeroNullu�y ! ]]
|
|||
|
|
algorithms
|