Home

188. Best Time to Buy and Sell Stock IV

948. Bag of Tokens

1547. Minimum Cost to Cut a Stick

DP:

300. Longest Increasing Subsequence

368. Largest Divisible Subset

1326. Minimum Number of Taps to Open to Water a Garden

1671. Minimum Number of Removals to Make Mountain Array

KMP:

1668. Maximum Repeating Substring

Stack:

402. Remove K Digits

1673. Find the Most Competitive Subsequence

PriorityQueue:

632. Smallest Range Covering Elements from K Lists

1675. Minimize Deviation in Array

Recursion:

236. Lowest Common Ancestor of a Binary Tree

1676. Lowest Common Ancestor of a Binary Tree IV

Backtracking

1593. Split a String Into the Max Number of Unique Substrings

Union find

1697. Checking Existence of Edge Length Limited Paths

Bit manipulation

421. Maximum XOR of Two Numbers in an Array

1707. Maximum XOR With an Element From Array