OJ
search
⌘Ctrlk
OJ
  • Introduction
  • Some Tips
  • strStr and Coding Style
  • Binary Search
  • Binary Tree & Divide Conquer
  • Dynamic Programming I
  • Dynamic Programming II
  • Linked List
  • Array & Numbers
  • Heap
  • Hash
  • Multiple Pointers
  • Stack
  • Breadth-first Search
  • Bit Manipulation
  • Math
  • Trie
  • Graph
  • Union Find
  • Exhaustive Search
  • String
  • Greedy
    • 1785. Minimum Elements to Add to Form a Given Sum
    • 122. Best Time to Buy and Sell Stock II
    • 45. Jump Game II
    • 55. Jump Game
    • 452. Minimum Number of Arrows to Burst Balloons
    • 871. Minimum Number of Refueling Stops
    • Task Scheduler
    • 768. Max Chunks To Make Sorted II
    • Non-overlapping Intervals
    • 670. Maximum Swap
    • Binary Tree Cameras
    • 135. Candy
    • 358. Rearrange String k Distance Apart
    • 767. Reorganize String
    • 1057. Campus Bikes
    • 936. Stamping The Sequence
    • 1296. Divide Array in Sets of K Consecutive Numbers
    • 1342. Reduce Array Size to The Half
    • 1353. Maximum Number of Events That Can Be Attended
    • 1488. Avoid Flood in The City
    • 1647. Minimum Deletions to Make Character Frequencies Unique
    • 1648. Sell Diminishing-Valued Colored Balls
    • 1665. Minimum Initial Energy to Finish Tasks
  • Design
  • Queue
gitbookPowered by GitBook
block-quoteOn this pagechevron-down

Greedy

1785. Minimum Elements to Add to Form a Given Sumchevron-right122. Best Time to Buy and Sell Stock IIchevron-right45. Jump Game IIchevron-right55. Jump Gamechevron-right452. Minimum Number of Arrows to Burst Balloonschevron-right871. Minimum Number of Refueling Stopschevron-rightTask Schedulerchevron-right768. Max Chunks To Make Sorted IIchevron-rightNon-overlapping Intervalschevron-right670. Maximum Swapchevron-rightBinary Tree Cameraschevron-right135. Candychevron-right358. Rearrange String k Distance Apartchevron-right767. Reorganize Stringchevron-right1057. Campus Bikeschevron-right936. Stamping The Sequencechevron-right1296. Divide Array in Sets of K Consecutive Numberschevron-right1342. Reduce Array Size to The Halfchevron-right1353. Maximum Number of Events That Can Be Attendedchevron-right1488. Avoid Flood in The Citychevron-right1647. Minimum Deletions to Make Character Frequencies Uniquechevron-right1648. Sell Diminishing-Valued Colored Ballschevron-right1665. Minimum Initial Energy to Finish Taskschevron-right
PreviousLicense Key Formattingchevron-leftNext1785. Minimum Elements to Add to Form a Given Sumchevron-right

Last updated 6 years ago