templates.md

Algorithm templates

• Arrays
  • Binary search
  • Monotonic stack
  • Sliding window
  • Two pointers
  • Sorting
  • Prefix sum
  • Difference array
• Data structures
  • Heap and priority queue
  • Linked list
  • Binary tree
  • AVL tree
  • Red-black tree
  • Trie
  • Union-find
  • Fenwick tree
  • Segment tree
• Graph theory
  • Graph representations
  • Depth-first search
  • Breadth-first search
  • Shortest path
  • Topological sort
  • Cycles
• Binary operations
  • Highest set bit
  • Lowest set bit
  • XOR
  • Submask enumeration
• Dynamic programming
  • Palindrome partitioning
  • Digit DP
  • Subsequence DP
• Backtracking
  • N-queens
  • Permutations and combinations
• Mathematics
  • Fermat's theorem on sums of two squares
  • Combinations
  • Primes
  • Geometry
  • Harmonic series
• Strings
  • Palindromes
  • KMP algorithm
• Other techniques
  • Skip list
  • LRU cache
  • LFU cache
  • Doubling
  • log trick
  • Work backward when the forward approach is difficult

max(ceil(cnt/2), max_c)

Conclusion: Take the maximum of the largest frequency and half the total count rounded up.