3587. 最小相邻交换次数使奇偶性交替
Medium | Array, Greedy
Medium | Array, Greedy
Medium | Array, Hash Table, Math, Greedy, Geometry, Enumeration
Hard | Binary Search, Greedy, Union-Find, Graph Theory, Minimum Spanning Tree
Hard | Array, Math, Binary Search, Greedy, Segment Tree, Number Theory
Medium | Array, Math, Greedy, Sorting, Game Theory
Medium | String, Dynamic Programming, Greedy, Prefix Sum
Hard | Array, Math, Greedy, Bit Manipulation, Enumeration
Easy | Array, Two Pointers, Binary Search, Greedy, Sorting
Medium | Array, Two Pointers, Binary Search, Greedy, Sorting
Medium | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack
Medium | Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue)
Medium | String, Greedy
Medium | Array, Math, Greedy
Hard | Array, Math, Greedy, Bit Manipulation
Easy | Array, Hash Table, Greedy, Sorting
Medium | Array, Greedy
Hard | Array, Greedy, Segment Tree, Heap (Priority Queue)
Hard | Array, Greedy, Union-Find, Sorting
Medium | Hash Table, String, Greedy, Counting, Enumeration
Medium | Math, Greedy