Pan's algorithm notes
Ctrlk
  • Introduction
  • My Notes
    • Introduction
    • Content table
    • 1 Sliding window
    • 2 Rotated Arrays
    • 3 Permutation & Combination
    • 4 Palindrome
    • 5 Quick Sort + Partition
    • 6 Matrix
    • 7 Subarrays (prefix sum)
    • 8 Intervals
    • 9 Stocks
    • 10 2,3,4 Sums
    • 11 backpacks
    • 12 graph (BFS)
    • 13 line sweep
    • 14 merge sort
    • 15 Math
    • 16 two pointers - other
    • 17 Binary Search
    • 18 LinkedList
    • 19 left to right to left get best
    • 20 finding missing
    • 21 DP
    • 22 Data Structure (stack & queue --“dek”)
    • 23 Heap
    • 24 Union Find (Disjoint Set)
    • 25 Trie and N-ary Tree
    • 26 Tree
    • 27 Segment Tree or BIT
    • 28 Hash Table or Set
    • 29 Search(dfs) and BackTrack
    • 30 DFS (recursion)
    • 31 Bit Manipulation
    • 32 String
    • 33 单调栈
    • 34 贪心 Greedy
    • 35 Arrays
      • 1887 Reduction Operations to Make the Array Elements Equal
    • other
    • Design
    • 面经
  • 公司
    • Time line
    • Amazon 2017-04
    • Snapchat 2017-04
    • Uber 2017 -06
    • Facebook 2017-06
    • Microsoft 2017-07
    • LinkedIn 2019 -01
    • Micorsoft 2019-02
    • JPMorgan 2019-02
    • Cisco 2019-02
    • Dropbox 2019-02
    • Yahoo 2019-02
    • VMware 2019-02
    • Airbnb 2019-02
    • TikTok
  • Templates
    • 1 Sorting模板
    • 2 2分template
    • 3 树的模板
    • 4 链表基础模板
    • 5 去重基本方法
    • 6 其他常用snipets
    • 8 clarify questions
    • 9 Bit Manipulation 常用公式
    • 10 Common Complexities
    • 11 OOD
    • 12 System Design
    • 13 Testing
    • 14 other notes
    • 15 常用数学运算
    • 16 Other stuffs
    • 17 Questions to company
    • 18 Restful Webservices
    • 19 Network stuff
    • 20 Behavior Questions
    • 21 Java 语法注意点
Powered by GitBook
On this page

Was this helpful?

  1. My Notes

35 Arrays

真的可以sort的:

1887 Reduction Operations to Make the Array Elements Equal

Previous1663 Smallest String With A Given Numeric ValueNext1887 Reduction Operations to Make the Array Elements Equal

Last updated 2 years ago

Was this helpful?